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.
glist :: GIsList f g as bs => Iso (f x) (g x) (HList as) (HList bs)generic-lens-core Data.Generics.Product.Internal.HList No documentation available.
tupleToList :: ListTuple tuple tuple' as bs => tuple' -> HList bsgeneric-lens-core Data.Generics.Product.Internal.HList No documentation available.
fromArcsList :: (Hashable v, Eq v) => [Arc v e] -> DGraph v egraphite Data.Graph.DGraph toArcsList :: (Hashable v, Eq v) => DGraph v e -> [Arc v e]graphite Data.Graph.DGraph Convert a DGraph to a list of Arcs discarding isolated vertices Note that because toArcsList discards isolated vertices:
fromArcsList . toArcsList /= id
fromList :: (Graph g, Hashable v, Eq v) => [(v, [(v, e)])] -> g v egraphite Data.Graph.Types Construct a graph from an adjacency list with vertices in type /v and edge attributes in e
toList :: (Graph g, Hashable v, Eq v) => g v e -> [(v, [(v, e)])]graphite Data.Graph.Types Convert a graph to an adjacency list with vertices in type v and edge attributes in e
fromEdgesList :: (Hashable v, Eq v) => [Edge v e] -> UGraph v egraphite Data.Graph.UGraph toEdgesList :: (Hashable v, Eq v) => UGraph v e -> [Edge v e]graphite Data.Graph.UGraph Convert a UGraph to a list of Edges discarding isolated vertices Note that because toEdgesList discards isolated vertices: > fromEdgesList . toEdgesList /= id
fromAscList :: HeapItem pol item => [item] -> Heap pol itemheap Data.Heap O(n). Create a Heap from a list providing its items in ascending order of priority (i. e. in the same order they will be removed from the Heap). This function is faster than fromList but not as fast as fromDescList. The precondition is not checked.
fromDescList :: HeapItem pol item => [item] -> Heap pol itemheap Data.Heap O(n). Create a Heap from a list providing its items in descending order of priority (i. e. they will be removed inversely from the Heap). Prefer this function over fromList and fromAscList, it's faster. The precondition is not checked.