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

Safe HaskellNone
LanguageHaskell2010

Data.RAList.Lens

Contents

Synopsis

Indexing

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

Orphan instances

FunctorWithIndex Int RAList Source # 
Instance details

Methods

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

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

FoldableWithIndex Int RAList Source # 
Instance details

Methods

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

ifolded :: IndexedFold Int (RAList a) a #

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

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

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

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

TraversableWithIndex Int RAList Source # 
Instance details

Methods

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

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

Ixed (RAList a) Source # 
Instance details

Methods

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

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

Methods

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