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.
-
ListZipper Data.List.Zipper fromList xs returns a zipper containing the elements of xs, focused on the first element.
fromListEnd :: [a] -> Zipper aListZipper Data.List.Zipper fromListEnd xs returns a zipper containing the elements of xs, focused just off the right end of the list.
-
ListZipper Data.List.Zipper No documentation available.
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.
validRangeList :: DiscreteOrdered v => [Range v] -> BoolRanged-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.
rangeListHas :: Ord v => [Range v] -> v -> BoolRanged-sets Data.Ranged.Ranges True if the value is within one of the ranges.
-
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.
-
bencoding Data.BEncode list of bencode values;
fromAscList :: [(BKey, a)] -> BDictMap abencoding Data.BEncode.BDict O(n). Build a dictionary from a list of key/value pairs where the keys are in ascending order.
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.