RuleTopology

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply[L, W](root: L, labelIndex: Index[L], ruleIndex: Index[Rule[L]]): RuleTopology[L]

Given the indices necessary to make a grammar, builds the other data structures that enable fast access to parent/child information, etc.

def apply[L](root: L, binaries: Counter2[L, _ <: Rule[L], _], unaries: Counter2[L, _ <: Rule[L], _]): RuleTopology[L]

Given a bunch of counts, builds a grammar.

def apply[L, W](root: L, productions: TraversableOnce[Rule[L]]): RuleTopology[L]

Builds a grammar just from some productions

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

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