Basement.Sized.List

Contents

• Applicative And Monadic

Description

Synopsis

• data ListN (n :: Nat) a
• toListN :: forall (n :: Nat) a. (KnownNat n, NatWithinBound Int n) => [a] -> Maybe (ListN n a)
• unListN :: ListN n a -> [a]
• length :: forall a (n :: Nat). (KnownNat n, NatWithinBound Int n) => ListN n a -> Int
• create :: forall a (n :: Nat). KnownNat n => (Integer -> a) -> ListN n a
• createFrom :: forall a (n :: Nat) (start :: Nat). (KnownNat n, KnownNat start) => Proxy start -> (Integer -> a) -> ListN n a
• empty :: ListN 0 a
• singleton :: a -> ListN 1 a
• uncons :: CmpNat n 0 ~ GT => ListN n a -> (a, ListN (n - 1) a)
• cons :: a -> ListN n a -> ListN (n + 1) a
• index :: ListN n ty -> Offset ty -> ty
• indexStatic :: forall i n a. (KnownNat i, CmpNat i n ~ LT, Offsetable a i) => ListN n a -> a
• map :: (a -> b) -> ListN n a -> ListN n b
• elem :: Eq a => a -> ListN n a -> Bool
• foldl :: (b -> a -> b) -> b -> ListN n a -> b
• foldl' :: (b -> a -> b) -> b -> ListN n a -> b
• foldr :: (a -> b -> b) -> b -> ListN n a -> b
• append :: ListN n a -> ListN m a -> ListN (n + m) a
• minimum :: (Ord a, CmpNat n 0 ~ GT) => ListN n a -> a
• maximum :: (Ord a, CmpNat n 0 ~ GT) => ListN n a -> a
• head :: CmpNat n 0 ~ GT => ListN n a -> a
• tail :: CmpNat n 0 ~ GT => ListN n a -> ListN (n - 1) a
• take :: forall a (m :: Nat) (n :: Nat). (KnownNat m, NatWithinBound Int m, m <= n) => ListN n a -> ListN m a
• drop :: forall a d (m :: Nat) (n :: Nat). (KnownNat d, NatWithinBound Int d, (n - m) ~ d, m <= n) => ListN n a -> ListN m a
• splitAt :: forall a d (m :: Nat) (n :: Nat). (KnownNat d, NatWithinBound Int d, (n - m) ~ d, m <= n) => ListN n a -> (ListN m a, ListN (n - m) a)
• zip :: ListN n a -> ListN n b -> ListN n (a, b)
• zip3 :: ListN n a -> ListN n b -> ListN n c -> ListN n (a, b, c)
• zip4 :: ListN n a -> ListN n b -> ListN n c -> ListN n d -> ListN n (a, b, c, d)
• zip5 :: ListN n a -> ListN n b -> ListN n c -> ListN n d -> ListN n e -> ListN n (a, b, c, d, e)
• zipWith :: (a -> b -> x) -> ListN n a -> ListN n b -> ListN n x
• zipWith3 :: (a -> b -> c -> x) -> ListN n a -> ListN n b -> ListN n c -> ListN n x
• zipWith4 :: (a -> b -> c -> d -> x) -> ListN n a -> ListN n b -> ListN n c -> ListN n d -> ListN n x
• zipWith5 :: (a -> b -> c -> d -> e -> x) -> ListN n a -> ListN n b -> ListN n c -> ListN n d -> ListN n e -> ListN n x
• replicate :: forall (n :: Nat) a. (NatWithinBound Int n, KnownNat n) => a -> ListN n a
• replicateM :: forall (n :: Nat) m a. (NatWithinBound Int n, Monad m, KnownNat n) => m a -> m (ListN n a)
• mapM :: Monad m => (a -> m b) -> ListN n a -> m (ListN n b)
• mapM_ :: Monad m => (a -> m b) -> ListN n a -> m ()

Documentation

Applicative And Monadic