trait MapMethods[A, +B, +This <: MapLike[A, B, This] with Map[A, B]] extends IterableMethods[(A, B), This] with SubtractableMethods[A, This]


  1. SubtractableMethods
  2. IterableMethods
  3. TraversableMethods
  4. AnyRef
  5. Any

Value Members

  1. def +[B1 >: B](elem1: (A, B1), elem2: (A, B1), elems: (A, B1)*): Map[A, B1]

  2. def +[B1 >: B](kv: (A, B1)): Map[A, B1]

  3. def ++[B1 >: B](iter: Iterator[(A, B1)]): Map[A, B1]

  4. def ++[B1 >: B](elems: Traversable[(A, B1)]): Map[A, B1]

  5. def ++[B >: (A, B), That](that: Traversable[B])(bf: CanBuildFrom[This, B, That]): That

  6. def ++[B >: (A, B), That](that: Iterator[B])(bf: CanBuildFrom[This, B, That]): That

  7. def -(key: A): This

  8. def -(elem1: A, elem2: A, elems: A*): This

  9. def --(iter: Iterator[A]): This

  10. def --(elems: Traversable[A]): This

  11. def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B

  12. def :\[B](z: B)(op: ((A, B), B) ⇒ B): B

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

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

  15. def addString(b: StringBuilder): StringBuilder

  16. def apply(key: A): B

  17. def contains(key: A): Boolean

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

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

  20. def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit

  21. def count(p: ((A, B)) ⇒ Boolean): Int

  22. def default(key: A): B

  23. def drop(n: Int): Traversable[(A, B)]

  24. def dropRight(n: Int): Iterable[(A, B)]

  25. def dropWhile(p: ((A, B)) ⇒ Boolean): Traversable[(A, B)]

  26. def empty: This

  27. def equals(arg0: 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 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 Int (o1.hashCode.equals(o2.hashCode)).


    the object to compare against this object for equality.


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

    definition classes: AnyRef ⇐ Any
  28. def exists(p: ((A, B)) ⇒ Boolean): Boolean

  29. def filter(p: ((A, B)) ⇒ Boolean): Traversable[(A, B)]

  30. def filterKeys(p: (A) ⇒ Boolean): DefaultMap[A, B]

  31. def filterNot(p: ((A, B)) ⇒ Boolean): Traversable[(A, B)]

  32. def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]

  33. def flatMap[B, That](f: ((A, B)) ⇒ Traversable[B])(bf: CanBuildFrom[This, B, That]): That

  34. def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B

  35. def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B

  36. def forall(p: ((A, B)) ⇒ Boolean): Boolean

  37. def foreach[U](f: ((A, B)) ⇒ U): Unit

  38. def get(key: A): Option[B]

  39. def getOrElse[B1 >: B](key: A, default: ⇒ B1): B1

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

  41. def hasDefiniteSize: Boolean

  42. 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.

    definition classes: AnyRef ⇐ Any
  43. def head: (A, B)

  44. def headOption: Option[(A, B)]

  45. def init: Traversable[(A, B)]

  46. def isDefinedAt(key: A): Boolean

  47. def isEmpty: Boolean

  48. def iterator: Iterator[(A, B)]

  49. def keySet: Set[A]

  50. def keysIterator: Iterator[A]

  51. def last: (A, B)

  52. def lastOption: Option[(A, B)]

  53. def map[B, That](f: ((A, B)) ⇒ B)(bf: CanBuildFrom[This, B, That]): That

  54. def mapValues[C](f: (B) ⇒ C): DefaultMap[A, C]

  55. def mkString: String

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

  57. def mkString(sep: String): String

  58. def nonEmpty: Boolean

  59. def partialMap[B, That](pf: PartialFunction[(A, B), B])(bf: CanBuildFrom[This, B, That]): That

  60. def partition(p: ((A, B)) ⇒ Boolean): (Traversable[(A, B)], Traversable[(A, B)])

  61. def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B

  62. def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]

  63. def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B

  64. def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]

  65. def sameElements[B >: (A, B)](that: Iterable[B]): Boolean

  66. def size: Int

  67. def slice(from: Int, until: Int): Traversable[(A, B)]

  68. def sortWith(lt: ((A, B), (A, B)) ⇒ Boolean)(m: ClassManifest[(A, B)]): This

  69. def span(p: ((A, B)) ⇒ Boolean): (Traversable[(A, B)], Traversable[(A, B)])

  70. def splitAt(n: Int): (Traversable[(A, B)], Traversable[(A, B)])

  71. def stringPrefix: String

  72. def tail: Traversable[(A, B)]

  73. def take(n: Int): Traversable[(A, B)]

  74. def takeRight(n: Int): Iterable[(A, B)]

  75. def takeWhile(p: ((A, B)) ⇒ Boolean): Traversable[(A, B)]

  76. def toArray[B >: (A, B)](arg0: ClassManifest[B]): Array[B]

  77. def toIndexedSeq[B >: (A, B)]: IndexedSeq[B]

  78. def toIterable: Iterable[(A, B)]

  79. def toList: List[(A, B)]

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

  81. def toSet[B >: (A, B)]: Set[B]

  82. def toStream: Stream[(A, B)]

  83. def toString(): String

    Returns a string representation of the object

    Returns a string representation of the object.

    The default representation is platform dependent.

    definition classes: AnyRef ⇐ Any
  84. def updated[B1 >: B](key: A, value: B1): Map[A, B1]

  85. def valuesIterable: Iterable[B]

  86. def valuesIterator: Iterator[B]

  87. def view(from: Int, until: Int): IterableView[(A, B), This]

  88. def view: IterableView[(A, B), This]

  89. def zip[A1 >: (A, B), B, That](that: Iterable[B])(bf: CanBuildFrom[This, (A1, B), That]): That

  90. def zipAll[B, A1 >: (A, B), That](that: Iterable[B], e1: A1, e2: B)(bf: CanBuildFrom[This, (A1, B), That]): That

  91. def zipWithIndex[A1 >: (A, B), That](bf: CanBuildFrom[This, (A1, Int), That]): That