Data.RAVec.Tree.DF.Lens

Indexing

ix :: Wrd n -> Lens' (Tree n a) a

Index lens.

>>> let tree = Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'c') (Leaf 'd'))
>>> tree & ix (W1 $ W0 WE) .~ 'z'
Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'z') (Leaf 'd'))

Orphan instances

Ixed (Tree n a)

Methods

ix :: Index (Tree n a) -> Traversal' (Tree n a) (IxValue (Tree n a))

SNatI n => Each (Tree n a) (Tree n b) a b

Methods

each :: Traversal (Tree n a) (Tree n b) a b