TreeModel

abstract def filter(p: (A) ⇒ Boolean): TreeModel[A]

abstract def getChildrenOf(parentPath: Path[A]): Seq[A]

abstract def insertUnder(parentPath: Path[A], newValue: A, index: Int): Boolean

abstract def isExternalModel: Boolean

abstract def map[B](f: (A) ⇒ B): TreeModel[B]

abstract def pathToTreePath(path: Path[A]): TreePath

abstract val peer: javax.swing.tree.TreeModel

abstract def remove(pathToRemove: Path[A]): Boolean

abstract def roots: Seq[A]

abstract def toInternalModel: InternalTreeModel[A]

abstract def treePathToPath(tp: TreePath): Path[A]

abstract def update(path: Path[A], newValue: A): Unit

Replace the item at the given path in the tree with a new value.

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 breadthFirstIterator: Iterator[A]

def clone(): AnyRef

def depthFirstIterator: Iterator[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foreach[U](f: (A) ⇒ U): Unit

def getChildPathsOf(parentPath: Path[A]): Seq[Path[A]]

final def getClass(): Class[_]

def hashCode(): Int

def insertAfter(path: Path[A], newValue: A): Boolean

def insertBefore(path: Path[A], newValue: A): Boolean

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def siblingsUnder(parentPath: Path[A]): Seq[A]

def size: Int

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

def toString(): String

def unpackNode(node: Any): A

final def wait(): Unit

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

final def wait(arg0: Long): Unit