Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. toList :: DEPQ p v -> [(Int, p, v)]

   depq	Data.DEPQ

   Produce a list of (key, priority, value) triples with the entries of the DEPQ Note : the order of the output list is undefined

2. fromList :: (Eq a, Hashable a) => [(a, [a])] -> DiGraph a

   digraph	Data.DiGraph

   Construct a graph from adjacency lists.

3. unsafeFromList :: (Eq a, Hashable a) => [(a, [a])] -> DiGraph a

   digraph	Data.DiGraph

   Unsafely construct a graph from adjacency lists. This function assumes that the input includes a adjacency list of each vertex that appears in a adjacency list of another vertex. Generally, fromList should be preferred.

4. fromList :: [(Word64, v)] -> WordMap v

   discrimination	Data.Discrimination.Internal.WordMap

   No documentation available.

5. module Data.DoList

   Construct lists with do notation. For more information see https://github.com/tserduke/do-list#readme.

6. type DoList a = DoListM a ()

   do-list	Data.DoList

   The type shortcut.

7. DoList :: DoMonoidM [a] r -> DoListM a r

   do-list	Data.DoList

   No documentation available.

8. newtype DoListM a r

   do-list	Data.DoList

   DoListM is not a real instance of Monad, Applicative or Functor. It pretends being them with a phantom result type.

9. fromList :: [a] -> DoListM a r

   do-list	Data.DoList

   Convert from a list.

10. toList :: DoListM a r -> [a]

    do-list	Data.DoList

    Convert to a list.

Page 193 of many | Previous | Next