Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. tiffanyBlue :: AlphaColour Double

   diagrams-contrib	Diagrams.Color.XKCD

   No documentation available.

2. reportAnyErrorToEmacs :: Env -> SomeException -> IO (RawValue 'Unknown)

   emacs-module	Emacs.Module.Errors

   No documentation available.

3. fromJSValueCustomMany :: MonadReader JSValue m => m (Maybe a) -> m (Maybe [a])

   fields-json	Text.JSON.FromJSValue

   Runs parser on each element of underlaying json. Returns Just iff JSON is array.

4. fromJSValueManyWithUpdate :: (MonadReader JSValue m, FromJSValueWithUpdate a, MatchWithJSValue a) => [a] -> m (Maybe [a])

   fields-json	Text.JSON.FromJSValue

   Runs parser on each element of underlying json. Returns Just iff JSON is an array. Note: This method has quadratic complexity. It is better to write less general matching algorithms that use Maps.

5. many :: P s a -> P s [a]

   frisby	Text.Parsers.Frisby

   Parse many of something. Behaves like * in regexes. This eats as much as it possibly can, if you want a minimal much rule, then use manyUntil which stops when a.

6. many1 :: P s a -> P s [a]

   frisby	Text.Parsers.Frisby

   Match one or more of something via maximal munch rule.

7. manyUntil :: P s b -> P s a -> PM s (P s [a])

   frisby	Text.Parsers.Frisby

   Parse many of something via the minimal munch rule. behaves like *? in perl regexes. The final item is not consumed.

8. nameSetAny :: (TyCon -> Bool) -> TyConSet -> Bool

   ghc-lib	GHC.Core.TyCon.Set

   No documentation available.

9. matchAny :: Graph gr => gr a b -> GDecomp gr a b

   ghc-lib	GHC.Data.Graph.Inductive.Graph

   Decompose a graph into the Context for an arbitrarily-chosen Node and the remaining Graph.

10. pattern ManyTy :: Mult

    ghc-lib	GHC.Plugins

    No documentation available.

Page 253 of many | Previous | Next