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.
class Graph g =>
AdjacencyListGraph (g :: Type -> Type)graphs Data.Graph.AdjacencyList Minimal definition: source, target, and either adjacentVertices with outEdges = defaultOutEdges or outEdges
runAdjacencyList :: AdjacencyList i a -> Array i [i] -> agraphs Data.Graph.AdjacencyList No documentation available.
module Data.Graph.Class.
AdjacencyList No documentation available.
class Graph g =>
AdjacencyListGraph (g :: Type -> Type)graphs Data.Graph.Class.AdjacencyList Minimal definition: source, target, and either adjacentVertices with outEdges = defaultOutEdges or outEdges
fromList :: (AllocM m, Key k, Value v) => [(k, v)] -> m (Tree k v)haskey-btree Data.BTree.Impure Create a tree from a list.
toList :: (AllocReaderM m, Key k, Value a) => Tree k a -> m [(k, a)]haskey-btree Data.BTree.Impure Convert an impure B+-tree to a list of key-value pairs.
toList :: (AllocReaderM m, Key k, Value a) => Tree k a -> m [(k, a)]haskey-btree Data.BTree.Impure.Internal.Fold Convert an impure B+-tree to a list of key-value pairs.
fromList :: (AllocM m, Key k, Value v) => NonEmpty (k, v) -> m (NonEmptyTree k v)haskey-btree Data.BTree.Impure.NonEmpty Create a NonEmptyTree from a NonEmpty list.
toList :: (AllocReaderM m, Key k, Value v) => NonEmptyTree k v -> m (NonEmpty (k, v))haskey-btree Data.BTree.Impure.NonEmpty Convert a non-empty tree to a list of key-value pairs.
indexFromList :: [key] -> [val] -> Index key valhaskey-btree Data.BTree.Primitives.Index Create an index from key-value lists. The internal invariants of the Index data structure apply. That means there is one more value than there are keys and keys are ordered in strictly increasing order.