Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
xpMap :: Ord k => String -> String -> PU k -> PU v -> PU (Map k v)hxt Text.XML.HXT.Arrow.Pickle Standard pickler for maps This pickler converts a map into a list of pairs. All key value pairs are mapped to an element with name (1.arg), the key is encoded as an attribute named by the 2. argument, the 3. arg is the pickler for the keys, the last one for the values
xpMap :: Ord k => String -> String -> PU k -> PU v -> PU (Map k v)hxt Text.XML.HXT.Arrow.Pickle.Xml Standard pickler for maps This pickler converts a map into a list of pairs. All key value pairs are mapped to an element with name (1.arg), the key is encoded as an attribute named by the 2. argument, the 3. arg is the pickler for the keys, the last one for the values
concatMapT :: (a -> [[b]]) -> [[a]] -> [[b]]leancheck Test.LeanCheck concatMap over tiers
concatMapT f [ [x0, y0, z0] , [x1, y1, z1] , [x2, y2, z2] , ... ] = f x0 \/ f y0 \/ f z0 \/ ... \/ delay (f x1 \/ f y1 \/ f z1 \/ ... \/ delay (f x2 \/ f y2 \/ f z2 \/ ... \/ (delay ...)))
(cf. concatT)concatMapT :: (a -> [[b]]) -> [[a]] -> [[b]]leancheck Test.LeanCheck.Core concatMap over tiers
concatMapT f [ [x0, y0, z0] , [x1, y1, z1] , [x2, y2, z2] , ... ] = f x0 \/ f y0 \/ f z0 \/ ... \/ delay (f x1 \/ f y1 \/ f z1 \/ ... \/ delay (f x2 \/ f y2 \/ f z2 \/ ... \/ (delay ...)))
(cf. concatT)concatMapT :: (a -> [[b]]) -> [[a]] -> [[b]]leancheck Test.LeanCheck.Error concatMap over tiers
concatMapT f [ [x0, y0, z0] , [x1, y1, z1] , [x2, y2, z2] , ... ] = f x0 \/ f y0 \/ f z0 \/ ... \/ delay (f x1 \/ f y1 \/ f z1 \/ ... \/ delay (f x2 \/ f y2 \/ f z2 \/ ... \/ (delay ...)))
(cf. concatT)-
quickcheck-classes-base Test.QuickCheck.Classes.Base.IsList No documentation available.
-
quickcheck-classes-base Test.QuickCheck.Classes.Base.IsList No documentation available.
-
Dependent finite maps (partial dependent products) Provides a type called DMap which generalizes Data.Map.Map, allowing keys to specify the type of value that can be associated with them.
data
DMap (k1 :: k -> Type) (f :: k -> Type)dependent-map Data.Dependent.Map Dependent maps: k is a GADT-like thing with a facility for rediscovering its type parameter, elements of which function as identifiers tagged with the type of the thing they identify. Real GADTs are one useful instantiation of k, as are Tags from Data.Unique.Tag in the 'prim-uniq' package. Semantically, DMap k f is equivalent to a set of DSum k f where no two elements have the same tag. More informally, DMap is to dependent products as Map is to (->). Thus it could also be thought of as a partial (in the sense of "partial function") dependent product.
-
dependent-map Data.Dependent.Map O(n+m). Is this a proper submap? (ie. a submap but not equal). The expression (isProperSubmapOfBy f m1 m2) returns True when m1 and m2 are not equal, all keys in m1 are in m2, and when f returns True when applied to their respective keys and values.