QNameTreeOptimisation

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. def attribute(qname: xml.AttributeQName, value: String, token: QNameToken): 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

8. def beginSubTree(stack: TreeProxies, elem: Elem, token: QNameToken): Unit

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

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

   Definition Classes

   PathOptimisationStrategy

9. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws()

10. def createToken(implicit ver: XmlVersion, fromParser: FromParser): QNameToken

    Definition Classes

    QNameTokenF

11. def elem(name: QName, attributes: xml.Attributes, namespaces: Map[String, String], token: QNameToken): 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

12. final def elementEnd(xml: TreeProxies, token: QNameToken): Unit

    By default calls TreeProxies.

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

    Definition Classes

    TreeOptimisation → PathOptimisationStrategy

13. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

14. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

15. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

16. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

20. def newTree(elem: Elem, children: xml.XmlChildren, token: QNameToken): xml.XmlTree

    Definition Classes

    QNameTreeOptimisation → TreeOptimisation

21. def noNamespaceQName(local: String, token: QNameToken): NoNamespaceQName

    The creation costs can also be reduced

    The creation costs can also be reduced

    Definition Classes

    QNameOptimisationT → MemoryOptimisationStrategy

22. final def notify(): Unit

    Definition Classes

    AnyRef

23. final def notifyAll(): Unit

    Definition Classes

    AnyRef

24. def prefixedQName(local: String, uri: String, prefix: String, token: QNameToken): PrefixedQName

    Definition Classes

    QNameOptimisationT → MemoryOptimisationStrategy

25. val qNameCache: ConcurrentHashMap[FullEqualQNameKey, QName]

    Definition Classes

    QNameOptimisationT

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

    Definition Classes

    AnyRef

27. def toString(): String

    Definition Classes

    AnyRef → Any

28. def unprefixedQName(local: String, uri: String, token: QNameToken): UnprefixedQName

    Definition Classes

    QNameOptimisationT → MemoryOptimisationStrategy

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

    Definition Classes

    QNameOptimisationT

30. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

32. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()