Safe Haskell | None |
---|---|
Language | Haskell2010 |
Lists of statically-known length
Synopsis
- data Peano
- data List n a where
- fromList :: Natural n => [a] -> Maybe (List n a)
- uncons :: List (Succ n) a -> (a, List n a)
- head :: List (Succ n) a -> a
- tail :: List (Succ n) a -> List n a
- init :: List (Succ n) a -> List n a
- last :: List (Succ n) a -> a
- reverse :: List n a -> List n a
- rotate :: Fin n -> List n a -> List n a
- at :: Functor f => Fin n -> (a -> f a) -> List n a -> f (List n a)
- swap :: Fin n -> Fin n -> List n a -> List n a
- (!!) :: List n a -> Fin n -> a
- findIndex :: Alternative p => (a -> Bool) -> List n a -> p (Fin n)
Documentation
Instances
Bounded Peano | |
Enum Peano | |
Eq Peano | |
Integral Peano | |
Data Peano | |
Defined in Data.Peano gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Peano -> c Peano # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Peano # dataTypeOf :: Peano -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Peano) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Peano) # gmapT :: (forall b. Data b => b -> b) -> Peano -> Peano # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Peano -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Peano -> r # gmapQ :: (forall d. Data d => d -> u) -> Peano -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Peano -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Peano -> m Peano # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Peano -> m Peano # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Peano -> m Peano # | |
Num Peano | |
Ord Peano | |
Read Peano | |
Real Peano | |
Defined in Data.Peano toRational :: Peano -> Rational # | |
Show Peano | |
Ix Peano | |
A list of exactly n
values of type a
Instances
Functor (List n) Source # | |
Natural n => Applicative (List n) Source # | |
Foldable (List n) Source # | |
Defined in Data.Fin.Private fold :: Monoid m => List n m -> m # foldMap :: Monoid m => (a -> m) -> List n a -> m # foldMap' :: Monoid m => (a -> m) -> List n a -> m # foldr :: (a -> b -> b) -> b -> List n a -> b # foldr' :: (a -> b -> b) -> b -> List n a -> b # foldl :: (b -> a -> b) -> b -> List n a -> b # foldl' :: (b -> a -> b) -> b -> List n a -> b # foldr1 :: (a -> a -> a) -> List n a -> a # foldl1 :: (a -> a -> a) -> List n a -> a # elem :: Eq a => a -> List n a -> Bool # maximum :: Ord a => List n a -> a # minimum :: Ord a => List n a -> a # | |
Traversable (List n) Source # | |
Eq1 (List n) Source # | |
Ord1 (List n) Source # | |
Defined in Data.Fin.Private | |
Natural n => Read1 (List n) Source # | |
Defined in Data.Fin.Private | |
Show1 (List n) Source # | |
Natural n => Foldable1 (List ('Succ n)) Source # | |
Defined in Data.Fin.Private fold1 :: Semigroup a => List ('Succ n) a -> a # foldMap1 :: Semigroup b => (a -> b) -> List ('Succ n) a -> b # foldr1 :: (a -> a -> a) -> List ('Succ n) a -> a # foldl1 :: (a -> a -> a) -> List ('Succ n) a -> a # foldr1' :: (a -> a -> a) -> List ('Succ n) a -> a # foldl1' :: (a -> a -> a) -> List ('Succ n) a -> a # toNonEmpty :: List ('Succ n) a -> NonEmpty a # | |
Eq a => Eq (List n a) Source # | |
Ord a => Ord (List n a) Source # | |
Defined in Data.Fin.Private | |
(Read a, Natural n) => Read (List n a) Source # | |
Show a => Show (List n a) Source # | |
Semigroup a => Semigroup (List n a) Source # | |
(Natural n, Monoid a) => Monoid (List n a) Source # | |
rotate :: Fin n -> List n a -> List n a Source #
Bring givenly many elements from the tail of the list to the front.