Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+[B1 >: V](elem1: (Int, B1), elem2: (Int, B1), elems: (Int, B1)*): Map[Int, B1]
-
def
+[B1 >: V](kv: (Int, B1)): Map[Int, B1]
-
-
-
def
++:[B >: (Int, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[ArrayMap[V], B, That]): That
-
-
-
def
+=(k: (Int, V)): ArrayMap.this.type
-
def
+=(elem1: (Int, V), elem2: (Int, V), elems: (Int, V)*): ArrayMap.this.type
-
def
-(elem1: Int, elem2: Int, elems: Int*): ArrayMap[V]
-
-
-
-
def
-=(i: Int): ArrayMap.this.type
-
def
-=(elem1: Int, elem2: Int, elems: Int*): ArrayMap.this.type
-
def
/:[B](z: B)(op: (B, (Int, V)) ⇒ B): B
-
def
:\[B](z: B)(op: ((Int, V), B) ⇒ B): B
-
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, (Int, V)) ⇒ B, combop: (B, B) ⇒ B): B
-
-
def
apply(i: Int): V
-
def
applyOrElse[A1 <: Int, B1 >: V](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clear(): Unit
-
-
-
-
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ V
-
def
contains(key: Int): Boolean
-
def
copyToArray[B >: (Int, V)](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: (Int, V)](xs: Array[B]): Unit
-
def
copyToArray[B >: (Int, V)](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: (Int, V)](dest: Buffer[B]): Unit
-
-
def
default(i: Int): V
-
-
def
dropRight(n: Int): ArrayMap[V]
-
-
-
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: (Int, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, (Int, V)) ⇒ B): B
-
def
foldRight[B](z: B)(op: ((Int, V), B) ⇒ B): B
-
-
def
foreach[U](f: ((Int, V)) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
-
final
def
getClass(): Class[_]
-
def
getOrElse[B1 >: V](key: Int, default: ⇒ B1): B1
-
def
getOrElseUpdate(i: Int, v: ⇒ V): V
-
def
groupBy[K](f: ((Int, V)) ⇒ K): Map[K, ArrayMap[V]]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: (Int, V)
-
def
headOption: Option[(Int, V)]
-
-
-
def
innerArray(implicit w: ClassTag[V]): Array[V]
-
def
isDefinedAt(key: Int): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
def
keySet: Set[Int]
-
def
keys: Set[Int]
-
-
def
last: (Int, V)
-
def
lastOption: Option[(Int, V)]
-
-
def
map[B, That](f: ((Int, V)) ⇒ B)(implicit bf: CanBuildFrom[ArrayMap[V], B, That]): That
-
def
mapResult[NewTo](f: (ArrayMap[V]) ⇒ NewTo): Builder[(Int, V), NewTo]
-
def
mapValues[C](f: (V) ⇒ C): Map[Int, C]
-
def
max[B >: (Int, V)](implicit cmp: Ordering[B]): (Int, V)
-
def
maxBy[B](f: ((Int, V)) ⇒ B)(implicit cmp: Ordering[B]): (Int, V)
-
def
min[B >: (Int, V)](implicit cmp: Ordering[B]): (Int, V)
-
def
minBy[B](f: ((Int, V)) ⇒ B)(implicit cmp: Ordering[B]): (Int, V)
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
def
parCombiner: Combiner[(Int, V), ParMap[Int, V]]
-
-
def
product[B >: (Int, V)](implicit num: Numeric[B]): B
-
def
put(key: Int, value: V): Option[V]
-
def
reduce[A1 >: (Int, V)](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: (Int, V)](op: (B, (Int, V)) ⇒ B): B
-
def
reduceLeftOption[B >: (Int, V)](op: (B, (Int, V)) ⇒ B): Option[B]
-
def
reduceOption[A1 >: (Int, V)](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: (Int, V)](op: ((Int, V), B) ⇒ B): B
-
def
reduceRightOption[B >: (Int, V)](op: ((Int, V), B) ⇒ B): Option[B]
-
def
remove(key: Int): Option[V]
-
-
def
result(): ArrayMap[V]
-
-
def
reversed: List[(Int, V)]
-
def
runWith[U](action: (V) ⇒ U): (Int) ⇒ Boolean
-
-
def
scan[B >: (Int, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ArrayMap[V], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, (Int, V)) ⇒ B)(implicit bf: CanBuildFrom[ArrayMap[V], B, That]): That
-
def
scanRight[B, That](z: B)(op: ((Int, V), B) ⇒ B)(implicit bf: CanBuildFrom[ArrayMap[V], B, That]): That
-
def
seq: Map[Int, V]
-
def
size: Int
-
-
-
def
sizeHint(size: Int): Unit
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
-
def
slice(from: Int, until: Int): ArrayMap[V]
-
-
-
-
-
def
stringPrefix: String
-
def
sum[B >: (Int, V)](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
def
takeRight(n: Int): ArrayMap[V]
-
-
def
thisCollection: Iterable[(Int, V)]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (Int, V), Col[(Int, V)]]): Col[(Int, V)]
-
def
toArray[B >: (Int, V)](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[C >: (Int, V)]: Buffer[C]
-
-
-
def
toIterable: Iterable[(Int, V)]
-
def
toIterator: Iterator[(Int, V)]
-
def
toList: List[(Int, V)]
-
def
toMap[T, U](implicit ev: <:<[(Int, V), (T, U)]): Map[T, U]
-
def
toSeq: Seq[(Int, V)]
-
def
toSet[B >: (Int, V)]: Set[B]
-
def
toStream: Stream[(Int, V)]
-
def
toString(): String
-
-
def
toVector: Vector[(Int, V)]
-
def
transform(f: (Int, V) ⇒ V): ArrayMap.this.type
-
-
def
unzip[A1, A2](implicit asPair: ((Int, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: ((Int, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
def
update(i: Int, v: V): Unit
-
def
updated[B1 >: V](key: Int, value: B1): Map[Int, B1]
-
-
def
valuesIterator: Iterator[V]
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withDefault(d: (Int) ⇒ V): Map[Int, V]
-
def
withDefaultValue(d: V): Map[Int, V]
-
-
def
zip[A1 >: (Int, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ArrayMap[V], (A1, B), That]): That
-
def
zipAll[B, A1 >: (Int, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ArrayMap[V], (A1, B), That]): That
-
def
zipWithIndex[A1 >: (Int, V), That](implicit bf: CanBuildFrom[ArrayMap[V], (A1, Int), That]): That
Deprecated Value Members
-
def
/:\[A1 >: (Int, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from Serializable
Inherited from Cloneable
Wraps an ArrayBuffer with a Map. Note the odd behavior for -=
The key must be nonnegative
Chances are you want to change defValue, which is used to fill in blanks if you don't add things consecutively. Otherwise you get an Exception.