Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. data DMap (k1 :: k -> Type) (f :: k -> Type)

    dependent-map Data.Dependent.Map.Internal

    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.

  2. fmap' :: (Measured v1 a1, Measured v2 a2) => (a1 -> a2) -> FingerTree v1 a1 -> FingerTree v2 a2

    fingertree Data.FingerTree

    Like fmap, but with constraints on the element types.

  3. fmapWithContext :: (Measured v1 a1, Measured v2 a2) => (v1 -> a1 -> v1 -> a2) -> FingerTree v1 a1 -> FingerTree v2 a2

    fingertree Data.FingerTree

    Map all elements of the tree with a function that also takes the measure of the prefix to the left and of the suffix to the right of the element.

  4. fmapWithPos :: (Measured v1 a1, Measured v2 a2) => (v1 -> a1 -> a2) -> FingerTree v1 a1 -> FingerTree v2 a2

    fingertree Data.FingerTree

    Map all elements of the tree with a function that also takes the measure of the prefix of the tree to the left of the element.

  5. unsafeFmap :: (a -> b) -> FingerTree v a -> FingerTree v b

    fingertree Data.FingerTree

    Like fmap, but safe only if the function preserves the measure.

  6. data IntervalMap v a

    fingertree Data.IntervalMap.FingerTree

    Map of closed intervals, possibly with duplicates.

  7. fmapNTreeA :: (b -> Maybe b) -> LA (NTree b) (NTree b)

    hxt Control.Arrow.NTreeEdit

    No documentation available.

  8. 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

  9. 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

  10. 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)

Page 506 of many | Previous | Next