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. liftReadListPrecDefault :: Read1 f => ReadPrec a -> ReadPrec [a] -> ReadPrec [f a]

   base	Data.Functor.Classes

   A possible replacement definition for the liftReadListPrec method, defined using liftReadPrec.

2. liftShowList :: Show1 f => (Int -> a -> ShowS) -> ([a] -> ShowS) -> [f a] -> ShowS

   base	Data.Functor.Classes

   showList function for an application of the type constructor based on showsPrec and showList functions for the argument type. The default implementation using standard list syntax is correct for most types.

3. liftShowList2 :: Show2 f => (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [f a b] -> ShowS

   base	Data.Functor.Classes

   showList function for an application of the type constructor based on showsPrec and showList functions for the argument types. The default implementation using standard list syntax is correct for most types.

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

   base	Data.List.NonEmpty

   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]
   

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

   base	Data.List.NonEmpty

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

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

   base	Data.List.NonEmpty

   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]
   

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

   base	Data.List.NonEmpty

   Convert a stream to a normal list efficiently.

8. primMapListBounded :: BoundedPrim a -> [a] -> Builder

   bytestring	Data.ByteString.Builder.Prim

   Create a Builder that encodes a list of values consecutively using a BoundedPrim for each element. This function is more efficient than

   mconcat . map (primBounded w)
   

   or

   foldMap (primBounded w)
   

   because it moves several variables out of the inner loop.

9. primMapListFixed :: FixedPrim a -> [a] -> Builder

   bytestring	Data.ByteString.Builder.Prim

   Encode a list of values from left-to-right with a FixedPrim.

10. toList :: Array -> Int -> Int -> [Word8]

    text	Data.Text.Array

    Convert an immutable array to a list.

Page 33 of many | Previous | Next