scala.xml

NodeBuffer

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
Learn more about member selection
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](z: B)(op: (B, Node) ⇒ B): B

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  64. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  65. def find(p: (Node) ⇒ Boolean): Option[Node]

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

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

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

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

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

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

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

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

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

    Definition Classes
    AnyRef → Any
  75. def groupBy[K](f: (Node) ⇒ K): Map[K, ArrayBuffer[Node]]

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

    Definition Classes
    IterableLike
  77. def hasDefiniteSize: Boolean

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

    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  79. def head: Node

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

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

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

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

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

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

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

    Definition Classes
    GenSeqLike
  87. def indices: collection.immutable.Range

    Definition Classes
    SeqLike
  88. def init: ArrayBuffer[Node]

    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  89. val initialSize: Int

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

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

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

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

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

    Definition Classes
    GenSeqLike
  95. def isEmpty: Boolean

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

    Definition Classes
    Any
  97. final def isTraversableAgain: Boolean

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

    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  99. def last: Node

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

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

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

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

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

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

    Definition Classes
    GenSeqLike
  106. def lastOption: Option[Node]

    Definition Classes
    TraversableLike → GenTraversableLike
  107. def length: Int

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def mkString: String

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

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

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

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

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

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

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

    Definition Classes
    AnyRef
  124. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  154. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    GenSeqLike
  173. def stringPrefix: String

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

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

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

    Definition Classes
    AnyRef
  177. def tail: ArrayBuffer[Node]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    SeqLike
  199. 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.

  200. def trimEnd(n: Int): Unit

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

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

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

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

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

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

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

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

    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  209. final def wait(): Unit

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

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

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

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

    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  214. 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
  215. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, Int), That]): That

    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike

Deprecated Value Members

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

    Definition Classes
    BufferLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) Scripting is deprecated.

  2. def readOnly: collection.Seq[Node]

    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.