Safe Haskell	Safe
Language	Haskell98

Data.CList

Documentation

module Data.Peano

data CList n a where Source #

Constructors

Nil :: CList Zero a
(:.) :: a -> CList n a -> CList (Succ n) a infixr 5

Instances

Functor (CList n) Source #
Instance details Defined in Data.CList Methods fmap :: (a -> b) -> CList n a -> CList n b # (<$) :: a -> CList n b -> CList n a #
Applicative (CList n) => Applicative (CList (Succ n)) Source #
Instance details Defined in Data.CList Methods pure :: a -> CList (Succ n) a # (<>) :: CList (Succ n) (a -> b) -> CList (Succ n) a -> CList (Succ n) b # liftA2 :: (a -> b -> c) -> CList (Succ n) a -> CList (Succ n) b -> CList (Succ n) c # (>) :: CList (Succ n) a -> CList (Succ n) b -> CList (Succ n) b # (<*) :: CList (Succ n) a -> CList (Succ n) b -> CList (Succ n) a #
Applicative (CList Zero) Source #
Instance details Defined in Data.CList Methods pure :: a -> CList Zero a # (<>) :: CList Zero (a -> b) -> CList Zero a -> CList Zero b # liftA2 :: (a -> b -> c) -> CList Zero a -> CList Zero b -> CList Zero c # (>) :: CList Zero a -> CList Zero b -> CList Zero b # (<*) :: CList Zero a -> CList Zero b -> CList Zero a #
Foldable (CList n) Source #
Instance details Defined in Data.CList Methods fold :: Monoid m => CList n m -> m # foldMap :: Monoid m => (a -> m) -> CList n a -> m # foldr :: (a -> b -> b) -> b -> CList n a -> b # foldr' :: (a -> b -> b) -> b -> CList n a -> b # foldl :: (b -> a -> b) -> b -> CList n a -> b # foldl' :: (b -> a -> b) -> b -> CList n a -> b # foldr1 :: (a -> a -> a) -> CList n a -> a # foldl1 :: (a -> a -> a) -> CList n a -> a # toList :: CList n a -> [a] # null :: CList n a -> Bool # length :: CList n a -> Int # elem :: Eq a => a -> CList n a -> Bool # maximum :: Ord a => CList n a -> a # minimum :: Ord a => CList n a -> a # sum :: Num a => CList n a -> a # product :: Num a => CList n a -> a #
Traversable (CList n) Source #
Instance details Defined in Data.CList Methods traverse :: Applicative f => (a -> f b) -> CList n a -> f (CList n b) # sequenceA :: Applicative f => CList n (f a) -> f (CList n a) # mapM :: Monad m => (a -> m b) -> CList n a -> m (CList n b) # sequence :: Monad m => CList n (m a) -> m (CList n a) #
Eq1 (CList n) Source #
Instance details Defined in Data.CList Methods liftEq :: (a -> b -> Bool) -> CList n a -> CList n b -> Bool #
Ord1 (CList n) Source #
Instance details Defined in Data.CList Methods liftCompare :: (a -> b -> Ordering) -> CList n a -> CList n b -> Ordering #
Natural n => Read1 (CList n) Source #
Instance details Defined in Data.CList Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (CList n a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [CList n a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (CList n a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [CList n a] #
Show1 (CList n) Source #
Instance details Defined in Data.CList Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> CList n a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [CList n a] -> ShowS #
Eq a => Eq (CList n a) Source #
Instance details Defined in Data.CList Methods (==) :: CList n a -> CList n a -> Bool # (/=) :: CList n a -> CList n a -> Bool #
Ord a => Ord (CList n a) Source #
Instance details Defined in Data.CList Methods compare :: CList n a -> CList n a -> Ordering # (<) :: CList n a -> CList n a -> Bool # (<=) :: CList n a -> CList n a -> Bool # (>) :: CList n a -> CList n a -> Bool # (>=) :: CList n a -> CList n a -> Bool # max :: CList n a -> CList n a -> CList n a # min :: CList n a -> CList n a -> CList n a #
(Read a, Natural n) => Read (CList n a) Source #
Instance details Defined in Data.CList Methods readsPrec :: Int -> ReadS (CList n a) # readList :: ReadS [CList n a] # readPrec :: ReadPrec (CList n a) # readListPrec :: ReadPrec [CList n a] #
Show a => Show (CList n a) Source #
Instance details Defined in Data.CList Methods showsPrec :: Int -> CList n a -> ShowS # show :: CList n a -> String # showList :: [CList n a] -> ShowS #
Semigroup a => Semigroup (CList n a) Source #
Instance details Defined in Data.CList Methods (<>) :: CList n a -> CList n a -> CList n a # sconcat :: NonEmpty (CList n a) -> CList n a # stimes :: Integral b => b -> CList n a -> CList n a #
(Semigroup a, Semigroup (CList n a), Monoid a, Monoid (CList n a)) => Monoid (CList (Succ n) a) Source #
Instance details Defined in Data.CList Methods mempty :: CList (Succ n) a # mappend :: CList (Succ n) a -> CList (Succ n) a -> CList (Succ n) a # mconcat :: [CList (Succ n) a] -> CList (Succ n) a #
(Semigroup a, Monoid a) => Monoid (CList Zero a) Source #
Instance details Defined in Data.CList Methods mempty :: CList Zero a # mappend :: CList Zero a -> CList Zero a -> CList Zero a # mconcat :: [CList Zero a] -> CList Zero a #

fromList :: Natural n => [a] -> Maybe (CList n a) Source #

uncons :: CList (Succ n) a -> (a, CList n a) Source #

head :: CList (Succ n) a -> a Source #

tail :: CList (Succ n) a -> CList n a Source #

init :: CList (Succ n) a -> CList n a Source #

last :: CList (Succ n) a -> a Source #

reverse :: CList n a -> CList n a Source #