Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
newtype NodeIndexTree l p Source #
Instances
(Eq l, Eq p) => Eq (NodeIndexTree l p) Source # | |
Defined in Chiasma.Lens.Tree (==) :: NodeIndexTree l p -> NodeIndexTree l p -> Bool # (/=) :: NodeIndexTree l p -> NodeIndexTree l p -> Bool # | |
(Show l, Show p) => Show (NodeIndexTree l p) Source # | |
Defined in Chiasma.Lens.Tree showsPrec :: Int -> NodeIndexTree l p -> ShowS # show :: NodeIndexTree l p -> String # showList :: [NodeIndexTree l p] -> ShowS # | |
(Data l, Data p) => Plated (NodeIndexTree l p) Source # | |
Defined in Chiasma.Lens.Tree plate :: Traversal' (NodeIndexTree l p) (NodeIndexTree l p) # | |
HasNodeIndexTree (NodeIndexTree l p) l p Source # | |
Defined in Chiasma.Lens.Tree nodeIndexTree :: Lens' (NodeIndexTree l p) (NodeIndexTree l p) Source # | |
type Index (NodeIndexTree _1 _2) Source # | |
Defined in Chiasma.Lens.Tree | |
type IxValue (NodeIndexTree l _1) Source # | |
Defined in Chiasma.Lens.Tree |
class HasNodeIndexTree c l p | c -> l p where Source #
nodeIndexTree :: Lens' c (NodeIndexTree l p) Source #
Instances
HasNodeIndexTree (NodeIndexTree l p) l p Source # | |
Defined in Chiasma.Lens.Tree nodeIndexTree :: Lens' (NodeIndexTree l p) (NodeIndexTree l p) Source # |
newtype LeafIndexTree l p Source #
Instances
class HasLeafIndexTree c l p | c -> l p where Source #
leafIndexTree :: Lens' c (LeafIndexTree l p) Source #
Instances
HasLeafIndexTree (LeafIndexTree l p) l p Source # | |
Defined in Chiasma.Lens.Tree leafIndexTree :: Lens' (LeafIndexTree l p) (LeafIndexTree 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 #
leafDataTraversal :: Traversal' (Tree l p) p Source #
leafByIdentTraversal :: Identifiable p => Ident -> Traversal' (Tree l p) p Source #
leavesByIdentRecursive :: (Identifiable p, Data l, Data p) => Ident -> Fold (LeafIndexTree l p) p Source #
leafByIdent :: (Identifiable p, Data l, Data p) => Ident -> Tree l p -> Maybe p Source #
leavesByIdent :: (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 #