Control.Arrow.ArrowNavigatableTree · hxt-9.3.1.22

classclass ArrowList a => ArrowNavigatableTree (a :: Type -> Type -> Type) where

#

The interface for navigatable tree arrows

all functions have default implementations

Methods

moveUp :: NavigatableTree t => a (t b) (t b)
moveDown :: NavigatableTree t => a (t b) (t b)
moveLeft :: NavigatableTree t => a (t b) (t b)
moveRight :: NavigatableTree t => a (t b) (t b)

Instances4ArrowNavigatableTree

ArrowNavigatableTree IOLADefined in hxt-9.3.1.22 · Control.Arrow.IOListArrow
ArrowNavigatableTree LADefined in hxt-9.3.1.22 · Control.Arrow.ListArrow
ArrowNavigatableTree (IOSLA s)Defined in hxt-9.3.1.22 · Control.Arrow.IOStateListArrow
ArrowNavigatableTree (SLA s)Defined in hxt-9.3.1.22 · Control.Arrow.StateListArrow

valueparentAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

valueancestorAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: ancestor

valueancestorOrSelfAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: ancestor or self

valuechildAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: child

valuedescendantAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: descendant

valuedescendantOrSelfAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: descendant or self

valuedescendantOrFollowingAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

not an XPath axis but useful: descendant or following

valuerevDescendantOrSelfAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

not an official XPath axis but useful: reverse descendant or self, used in preceding axis

valuefollowingSiblingAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: following sibling

valueprecedingSiblingAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: preceeding sibling

valueselfAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: self

valuefollowingAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: following

valueprecedingAxis :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

XPath axis: preceding

valuemoveToRoot :: (Arrow a, NavigatableTree t) => a (t b) (t b)

#

move to the root

valueisAtRoot :: (ArrowList a, NavigatableTree t) => a (t b) (t b)

#

valueaddNav :: (ArrowList a, NavigatableTreeToTree nt t) => a (t b) (nt b)

#

Conversion from a tree into a navigatable tree

valueremNav :: (ArrowList a, NavigatableTreeToTree nt t) => a (nt b) (t b)

#

Conversion from a navigatable tree into an ordinary tree

valuewithNav

:: (ArrowList a, NavigatableTreeToTree nt t)
=> a (nt b) (nt c)
-> a (t b) (t c)

#

apply an operation using navigation to an ordinary tree

This root and all children may be visited in arbitrary order

valuewithoutNav

:: (ArrowList a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t)
=> a (t b) (t b)
-> a (nt b) (nt b)

#

apply a simple operation without use of navigation to a navigatable tree

This enables to apply arbitrary tree operations to navigatable trees

valuefilterAxis

:: (ArrowIf a, NavigatableTreeToTree nt t)
=> a (t b) c
-> a (nt b) (nt b)

#

Filter an axis with an ordinary tree predicate

Example: In a tree of Ints find all nodes in the subtrees (in preorder) that have label 42

descendantAxis >>> filterAxis (hasNode (== 42))

Example: In an XML Tree find the following nodes of a node with attribute id and value 42

descendantAxis >>> filterAxis (hasAttrValue "id" (=="42")) >>> followingAxis

valuemoveOn :: (ArrowList a, NavigatableTree t) => a (t b) (t b) -> a (t b) (t b)

#

Move to the next tree on a given axis. Deterministic arrow

Example: Move to the next node in a preorder visit: next child or else next following

moveOn descendantOrFollowingAxis

valuechangeThisTree

:: (ArrowList a, ArrowIf a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t)
=> a (t b) (t b)
-> a (nt b) (nt b)

#

Change the current subtree of a navigatable tree.

The arrow for computing the changes should be deterministic. If it fails nothing is changed.

valuesubstThisTree

:: (ArrowList a, ArrowIf a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t)
=> t b
-> a (nt b) (nt b)

#

Substitute the current subtree of a navigatable tree by a given tree

valueaddToTheLeft

:: (ArrowList a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t)
=> a (t b) (t b)
-> a (nt b) (nt b)

#

apply an ordinary arrow to the current subtree of a navigatabe tree and add the result trees in front of the current tree.

If this arrow is applied to the root, it will fail, because we want a tree as result, not a forest.

valueaddToTheRight

:: (ArrowList a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t)
=> a (t b) (t b)
-> a (nt b) (nt b)

#

apply an ordinary arrow to the current subtree of a navigatabe tree and add the result trees behind the current tree.

If this arrow is applied to the root, it will fail, because we want a tree as result, not a forest.

valueaddToOneSide

:: (ArrowList a, NavigatableTreeToTree nt t, NavigatableTreeModify nt t)
=> Maybe (nt b) -> [t b] -> Maybe (nt b)
-> a (t b) (t b)
-> a (nt b) (nt b)

#

addToOneSide does the real work for addToTheLeft and addToTheRight

valuedropFromTheLeft :: (ArrowList a, NavigatableTreeModify nt t) => a (nt b) (nt b)

#

drop the direct left sibling tree of the given navigatable tree

If this arrow is applied to the root or a leftmost tree, it will fail, because there is nothing to remove

valuedropFromTheRight :: (ArrowList a, NavigatableTreeModify nt t) => a (nt b) (nt b)

#

drop the direct left sibling tree of the given navigatable tree

If this arrow is applied to the root or a rightmost tree, it will fail, because there is nothing to remove