Class

scala.xml

NodeBuffer

Related Doc: package xml

Permalink

class NodeBuffer extends ArrayBuffer[Node]

Internal structure used by scalac to create literals

Linear Supertypes
ArrayBuffer[Node], Serializable, java.io.Serializable, CustomParallelizable[Node, ParArray[Node]], ResizableArray[Node], collection.mutable.IndexedSeq[Node], collection.IndexedSeq[Node], Builder[Node, ArrayBuffer[Node]], IndexedSeqOptimized[Node, ArrayBuffer[Node]], IndexedSeqOptimized[Node, ArrayBuffer[Node]], IndexedSeqLike[Node, ArrayBuffer[Node]], IndexedSeqLike[Node, ArrayBuffer[Node]], AbstractBuffer[Node], Buffer[Node], BufferLike[Node, ArrayBuffer[Node]], Subtractable[Node, ArrayBuffer[Node]], Scriptable[Node], Shrinkable[Node], Growable[Node], Clearable, AbstractSeq[Node], collection.mutable.Seq[Node], SeqLike[Node, ArrayBuffer[Node]], collection.mutable.Cloneable[ArrayBuffer[Node]], Cloneable, java.lang.Cloneable, collection.mutable.Iterable[Node], collection.mutable.Traversable[Node], Mutable, AbstractSeq[Node], collection.Seq[Node], SeqLike[Node, ArrayBuffer[Node]], GenSeq[Node], GenSeqLike[Node, ArrayBuffer[Node]], PartialFunction[Int, Node], (Int) ⇒ Node, AbstractIterable[Node], collection.Iterable[Node], IterableLike[Node, ArrayBuffer[Node]], Equals, GenIterable[Node], GenIterableLike[Node, ArrayBuffer[Node]], AbstractTraversable[Node], collection.Traversable[Node], GenTraversable[Node], GenericTraversableTemplate[Node, ArrayBuffer], TraversableLike[Node, ArrayBuffer[Node]], GenTraversableLike[Node, ArrayBuffer[Node]], Parallelizable[Node, ParArray[Node]], collection.TraversableOnce[Node], GenTraversableOnce[Node], FilterMonadic[Node, ArrayBuffer[Node]], HasNewBuilder[Node, scala.collection.mutable.ArrayBuffer[scala.xml.Node] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeBuffer
  2. ArrayBuffer
  3. Serializable
  4. Serializable
  5. CustomParallelizable
  6. ResizableArray
  7. IndexedSeq
  8. IndexedSeq
  9. Builder
  10. IndexedSeqOptimized
  11. IndexedSeqOptimized
  12. IndexedSeqLike
  13. IndexedSeqLike
  14. AbstractBuffer
  15. Buffer
  16. BufferLike
  17. Subtractable
  18. Scriptable
  19. Shrinkable
  20. Growable
  21. Clearable
  22. AbstractSeq
  23. Seq
  24. SeqLike
  25. Cloneable
  26. Cloneable
  27. Cloneable
  28. Iterable
  29. Traversable
  30. Mutable
  31. AbstractSeq
  32. Seq
  33. SeqLike
  34. GenSeq
  35. GenSeqLike
  36. PartialFunction
  37. Function1
  38. AbstractIterable
  39. Iterable
  40. IterableLike
  41. Equals
  42. GenIterable
  43. GenIterableLike
  44. AbstractTraversable
  45. Traversable
  46. GenTraversable
  47. GenericTraversableTemplate
  48. TraversableLike
  49. GenTraversableLike
  50. Parallelizable
  51. TraversableOnce
  52. GenTraversableOnce
  53. FilterMonadic
  54. HasNewBuilder
  55. AnyRef
  56. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeBuffer()

    Permalink

Type Members

  1. class Elements extends AbstractIterator[A] with collection.BufferedIterator[A] with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()

  2. type Self = ArrayBuffer[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  3. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def &+[A](e: A)(implicit arg0: XmlElementEmbeddable[A]): NodeBuffer

    Permalink

  4. def &+(e: Node): NodeBuffer

    Permalink

  5. def ++(xs: GenTraversableOnce[Node]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    BufferLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new buffer. Use ++= to add an element from this buffer and return that buffer itself.

  6. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  7. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  8. def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  9. def ++=(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type

    Permalink
    Definition Classes
    ArrayBuffer → Growable

  10. def ++=:(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike

  11. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  12. def +=(elem: Node): NodeBuffer.this.type

    Permalink
    Definition Classes
    ArrayBuffer → Builder → BufferLike → Growable

  13. def +=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type

    Permalink
    Definition Classes
    Growable

  14. def +=:(elem: Node): NodeBuffer.this.type

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike

  15. def -(elem1: Node, elem2: Node, elems: Node*): ArrayBuffer[Node]

    Permalink
    Definition Classes
    BufferLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new buffer. Use -= to remove an element from this buffer and return that buffer itself.

  16. def -(elem: Node): ArrayBuffer[Node]

    Permalink
    Definition Classes
    BufferLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new buffer. Use -= to remove an element from this buffer and return that buffer itself.

  17. def --(xs: GenTraversableOnce[Node]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    BufferLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new buffer. Use --= to remove an element from this buffer and return that buffer itself.

  18. def --=(xs: collection.TraversableOnce[Node]): NodeBuffer.this.type

    Permalink
    Definition Classes
    Shrinkable

  19. def -=(x: Node): NodeBuffer.this.type

    Permalink
    Definition Classes
    BufferLike → Shrinkable

  20. def -=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type

    Permalink
    Definition Classes
    Shrinkable

  21. def /:[B](z: B)(op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  22. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  23. def :\[B](z: B)(op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  24. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  25. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  26. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  27. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  28. def aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  29. def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]

    Permalink
    Definition Classes
    PartialFunction → Function1

  30. def append(elems: Node*): Unit

    Permalink
    Definition Classes
    BufferLike

  31. def appendAll(xs: collection.TraversableOnce[Node]): Unit

    Permalink
    Definition Classes
    BufferLike

  32. def apply(idx: Int): Node

    Permalink
    Definition Classes
    ResizableArray → SeqLike → GenSeqLike → Function1

  33. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1

    Permalink
    Definition Classes
    PartialFunction

  34. var array: Array[AnyRef]

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray

  35. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  36. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals

  37. def clear(): Unit

    Permalink
    Definition Classes
    ArrayBuffer → Builder → BufferLike → Growable → Clearable

  38. def clone(): ArrayBuffer[Node]

    Permalink
    Definition Classes
    BufferLike → Cloneable → AnyRef

  39. def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  40. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce

  41. def combinations(n: Int): collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    SeqLike

  42. def companion: GenericCompanion[ArrayBuffer]

    Permalink
    Definition Classes
    ArrayBuffer → ResizableArray → IndexedSeq → IndexedSeq → Buffer → Seq → Iterable → Traversable → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

  43. def compose[A](g: (A) ⇒ Int): (A) ⇒ Node

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()

  44. def contains[A1 >: Node](elem: A1): Boolean

    Permalink
    Definition Classes
    SeqLike

  45. def containsSlice[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike

  46. def copy(m: Int, n: Int, len: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray

  47. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    ResizableArray → IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  48. def copyToArray[B >: Node](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  49. def copyToArray[B >: Node](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  50. def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce

  51. def corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  52. def count(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  53. def diff[B >: Node](that: GenSeq[B]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  54. def distinct: ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  55. def drop(n: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

  56. def dropRight(n: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike

  57. def dropWhile(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike

  58. def endsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike

  59. def ensureSize(n: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray

  60. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  61. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    GenSeqLike → Equals → Any

  62. def exists(p: (Node) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  63. def filter(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  64. def filterNot(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  65. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  66. def find(p: (Node) ⇒ Boolean): Option[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  67. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  68. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): ArrayBuffer[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  69. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  70. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableOnce → GenTraversableOnce

  71. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce

  72. def forall(p: (Node) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  73. def foreach[U](f: (Node) ⇒ U): Unit

    Permalink
    Definition Classes
    ResizableArray → IndexedSeqOptimized → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  74. def genericBuilder[B]: Builder[B, ArrayBuffer[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  75. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  76. def groupBy[K](f: (Node) ⇒ K): Map[K, ArrayBuffer[Node]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  77. def grouped(size: Int): collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IterableLike

  78. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  79. def hashCode(): Int

    Permalink
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any

  80. def head: Node

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

  81. def headOption: Option[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  82. def indexOf[B >: Node](elem: B, from: Int): Int

    Permalink
    Definition Classes
    GenSeqLike

  83. def indexOf[B >: Node](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike

  84. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int

    Permalink
    Definition Classes
    SeqLike

  85. def indexOfSlice[B >: Node](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike

  86. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike

  87. def indexWhere(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike

  88. def indices: collection.immutable.Range

    Permalink
    Definition Classes
    SeqLike

  89. def init: ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike

  90. val initialSize: Int

    Permalink
    Attributes
    protected
    Definition Classes
    ArrayBuffer → ResizableArray

  91. def inits: collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    TraversableLike

  92. def insert(n: Int, elems: Node*): Unit

    Permalink
    Definition Classes
    BufferLike

  93. def insertAll(n: Int, seq: collection.Traversable[Node]): Unit

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike

  94. def intersect[B >: Node](that: GenSeq[B]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  95. def isDefinedAt(idx: Int): Boolean

    Permalink
    Definition Classes
    GenSeqLike

  96. def isEmpty: Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  97. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  98. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  99. def iterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike

  100. def last: Node

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike

  101. def lastIndexOf[B >: Node](elem: B, end: Int): Int

    Permalink
    Definition Classes
    GenSeqLike

  102. def lastIndexOf[B >: Node](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike

  103. def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int

    Permalink
    Definition Classes
    SeqLike

  104. def lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike

  105. def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike

  106. def lastIndexWhere(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike

  107. def lastOption: Option[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  108. def length: Int

    Permalink
    Definition Classes
    ResizableArray → SeqLike → GenSeqLike

  109. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike

  110. def lift: (Int) ⇒ Option[Node]

    Permalink
    Definition Classes
    PartialFunction

  111. def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  112. def mapResult[NewTo](f: (ArrayBuffer[Node]) ⇒ NewTo): Builder[Node, NewTo]

    Permalink
    Definition Classes
    Builder

  113. def max[B >: Node](implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  114. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def min[B >: Node](implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  116. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  117. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  119. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  120. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  121. def newBuilder: Builder[Node, ArrayBuffer[Node]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  122. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  124. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  125. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Permalink
    Definition Classes
    PartialFunction

  126. def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  127. def par: ParArray[Node]

    Permalink
    Definition Classes
    ArrayBuffer → CustomParallelizable → Parallelizable

  128. def parCombiner: Combiner[Node, ParArray[Node]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    CustomParallelizable → Parallelizable

  129. def partition(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  130. def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  131. def permutations: collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    SeqLike

  132. def prefixLength(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike

  133. def prepend(elems: Node*): Unit

    Permalink
    Definition Classes
    BufferLike

  134. def prependAll(xs: collection.TraversableOnce[Node]): Unit

    Permalink
    Definition Classes
    BufferLike

  135. def product[B >: Node](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  136. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  137. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableOnce

  138. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  139. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  140. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce

  141. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  142. def reduceToSize(sz: Int): Unit

    Permalink
    Definition Classes
    ResizableArray

  143. def remove(n: Int): Node

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike

  144. def remove(n: Int, count: Int): Unit

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike

  145. def repr: ArrayBuffer[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  146. def result(): ArrayBuffer[Node]

    Permalink
    Definition Classes
    ArrayBuffer → Builder

  147. def reverse: ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike

  148. def reverseIterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike

  149. def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  150. def reversed: List[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  151. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean

    Permalink
    Definition Classes
    PartialFunction

  152. def sameElements[B >: Node](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike

  153. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  154. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  155. def scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  156. def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike

  157. def seq: collection.mutable.IndexedSeq[Node]

    Permalink
    Definition Classes
    IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  158. def size: Int

    Permalink
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

  159. var size0: Int

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray

  160. def sizeHint(len: Int): Unit

    Permalink
    Definition Classes
    ArrayBuffer → Builder

  161. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

    Permalink
    Definition Classes
    Builder

  162. def sizeHint(coll: TraversableLike[_, _]): Unit

    Permalink
    Definition Classes
    Builder

  163. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

    Permalink
    Definition Classes
    Builder

  164. def slice(from: Int, until: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

  165. def sliding(size: Int, step: Int): collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IterableLike

  166. def sliding(size: Int): collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IterableLike

  167. def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike

  168. def sortWith(lt: (Node, Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike

  169. def sorted[B >: Node](implicit ord: math.Ordering[B]): ArrayBuffer[Node]

    Permalink
    Definition Classes
    SeqLike

  170. def span(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike

  171. def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike

  172. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

    Permalink
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike

  173. def startsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    GenSeqLike

  174. def stringPrefix: String

    Permalink
    Definition Classes
    ArrayBuffer → BufferLike → TraversableLike → GenTraversableLike

  175. def sum[B >: Node](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  176. def swap(a: Int, b: Int): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    ResizableArray

  177. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  178. def tail: ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike

  179. def tails: collection.Iterator[ArrayBuffer[Node]]

    Permalink
    Definition Classes
    TraversableLike

  180. def take(n: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

  181. def takeRight(n: Int): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike

  182. def takeWhile(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike

  183. def thisCollection: collection.mutable.IndexedSeq[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike

  184. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  185. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  186. def toBuffer[A1 >: Node]: Buffer[A1]

    Permalink
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce

  187. def toCollection(repr: ArrayBuffer[Node]): collection.mutable.IndexedSeq[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike

  188. def toIndexedSeq: collection.immutable.IndexedSeq[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  189. def toIterable: collection.Iterable[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  190. def toIterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  191. def toList: List[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  192. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  193. def toSeq: collection.Seq[Node]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

  194. def toSet[B >: Node]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  195. def toStream: collection.immutable.Stream[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  196. def toString(): String

    Permalink
    Definition Classes
    SeqLike → TraversableLike → Any

  197. def toTraversable: collection.Traversable[Node]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  198. def toVector: Vector[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  199. def transform(f: (Node) ⇒ Node): NodeBuffer.this.type

    Permalink
    Definition Classes
    SeqLike

  200. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): ArrayBuffer[ArrayBuffer[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  201. def trimEnd(n: Int): Unit

    Permalink
    Definition Classes
    BufferLike

  202. def trimStart(n: Int): Unit

    Permalink
    Definition Classes
    BufferLike

  203. def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  204. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  205. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  206. def update(idx: Int, elem: Node): Unit

    Permalink
    Definition Classes
    ResizableArray → IndexedSeqLike → SeqLike

  207. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike

  208. def view(from: Int, until: Int): IndexedSeqView[Node, ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike

  209. def view: IndexedSeqView[Node, ArrayBuffer[Node]]

    Permalink
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike

  210. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  211. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  212. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  213. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, ArrayBuffer[Node]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

  214. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike

  215. def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

  216. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, Int), That]): That

    Permalink
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike

Deprecated Value Members

  1. def <<(cmd: Message[Node]): Unit

    Permalink
    Definition Classes
    BufferLike → Scriptable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) Scripting is deprecated.

  2. def readOnly: collection.Seq[Node]

    Permalink
    Definition Classes
    BufferLike
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) The returned sequence changes as this buffer is mutated. For an immutable copy, use, e.g., toList.

Inherited from ArrayBuffer[Node]

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from CustomParallelizable[Node, ParArray[Node]]

Inherited from ResizableArray[Node]

Inherited from collection.mutable.IndexedSeq[Node]

Inherited from collection.IndexedSeq[Node]

Inherited from Builder[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqOptimized[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqOptimized[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqLike[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqLike[Node, ArrayBuffer[Node]]

Inherited from AbstractBuffer[Node]

Inherited from Buffer[Node]

Inherited from BufferLike[Node, ArrayBuffer[Node]]

Inherited from Subtractable[Node, ArrayBuffer[Node]]

Inherited from Scriptable[Node]

Inherited from Shrinkable[Node]

Inherited from Growable[Node]

Inherited from Clearable

Inherited from AbstractSeq[Node]

Inherited from collection.mutable.Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

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

Inherited from Cloneable

Inherited from java.lang.Cloneable

Inherited from collection.mutable.Iterable[Node]

Inherited from collection.mutable.Traversable[Node]

Inherited from Mutable

Inherited from AbstractSeq[Node]

Inherited from collection.Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

Inherited from GenSeq[Node]

Inherited from GenSeqLike[Node, ArrayBuffer[Node]]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) ⇒ Node

Inherited from AbstractIterable[Node]

Inherited from collection.Iterable[Node]

Inherited from IterableLike[Node, ArrayBuffer[Node]]

Inherited from Equals

Inherited from GenIterable[Node]

Inherited from GenIterableLike[Node, ArrayBuffer[Node]]

Inherited from AbstractTraversable[Node]

Inherited from collection.Traversable[Node]

Inherited from GenTraversable[Node]

Inherited from GenericTraversableTemplate[Node, ArrayBuffer]

Inherited from TraversableLike[Node, ArrayBuffer[Node]]

Inherited from GenTraversableLike[Node, ArrayBuffer[Node]]

Inherited from Parallelizable[Node, ParArray[Node]]

Inherited from collection.TraversableOnce[Node]

Inherited from GenTraversableOnce[Node]

Inherited from FilterMonadic[Node, ArrayBuffer[Node]]

Inherited from HasNewBuilder[Node, scala.collection.mutable.ArrayBuffer[scala.xml.Node] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped