Safe Haskell	Safe
Language	Haskell98

Data.FixedLength

Documentation

data T n a #

Instances

Natural n => Functor (T n) #
Methods fmap :: (a -> b) -> T n a -> T n b # (<$) :: a -> T n b -> T n a #
Natural n => Applicative (T n) #
Methods pure :: a -> T n a # (<>) :: T n (a -> b) -> T n a -> T n b # liftA2 :: (a -> b -> c) -> T n a -> T n b -> T n c # (>) :: T n a -> T n b -> T n b # (<*) :: T n a -> T n b -> T n a #
Natural n => Foldable (T n) #
Methods fold :: Monoid m => T n m -> m # foldMap :: Monoid m => (a -> m) -> T n a -> m # foldr :: (a -> b -> b) -> b -> T n a -> b # foldr' :: (a -> b -> b) -> b -> T n a -> b # foldl :: (b -> a -> b) -> b -> T n a -> b # foldl' :: (b -> a -> b) -> b -> T n a -> b # foldr1 :: (a -> a -> a) -> T n a -> a # foldl1 :: (a -> a -> a) -> T n a -> a # toList :: T n a -> [a] # null :: T n a -> Bool # length :: T n a -> Int # elem :: Eq a => a -> T n a -> Bool # maximum :: Ord a => T n a -> a # minimum :: Ord a => T n a -> a # sum :: Num a => T n a -> a # product :: Num a => T n a -> a #
Natural n => Traversable (T n) #
Methods traverse :: Applicative f => (a -> f b) -> T n a -> f (T n b) # sequenceA :: Applicative f => T n (f a) -> f (T n a) # mapM :: Monad m => (a -> m b) -> T n a -> m (T n b) # sequence :: Monad m => T n (m a) -> m (T n a) #
(Natural n, Eq a) => Eq (T n a) #
Methods (==) :: T n a -> T n a -> Bool # (/=) :: T n a -> T n a -> Bool #
(Natural n, Show a) => Show (T n a) #
Methods showsPrec :: Int -> T n a -> ShowS # show :: T n a -> String # showList :: [T n a] -> ShowS #

type family Position n :: * #

Instances

type Position Zero #
type Position Zero = Zero
type Position (Succ n) #
type Position (Succ n) = Succ (Position n)

type family List n :: * -> * #

Instances

type family Length (f :: * -> *) #

Instances

data Index n #

Instances

Natural n => Eq (Index n) #
Methods (==) :: Index n -> Index n -> Bool # (/=) :: Index n -> Index n -> Bool #
Natural n => Ord (Index n) #
Methods compare :: Index n -> Index n -> Ordering # (<) :: Index n -> Index n -> Bool # (<=) :: Index n -> Index n -> Bool # (>) :: Index n -> Index n -> Bool # (>=) :: Index n -> Index n -> Bool # max :: Index n -> Index n -> Index n # min :: Index n -> Index n -> Index n #

data Zero #

Instances

Eq Zero #
Methods (==) :: Zero -> Zero -> Bool # (/=) :: Zero -> Zero -> Bool #
Ord Zero #
Methods compare :: Zero -> Zero -> Ordering # (<) :: Zero -> Zero -> Bool # (<=) :: Zero -> Zero -> Bool # (>) :: Zero -> Zero -> Bool # (>=) :: Zero -> Zero -> Bool # max :: Zero -> Zero -> Zero # min :: Zero -> Zero -> Zero #

data Succ pos #

Constructors

Stop
Succ pos

Instances

Eq pos => Eq (Succ pos) #
Methods (==) :: Succ pos -> Succ pos -> Bool # (/=) :: Succ pos -> Succ pos -> Bool #
Ord pos => Ord (Succ pos) #
Methods compare :: Succ pos -> Succ pos -> Ordering # (<) :: Succ pos -> Succ pos -> Bool # (<=) :: Succ pos -> Succ pos -> Bool # (>) :: Succ pos -> Succ pos -> Bool # (>=) :: Succ pos -> Succ pos -> Bool # max :: Succ pos -> Succ pos -> Succ pos # min :: Succ pos -> Succ pos -> Succ pos #
Show pos => Show (Succ pos) #
Methods showsPrec :: Int -> Succ pos -> ShowS # show :: Succ pos -> String # showList :: [Succ pos] -> ShowS #