Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
fromList :: Uniquable a => [(a, b)] -> UniqMap bclash-lib Clash.Data.UniqMap Convert a list of key-value pairs to a map.
toList :: UniqMap b -> [(Unique, b)]clash-lib Clash.Data.UniqMap Convert a map to a list of unique-value pairs.
fromList :: (Edge e, Ord n) => [LabeledNode n nl] -> [LabeledEdge e n el] -> Graph e n el nlcomfort-graph Data.Graph.Comfort No documentation available.
fromList :: Ord k => [v] -> (v -> k) -> CompactMap k vcompactmap Data.CompactMap No documentation available.
-
compactmap Data.CompactMap.Generic No documentation available.
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.
fromListT :: forall (m :: Type -> Type) o i u . Monad m => ListT m (Maybe o) -> Pipe i o u m ()conduino Data.Conduino A source is essentially ListT producing a Maybe result. This converts a ListT to the source it encodes. See ZipSource for a wrapper over Pipe that gives the right Functor and Alternative instances.
toListT :: forall (m :: Type -> Type) o u . Applicative m => Pipe () o u m () -> ListT m (Maybe o)conduino Data.Conduino A source is essentially equivalent to ListT producing a Maybe result. This converts it to the ListT it encodes. See ZipSource for a wrapper over Pipe that gives the right Functor and Alternative instances.
sinkList :: forall i o u (m :: Type -> Type) . Pipe i o u m [i]conduino Data.Conduino.Combinators Sink every incoming item into a list. Note that this keeps the entire list in memory until it is all eventually read, and does no "lazy IO". It exhauts the whole stream before returning anything.
sourceList :: forall t a i u (m :: Type -> Type) . Foldable t => t a -> Pipe i a u m ()conduino Data.Conduino.Combinators Yield every item in a foldable container.