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], DefaultSerializable, java.io.Serializable, StrictOptimizedSeqOps[Node, ArrayBuffer, ArrayBuffer[Node]], StrictOptimizedIterableOps[Node, ArrayBuffer, ArrayBuffer[Node]], IndexedBuffer[Node], collection.mutable.IndexedSeq[Node], IndexedSeqOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]], collection.IndexedSeq[Node], IndexedSeqOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]], AbstractBuffer[Node], Buffer[Node], Shrinkable[Node], Growable[Node], Clearable, AbstractSeq[Node], collection.mutable.Seq[Node], SeqOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]], collection.mutable.Cloneable[ArrayBuffer[Node]], java.lang.Cloneable, collection.mutable.Iterable[Node], AbstractSeq[Node], collection.Seq[Node], Equals, SeqOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]], PartialFunction[Int, Node], (Int) => Node, AbstractIterable[Node], collection.Iterable[Node], IterableFactoryDefaults[Node, [x]ArrayBuffer[x]], IterableOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]], IterableOnceOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]], collection.IterableOnce[Node], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeBuffer
  2. ScalaVersionSpecificNodeBuffer
  3. ArrayBuffer
  4. DefaultSerializable
  5. Serializable
  6. StrictOptimizedSeqOps
  7. StrictOptimizedIterableOps
  8. IndexedBuffer
  9. IndexedSeq
  10. IndexedSeqOps
  11. IndexedSeq
  12. IndexedSeqOps
  13. AbstractBuffer
  14. Buffer
  15. Shrinkable
  16. Growable
  17. Clearable
  18. AbstractSeq
  19. Seq
  20. SeqOps
  21. Cloneable
  22. Cloneable
  23. Iterable
  24. AbstractSeq
  25. Seq
  26. Equals
  27. SeqOps
  28. PartialFunction
  29. Function1
  30. AbstractIterable
  31. Iterable
  32. IterableFactoryDefaults
  33. IterableOps
  34. IterableOnceOps
  35. IterableOnce
  36. AnyRef
  37. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new NodeBuffer()

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. final def ++[B >: Node](suffix: collection.IterableOnce[B]): ArrayBuffer[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  3. final def ++:[B >: Node](prefix: collection.IterableOnce[B]): ArrayBuffer[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  4. final def ++=(xs: collection.IterableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  5. final def ++=:(elems: collection.IterableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @inline()
  6. final def +:[B >: Node](elem: B): ArrayBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  7. final def +=(elem: Node): NodeBuffer.this.type
    Definition Classes
    Growable
    Annotations
    @inline()
  8. final def +=:(elem: Node): NodeBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @inline()
  9. final def --=(xs: collection.IterableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  10. def -=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type
    Definition Classes
    Shrinkable
  11. final def -=(elem: Node): NodeBuffer.this.type
    Definition Classes
    Shrinkable
    Annotations
    @inline()
  12. final def :+[B >: Node](elem: B): ArrayBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  13. final def :++[B >: Node](suffix: collection.IterableOnce[B]): ArrayBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  14. def addAll(elems: collection.IterableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer → Growable
  15. def addOne(elem: Node): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer → Growable
  16. final def addString(b: collection.mutable.StringBuilder): collection.mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  17. final def addString(b: collection.mutable.StringBuilder, sep: String): collection.mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  18. def addString(b: collection.mutable.StringBuilder, start: String, sep: String, end: String): collection.mutable.StringBuilder
    Definition Classes
    IterableOnceOps
  19. def andThen[C](k: PartialFunction[Node, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  20. def andThen[C](k: (Node) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  21. final def append(elem: Node): NodeBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @inline()
  22. final def appendAll(xs: collection.IterableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @inline()
  23. def appended[B >: Node](elem: B): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  24. def appendedAll[B >: Node](suffix: collection.IterableOnce[B]): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  25. def apply(n: Int): Node
    Definition Classes
    ArrayBuffer → SeqOps → Function1
  26. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  27. def canEqual(that: Any): Boolean
    Definition Classes
    Seq → Equals
  28. def className: String
    Definition Classes
    ScalaVersionSpecificNodeBuffer
  29. def clear(): Unit
    Definition Classes
    ArrayBuffer → Clearable
  30. def clearAndShrink(size: Int): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer
  31. def clone(): ArrayBuffer[Node]
    Definition Classes
    SeqOps → Cloneable → AnyRef
  32. def collect[B](pf: PartialFunction[Node, B]): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  33. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
    Definition Classes
    IterableOnceOps
  34. def combinations(n: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    SeqOps
  35. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Node]
    Definition Classes
    PartialFunction
  36. def compose[A](g: (A) => Int): (A) => Node
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  37. final def concat[B >: Node](suffix: collection.IterableOnce[B]): ArrayBuffer[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  38. def contains[A1 >: Node](elem: A1): Boolean
    Definition Classes
    SeqOps
  39. def containsSlice[B](that: collection.Seq[B]): Boolean
    Definition Classes
    SeqOps
  40. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    ArrayBuffer → IterableOnceOps
  41. def copyToArray[B >: Node](xs: Array[B], start: Int): Int
    Definition Classes
    ArrayBuffer → IterableOnceOps
  42. def copyToArray[B >: Node](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  43. def corresponds[B](that: collection.Seq[B])(p: (Node, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  44. def corresponds[B](that: collection.IterableOnce[B])(p: (Node, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  45. def count(p: (Node) => Boolean): Int
    Definition Classes
    IterableOnceOps
  46. def diff[B >: Node](that: collection.Seq[B]): ArrayBuffer[Node]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  47. def distinct: ArrayBuffer[Node]
    Definition Classes
    SeqOps
  48. def distinctBy[B](f: (Node) => B): ArrayBuffer[Node]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  49. def drop(n: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  50. def dropInPlace(n: Int): NodeBuffer.this.type
    Definition Classes
    Buffer
  51. def dropRight(n: Int): ArrayBuffer[Node]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  52. def dropRightInPlace(n: Int): NodeBuffer.this.type
    Definition Classes
    Buffer
  53. def dropWhile(p: (Node) => Boolean): ArrayBuffer[Node]
    Definition Classes
    IterableOps → IterableOnceOps
  54. def dropWhileInPlace(p: (Node) => Boolean): NodeBuffer.this.type
    Definition Classes
    Buffer
  55. def elementWise: ElementWiseExtractor[Int, Node]
    Definition Classes
    PartialFunction
  56. def empty: ArrayBuffer[Node]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  57. def endsWith[B >: Node](that: collection.Iterable[B]): Boolean
    Definition Classes
    SeqOps
  58. def equals(o: Any): Boolean
    Definition Classes
    Seq → Equals → AnyRef → Any
  59. def exists(p: (Node) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  60. def filter(pred: (Node) => Boolean): ArrayBuffer[Node]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  61. def filterInPlace(p: (Node) => Boolean): NodeBuffer.this.type
    Definition Classes
    IndexedBuffer
  62. def filterNot(pred: (Node) => Boolean): ArrayBuffer[Node]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  63. def find(p: (Node) => Boolean): Option[Node]
    Definition Classes
    IterableOnceOps
  64. def findLast(p: (Node) => Boolean): Option[Node]
    Definition Classes
    SeqOps
  65. def flatMap[B](f: (Node) => collection.IterableOnce[B]): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  66. def flatMapInPlace(f: (Node) => collection.IterableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    IndexedBuffer
  67. def flatten[B](implicit toIterableOnce: (Node) => collection.IterableOnce[B]): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  68. def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  69. def foldLeft[B](z: B)(op: (B, Node) => B): B
    Definition Classes
    IterableOnceOps
  70. def foldRight[B](z: B)(op: (Node, B) => B): B
    Definition Classes
    IterableOnceOps
  71. def forall(p: (Node) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  72. def foreach[U](f: (Node) => U): Unit
    Definition Classes
    IterableOnceOps
  73. def groupBy[K](f: (Node) => K): Map[K, ArrayBuffer[Node]]
    Definition Classes
    IterableOps
  74. def groupMap[K, B](key: (Node) => K)(f: (Node) => B): Map[K, ArrayBuffer[B]]
    Definition Classes
    IterableOps
  75. def groupMapReduce[K, B](key: (Node) => K)(f: (Node) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  76. def grouped(size: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableOps
  77. def hashCode(): Int
    Definition Classes
    Seq → AnyRef → Any
  78. def head: Node
    Definition Classes
    IterableOps
  79. def headOption: Option[Node]
    Definition Classes
    IterableOps
  80. def indexOf[B >: Node](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
  81. def indexOf[B >: Node](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  82. def indexOfSlice[B >: Node](that: collection.Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
  83. def indexOfSlice[B >: Node](that: collection.Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  84. def indexWhere(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
  85. def indexWhere(p: (Node) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  86. def indices: collection.immutable.Range
    Definition Classes
    SeqOps
  87. def init: ArrayBuffer[Node]
    Definition Classes
    IterableOps
  88. def inits: collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableOps
  89. def insert(index: Int, elem: Node): Unit
    Definition Classes
    ArrayBuffer → Buffer
  90. def insertAll(index: Int, elems: collection.IterableOnce[Node]): Unit
    Definition Classes
    ArrayBuffer → Buffer
  91. def intersect[B >: Node](that: collection.Seq[B]): ArrayBuffer[Node]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  92. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  93. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  94. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  95. def iterableFactory: SeqFactory[ArrayBuffer]
    Definition Classes
    ArrayBuffer → IndexedBuffer → IndexedSeq → IndexedSeq → Buffer → Seq → Iterable → Seq → Iterable → IterableOps
  96. def iterator: collection.Iterator[Node]
    Definition Classes
    IndexedSeqOps → IterableOnce
  97. def knownSize: Int
    Definition Classes
    ArrayBuffer → IndexedSeqOps → Buffer → Growable → IterableOnce
  98. def last: Node
    Definition Classes
    IndexedSeqOps → IterableOps
  99. def lastIndexOf[B >: Node](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  100. def lastIndexOfSlice[B >: Node](that: collection.Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
  101. def lastIndexOfSlice[B >: Node](that: collection.Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  102. def lastIndexWhere(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
  103. def lastIndexWhere(p: (Node) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  104. def lastOption: Option[Node]
    Definition Classes
    IterableOps
  105. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Node, B, NodeBuffer.this.type]
    Definition Classes
    Iterable
  106. def length: Int
    Definition Classes
    ArrayBuffer → SeqOps
  107. final def lengthCompare(that: collection.Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  108. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  109. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  110. def lift: (Int) => Option[Node]
    Definition Classes
    PartialFunction
  111. def map[B](f: (Node) => B): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  112. def mapInPlace(f: (Node) => Node): NodeBuffer.this.type
    Definition Classes
    IndexedSeqOps
  113. def max[B >: Node](implicit ord: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  114. def maxBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  115. def maxByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  116. def maxOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  117. def min[B >: Node](implicit ord: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  118. def minBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  119. def minByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  120. def minOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  121. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  122. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  123. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  124. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  125. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  126. def padTo[B >: Node](len: Int, elem: B): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  127. def padToInPlace(len: Int, elem: Node): NodeBuffer.this.type
    Definition Classes
    Buffer
  128. def partition(p: (Node) => Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  129. def partitionMap[A1, A2](f: (Node) => Either[A1, A2]): (ArrayBuffer[A1], ArrayBuffer[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  130. def patch[B >: Node](from: Int, other: collection.IterableOnce[B], replaced: Int): ArrayBuffer[B]
    Definition Classes
    SeqOps
  131. def patchInPlace(from: Int, patch: collection.IterableOnce[Node], replaced: Int): NodeBuffer.this.type
    Definition Classes
    IndexedBuffer → Buffer
  132. def permutations: collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    SeqOps
  133. def prepend(elem: Node): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer → Buffer
  134. def prependAll(elems: collection.IterableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    Buffer
  135. def prepended[B >: Node](elem: B): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  136. def prependedAll[B >: Node](prefix: collection.IterableOnce[B]): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  137. def product[B >: Node](implicit num: math.Numeric[B]): B
    Definition Classes
    IterableOnceOps
  138. def reduce[B >: Node](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  139. def reduceLeft[B >: Node](op: (B, Node) => B): B
    Definition Classes
    IterableOnceOps
  140. def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]
    Definition Classes
    IterableOnceOps
  141. def reduceOption[B >: Node](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  142. def reduceRight[B >: Node](op: (Node, B) => B): B
    Definition Classes
    IterableOnceOps
  143. def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  144. def remove(index: Int, count: Int): Unit
    Definition Classes
    ArrayBuffer → Buffer
  145. def remove(index: Int): Node
    Definition Classes
    ArrayBuffer → Buffer
  146. def reverse: ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOps → SeqOps
  147. def reverseIterator: collection.Iterator[Node]
    Definition Classes
    IndexedSeqOps → SeqOps
  148. def runWith[U](action: (Node) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  149. def sameElements[B >: Node](that: collection.IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  150. def scan[B >: Node](z: B)(op: (B, B) => B): ArrayBuffer[B]
    Definition Classes
    IterableOps
  151. def scanLeft[B](z: B)(op: (B, Node) => B): ArrayBuffer[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  152. def scanRight[B](z: B)(op: (Node, B) => B): ArrayBuffer[B]
    Definition Classes
    IterableOps
  153. def search[B >: Node](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  154. def search[B >: Node](elem: B)(implicit ord: math.Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  155. def segmentLength(p: (Node) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  156. final def segmentLength(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
  157. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  158. final def sizeCompare(that: collection.Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  159. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  160. def sizeHint(size: Int): Unit
    Definition Classes
    ArrayBuffer
  161. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  162. def slice(from: Int, until: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  163. def sliceInPlace(start: Int, end: Int): NodeBuffer.this.type
    Definition Classes
    Buffer
  164. def sliding(size: Int, step: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableOps
  165. def sliding(size: Int): collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableOps
  166. def sortBy[B](f: (Node) => B)(implicit ord: Ordering[B]): ArrayBuffer[Node]
    Definition Classes
    SeqOps
  167. def sortInPlace[B >: Node]()(implicit ord: Ordering[B]): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer → IndexedSeqOps
  168. def sortInPlaceBy[B](f: (Node) => B)(implicit ord: Ordering[B]): NodeBuffer.this.type
    Definition Classes
    IndexedSeqOps
  169. def sortInPlaceWith(lt: (Node, Node) => Boolean): NodeBuffer.this.type
    Definition Classes
    IndexedSeqOps
  170. def sortWith(lt: (Node, Node) => Boolean): ArrayBuffer[Node]
    Definition Classes
    SeqOps
  171. def sorted[B >: Node](implicit ord: Ordering[B]): ArrayBuffer[Node]
    Definition Classes
    SeqOps
  172. def span(p: (Node) => Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  173. def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])
    Definition Classes
    IterableOps → IterableOnceOps
  174. def startsWith[B >: Node](that: collection.IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  175. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Node, S]): S with EfficientSplit
    Definition Classes
    ArrayBuffer → IndexedSeqOps → IterableOnce
  176. def subtractAll(xs: collection.IterableOnce[Node]): NodeBuffer.this.type
    Definition Classes
    Shrinkable
  177. def subtractOne(x: Node): NodeBuffer.this.type
    Definition Classes
    Buffer → Shrinkable
  178. def sum[B >: Node](implicit num: math.Numeric[B]): B
    Definition Classes
    IterableOnceOps
  179. def tail: ArrayBuffer[Node]
    Definition Classes
    IterableOps
  180. def tails: collection.Iterator[ArrayBuffer[Node]]
    Definition Classes
    IterableOps
  181. def take(n: Int): ArrayBuffer[Node]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  182. def takeInPlace(n: Int): NodeBuffer.this.type
    Definition Classes
    Buffer
  183. def takeRight(n: Int): ArrayBuffer[Node]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  184. def takeRightInPlace(n: Int): NodeBuffer.this.type
    Definition Classes
    Buffer
  185. def takeWhile(p: (Node) => Boolean): ArrayBuffer[Node]
    Definition Classes
    IterableOps → IterableOnceOps
  186. def takeWhileInPlace(p: (Node) => Boolean): NodeBuffer.this.type
    Definition Classes
    Buffer
  187. def tapEach[U](f: (Node) => U): ArrayBuffer[Node]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  188. def to[C1](factory: Factory[Node, C1]): C1
    Definition Classes
    IterableOnceOps
  189. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  190. final def toBuffer[B >: Node]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  191. def toIndexedSeq: collection.immutable.IndexedSeq[Node]
    Definition Classes
    IterableOnceOps
  192. final def toIterable: NodeBuffer.this.type
    Definition Classes
    Iterable → IterableOps
  193. def toList: collection.immutable.List[Node]
    Definition Classes
    IterableOnceOps
  194. def toMap[K, V](implicit ev: <:<[Node, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  195. def toSeq: collection.immutable.Seq[Node]
    Definition Classes
    IterableOnceOps
  196. def toSet[B >: Node]: Set[B]
    Definition Classes
    IterableOnceOps
  197. def toString(): String
    Definition Classes
    Seq → Function1 → Iterable → AnyRef → Any
  198. def toVector: collection.immutable.Vector[Node]
    Definition Classes
    IterableOnceOps
  199. def transpose[B](implicit asIterable: (Node) => collection.Iterable[B]): ArrayBuffer[ArrayBuffer[B]]
    Definition Classes
    IterableOps
  200. def trimEnd(n: Int): Unit
    Definition Classes
    Buffer
  201. def trimStart(n: Int): Unit
    Definition Classes
    Buffer
  202. def trimToSize(): Unit
    Definition Classes
    ArrayBuffer
  203. def unapply(a: Int): Option[Node]
    Definition Classes
    PartialFunction
  204. def unzip[A1, A2](implicit asPair: (Node) => (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  205. def unzip3[A1, A2, A3](implicit asTriple: (Node) => (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  206. def update(index: Int, elem: Node): Unit
    Definition Classes
    ArrayBuffer → SeqOps
  207. def updated[B >: Node](index: Int, elem: B): ArrayBuffer[B]
    Definition Classes
    SeqOps
  208. def view: ArrayBufferView[Node]
    Definition Classes
    ArrayBuffer → IndexedSeqOps → SeqOps → IterableOps
  209. def withFilter(p: (Node) => Boolean): WithFilter[Node, [_]ArrayBuffer[_]]
    Definition Classes
    IterableOps
  210. def zip[B](that: collection.IterableOnce[B]): ArrayBuffer[(Node, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  211. def zipAll[A1 >: Node, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): ArrayBuffer[(A1, B)]
    Definition Classes
    IterableOps
  212. def zipWithIndex: ArrayBuffer[(Node, Int)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def +=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type
    Definition Classes
    Growable
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ++= (addAll) instead of varargs +=

  2. final def /:[B](z: B)(op: (B, Node) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  3. final def :\[B](z: B)(op: (Node, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  4. def aggregate[B](z: => B)(seqop: (B, Node) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  5. final def append(elems: Node*): NodeBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use appendAll instead

  6. def companion: IterableFactory[[_]ArrayBuffer[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  7. final def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  8. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  9. def mapResult[NewTo](f: (ArrayBuffer[Node]) => NewTo): Builder[Node, NewTo]
    Definition Classes
    ArrayBuffer
    Annotations
    @deprecated @deprecatedOverriding("ArrayBuffer[A] no longer extends Builder[A, ArrayBuffer[A]]", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use 'new GrowableBuilder(this).mapResult(f)' instead

  10. final def prefixLength(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  11. final def prepend(elems: Node*): NodeBuffer.this.type
    Definition Classes
    Buffer
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use prependAll instead

  12. final def repr: ArrayBuffer[Node]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  13. def result(): NodeBuffer.this.type
    Definition Classes
    ArrayBuffer
    Annotations
    @deprecated @deprecatedOverriding("ArrayBuffer[A] no longer extends Builder[A, ArrayBuffer[A]]", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use 'this' instance instead

  14. def reverseMap[B](f: (Node) => B): ArrayBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  15. def seq: NodeBuffer.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  16. final def toIterator: collection.Iterator[Node]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  17. final def toStream: collection.immutable.Stream[Node]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  18. final def toTraversable: collection.Traversable[Node]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  19. final def transform(f: (Node) => Node): NodeBuffer.this.type
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use mapInPlace on an IndexedSeq instead

  20. final def union[B >: Node](that: collection.Seq[B]): ArrayBuffer[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  21. def view(from: Int, until: Int): IndexedSeqView[Node]
    Definition Classes
    IndexedSeqOps → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)