Cursor.Simple.Tree

Go back and down as far as necessary to find a previous element on a level below

Go up as far as necessary to find a next element on a level above and forward

Note: This will fail if there is a next node on the same level or any node below the current node

Swaps the current node with the previous node on the same level

Example:

Before:

p
|- a
|- b <--

After:

p
|- b <--
|- a

Swaps the current node with the next node on the same level

Example:

Before:

p
|- a <--
|- b

After:

p
|- b
|- a <--

Demotes the current node to the level of its children, by adding two roots. One for the current node and one for its children that are left behind.

Example:

Before:

 p
 |- a <--
    |- b

After:

 p
 |- <given element 1>
 |  |- a <--
 |- <given element 2>
 |  |- b

Demotes the current subtree to the level of its children, by adding a root.

Example:

Before:

 a <--
 |- b

After:

 <given element>
 |- a <--
    |- b