Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  implicit def additiveMonoid[A, B](implicit arg0: ClassTag[A], arg1: ClassTag[B], arg2: AdditiveMonoid[B]): AdditiveMonoid[Map[A, B]]

   Provide an AdditiveMonoid[Map[A, B]].

   Provide an AdditiveMonoid[Map[A, B]].

   The maps are combined key-by-key, using + to merge values if necessary.

5.  def apply[A, B](pairs: (A, B)*)(implicit arg0: ClassTag[A], arg1: ClassTag[B]): Map[A, B]

   Create a new literal map.

   Create a new literal map.

   Note that this method will box the given items. Unless you already have a sequence of tuples, another constructor may require fewer allocations.

   Example: Map(1 -> "cat", 2 -> "dog", 3 -> "fish")

6.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @native() @throws( ... )

8.  def empty[A, B](implicit arg0: ClassTag[A], arg1: ClassTag[B]): Map[A, B]

   Create an empty Map.

   Create an empty Map.

   Example: Map.empty[Int, String]

9.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

10.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

11.  implicit def eqv[A, B]: Eq[Map[A, B]]

    Provide an Eq[Map[A, B]] instance.

    Provide an Eq[Map[A, B]] instance.

    Since Maps are so reliant on equality, and use hash codes internally, the default equality is used to compare elements.

12.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13.  def fromArrays[A, B](ks: Array[A], vs: Array[B])(implicit arg0: ClassTag[A], arg1: ClassTag[B]): Map[A, B]

    Create a map from an array of keys and another array of values.

    Create a map from an array of keys and another array of values.

    Example: Map(Array(1,2,3), Array("cat", "dog", "fish"))

14.  def fromIterable[A, B](pairs: Iterable[(A, B)])(implicit arg0: ClassTag[A], arg1: ClassTag[B]): Map[A, B]

    Create a map from an iterable of tuples.

    Create a map from an iterable of tuples.

    Note that this method will box the given items. Unless you already have a sequence of tuples, another constructor may require fewer allocations.

    Example: Map.fromIterable(List((1, "cat"), (2, "dog"), (3, "fish")))

15.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

16.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

17.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

18.  implicit def monoid[A, B](implicit arg0: ClassTag[A], arg1: ClassTag[B], arg2: Monoid[B]): Monoid[Map[A, B]]

    Provide a Monoid[Map[A, B]].

    Provide a Monoid[Map[A, B]].

    The maps are combined key-by-key, using |+| to merge values if necessary.

19.  implicit def multiplicativeMonoid[A, B](implicit arg0: ClassTag[A], arg1: ClassTag[B], arg2: MultiplicativeMonoid[B]): MultiplicativeMonoid[Map[A, B]]

    Provide an MultiplicativeMonoid[Map[A, B]].

    Provide an MultiplicativeMonoid[Map[A, B]].

    The maps are combined key-by-key, using * to merge values if necessary.

20.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

21.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

22.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

23.  def ofSize[A, B](n: Int)(implicit arg0: ClassTag[A], arg1: ClassTag[B]): Map[A, B]

    Create a Map that can hold n unique keys without resizing itself.

    Create a Map that can hold n unique keys without resizing itself.

    Note that the internal representation will allocate more space than requested to satisfy the requirements of internal alignment. Map uses arrays whose lengths are powers of two, and needs at least 33% of the map free to enable good hashing performance.

    Example: Map.ofSize[Int, String](100).

24.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

25.  def toString(): String

    Definition Classes

    AnyRef → Any

26.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

28.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )