class
BiMap[K, V] extends Iterable[(K, V)]
Instance Constructors
-
new
BiMap()
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
-
def
++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[(K, V)], B, That]): That
-
def
++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(K, V)], B, That]): That
-
def
->[B](y: B): (BiMap[K, V], B)
-
def
/:[B](z: B)(op: (B, (K, V)) ⇒ B): B
-
def
:\[B](z: B)(op: ((K, V), B) ⇒ B): B
-
final
def
==(arg0: Any): Boolean
-
def
add(key: K, value: V): Unit
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
def
collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[Iterable[(K, V)], B, That]): That
-
-
-
def
containsKey(key: K): Boolean
-
def
containsValue(value: V): Boolean
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: (K, V)](xs: Array[B]): Unit
-
def
copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
-
def
count(p: ((K, V)) ⇒ Boolean): Int
-
def
drop(n: Int): Iterable[(K, V)]
-
def
dropRight(n: Int): Iterable[(K, V)]
-
def
dropWhile(p: ((K, V)) ⇒ Boolean): Iterable[(K, V)]
-
def
ensuring(cond: (BiMap[K, V]) ⇒ Boolean, msg: ⇒ Any): BiMap[K, V]
-
def
ensuring(cond: (BiMap[K, V]) ⇒ Boolean): BiMap[K, V]
-
def
ensuring(cond: Boolean, msg: ⇒ Any): BiMap[K, V]
-
def
ensuring(cond: Boolean): BiMap[K, V]
-
-
-
-
def
filter(p: ((K, V)) ⇒ Boolean): Iterable[(K, V)]
-
def
filterNot(p: ((K, V)) ⇒ Boolean): Iterable[(K, V)]
-
def
finalize(): Unit
-
def
find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]
-
def
flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(K, V)], B, That]): That
-
def
flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]
-
def
fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B
-
def
foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B
-
-
def
foreach[U](f: ((K, V)) ⇒ U): Unit
-
def
formatted(fmtstr: String): String
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: ((K, V)) ⇒ K): Map[K, Iterable[(K, V)]]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: (K, V)
-
def
headOption: Option[(K, V)]
-
def
init: Iterable[(K, V)]
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[(K, V)]
-
def
keyFor(value: V): Option[K]
-
def
keys: Iterable[K]
-
def
last: (K, V)
-
def
lastOption: Option[(K, V)]
-
def
map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(K, V)], B, That]): That
-
def
max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
-
def
maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
-
def
min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)
-
def
minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
def
newBuilder: Builder[(K, V), Iterable[(K, V)]]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
par: ParIterable[(K, V)]
-
def
parCombiner: Combiner[(K, V), ParIterable[(K, V)]]
-
def
partition(p: ((K, V)) ⇒ Boolean): (Iterable[(K, V)], Iterable[(K, V)])
-
def
product[B >: (K, V)](implicit num: Numeric[B]): B
-
def
reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B
-
def
reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]
-
def
reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B
-
def
reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]
-
def
removeKey(key: K): Boolean
-
def
removeValue(value: V): Boolean
-
def
repr: Iterable[(K, V)]
-
def
reversed: List[(K, V)]
-
def
sameElements[B >: (K, V)](that: GenIterable[B]): Boolean
-
def
scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[(K, V)], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(K, V)], B, That]): That
-
def
scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(K, V)], B, That]): That
-
def
seq: Iterable[(K, V)]
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterable[(K, V)]
-
-
-
-
-
def
stringPrefix: String
-
def
sum[B >: (K, V)](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
tail: Iterable[(K, V)]
-
-
def
take(n: Int): Iterable[(K, V)]
-
def
takeRight(n: Int): Iterable[(K, V)]
-
def
takeWhile(p: ((K, V)) ⇒ Boolean): Iterable[(K, V)]
-
def
thisCollection: Iterable[(K, V)]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]
-
def
toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: (K, V)]: Buffer[B]
-
def
toCollection(repr: Iterable[(K, V)]): Iterable[(K, V)]
-
def
toIndexedSeq: IndexedSeq[(K, V)]
-
def
toIterable: Iterable[(K, V)]
-
def
toIterator: Iterator[(K, V)]
-
def
toList: List[(K, V)]
-
def
toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]
-
def
toParArray: ParArray[T]
-
def
toSeq: Seq[(K, V)]
-
def
toSet[B >: (K, V)]: Set[B]
-
def
toStream: Stream[(K, V)]
-
def
toString(): String
-
def
toTraversable: Traversable[(K, V)]
-
def
toVector: Vector[(K, V)]
-
-
def
unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
def
valueFor(key: K): Option[V]
-
def
values: Iterable[V]
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[(K, V)], (A1, B), That]): That
-
def
zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[(K, V)], (A1, B), That]): That
-
def
zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[Iterable[(K, V)], (A1, Int), That]): That
-
def
→[B](y: B): (BiMap[K, V], B)
Inherited from HasNewBuilder[(K, V), Iterable[(K, V)] @scala.annotation.unchecked.uncheckedVariance]
Inherited by implicit conversion CollectionsHaveToParArray from
BiMap[K, V] to CollectionsHaveToParArray[BiMap[K, V], T]
Inherited by implicit conversion MonadOps from
BiMap[K, V] to MonadOps[(K, V)]
Inherited by implicit conversion any2stringadd from
BiMap[K, V] to any2stringadd[BiMap[K, V]]
Inherited by implicit conversion StringFormat from
BiMap[K, V] to StringFormat[BiMap[K, V]]
Inherited by implicit conversion Ensuring from
BiMap[K, V] to Ensuring[BiMap[K, V]]
Inherited by implicit conversion ArrowAssoc from
BiMap[K, V] to ArrowAssoc[BiMap[K, V]]
Inherited by implicit conversion alternateImplicit from
BiMap[K, V] to ForceImplicitAmbiguity
An iterable bi-Directional map. There is a 1:1 mapping between keys and values.
the key type.
the value type.