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.

  1. fromListWithL' :: (a -> a -> a) -> [(ByteString, a)] -> Trie a

    bytestring-trie Data.Trie.Convenience

    A variant of fromListWithL which applies the combining function strictly.

  2. fromList :: [(ByteString, a)] -> Trie a

    bytestring-trie Data.Trie.Internal

    Convert association list into a trie. On key conflict, values earlier in the list shadow later ones.

  3. toList :: Trie a -> [(ByteString, a)]

    bytestring-trie Data.Trie.Internal

    Convert trie into association list. The list is ordered according to the keys. Warning: This function suffers Bug #25.

  4. toListBy :: (ByteString -> a -> b) -> Trie a -> [b]

    bytestring-trie Data.Trie.Internal

    Convert a trie into a list using a function. Resulting values are in key-sorted order. Warning: This function suffers Bug #25.

  5. fromList :: Uniquable a => [(a, b)] -> UniqMap b

    clash-lib Clash.Data.UniqMap

    Convert a list of key-value pairs to a map.

  6. toList :: UniqMap b -> [(Unique, b)]

    clash-lib Clash.Data.UniqMap

    Convert a map to a list of unique-value pairs.

  7. fromList :: (Edge e, Ord n) => [LabeledNode n nl] -> [LabeledEdge e n el] -> Graph e n el nl

    comfort-graph Data.Graph.Comfort

    No documentation available.

  8. fromList :: Ord k => [v] -> (v -> k) -> CompactMap k v

    compactmap Data.CompactMap

    No documentation available.

  9. fromList :: forall (vec :: Type -> Type) v k . (Vector vec v, Ord k) => [v] -> (v -> k) -> CompactMap vec k v

    compactmap Data.CompactMap.Generic

    No documentation available.

  10. pattern PipeList :: Monad m => ListT m (Maybe a) -> Pipe () a u m ()

    conduino Data.Conduino

    A source is equivalent to a ListT producing a Maybe; this pattern synonym lets you treat it as such. It essentialyl wraps over toListT and fromListT.

Page 190 of many | Previous | Next