TreeOptimisation

Abstract Value Members

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

Definition Classes
MemoryOptimisationStrategy
abstract def newTree(elem: Elem, children: xml.XmlChildren, token: TOKEN): xml.XmlTree

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
final def asInstanceOf[T0]: T0

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

It is expected that certain attributes have fixed values, ie.
It is expected that certain attributes have fixed values, ie. booleans or based on schema enums etc, this function allows such optimisations.
The qname will have been obtained via a call to either noNamespaceQName, unprefixedQName or prefixedQName, so any optimisations provided by them can be leveraged.

Definition Classes
MemoryOptimisationStrategy
def attributeArray(newSize: Int, token: TOKEN): Array[Attribute]

During parsing provides a backing array for attribute storage.
During parsing provides a backing array for attribute storage. The expected new size must be passed in, failure to give a size large enough will lead to OOB exceptions.
Implementations are advised to use the array for parsing performance reasons.
The default implementataion expands the size by 50% of the backed array. The array ownership should remain with the strategy instance

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

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

Definition Classes
PathOptimisationStrategy
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
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.
For files without large (and varied) attribute counts per repeated element it may represent significant space savings to optimise against the entire Elem itself.
The Elements QName is garaunteed to be the last QName evaluated via the QName functions (i.e. Attributes are done first then the Elems QName)

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

By default calls TreeProxies.
By default calls TreeProxies.elementEnd. Replacing entire subtrees can be performed here.

Definition Classes
TreeOptimisation → PathOptimisationStrategy
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
def hashCode(): Int

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

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def noNamespaceQName(local: String, token: TOKEN): NoNamespaceQName

Definition Classes
MemoryOptimisationStrategy
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

Definition Classes
MemoryOptimisationStrategy
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def unprefixedQName(local: String, uri: String, token: TOKEN): UnprefixedQName

Definition Classes
MemoryOptimisationStrategy
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( ... )

trait TreeOptimisation[TOKEN <: OptimisationToken] extends PathOptimisationStrategy[TOKEN]

Abstract Value Members

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

abstract def newTree(elem: Elem, children: xml.XmlChildren, token: TOKEN): xml.XmlTree

Concrete Value Members

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

def attributeArray(newSize: Int, token: TOKEN): Array[Attribute]

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

def clone(): AnyRef

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

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

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

Inherited from PathOptimisationStrategy[TOKEN]

Inherited from MemoryOptimisationStrategy[TOKEN]

Inherited from AnyRef

Inherited from Any

Ungrouped