Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

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

    digraph Data.DiGraph

    Construct a graph from adjacency lists.

  2. 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.

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

    discrimination Data.Discrimination.Internal.WordMap

    No documentation available.

  4. module Data.DoList

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

  5. type DoList a = DoListM a ()

    do-list Data.DoList

    The type shortcut.

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

    do-list Data.DoList

    No documentation available.

  7. 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.

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

    do-list Data.DoList

    Convert from a list.

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

    do-list Data.DoList

    Convert to a list.

  10. elimList :: forall a (p :: [a] ~> Type) (s :: [a]) . Sing s -> Apply p ('[] :: [a]) -> (forall (f0 :: a) . () => Sing f0 -> forall (f1 :: [a]) . () => Sing f1 -> Apply p f1 -> Apply p (f0 ': f1)) -> Apply p s

    eliminators Data.Eliminator

    No documentation available.

Page 194 of many | Previous | Next