Hoogle Search
Within LTS Haskell 24.60 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
sop-core Data.SOP.Constraint Constrained paramorphism for a type-level list. The advantage of writing functions in terms of cpara_SList is that they are then typically not recursive, and can be unfolded statically if the type-level list is statically known.
-
sop-core Data.SOP.Sing Explicit singleton list. A singleton list can be used to reveal the structure of a type-level list argument that the function is quantified over. For every type-level list xs, there is one non-bottom value of type SList xs. Note that these singleton lists are polymorphic in the list elements; we do not require a singleton representation for them.
lengthSList :: forall k (xs :: [k]) proxy . SListI xs => proxy xs -> Intsop-core Data.SOP.Sing The length of a type-level list.
toList :: Ord a => Heap a b -> [(a, b)]fgl Data.Graph.Inductive.Internal.Heap No documentation available.
queuePutList :: [a] -> Queue a -> Queue afgl Data.Graph.Inductive.Internal.Queue No documentation available.
threadList :: Collect r c -> Split t i r -> [i] -> t -> (c, t)fgl Data.Graph.Inductive.Internal.Thread No documentation available.
threadList' :: Collect r c -> Split t i r -> [i] -> t -> (c, t)fgl Data.Graph.Inductive.Internal.Thread No documentation available.
updAdjList :: Num b => Adj (b, b, b) -> Node -> b -> Bool -> Adj (b, b, b)fgl Data.Graph.Inductive.Query.MaxFlow Given a successor or predecessor list for node u and given node v, find the label corresponding to edge (u,v) and update the flow and residual capacity of that edge's label. Then return the updated list.
ekList :: Network -> Node -> Node -> (Network, Double)fgl Data.Graph.Inductive.Query.MaxFlow2 No documentation available.
addListToSS :: SizedSeq a -> [a] -> SizedSeq aghc-boot GHC.Data.SizedSeq No documentation available.