Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

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

Exact lookup

1. listBitArray :: (Int, Int) -> [Bool] -> BitArray

   bitarray	Data.BitArray

   If the list is too short, the rest of the array is filled with False.

2. listBitArray01 :: (Int, Int) -> [Int] -> BitArray

   bitarray	Data.BitArray

   No documentation available.

3. listAll :: Path -> Command [Path]

   libmpd	Network.MPD.Applicative.Database

   List all songs and directories in a database path.

4. listAllInfo :: Path -> Command [LsResult]

   libmpd	Network.MPD.Applicative.Database

   Same as listAll but also returns metadata.

5. listFortuneFiles :: Bool -> FilePath -> IO [FilePath]

   misfortune	Data.Fortune

   List all the fortune files in a directory. The Bool value specifies whether to search subtrees as well. Any file which does not have an extension of ".ix" or ".dat" will be reported as a fortune file (".dat" is not used by misfortune, but is ignored so that misfortune can share fortune databases with fortune).

6. listFortuneFilesIn :: [(FilePath, Bool)] -> IO [FilePath]

   misfortune	Data.Fortune

   List all the fortune files in several directories. Each directory will be searched by listFortuneFiles (using the corresponding Bool value to control whether the directory is searched recursively) and all results will be combined.

7. listSepByUntilEoi :: Parser a e s () -> Parser a e s b -> Parser a e s [b]

   smith	Data.Parser

   No documentation available.

8. maybeToList :: Maybe a -> [a]

   base	Data.Maybe

   The maybeToList function returns an empty list when given Nothing or a singleton list when given Just.

   Examples

   Basic usage:

   >>> maybeToList (Just 7)
   [7]
   

   >>> maybeToList Nothing
   []
   

   One can use maybeToList to avoid pattern matching when combined with a function that (safely) works on lists:

   >>> import GHC.Internal.Text.Read ( readMaybe )
   
   >>> sum $ maybeToList (readMaybe "3")
   3
   
   >>> sum $ maybeToList (readMaybe "")
   0
   

9. biList :: Bifoldable t => t a a -> [a]

   base	Data.Bifoldable

   Collects the list of elements of a structure, from left to right.

   Examples

   Basic usage:

   >>> biList (18, 42)
   [18,42]
   

   >>> biList (Left 18)
   [18]
   

10. toList :: Foldable t => t a -> [a]

    base	Data.Foldable

    List of elements of a structure, from left to right. If the entire list is intended to be reduced via a fold, just fold the structure directly bypassing the list.

    Examples

    Basic usage:

    >>> toList Nothing
    []
    

    >>> toList (Just 42)
    [42]
    

    >>> toList (Left "foo")
    []
    

    >>> toList (Node (Leaf 5) 17 (Node Empty 12 (Leaf 8)))
    [5,17,12,8]
    

    For lists, toList is the identity:

    >>> toList [1, 2, 3]
    [1,2,3]
    

Page 31 of many | Previous | Next