n-tuple-0.0.2.0: Homogeneous tuples of arbitrary length.

Safe HaskellNone
LanguageHaskell2010

Data.NTuple

Contents

Synopsis

Documentation

data NTuple (size :: Nat) a Source #

Instances

Functor (NTuple size) Source # 

Methods

fmap :: (a -> b) -> NTuple size a -> NTuple size b #

(<$) :: a -> NTuple size b -> NTuple size a #

Foldable (NTuple size) Source # 

Methods

fold :: Monoid m => NTuple size m -> m #

foldMap :: Monoid m => (a -> m) -> NTuple size a -> m #

foldr :: (a -> b -> b) -> b -> NTuple size a -> b #

foldr' :: (a -> b -> b) -> b -> NTuple size a -> b #

foldl :: (b -> a -> b) -> b -> NTuple size a -> b #

foldl' :: (b -> a -> b) -> b -> NTuple size a -> b #

foldr1 :: (a -> a -> a) -> NTuple size a -> a #

foldl1 :: (a -> a -> a) -> NTuple size a -> a #

toList :: NTuple size a -> [a] #

null :: NTuple size a -> Bool #

length :: NTuple size a -> Int #

elem :: Eq a => a -> NTuple size a -> Bool #

maximum :: Ord a => NTuple size a -> a #

minimum :: Ord a => NTuple size a -> a #

sum :: Num a => NTuple size a -> a #

product :: Num a => NTuple size a -> a #

Traversable (NTuple size) Source # 

Methods

traverse :: Applicative f => (a -> f b) -> NTuple size a -> f (NTuple size b) #

sequenceA :: Applicative f => NTuple size (f a) -> f (NTuple size a) #

mapM :: Monad m => (a -> m b) -> NTuple size a -> m (NTuple size b) #

sequence :: Monad m => NTuple size (m a) -> m (NTuple size a) #

Eq a => Eq (NTuple size a) Source # 

Methods

(==) :: NTuple size a -> NTuple size a -> Bool #

(/=) :: NTuple size a -> NTuple size a -> Bool #

(Data a, KnownNat size) => Data (NTuple size a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NTuple size a -> c (NTuple size a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NTuple size a) #

toConstr :: NTuple size a -> Constr #

dataTypeOf :: NTuple size a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (NTuple size a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NTuple size a)) #

gmapT :: (forall b. Data b => b -> b) -> NTuple size a -> NTuple size a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NTuple size a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NTuple size a -> r #

gmapQ :: (forall d. Data d => d -> u) -> NTuple size a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> NTuple size a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NTuple size a -> m (NTuple size a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NTuple size a -> m (NTuple size a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NTuple size a -> m (NTuple size a) #

Show a => Show (NTuple size a) Source # 

Methods

showsPrec :: Int -> NTuple size a -> ShowS #

show :: NTuple size a -> String #

showList :: [NTuple size a] -> ShowS #

Generic (NTuple size a) Source # 

Associated Types

type Rep (NTuple size a) :: * -> * #

Methods

from :: NTuple size a -> Rep (NTuple size a) x #

to :: Rep (NTuple size a) x -> NTuple size a #

type Rep (NTuple size a) Source # 
type Rep (NTuple size a) = D1 * (MetaData "NTuple" "Data.NTuple" "n-tuple-0.0.2.0-EBEzjUhriEoKgwjAbjQXdQ" True) (C1 * (MetaCons "NTuple" PrefixI True) (S1 * (MetaSel (Just Symbol "toVector") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Vector a))))

proj Source #

Arguments

:: (n <= size, (n :> 0) ~ True, KnownNat n) 
=> Proxy n

The index

-> NTuple size a 
-> a 

Project an element out of the tuple

incl Source #

Arguments

:: (n <= (size + 1), (n :> 0) ~ True, KnownNat n, size' ~ If (n :== (size + 1)) (size + 1) size) 
=> Proxy n

The index

-> a 
-> NTuple size a 
-> NTuple size' a 

Include an element to the tuple, overwriting on an existing index

toVector :: NTuple size a -> Vector a Source #

Proxies