Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
list :: [Greskell a] -> Greskell [a]greskell-core Data.Greskell.Greskell List literal.
list :: forall (m :: Type -> Type) . [ResolverValue m] -> ResolverValue mmorpheus-graphql-app Data.Morpheus.App.NamedResolvers No documentation available.
list :: [p t] -> RecordList p trelational-query Database.Relational Make projected record list from Record list.
list :: [p t] -> RecordList p trelational-query Database.Relational.Arrow Make projected record list from Record list.
list :: [p t] -> RecordList p trelational-query Database.Relational.Record Make projected record list from Record list.
list :: String -> BParser a -> BParser [a]bencode Data.BEncode.Parser No documentation available.
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"],[]]
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.
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.
list :: Decoder a -> Decoder [a]aeson-combinators Data.Aeson.Combinators.Decode Decode JSON array of values to '[a]' of values using provided Decoder.