Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

Exact lookup

1. fromList :: (Interval k e, Ord k) => [k] -> IntervalSet k

   IntervalMap	Data.IntervalSet

   O(n log n). Build a set from a list of elements. See also fromAscList. If the list contains duplicate values, the last value is retained.

2. toAscList :: IntervalSet k -> [k]

   IntervalMap	Data.IntervalSet

   O(n). The list of all values contained in the set, in ascending order.

3. toDescList :: IntervalSet k -> [k]

   IntervalMap	Data.IntervalSet

   O(n). The list of all values in the set, in descending order.

4. toList :: IntervalSet k -> [k]

   IntervalMap	Data.IntervalSet

   O(n). The list of all values in the set, in no particular order.

5. fromList :: [a] -> Zipper a

   ListZipper	Data.List.Zipper

   fromList xs returns a zipper containing the elements of xs, focused on the first element.

6. fromListEnd :: [a] -> Zipper a

   ListZipper	Data.List.Zipper

   fromListEnd xs returns a zipper containing the elements of xs, focused just off the right end of the list.

7. toList :: Zipper a -> [a]

   ListZipper	Data.List.Zipper

   No documentation available.

8. normaliseRangeList :: DiscreteOrdered v => [Range v] -> [Range v]

   Ranged-sets	Data.Ranged.RangedSet

   Rearrange and merge the ranges in the list so that they are in order and non-overlapping.

9. validRangeList :: DiscreteOrdered v => [Range v] -> Bool

   Ranged-sets	Data.Ranged.RangedSet

   Determine if the ranges in the list are both in order and non-overlapping. If so then they are suitable input for the unsafeRangedSet function.

10. rangeListHas :: Ord v => [Range v] -> v -> Bool

    Ranged-sets	Data.Ranged.Ranges

    True if the value is within one of the ranges.

Page 238 of many | Previous | Next