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.
data
ListToMaybeSym0 (a1 :: TyFun [a] Maybe a)singletons-base Data.Maybe.Singletons No documentation available.
type family
ListToMaybeSym1 (a6989586621679587943 :: [a]) :: Maybe asingletons-base Data.Maybe.Singletons No documentation available.
-
massiv Data.Massiv.Core No documentation available.
-
massiv Data.Massiv.Core.List No documentation available.
-
recursion-schemes Data.Functor.Base Base functor of [].
-
recursion-schemes Data.Functor.Foldable Base functor of [].
-
Generic operations over list-like structures Written by John Goerzen, [email protected] Please start with the introduction at Data.ListLike#intro.
-
ListLike Data.ListLike The class implementing list-like functions. It is worth noting that types such as Map can be instances of ListLike. Due to their specific ways of operating, they may not behave in the expected way in some cases. For instance, cons may not increase the size of a map if the key you have given is already in the map; it will just replace the value already there. Implementators must define at least:
- singleton
- head
- tail
- null or genericLength
class ListLike full item =>
ListLikeIO full item | full -> itemListLike Data.ListLike An extension to ListLike for those data types that support I/O. These functions mirror those in System.IO for the most part. They also share the same names; see the comments in Data.ListLike for help importing them. Note that some types may not be capable of lazy reading or writing. Therefore, the usual semantics of System.IO functions regarding laziness may or may not be available from a particular implementation. Minimal complete definition:
- hGetLine
- hGetContents
- hGet
- hGetNonBlocking
- hPutStr
type
ListOps full = ListLike full Item fullListLike Data.ListLike A version of ListLike with a single type parameter, the item type is obtained using the Item type function from IsList.