Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. toJSONList :: ToJSON a => [a] -> Value

   gogol-core	Gogol.Data.JSON

   No documentation available.

2. onSublist :: Eq a => [a] -> Splitter a

   split	Data.List.Split

   A splitting strategy that splits on the given list, when it is encountered as an exact subsequence.

   >>> split (onSublist "xyz") "aazbxyzcxd"
   ["aazb","xyz","cxd"]
   

   Note that splitting on the empty list is a special case, which splits just before every element of the list being split.

   >>> split (onSublist "") "abc"
   ["","","a","","b","","c"]
   

   >>> split (dropDelims . dropBlanks $ onSublist "") "abc"
   ["a","b","c"]
   

   However, if you want to break a list into singleton elements like this, you are better off using chunksOf 1, or better yet, map (:[]).

3. type SplitList a = [Chunk a]

   split	Data.List.Split.Internals

   Internal representation of a split list that tracks which pieces are delimiters and which aren't.

4. onSublist :: Eq a => [a] -> Splitter a

   split	Data.List.Split.Internals

   A splitting strategy that splits on the given list, when it is encountered as an exact subsequence.

   >>> split (onSublist "xyz") "aazbxyzcxd"
   ["aazb","xyz","cxd"]
   

   Note that splitting on the empty list is a special case, which splits just before every element of the list being split.

   >>> split (onSublist "") "abc"
   ["","","a","","b","","c"]
   

   >>> split (dropDelims . dropBlanks $ onSublist "") "abc"
   ["a","b","c"]
   

   However, if you want to break a list into singleton elements like this, you are better off using chunksOf 1, or better yet, map (:[]).

5. fillList :: Storable storable => [storable] -> Packer ()

   memory	Data.ByteArray.Pack

   Will put the given storable list from the current position in the stream to the end. This function will fail with not enough storage if the given storable can't be written (not enough space) Example:

   > pack (fillList $ [1..] :: Word8) 9
   "\1\2\3\4\5\6\7\8\9"
   > pack (fillList $ [1..] :: Word32) 4
   "\1\0\0\0"
   > pack (fillList $ [1..] :: Word32) 64
   .. <..succesful..>
   > pack (fillList $ [1..] :: Word32) 1
   .. <.. not enough space ..>
   > pack (fillList $ [1..] :: Word32) 131
   .. <.. not enough space ..>
   

6. appendList :: NonEmpty a -> [a] -> NonEmpty a

   base-compat	Data.List.NonEmpty.Compat

   Attach a list at the end of a NonEmpty.

   >>> appendList (1 :| [2,3]) []
   1 :| [2,3]
   

   >>> appendList (1 :| [2,3]) [4,5]
   1 :| [2,3,4,5]
   

7. fromList :: HasCallStack => [a] -> NonEmpty a

   base-compat	Data.List.NonEmpty.Compat

   Converts a normal list to a NonEmpty stream. Raises an error if given an empty list.

8. prependList :: [a] -> NonEmpty a -> NonEmpty a

   base-compat	Data.List.NonEmpty.Compat

   Attach a list at the beginning of a NonEmpty.

   >>> prependList [] (1 :| [2,3])
   1 :| [2,3]
   

   >>> prependList [negate 1, 0] (1 :| [2, 3])
   -1 :| [0,1,2,3]
   

9. toList :: NonEmpty a -> [a]

   base-compat	Data.List.NonEmpty.Compat

   Convert a stream to a normal list efficiently.

10. module Data.DList

    A difference list is an abstraction representing a list that supports <math>(1) append and snoc operations. This module provides the type for a difference list, DList, and a collection of supporting functions for (a) converting to and from lists and (b) operating on DLists efficiently.

Page 55 of many | Previous | Next