Moduleral-0.2.2Haskell2010

Data.RAVec.NonEmpty

Non-empty length-indexed random access list.

Contents

Random access list
Construction
Conversion
Indexing
Folds
Mapping
Zipping
Universe
QuickCheck

Synopsis

newtype NERAVec
data NERAVec'
value singleton
value singleton'
value cons
value consTree
value withCons
value withConsTree
value toList
value toList'
value toNonEmpty
value toNonEmpty'
value reifyNonEmpty
value reifyNonEmpty'
value !
value index'
value tabulate
value tabulate'
value unsingleton
value head
value head'
value last
value last'
value foldMap
value foldMap'
value foldMap1
value foldMap1'
value ifoldMap
value ifoldMap'
value ifoldMap1
value ifoldMap1'
value foldr
value foldr'
value ifoldr
value ifoldr'
value foldr1Map
value foldr1Map'
value ifoldr1Map
value ifoldr1Map'
value map
value map'
value imap
value imap'
value traverse
value traverse'
value itraverse
value itraverse'
value traverse1
value traverse1'
value itraverse1
value itraverse1'
value zipWith
value zipWith'
value izipWith
value izipWith'
value repeat
value repeat'
value universe
value universe'
value liftArbitrary
value liftArbitrary'
value liftShrink
value liftShrink'

Packageral-0.2.2
Exports63
LanguageHaskell2010
LicenceGPL-2.0-or-later
SourceNonEmpty.hs

Random access list

newtypenewtype NERAVec (b :: BinP) a

Source#

Non-empty random access list.

Constructors

NE (NERAVec' 'Z b a)

Instances24Functor, Applicative, Foldable, Traversable, Foldable1, Arbitrary1, …

Functor (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
SBinPI b => Applicative (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Foldable (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Traversable (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Foldable1 (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
SBinPI b => Arbitrary1 (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
SBinPI b => Distributive (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Apply (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Traversable1 (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
SBinPI b => Representable (NERAVec b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
FoldableWithIndex (PosP n) (NERAVec n)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
FunctorWithIndex (PosP n) (NERAVec n)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
TraversableWithIndex (PosP n) (NERAVec n)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Eq a => Eq (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Ord a => Ord (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Show a => Show (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Semigroup a => Semigroup (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(Monoid a, SBinPI b) => Monoid (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
NFData a => NFData (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(SBinPI b, Arbitrary a) => Arbitrary (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
CoArbitrary a => CoArbitrary (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(SBinPI b, Function a) => Function (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Hashable a => Hashable (NERAVec b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
type Rep (NERAVec b) = PosP bDefined in ral-0.2.2 · Data.RAVec.NonEmpty

datadata 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) b1 a -> NERAVec' n ('B0 b1) a
Cons1 :: Tree n a -> NERAVec' ('S n) b1 a -> NERAVec' n ('B1 b1) a

Instances23Functor, Applicative, Foldable, Traversable, Foldable1, Arbitrary1, …

Functor (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(SBinPI b, SNatI n) => Applicative (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Foldable (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Traversable (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Foldable1 (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(SBinPI b, SNatI n) => Arbitrary1 (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(SBinPI b, SNatI n) => Distributive (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Apply (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Traversable1 (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(SBinPI b, SNatI n) => Representable (NERAVec' n b)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
FoldableWithIndex (PosP' n m) (NERAVec' n m)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
FunctorWithIndex (PosP' n m) (NERAVec' n m)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
TraversableWithIndex (PosP' n m) (NERAVec' n m)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Eq a => Eq (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Ord a => Ord (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Show a => Show (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Semigroup a => Semigroup (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(Monoid a, SBinPI b, SNatI n) => Monoid (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
NFData a => NFData (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
CoArbitrary a => CoArbitrary (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
(SNatI n, SBinPI b, Function a) => Function (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
Hashable a => Hashable (NERAVec' n b a)Defined in ral-0.2.2 · Data.RAVec.NonEmpty
type Rep (NERAVec' n b) = PosP' n bDefined in ral-0.2.2 · Data.RAVec.NonEmpty

Construction

valuesingleton :: a -> NERAVec BinP1 a

valuesingleton' :: a -> NERAVec' 'Z BinP1 a

valuecons :: a -> NERAVec b a -> NERAVec (Succ b) a

Source#

cons for non-empty rals.

valueconsTree :: Tree n a -> NERAVec' n b a -> NERAVec' n (Succ b) a

valuewithCons

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

Source#

withCons for non-empty rals.

valuewithConsTree

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

Conversion

valuetoList :: NERAVec b a -> [a]

valuetoList' :: NERAVec' n b a -> [a]

valuetoNonEmpty :: NERAVec b a -> NonEmpty a

valuetoNonEmpty' :: NERAVec' n b a -> NonEmpty a

valuereifyNonEmpty

:: NonEmpty a
-> forall (b :: BinP). SBinPI b => NERAVec b a -> r
-> r

valuereifyNonEmpty'

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

Indexing

value(!) :: NERAVec b a -> PosP b -> a

valueindex' :: NERAVec' n b a -> PosP' n b -> a

valuetabulate :: SBinPI b => (PosP b -> a) -> NERAVec b a

valuetabulate' :: (SBinPI b, SNatI n) => (PosP' n b -> a) -> NERAVec' n b a

valueunsingleton :: NERAVec 'BE a -> a

valuehead :: NERAVec b a -> a

valuehead' :: NERAVec' n b a -> a

valuelast :: NERAVec b a -> a

valuelast' :: NERAVec' n b a -> a

Folds

valuefoldMap :: Monoid m => (a -> m) -> NERAVec b a -> m

valuefoldMap' :: Monoid m => (a -> m) -> NERAVec' n b a -> m

valuefoldMap1 :: Semigroup m => (a -> m) -> NERAVec b a -> m

valuefoldMap1' :: Semigroup m => (a -> m) -> NERAVec' n b a -> m

valueifoldMap :: Monoid m => (PosP b -> a -> m) -> NERAVec b a -> m

valueifoldMap' :: Monoid m => (PosP' n b -> a -> m) -> NERAVec' n b a -> m

valueifoldMap1 :: Semigroup m => (PosP b -> a -> m) -> NERAVec b a -> m

valueifoldMap1' :: Semigroup m => (PosP' n b -> a -> m) -> NERAVec' n b a -> m

valuefoldr :: (a -> b -> b) -> b -> NERAVec m a -> b

valuefoldr' :: (a -> b -> b) -> b -> NERAVec' n m a -> b

valueifoldr :: (PosP m -> a -> b -> b) -> b -> NERAVec m a -> b

valueifoldr' :: (PosP' n m -> a -> b -> b) -> b -> NERAVec' n m a -> b

valuefoldr1Map :: (a -> b -> b) -> (a -> b) -> NERAVec m a -> b

valuefoldr1Map' :: (a -> b -> b) -> (a -> b) -> NERAVec' n m a -> b

valueifoldr1Map

:: PosP m -> a -> b -> b
-> PosP m -> a -> b
-> NERAVec m a
-> b

valueifoldr1Map'

:: PosP' n m -> a -> b -> b
-> PosP' n m -> a -> b
-> NERAVec' n m a
-> b

Mapping

valuemap :: (a -> b) -> NERAVec m a -> NERAVec m b

valuemap' :: (a -> b) -> NERAVec' n m a -> NERAVec' n m b

valueimap :: (PosP m -> a -> b) -> NERAVec m a -> NERAVec m b

valueimap' :: (PosP' n m -> a -> b) -> NERAVec' n m a -> NERAVec' n m b

valuetraverse :: Applicative f => (a -> f b) -> NERAVec m a -> f (NERAVec m b)

valuetraverse'

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

valueitraverse

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

valueitraverse'

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

valuetraverse1 :: Apply f => (a -> f b) -> NERAVec m a -> f (NERAVec m b)

valuetraverse1' :: Apply f => (a -> f b) -> NERAVec' n m a -> f (NERAVec' n m b)

valueitraverse1

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

valueitraverse1'

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

Zipping

valuezipWith :: (a -> b -> c) -> NERAVec m a -> NERAVec m b -> NERAVec m c

valuezipWith'

:: a -> b -> c
-> NERAVec' n m a
-> NERAVec' n m b
-> NERAVec' n m c

Source#

Zip two NERAVec's with a function.

valueizipWith

:: PosP m -> a -> b -> c
-> NERAVec m a
-> NERAVec m b
-> NERAVec m c

valueizipWith'

:: 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.

valuerepeat :: SBinPI b => a -> NERAVec b a

valuerepeat' :: (SNatI n, SBinPI b) => a -> NERAVec' n b a

Universe

valueuniverse :: SBinPI b => NERAVec b (PosP b)

valueuniverse' :: (SNatI n, SBinPI b) => NERAVec' n b (PosP' n b)

QuickCheck

valueliftArbitrary :: SBinPI b => Gen a -> Gen (NERAVec b a)

valueliftArbitrary' :: (SBinPI b, SNatI n) => Gen a -> Gen (NERAVec' n b a)

valueliftShrink :: (a -> [a]) -> NERAVec b a -> [NERAVec b a]

valueliftShrink' :: (a -> [a]) -> NERAVec' n b a -> [NERAVec' n b a]