Packages

c

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

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

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