scales.xml.parser.strategies

PathOptimisationStrategy

trait PathOptimisationStrategy[Token <: OptimisationToken] extends MemoryOptimisationStrategy[Token]

Certain paths may be repeated (based on QNames of parents etc) and known to be by the developer, its also possible that the developer simply is not interested in this path.

Developers may also customise the creation of paths, for example adding starting children, replacing the XmlChildren implementation or replacing entire subtrees.

Linear Supertypes
MemoryOptimisationStrategy[Token], AnyRef, Any
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. PathOptimisationStrategy
  2. MemoryOptimisationStrategy
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

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

    Definition Classes
    MemoryOptimisationStrategy

Concrete 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: 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
  8. 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
  9. def beginSubTree(stack: TreeProxies, elem: Elem, token: Token): Unit

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

  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. 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
  12. def elementEnd(xml: TreeProxies, token: Token): Unit

    By default calls TreeProxies.

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

  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( classOf[java.lang.Throwable] )
  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 noNamespaceQName(local: String, token: Token): NoNamespaceQName

    Definition Classes
    MemoryOptimisationStrategy
  21. final def notify(): Unit

    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  23. def prefixedQName(local: String, uri: String, prefix: String, token: Token): PrefixedQName

    Definition Classes
    MemoryOptimisationStrategy
  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: Token): UnprefixedQName

    Definition Classes
    MemoryOptimisationStrategy
  27. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from MemoryOptimisationStrategy[Token]

Inherited from AnyRef

Inherited from Any

Ungrouped