scales.xml.parser.strategies

QNameTreeOptimisation

object QNameTreeOptimisation extends TreeOptimisation[QNameToken] with QNameOptimisationT[QNameToken] with QNameTokenF

Optimises QNames and Trees according to LazyOptimisedTree

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. QNameTreeOptimisation
  2. QNameTokenF
  3. QNameOptimisationT
  4. TreeOptimisation
  5. PathOptimisationStrategy
  6. MemoryOptimisationStrategy
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

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 attributeArray(newSize: Int, token: QNameToken): 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: QNameToken): Unit

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

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

    Definition Classes
    PathOptimisationStrategy
  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def createToken(implicit ver: XmlVersion, fromParser: FromParser): QNameToken

    Definition Classes
    QNameTokenF
  12. 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
  13. 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
    TreeOptimisationPathOptimisationStrategy
  14. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int

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

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

    Definition Classes
    AnyRef
  21. def newTree(elem: Elem, children: xml.XmlChildren, token: QNameToken): xml.XmlTree

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

    The creation costs can also be reduced

    The creation costs can also be reduced

    Definition Classes
    QNameOptimisationTMemoryOptimisationStrategy
  23. final def notify(): Unit

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

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

  26. val qNameCache: ConcurrentHashMap[FullEqualQNameKey, QName]

    Definition Classes
    QNameOptimisationT
  27. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  28. def toString(): String

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

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

    Definition Classes
    QNameOptimisationT
  31. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from QNameTokenF

Inherited from QNameOptimisationT[QNameToken]

Inherited from TreeOptimisation[QNameToken]

Inherited from AnyRef

Inherited from Any

Ungrouped