Instance Constructors
-
new
SortedIntArrayBuffer()
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
++=(is: Seq[Int]): Unit
-
def
++=(is: Array[Int]): Unit
-
def
+=(i: Int): Unit
-
def
-=(i: Int): Unit
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
-
def
_appendAll(elts: TraversableOnce[Int]): Unit
-
def
_appendAll(elts: Array[Int]): Unit
-
final
def
_apply(index: Int): Int
-
def
_array: Array[Int]
-
final
def
_asArray: Array[Int]
-
def
_asIntSeq: IntSeq
-
def
_asSeq: IndexedSeq[Int]
-
def
_capacityGrowthFactor: Double
-
def
_clear(): Unit
-
def
_considerShrinkingCapacity(): Unit
-
def
_containsSorted(x: Int): Boolean
-
def
_copyToArray(a: Array[Int]): Unit
-
final
def
_ensureCapacity(cap: Int): Unit
-
def
_fill(elt: Int): Unit
-
def
_foreach[U](f: (Int) ⇒ U): Unit
-
final
def
_increment(index: Int, incr: Int): Unit
-
def
_indexForInsertSorted(i: Int): Int
-
def
_indexForInsertSortedLinear(i: Int): Int
-
def
_indexOf(i: Int): Int
-
def
_indexOfSorted(i: Int): Int
-
def
_initialCapacity: Int
-
def
_insert(index: Int, elt: Int): Unit
-
def
_insertAll(index: Int, seq: Traversable[Int]): Unit
-
def
_insertAllSorted(seq: Traversable[Int]): Unit
-
def
_insertSorted(elt: Int): Unit
-
def
_insertSortedNoDuplicates(elt: Int): Unit
-
final
def
_length: Int
-
def
_mapToArray[A](a: Array[A], f: (Int) ⇒ A): Unit
-
def
_prepend(elt: Int): Unit
-
def
_prependAll(elts: TraversableOnce[Int]): Unit
-
def
_reduceToSize(newSize: Int): Unit
-
def
_remove(index: Int): Unit
-
def
_remove(index: Int, count: Int): Unit
-
def
_set(elts: Seq[Int]): Unit
-
def
_set(elts: Array[Int]): Unit
-
final
def
_setCapacity(cap: Int): Unit
-
def
_sizeHint(len: Int): Unit
-
def
_sum: Int
-
def
_takeAsIntSeq(len: Int): IntSeq
-
def
_toArray: Array[Int]
-
def
_toSeq: IndexedSeq[Int]
-
def
_trimCapacity(): Unit
-
final
def
_update(index: Int, value: Int): Unit
-
def
apply(index: Int): Int
-
def
asArray: Array[Int]
-
-
final
def
asInstanceOf[T0]: T0
-
-
def
clone(): AnyRef
-
def
contains(d: Int): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
foldLeft[B <: AnyRef](z: B)(f: (B, Int) ⇒ B): B
-
def
forElements(f: (Int, Int) ⇒ Unit): Unit
-
def
forall(f: (Int) ⇒ Boolean): Boolean
-
def
foreach(f: (Int) ⇒ Unit): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
indexOf(d: Int): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
length: Int
-
def
map[A](f: (Int) ⇒ A): Seq[A]
-
def
map(f: (Int) ⇒ Int): IntSeq
-
def
max: Int
-
def
min: Int
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
setCapacity(c: Int): Unit
-
final
def
size: Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toArray: Array[Int]
-
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
