Hoogle Search

Within LTS Haskell 24.60 (ghc-9.10.3)

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

  1. list :: Functor m => m [Doc] -> m Doc

    graphviz Data.GraphViz.Printing

    The document (list xs) comma separates the documents xs and encloses them in square brackets. The documents are rendered horizontally if that fits the page. Otherwise they are aligned vertically. All comma separators are put in front of the elements.

  2. list :: ListLike full a => b -> (a -> full -> b) -> full -> b

    ListLike Data.ListLike.Utils

    List-like destructor (like Data.Maybe.maybe)

  3. list :: [Greskell a] -> Greskell [a]

    greskell-core Data.Greskell.Greskell

    List literal.

  4. list :: forall (m :: Type -> Type) . [ResolverValue m] -> ResolverValue m

    morpheus-graphql-app Data.Morpheus.App.NamedResolvers

    No documentation available.

  5. list :: [p t] -> RecordList p t

    relational-query Database.Relational

    Make projected record list from Record list.

  6. list :: [p t] -> RecordList p t

    relational-query Database.Relational.Arrow

    Make projected record list from Record list.

  7. list :: [p t] -> RecordList p t

    relational-query Database.Relational.Record

    Make projected record list from Record list.

  8. list :: String -> BParser a -> BParser [a]

    bencode Data.BEncode.Parser

    No documentation available.

  9. list :: BReader a -> BReader [a]

    bencode Data.BEncode.Reader

    Read a list of BEncoded data

    >>> runBReader (list bint) (BList [BInt 1, BInt 2])
    Right [1,2]
    
    >>> runBReader (list bint) (BList [])
    Right []
    
    >>> let bs = (BList [BList [BString "foo", BString "bar"], BList []])
    
    >>> runBReader (list $ list bstring) bs
    Right [["foo","bar"],[]]
    

  10. list :: (ProductProfunctor p, SumProfunctor p) => p a b -> p [a] [b]

    product-profunctors Data.Profunctor.Product

    A generalisation of map :: (a -> b) -> [a] -> [b]. It is also, in spirit, a generalisation of traverse :: (a -> f b) -> [a] -> f [b], but the types need to be shuffled around a bit to make that work.

Page 9 of many | Previous | Next