ElemQNameOptimisationT

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

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

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.

val cacheAll: Boolean

def clone(): AnyRef

val ecache: ConcurrentHashMap[ElemKey, Elem]

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.

def elemValue(key: ElemKey)(newT: (ElemKey) ⇒ Elem): Elem

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

The creation costs can also be reduced

final def notify(): Unit

final def notifyAll(): Unit

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

val qNameCache: ConcurrentHashMap[FullEqualQNameKey, QName]

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

def toString(): String

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

def value[T <: QName](key: FullEqualQNameKey)(newT: (FullEqualQNameKey) ⇒ T): T

final def wait(): Unit

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

final def wait(arg0: Long): Unit