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 WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

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

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

  3. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++=(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer → Growable
  7. def ++=:(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer → BufferLike
  8. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  9. def +=(elem: Node): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer → Builder → BufferLike → Growable
  10. def +=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type
    Definition Classes
    Growable
  11. def +=:(elem: Node): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer → BufferLike
  12. 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.

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

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

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

  135. def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  136. def seq: collection.mutable.IndexedSeq[Node]
    Definition Classes
    IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  137. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  138. def sizeHint(len: Int): Unit
    Definition Classes
    ArrayBuffer → Builder
  139. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
    Definition Classes
    Builder
  140. def sizeHint(coll: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  141. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
    Definition Classes
    Builder
  142. def slice(from: Int, until: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  143. def sliding(size: Int, step: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableLike
  144. def sliding(size: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableLike
  145. def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): ArrayBuffer[Node]
    Definition Classes
    SeqLike
  146. def sortWith(lt: (Node, Node) ⇒ Boolean): ArrayBuffer[Node]
    Definition Classes
    SeqLike
  147. def sorted[B >: Node](implicit ord: math.Ordering[B]): ArrayBuffer[Node]
    Definition Classes
    SeqLike
  148. def span(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  149. def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  150. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  151. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  152. def stringPrefix: String
    Definition Classes
    ScalaVersionSpecificNodeBuffer
  153. def sum[B >: Node](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. def tail: ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  155. def tails: collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    TraversableLike
  156. def take(n: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  157. def takeRight(n: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized → IterableLike
  158. def takeWhile(p: (Node) ⇒ Boolean): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  159. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  160. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. def toBuffer[A1 >: Node]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  162. def toIndexedSeq: collection.immutable.IndexedSeq[Node]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def toIterable: collection.Iterable[Node]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  164. def toIterator: collection.Iterator[Node]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  165. def toList: List[Node]
    Definition Classes
    IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
  166. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def toSeq: collection.Seq[Node]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  168. def toSet[B >: Node]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def toStream: collection.immutable.Stream[Node]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  170. def toString(): String
    Definition Classes
    SeqLike → TraversableLike → Any
  171. def toTraversable: collection.Traversable[Node]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  172. def toVector: Vector[Node]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. def transform(f: (Node) ⇒ Node): NodeBuffer.this.type
    Definition Classes
    SeqLike
  174. 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.

  175. def trimEnd(n: Int): Unit
    Definition Classes
    BufferLike
  176. def trimStart(n: Int): Unit
    Definition Classes
    BufferLike
  177. def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  178. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])
    Definition Classes
    GenericTraversableTemplate
  179. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])
    Definition Classes
    GenericTraversableTemplate
  180. def update(idx: Int, elem: Node): Unit
    Definition Classes
    ResizableArray → IndexedSeqLike → SeqLike
  181. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  182. def view(from: Int, until: Int): IndexedSeqView[Node, ArrayBuffer[Node]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  183. def view: IndexedSeqView[Node, ArrayBuffer[Node]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  184. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, ArrayBuffer[Node]]
    Definition Classes
    TraversableLike → FilterMonadic
  185. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  186. 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
  187. 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