TypeNode

We need to have a data structure that lets us represent a type, and its relationship (conversion, subtyping) to other types.

This is what TypeNodes are for. They are linked into a graph that can answer questions about how two types are related. It can find the least general supertype, or most general subtype of two types.

Linear Supertypes

Serializable, Serializable, AnyRef, Any

Known Subclasses

AnyAtomic, AnyDateTime, AnySimpleExists, AnySimpleType, AnyType, Array, ArrayIndex, Boolean, Byte, Complex, Date, DateTime, Decimal, Double, Exists, Float, HexBinary, Int, Integer, Long, Nillable, NonEmptyString, NonNegativeInteger, Nothing, Numeric, Opaque, PrimTypeNode, Short, SignedInteger, SignedNumeric, String, Time, UnsignedByte, UnsignedInt, UnsignedLong, UnsignedNumeric, UnsignedShort

Abstract Value Members

abstract def name: String

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
lazy val children: List[TypeNode]
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def doesParentListContain(typeName: String): Boolean
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
lazy val globalQName: GlobalQName
def hashCode(): Int

Definition Classes
AnyRef → Any
lazy val isHead: Boolean
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
lazy val lcaseName: String
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
lazy val parentList: List[String]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package dpath

sealed abstract class TypeNode extends Serializable

Abstract Value Members

abstract def name: String

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

lazy val children: List[TypeNode]

def clone(): AnyRef

def doesParentListContain(typeName: String): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

lazy val globalQName: GlobalQName

def hashCode(): Int

lazy val isHead: Boolean

final def isInstanceOf[T0]: Boolean

lazy val lcaseName: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

lazy val parentList: List[String]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped