Packages

c

scala.xml

NodeBuffer ξ…—

class NodeBuffer extends ArrayBuffer[Node] with ScalaVersionSpecificNodeBuffer

This class acts as a Buffer for nodes. If it is used as a sequence of nodes Seq[Node], it must be ensured that no updates occur after that point, because scala.xml.Node is assumed to be immutable.

Despite this being a sequence, don't use it as key in a hashtable. Calling the hashcode function will result in a runtime error.

Linear Supertypes
ScalaVersionSpecificNodeBuffer, ArrayBuffer[Node], Serializable, java.io.Serializable, CustomParallelizable[Node, ParArray[Node]], ResizableArray[Node], collection.mutable.IndexedSeq[Node], collection.IndexedSeq[Node], Builder[Node, ArrayBuffer[Node]], IndexedSeqOptimized[Node, ArrayBuffer[Node]], IndexedSeqOptimized[Node, ArrayBuffer[Node]], IndexedSeqLike[Node, ArrayBuffer[Node]], IndexedSeqLike[Node, ArrayBuffer[Node]], AbstractBuffer[Node], Buffer[Node], BufferLike[Node, ArrayBuffer[Node]], Subtractable[Node, ArrayBuffer[Node]], Scriptable[Node], Shrinkable[Node], Growable[Node], Clearable, AbstractSeq[Node], collection.mutable.Seq[Node], SeqLike[Node, ArrayBuffer[Node]], collection.mutable.Cloneable[ArrayBuffer[Node]], Cloneable, java.lang.Cloneable, collection.mutable.Iterable[Node], collection.mutable.Traversable[Node], Mutable, AbstractSeq[Node], collection.Seq[Node], SeqLike[Node, ArrayBuffer[Node]], GenSeq[Node], GenSeqLike[Node, ArrayBuffer[Node]], PartialFunction[Int, Node], (Int) β‡’ Node, AbstractIterable[Node], collection.Iterable[Node], IterableLike[Node, ArrayBuffer[Node]], Equals, GenIterable[Node], GenIterableLike[Node, ArrayBuffer[Node]], AbstractTraversable[Node], collection.Traversable[Node], GenTraversable[Node], GenericTraversableTemplate[Node, ArrayBuffer], TraversableLike[Node, ArrayBuffer[Node]], GenTraversableLike[Node, ArrayBuffer[Node]], Parallelizable[Node, ParArray[Node]], collection.TraversableOnce[Node], GenTraversableOnce[Node], FilterMonadic[Node, ArrayBuffer[Node]], HasNewBuilder[Node, scala.collection.mutable.ArrayBuffer[scala.xml.Node] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
ξ€· ξ…Œ
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeBuffer
  2. ScalaVersionSpecificNodeBuffer
  3. ArrayBuffer
  4. Serializable
  5. Serializable
  6. CustomParallelizable
  7. ResizableArray
  8. IndexedSeq
  9. IndexedSeq
  10. Builder
  11. IndexedSeqOptimized
  12. IndexedSeqOptimized
  13. IndexedSeqLike
  14. IndexedSeqLike
  15. AbstractBuffer
  16. Buffer
  17. BufferLike
  18. Subtractable
  19. Scriptable
  20. Shrinkable
  21. Growable
  22. Clearable
  23. AbstractSeq
  24. Seq
  25. SeqLike
  26. Cloneable
  27. Cloneable
  28. Cloneable
  29. Iterable
  30. Traversable
  31. Mutable
  32. AbstractSeq
  33. Seq
  34. SeqLike
  35. GenSeq
  36. GenSeqLike
  37. PartialFunction
  38. Function1
  39. AbstractIterable
  40. Iterable
  41. IterableLike
  42. Equals
  43. GenIterable
  44. GenIterableLike
  45. AbstractTraversable
  46. Traversable
  47. GenTraversable
  48. GenericTraversableTemplate
  49. TraversableLike
  50. GenTraversableLike
  51. Parallelizable
  52. TraversableOnce
  53. GenTraversableOnce
  54. FilterMonadic
  55. HasNewBuilder
  56. AnyRef
  57. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. ξ…— new NodeBuffer()

Type Members

  1. ξ…— class Elements extends AbstractIterator[A] with collection.BufferedIterator[A] with Serializable
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. ξ…— type Self = ArrayBuffer[Node]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. ξ…— class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. ξ…— final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef β†’ Any
  2. ξ…— final def ##(): Int
    Definition Classes
    AnyRef β†’ Any
  3. ξ…— def &+(o: Any): NodeBuffer

    Append given object to this buffer, returns reference on this NodeBuffer for convenience.

    Append given object to this buffer, returns reference on this NodeBuffer for convenience. Some rules apply: - If argument o is null, it is ignored. - If it is an Iterator or Iterable, its elements will be added. - If o is a node, it is added as it is. - If it is anything else, it gets wrapped in an scala.xml.Atom.

    o

    converts to an xml node and adds to this node buffer

    returns

    this nodebuffer

  4. ξ…— def ++(xs: GenTraversableOnce[Node]): ArrayBuffer[Node]
    Definition Classes
    BufferLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new buffer. Use ++= to add an element from this buffer and return that buffer itself.

  5. ξ…— def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  6. ξ…— def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike
  7. ξ…— def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike
  8. ξ…— def ++=(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer β†’ Growable
  9. ξ…— def ++=:(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer β†’ BufferLike
  10. ξ…— def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike β†’ GenSeqLike
  11. ξ…— def +=(elem: Node): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer β†’ Builder β†’ BufferLike β†’ Growable
  12. ξ…— def +=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type
    Definition Classes
    Growable
  13. ξ…— def +=:(elem: Node): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer β†’ BufferLike
  14. ξ…— def -(elem1: Node, elem2: Node, elems: Node*): ArrayBuffer[Node]
    Definition Classes
    BufferLike β†’ Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new buffer. Use -= to remove an element from this buffer and return that buffer itself.

  15. ξ…— def -(elem: Node): ArrayBuffer[Node]
    Definition Classes
    BufferLike β†’ Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new buffer. Use -= to remove an element from this buffer and return that buffer itself.

  16. ξ…— def --(xs: GenTraversableOnce[Node]): ArrayBuffer[Node]
    Definition Classes
    BufferLike β†’ Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new buffer. Use --= to remove an element from this buffer and return that buffer itself.

  17. ξ…— def --=(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    Shrinkable
  18. ξ…— def -=(x: Node): NodeBuffer.this.type
    Definition Classes
    BufferLike β†’ Shrinkable
  19. ξ…— def -=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type
    Definition Classes
    Shrinkable
  20. ξ…— def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike β†’ GenSeqLike
  21. ξ…— final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef β†’ Any
  22. ξ…— def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  23. ξ…— def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  24. ξ…— def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  25. ξ…— def aggregate[B](z: β‡’ B)(seqop: (B, Node) β‡’ B, combop: (B, B) β‡’ B): B
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  26. ξ…— def andThen[C](k: (Node) β‡’ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction β†’ Function1
  27. ξ…— def append(elems: Node*): Unit
    Definition Classes
    BufferLike
  28. ξ…— def appendAll(xs: collection.TraversableOnce[Node]): Unit
    Definition Classes
    BufferLike
  29. ξ…— def apply(idx: Int): Node
    Definition Classes
    ResizableArray β†’ SeqLike β†’ GenSeqLike β†’ Function1
  30. ξ…— def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) β‡’ B1): B1
    Definition Classes
    PartialFunction
  31. ξ…— val array: Array[AnyRef]
    Attributes
    protected
    Definition Classes
    ResizableArray
  32. ξ…— final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  33. ξ…— def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike β†’ Equals
  34. ξ…— def clear(): Unit
    Definition Classes
    ArrayBuffer β†’ Builder β†’ BufferLike β†’ Growable β†’ Clearable
  35. ξ…— def clone(): ArrayBuffer[Node]
    Definition Classes
    BufferLike β†’ Cloneable β†’ AnyRef
  36. ξ…— def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  37. ξ…— def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
    Definition Classes
    TraversableOnce
  38. ξ…— def combinations(n: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    SeqLike
  39. ξ…— def companion: GenericCompanion[ArrayBuffer]
    Definition Classes
    ArrayBuffer β†’ ResizableArray β†’ IndexedSeq β†’ IndexedSeq β†’ Buffer β†’ Seq β†’ Iterable β†’ Traversable β†’ Seq β†’ GenSeq β†’ Iterable β†’ GenIterable β†’ Traversable β†’ GenTraversable β†’ GenericTraversableTemplate
  40. ξ…— def compose[A](g: (A) β‡’ Int): (A) β‡’ Node
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  41. ξ…— def contains[A1 >: Node](elem: A1): Boolean
    Definition Classes
    SeqLike
  42. ξ…— def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  43. ξ…— def copy(m: Int, n: Int, len: Int): Unit
    Attributes
    protected
    Definition Classes
    ResizableArray
  44. ξ…— def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    ResizableArray β†’ IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
  45. ξ…— def copyToArray[B >: Node](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  46. ξ…— def copyToArray[B >: Node](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  47. ξ…— def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  48. ξ…— def corresponds[B](that: GenSeq[B])(p: (Node, B) β‡’ Boolean): Boolean
    Definition Classes
    SeqLike β†’ GenSeqLike
  49. ξ…— def count(p: (Node) β‡’ Boolean): Int
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  50. ξ…— def diff[B >: Node](that: GenSeq[B]): ArrayBuffer[Node]
    Definition Classes
    SeqLike β†’ GenSeqLike
  51. ξ…— def distinct: ArrayBuffer[Node]
    Definition Classes
    SeqLike β†’ GenSeqLike
  52. ξ…— def drop(n: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ GenTraversableLike
  53. ξ…— def dropRight(n: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike
  54. ξ…— def dropWhile(p: (Node) β‡’ Boolean): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ TraversableLike β†’ GenTraversableLike
  55. ξ…— def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike β†’ GenSeqLike
  56. ξ…— def ensureSize(n: Int): Unit
    Attributes
    protected
    Definition Classes
    ResizableArray
  57. ξ…— final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  58. ξ…— def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike β†’ Equals β†’ Any
  59. ξ…— def exists(p: (Node) β‡’ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
  60. ξ…— def filter(p: (Node) β‡’ Boolean): ArrayBuffer[Node]
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  61. ξ…— def filterNot(p: (Node) β‡’ Boolean): ArrayBuffer[Node]
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  62. ξ…— def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  63. ξ…— def find(p: (Node) β‡’ Boolean): Option[Node]
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
  64. ξ…— def flatMap[B, That](f: (Node) β‡’ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike β†’ GenTraversableLike β†’ FilterMonadic
  65. ξ…— def flatten[B](implicit asTraversable: (Node) β‡’ GenTraversableOnce[B]): ArrayBuffer[B]
    Definition Classes
    GenericTraversableTemplate
  66. ξ…— def fold[A1 >: Node](z: A1)(op: (A1, A1) β‡’ A1): A1
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  67. ξ…— def foldLeft[B](z: B)(op: (B, Node) β‡’ B): B
    Definition Classes
    IndexedSeqOptimized β†’ TraversableOnce β†’ GenTraversableOnce
  68. ξ…— def foldRight[B](z: B)(op: (Node, B) β‡’ B): B
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableOnce β†’ GenTraversableOnce
  69. ξ…— def forall(p: (Node) β‡’ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
  70. ξ…— def foreach[U](f: (Node) β‡’ U): Unit
    Definition Classes
    ResizableArray β†’ IndexedSeqOptimized β†’ IterableLike β†’ GenericTraversableTemplate β†’ TraversableLike β†’ GenTraversableLike β†’ TraversableOnce β†’ GenTraversableOnce β†’ FilterMonadic
  71. ξ…— def genericBuilder[B]: Builder[B, ArrayBuffer[B]]
    Definition Classes
    GenericTraversableTemplate
  72. ξ…— final def getClass(): Class[_]
    Definition Classes
    AnyRef β†’ Any
    Annotations
    @native()
  73. ξ…— def groupBy[K](f: (Node) β‡’ K): Map[K, ArrayBuffer[Node]]
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  74. ξ…— def grouped(size: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableLike
  75. ξ…— def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
  76. ξ…— def hashCode(): Int
    Definition Classes
    IndexedSeqLike β†’ GenSeqLike β†’ Any
  77. ξ…— def head: Node
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ GenTraversableLike
  78. ξ…— def headOption: Option[Node]
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  79. ξ…— def indexOf[B >: Node](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  80. ξ…— def indexOf[B >: Node](elem: B): Int
    Definition Classes
    GenSeqLike
  81. ξ…— def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  82. ξ…— def indexOfSlice[B >: Node](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  83. ξ…— def indexWhere(p: (Node) β‡’ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike β†’ GenSeqLike
  84. ξ…— def indexWhere(p: (Node) β‡’ Boolean): Int
    Definition Classes
    GenSeqLike
  85. ξ…— def indices: collection.immutable.Range
    Definition Classes
    SeqLike
  86. ξ…— def init: ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ TraversableLike β†’ GenTraversableLike
  87. ξ…— val initialSize: Int
    Attributes
    protected
    Definition Classes
    ArrayBuffer β†’ ResizableArray
  88. ξ…— def inits: collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    TraversableLike
  89. ξ…— def insert(n: Int, elems: Node*): Unit
    Definition Classes
    BufferLike
  90. ξ…— def insertAll(n: Int, seq: collection.Traversable[Node]): Unit
    Definition Classes
    ArrayBuffer β†’ BufferLike
  91. ξ…— def intersect[B >: Node](that: GenSeq[B]): ArrayBuffer[Node]
    Definition Classes
    SeqLike β†’ GenSeqLike
  92. ξ…— def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  93. ξ…— def isEmpty: Boolean
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike β†’ IterableLike β†’ TraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
  94. ξ…— final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  95. ξ…— final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike β†’ GenTraversableLike β†’ GenTraversableOnce
  96. ξ…— def iterator: collection.Iterator[Node]
    Definition Classes
    IndexedSeqLike β†’ IterableLike β†’ GenIterableLike
  97. ξ…— def last: Node
    Definition Classes
    IndexedSeqOptimized β†’ TraversableLike β†’ GenTraversableLike
  98. ξ…— def lastIndexOf[B >: Node](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  99. ξ…— def lastIndexOf[B >: Node](elem: B): Int
    Definition Classes
    GenSeqLike
  100. ξ…— def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  101. ξ…— def lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  102. ξ…— def lastIndexWhere(p: (Node) β‡’ Boolean, end: Int): Int
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike β†’ GenSeqLike
  103. ξ…— def lastIndexWhere(p: (Node) β‡’ Boolean): Int
    Definition Classes
    GenSeqLike
  104. ξ…— def lastOption: Option[Node]
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  105. ξ…— def length: Int
    Definition Classes
    ResizableArray β†’ SeqLike β†’ GenSeqLike
  106. ξ…— def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike
  107. ξ…— def lift: (Int) β‡’ Option[Node]
    Definition Classes
    PartialFunction
  108. ξ…— def map[B, That](f: (Node) β‡’ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike β†’ GenTraversableLike β†’ FilterMonadic
  109. ξ…— def mapResult[NewTo](f: (ArrayBuffer[Node]) β‡’ NewTo): Builder[Node, NewTo]
    Definition Classes
    Builder
  110. ξ…— def max[B >: Node](implicit cmp: Ordering[B]): Node
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  111. ξ…— def maxBy[B](f: (Node) β‡’ B)(implicit cmp: Ordering[B]): Node
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  112. ξ…— def min[B >: Node](implicit cmp: Ordering[B]): Node
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  113. ξ…— def minBy[B](f: (Node) β‡’ B)(implicit cmp: Ordering[B]): Node
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  114. ξ…— def mkString: String
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  115. ξ…— def mkString(sep: String): String
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  116. ξ…— def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  117. ξ…— final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  118. ξ…— def newBuilder: Builder[Node, ArrayBuffer[Node]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate β†’ HasNewBuilder
  119. ξ…— def nonEmpty: Boolean
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  120. ξ…— final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  121. ξ…— final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  122. ξ…— def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  123. ξ…— def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike β†’ GenSeqLike
  124. ξ…— def par: ParArray[Node]
    Definition Classes
    ArrayBuffer β†’ CustomParallelizable β†’ Parallelizable
  125. ξ…— def parCombiner: Combiner[Node, ParArray[Node]]
    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable β†’ Parallelizable
  126. ξ…— def partition(p: (Node) β‡’ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  127. ξ…— def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike β†’ GenSeqLike
  128. ξ…— def permutations: collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    SeqLike
  129. ξ…— def prefixLength(p: (Node) β‡’ Boolean): Int
    Definition Classes
    GenSeqLike
  130. ξ…— def prepend(elems: Node*): Unit
    Definition Classes
    BufferLike
  131. ξ…— def prependAll(xs: collection.TraversableOnce[Node]): Unit
    Definition Classes
    BufferLike
  132. ξ…— def product[B >: Node](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  133. ξ…— def reduce[A1 >: Node](op: (A1, A1) β‡’ A1): A1
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  134. ξ…— def reduceLeft[B >: Node](op: (B, Node) β‡’ B): B
    Definition Classes
    IndexedSeqOptimized β†’ TraversableOnce
  135. ξ…— def reduceLeftOption[B >: Node](op: (B, Node) β‡’ B): Option[B]
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  136. ξ…— def reduceOption[A1 >: Node](op: (A1, A1) β‡’ A1): Option[A1]
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  137. ξ…— def reduceRight[B >: Node](op: (Node, B) β‡’ B): B
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableOnce β†’ GenTraversableOnce
  138. ξ…— def reduceRightOption[B >: Node](op: (Node, B) β‡’ B): Option[B]
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  139. ξ…— def reduceToSize(sz: Int): Unit
    Definition Classes
    ResizableArray
  140. ξ…— def remove(n: Int): Node
    Definition Classes
    ArrayBuffer β†’ BufferLike
  141. ξ…— def remove(n: Int, count: Int): Unit
    Definition Classes
    ArrayBuffer β†’ BufferLike
  142. ξ…— def repr: ArrayBuffer[Node]
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  143. ξ…— def result(): ArrayBuffer[Node]
    Definition Classes
    ArrayBuffer β†’ Builder
  144. ξ…— def reverse: ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike β†’ GenSeqLike
  145. ξ…— def reverseIterator: collection.Iterator[Node]
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike
  146. ξ…— def reverseMap[B, That](f: (Node) β‡’ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike β†’ GenSeqLike
  147. ξ…— def reversed: List[Node]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  148. ξ…— def runWith[U](action: (Node) β‡’ U): (Int) β‡’ Boolean
    Definition Classes
    PartialFunction
  149. ξ…— def sameElements[B >: Node](that: GenIterable[B]): Boolean
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ GenIterableLike
  150. ξ…— def scan[B >: Node, That](z: B)(op: (B, B) β‡’ B)(implicit cbf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  151. ξ…— def scanLeft[B, That](z: B)(op: (B, Node) β‡’ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike β†’ GenTraversableLike
  152. ξ…— def scanRight[B, That](z: B)(op: (Node, B) β‡’ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike β†’ GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  153. ξ…— def segmentLength(p: (Node) β‡’ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike β†’ GenSeqLike
  154. ξ…— def seq: collection.mutable.IndexedSeq[Node]
    Definition Classes
    IndexedSeq β†’ IndexedSeq β†’ IndexedSeqLike β†’ Seq β†’ Seq β†’ GenSeq β†’ GenSeqLike β†’ Iterable β†’ Iterable β†’ GenIterable β†’ Traversable β†’ Traversable β†’ GenTraversable β†’ Parallelizable β†’ TraversableOnce β†’ GenTraversableOnce
  155. ξ…— def size: Int
    Definition Classes
    SeqLike β†’ GenTraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
  156. ξ…— val size0: Int
    Attributes
    protected
    Definition Classes
    ResizableArray
  157. ξ…— def sizeHint(len: Int): Unit
    Definition Classes
    ArrayBuffer β†’ Builder
  158. ξ…— def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  159. ξ…— def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  160. ξ…— def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  161. ξ…— def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    IndexedSeqLike β†’ GenTraversableOnce
  162. ξ…— def slice(from: Int, until: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ GenTraversableLike
  163. ξ…— def sliding(size: Int, step: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableLike
  164. ξ…— def sliding(size: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableLike
  165. ξ…— def sortBy[B](f: (Node) β‡’ B)(implicit ord: math.Ordering[B]): ArrayBuffer[Node]
    Definition Classes
    SeqLike
  166. ξ…— def sortWith(lt: (Node, Node) β‡’ Boolean): ArrayBuffer[Node]
    Definition Classes
    SeqLike
  167. ξ…— def sorted[B >: Node](implicit ord: math.Ordering[B]): ArrayBuffer[Node]
    Definition Classes
    SeqLike
  168. ξ…— def span(p: (Node) β‡’ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
    Definition Classes
    IndexedSeqOptimized β†’ TraversableLike β†’ GenTraversableLike
  169. ξ…— def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])
    Definition Classes
    IndexedSeqOptimized β†’ TraversableLike β†’ GenTraversableLike
  170. ξ…— def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    IndexedSeqOptimized β†’ SeqLike β†’ GenSeqLike
  171. ξ…— def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  172. ξ…— def stringPrefix: String
    Definition Classes
    ScalaVersionSpecificNodeBuffer
  173. ξ…— def sum[B >: Node](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  174. ξ…— def swap(a: Int, b: Int): Unit
    Attributes
    protected
    Definition Classes
    ResizableArray
  175. ξ…— final def synchronized[T0](arg0: β‡’ T0): T0
    Definition Classes
    AnyRef
  176. ξ…— def tail: ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ TraversableLike β†’ GenTraversableLike
  177. ξ…— def tails: collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    TraversableLike
  178. ξ…— def take(n: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ GenTraversableLike
  179. ξ…— def takeRight(n: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike
  180. ξ…— def takeWhile(p: (Node) β‡’ Boolean): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ TraversableLike β†’ GenTraversableLike
  181. ξ…— def thisCollection: collection.mutable.IndexedSeq[Node]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike β†’ IndexedSeqLike β†’ SeqLike β†’ IterableLike β†’ TraversableLike
  182. ξ…— def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]
    Definition Classes
    TraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
  183. ξ…— def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  184. ξ…— def toBuffer[A1 >: Node]: Buffer[A1]
    Definition Classes
    IndexedSeqLike β†’ TraversableOnce β†’ GenTraversableOnce
  185. ξ…— def toCollection(repr: ArrayBuffer[Node]): collection.mutable.IndexedSeq[Node]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike β†’ IndexedSeqLike β†’ SeqLike β†’ IterableLike β†’ TraversableLike
  186. ξ…— def toIndexedSeq: collection.immutable.IndexedSeq[Node]
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  187. ξ…— def toIterable: collection.Iterable[Node]
    Definition Classes
    IterableLike β†’ TraversableOnce β†’ GenTraversableOnce
  188. ξ…— def toIterator: collection.Iterator[Node]
    Definition Classes
    IterableLike β†’ TraversableLike β†’ GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  189. ξ…— def toList: List[Node]
    Definition Classes
    IndexedSeqOptimized β†’ TraversableOnce β†’ GenTraversableOnce
  190. ξ…— def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  191. ξ…— def toSeq: collection.Seq[Node]
    Definition Classes
    SeqLike β†’ GenSeqLike β†’ TraversableOnce β†’ GenTraversableOnce
  192. ξ…— def toSet[B >: Node]: Set[B]
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  193. ξ…— def toStream: collection.immutable.Stream[Node]
    Definition Classes
    IterableLike β†’ TraversableLike β†’ GenTraversableOnce
  194. ξ…— def toString(): String
    Definition Classes
    SeqLike β†’ TraversableLike β†’ Any
  195. ξ…— def toTraversable: collection.Traversable[Node]
    Definition Classes
    TraversableLike β†’ TraversableOnce β†’ GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  196. ξ…— def toVector: Vector[Node]
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
  197. ξ…— def transform(f: (Node) β‡’ Node): NodeBuffer.this.type
    Definition Classes
    SeqLike
  198. ξ…— def transpose[B](implicit asTraversable: (Node) β‡’ GenTraversableOnce[B]): ArrayBuffer[ArrayBuffer[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  199. ξ…— def trimEnd(n: Int): Unit
    Definition Classes
    BufferLike
  200. ξ…— def trimStart(n: Int): Unit
    Definition Classes
    BufferLike
  201. ξ…— def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike β†’ GenSeqLike
  202. ξ…— def unzip[A1, A2](implicit asPair: (Node) β‡’ (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])
    Definition Classes
    GenericTraversableTemplate
  203. ξ…— def unzip3[A1, A2, A3](implicit asTriple: (Node) β‡’ (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])
    Definition Classes
    GenericTraversableTemplate
  204. ξ…— def update(idx: Int, elem: Node): Unit
    Definition Classes
    ResizableArray β†’ IndexedSeqLike β†’ SeqLike
  205. ξ…— def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike β†’ GenSeqLike
  206. ξ…— def view(from: Int, until: Int): IndexedSeqView[Node, ArrayBuffer[Node]]
    Definition Classes
    IndexedSeqLike β†’ SeqLike β†’ IterableLike β†’ TraversableLike
  207. ξ…— def view: IndexedSeqView[Node, ArrayBuffer[Node]]
    Definition Classes
    IndexedSeqLike β†’ SeqLike β†’ IterableLike β†’ TraversableLike
  208. ξ…— final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  209. ξ…— final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  210. ξ…— final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  211. ξ…— def withFilter(p: (Node) β‡’ Boolean): FilterMonadic[Node, ArrayBuffer[Node]]
    Definition Classes
    TraversableLike β†’ FilterMonadic
  212. ξ…— def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ GenIterableLike
  213. ξ…— def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That
    Definition Classes
    IterableLike β†’ GenIterableLike
  214. ξ…— def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, Int), That]): That
    Definition Classes
    IndexedSeqOptimized β†’ IterableLike β†’ GenIterableLike

Deprecated Value Members

  1. ξ…— def /:[B](z: B)(op: (B, Node) β‡’ B): B
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. ξ…— def :\[B](z: B)(op: (Node, B) β‡’ B): B
    Definition Classes
    TraversableOnce β†’ GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  3. ξ…— def <<(cmd: Message[Node]): Unit
    Definition Classes
    BufferLike β†’ Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) scripting is deprecated

Inherited from ScalaVersionSpecificNodeBuffer

Inherited from ArrayBuffer[Node]

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from CustomParallelizable[Node, ParArray[Node]]

Inherited from ResizableArray[Node]

Inherited from collection.mutable.IndexedSeq[Node]

Inherited from collection.IndexedSeq[Node]

Inherited from Builder[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqOptimized[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqOptimized[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqLike[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqLike[Node, ArrayBuffer[Node]]

Inherited from AbstractBuffer[Node]

Inherited from Buffer[Node]

Inherited from BufferLike[Node, ArrayBuffer[Node]]

Inherited from Subtractable[Node, ArrayBuffer[Node]]

Inherited from Scriptable[Node]

Inherited from Shrinkable[Node]

Inherited from Growable[Node]

Inherited from Clearable

Inherited from AbstractSeq[Node]

Inherited from collection.mutable.Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

Inherited from collection.mutable.Cloneable[ArrayBuffer[Node]]

Inherited from Cloneable

Inherited from java.lang.Cloneable

Inherited from collection.mutable.Iterable[Node]

Inherited from collection.mutable.Traversable[Node]

Inherited from Mutable

Inherited from AbstractSeq[Node]

Inherited from collection.Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

Inherited from GenSeq[Node]

Inherited from GenSeqLike[Node, ArrayBuffer[Node]]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) β‡’ Node

Inherited from AbstractIterable[Node]

Inherited from collection.Iterable[Node]

Inherited from IterableLike[Node, ArrayBuffer[Node]]

Inherited from Equals

Inherited from GenIterable[Node]

Inherited from GenIterableLike[Node, ArrayBuffer[Node]]

Inherited from AbstractTraversable[Node]

Inherited from collection.Traversable[Node]

Inherited from GenTraversable[Node]

Inherited from GenericTraversableTemplate[Node, ArrayBuffer]

Inherited from TraversableLike[Node, ArrayBuffer[Node]]

Inherited from GenTraversableLike[Node, ArrayBuffer[Node]]

Inherited from Parallelizable[Node, ParArray[Node]]

Inherited from collection.TraversableOnce[Node]

Inherited from GenTraversableOnce[Node]

Inherited from FilterMonadic[Node, ArrayBuffer[Node]]

Inherited from HasNewBuilder[Node, scala.collection.mutable.ArrayBuffer[scala.xml.Node] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped