Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. data IntervalMap r a

   data-interval	Data.IntervalMap.Strict

   A Map from non-empty, disjoint intervals over k to values a. Unlike IntervalSet, IntervalMap never merge adjacent mappings, even if adjacent intervals are connected and mapped to the same value.

2. isProperSubmapOf :: (Ord k, Eq a) => IntervalMap k a -> IntervalMap k a -> Bool

   data-interval	Data.IntervalMap.Strict

   Is this a proper submap? (ie. a submap but not equal). Defined as (isProperSubmapOf = isProperSubmapOfBy (==)).

3. isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> IntervalMap k a -> IntervalMap k b -> Bool

   data-interval	Data.IntervalMap.Strict

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

4. isSubmapOf :: (Ord k, Eq a) => IntervalMap k a -> IntervalMap k a -> Bool

   data-interval	Data.IntervalMap.Strict

   This function is defined as (isSubmapOf = isSubmapOfBy (==)).

5. isSubmapOfBy :: Ord k => (a -> b -> Bool) -> IntervalMap k a -> IntervalMap k b -> Bool

   data-interval	Data.IntervalMap.Strict

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

6. type PMap (f :: k ~> j) (p :: Predicate j) = p .@#@$$$ f

   decidable	Data.Type.Predicate

   Pre-compose a function to a predicate

   PMap :: (k ~> j) -> Predicate j -> Predicate k
   

7. dmap :: forall (p :: k1 ~> Type) (q :: k1 ~> Type) . DFunctor f => (p -?> q) -> f p -?> f q

   decidable	Data.Type.Predicate

   No documentation available.

8. tmap :: forall (p :: k1 ~> Type) (q :: k1 ~> Type) . TFunctor f => (p --> q) -> f p --> f q

   decidable	Data.Type.Predicate

   No documentation available.

9. data PPMap (a :: k ~> j) (b :: ParamPred j v) (c :: k) (d :: TyFun v Type)

   decidable	Data.Type.Predicate.Param

   Pre-compose a function to a ParamPred. Is essentially flip (.), but unfortunately defunctionalization doesn't work too well with that definition.

10. data PPMapV (a :: u ~> v) (b :: ParamPred k u) (c :: k) (d :: TyFun v Type)

    decidable	Data.Type.Predicate.Param

    Pre-compose a function to a ParamPred, but on the "value" side.

Page 1145 of many | Previous | Next