Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

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

   ListZipper	Data.List.Zipper

   No documentation available.

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

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

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

   Ranged-sets	Data.Ranged.Ranges

   True if the value is within one of the ranges.

5. type Alist = (Symbol, String)

   bbdb	Database.BBDB

   An Alist is an Association List. Lisp writes these as (key . value) We convert these to a tuple in haskell where fst is key and snd is value.

6. BList :: BList -> BValue

   bencoding	Data.BEncode

   list of bencode values;

7. fromAscList :: [(BKey, a)] -> BDictMap a

   bencoding	Data.BEncode.BDict

   O(n). Build a dictionary from a list of key/value pairs where the keys are in ascending order.

8. toAscList :: BDictMap a -> [(BKey, a)]

   bencoding	Data.BEncode.BDict

   O(n). Convert the dictionary to a list of key/value pairs where the keys are in ascending order.

9. type BList = [BValue]

   bencoding	Data.BEncode.Types

   A plain bencode list.

10. BList :: BList -> BValue

    bencoding	Data.BEncode.Types

    list of bencode values;

Page 237 of many | Previous | Next