chiasma-0.10.1.0: A tmux client for Polysemy
Safe HaskellSafe-Inferred
LanguageGHC2021

Chiasma.Lens.Tree

Documentation

newtype NodeIndexTree l p Source #

Constructors

NodeIndexTree 

Fields

Instances

Instances details
(Show l, Show p) => Show (NodeIndexTree l p) Source # 
Instance details

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) Source # 
Instance details

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) Source # 
Instance details

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) Source # 
Instance details

Defined in Chiasma.Lens.Tree

Methods

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

HasNodeIndexTree (NodeIndexTree l p) l p Source # 
Instance details

Defined in Chiasma.Lens.Tree

Methods

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

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

type Index (NodeIndexTree _1 _2) Source # 
Instance details

Defined in Chiasma.Lens.Tree

type Index (NodeIndexTree _1 _2) = Ident
type IxValue (NodeIndexTree l _1) Source # 
Instance details

Defined in Chiasma.Lens.Tree

type IxValue (NodeIndexTree l _1) = l

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

Minimal complete definition

nodeIndexTree

Methods

nodeIndexTree :: Lens' c (NodeIndexTree l p) Source #

_nitTree :: Lens' c (Tree l p) Source #

Instances

Instances details
HasNodeIndexTree (NodeIndexTree l p) l p Source # 
Instance details

Defined in Chiasma.Lens.Tree

Methods

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

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

newtype LeafIndexTree l p Source #

Constructors

LeafIndexTree 

Fields

Instances

Instances details
(Show l, Show p) => Show (LeafIndexTree l p) Source # 
Instance details

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) Source # 
Instance details

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) Source # 
Instance details

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) Source # 
Instance details

Defined in Chiasma.Lens.Tree

Methods

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

HasLeafIndexTree (LeafIndexTree l p) l p Source # 
Instance details

Defined in Chiasma.Lens.Tree

Methods

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

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

type Index (LeafIndexTree _1 _2) Source # 
Instance details

Defined in Chiasma.Lens.Tree

type Index (LeafIndexTree _1 _2) = Ident
type IxValue (LeafIndexTree _1 p) Source # 
Instance details

Defined in Chiasma.Lens.Tree

type IxValue (LeafIndexTree _1 p) = p

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

Minimal complete definition

leafIndexTree

Methods

leafIndexTree :: Lens' c (LeafIndexTree l p) Source #

_litTree :: Lens' c (Tree l p) Source #

Instances

Instances details
HasLeafIndexTree (LeafIndexTree l p) l p Source # 
Instance details

Defined in Chiasma.Lens.Tree

Methods

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

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

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

type LayoutIndexTree = NodeIndexTree LayoutView PaneView Source #

type PaneIndexTree = LeafIndexTree LayoutView PaneView Source #

nodeTraversal :: Traversal' (Tree l p) l Source #

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

leafDataTraversal :: Traversal' (Tree l p) p Source #

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

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

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

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

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

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

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

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

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

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

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

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

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