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.
- Alphabetic
 - By Inheritance
 
- NodeBuffer
 - ScalaVersionSpecificNodeBuffer
 - ArrayBuffer
 - DefaultSerializable
 - Serializable
 - StrictOptimizedSeqOps
 - StrictOptimizedIterableOps
 - IndexedBuffer
 - IndexedSeq
 - IndexedSeqOps
 - IndexedSeq
 - IndexedSeqOps
 - AbstractBuffer
 - Buffer
 - Shrinkable
 - Growable
 - Clearable
 - AbstractSeq
 - Seq
 - SeqOps
 - Cloneable
 - Cloneable
 - Iterable
 - AbstractSeq
 - Seq
 - Equals
 - SeqOps
 - PartialFunction
 - Function1
 - AbstractIterable
 - Iterable
 - IterableFactoryDefaults
 - IterableOps
 - IterableOnceOps
 - IterableOnce
 - AnyRef
 - Any
 
- Hide All
 - Show All
 
- Public
 - Protected
 
Instance Constructors
-  new NodeBuffer()
 
Value Members
-   final  def !=(arg0: Any): Boolean
- Definition Classes
 - AnyRef → Any
 
 -   final  def ##: Int
- Definition Classes
 - AnyRef → Any
 
 -    def &+(o: Any): NodeBuffer
Append given object to this buffer, returns reference on this
NodeBufferfor convenience.Append given object to this buffer, returns reference on this
NodeBufferfor convenience. Some rules apply: - If argumentoisnull, it is ignored. - If it is anIteratororIterable, its elements will be added. - Ifois 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
 -   final  def ++[B >: Node](suffix: collection.IterableOnce[B]): ArrayBuffer[B]
- Definition Classes
 - IterableOps
 - Annotations
 - @inline()
 
 -   final  def ++:[B >: Node](prefix: collection.IterableOnce[B]): ArrayBuffer[B]
- Definition Classes
 - SeqOps → IterableOps
 - Annotations
 - @inline()
 
 -   final  def ++=(xs: collection.IterableOnce[Node]): NodeBuffer.this.type
- Definition Classes
 - Growable
 - Annotations
 - @inline()
 
 -   final  def ++=:(elems: collection.IterableOnce[Node]): NodeBuffer.this.type
- Definition Classes
 - Buffer
 - Annotations
 - @inline()
 
 -   final  def +:[B >: Node](elem: B): ArrayBuffer[B]
- Definition Classes
 - SeqOps
 - Annotations
 - @inline()
 
 -   final  def +=(elem: Node): NodeBuffer.this.type
- Definition Classes
 - Growable
 - Annotations
 - @inline()
 
 -   final  def +=:(elem: Node): NodeBuffer.this.type
- Definition Classes
 - Buffer
 - Annotations
 - @inline()
 
 -   final  def --=(xs: collection.IterableOnce[Node]): NodeBuffer.this.type
- Definition Classes
 - Shrinkable
 - Annotations
 - @inline()
 
 -   final  def -=(elem: Node): NodeBuffer.this.type
- Definition Classes
 - Shrinkable
 - Annotations
 - @inline()
 
 -   final  def :+[B >: Node](elem: B): ArrayBuffer[B]
- Definition Classes
 - SeqOps
 - Annotations
 - @inline()
 
 -   final  def :++[B >: Node](suffix: collection.IterableOnce[B]): ArrayBuffer[B]
- Definition Classes
 - SeqOps
 - Annotations
 - @inline()
 
 -   final  def ==(arg0: Any): Boolean
- Definition Classes
 - AnyRef → Any
 
 -    def addAll(elems: collection.IterableOnce[Node]): NodeBuffer.this.type
- Definition Classes
 - ArrayBuffer → Growable
 
 -    def addOne(elem: Node): NodeBuffer.this.type
- Definition Classes
 - ArrayBuffer → Growable
 
 -   final  def addString(b: collection.mutable.StringBuilder): collection.mutable.StringBuilder
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @inline()
 
 -   final  def addString(b: collection.mutable.StringBuilder, sep: String): collection.mutable.StringBuilder
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @inline()
 
 -    def addString(b: collection.mutable.StringBuilder, start: String, sep: String, end: String): collection.mutable.StringBuilder
- Definition Classes
 - IterableOnceOps
 
 -    def andThen[C](k: PartialFunction[Node, C]): PartialFunction[Int, C]
- Definition Classes
 - PartialFunction
 
 -    def andThen[C](k: (Node) => C): PartialFunction[Int, C]
- Definition Classes
 - PartialFunction → Function1
 
 -   final  def append(elem: Node): NodeBuffer.this.type
- Definition Classes
 - Buffer
 - Annotations
 - @inline()
 
 -   final  def appendAll(xs: collection.IterableOnce[Node]): NodeBuffer.this.type
- Definition Classes
 - Buffer
 - Annotations
 - @inline()
 
 -    def appended[B >: Node](elem: B): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedSeqOps → SeqOps
 
 -    def appendedAll[B >: Node](suffix: collection.IterableOnce[B]): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedSeqOps → SeqOps
 
 -    def apply(n: Int): Node
- Definition Classes
 - ArrayBuffer → SeqOps → Function1
 
 -    def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) => B1): B1
- Definition Classes
 - PartialFunction
 
 -    var array: Array[AnyRef]
- Attributes
 - protected[collection]
 - Definition Classes
 - ArrayBuffer
 
 -   final  def asInstanceOf[T0]: T0
- Definition Classes
 - Any
 
 -    def canEqual(that: Any): Boolean
- Definition Classes
 - Seq → Equals
 
 -    def className: String
- Definition Classes
 - ScalaVersionSpecificNodeBuffer
 
 -    def clear(): Unit
- Definition Classes
 - ArrayBuffer → Clearable
 
 -    def clearAndShrink(size: Int): NodeBuffer.this.type
- Definition Classes
 - ArrayBuffer
 
 -    def clone(): ArrayBuffer[Node]
- Definition Classes
 - SeqOps → Cloneable → AnyRef
 
 -   final  def coll: NodeBuffer.this.type
- Attributes
 - protected
 - Definition Classes
 - Iterable → IterableOps
 
 -    def collect[B](pf: PartialFunction[Node, B]): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
- Definition Classes
 - IterableOnceOps
 
 -    def combinations(n: Int): collection.Iterator[ArrayBuffer[Node]]
- Definition Classes
 - SeqOps
 
 -    def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Node]
- Definition Classes
 - PartialFunction
 
 -    def compose[A](g: (A) => Int): (A) => Node
- Definition Classes
 - Function1
 - Annotations
 - @unspecialized()
 
 -   final  def concat[B >: Node](suffix: collection.IterableOnce[B]): ArrayBuffer[B]
- Definition Classes
 - SeqOps → IterableOps
 - Annotations
 - @inline()
 
 -    def contains[A1 >: Node](elem: A1): Boolean
- Definition Classes
 - SeqOps
 
 -    def containsSlice[B >: Node](that: collection.Seq[B]): Boolean
- Definition Classes
 - SeqOps
 
 -    def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
 - ArrayBuffer → IterableOnceOps
 
 -    def copyToArray[B >: Node](xs: Array[B], start: Int): Int
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
 
 -    def copyToArray[B >: Node](xs: Array[B]): Int
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
 
 -    def corresponds[B](that: collection.Seq[B])(p: (Node, B) => Boolean): Boolean
- Definition Classes
 - SeqOps
 
 -    def corresponds[B](that: collection.IterableOnce[B])(p: (Node, B) => Boolean): Boolean
- Definition Classes
 - IterableOnceOps
 
 -    def count(p: (Node) => Boolean): Int
- Definition Classes
 - IterableOnceOps
 
 -    def diff[B >: Node](that: collection.Seq[B]): ArrayBuffer[Node]
- Definition Classes
 - StrictOptimizedSeqOps → SeqOps
 
 -    def distinct: ArrayBuffer[Node]
- Definition Classes
 - SeqOps
 
 -    def distinctBy[B](f: (Node) => B): ArrayBuffer[Node]
- Definition Classes
 - StrictOptimizedSeqOps → SeqOps
 
 -    def drop(n: Int): ArrayBuffer[Node]
- Definition Classes
 - IndexedSeqOps → IterableOps → IterableOnceOps
 
 -    def dropInPlace(n: Int): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def dropRight(n: Int): ArrayBuffer[Node]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps
 
 -    def dropRightInPlace(n: Int): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def dropWhile(p: (Node) => Boolean): ArrayBuffer[Node]
- Definition Classes
 - IterableOps → IterableOnceOps
 
 -    def dropWhileInPlace(p: (Node) => Boolean): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def elementWise: ElementWiseExtractor[Int, Node]
- Definition Classes
 - PartialFunction
 
 -    def empty: ArrayBuffer[Node]
- Definition Classes
 - IterableFactoryDefaults → IterableOps
 
 -    def endsWith[B >: Node](that: collection.Iterable[B]): Boolean
- Definition Classes
 - SeqOps
 
 -    def ensureSize(n: Int): Unit
- Attributes
 - protected
 - Definition Classes
 - ArrayBuffer
 
 -   final  def eq(arg0: AnyRef): Boolean
- Definition Classes
 - AnyRef
 
 -    def equals(o: Any): Boolean
- Definition Classes
 - Seq → Equals → AnyRef → Any
 
 -    def exists(p: (Node) => Boolean): Boolean
- Definition Classes
 - IterableOnceOps
 
 -    def filter(pred: (Node) => Boolean): ArrayBuffer[Node]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def filterImpl(pred: (Node) => Boolean, isFlipped: Boolean): ArrayBuffer[Node]
- Attributes
 - protected[collection]
 - Definition Classes
 - StrictOptimizedIterableOps
 
 -    def filterInPlace(p: (Node) => Boolean): NodeBuffer.this.type
- Definition Classes
 - IndexedBuffer
 
 -    def filterNot(pred: (Node) => Boolean): ArrayBuffer[Node]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def finalize(): Unit
- Attributes
 - protected[lang]
 - Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.Throwable])
 
 -    def find(p: (Node) => Boolean): Option[Node]
- Definition Classes
 - IterableOnceOps
 
 -    def findLast(p: (Node) => Boolean): Option[Node]
- Definition Classes
 - SeqOps
 
 -    def flatMap[B](f: (Node) => collection.IterableOnce[B]): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def flatMapInPlace(f: (Node) => collection.IterableOnce[Node]): NodeBuffer.this.type
- Definition Classes
 - IndexedBuffer
 
 -    def flatten[B](implicit toIterableOnce: (Node) => collection.IterableOnce[B]): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
 - IterableOnceOps
 
 -    def foldLeft[B](z: B)(op: (B, Node) => B): B
- Definition Classes
 - IterableOnceOps
 
 -    def foldRight[B](z: B)(op: (Node, B) => B): B
- Definition Classes
 - IndexedSeqOps → IterableOnceOps
 
 -    def forall(p: (Node) => Boolean): Boolean
- Definition Classes
 - IterableOnceOps
 
 -    def foreach[U](f: (Node) => U): Unit
- Definition Classes
 - IterableOnceOps
 
 -    def fromSpecific(coll: collection.IterableOnce[Node]): ArrayBuffer[Node]
- Attributes
 - protected
 - Definition Classes
 - IterableFactoryDefaults → IterableOps
 
 -   final  def getClass(): Class[_ <: AnyRef]
- Definition Classes
 - AnyRef → Any
 - Annotations
 - @native()
 
 -    def groupBy[K](f: (Node) => K): Map[K, ArrayBuffer[Node]]
- Definition Classes
 - IterableOps
 
 -    def groupMap[K, B](key: (Node) => K)(f: (Node) => B): Map[K, ArrayBuffer[B]]
- Definition Classes
 - IterableOps
 
 -    def groupMapReduce[K, B](key: (Node) => K)(f: (Node) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
 - IterableOps
 
 -    def grouped(size: Int): collection.Iterator[ArrayBuffer[Node]]
- Definition Classes
 - IterableOps
 
 -    def hashCode(): Int
- Definition Classes
 - Seq → AnyRef → Any
 
 -    def head: Node
- Definition Classes
 - IndexedSeqOps → IterableOps
 
 -    def headOption: Option[Node]
- Definition Classes
 - IndexedSeqOps → IterableOps
 
 -    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")
 
 -    def indexOf[B >: Node](elem: B, from: Int): Int
- Definition Classes
 - SeqOps
 
 -    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")
 
 -    def indexOfSlice[B >: Node](that: collection.Seq[B], from: Int): Int
- Definition Classes
 - SeqOps
 
 -    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")
 
 -    def indexWhere(p: (Node) => Boolean, from: Int): Int
- Definition Classes
 - SeqOps
 
 -    def indices: collection.immutable.Range
- Definition Classes
 - SeqOps
 
 -    def init: ArrayBuffer[Node]
- Definition Classes
 - IterableOps
 
 -    def inits: collection.Iterator[ArrayBuffer[Node]]
- Definition Classes
 - IterableOps
 
 -    def insert(index: Int, elem: Node): Unit
- Definition Classes
 - ArrayBuffer → Buffer
 
 -    def insertAll(index: Int, elems: collection.IterableOnce[Node]): Unit
- Definition Classes
 - ArrayBuffer → Buffer
 
 -    def intersect[B >: Node](that: collection.Seq[B]): ArrayBuffer[Node]
- Definition Classes
 - StrictOptimizedSeqOps → SeqOps
 
 -    def isDefinedAt(idx: Int): Boolean
- Definition Classes
 - SeqOps
 
 -    def isEmpty: Boolean
- Definition Classes
 - SeqOps → IterableOnceOps
 
 -   final  def isInstanceOf[T0]: Boolean
- Definition Classes
 - Any
 
 -    def isTraversableAgain: Boolean
- Definition Classes
 - IterableOps → IterableOnceOps
 
 -    def iterableFactory: SeqFactory[ArrayBuffer]
- Definition Classes
 - ArrayBuffer → IndexedBuffer → IndexedSeq → IndexedSeq → Buffer → Seq → Iterable → Seq → Iterable → IterableOps
 
 -    def iterator: collection.Iterator[Node]
- Definition Classes
 - IndexedSeqOps → IterableOnce
 
 -    def knownSize: Int
- Definition Classes
 - ArrayBuffer → IndexedSeqOps → Buffer → Growable → IterableOnce
 
 -    def last: Node
- Definition Classes
 - IndexedSeqOps → IterableOps
 
 -    def lastIndexOf[B >: Node](elem: B, end: Int): Int
- Definition Classes
 - SeqOps
 
 -    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")
 
 -    def lastIndexOfSlice[B >: Node](that: collection.Seq[B], end: Int): Int
- Definition Classes
 - SeqOps
 
 -    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")
 
 -    def lastIndexWhere(p: (Node) => Boolean, end: Int): Int
- Definition Classes
 - SeqOps
 
 -    def lastOption: Option[Node]
- Definition Classes
 - IterableOps
 
 -    def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Node, B, NodeBuffer.this.type]
- Definition Classes
 - Iterable
 
 -    def length: Int
- Definition Classes
 - ArrayBuffer → SeqOps
 
 -   final  def lengthCompare(that: collection.Iterable[_]): Int
- Definition Classes
 - IndexedSeqOps → SeqOps
 
 -   final  def lengthCompare(len: Int): Int
- Definition Classes
 - IndexedSeqOps → SeqOps
 
 -   final  def lengthIs: SizeCompareOps
- Definition Classes
 - SeqOps
 - Annotations
 - @inline()
 
 -    def lift: (Int) => Option[Node]
- Definition Classes
 - PartialFunction
 
 -    def map[B](f: (Node) => B): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def mapInPlace(f: (Node) => Node): NodeBuffer.this.type
- Definition Classes
 - IndexedSeqOps
 
 -    def max[B >: Node](implicit ord: math.Ordering[B]): Node
- Definition Classes
 - IterableOnceOps
 
 -    def maxBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
- Definition Classes
 - IterableOnceOps
 
 -    def maxByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
- Definition Classes
 - IterableOnceOps
 
 -    def maxOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
- Definition Classes
 - IterableOnceOps
 
 -    def min[B >: Node](implicit ord: math.Ordering[B]): Node
- Definition Classes
 - IterableOnceOps
 
 -    def minBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
- Definition Classes
 - IterableOnceOps
 
 -    def minByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
- Definition Classes
 - IterableOnceOps
 
 -    def minOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
- Definition Classes
 - IterableOnceOps
 
 -   final  def mkString: String
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @inline()
 
 -   final  def mkString(sep: String): String
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @inline()
 
 -   final  def mkString(start: String, sep: String, end: String): String
- Definition Classes
 - IterableOnceOps
 
 -   final  def ne(arg0: AnyRef): Boolean
- Definition Classes
 - AnyRef
 
 -    def newSpecificBuilder: Builder[Node, ArrayBuffer[Node]]
- Attributes
 - protected
 - Definition Classes
 - IterableFactoryDefaults → IterableOps
 
 -    def nonEmpty: Boolean
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
 
 -   final  def notify(): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @native()
 
 -   final  def notifyAll(): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @native()
 
 -    def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
- Attributes
 - protected[collection]
 - Definition Classes
 - SeqOps
 
 -    def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
 - PartialFunction
 
 -    def padTo[B >: Node](len: Int, elem: B): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedSeqOps → SeqOps
 
 -    def padToInPlace(len: Int, elem: Node): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def partition(p: (Node) => Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps
 
 -    def partitionMap[A1, A2](f: (Node) => Either[A1, A2]): (ArrayBuffer[A1], ArrayBuffer[A2])
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps
 
 -    def patch[B >: Node](from: Int, other: collection.IterableOnce[B], replaced: Int): ArrayBuffer[B]
- Definition Classes
 - SeqOps
 
 -    def patchInPlace(from: Int, patch: collection.IterableOnce[Node], replaced: Int): NodeBuffer.this.type
- Definition Classes
 - IndexedBuffer → Buffer
 
 -    def permutations: collection.Iterator[ArrayBuffer[Node]]
- Definition Classes
 - SeqOps
 
 -    def prepend(elem: Node): NodeBuffer.this.type
- Definition Classes
 - ArrayBuffer → Buffer
 
 -    def prependAll(elems: collection.IterableOnce[Node]): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def prepended[B >: Node](elem: B): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedSeqOps → SeqOps
 
 -    def prependedAll[B >: Node](prefix: collection.IterableOnce[B]): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedSeqOps → SeqOps
 
 -    def product[B >: Node](implicit num: math.Numeric[B]): B
- Definition Classes
 - IterableOnceOps
 
 -    def reduce[B >: Node](op: (B, B) => B): B
- Definition Classes
 - IterableOnceOps
 
 -    def reduceLeft[B >: Node](op: (B, Node) => B): B
- Definition Classes
 - IterableOnceOps
 
 -    def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]
- Definition Classes
 - IterableOnceOps
 
 -    def reduceOption[B >: Node](op: (B, B) => B): Option[B]
- Definition Classes
 - IterableOnceOps
 
 -    def reduceRight[B >: Node](op: (Node, B) => B): B
- Definition Classes
 - IterableOnceOps
 
 -    def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]
- Definition Classes
 - IterableOnceOps
 
 -    def remove(index: Int, count: Int): Unit
- Definition Classes
 - ArrayBuffer → Buffer
 
 -    def remove(index: Int): Node
- Definition Classes
 - ArrayBuffer → Buffer
 
 -    def reverse: ArrayBuffer[Node]
- Definition Classes
 - IndexedSeqOps → SeqOps
 
 -    def reverseIterator: collection.Iterator[Node]
- Definition Classes
 - IndexedSeqOps → SeqOps
 
 -    def reversed: collection.Iterable[Node]
- Attributes
 - protected
 - Definition Classes
 - IndexedSeqOps → IterableOnceOps
 
 -    def runWith[U](action: (Node) => U): (Int) => Boolean
- Definition Classes
 - PartialFunction
 
 -    def sameElements[B >: Node](that: collection.IterableOnce[B]): Boolean
- Definition Classes
 - SeqOps
 
 -    def scan[B >: Node](z: B)(op: (B, B) => B): ArrayBuffer[B]
- Definition Classes
 - IterableOps
 
 -    def scanLeft[B](z: B)(op: (B, Node) => B): ArrayBuffer[B]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def scanRight[B](z: B)(op: (Node, B) => B): ArrayBuffer[B]
- Definition Classes
 - IterableOps
 
 -    def search[B >: Node](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
- Definition Classes
 - IndexedSeqOps → SeqOps
 
 -    def search[B >: Node](elem: B)(implicit ord: math.Ordering[B]): SearchResult
- Definition Classes
 - IndexedSeqOps → SeqOps
 
 -    def segmentLength(p: (Node) => Boolean, from: Int): Int
- Definition Classes
 - SeqOps
 
 -   final  def segmentLength(p: (Node) => Boolean): Int
- Definition Classes
 - SeqOps
 
 -   final  def size: Int
- Definition Classes
 - SeqOps → IterableOnceOps
 
 -    var size0: Int
- Attributes
 - protected
 - Definition Classes
 - ArrayBuffer
 
 -   final  def sizeCompare(that: collection.Iterable[_]): Int
- Definition Classes
 - SeqOps → IterableOps
 
 -   final  def sizeCompare(otherSize: Int): Int
- Definition Classes
 - SeqOps → IterableOps
 
 -    def sizeHint(size: Int): Unit
- Definition Classes
 - ArrayBuffer
 
 -   final  def sizeIs: SizeCompareOps
- Definition Classes
 - IterableOps
 - Annotations
 - @inline()
 
 -    def slice(from: Int, until: Int): ArrayBuffer[Node]
- Definition Classes
 - IndexedSeqOps → IterableOps → IterableOnceOps
 
 -    def sliceInPlace(start: Int, end: Int): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def sliding(size: Int, step: Int): collection.Iterator[ArrayBuffer[Node]]
- Definition Classes
 - IterableOps
 
 -    def sliding(size: Int): collection.Iterator[ArrayBuffer[Node]]
- Definition Classes
 - IterableOps
 
 -    def sortBy[B](f: (Node) => B)(implicit ord: Ordering[B]): ArrayBuffer[Node]
- Definition Classes
 - SeqOps
 
 -    def sortInPlace[B >: Node]()(implicit ord: Ordering[B]): NodeBuffer.this.type
- Definition Classes
 - ArrayBuffer → IndexedSeqOps
 
 -    def sortInPlaceBy[B](f: (Node) => B)(implicit ord: Ordering[B]): NodeBuffer.this.type
- Definition Classes
 - IndexedSeqOps
 
 -    def sortInPlaceWith(lt: (Node, Node) => Boolean): NodeBuffer.this.type
- Definition Classes
 - IndexedSeqOps
 
 -    def sortWith(lt: (Node, Node) => Boolean): ArrayBuffer[Node]
- Definition Classes
 - SeqOps
 
 -    def sorted[B >: Node](implicit ord: Ordering[B]): ArrayBuffer[Node]
- Definition Classes
 - SeqOps
 
 -    def span(p: (Node) => Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])
- Definition Classes
 - IterableOps → IterableOnceOps
 
 -    def startsWith[B >: Node](that: collection.IterableOnce[B], offset: Int): Boolean
- Definition Classes
 - SeqOps
 
 -    def stepper[S <: Stepper[_]](implicit shape: StepperShape[Node, S]): S with EfficientSplit
- Definition Classes
 - ArrayBuffer → IndexedSeqOps → IterableOnce
 
 -   final  def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Node, B]): C2
- Attributes
 - protected[this]
 - Definition Classes
 - StrictOptimizedIterableOps
 - Annotations
 - @inline()
 
 -   final  def strictOptimizedConcat[B >: Node, C2](that: collection.IterableOnce[B], b: Builder[B, C2]): C2
- Attributes
 - protected[this]
 - Definition Classes
 - StrictOptimizedIterableOps
 - Annotations
 - @inline()
 
 -   final  def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (Node) => collection.IterableOnce[B]): C2
- Attributes
 - protected[this]
 - Definition Classes
 - StrictOptimizedIterableOps
 - Annotations
 - @inline()
 
 -   final  def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (Node) => collection.IterableOnce[B]): C2
- Attributes
 - protected[this]
 - Definition Classes
 - StrictOptimizedIterableOps
 - Annotations
 - @inline()
 
 -   final  def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (Node) => B): C2
- Attributes
 - protected[this]
 - Definition Classes
 - StrictOptimizedIterableOps
 - Annotations
 - @inline()
 
 -   final  def strictOptimizedZip[B, C2](that: collection.IterableOnce[B], b: Builder[(Node, B), C2]): C2
- Attributes
 - protected[this]
 - Definition Classes
 - StrictOptimizedIterableOps
 - Annotations
 - @inline()
 
 -    def stringPrefix: String
- Attributes
 - protected[this]
 - Definition Classes
 - ArrayBuffer → IndexedSeq → Buffer → Seq → Iterable
 
 -    def subtractAll(xs: collection.IterableOnce[Node]): NodeBuffer.this.type
- Definition Classes
 - Shrinkable
 
 -    def subtractOne(x: Node): NodeBuffer.this.type
- Definition Classes
 - Buffer → Shrinkable
 
 -    def sum[B >: Node](implicit num: math.Numeric[B]): B
- Definition Classes
 - IterableOnceOps
 
 -   final  def synchronized[T0](arg0: => T0): T0
- Definition Classes
 - AnyRef
 
 -    def tail: ArrayBuffer[Node]
- Definition Classes
 - IterableOps
 
 -    def tails: collection.Iterator[ArrayBuffer[Node]]
- Definition Classes
 - IterableOps
 
 -    def take(n: Int): ArrayBuffer[Node]
- Definition Classes
 - IndexedSeqOps → IterableOps → IterableOnceOps
 
 -    def takeInPlace(n: Int): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def takeRight(n: Int): ArrayBuffer[Node]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps
 
 -    def takeRightInPlace(n: Int): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def takeWhile(p: (Node) => Boolean): ArrayBuffer[Node]
- Definition Classes
 - IterableOps → IterableOnceOps
 
 -    def takeWhileInPlace(p: (Node) => Boolean): NodeBuffer.this.type
- Definition Classes
 - Buffer
 
 -    def tapEach[U](f: (Node) => U): ArrayBuffer[Node]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 -    def to[C1](factory: Factory[Node, C1]): C1
- Definition Classes
 - IterableOnceOps
 
 -    def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
 - IterableOnceOps
 
 -   final  def toBuffer[B >: Node]: Buffer[B]
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @inline()
 
 -    def toIndexedSeq: collection.immutable.IndexedSeq[Node]
- Definition Classes
 - IterableOnceOps
 
 -   final  def toIterable: NodeBuffer.this.type
- Definition Classes
 - Iterable → IterableOps
 
 -    def toList: collection.immutable.List[Node]
- Definition Classes
 - IterableOnceOps
 
 -    def toMap[K, V](implicit ev: <:<[Node, (K, V)]): Map[K, V]
- Definition Classes
 - IterableOnceOps
 
 -    def toSeq: collection.immutable.Seq[Node]
- Definition Classes
 - IterableOnceOps
 
 -    def toSet[B >: Node]: Set[B]
- Definition Classes
 - IterableOnceOps
 
 -    def toString(): String
- Definition Classes
 - Seq → Function1 → Iterable → AnyRef → Any
 
 -    def toVector: collection.immutable.Vector[Node]
- Definition Classes
 - IterableOnceOps
 
 -    def transpose[B](implicit asIterable: (Node) => collection.Iterable[B]): ArrayBuffer[ArrayBuffer[B]]
- Definition Classes
 - IterableOps
 
 -    def trimToSize(): Unit
- Definition Classes
 - ArrayBuffer
 
 -    def unapply(a: Int): Option[Node]
- Definition Classes
 - PartialFunction
 
 -    def unzip[A1, A2](implicit asPair: (Node) => (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps
 
 -    def unzip3[A1, A2, A3](implicit asTriple: (Node) => (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps
 
 -    def update(index: Int, elem: Node): Unit
- Definition Classes
 - ArrayBuffer → SeqOps
 
 -    def updated[B >: Node](index: Int, elem: B): ArrayBuffer[B]
- Definition Classes
 - SeqOps
 
 -    def view: ArrayBufferView[Node]
- Definition Classes
 - ArrayBuffer → IndexedSeqOps → SeqOps → IterableOps
 
 -   final  def wait(): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.InterruptedException])
 
 -   final  def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.InterruptedException])
 
 -   final  def wait(arg0: Long): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.InterruptedException]) @native()
 
 -    def withFilter(p: (Node) => Boolean): WithFilter[Node, [_]ArrayBuffer[_]]
- Definition Classes
 - IterableOps
 
 -    def writeReplace(): AnyRef
- Attributes
 - protected[this]
 - Definition Classes
 - DefaultSerializable
 
 -    def zip[B](that: collection.IterableOnce[B]): ArrayBuffer[(Node, B)]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps
 
 -    def zipAll[A1 >: Node, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): ArrayBuffer[(A1, B)]
- Definition Classes
 - IterableOps
 
 -    def zipWithIndex: ArrayBuffer[(Node, Int)]
- Definition Classes
 - StrictOptimizedIterableOps → IterableOps → IterableOnceOps
 
 
Deprecated Value Members
-   final  def +=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type
- Definition Classes
 - Growable
 - Annotations
 - @deprecated @inline()
 - Deprecated
 (Since version 2.13.0) Use
++=akaaddAllinstead of varargs+=; infix operations with an operand of multiple args will be deprecated
 -    def -=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type
- Definition Classes
 - Shrinkable
 - Annotations
 - @deprecated
 - Deprecated
 (Since version 2.13.3) Use
--=akasubtractAllinstead of varargs-=; infix operations with an operand of multiple args will be deprecated
 -   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 /:
 -   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 :\
 -    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)
aggregateis not relevant for sequential collections. UsefoldLeft(z)(seqop)instead.
 -   final  def append(elems: Node*): NodeBuffer.this.type
- Definition Classes
 - Buffer
 - Annotations
 - @deprecated @inline()
 - Deprecated
 (Since version 2.13.0) Use appendAll instead
 -    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
 -   final  def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @deprecated @inline()
 - Deprecated
 (Since version 2.13.0) Use
dest ++= collinstead
 -    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)
 -    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
 -   final  def prefixLength(p: (Node) => Boolean): Int
- Definition Classes
 - SeqOps
 - Annotations
 - @deprecated @inline()
 - Deprecated
 (Since version 2.13.0) Use segmentLength instead of prefixLength
 -   final  def prepend(elems: Node*): NodeBuffer.this.type
- Definition Classes
 - Buffer
 - Annotations
 - @deprecated @inline()
 - Deprecated
 (Since version 2.13.0) Use prependAll instead
 -   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
 -    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
 -    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)
 -    def seq: NodeBuffer.this.type
- Definition Classes
 - Iterable
 - Annotations
 - @deprecated
 - Deprecated
 (Since version 2.13.0) Iterable.seq always returns the iterable itself
 -   final  def toIterator: collection.Iterator[Node]
- Definition Classes
 - IterableOnceOps
 - Annotations
 - @deprecated @inline()
 - Deprecated
 (Since version 2.13.0) Use .iterator instead of .toIterator
 -   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
 -   final  def toTraversable: collection.Traversable[Node]
- Definition Classes
 - IterableOps
 - Annotations
 - @deprecated
 - Deprecated
 (Since version 2.13.0) Use toIterable instead
 -   final  def transform(f: (Node) => Node): NodeBuffer.this.type
- Definition Classes
 - SeqOps
 - Annotations
 - @deprecated @inline()
 - Deprecated
 (Since version 2.13.0) Use
mapInPlaceon anIndexedSeqinstead
 -    def trimEnd(n: Int): Unit
- Definition Classes
 - Buffer
 - Annotations
 - @deprecated
 - Deprecated
 (Since version 2.13.4) use dropRightInPlace instead
 -    def trimStart(n: Int): Unit
- Definition Classes
 - Buffer
 - Annotations
 - @deprecated
 - Deprecated
 (Since version 2.13.4) use dropInPlace instead
 -   final  def union[B >: Node](that: collection.Seq[B]): ArrayBuffer[B]
- Definition Classes
 - SeqOps
 - Annotations
 - @deprecated @inline()
 - Deprecated
 (Since version 2.13.0) Use
concatinstead
 -    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)