scala-xml/scala.xml/NodeBuffer

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.

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.

Authors

Burak Emir

trait ScalaVersionSpecificNodeBuffer
class ArrayBuffer[Node]
trait DefaultSerializable
trait Serializable
trait StrictOptimizedSeqOps[Node, [A] =>> ArrayBuffer[A], ArrayBuffer[Node]]
trait StrictOptimizedIterableOps[Node, [A] =>> ArrayBuffer[A], ArrayBuffer[Node]]
trait IndexedBuffer[Node]
trait IndexedSeq[Node]
trait IndexedSeqOps[Node, [A] =>> ArrayBuffer[A], ArrayBuffer[Node]]
trait IndexedSeq[Node]
trait IndexedSeqOps[Node, [A] =>> ArrayBuffer[A], ArrayBuffer[Node]]
class AbstractBuffer[Node]
trait Buffer[Node]
trait Shrinkable[Node]
trait Growable[Node]
trait Clearable
class AbstractSeq[Node]
trait Seq[Node]
trait SeqOps[Node, [A] =>> ArrayBuffer[A], ArrayBuffer[Node]]
trait Cloneable[ArrayBuffer[Node]]
trait Cloneable
trait Iterable[Node]
class AbstractSeq[Node]
trait Seq[Node]
trait Equals
trait SeqOps[Node, [A] =>> ArrayBuffer[A], ArrayBuffer[Node]]
trait PartialFunction[Int, Node]
trait Int => Node
class AbstractIterable[Node]
trait Iterable[Node]
trait IterableFactoryDefaults[Node, [A] =>> ArrayBuffer[A]]
trait IterableOps[Node, [A] =>> ArrayBuffer[A], ArrayBuffer[Node]]
trait IterableOnceOps[Node, [A] =>> ArrayBuffer[A], ArrayBuffer[Node]]
trait IterableOnce[Node]
class Object
trait Matchable
class Any

Value members

Concrete methods

def &+(o: Any): NodeBuffer

Append given object to this buffer, returns reference on this NodeBuffer for convenience. Some rules apply:

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.
Value Params
o

converts to an xml node and adds to this node buffer

Returns

this nodebuffer

Inherited methods

@inline
final def ++[B >: Node](suffix: IterableOnce[B]): ArrayBuffer[B]
Inherited from
IterableOps
@inline
final override def ++:[B >: Node](prefix: IterableOnce[B]): ArrayBuffer[B]
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
@inline
final def ++=(xs: IterableOnce[Node]): NodeBuffer
Inherited from
Growable
@inline
final def ++=:(elems: IterableOnce[Node]): NodeBuffer
Inherited from
Buffer
@inline
final def +:[B >: Node](elem: B): ArrayBuffer[B]
Inherited from
SeqOps
@inline
final def +=(elem: Node): NodeBuffer
Inherited from
Growable
@inline
final def +=:(elem: Node): NodeBuffer
Inherited from
Buffer
@inline
final def --=(xs: IterableOnce[Node]): NodeBuffer
Inherited from
Shrinkable
@inline
final def -=(elem: Node): NodeBuffer
Inherited from
Shrinkable
@inline
final def :+[B >: Node](elem: B): ArrayBuffer[B]
Inherited from
SeqOps
@inline
final def :++[B >: Node](suffix: IterableOnce[B]): ArrayBuffer[B]
Inherited from
SeqOps
def `scala$collection$SeqOps$$super$concat`[B >: Node](suffix: IterableOnce[B]): ArrayBuffer[B]
Inherited from
SeqOps
def `scala$collection$SeqOps$$super$sizeCompare`(that: Iterable[_]): Int
Inherited from
SeqOps
def `scala$collection$SeqOps$$super$sizeCompare`(otherSize: Int): Int
Inherited from
SeqOps
def `scala$collection$mutable$Cloneable$$super$clone`(): Object
Inherited from
Cloneable
override def addAll(elems: IterableOnce[Node]): NodeBuffer
Definition Classes
ArrayBuffer -> Growable
Inherited from
ArrayBuffer
def addOne(elem: Node): NodeBuffer
Inherited from
ArrayBuffer
@inline
final def addString(b: StringBuilder): StringBuilder
Inherited from
IterableOnceOps
@inline
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from
IterableOnceOps
def andThen[C](k: PartialFunction[Node, C]): PartialFunction[Int, C]
Inherited from
PartialFunction
override def andThen[C](k: Node => C): PartialFunction[Int, C]
Definition Classes
PartialFunction -> Function1
Inherited from
PartialFunction
@inline
final def append(elem: Node): NodeBuffer
Inherited from
Buffer
@inline
final def appendAll(xs: IterableOnce[Node]): NodeBuffer
Inherited from
Buffer
override def appended[B >: Node](elem: B): ArrayBuffer[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
override def appendedAll[B >: Node](suffix: IterableOnce[B]): ArrayBuffer[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def apply(n: Int): Node
Inherited from
ArrayBuffer
def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: A1 => B1): B1
Inherited from
PartialFunction
def canEqual(that: Any): Boolean
Inherited from
Seq
override def className: String
Definition Classes
ScalaVersionSpecificNodeBuffer
Inherited from
ScalaVersionSpecificNodeBuffer
def clear(): Unit
Inherited from
ArrayBuffer
def clearAndShrink(size: Int): NodeBuffer
Inherited from
ArrayBuffer
override def clone(): ArrayBuffer[Node]
Definition Classes
SeqOps -> Cloneable -> Object
Inherited from
SeqOps
override def collect[B](pf: PartialFunction[Node, B]): ArrayBuffer[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
Inherited from
IterableOnceOps
def combinations(n: Int): Iterator[ArrayBuffer[Node]]
Inherited from
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Node]
Inherited from
PartialFunction
@unspecialized
def compose[A](g: A => Int): A => Node
Inherited from
Function1
@inline
final override def concat[B >: Node](suffix: IterableOnce[B]): ArrayBuffer[B]
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
def contains[A1 >: Node](elem: A1): Boolean
Inherited from
SeqOps
def containsSlice[B >: Node](that: Seq[B]): Boolean
Inherited from
SeqOps
override def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int
Definition Classes
ArrayBuffer -> IterableOnceOps
Inherited from
ArrayBuffer
@deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
def copyToArray[B >: Node](xs: Array[B], start: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding("This should always forward to the 3-arg version of this method", "2.13.4")
def copyToArray[B >: Node](xs: Array[B]): Int
Inherited from
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (Node, B) => Boolean): Boolean
Inherited from
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (Node, B) => Boolean): Boolean
Inherited from
SeqOps
def count(p: Node => Boolean): Int
Inherited from
IterableOnceOps
override def diff[B >: Node](that: Seq[B]): ArrayBuffer[Node]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def distinct: ArrayBuffer[Node]
Inherited from
SeqOps
override def distinctBy[B](f: Node => B): ArrayBuffer[Node]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
override def drop(n: Int): ArrayBuffer[Node]
Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from
IndexedSeqOps
def dropInPlace(n: Int): NodeBuffer
Inherited from
Buffer
override def dropRight(n: Int): ArrayBuffer[Node]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def dropRightInPlace(n: Int): NodeBuffer
Inherited from
Buffer
def dropWhile(p: Node => Boolean): ArrayBuffer[Node]
Inherited from
IterableOps
def dropWhileInPlace(p: Node => Boolean): NodeBuffer
Inherited from
Buffer
def elementWise: ElementWiseExtractor[Int, Node]
Inherited from
PartialFunction
override def empty: ArrayBuffer[Node]
Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from
IterableFactoryDefaults
def endsWith[B >: Node](that: Iterable[B]): Boolean
Inherited from
SeqOps
override def equals(o: Any): Boolean
Definition Classes
Seq -> Equals -> Any
Inherited from
Seq
def exists(p: Node => Boolean): Boolean
Inherited from
IterableOnceOps
override def filter(pred: Node => Boolean): ArrayBuffer[Node]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def filterInPlace(p: Node => Boolean): NodeBuffer
Inherited from
IndexedBuffer
override def filterNot(pred: Node => Boolean): ArrayBuffer[Node]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def find(p: Node => Boolean): Option[Node]
Inherited from
IterableOnceOps
def findLast(p: Node => Boolean): Option[Node]
Inherited from
SeqOps
override def flatMap[B](f: Node => IterableOnce[B]): ArrayBuffer[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def flatMapInPlace(f: Node => IterableOnce[Node]): NodeBuffer
Inherited from
IndexedBuffer
override def flatten[B](toIterableOnce: Node => IterableOnce[B]): ArrayBuffer[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1
Inherited from
IterableOnceOps
def foldLeft[B](z: B)(op: (B, Node) => B): B
Inherited from
IterableOnceOps
override def foldRight[B](z: B)(op: (Node, B) => B): B
Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from
IndexedSeqOps
def forall(p: Node => Boolean): Boolean
Inherited from
IterableOnceOps
def foreach[U](f: Node => U): Unit
Inherited from
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[Node]): ArrayBuffer[Node]
Inherited from
IterableFactoryDefaults
def groupBy[K](f: Node => K): Map[K, ArrayBuffer[Node]]
Inherited from
IterableOps
def groupMap[K, B](key: Node => K)(f: Node => B): Map[K, ArrayBuffer[B]]
Inherited from
IterableOps
def groupMapReduce[K, B](key: Node => K)(f: Node => B)(reduce: (B, B) => B): Map[K, B]
Inherited from
IterableOps
def grouped(size: Int): Iterator[ArrayBuffer[Node]]
Inherited from
IterableOps
override def hashCode(): Int
Definition Classes
Seq -> Any
Inherited from
Seq
override def head: Node
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from
IndexedSeqOps
override def headOption: Option[Node]
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from
IndexedSeqOps
@deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
def indexOf[B >: Node](elem: B): Int
Inherited from
SeqOps
def indexOf[B >: Node](elem: B, from: Int): Int
Inherited from
SeqOps
@deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
def indexOfSlice[B >: Node](that: Seq[B]): Int
Inherited from
SeqOps
def indexOfSlice[B >: Node](that: Seq[B], from: Int): Int
Inherited from
SeqOps
@deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
def indexWhere(p: Node => Boolean): Int
Inherited from
SeqOps
def indexWhere(p: Node => Boolean, from: Int): Int
Inherited from
SeqOps
def indices: Range
Inherited from
SeqOps
def init: ArrayBuffer[Node]
Inherited from
IterableOps
def inits: Iterator[ArrayBuffer[Node]]
Inherited from
IterableOps
def insert(@deprecatedName("n", "2.13.0") index: Int, elem: Node): Unit
Inherited from
ArrayBuffer
def insertAll(@deprecatedName("n", "2.13.0") index: Int, elems: IterableOnce[Node]): Unit
Inherited from
ArrayBuffer
override def intersect[B >: Node](that: Seq[B]): ArrayBuffer[Node]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def isDefinedAt(idx: Int): Boolean
Inherited from
SeqOps
override def isEmpty: Boolean
Definition Classes
SeqOps -> IterableOnceOps
Inherited from
SeqOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
override def iterableFactory: SeqFactory[[A] =>> ArrayBuffer[A]]
Definition Classes
ArrayBuffer -> IndexedBuffer -> IndexedSeq -> IndexedSeq -> Buffer -> Seq -> Iterable -> Seq -> Iterable -> IterableOps
Inherited from
ArrayBuffer
def iterator: Iterator[Node]
Inherited from
IndexedSeqOps
override def knownSize: Int
Definition Classes
ArrayBuffer -> IndexedSeqOps -> Buffer -> Growable -> IterableOnce
Inherited from
ArrayBuffer
override def last: Node
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from
IndexedSeqOps
def lastIndexOf[B >: Node](elem: B, end: Int): Int
Inherited from
SeqOps
@deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
def lastIndexOfSlice[B >: Node](that: Seq[B]): Int
Inherited from
SeqOps
def lastIndexOfSlice[B >: Node](that: Seq[B], end: Int): Int
Inherited from
SeqOps
@deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
def lastIndexWhere(p: Node => Boolean): Int
Inherited from
SeqOps
def lastIndexWhere(p: Node => Boolean, end: Int): Int
Inherited from
SeqOps
def lastOption: Option[Node]
Inherited from
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[Node, B, NodeBuffer]
Inherited from
Iterable
def length: Int
Inherited from
ArrayBuffer
final override def lengthCompare(that: Iterable[_]): Int
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from
IndexedSeqOps
final override def lengthCompare(len: Int): Int
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from
IndexedSeqOps
@inline
final def lengthIs: SizeCompareOps
Inherited from
SeqOps
def lift: Int => Option[Node]
Inherited from
PartialFunction
override def map[B](f: Node => B): ArrayBuffer[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def mapInPlace(f: Node => Node): NodeBuffer
Inherited from
IndexedSeqOps
def max[B >: Node](ord: Ordering[B]): Node
Inherited from
IterableOnceOps
def maxBy[B](f: Node => B)(cmp: Ordering[B]): Node
Inherited from
IterableOnceOps
def maxByOption[B](f: Node => B)(cmp: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def maxOption[B >: Node](ord: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def min[B >: Node](ord: Ordering[B]): Node
Inherited from
IterableOnceOps
def minBy[B](f: Node => B)(cmp: Ordering[B]): Node
Inherited from
IterableOnceOps
def minByOption[B](f: Node => B)(cmp: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def minOption[B >: Node](ord: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
@inline
final def mkString: String
Inherited from
IterableOnceOps
@inline
final def mkString(sep: String): String
Inherited from
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from
IterableOnceOps
protected def newSpecificBuilder: Builder[Node, ArrayBuffer[Node]]
Inherited from
IterableFactoryDefaults
@deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
def nonEmpty: Boolean
Inherited from
IterableOnceOps
def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from
PartialFunction
override def padTo[B >: Node](len: Int, elem: B): ArrayBuffer[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def padToInPlace(len: Int, elem: Node): NodeBuffer
Inherited from
Buffer
override def partition(p: Node => Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def partitionMap[A1, A2](f: Node => Either[A1, A2]): (ArrayBuffer[A1], ArrayBuffer[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def patch[B >: Node](from: Int, other: IterableOnce[B], replaced: Int): ArrayBuffer[B]
Inherited from
SeqOps
def patchInPlace(from: Int, patch: IterableOnce[Node], replaced: Int): NodeBuffer
Inherited from
IndexedBuffer
def permutations: Iterator[ArrayBuffer[Node]]
Inherited from
SeqOps
def prepend(elem: Node): NodeBuffer
Inherited from
ArrayBuffer
def prependAll(elems: IterableOnce[Node]): NodeBuffer
Inherited from
Buffer
override def prepended[B >: Node](elem: B): ArrayBuffer[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
override def prependedAll[B >: Node](prefix: IterableOnce[B]): ArrayBuffer[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def product[B >: Node](num: Numeric[B]): B
Inherited from
IterableOnceOps
def reduce[B >: Node](op: (B, B) => B): B
Inherited from
IterableOnceOps
def reduceLeft[B >: Node](op: (B, Node) => B): B
Inherited from
IterableOnceOps
def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]
Inherited from
IterableOnceOps
def reduceOption[B >: Node](op: (B, B) => B): Option[B]
Inherited from
IterableOnceOps
def reduceRight[B >: Node](op: (Node, B) => B): B
Inherited from
IterableOnceOps
def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]
Inherited from
IterableOnceOps
def remove(@deprecatedName("n", "2.13.0") index: Int, count: Int): Unit
Inherited from
ArrayBuffer
def remove(@deprecatedName("n", "2.13.0") index: Int): Node
Inherited from
ArrayBuffer
override def reverse: ArrayBuffer[Node]
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from
IndexedSeqOps
override def reverseIterator: Iterator[Node]
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from
IndexedSeqOps
override protected def reversed: Iterable[Node]
Definition Classes
IndexedSeqOps -> IterableOnceOps
Inherited from
IndexedSeqOps
def runWith[U](action: Node => U): Int => Boolean
Inherited from
PartialFunction
def sameElements[B >: Node](that: IterableOnce[B]): Boolean
Inherited from
SeqOps
def scan[B >: Node](z: B)(op: (B, B) => B): ArrayBuffer[B]
Inherited from
IterableOps
override def scanLeft[B](z: B)(op: (B, Node) => B): ArrayBuffer[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def scanRight[B](z: B)(op: (Node, B) => B): ArrayBuffer[B]
Inherited from
IterableOps
override def search[B >: Node](elem: B, from: Int, to: Int)(ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from
IndexedSeqOps
override def search[B >: Node](elem: B)(ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps -> SeqOps
Inherited from
IndexedSeqOps
def segmentLength(p: Node => Boolean, from: Int): Int
Inherited from
SeqOps
final def segmentLength(p: Node => Boolean): Int
Inherited from
SeqOps
final override def size: Int
Definition Classes
SeqOps -> IterableOnceOps
Inherited from
SeqOps
final override def sizeCompare(that: Iterable[_]): Int
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
final override def sizeCompare(otherSize: Int): Int
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
def sizeHint(size: Int): Unit
Inherited from
ArrayBuffer
@inline
final def sizeIs: SizeCompareOps
Inherited from
IterableOps
override def slice(from: Int, until: Int): ArrayBuffer[Node]
Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from
IndexedSeqOps
def sliceInPlace(start: Int, end: Int): NodeBuffer
Inherited from
Buffer
def sliding(size: Int, step: Int): Iterator[ArrayBuffer[Node]]
Inherited from
IterableOps
def sliding(size: Int): Iterator[ArrayBuffer[Node]]
Inherited from
IterableOps
def sortBy[B](f: Node => B)(ord: Ordering[B]): ArrayBuffer[Node]
Inherited from
SeqOps
override def sortInPlace[B >: Node](ord: Ordering[B]): NodeBuffer
Definition Classes
ArrayBuffer -> IndexedSeqOps
Inherited from
ArrayBuffer
def sortInPlaceBy[B](f: Node => B)(ord: Ordering[B]): NodeBuffer
Inherited from
IndexedSeqOps
def sortInPlaceWith(lt: (Node, Node) => Boolean): NodeBuffer
Inherited from
IndexedSeqOps
def sortWith(lt: (Node, Node) => Boolean): ArrayBuffer[Node]
Inherited from
SeqOps
def sorted[B >: Node](ord: Ordering[B]): ArrayBuffer[Node]
Inherited from
SeqOps
override def span(p: Node => Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def startsWith[B >: Node](that: IterableOnce[B], offset: Int): Boolean
Inherited from
SeqOps
override def stepper[S <: Stepper[_]](shape: StepperShape[Node, S]): S & EfficientSplit
Definition Classes
ArrayBuffer -> IndexedSeqOps -> IterableOnce
Inherited from
ArrayBuffer
def subtractAll(xs: IterableOnce[Node]): NodeBuffer
Inherited from
Shrinkable
def subtractOne(x: Node): NodeBuffer
Inherited from
Buffer
def sum[B >: Node](num: Numeric[B]): B
Inherited from
IterableOnceOps
def tail: ArrayBuffer[Node]
Inherited from
IterableOps
def tails: Iterator[ArrayBuffer[Node]]
Inherited from
IterableOps
override def take(n: Int): ArrayBuffer[Node]
Definition Classes
IndexedSeqOps -> IterableOps -> IterableOnceOps
Inherited from
IndexedSeqOps
def takeInPlace(n: Int): NodeBuffer
Inherited from
Buffer
override def takeRight(n: Int): ArrayBuffer[Node]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def takeRightInPlace(n: Int): NodeBuffer
Inherited from
Buffer
def takeWhile(p: Node => Boolean): ArrayBuffer[Node]
Inherited from
IterableOps
def takeWhileInPlace(p: Node => Boolean): NodeBuffer
Inherited from
Buffer
override def tapEach[U](f: Node => U): ArrayBuffer[Node]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def to[C1](factory: Factory[Node, C1]): C1
Inherited from
IterableOnceOps
def toArray[B >: Node](ClassTag[B]): Array[B]
Inherited from
IterableOnceOps
@inline
final def toBuffer[B >: Node]: Buffer[B]
Inherited from
IterableOnceOps
def toIndexedSeq: IndexedSeq[Node]
Inherited from
IterableOnceOps
final def toIterable: NodeBuffer
Inherited from
Iterable
def toList: List[Node]
Inherited from
IterableOnceOps
def toMap[K, V](ev: Node <:< (K, V)): Map[K, V]
Inherited from
IterableOnceOps
def toSeq: Seq[Node]
Inherited from
IterableOnceOps
def toSet[B >: Node]: Set[B]
Inherited from
IterableOnceOps
override def toString(): String
Definition Classes
Seq -> Function1 -> Iterable -> Any
Inherited from
Seq
def toVector: Vector[Node]
Inherited from
IterableOnceOps
def transpose[B](asIterable: Node => Iterable[B]): ArrayBuffer[ArrayBuffer[B]]
Inherited from
IterableOps
def trimToSize(): Unit
Inherited from
ArrayBuffer
def unapply(a: Int): Option[Node]
Inherited from
PartialFunction
override def unzip[A1, A2](asPair: Node => (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def unzip3[A1, A2, A3](asTriple: Node => (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def update(@deprecatedName("n", "2.13.0") index: Int, elem: Node): Unit
Inherited from
ArrayBuffer
def updated[B >: Node](index: Int, elem: B): ArrayBuffer[B]
Inherited from
SeqOps
override def view: ArrayBufferView[Node]
Definition Classes
ArrayBuffer -> IndexedSeqOps -> SeqOps -> IterableOps
Inherited from
ArrayBuffer
def withFilter(p: Node => Boolean): WithFilter[Node, [A] =>> ArrayBuffer[A]]
Inherited from
IterableOps
override def zip[B](that: IterableOnce[B]): ArrayBuffer[(Node, B)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def zipAll[A1 >: Node, B](that: Iterable[B], thisElem: A1, thatElem: B): ArrayBuffer[(A1, B)]
Inherited from
IterableOps
override def zipWithIndex: ArrayBuffer[(Node, Int)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps

Deprecated and Inherited methods

@inline @deprecated("Use `++=` aka `addAll` instead of varargs `+=`; infix operations with an operand of multiple args will be deprecated", "2.13.0")
final def +=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer
Deprecated
Inherited from
Growable
@deprecated("Use `--=` aka `subtractAll` instead of varargs `-=`; infix operations with an operand of multiple args will be deprecated", "2.13.3")
def -=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer
Deprecated
Inherited from
Shrinkable
@inline @deprecated("Use foldLeft instead of /:", "2.13.0")
final def /:[B](z: B)(op: (B, Node) => B): B
Deprecated
Inherited from
IterableOnceOps
@inline @deprecated("Use foldRight instead of :\\", "2.13.0")
final def :\[B](z: B)(op: (Node, B) => B): B
Deprecated
Inherited from
IterableOnceOps
@deprecated("`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", "2.13.0")
def aggregate[B](z: => B)(seqop: (B, Node) => B, combop: (B, B) => B): B
Deprecated
Inherited from
IterableOnceOps
@inline @deprecated("Use appendAll instead", "2.13.0")
final def append(elems: Node*): NodeBuffer
Deprecated
Inherited from
Buffer
@inline @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @deprecated("Use iterableFactory instead", "2.13.0")
def companion: IterableFactory[[A] =>> ArrayBuffer[A]]
Deprecated
Inherited from
IterableOps
@inline @deprecated("Use `dest ++= coll` instead", "2.13.0")
final def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
Deprecated
Inherited from
IterableOnceOps
@deprecated("Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
Inherited from
IterableOnceOps
@inline @deprecatedOverriding("ArrayBuffer[A] no longer extends Builder[A, ArrayBuffer[A]]", "2.13.0") @deprecated("Use \'new GrowableBuilder(this).mapResult(f)\' instead", "2.13.0")
def mapResult[NewTo](f: ArrayBuffer[Node] => NewTo): Builder[Node, NewTo]
Deprecated
Inherited from
ArrayBuffer
@inline @deprecated("Use segmentLength instead of prefixLength", "2.13.0")
final def prefixLength(p: Node => Boolean): Int
Deprecated
Inherited from
SeqOps
@inline @deprecated("Use prependAll instead", "2.13.0")
final def prepend(elems: Node*): NodeBuffer
Deprecated
Inherited from
Buffer
@deprecated("Use coll instead of repr in a collection implementation, use the collection value itself from the outside", "2.13.0")
final def repr: ArrayBuffer[Node]
Deprecated
Inherited from
IterableOps
@inline @deprecatedOverriding("ArrayBuffer[A] no longer extends Builder[A, ArrayBuffer[A]]", "2.13.0") @deprecated("Use \'this\' instance instead", "2.13.0")
def result(): NodeBuffer
Deprecated
Inherited from
ArrayBuffer
@deprecated("Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)", "2.13.0")
def reverseMap[B](f: Node => B): ArrayBuffer[B]
Deprecated
Inherited from
SeqOps
@deprecated("Iterable.seq always returns the iterable itself", "2.13.0")
def seq: NodeBuffer
Deprecated
Inherited from
Iterable
@inline @deprecated("Use .iterator instead of .toIterator", "2.13.0")
final def toIterator: Iterator[Node]
Deprecated
Inherited from
IterableOnceOps
@inline @deprecated("Use .to(LazyList) instead of .toStream", "2.13.0")
final def toStream: Stream[Node]
Deprecated
Inherited from
IterableOnceOps
@deprecated("Use toIterable instead", "2.13.0")
final def toTraversable: Iterable[Node]
Deprecated
Inherited from
IterableOps
@inline @deprecated("Use `mapInPlace` on an `IndexedSeq` instead", "2.13.0")
final def transform(f: Node => Node): NodeBuffer
Deprecated
Inherited from
SeqOps
@deprecated("use dropRightInPlace instead", "2.13.4")
def trimEnd(n: Int): Unit
Deprecated
Inherited from
Buffer
@deprecated("use dropInPlace instead", "2.13.4")
def trimStart(n: Int): Unit
Deprecated
Inherited from
Buffer
@inline @deprecated("Use `concat` instead", "2.13.0")
final def union[B >: Node](that: Seq[B]): ArrayBuffer[B]
Deprecated
Inherited from
SeqOps
@deprecated("Use .view.slice(from, until) instead of .view(from, until)", "2.13.0")
override def view(from: Int, until: Int): IndexedSeqView[Node]
Deprecated
Definition Classes
IndexedSeqOps -> IterableOps
Inherited from
IndexedSeqOps