TreeLoc

abstract val lefts: Stream[Tree[A]]

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

abstract val rights: Stream[Tree[A]]

abstract val tree: Tree[A]

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 delete: Option[TreeLoc[A]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

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

def firstChild: Option[TreeLoc[A]]

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

final def getClass(): Class[_]

def getLabel: A

def hasChildren: Boolean

def hashCode(): Int

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

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

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

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

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

def isChild: Boolean

def isFirst: Boolean

final def isInstanceOf[T0]: Boolean

def isLast: Boolean

def isLeaf: Boolean

def isRoot: Boolean

def lastChild: Option[TreeLoc[A]]

def left: Option[TreeLoc[A]]

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

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parent: Option[TreeLoc[A]]

def path: Stream[A]

The path from the focus to the root.

def right: Option[TreeLoc[A]]

def root: TreeLoc[A]

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

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

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

def toForest: Stream[Tree[A]]

def toString(): String

def toTree: Tree[A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit