TreeLoc

abstract val lefts: TreeLoc.TreeForest[A]

The left siblings of the current node.

abstract val parents: TreeLoc.Parents[A]

The parent contexts of the current node.

abstract val rights: TreeLoc.TreeForest[A]

The right siblings of the current node.

abstract val tree: Tree[A]

The currently selected node.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def cojoin: TreeLoc[TreeLoc[A]]

def delete: Option[TreeLoc[A]]

Delete the current node and all its children.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def find(p: (TreeLoc[A]) ⇒ Boolean): Option[TreeLoc[A]]

Select the first descendant node of the current node that satisfies the given predicate.

def findChild(p: (Tree[A]) ⇒ Boolean): Option[TreeLoc[A]]

Select the first immediate child of the current node that satisfies the given predicate.

def firstChild: Option[TreeLoc[A]]

Select the leftmost child of the current node.

def getChild(n: Int): Option[TreeLoc[A]]

Select the nth child of the current node.

final def getClass(): Class[_]

def getLabel: A

Get the label of the current node.

def hasChildren: Boolean

True if the current node has children.

def hashCode(): Int

def insertDownAt(n: Int, t: Tree[A]): Option[TreeLoc[A]]

Insert the given node as the nth child of the current node and give it focus.

def insertDownFirst(t: Tree[A]): TreeLoc[A]

Insert the given node as the first child of the current node and give it focus.

def insertDownLast(t: Tree[A]): TreeLoc[A]

Insert the given node as the last child of the current node and give it focus.

def insertLeft(t: Tree[A]): TreeLoc[A]

Insert the given node to the left of the current node and give it focus.

def insertRight(t: Tree[A]): TreeLoc[A]

Insert the given node to the right of the current node and give it focus.

def isChild: Boolean

True if the current node is not the root node.

def isFirst: Boolean

True if the current node has no left siblings.

final def isInstanceOf[T0]: Boolean

def isLast: Boolean

True if the current node has no right siblings.

def isLeaf: Boolean

True if the current node has no children.

def isRoot: Boolean

True if the current node is the root node.

def lastChild: Option[TreeLoc[A]]

Select the rightmost child of the current node.

def left: Option[TreeLoc[A]]

Select the left sibling of the current node.

def map[B](f: (A) ⇒ B): TreeLoc[B]

Maps the given function over the elements.

def modifyLabel(f: (A) ⇒ A): TreeLoc[A]

Modify the label at the current node with the given function.

def modifyTree(f: (Tree[A]) ⇒ Tree[A]): TreeLoc[A]

Modify the current node with the given function.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parent: Option[TreeLoc[A]]

Select the parent of the current node.

def path: Stream[A]

The path from the focus to the root.

def right: Option[TreeLoc[A]]

Select the right sibling of the current node.

def root: TreeLoc[A]

Select the root node of the tree.

def setLabel(a: A): TreeLoc[A]

Set the label of the current node.

def setTree(t: Tree[A]): TreeLoc[A]

Replace the current node with the given one.

final def synchronized[T0](arg0: ⇒ T0): T0

def toForest: TreeLoc.TreeForest[A]

Get the entire forest represented by this zipper.

def toString(): String

def toTree: Tree[A]

Get the entire tree represented by this zipper.

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit