Hoogle Search
Within LTS Haskell 24.37 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
grisette Grisette.Internal.Core.Data.Class.PPrint Lift two pretty-printers to list of values with binary type constructors.
pformatList :: PPrint a => [a] -> Doc anngrisette Grisette.Internal.Core.Data.Class.PPrint No documentation available.
pformatList1 :: (PPrint1 f, PPrint a) => [f a] -> Doc anngrisette Grisette.Internal.Core.Data.Class.PPrint Lift the standard pretty-printer (pformatPrec, pformatList) to list of values with unary type constructors.
pformatList2 :: (PPrint2 f, PPrint a, PPrint b) => [f a b] -> Doc anngrisette Grisette.Internal.Core.Data.Class.PPrint Lift the standard pretty-printer (pformatPrec, pformatList) to list of values with binary type constructors.
toGuardedList :: UnionView u => u a -> [(SymBool, a)]grisette Grisette.Internal.Core.Data.Class.UnionView Convert the union to a guarded list.
>>> toGuardedList (mrgIf "a" (return 1) (mrgIf "b" (return 2) (return 3)) :: Union Integer) [(a,1),((&& b (! a)),2),((! (|| b a)),3)]
fromList :: (Hashable k, Ord k) => [(k, a)] -> Map k ahashmap Data.HashMap Create a map from a list of key/value pairs.
fromListWith :: (Hashable k, Ord k) => (a -> a -> a) -> [(k, a)] -> Map k ahashmap Data.HashMap Create a map from a list of key/value pairs with a combining function.
fromListWithKey :: (Hashable k, Ord k) => (k -> a -> a -> a) -> [(k, a)] -> Map k ahashmap Data.HashMap Build a map from a list of key/value pairs with a combining function.
-
hashmap Data.HashMap Convert the map to a list of key/value pairs.
fromList :: (Hashable a, Ord a) => [a] -> Set ahashmap Data.HashSet Create a set from a list of elements.