Chiasma.Lens.Tree

Documentation

newtype NodeIndexTree l p

Constructors

NodeIndexTree

Fields

• nitTree :: Tree l p

Instances

(Show l, Show p) => Show (NodeIndexTree l p)

Defined in Chiasma.Lens.Tree

Methods

showsPrec :: Int -> NodeIndexTree l p -> ShowS

show :: NodeIndexTree l p -> String

showList :: [NodeIndexTree l p] -> ShowS

(Eq l, Eq p) => Eq (NodeIndexTree l p)

Defined in Chiasma.Lens.Tree

Methods

(==) :: NodeIndexTree l p -> NodeIndexTree l p -> Bool

(/=) :: NodeIndexTree l p -> NodeIndexTree l p -> Bool

Identifiable l => Ixed (NodeIndexTree l p)

Defined in Chiasma.Lens.Tree

Methods

ix :: Index (NodeIndexTree l p) -> Traversal' (NodeIndexTree l p) (IxValue (NodeIndexTree l p))

(Data l, Data p) => Plated (NodeIndexTree l p)

Defined in Chiasma.Lens.Tree

Methods

plate :: Traversal' (NodeIndexTree l p) (NodeIndexTree l p)

HasNodeIndexTree (NodeIndexTree l p) l p

Defined in Chiasma.Lens.Tree

Methods

nodeIndexTree :: Lens' (NodeIndexTree l p) (NodeIndexTree l p)

_nitTree :: Lens' (NodeIndexTree l p) (Tree l p)

type Index (NodeIndexTree _1 _2)

Defined in Chiasma.Lens.Tree

type Index (NodeIndexTree _1 _2) = Ident

type IxValue (NodeIndexTree l _1)

Defined in Chiasma.Lens.Tree

type IxValue (NodeIndexTree l _1) = l

class HasNodeIndexTree c l p | c -> l p where

Minimal complete definition

nodeIndexTree

Methods

nodeIndexTree :: Lens' c (NodeIndexTree l p)

_nitTree :: Lens' c (Tree l p)

Instances

HasNodeIndexTree (NodeIndexTree l p) l p

Defined in Chiasma.Lens.Tree

Methods

nodeIndexTree :: Lens' (NodeIndexTree l p) (NodeIndexTree l p)

_nitTree :: Lens' (NodeIndexTree l p) (Tree l p)

newtype LeafIndexTree l p

Constructors

LeafIndexTree

Fields

• litTree :: Tree l p

Instances

(Show l, Show p) => Show (LeafIndexTree l p)

Defined in Chiasma.Lens.Tree

Methods

showsPrec :: Int -> LeafIndexTree l p -> ShowS

show :: LeafIndexTree l p -> String

showList :: [LeafIndexTree l p] -> ShowS

(Eq l, Eq p) => Eq (LeafIndexTree l p)

Defined in Chiasma.Lens.Tree

Methods

(==) :: LeafIndexTree l p -> LeafIndexTree l p -> Bool

(/=) :: LeafIndexTree l p -> LeafIndexTree l p -> Bool

Identifiable p => Ixed (LeafIndexTree l p)

Defined in Chiasma.Lens.Tree

Methods

ix :: Index (LeafIndexTree l p) -> Traversal' (LeafIndexTree l p) (IxValue (LeafIndexTree l p))

(Data l, Data p) => Plated (LeafIndexTree l p)

Defined in Chiasma.Lens.Tree

Methods

plate :: Traversal' (LeafIndexTree l p) (LeafIndexTree l p)

HasLeafIndexTree (LeafIndexTree l p) l p

Defined in Chiasma.Lens.Tree

Methods

leafIndexTree :: Lens' (LeafIndexTree l p) (LeafIndexTree l p)

_litTree :: Lens' (LeafIndexTree l p) (Tree l p)

type Index (LeafIndexTree _1 _2)

Defined in Chiasma.Lens.Tree

type Index (LeafIndexTree _1 _2) = Ident

type IxValue (LeafIndexTree _1 p)

Defined in Chiasma.Lens.Tree

type IxValue (LeafIndexTree _1 p) = p

class HasLeafIndexTree c l p | c -> l p where

Minimal complete definition

leafIndexTree

Methods

leafIndexTree :: Lens' c (LeafIndexTree l p)

_litTree :: Lens' c (Tree l p)

Instances

HasLeafIndexTree (LeafIndexTree l p) l p

Defined in Chiasma.Lens.Tree

Methods

leafIndexTree :: Lens' (LeafIndexTree l p) (LeafIndexTree l p)

_litTree :: Lens' (LeafIndexTree l p) (Tree l p)

plateWrap :: (Data l, Data p) => (Tree l p -> t l p) -> (t l p -> Tree l p) -> Traversal' (t l p) (t l p)

type LayoutIndexTree = NodeIndexTree LayoutView PaneView

type PaneIndexTree = LeafIndexTree LayoutView PaneView

nodeTraversal :: Traversal' (Tree l p) l

nodeByIdentTraversal :: Identifiable l => Ident -> Traversal' (Tree l p) l

leafDataTraversal :: Traversal' (Tree l p) p

leafByIdentTraversal :: Identifiable p => Ident -> Traversal' (Tree l p) p

nodesByIdentRecursive :: (Identifiable l, Data l, Data p) => Ident -> Fold (NodeIndexTree l p) l

nodesIdent :: forall l p. Identifiable l => Data l => Data p => Ident -> Fold (Tree l p) l

nodeByIdent :: forall l p. Identifiable l => Data l => Data p => Ident -> Tree l p -> Maybe l

nodesByIdent :: forall l p. Identifiable l => Data l => Data p => Ident -> Tree l p -> [l]

leavesByIdentRecursive :: forall l p. Identifiable p => Data l => Data p => Ident -> Fold (LeafIndexTree l p) p

leavesIdent :: forall l p. Identifiable p => Data l => Data p => Ident -> Fold (Tree l p) p

leafByIdent :: forall l p. Identifiable p => Data l => Data p => Ident -> Tree l p -> Maybe p

leavesByIdent :: forall l p. Identifiable p => Data l => Data p => Ident -> Tree l p -> [p]

modifyLeafByIdent :: (Identifiable p, Data l, Data p) => Ident -> (p -> p) -> Tree l p -> Tree l p

subtreesWithLayout :: forall l p m. Monad m => ((l, TreeSub l p) -> m (l, TreeSub l p)) -> Tree l p -> m (Tree l p)

subtrees :: forall l p m. Monad m => (TreeSub l p -> m (TreeSub l p)) -> Tree l p -> m (Tree l p)

treesAndSubs :: Monad m => (Tree l p -> m (Tree l p)) -> (TreeSub l p -> m (TreeSub l p)) -> Tree l p -> m (Tree l p)