NonEmptyTaxonomy

abstract val head: String

The marked root node

abstract val underlyingMap: Map[String, Set[String]]

The finite map representation of this taxonomy

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addSubtype(entry: String): NonEmptyTaxonomy

Adds a constructor name to the relation for the marked root node.

def addSubtypes(entries: NonEmptyTaxonomy): NonEmptyTaxonomy

Adds multiple constructor names to the relation for the marked root node.

def andThen[A](g: (Set[String]) ⇒ A): (String) ⇒ A

def apply(s: String): Set[String]

Looks up a constructor name in this taxonomy, returning all directly related constructor names.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[A](g: (A) ⇒ String): (A) ⇒ Set[String]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def merge(entries: NonEmptyTaxonomy): NonEmptyTaxonomy

Merges this taxonomy with other and return a new taxonomy, containing the entries of both.

def merge(entries: Taxonomy): NonEmptyTaxonomy

Merges this taxonomy with other and return a new taxonomy, containing the entries of both.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit