Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
trie-simple Data.Trie.Set No documentation available.
-
This library provide a brief implementation for extensible records. It is sensitive to the ordering of key-value items, but has simple type constraints and provides short compile time.
-
type-level-kv-list Data.KVList A value with type level key.
toList :: TypeMap (OfType r) -> [r]type-map Data.TypeMap.Dynamic Reduce a constant type map into a plain list of values.
toListMap :: (forall t . () => Proxy t -> Item tm t -> r) -> TypeMap tm -> [r]type-map Data.TypeMap.Dynamic Collapse a type map into a plain list of values.
toList :: TypeMap (OfType r) -> [r]type-map Data.TypeMap.Dynamic.Alt Reduce a constant type map into a plain list of values.
toListMap :: (forall t . () => Proxy t -> Item tm t -> r) -> TypeMap tm -> [r]type-map Data.TypeMap.Dynamic.Alt Collapse a type map into a plain list of values.
toList :: TypeMap (OfType r) -> [r]type-map Data.TypeMap.Internal.Dynamic Reduce a constant type map into a plain list of values.
toListMap :: (forall t . () => Proxy t -> Item tm t -> r) -> TypeMap tm -> [r]type-map Data.TypeMap.Internal.Dynamic Collapse a type map into a plain list of values.
-
type-map Data.TypeMap.Internal.List List-backed type-map.