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

Instance Constructors

  1. new NodeBuffer()

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

Inherited from ScalaVersionSpecificNodeBuffer

Inherited from ArrayBuffer[Node]

Inherited from DefaultSerializable

Inherited from java.io.Serializable

Inherited from StrictOptimizedSeqOps[Node, ArrayBuffer, ArrayBuffer[Node]]

Inherited from StrictOptimizedIterableOps[Node, ArrayBuffer, ArrayBuffer[Node]]

Inherited from IndexedBuffer[Node]

Inherited from collection.mutable.IndexedSeq[Node]

Inherited from IndexedSeqOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]]

Inherited from collection.IndexedSeq[Node]

Inherited from IndexedSeqOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]]

Inherited from AbstractBuffer[Node]

Inherited from Buffer[Node]

Inherited from Shrinkable[Node]

Inherited from Growable[Node]

Inherited from Clearable

Inherited from AbstractSeq[Node]

Inherited from collection.mutable.Seq[Node]

Inherited from SeqOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]]

Inherited from collection.mutable.Cloneable[ArrayBuffer[Node]]

Inherited from java.lang.Cloneable

Inherited from collection.mutable.Iterable[Node]

Inherited from AbstractSeq[Node]

Inherited from collection.Seq[Node]

Inherited from Equals

Inherited from SeqOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) => Node

Inherited from AbstractIterable[Node]

Inherited from collection.Iterable[Node]

Inherited from IterableFactoryDefaults[Node, [x]ArrayBuffer[x]]

Inherited from IterableOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]]

Inherited from IterableOnceOps[Node, [_]ArrayBuffer[_], ArrayBuffer[Node]]

Inherited from collection.IterableOnce[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped