Safe Haskell	Safe

Eta.Types.Char

Description

The Char type and its operations

Documentation

data Char :: * #

Instances

Bounded Char
Methods minBound :: Char # maxBound :: Char #
Enum Char
Methods succ :: Char -> Char pred :: Char -> Char toEnum :: Int -> Char # fromEnum :: Char -> Int # enumFrom :: Char -> [Char] enumFromThen :: Char -> Char -> [Char] enumFromTo :: Char -> Char -> [Char] enumFromThenTo :: Char -> Char -> Char -> [Char]
Eq Char
Methods (==) :: Char -> Char -> Bool # (/=) :: Char -> Char -> Bool #
Ord Char
Methods compare :: Char -> Char -> Ordering # (<) :: Char -> Char -> Bool # (<=) :: Char -> Char -> Bool # (>) :: Char -> Char -> Bool # (>=) :: Char -> Char -> Bool # max :: Char -> Char -> Char # min :: Char -> Char -> Char #
Read Char
Methods readsPrec :: Int -> ReadS Char # readList :: ReadS [Char] readPrec :: ReadPrec Char readListPrec :: ReadPrec [Char]
Show Char
Methods showsPrec :: Int -> Char -> ShowS # show :: Char -> String # showList :: [Char] -> ShowS #
Functor (URec Char)
Methods fmap :: (a -> b) -> URec Char a -> URec Char b # (<$) :: a -> URec Char b -> URec Char a
Foldable (URec Char)
Methods fold :: Monoid m => URec Char m -> m foldMap :: Monoid m => (a -> m) -> URec Char a -> m # foldr :: (a -> b -> b) -> b -> URec Char a -> b # foldr' :: (a -> b -> b) -> b -> URec Char a -> b foldl :: (b -> a -> b) -> b -> URec Char a -> b foldl' :: (b -> a -> b) -> b -> URec Char a -> b foldr1 :: (a -> a -> a) -> URec Char a -> a foldl1 :: (a -> a -> a) -> URec Char a -> a toList :: URec Char a -> [a] null :: URec Char a -> Bool length :: URec Char a -> Int elem :: Eq a => a -> URec Char a -> Bool maximum :: Ord a => URec Char a -> a minimum :: Ord a => URec Char a -> a sum :: Num a => URec Char a -> a product :: Num a => URec Char a -> a
Traversable (URec Char)
Methods traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) # sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) # mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) sequence :: Monad m => URec Char (m a) -> m (URec Char a)
Generic1 (URec Char)
Associated Types type Rep1 (URec Char :: * -> ) :: -> * Methods from1 :: URec Char a -> Rep1 (URec Char) a to1 :: Rep1 (URec Char) a -> URec Char a
Eq (URec Char p)
Methods (==) :: URec Char p -> URec Char p -> Bool # (/=) :: URec Char p -> URec Char p -> Bool #
Ord (URec Char p)
Methods compare :: URec Char p -> URec Char p -> Ordering # (<) :: URec Char p -> URec Char p -> Bool # (<=) :: URec Char p -> URec Char p -> Bool # (>) :: URec Char p -> URec Char p -> Bool # (>=) :: URec Char p -> URec Char p -> Bool # max :: URec Char p -> URec Char p -> URec Char p # min :: URec Char p -> URec Char p -> URec Char p #
Show (URec Char p)
Methods showsPrec :: Int -> URec Char p -> ShowS # show :: URec Char p -> String # showList :: [URec Char p] -> ShowS #
Generic (URec Char p)
Associated Types type Rep (URec Char p) :: * -> * Methods from :: URec Char p -> Rep (URec Char p) x to :: Rep (URec Char p) x -> URec Char p
data URec Char
data URec Char = UChar { uChar# :: Char# }
type Rep1 (URec Char)
type Rep1 (URec Char) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UChar" PrefixI True) (S1 (MetaSel (Just Symbol "uChar#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) UChar))
type Rep (URec Char p)
type Rep (URec Char p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UChar" PrefixI True) (S1 (MetaSel (Just Symbol "uChar#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) UChar))