ral-lens-0.1: Length-indexed random access lists: lens utilities.

Safe HaskellNone
LanguageHaskell2010

Data.RAList.NonEmpty.Lens

Contents

Synopsis

Indexing

ix :: forall f a. Applicative f => Int -> LensLike' f (NERAList a) a Source #

Orphan instances

FunctorWithIndex Int NERAList Source # 
Instance details

Methods

imap :: (Int -> a -> b) -> NERAList a -> NERAList b #

imapped :: IndexedSetter Int (NERAList a) (NERAList b) a b #

FoldableWithIndex Int NERAList Source # 
Instance details

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> NERAList a -> m #

ifolded :: IndexedFold Int (NERAList a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> NERAList a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> NERAList a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> NERAList a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> NERAList a -> b #

TraversableWithIndex Int NERAList Source # 
Instance details

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> NERAList a -> f (NERAList b) #

itraversed :: IndexedTraversal Int (NERAList a) (NERAList b) a b #

Ixed (NERAList a) Source # 
Instance details

Methods

ix :: Index (NERAList a) -> Traversal' (NERAList a) (IxValue (NERAList a)) #

Each (NERAList a) (NERAList b) a b Source # 
Instance details

Methods

each :: Traversal (NERAList a) (NERAList b) a b #