QNameElemTreeOptimisation

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: ElemToken): 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: ElemToken): Unit

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

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

   Definition Classes

   PathOptimisationStrategy

9. val cacheAll: Boolean

   Definition Classes

   ElemQNameOptimisationT

10. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

11. def createToken(implicit ver: XmlVersion, fromParser: FromParser): ElemToken

    Definition Classes

    ElemTokenF

12. val ecache: ConcurrentHashMap[ElemKey, Elem]

    Definition Classes

    ElemQNameOptimisationT

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

    ElemQNameOptimisationT → MemoryOptimisationStrategy

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

    Definition Classes

    ElemQNameOptimisationT

15. final def elementEnd(xml: TreeProxies, token: ElemToken): Unit

    By default calls TreeProxies.

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

    Definition Classes

    TreeOptimisation → PathOptimisationStrategy

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

    Definition Classes

    AnyRef

17. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

18. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef → Any

20. def hashCode(): Int

    Definition Classes

    AnyRef → Any

21. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

23. def newTree(elem: Elem, children: xml.XmlChildren, token: ElemToken): xml.XmlTree

    Definition Classes

    QNameElemTreeOptimisation → TreeOptimisation

24. def noNamespaceQName(local: String, token: ElemToken): NoNamespaceQName

    The creation costs can also be reduced

    The creation costs can also be reduced

    Definition Classes

    QNameOptimisationT → MemoryOptimisationStrategy

25. final def notify(): Unit

    Definition Classes

    AnyRef

26. final def notifyAll(): Unit

    Definition Classes

    AnyRef

27. def prefixedQName(local: String, uri: String, prefix: String, token: ElemToken): PrefixedQName

    Definition Classes

    QNameOptimisationT → MemoryOptimisationStrategy

28. val qNameCache: ConcurrentHashMap[FullEqualQNameKey, QName]

    Definition Classes

    QNameOptimisationT

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

    Definition Classes

    AnyRef

30. def toString(): String

    Definition Classes

    AnyRef → Any

31. def unprefixedQName(local: String, uri: String, token: ElemToken): UnprefixedQName

    Definition Classes

    QNameOptimisationT → MemoryOptimisationStrategy

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

    Definition Classes

    QNameOptimisationT

33. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()

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

    Definition Classes

    AnyRef

    Annotations

    @throws()