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. Superset :: PartialOrdering

   radix-tree	Data.RadixTree.Word8.Strict

2. Subset :: PartialOrdering

   radix-tree	Data.Zebra.Word

3. Superset :: PartialOrdering

   radix-tree	Data.Zebra.Word

4. data RIntSet

   range-set-list	Data.RangeSet.IntMap

   Internally set is represented as sorted list of distinct inclusive ranges.

5. isSubsetOf :: RIntSet -> RIntSet -> Bool

   range-set-list	Data.RangeSet.IntMap

   O(n+m). Is this a subset? (s1 isSubsetOf s2) tells whether s1 is a subset of s2.

6. isSubsetRangeList :: Ord a => [(a, a)] -> [(a, a)] -> Bool

   range-set-list	Data.RangeSet.Internal

   Determine if the first list is a subset of the second.

7. rangeIsSubsetList :: Ord a => a -> a -> [(a, a)] -> Maybe [(a, a)]

   range-set-list	Data.RangeSet.Internal

   Determine if [x,y] is a subset of the list, returning the list right of y if so.

8. data RSet a

   range-set-list	Data.RangeSet.List

   Internally set is represented as sorted list of distinct inclusive ranges.

9. isSubsetOf :: Ord a => RSet a -> RSet a -> Bool

   range-set-list	Data.RangeSet.List

   O(n+m). Is this a subset? (s1 isSubsetOf s2) tells whether s1 is a subset of s2.

10. toSet :: Enum a => RSet a -> Set a

    range-set-list	Data.RangeSet.List

    O(n*r). Convert the set to a Set of elements. r is the size of longest range.

Page 208 of many | Previous | Next