Safe Haskell	None
Language	Haskell2010

Data.RAVec.NonEmpty

Contents

Random access list
Construction
Conversion
Indexing
Folds
Mapping
Zipping
Universe
QuickCheck

Description

Non-empty length-indexed random access list.

Synopsis

newtype NERAVec (b :: BinP ) a = NE ( NERAVec' ' Z b a)
data NERAVec' (n :: Nat ) (b :: BinP ) a where
- Last :: Tree n a -> NERAVec' n ' BE a
- Cons0 :: NERAVec' (' S n) b a -> NERAVec' n (' B0 b) a
- Cons1 :: Tree n a -> NERAVec' (' S n) b a -> NERAVec' n (' B1 b) a
singleton :: forall a. a -> NERAVec BinP1 a
singleton' :: a -> NERAVec' ' Z BinP1 a
cons :: forall a b. a -> NERAVec b a -> NERAVec ( Succ b) a
consTree :: Tree n a -> NERAVec' n b a -> NERAVec' n ( Succ b) a
withCons :: SBinPI b => a -> NERAVec b a -> ( SBinPI ( Succ b) => NERAVec ( Succ b) a -> r) -> r
withConsTree :: SBinP b -> Tree n a -> NERAVec' n b a -> ( SBinPI ( Succ b) => NERAVec' n ( Succ b) a -> r) -> r
toList :: NERAVec b a -> [a]
toList' :: NERAVec' n b a -> [a]
toNonEmpty :: NERAVec b a -> NonEmpty a
toNonEmpty' :: NERAVec' n b a -> NonEmpty a
reifyNonEmpty :: NonEmpty a -> ( forall b. SBinPI b => NERAVec b a -> r) -> r
reifyNonEmpty' :: forall a r. NonEmpty a -> ( forall b. SBinPI b => NERAVec' ' Z b a -> r) -> r
(!) :: NERAVec b a -> PosP b -> a
index' :: NERAVec' n b a -> PosP' n b -> a
tabulate :: SBinPI b => ( PosP b -> a) -> NERAVec b a
tabulate' :: forall b n a. ( SBinPI b, SNatI n) => ( PosP' n b -> a) -> NERAVec' n b a
unsingleton :: NERAVec ' BE a -> a
head :: NERAVec b a -> a
head' :: NERAVec' n b a -> a
last :: NERAVec b a -> a
last' :: NERAVec' n b a -> a
foldMap :: Monoid m => (a -> m) -> NERAVec b a -> m
foldMap' :: Monoid m => (a -> m) -> NERAVec' n b a -> m
foldMap1 :: Semigroup m => (a -> m) -> NERAVec b a -> m
foldMap1' :: Semigroup m => (a -> m) -> NERAVec' n b a -> m
ifoldMap :: Monoid m => ( PosP b -> a -> m) -> NERAVec b a -> m
ifoldMap' :: Monoid m => ( PosP' n b -> a -> m) -> NERAVec' n b a -> m
ifoldMap1 :: Semigroup m => ( PosP b -> a -> m) -> NERAVec b a -> m
ifoldMap1' :: Semigroup m => ( PosP' n b -> a -> m) -> NERAVec' n b a -> m
foldr :: (a -> b -> b) -> b -> NERAVec m a -> b
foldr' :: (a -> b -> b) -> b -> NERAVec' n m a -> b
ifoldr :: ( PosP m -> a -> b -> b) -> b -> NERAVec m a -> b
ifoldr' :: ( PosP' n m -> a -> b -> b) -> b -> NERAVec' n m a -> b
foldr1Map :: (a -> b -> b) -> (a -> b) -> NERAVec m a -> b
foldr1Map' :: (a -> b -> b) -> (a -> b) -> NERAVec' n m a -> b
ifoldr1Map :: ( PosP m -> a -> b -> b) -> ( PosP m -> a -> b) -> NERAVec m a -> b
ifoldr1Map' :: ( PosP' n m -> a -> b -> b) -> ( PosP' n m -> a -> b) -> NERAVec' n m a -> b
map :: (a -> b) -> NERAVec m a -> NERAVec m b
map' :: (a -> b) -> NERAVec' n m a -> NERAVec' n m b
imap :: ( PosP m -> a -> b) -> NERAVec m a -> NERAVec m b
imap' :: ( PosP' n m -> a -> b) -> NERAVec' n m a -> NERAVec' n m b
traverse :: Applicative f => (a -> f b) -> NERAVec m a -> f ( NERAVec m b)
traverse' :: Applicative f => (a -> f b) -> NERAVec' n m a -> f ( NERAVec' n m b)
itraverse :: Applicative f => ( PosP m -> a -> f b) -> NERAVec m a -> f ( NERAVec m b)
itraverse' :: Applicative f => ( PosP' n m -> a -> f b) -> NERAVec' n m a -> f ( NERAVec' n m b)
traverse1 :: Apply f => (a -> f b) -> NERAVec m a -> f ( NERAVec m b)
traverse1' :: Apply f => (a -> f b) -> NERAVec' n m a -> f ( NERAVec' n m b)
itraverse1 :: Apply f => ( PosP m -> a -> f b) -> NERAVec m a -> f ( NERAVec m b)
itraverse1' :: Apply f => ( PosP' n m -> a -> f b) -> NERAVec' n m a -> f ( NERAVec' n m b)
zipWith :: (a -> b -> c) -> NERAVec m a -> NERAVec m b -> NERAVec m c
zipWith' :: (a -> b -> c) -> NERAVec' n m a -> NERAVec' n m b -> NERAVec' n m c
izipWith :: ( PosP m -> a -> b -> c) -> NERAVec m a -> NERAVec m b -> NERAVec m c
izipWith' :: ( PosP' n m -> a -> b -> c) -> NERAVec' n m a -> NERAVec' n m b -> NERAVec' n m c
repeat :: SBinPI b => a -> NERAVec b a
repeat' :: forall b n a. ( SNatI n, SBinPI b) => a -> NERAVec' n b a
universe :: forall b. SBinPI b => NERAVec b ( PosP b)
universe' :: forall n b. ( SNatI n, SBinPI b) => NERAVec' n b ( PosP' n b)
liftArbitrary :: SBinPI b => Gen a -> Gen ( NERAVec b a)
liftArbitrary' :: forall b n a. ( SBinPI b, SNatI n) => Gen a -> Gen ( NERAVec' n b a)
liftShrink :: (a -> [a]) -> NERAVec b a -> [ NERAVec b a]
liftShrink' :: forall b n a. (a -> [a]) -> NERAVec' n b a -> [ NERAVec' n b a]

Random access list

newtype NERAVec (b :: BinP ) a Source #

Non-empty random access list.

Constructors

NE ( NERAVec' ' Z b a)

Instances

Instances details

Functor ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods fmap :: (a -> b0) -> NERAVec b a -> NERAVec b b0 Source # (<$) :: a -> NERAVec b b0 -> NERAVec b a Source #
SBinPI b => Applicative ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods pure :: a -> NERAVec b a Source # (<>) :: NERAVec b (a -> b0) -> NERAVec b a -> NERAVec b b0 Source # liftA2 :: (a -> b0 -> c) -> NERAVec b a -> NERAVec b b0 -> NERAVec b c Source # (>) :: NERAVec b a -> NERAVec b b0 -> NERAVec b b0 Source # (<*) :: NERAVec b a -> NERAVec b b0 -> NERAVec b a Source #
Foldable ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods fold :: Monoid m => NERAVec b m -> m Source # foldMap :: Monoid m => (a -> m) -> NERAVec b a -> m Source # foldMap' :: Monoid m => (a -> m) -> NERAVec b a -> m Source # foldr :: (a -> b0 -> b0) -> b0 -> NERAVec b a -> b0 Source # foldr' :: (a -> b0 -> b0) -> b0 -> NERAVec b a -> b0 Source # foldl :: (b0 -> a -> b0) -> b0 -> NERAVec b a -> b0 Source # foldl' :: (b0 -> a -> b0) -> b0 -> NERAVec b a -> b0 Source # foldr1 :: (a -> a -> a) -> NERAVec b a -> a Source # foldl1 :: (a -> a -> a) -> NERAVec b a -> a Source # toList :: NERAVec b a -> [a] Source # null :: NERAVec b a -> Bool Source # length :: NERAVec b a -> Int Source # elem :: Eq a => a -> NERAVec b a -> Bool Source # maximum :: Ord a => NERAVec b a -> a Source # minimum :: Ord a => NERAVec b a -> a Source # sum :: Num a => NERAVec b a -> a Source # product :: Num a => NERAVec b a -> a Source #
Traversable ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods traverse :: Applicative f => (a -> f b0) -> NERAVec b a -> f ( NERAVec b b0) Source # sequenceA :: Applicative f => NERAVec b (f a) -> f ( NERAVec b a) Source # mapM :: Monad m => (a -> m b0) -> NERAVec b a -> m ( NERAVec b b0) Source # sequence :: Monad m => NERAVec b (m a) -> m ( NERAVec b a) Source #
SBinPI b => Arbitrary1 ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods liftArbitrary :: Gen a -> Gen ( NERAVec b a) Source # liftShrink :: (a -> [a]) -> NERAVec b a -> [ NERAVec b a] Source #
SBinPI b => Distributive ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods distribute :: Functor f => f ( NERAVec b a) -> NERAVec b (f a) Source # collect :: Functor f => (a -> NERAVec b b0) -> f a -> NERAVec b (f b0) Source # distributeM :: Monad m => m ( NERAVec b a) -> NERAVec b (m a) Source # collectM :: Monad m => (a -> NERAVec b b0) -> m a -> NERAVec b (m b0) Source #
SBinPI b => Representable ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Associated Types type Rep ( NERAVec b) Source # Methods tabulate :: ( Rep ( NERAVec b) -> a) -> NERAVec b a Source # index :: NERAVec b a -> Rep ( NERAVec b) -> a Source #
Traversable1 ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods traverse1 :: Apply f => (a -> f b0) -> NERAVec b a -> f ( NERAVec b b0) Source # sequence1 :: Apply f => NERAVec b (f b0) -> f ( NERAVec b b0) Source #
Apply ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods (<.>) :: NERAVec b (a -> b0) -> NERAVec b a -> NERAVec b b0 Source # (.>) :: NERAVec b a -> NERAVec b b0 -> NERAVec b b0 Source # (<.) :: NERAVec b a -> NERAVec b b0 -> NERAVec b a Source # liftF2 :: (a -> b0 -> c) -> NERAVec b a -> NERAVec b b0 -> NERAVec b c Source #
Foldable1 ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods fold1 :: Semigroup m => NERAVec b m -> m Source # foldMap1 :: Semigroup m => (a -> m) -> NERAVec b a -> m Source # toNonEmpty :: NERAVec b a -> NonEmpty a Source #
Eq a => Eq ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods (==) :: NERAVec b a -> NERAVec b a -> Bool Source # (/=) :: NERAVec b a -> NERAVec b a -> Bool Source #
Ord a => Ord ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods compare :: NERAVec b a -> NERAVec b a -> Ordering Source # (<) :: NERAVec b a -> NERAVec b a -> Bool Source # (<=) :: NERAVec b a -> NERAVec b a -> Bool Source # (>) :: NERAVec b a -> NERAVec b a -> Bool Source # (>=) :: NERAVec b a -> NERAVec b a -> Bool Source # max :: NERAVec b a -> NERAVec b a -> NERAVec b a Source # min :: NERAVec b a -> NERAVec b a -> NERAVec b a Source #
Show a => Show ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods showsPrec :: Int -> NERAVec b a -> ShowS Source # show :: NERAVec b a -> String Source # showList :: [ NERAVec b a] -> ShowS Source #
Semigroup a => Semigroup ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods (<>) :: NERAVec b a -> NERAVec b a -> NERAVec b a Source # sconcat :: NonEmpty ( NERAVec b a) -> NERAVec b a Source # stimes :: Integral b0 => b0 -> NERAVec b a -> NERAVec b a Source #
( Monoid a, SBinPI b) => Monoid ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods mempty :: NERAVec b a Source # mappend :: NERAVec b a -> NERAVec b a -> NERAVec b a Source # mconcat :: [ NERAVec b a] -> NERAVec b a Source #
( SBinPI b, Function a) => Function ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods function :: ( NERAVec b a -> b0) -> NERAVec b a :-> b0 Source #
( SBinPI b, Arbitrary a) => Arbitrary ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods arbitrary :: Gen ( NERAVec b a) Source # shrink :: NERAVec b a -> [ NERAVec b a] Source #
CoArbitrary a => CoArbitrary ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods coarbitrary :: NERAVec b a -> Gen b0 -> Gen b0 Source #
NFData a => NFData ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods rnf :: NERAVec b a -> () Source #
Hashable a => Hashable ( NERAVec b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods hashWithSalt :: Int -> NERAVec b a -> Int Source # hash :: NERAVec b a -> Int Source #
type Rep ( NERAVec b) Source #
Instance details Defined in Data.RAVec.NonEmpty type Rep ( NERAVec b) = PosP b

data NERAVec' (n :: Nat ) (b :: BinP ) a where Source #

Non-empty random access list, undelying representation.

Constructors

Last :: Tree n a -> NERAVec' n ' BE a
Cons0 :: NERAVec' (' S n) b a -> NERAVec' n (' B0 b) a
Cons1 :: Tree n a -> NERAVec' (' S n) b a -> NERAVec' n (' B1 b) a

Instances

Instances details

Functor ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods fmap :: (a -> b0) -> NERAVec' n b a -> NERAVec' n b b0 Source # (<$) :: a -> NERAVec' n b b0 -> NERAVec' n b a Source #
( SBinPI b, SNatI n) => Applicative ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods pure :: a -> NERAVec' n b a Source # (<>) :: NERAVec' n b (a -> b0) -> NERAVec' n b a -> NERAVec' n b b0 Source # liftA2 :: (a -> b0 -> c) -> NERAVec' n b a -> NERAVec' n b b0 -> NERAVec' n b c Source # (>) :: NERAVec' n b a -> NERAVec' n b b0 -> NERAVec' n b b0 Source # (<*) :: NERAVec' n b a -> NERAVec' n b b0 -> NERAVec' n b a Source #
Foldable ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods fold :: Monoid m => NERAVec' n b m -> m Source # foldMap :: Monoid m => (a -> m) -> NERAVec' n b a -> m Source # foldMap' :: Monoid m => (a -> m) -> NERAVec' n b a -> m Source # foldr :: (a -> b0 -> b0) -> b0 -> NERAVec' n b a -> b0 Source # foldr' :: (a -> b0 -> b0) -> b0 -> NERAVec' n b a -> b0 Source # foldl :: (b0 -> a -> b0) -> b0 -> NERAVec' n b a -> b0 Source # foldl' :: (b0 -> a -> b0) -> b0 -> NERAVec' n b a -> b0 Source # foldr1 :: (a -> a -> a) -> NERAVec' n b a -> a Source # foldl1 :: (a -> a -> a) -> NERAVec' n b a -> a Source # toList :: NERAVec' n b a -> [a] Source # null :: NERAVec' n b a -> Bool Source # length :: NERAVec' n b a -> Int Source # elem :: Eq a => a -> NERAVec' n b a -> Bool Source # maximum :: Ord a => NERAVec' n b a -> a Source # minimum :: Ord a => NERAVec' n b a -> a Source # sum :: Num a => NERAVec' n b a -> a Source # product :: Num a => NERAVec' n b a -> a Source #
Traversable ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods traverse :: Applicative f => (a -> f b0) -> NERAVec' n b a -> f ( NERAVec' n b b0) Source # sequenceA :: Applicative f => NERAVec' n b (f a) -> f ( NERAVec' n b a) Source # mapM :: Monad m => (a -> m b0) -> NERAVec' n b a -> m ( NERAVec' n b b0) Source # sequence :: Monad m => NERAVec' n b (m a) -> m ( NERAVec' n b a) Source #
( SBinPI b, SNatI n) => Arbitrary1 ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods liftArbitrary :: Gen a -> Gen ( NERAVec' n b a) Source # liftShrink :: (a -> [a]) -> NERAVec' n b a -> [ NERAVec' n b a] Source #
( SBinPI b, SNatI n) => Distributive ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods distribute :: Functor f => f ( NERAVec' n b a) -> NERAVec' n b (f a) Source # collect :: Functor f => (a -> NERAVec' n b b0) -> f a -> NERAVec' n b (f b0) Source # distributeM :: Monad m => m ( NERAVec' n b a) -> NERAVec' n b (m a) Source # collectM :: Monad m => (a -> NERAVec' n b b0) -> m a -> NERAVec' n b (m b0) Source #
( SBinPI b, SNatI n) => Representable ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Associated Types type Rep ( NERAVec' n b) Source # Methods tabulate :: ( Rep ( NERAVec' n b) -> a) -> NERAVec' n b a Source # index :: NERAVec' n b a -> Rep ( NERAVec' n b) -> a Source #
Traversable1 ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods traverse1 :: Apply f => (a -> f b0) -> NERAVec' n b a -> f ( NERAVec' n b b0) Source # sequence1 :: Apply f => NERAVec' n b (f b0) -> f ( NERAVec' n b b0) Source #
Apply ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods (<.>) :: NERAVec' n b (a -> b0) -> NERAVec' n b a -> NERAVec' n b b0 Source # (.>) :: NERAVec' n b a -> NERAVec' n b b0 -> NERAVec' n b b0 Source # (<.) :: NERAVec' n b a -> NERAVec' n b b0 -> NERAVec' n b a Source # liftF2 :: (a -> b0 -> c) -> NERAVec' n b a -> NERAVec' n b b0 -> NERAVec' n b c Source #
Foldable1 ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods fold1 :: Semigroup m => NERAVec' n b m -> m Source # foldMap1 :: Semigroup m => (a -> m) -> NERAVec' n b a -> m Source # toNonEmpty :: NERAVec' n b a -> NonEmpty a Source #
Eq a => Eq ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods (==) :: NERAVec' n b a -> NERAVec' n b a -> Bool Source # (/=) :: NERAVec' n b a -> NERAVec' n b a -> Bool Source #
Ord a => Ord ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods compare :: NERAVec' n b a -> NERAVec' n b a -> Ordering Source # (<) :: NERAVec' n b a -> NERAVec' n b a -> Bool Source # (<=) :: NERAVec' n b a -> NERAVec' n b a -> Bool Source # (>) :: NERAVec' n b a -> NERAVec' n b a -> Bool Source # (>=) :: NERAVec' n b a -> NERAVec' n b a -> Bool Source # max :: NERAVec' n b a -> NERAVec' n b a -> NERAVec' n b a Source # min :: NERAVec' n b a -> NERAVec' n b a -> NERAVec' n b a Source #
Show a => Show ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods showsPrec :: Int -> NERAVec' n b a -> ShowS Source # show :: NERAVec' n b a -> String Source # showList :: [ NERAVec' n b a] -> ShowS Source #
Semigroup a => Semigroup ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods (<>) :: NERAVec' n b a -> NERAVec' n b a -> NERAVec' n b a Source # sconcat :: NonEmpty ( NERAVec' n b a) -> NERAVec' n b a Source # stimes :: Integral b0 => b0 -> NERAVec' n b a -> NERAVec' n b a Source #
( Monoid a, SBinPI b, SNatI n) => Monoid ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods mempty :: NERAVec' n b a Source # mappend :: NERAVec' n b a -> NERAVec' n b a -> NERAVec' n b a Source # mconcat :: [ NERAVec' n b a] -> NERAVec' n b a Source #
( SNatI n, SBinPI b, Function a) => Function ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods function :: ( NERAVec' n b a -> b0) -> NERAVec' n b a :-> b0 Source #
CoArbitrary a => CoArbitrary ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods coarbitrary :: NERAVec' n b a -> Gen b0 -> Gen b0 Source #
NFData a => NFData ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods rnf :: NERAVec' n b a -> () Source #
Hashable a => Hashable ( NERAVec' n b a) Source #
Instance details Defined in Data.RAVec.NonEmpty Methods hashWithSalt :: Int -> NERAVec' n b a -> Int Source # hash :: NERAVec' n b a -> Int Source #
type Rep ( NERAVec' n b) Source #
Instance details Defined in Data.RAVec.NonEmpty type Rep ( NERAVec' n b) = PosP' n b

Construction

singleton :: forall a. a -> NERAVec BinP1 a Source #

singleton' :: a -> NERAVec' ' Z BinP1 a Source #

cons :: forall a b. a -> NERAVec b a -> NERAVec ( Succ b) a Source #

cons for non-empty rals.

consTree :: Tree n a -> NERAVec' n b a -> NERAVec' n ( Succ b) a Source #

withCons :: SBinPI b => a -> NERAVec b a -> ( SBinPI ( Succ b) => NERAVec ( Succ b) a -> r) -> r Source #

withCons for non-empty rals.

withConsTree :: SBinP b -> Tree n a -> NERAVec' n b a -> ( SBinPI ( Succ b) => NERAVec' n ( Succ b) a -> r) -> r Source #

Conversion

toList :: NERAVec b a -> [a] Source #

toList' :: NERAVec' n b a -> [a] Source #

toNonEmpty :: NERAVec b a -> NonEmpty a Source #

toNonEmpty' :: NERAVec' n b a -> NonEmpty a Source #

reifyNonEmpty :: NonEmpty a -> ( forall b. SBinPI b => NERAVec b a -> r) -> r Source #

reifyNonEmpty' :: forall a r. NonEmpty a -> ( forall b. SBinPI b => NERAVec' ' Z b a -> r) -> r Source #

Indexing

(!) :: NERAVec b a -> PosP b -> a Source #

index' :: NERAVec' n b a -> PosP' n b -> a Source #

tabulate :: SBinPI b => ( PosP b -> a) -> NERAVec b a Source #

tabulate' :: forall b n a. ( SBinPI b, SNatI n) => ( PosP' n b -> a) -> NERAVec' n b a Source #

unsingleton :: NERAVec ' BE a -> a Source #

head :: NERAVec b a -> a Source #

head' :: NERAVec' n b a -> a Source #

last :: NERAVec b a -> a Source #

last' :: NERAVec' n b a -> a Source #

Folds

foldMap :: Monoid m => (a -> m) -> NERAVec b a -> m Source #

foldMap' :: Monoid m => (a -> m) -> NERAVec' n b a -> m Source #

foldMap1 :: Semigroup m => (a -> m) -> NERAVec b a -> m Source #

foldMap1' :: Semigroup m => (a -> m) -> NERAVec' n b a -> m Source #

ifoldMap :: Monoid m => ( PosP b -> a -> m) -> NERAVec b a -> m Source #

ifoldMap' :: Monoid m => ( PosP' n b -> a -> m) -> NERAVec' n b a -> m Source #

ifoldMap1 :: Semigroup m => ( PosP b -> a -> m) -> NERAVec b a -> m Source #

ifoldMap1' :: Semigroup m => ( PosP' n b -> a -> m) -> NERAVec' n b a -> m Source #

foldr :: (a -> b -> b) -> b -> NERAVec m a -> b Source #

foldr' :: (a -> b -> b) -> b -> NERAVec' n m a -> b Source #

ifoldr :: ( PosP m -> a -> b -> b) -> b -> NERAVec m a -> b Source #

ifoldr' :: ( PosP' n m -> a -> b -> b) -> b -> NERAVec' n m a -> b Source #

foldr1Map :: (a -> b -> b) -> (a -> b) -> NERAVec m a -> b Source #

foldr1Map' :: (a -> b -> b) -> (a -> b) -> NERAVec' n m a -> b Source #

ifoldr1Map :: ( PosP m -> a -> b -> b) -> ( PosP m -> a -> b) -> NERAVec m a -> b Source #

ifoldr1Map' :: ( PosP' n m -> a -> b -> b) -> ( PosP' n m -> a -> b) -> NERAVec' n m a -> b Source #

Mapping

map :: (a -> b) -> NERAVec m a -> NERAVec m b Source #

map' :: (a -> b) -> NERAVec' n m a -> NERAVec' n m b Source #

imap :: ( PosP m -> a -> b) -> NERAVec m a -> NERAVec m b Source #

imap' :: ( PosP' n m -> a -> b) -> NERAVec' n m a -> NERAVec' n m b Source #

traverse :: Applicative f => (a -> f b) -> NERAVec m a -> f ( NERAVec m b) Source #

traverse' :: Applicative f => (a -> f b) -> NERAVec' n m a -> f ( NERAVec' n m b) Source #

itraverse :: Applicative f => ( PosP m -> a -> f b) -> NERAVec m a -> f ( NERAVec m b) Source #

itraverse' :: Applicative f => ( PosP' n m -> a -> f b) -> NERAVec' n m a -> f ( NERAVec' n m b) Source #

traverse1 :: Apply f => (a -> f b) -> NERAVec m a -> f ( NERAVec m b) Source #

traverse1' :: Apply f => (a -> f b) -> NERAVec' n m a -> f ( NERAVec' n m b) Source #

itraverse1 :: Apply f => ( PosP m -> a -> f b) -> NERAVec m a -> f ( NERAVec m b) Source #

itraverse1' :: Apply f => ( PosP' n m -> a -> f b) -> NERAVec' n m a -> f ( NERAVec' n m b) Source #

Zipping

zipWith :: (a -> b -> c) -> NERAVec m a -> NERAVec m b -> NERAVec m c Source #

zipWith' :: (a -> b -> c) -> NERAVec' n m a -> NERAVec' n m b -> NERAVec' n m c Source #

Zip two NERAVec' s with a function.

izipWith :: ( PosP m -> a -> b -> c) -> NERAVec m a -> NERAVec m b -> NERAVec m c Source #

izipWith' :: ( PosP' n m -> a -> b -> c) -> NERAVec' n m a -> NERAVec' n m b -> NERAVec' n m c Source #

Zip two NERAVec' s with a function which also takes PosP' index.

repeat :: SBinPI b => a -> NERAVec b a Source #

repeat' :: forall b n a. ( SNatI n, SBinPI b) => a -> NERAVec' n b a Source #

Universe

universe :: forall b. SBinPI b => NERAVec b ( PosP b) Source #

universe' :: forall n b. ( SNatI n, SBinPI b) => NERAVec' n b ( PosP' n b) Source #

QuickCheck

liftArbitrary :: SBinPI b => Gen a -> Gen ( NERAVec b a) Source #

liftArbitrary' :: forall b n a. ( SBinPI b, SNatI n) => Gen a -> Gen ( NERAVec' n b a) Source #

liftShrink :: (a -> [a]) -> NERAVec b a -> [ NERAVec b a] Source #

liftShrink' :: forall b n a. (a -> [a]) -> NERAVec' n b a -> [ NERAVec' n b a] Source #