Hoogle Search

Within LTS Haskell 24.37 (ghc-9.10.3)

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

Exact lookup

1. toDescList :: IntervalMap k a -> [(Interval k, a)]

   data-interval	Data.IntervalMap.Strict

   Convert the map to a list of key/value pairs where the keys are in descending order.

2. toList :: IntervalMap k a -> [(Interval k, a)]

   data-interval	Data.IntervalMap.Strict

   Convert the map to a list of key/value pairs.

3. fromAscList :: Ord r => [Interval r] -> IntervalSet r

   data-interval	Data.IntervalSet

   Build a map from an ascending list of intervals. The precondition is not checked.

4. fromList :: Ord r => [Interval r] -> IntervalSet r

   data-interval	Data.IntervalSet

   Build a interval set from a list of intervals.

5. toAscList :: Ord r => IntervalSet r -> [Interval r]

   data-interval	Data.IntervalSet

   Convert a interval set into a list of intervals in ascending order.

6. toDescList :: Ord r => IntervalSet r -> [Interval r]

   data-interval	Data.IntervalSet

   Convert a interval set into a list of intervals in descending order.

7. toList :: Ord r => IntervalSet r -> [Interval r]

   data-interval	Data.IntervalSet

   Convert a interval set into a list of intervals.

8. modifyAscList :: (Ord b, Num b, Bits b) => [(b, a -> a)] -> IntTrie a -> IntTrie a

   data-inttrie	Data.IntTrie

   Modify the function at a (potentially infinite) list of points in ascending order

   modifyAscList [(i0, f0)..(iN, fN)] = modify i0 f0 . ... . modify iN fN
   

9. modifyDescList :: (Ord b, Num b, Bits b) => [(b, a -> a)] -> IntTrie a -> IntTrie a

   data-inttrie	Data.IntTrie

   Modify the function at a (potentially infinite) list of points in descending order

10. boundedList :: Int -> Memo a -> Memo [a]

    data-memocombinators	Data.MemoCombinators

    Build a table which memoizes all lists of less than the given length.

Page 192 of many | Previous | Next