HighMemoryOptimisation

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. 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

6. 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

7. val cache: ConcurrentHashMap[Elem, Elem]

   

   Definition Classes

   ElemOptimisationT

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   ElemTokenF

10. 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

    ElemOptimisationT → MemoryOptimisationStrategy

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

    

    By default calls TreeProxies.elementEnd.

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

    Definition Classes

    PathOptimisationStrategy

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

    

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

14. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

16. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

17. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

19. 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

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    QNameOptimisationT → MemoryOptimisationStrategy

23. val qNameCache: ConcurrentHashMap[FullEqualQNameKey, QName]

    

    Definition Classes

    QNameOptimisationT

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

    

    Definition Classes

    AnyRef

25. def toString(): String

    

    Definition Classes

    AnyRef → Any

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

    

    Definition Classes

    QNameOptimisationT → MemoryOptimisationStrategy

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

    

    Definition Classes

    QNameOptimisationT

28. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )