Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. toIntMap :: Storable a => Array IntSet a -> IntMap a

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

2. toMap :: (Ord k, Storable a) => Array (Set k) a -> Map k a

   comfort-array	Data.Array.Comfort.Storable

   No documentation available.

3. package dependent-map

   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.

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

5. isProperSubmapOfBy :: GCompare k2 => (forall (v :: k1) . () => k2 v -> k2 v -> f v -> g v -> Bool) -> DMap k2 f -> DMap k2 g -> Bool

   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.

6. isSubmapOfBy :: GCompare k2 => (forall (v :: k1) . () => k2 v -> k2 v -> f v -> g v -> Bool) -> DMap k2 f -> DMap k2 g -> Bool

   dependent-map	Data.Dependent.Map

   O(n+m). The expression (isSubmapOfBy f t1 t2) returns True if all keys in t1 are in tree t2, and when f returns True when applied to their respective keys and values.

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

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

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

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

Page 506 of many | Previous | Next