Class

scala.xml

NodeBuffer

Related Doc: package xml

Permalink

class NodeBuffer extends ArrayBuffer[Node]

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.

Version

1.0

Linear Supertypes
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. ArrayBuffer
  3. Serializable
  4. Serializable
  5. CustomParallelizable
  6. ResizableArray
  7. IndexedSeq
  8. IndexedSeq
  9. Builder
  10. IndexedSeqOptimized
  11. IndexedSeqOptimized
  12. IndexedSeqLike
  13. IndexedSeqLike
  14. AbstractBuffer
  15. Buffer
  16. BufferLike
  17. Subtractable
  18. Scriptable
  19. Shrinkable
  20. Growable
  21. Clearable
  22. AbstractSeq
  23. Seq
  24. SeqLike
  25. Cloneable
  26. Cloneable
  27. Cloneable
  28. Iterable
  29. Traversable
  30. Mutable
  31. AbstractSeq
  32. Seq
  33. SeqLike
  34. GenSeq
  35. GenSeqLike
  36. PartialFunction
  37. Function1
  38. AbstractIterable
  39. Iterable
  40. IterableLike
  41. Equals
  42. GenIterable
  43. GenIterableLike
  44. AbstractTraversable
  45. Traversable
  46. GenTraversable
  47. GenericTraversableTemplate
  48. TraversableLike
  49. GenTraversableLike
  50. Parallelizable
  51. TraversableOnce
  52. GenTraversableOnce
  53. FilterMonadic
  54. HasNewBuilder
  55. AnyRef
  56. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeBuffer()

    Permalink

Type Members

  1. class Elements extends AbstractIterator[A] with collection.BufferedIterator[A] with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = ArrayBuffer[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def &+(o: Any): NodeBuffer

    Permalink

    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]

    Permalink
    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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  6. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  7. def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  8. def ++=(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type

    Permalink
    Definition Classes
    ArrayBuffer → Growable
  9. def ++=:(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike
  10. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  11. def +=(elem: Node): NodeBuffer.this.type

    Permalink
    Definition Classes
    ArrayBuffer → Builder → BufferLike → Growable
  12. def +=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type

    Permalink
    Definition Classes
    Growable
  13. def +=:(elem: Node): NodeBuffer.this.type

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike
  14. def -(elem1: Node, elem2: Node, elems: Node*): ArrayBuffer[Node]

    Permalink
    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]

    Permalink
    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]

    Permalink
    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

    Permalink
    Definition Classes
    Shrinkable
  18. def -=(x: Node): NodeBuffer.this.type

    Permalink
    Definition Classes
    BufferLike → Shrinkable
  19. def -=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type

    Permalink
    Definition Classes
    Shrinkable
  20. def /:[B](z: B)(op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  22. def :\[B](z: B)(op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  24. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  26. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  27. def aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]

    Permalink
    Definition Classes
    PartialFunction → Function1
  29. def append(elems: Node*): Unit

    Permalink
    Definition Classes
    BufferLike
  30. def appendAll(xs: collection.TraversableOnce[Node]): Unit

    Permalink
    Definition Classes
    BufferLike
  31. def apply(idx: Int): Node

    Permalink
    Definition Classes
    ResizableArray → SeqLike → GenSeqLike → Function1
  32. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1

    Permalink
    Definition Classes
    PartialFunction
  33. var array: Array[AnyRef]

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray
  34. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  35. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals
  36. def clear(): Unit

    Permalink
    Definition Classes
    ArrayBuffer → Builder → BufferLike → Growable → Clearable
  37. def clone(): ArrayBuffer[Node]

    Permalink
    Definition Classes
    BufferLike → Cloneable → AnyRef
  38. def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  39. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  40. def combinations(n: Int): collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    SeqLike
  41. def companion: GenericCompanion[ArrayBuffer]

    Permalink
    Definition Classes
    ArrayBuffer → ResizableArray → IndexedSeq → IndexedSeq → Buffer → Seq → Iterable → Traversable → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  42. def compose[A](g: (A) ⇒ Int): (A) ⇒ Node

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  43. def contains[A1 >: Node](elem: A1): Boolean

    Permalink
    Definition Classes
    SeqLike
  44. def containsSlice[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike
  45. def copy(m: Int, n: Int, len: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray
  46. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    ResizableArray → IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  47. def copyToArray[B >: Node](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def copyToArray[B >: Node](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  49. def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  50. def corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  51. def count(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def diff[B >: Node](that: GenSeq[B]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  53. def distinct: ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  54. def drop(n: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  55. def dropRight(n: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike
  56. def dropWhile(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  57. def endsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  58. def ensureSize(n: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray
  59. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  60. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    GenSeqLike → Equals → Any
  61. def exists(p: (Node) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  62. def filter(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def filterNot(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def find(p: (Node) ⇒ Boolean): Option[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  65. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  66. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): ArrayBuffer[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  67. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
  69. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  70. def forall(p: (Node) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  71. def foreach[U](f: (Node) ⇒ U): Unit

    Permalink
    Definition Classes
    ResizableArray → IndexedSeqOptimized → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  72. def genericBuilder[B]: Builder[B, ArrayBuffer[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  73. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @IntrinsicCandidate()
  74. def groupBy[K](f: (Node) ⇒ K): Map[K, ArrayBuffer[Node]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  75. def grouped(size: Int): collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IterableLike
  76. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  77. def hashCode(): Int

    Permalink
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  78. def head: Node

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  79. def headOption: Option[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def indexOf[B >: Node](elem: B, from: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  81. def indexOf[B >: Node](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  82. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int

    Permalink
    Definition Classes
    SeqLike
  83. def indexOfSlice[B >: Node](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  84. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  85. def indexWhere(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  86. def indices: collection.immutable.Range

    Permalink
    Definition Classes
    SeqLike
  87. def init: ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  88. val initialSize: Int

    Permalink
    Attributes
    protected
    Definition Classes
    ArrayBuffer → ResizableArray
  89. def inits: collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    TraversableLike
  90. def insert(n: Int, elems: Node*): Unit

    Permalink
    Definition Classes
    BufferLike
  91. def insertAll(n: Int, seq: collection.Traversable[Node]): Unit

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike
  92. def intersect[B >: Node](that: GenSeq[B]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  93. def isDefinedAt(idx: Int): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  94. def isEmpty: Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  95. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  96. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  97. def iterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  98. def last: Node

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  99. def lastIndexOf[B >: Node](elem: B, end: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  100. def lastIndexOf[B >: Node](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  101. def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int

    Permalink
    Definition Classes
    SeqLike
  102. def lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  103. def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  104. def lastIndexWhere(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  105. def lastOption: Option[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  106. def length: Int

    Permalink
    Definition Classes
    ResizableArray → SeqLike → GenSeqLike
  107. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike
  108. def lift: (Int) ⇒ Option[Node]

    Permalink
    Definition Classes
    PartialFunction
  109. def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  110. def mapResult[NewTo](f: (ArrayBuffer[Node]) ⇒ NewTo): Builder[Node, NewTo]

    Permalink
    Definition Classes
    Builder
  111. def max[B >: Node](implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def min[B >: Node](implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  119. def newBuilder: Builder[Node, ArrayBuffer[Node]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  120. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate()
  122. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate()
  123. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Permalink
    Definition Classes
    PartialFunction
  124. def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  125. def par: ParArray[Node]

    Permalink
    Definition Classes
    ArrayBuffer → CustomParallelizable → Parallelizable
  126. def parCombiner: Combiner[Node, ParArray[Node]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable
  127. def partition(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  129. def permutations: collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    SeqLike
  130. def prefixLength(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  131. def prepend(elems: Node*): Unit

    Permalink
    Definition Classes
    BufferLike
  132. def prependAll(xs: collection.TraversableOnce[Node]): Unit

    Permalink
    Definition Classes
    BufferLike
  133. def product[B >: Node](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableOnce
  136. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  139. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def reduceToSize(sz: Int): Unit

    Permalink
    Definition Classes
    ResizableArray
  141. def remove(n: Int): Node

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike
  142. def remove(n: Int, count: Int): Unit

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike
  143. def repr: ArrayBuffer[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  144. def result(): ArrayBuffer[Node]

    Permalink
    Definition Classes
    ArrayBuffer → Builder
  145. def reverse: ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  146. def reverseIterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike
  147. def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  148. def reversed: List[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  149. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean

    Permalink
    Definition Classes
    PartialFunction
  150. def sameElements[B >: Node](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  151. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  152. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  153. def scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

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

  154. def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  155. def seq: collection.mutable.IndexedSeq[Node]

    Permalink
    Definition Classes
    IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  156. def size: Int

    Permalink
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  157. var size0: Int

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray
  158. def sizeHint(len: Int): Unit

    Permalink
    Definition Classes
    ArrayBuffer → Builder
  159. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

    Permalink
    Definition Classes
    Builder
  160. def sizeHint(coll: TraversableLike[_, _]): Unit

    Permalink
    Definition Classes
    Builder
  161. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

    Permalink
    Definition Classes
    Builder
  162. def slice(from: Int, until: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  163. def sliding(size: Int, step: Int): collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IterableLike
  164. def sliding(size: Int): collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IterableLike
  165. def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike
  166. def sortWith(lt: (Node, Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike
  167. def sorted[B >: Node](implicit ord: math.Ordering[B]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike
  168. def span(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  169. def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  170. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  171. def startsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  172. def stringPrefix: String

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike → TraversableLike → GenTraversableLike
  173. def sum[B >: Node](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def swap(a: Int, b: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray
  175. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  176. def tail: ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  177. def tails: collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    TraversableLike
  178. def take(n: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  179. def takeRight(n: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike
  180. def takeWhile(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  181. def thisCollection: collection.mutable.IndexedSeq[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  182. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  183. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toBuffer[A1 >: Node]: Buffer[A1]

    Permalink
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  185. def toCollection(repr: ArrayBuffer[Node]): collection.mutable.IndexedSeq[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  186. def toIndexedSeq: collection.immutable.IndexedSeq[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def toIterable: collection.Iterable[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  188. def toIterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  189. def toList: List[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  190. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  191. def toSeq: collection.Seq[Node]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  192. def toSet[B >: Node]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  193. def toStream: collection.immutable.Stream[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  194. def toString(): String

    Permalink
    Definition Classes
    SeqLike → TraversableLike → Any
  195. def toTraversable: collection.Traversable[Node]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  196. def toVector: Vector[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  197. def transform(f: (Node) ⇒ Node): NodeBuffer.this.type

    Permalink
    Definition Classes
    SeqLike
  198. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): ArrayBuffer[ArrayBuffer[B]]

    Permalink
    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

    Permalink
    Definition Classes
    BufferLike
  200. def trimStart(n: Int): Unit

    Permalink
    Definition Classes
    BufferLike
  201. def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  202. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  203. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  204. def update(idx: Int, elem: Node): Unit

    Permalink
    Definition Classes
    ResizableArray → IndexedSeqLike → SeqLike
  205. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  206. def view(from: Int, until: Int): IndexedSeqView[Node, ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  207. def view: IndexedSeqView[Node, ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  208. final def wait(arg0: Long, arg1: Int): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  210. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  211. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, ArrayBuffer[Node]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  212. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

    Permalink
    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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  214. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, Int), That]): That

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike

Deprecated Value Members

  1. def <<(cmd: Message[Node]): Unit

    Permalink
    Definition Classes
    BufferLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) Scripting is deprecated.

  2. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

  3. def readOnly: collection.Seq[Node]

    Permalink
    Definition Classes
    BufferLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) The returned sequence changes as this buffer is mutated. For an immutable copy, use, e.g., toList.

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