TreeLoc

val lefts : Stream[Tree[A]]

The left siblings of the current node.

val parents : Stream[(Stream[Tree[A]], A, Stream[Tree[A]])]

The parent contexts of the current node.

val rights : Stream[Tree[A]]

The right siblings of the current node.

val tree : Tree[A]

The currently selected node.

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def asInstanceOf [T0] : T0

def clone (): AnyRef

def delete : Option[TreeLoc[A]]

Delete the current node and all its children.

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.

def getClass (): java.lang.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 [AA >: A] (n: Int, t: Tree[AA]): Option[TreeLoc[AA]]

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

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

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

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

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

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

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

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

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.

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 modifyLabel [AA >: A] (f: (AA) ⇒ AA): TreeLoc[AA]

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

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

Modify the current node with the given function.

def ne (arg0: AnyRef): Boolean

def notify (): Unit

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 [AA >: A] (a: AA): TreeLoc[AA]

Set the label of the current node.

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

Replace the current node with the given one.

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

def toForest : Stream[Tree[A]]

Get the entire forest represented by this zipper.

def toString (): String

def toTree : Tree[A]

Get the entire tree represented by this zipper.

def wait (): Unit

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

def wait (arg0: Long): Unit