| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.NTuple
Contents
Synopsis
- data NTuple (size :: Nat) a
- empty :: NTuple 0 a
- proj :: (n <= size, (n > 0) ~ 'True, KnownNat n) => Proxy n -> NTuple size a -> a
- incl :: (n <= (size + 1), (n > 0) ~ 'True, KnownNat n, size' ~ If (n == (size + 1)) (size + 1) size) => Proxy n -> a -> NTuple size a -> NTuple size' a
- toVector :: NTuple size a -> Vector a
- _1 :: Proxy 1
- _2 :: Proxy 2
- _3 :: Proxy 3
- _4 :: Proxy 4
- _5 :: Proxy 5
- _6 :: Proxy 6
- _7 :: Proxy 7
- _8 :: Proxy 8
- _9 :: Proxy 9
- _10 :: Proxy 10
Documentation
data NTuple (size :: Nat) a Source #
Instances
| Foldable (NTuple size) Source # | |
Defined in Data.NTuple Methods fold :: Monoid m => NTuple size m -> m # foldMap :: Monoid m => (a -> m) -> NTuple size a -> 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 # | |
| Traversable (NTuple size) Source # | |
Defined in Data.NTuple | |
| Functor (NTuple size) Source # | |
| (KnownNat size, Data a) => Data (NTuple size a) Source # | |
Defined in Data.NTuple 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 :: forall r r'. (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) # | |
| Generic (NTuple size a) Source # | |
| Show a => Show (NTuple size a) Source # | |
| Eq a => Eq (NTuple size a) Source # | |
| type Rep (NTuple size a) Source # | |
Defined in Data.NTuple | |
Project an element out of the tuple
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