TreeOptimisation

abstract def createToken(implicit ver: XmlVersion, fromParser: FromParser): TOKEN

abstract def newTree(elem: Elem, children: xml.XmlChildren, token: TOKEN)(implicit seqLikeThing: SeqLikeThing[xml.XCC[_], utils.ItemOrTree[XmlItem, Elem, xml.XCC], xml.XCC]): xml.XmlTree

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def attribute(qname: xml.AttributeQName, value: String, token: TOKEN): Attribute

It is expected that certain attributes have fixed values, ie.

def beginSubTree(stack: TreeProxies, elem: Elem, token: TOKEN): Unit

Start a new "tree", pushing the elem to TreeProxies

def clone(): AnyRef

def elem(name: QName, attributes: xml.Attributes, namespaces: Map[String, String], token: TOKEN): Elem

For files without large (and varied) attribute counts per repeated element it may represent significant space savings to optimise against the entire Elem itself.

final def elementEnd(xml: TreeProxies, token: TOKEN): Unit

By default calls TreeProxies.elementEnd.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def noNamespaceQName(local: String, token: TOKEN): NoNamespaceQName

final def notify(): Unit

final def notifyAll(): Unit

def prefixedQName(local: String, uri: String, prefix: String, token: TOKEN): PrefixedQName

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

def toString(): String

def unprefixedQName(local: String, uri: String, token: TOKEN): UnprefixedQName

final def wait(): Unit

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

final def wait(arg0: Long): Unit