Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. fromAscListWithKey :: GEq k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> DMap k2 f

   dependent-map	Data.Dependent.Map

   O(n). Build a map from an ascending list in linear time with a combining function for equal keys. The precondition (input list is ascending) is not checked.

2. fromListWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> DMap k2 f

   dependent-map	Data.Dependent.Map

   O(n*log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey.

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

   fgl	Data.Graph.Inductive.Internal.Heap

   No documentation available.

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

   fgl	Data.Graph.Inductive.Internal.Queue

   No documentation available.

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

   fgl	Data.Graph.Inductive.Internal.Thread

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

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

   fgl	Data.Graph.Inductive.Query.MaxFlow2

   No documentation available.

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

   ghc-boot	GHC.Data.SizedSeq

   No documentation available.

10. clientList :: RedisCtx m f => m (f [ByteString])

    hedis	Database.Redis

    No documentation available.

Page 81 of many | Previous | Next