, take
, drop
, select
- , group
+-- , group
, (<+)
, (++)
, map
, iterate
, generate
, copy
+ , copyn
) where
empty :: TFVec D0 a
empty = TFVec []
-{-# NOINLINE (+>) #-}
(+>) :: a -> TFVec s a -> TFVec (Succ s) a
x +> (TFVec xs) = TFVec (x:xs)
| otherwise = []
selectFirst0 _ 0 [] = []
-group :: PositiveT n => n -> TFVec s a -> TFVec (Div s n) (TFVec n a)
-group n = liftV (group' (fromIntegerT n))
- where group' :: Int -> [a] -> [TFVec s a]
- group' n xs = case splitAtM n xs of
- Nothing -> []
- Just (ls, rs) -> TFVec ls : group' n rs
+-- group :: PositiveT n => n -> TFVec s a -> TFVec (Div s n) (TFVec n a)
+-- group n = liftV (group' (fromIntegerT n))
+-- where group' :: Int -> [a] -> [TFVec s a]
+-- group' n xs = case splitAtM n xs of
+-- Nothing -> []
+-- Just (ls, rs) -> TFVec ls : group' n rs
(<+) :: TFVec s a -> a -> TFVec (Succ s) a
(<+) (TFVec xs) x = TFVec (xs P.++ [x])
rotl :: (PositiveT s, s ~ Succ (Pred s)) => TFVec s a -> TFVec s a
rotl xs = last xs +> init xs
-class Rotr a where rotr :: a -> a
-instance Rotr (TFVec D0 a) where rotr xs = xs
-instance (PositiveT s, s ~ Succ (Pred s)) => Rotr (TFVec s a) where rotr xs = tail xs <+ head xs
+rotr :: (PositiveT s, s ~ Succ (Pred s)) => TFVec s a -> TFVec s a
+rotr xs = tail xs <+ head xs
concat :: TFVec s1 (TFVec s2 a) -> TFVec (s1 :*: s2) a
concat = liftV (P.foldr ((P.++).unTFVec) [])
generate :: NaturalT s => s -> (a -> a) -> a -> TFVec s a
generate s f x = let s' = fromIntegerT s in TFVec (P.take s' $ P.tail $ P.iterate f x)
-copy :: NaturalT s => s -> a -> TFVec s a
-copy s x = iterate s id x
+copy :: NaturalT s => a -> TFVec s a
+copy x = copyn (undefined :: s) x
+
+copyn :: NaturalT s => s -> a -> TFVec s a
+copyn s x = iterate s id x
-- =============
-- = Instances =