Width

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(i: Int): Width

def +(w: Width): Width

def -(i: Int): Width

def -(w: Width): Width

def <(that: Width): Boolean

def <=(that: Width): Boolean

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def >(that: Width): Boolean

def >=(that: Width): Boolean

final def asInstanceOf[T0]: T0

def binaryOp(op: String, operand: Width): Width

def canEqual(other: Any): Boolean

check if 'other' is a Width to check if its possible to equal a Width

def clone(): Width

clone this width

def compare(that: Width): Int

Compare two widths where an unknown width is less than any known width

def compareTo(that: Width): Int

def copy(w: Int = this.widthVal.get): Width

create a copy of this width

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

Define equality for width

def finalize(): Unit

implicit def fromInt(i: Int): Width

final def getClass(): Class[_]

def hashCode(): Int

Define the hashcode based on the width the same widths should have the same hash code unknown widths should be unique

final def isInstanceOf[T0]: Boolean

def isKnown: Boolean

Indicate whether width is actually known(set) or not

def max(that: Width): Width

final def ne(arg0: AnyRef): Boolean

def needWidth(): Int

final def notify(): Unit

final def notifyAll(): Unit

def setWidth(w: Int): Unit

Set the width of a Node, w must be >= 0

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

def toString(): String

Print a string representation of width

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def widthOrValue(v: Int): Int

def width_=(w: Int): Unit

def width: Int