com.twitter.concurrent

ConcurrentBijection

class ConcurrentBijection [A, B] extends Map[A, B]

linear super types: Map[A, B], MapLike[A, B, Map[A, B]], Cloneable[Map[A, B]], Shrinkable[A], Builder[(A, B), Map[A, B]], Growable[(A, B)], Map[A, B], MapLike[A, B, Map[A, B]], Subtractable[A, Map[A, B]], PartialFunction[A, B], (A) ⇒ B, Iterable[(A, B)], Iterable[(A, B)], IterableLike[(A, B), Map[A, B]], Equals, Traversable[(A, B)], Mutable, Traversable[(A, B)], GenericTraversableTemplate[(A, B), Iterable], TraversableLike[(A, B), Map[A, B]], TraversableOnce[(A, B)], FilterMonadic[(A, B), Map[A, B]], HasNewBuilder[(A, B), Map[A, B]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. ConcurrentBijection
  2. Map
  3. MapLike
  4. Cloneable
  5. Shrinkable
  6. Builder
  7. Growable
  8. Map
  9. MapLike
  10. Subtractable
  11. PartialFunction
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableLike
  16. Equals
  17. Traversable
  18. Mutable
  19. Traversable
  20. GenericTraversableTemplate
  21. TraversableLike
  22. TraversableOnce
  23. FilterMonadic
  24. HasNewBuilder
  25. AnyRef
  26. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new ConcurrentBijection ()

Type Members

  1. type Self = Map[A, B]

    attributes: protected
    definition classes: TraversableLike

Value Members

  1. def != (arg0: AnyRef) : Boolean

    attributes: final
    definition classes: AnyRef
  2. def != (arg0: Any) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

    false if the receiver object is equivalent to the argument; true otherwise.

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. def + [B1 >: B] (elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*) : Map[A, B1]

    definition classes: MapLike → MapLike
  7. def + [B1 >: B] (kv: (A, B1)) : Map[A, B1]

    definition classes: MapLike → MapLike
  8. def ++ [B1 >: B] (xs: TraversableOnce[(A, B1)]) : Map[A, B1]

    definition classes: MapLike → MapLike
  9. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Map[A, B], B, That]) : That

    definition classes: TraversableLike
  10. def ++= (xs: TraversableOnce[(A, B)]) : ConcurrentBijection.this.type

    definition classes: Growable
  11. def += (elem: (A, B)) : ConcurrentBijection.this.type

    definition classes: ConcurrentBijection → MapLike → Builder → Growable
  12. def += (elem1: (A, B), elem2: (A, B), elems: (A, B)*) : ConcurrentBijection.this.type

    definition classes: Growable
  13. def - (elem1: A, elem2: A, elems: A*) : Map[A, B]

    definition classes: MapLike → Subtractable
  14. def - (key: A) : Map[A, B]

    definition classes: MapLike → MapLike → Subtractable
  15. def -- (xs: TraversableOnce[A]) : Map[A, B]

    definition classes: MapLike → Subtractable
  16. def --= (xs: TraversableOnce[A]) : ConcurrentBijection.this.type

    definition classes: Shrinkable
  17. def -= (key: A) : ConcurrentBijection.this.type

    definition classes: ConcurrentBijection → MapLike → Shrinkable
  18. def -= (elem1: A, elem2: A, elems: A*) : ConcurrentBijection.this.type

    definition classes: Shrinkable
  19. def /: [B] (z: B)(op: (B, (A, B)) ⇒ B) : B

    definition classes: TraversableOnce
  20. def :\ [B] (z: B)(op: ((A, B), B) ⇒ B) : B

    definition classes: TraversableOnce
  21. def == (arg0: AnyRef) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: AnyRef
  22. def == (arg0: Any) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: Any
  23. def addString (b: StringBuilder, start: String, sep: String, end: String) : StringBuilder

    definition classes: MapLike → TraversableOnce
  24. def addString (b: StringBuilder) : StringBuilder

    definition classes: TraversableOnce
  25. def addString (b: StringBuilder, sep: String) : StringBuilder

    definition classes: TraversableOnce
  26. def andThen [C] (k: (B) ⇒ C) : PartialFunction[A, C]

    definition classes: PartialFunction → Function1
  27. def apply (key: A) : B

    definition classes: MapLike → Function1
  28. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  29. def canEqual (that: Any) : Boolean

    definition classes: IterableLike → Equals
  30. def clear () : Unit

    definition classes: MapLike → Builder → Growable
  31. def clone () : Map[A, B]

    This method creates and returns a copy of the receiver object.

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    definition classes: MapLike → Cloneable → AnyRef
  32. def collect [B, That] (pf: PartialFunction[(A, B), B])(implicit bf: CanBuildFrom[Map[A, B], B, That]) : That

    definition classes: TraversableLike
  33. def companion : GenericCompanion[Iterable]

    definition classes: Iterable → Iterable → Traversable → Traversable → GenericTraversableTemplate
  34. def compose [A] (g: (A) ⇒ A) : (A) ⇒ B

    definition classes: Function1
  35. def contains (key: A) : Boolean

    definition classes: MapLike
  36. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int) : Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce
  37. def copyToArray [B >: A] (xs: Array[B]) : Unit

    definition classes: TraversableOnce
  38. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    definition classes: TraversableOnce
  39. def copyToBuffer [B >: A] (dest: Buffer[B]) : Unit

    definition classes: TraversableOnce
  40. def count (p: ((A, B)) ⇒ Boolean) : Int

    definition classes: TraversableOnce
  41. def default (key: A) : B

    definition classes: MapLike
  42. def drop (n: Int) : Map[A, B]

    definition classes: TraversableLike
  43. def dropRight (n: Int) : Map[A, B]

    definition classes: IterableLike
  44. def dropWhile (p: ((A, B)) ⇒ Boolean) : Map[A, B]

    definition classes: TraversableLike
  45. def elements : Iterator[(A, B)]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  46. def empty : Map[A, B]

    definition classes: Map → Map → MapLike
  47. def eq (arg0: AnyRef) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    arg0

    the object to compare against this object for reference equality.

    returns

    true if the argument is a reference to the receiver object; false otherwise.

    attributes: final
    definition classes: AnyRef
  48. def equals (that: Any) : Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation]: * It is reflexive: for any instance x of type Any, x.equals(x) should return true. * It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true. * It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same scala.Int (o1.hashCode.equals(o2.hashCode)).

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    definition classes: MapLike → Equals → AnyRef → Any
  49. def exists (p: ((A, B)) ⇒ Boolean) : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  50. def filter (p: ((A, B)) ⇒ Boolean) : Map[A, B]

    definition classes: TraversableLike
  51. def filterKeys (p: (A) ⇒ Boolean) : Map[A, B]

    definition classes: MapLike
  52. def filterNot (p: ((A, B)) ⇒ Boolean) : Map[A, B]

    definition classes: MapLike → TraversableLike
  53. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.

    attributes: protected
    definition classes: AnyRef
  54. def find (p: ((A, B)) ⇒ Boolean) : Option[(A, B)]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  55. def first : (A, B)

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  56. def firstOption : Option[(A, B)]

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  57. def flatMap [B, That] (f: ((A, B)) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Map[A, B], B, That]) : That

    definition classes: TraversableLike → FilterMonadic
  58. def flatten [B] (implicit asTraversable: ((A, B)) ⇒ Traversable[B]) : Iterable[B]

    definition classes: GenericTraversableTemplate
  59. def foldLeft [B] (z: B)(op: (B, (A, B)) ⇒ B) : B

    definition classes: TraversableOnce
  60. def foldRight [B] (z: B)(op: ((A, B), B) ⇒ B) : B

    definition classes: IterableLike → TraversableOnce
  61. def forall (p: ((A, B)) ⇒ Boolean) : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  62. def foreach [U] (f: ((A, B)) ⇒ U) : Unit

    definition classes: IterableLike → TraversableLike → TraversableOnce → FilterMonadic
  63. val forward : ConcurrentHashMap[A, B]

  64. def genericBuilder [B] : Builder[B, Iterable[B]]

    definition classes: GenericTraversableTemplate
  65. def get (key: A) : Option[B]

    definition classes: ConcurrentBijection → MapLike
  66. def getClass () : java.lang.Class[_]

    Returns a representation that corresponds to the dynamic class of the receiver object.

    Returns a representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    attributes: final
    definition classes: AnyRef
  67. def getOrElse [B1 >: B] (key: A, default: ⇒ B1) : B1

    definition classes: MapLike
  68. def getOrElseUpdate (key: A, op: ⇒ B) : B

    definition classes: MapLike
  69. def getReverse (value: B) : Option[A]

  70. def groupBy [K] (f: ((A, B)) ⇒ K) : Map[K, Map[A, B]]

    definition classes: TraversableLike
  71. def grouped (size: Int) : Iterator[Map[A, B]]

    definition classes: IterableLike
  72. def hasDefiniteSize : Boolean

    definition classes: TraversableLike → TraversableOnce
  73. def hashCode () : Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    returns

    the hash code value for the object.

    definition classes: MapLike → AnyRef → Any
  74. def head : (A, B)

    definition classes: IterableLike → TraversableLike
  75. def headOption : Option[(A, B)]

    definition classes: TraversableLike
  76. def init : Map[A, B]

    definition classes: TraversableLike
  77. def isDefinedAt (key: A) : Boolean

    definition classes: MapLike → PartialFunction
  78. def isEmpty : Boolean

    definition classes: MapLike → IterableLike → TraversableLike → TraversableOnce
  79. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    attributes: final
    definition classes: Any
  80. def isTraversableAgain : Boolean

    attributes: final
    definition classes: TraversableLike → TraversableOnce
  81. def iterator : Iterator[(A, B)]

    definition classes: ConcurrentBijection → MapLike → IterableLike
  82. def keySet : Set[A]

    definition classes: MapLike
  83. def keys : Iterable[A]

    definition classes: MapLike
  84. def keysIterator : Iterator[A]

    definition classes: MapLike
  85. def last : (A, B)

    definition classes: TraversableLike
  86. def lastOption : Option[(A, B)]

    definition classes: TraversableLike
  87. def lift : (A) ⇒ Option[B]

    definition classes: PartialFunction
  88. def map [B, That] (f: ((A, B)) ⇒ B)(implicit bf: CanBuildFrom[Map[A, B], B, That]) : That

    definition classes: TraversableLike → FilterMonadic
  89. def mapElements [C] (f: (B) ⇒ C) : Map[A, C]

    definition classes: MapLike
      deprecated:
    1. use mapValues' instead

  90. def mapResult [NewTo] (f: (Map[A, B]) ⇒ NewTo) : Builder[(A, B), NewTo]

    definition classes: Builder
  91. def mapValues [C] (f: (B) ⇒ C) : Map[A, C]

    definition classes: MapLike
  92. def max [B >: A] (implicit cmp: Ordering[B]) : (A, B)

    definition classes: TraversableOnce
  93. def min [B >: A] (implicit cmp: Ordering[B]) : (A, B)

    definition classes: TraversableOnce
  94. def mkString : String

    definition classes: TraversableOnce
  95. def mkString (sep: String) : String

    definition classes: TraversableOnce
  96. def mkString (start: String, sep: String, end: String) : String

    definition classes: TraversableOnce
  97. def ne (arg0: AnyRef) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

    false if the argument is not a reference to the receiver object; true otherwise.

    attributes: final
    definition classes: AnyRef
  98. def newBuilder : Builder[(A, B), Map[A, B]]

    attributes: protected[this]
    definition classes: MapLike → MapLike → TraversableLike → HasNewBuilder
  99. def nonEmpty : Boolean

    definition classes: TraversableOnce
  100. def notify () : Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  101. def notifyAll () : Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  102. def orElse [A1 <: A, B1 >: B] (that: PartialFunction[A1, B1]) : PartialFunction[A1, B1]

    definition classes: PartialFunction
  103. def partition (p: ((A, B)) ⇒ Boolean) : (Map[A, B], Map[A, B])

    definition classes: TraversableLike
  104. def product [B >: A] (implicit num: Numeric[B]) : B

    definition classes: TraversableOnce
  105. def projection : IterableView[(A, B), Map[A, B]]

    definition classes: IterableLike
      deprecated:
    1. use view' instead

  106. def put (key: A, value: B) : Option[B]

    definition classes: MapLike
  107. def reduceLeft [B >: A] (op: (B, (A, B)) ⇒ B) : B

    definition classes: TraversableOnce
  108. def reduceLeftOption [B >: A] (op: (B, (A, B)) ⇒ B) : Option[B]

    definition classes: TraversableOnce
  109. def reduceRight [B >: A] (op: ((A, B), B) ⇒ B) : B

    definition classes: IterableLike → TraversableOnce
  110. def reduceRightOption [B >: A] (op: ((A, B), B) ⇒ B) : Option[B]

    definition classes: TraversableOnce
  111. def remove (key: A) : Option[B]

    definition classes: MapLike
  112. def removeKey (key: A) : Option[B]

    definition classes: MapLike
      deprecated:
    1. Use remove' instead

  113. def repr : Map[A, B]

    definition classes: TraversableLike
  114. def result () : Map[A, B]

    definition classes: MapLike → Builder
  115. def retain (p: (A, B) ⇒ Boolean) : ConcurrentBijection.this.type

    definition classes: MapLike
  116. val reverse : ConcurrentHashMap[B, A]

  117. def reversed : List[(A, B)]

    attributes: protected[this]
    definition classes: TraversableOnce
  118. def sameElements [B >: A] (that: Iterable[B]) : Boolean

    definition classes: IterableLike
  119. def scanLeft [B, That] (z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[Map[A, B], B, That]) : That

    definition classes: TraversableLike
  120. def scanRight [B, That] (z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[Map[A, B], B, That]) : That

    definition classes: TraversableLike
  121. def size : Int

    definition classes: ConcurrentBijection → TraversableOnce
  122. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int) : Unit

    definition classes: Builder
  123. def sizeHint (size: Int) : Unit

    definition classes: Builder
  124. def sizeHintBounded (size: Int, boundingColl: scala.collection.TraversableLike[_, _]) : Unit

    definition classes: Builder
  125. def slice (from: Int, until: Int) : Map[A, B]

    definition classes: IterableLike → TraversableLike
  126. def sliding [B >: A] (size: Int, step: Int) : Iterator[Map[A, B]]

    definition classes: IterableLike
  127. def sliding [B >: A] (size: Int) : Iterator[Map[A, B]]

    definition classes: IterableLike
  128. def span (p: ((A, B)) ⇒ Boolean) : (Map[A, B], Map[A, B])

    definition classes: TraversableLike
  129. def splitAt (n: Int) : (Map[A, B], Map[A, B])

    definition classes: TraversableLike
  130. def stringPrefix : String

    definition classes: MapLike → TraversableLike
  131. def sum [B >: A] (implicit num: Numeric[B]) : B

    definition classes: TraversableOnce
  132. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  133. def tail : Map[A, B]

    definition classes: TraversableLike
  134. def take (n: Int) : Map[A, B]

    definition classes: IterableLike → TraversableLike
  135. def takeRight (n: Int) : Map[A, B]

    definition classes: IterableLike
  136. def takeWhile (p: ((A, B)) ⇒ Boolean) : Map[A, B]

    definition classes: IterableLike → TraversableLike
  137. def thisCollection : Iterable[(A, B)]

    attributes: protected[this]
    definition classes: IterableLike → TraversableLike
  138. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    definition classes: TraversableOnce
  139. def toBuffer [B >: A] : Buffer[B]

    definition classes: TraversableOnce
  140. def toCollection (repr: Map[A, B]) : Iterable[(A, B)]

    attributes: protected[this]
    definition classes: IterableLike → TraversableLike
  141. def toIndexedSeq [B >: A] : IndexedSeq[B]

    definition classes: TraversableOnce
  142. def toIterable : Iterable[(A, B)]

    definition classes: IterableLike → TraversableOnce
  143. def toIterator : Iterator[(A, B)]

    definition classes: TraversableLike → TraversableOnce
  144. def toList : List[(A, B)]

    definition classes: TraversableOnce
  145. def toMap [T, U] (implicit ev: <:<[(A, B), (T, U)]) : Map[T, U]

    definition classes: TraversableOnce
  146. def toOpt [T] (x: T) : Option[T]

  147. def toSeq : Seq[(A, B)]

    definition classes: IterableLike → TraversableOnce
  148. def toSet [B >: A] : Set[B]

    definition classes: TraversableOnce
  149. def toStream : Stream[(A, B)]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  150. def toString () : String

    Returns a string representation of the object.

    Returns a string representation of the object.

    The default representation is platform dependent.

    returns

    a string representation of the object.

    definition classes: MapLike → TraversableLike → Function1 → AnyRef → Any
  151. def toTraversable : Traversable[(A, B)]

    definition classes: TraversableLike → TraversableOnce
  152. def transform (f: (A, B) ⇒ B) : ConcurrentBijection.this.type

    definition classes: MapLike
  153. def transpose [B] (implicit asTraversable: ((A, B)) ⇒ Traversable[B]) : Iterable[Iterable[B]]

    definition classes: GenericTraversableTemplate
  154. def unzip [A1, A2] (implicit asPair: ((A, B)) ⇒ (A1, A2)) : (Iterable[A1], Iterable[A2])

    definition classes: GenericTraversableTemplate
  155. def update (key: A, value: B) : Unit

    definition classes: ConcurrentBijection → MapLike
  156. def updated [B1 >: B] (key: A, value: B1) : Map[A, B1]

    definition classes: MapLike → MapLike
  157. def values : Iterable[B]

    definition classes: MapLike
  158. def valuesIterator : Iterator[B]

    definition classes: MapLike
  159. def view (from: Int, until: Int) : IterableView[(A, B), Map[A, B]]

    definition classes: IterableLike → TraversableLike
  160. def view : IterableView[(A, B), Map[A, B]]

    definition classes: IterableLike → TraversableLike
  161. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  162. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  163. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  164. def withFilter (p: ((A, B)) ⇒ Boolean) : FilterMonadic[(A, B), Map[A, B]]

    definition classes: TraversableLike → FilterMonadic
  165. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[Map[A, B], (A1, B), That]) : That

    definition classes: IterableLike
  166. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Map[A, B], (A1, B), That]) : That

    definition classes: IterableLike
  167. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[Map[A, B], (A1, Int), That]) : That

    definition classes: IterableLike

Inherited from Map[A, B]

Inherited from MapLike[A, B, Map[A, B]]

Inherited from Cloneable[Map[A, B]]

Inherited from Shrinkable[A]

Inherited from Builder[(A, B), Map[A, B]]

Inherited from Growable[(A, B)]

Inherited from Map[A, B]

Inherited from MapLike[A, B, Map[A, B]]

Inherited from Subtractable[A, Map[A, B]]

Inherited from PartialFunction[A, B]

Inherited from (A) ⇒ B

Inherited from Iterable[(A, B)]

Inherited from Iterable[(A, B)]

Inherited from IterableLike[(A, B), Map[A, B]]

Inherited from Equals

Inherited from Traversable[(A, B)]

Inherited from Mutable

Inherited from Traversable[(A, B)]

Inherited from GenericTraversableTemplate[(A, B), Iterable]

Inherited from TraversableLike[(A, B), Map[A, B]]

Inherited from TraversableOnce[(A, B)]

Inherited from FilterMonadic[(A, B), Map[A, B]]

Inherited from HasNewBuilder[(A, B), Map[A, B]]

Inherited from AnyRef

Inherited from Any