map

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def alter[K, A](m: Map[K, A], k: K)(f: (Option[A]) ⇒ Option[A]): Map[K, A]

Vary the value of m get k.
Vary the value of m get k.

Definition Classes
MapFunctions
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def insertWith[K, A](m1: Map[K, A], k: K, v: A)(f: (A, A) ⇒ A): Map[K, A]

As with Map.updated, but resolve a collision with f.
As with Map.updated, but resolve a collision with f. The first argument is guaranteed to be from m1.

Definition Classes
MapFunctions
final def intersectWith[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (A, B) ⇒ C): Map[K, C]

Collect only elements with matching keys, joining their associated values with f.
Collect only elements with matching keys, joining their associated values with f.

Definition Classes
MapFunctions
final def intersectWithKey[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (K, A, B) ⇒ C): Map[K, C]

Like intersectWith, but tell f about the key.
Like intersectWith, but tell f about the key.

Definition Classes
MapFunctions
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
implicit def mapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[Map[K, V]]

Definition Classes
MapInstances0
implicit def mapInstance[K]: Traverse[[V]Map[K, V]] with IsEmpty[[V]Map[K, V]]

Covariant over the value parameter, where plus applies the Last semigroup to values.
Covariant over the value parameter, where plus applies the Last semigroup to values.

Definition Classes
MapInstances
final def mapKeys[K, K2, A](m: Map[K, A])(f: (K) ⇒ K2): Map[K2, A]

Exchange keys of m according to f.
Exchange keys of m according to f. Result may be smaller if f maps two or more Ks to the same K2, in which case the resulting associated value is an arbitrary choice.

Definition Classes
MapFunctions
implicit def mapMonoid[K, V](implicit arg0: Semigroup[V]): Monoid[Map[K, V]]

Map union monoid, unifying values with V's append.
Map union monoid, unifying values with V's append.

Definition Classes
MapInstances
implicit def mapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[Map[K, V]]

Definition Classes
MapInstances
implicit def mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[Map[K, V]]

Definition Classes
MapInstances
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def unionWith[K, A](m1: Map[K, A], m2: Map[K, A])(f: (A, A) ⇒ A): Map[K, A]

Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.
Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

Definition Classes
MapFunctions
Note
iff f gives rise to a scalaz.Semigroup, so does unionWith(_, _)(f).
final def unionWithKey[K, A](m1: Map[K, A], m2: Map[K, A])(f: (K, A, A) ⇒ A): Map[K, A]

Like unionWith, but telling f about the key.
Like unionWith, but telling f about the key.

Definition Classes
MapFunctions
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package std

object map extends MapInstances with MapFunctions

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def alter[K, A](m: Map[K, A], k: K)(f: (Option[A]) ⇒ Option[A]): Map[K, A]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def insertWith[K, A](m1: Map[K, A], k: K, v: A)(f: (A, A) ⇒ A): Map[K, A]

final def intersectWith[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (A, B) ⇒ C): Map[K, C]

final def intersectWithKey[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (K, A, B) ⇒ C): Map[K, C]

final def isInstanceOf[T0]: Boolean

implicit def mapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[Map[K, V]]

implicit def mapInstance[K]: Traverse[[V]Map[K, V]] with IsEmpty[[V]Map[K, V]]

final def mapKeys[K, K2, A](m: Map[K, A])(f: (K) ⇒ K2): Map[K2, A]

implicit def mapMonoid[K, V](implicit arg0: Semigroup[V]): Monoid[Map[K, V]]

implicit def mapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[Map[K, V]]

implicit def mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[Map[K, V]]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def unionWith[K, A](m1: Map[K, A], m2: Map[K, A])(f: (A, A) ⇒ A): Map[K, A]

final def unionWithKey[K, A](m1: Map[K, A], m2: Map[K, A])(f: (K, A, A) ⇒ A): Map[K, A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from MapFunctions

Inherited from MapInstances

Inherited from MapInstances0

Inherited from AnyRef

Inherited from Any

Ungrouped