Hoogle Search
Within LTS Haskell 24.60 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
deriving-compat Data.Deriving.Internal No documentation available.
module Data.Generics.Product.
HList Derive an isomorphism between a product type and a flat HList.
class
IsList f g (as :: [Type]) (bs :: [Type]) | f -> as, g -> bsgeneric-lens Data.Generics.Product.HList No documentation available.
prependList :: [a] -> Infinite a -> Infinite ainfinite-list Data.List.Infinite Prepend a list to an infinite list.
-
infinite-list Data.List.Infinite Convert to a list. Use cycle to go in the opposite direction.
fromAList :: (Ord a, Ord b) => [(a, b)] -> Bimap a bbimap Data.Bimap O(n*log n). Build a map from a list of pairs. Unlike fromList, earlier pairs will take precedence over later ones. The name fromAList is a reference to Lisp-style association lists, where associations can be overridden by prepending new ones. Note that when duplicates occur in both the keys and in the values, fromList xs /= fromAList (reverse xs). However, if either contains no duplicates, then the equality holds. Version: 0.2.2
fromAscPairList :: (Ord a, Ord b) => [(a, b)] -> Bimap a bbimap Data.Bimap O(n). Build a bimap from a list of pairs, where both the fst and snd halves of the list are in strictly ascending order. This precondition is checked; an invalid list will cause an error. Version: 0.2.3
fromAscPairListUnchecked :: (Ord a, Ord b) => [(a, b)] -> Bimap a bbimap Data.Bimap O(n). Build a bimap from a list of pairs, where both the fst and snd halves of the list are in strictly ascending order. This precondition is not checked; an invalid list will produce a malformed bimap. Version: 0.2.3
fromList :: (Ord a, Ord b) => [(a, b)] -> Bimap a bbimap Data.Bimap O(n*log n). Build a map from a list of pairs. If there are any overlapping pairs in the list, the later ones will override the earlier ones. Version: 0.2
toAscList :: Bimap a b -> [(a, b)]bimap Data.Bimap O(n). Convert to a list of associated pairs, with the left-hand values in ascending order. Since pair ordering is lexical, the pairs will also be in ascending order. Version: 0.2