Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. decomposeList :: Ord n => DotGraph n -> [Context n]

   graphviz	Data.GraphViz.Types.Graph

   Recursively decompose the Dot graph into a list of contexts such that if (c:cs) = decomposeList dg, then dg = c & composeList cs. Note that all global attributes are lost, so this is not suitable for representing a Dot graph on its own.

2. prependList :: [a] -> Infinite a -> Infinite a

   infinite-list	Data.List.Infinite

   Prepend a list to an infinite list.

3. toList :: Infinite a -> [a]

   infinite-list	Data.List.Infinite

   Convert to a list. Use cycle to go in the opposite direction.

4. streamList :: [a] -> Stream a

   jsaddle	Data.JSString.Internal.Fusion.Common

   O(n) Convert a list into a Stream. Properties

   unstream . streamList = pack
   

5. unstreamList :: Stream a -> [a]

   jsaddle	Data.JSString.Internal.Fusion.Common

   O(n) Convert a Stream into a list. Properties

   unstreamList . stream = unpack
   

6. getChildrenList :: SelectionTree node => node -> [ChildNode node]

   morpheus-graphql-core	Data.Morpheus.Core

   Get the children

7. unsafeFromList :: IsMap k m => [(k, a)] -> m a

   morpheus-graphql-core	Data.Morpheus.Internal.Ext

   No documentation available.

8. unsafeFromList :: IsMap k m => [(k, a)] -> m a

   morpheus-graphql-core	Data.Morpheus.Internal.Utils

   No documentation available.

9. KIND_LIST :: TypeKind

   morpheus-graphql-core	Data.Morpheus.Types.Internal.AST

   No documentation available.

10. TypeList :: TypeWrapper -> Bool -> TypeWrapper

    morpheus-graphql-core	Data.Morpheus.Types.Internal.AST

    No documentation available.

Page 103 of many | Previous | Next