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

2. BList :: BList -> BValue

   bencoding	Data.BEncode

   list of bencode values;

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

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

5. type BList = [BValue]

   bencoding	Data.BEncode.Types

   A plain bencode list.

6. BList :: BList -> BValue

   bencoding	Data.BEncode.Types

   list of bencode values;

7. isList :: BValue -> Bool

   bencoding	Data.BEncode.Types

   Test if bencoded value is a list.

8. fromList :: [Word8] -> ByteSet

   byteset	Data.ByteSet

   O(n). Create a byteset from a list of bytes.

9. toList :: ByteSet -> [Word8]

   byteset	Data.ByteSet

   O(n). An alias of elems.

10. fmtIntegralListExpr :: (Show a, Integral a) => Expr [a] -> String

    dice	Data.Random.Dice

    No documentation available.

Page 239 of many | Previous | Next