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.

  1. cpara_SList :: All c xs => proxy c -> r ('[] :: [k]) -> (forall (y :: k) (ys :: [k]) . (c y, All c ys) => r ys -> r (y ': ys)) -> r xs

    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.

  2. data SList (a :: [k])

    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.

  3. lengthSList :: forall k (xs :: [k]) proxy . SListI xs => proxy xs -> Int

    sop-core Data.SOP.Sing

    The length of a type-level list.

  4. toList :: Ord a => Heap a b -> [(a, b)]

    fgl Data.Graph.Inductive.Internal.Heap

    No documentation available.

  5. queuePutList :: [a] -> Queue a -> Queue a

    fgl Data.Graph.Inductive.Internal.Queue

    No documentation available.

  6. threadList :: Collect r c -> Split t i r -> [i] -> t -> (c, t)

    fgl Data.Graph.Inductive.Internal.Thread

    No documentation available.

  7. threadList' :: Collect r c -> Split t i r -> [i] -> t -> (c, t)

    fgl Data.Graph.Inductive.Internal.Thread

    No documentation available.

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

  9. ekList :: Network -> Node -> Node -> (Network, Double)

    fgl Data.Graph.Inductive.Query.MaxFlow2

    No documentation available.

  10. addListToSS :: SizedSeq a -> [a] -> SizedSeq a

    ghc-boot GHC.Data.SizedSeq

    No documentation available.

Page 81 of many | Previous | Next