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.

Exact lookup

1. keysSet :: Ord k => IntervalMap k a -> IntervalSet k

   data-interval	Data.IntervalMap.Lazy

   The set of all keys of the map.

2. keysSet :: Ord k => IntervalMap k a -> IntervalSet k

   data-interval	Data.IntervalMap.Strict

   The set of all keys of the map.

3. module Data.IntervalSet

   Interval datatype and interval arithmetic.

4. data IntervalSet r

   data-interval	Data.IntervalSet

   A set comprising zero or more non-empty, disconnected intervals. Any connected intervals are merged together, and empty intervals are ignored.

5. isProperSubsetOf :: Ord r => IntervalSet r -> IntervalSet r -> Bool

   data-interval	Data.IntervalSet

   Is this a proper subset? (i.e. a subset but not equal).

6. isSubsetOf :: Ord r => IntervalSet r -> IntervalSet r -> Bool

   data-interval	Data.IntervalSet

   Is this a subset? (is1 `isSubsetOf` is2) tells whether is1 is a subset of is2.

7. du_charset :: DataUrl -> !Maybe Text

   dataurl	Web.DataUrl

   No documentation available.

8. module Data.Type.Universe.Subset

   Represent a decidable subset of a type-level collection.

9. data Subset (f :: Type -> Type) (a :: k ~> Type) (b :: TyFun f k Type)

   decidable	Data.Type.Universe.Subset

   A Subset f p is a predicate that some decidable subset of an input as is true.

10. newtype WitSubset (f :: Type -> Type) (p :: k ~> Type) (as :: f k)

    decidable	Data.Type.Universe.Subset

    A WitSubset f p as describes a decidable subset of type-level collection as.

Page 184 of many | Previous | Next