Association1

abstract val key: K

The key.

abstract val values: Iterable1[V]

One or many values.

final def !=(arg0: Any): Boolean

final def ##(): Int

def ***[KK >: K, W](w: Association1[KK, W])(implicit S: Semigroup[KK]): Association1[KK, (V, W)]

Zip the values of this association with the given association to produce an iterable of pairs.

def :->[W](f: (V) ⇒ W): Association1[K, W]

Map a function on the association.

def <*>:[KK >: K, W](f: Association1[KK, (V) ⇒ W])(implicit S: Semigroup[KK]): Association1[KK, W]

Zip the given association with this association, appending on keys and values.

def <-:[L](f: (K) ⇒ L): Association1[L, V]

Run a function on the key to a new key.

final def ==(arg0: Any): Boolean

def ap[KK >: K, W](f: Association1[KK, (V) ⇒ W])(implicit S: Semigroup[KK]): Association1[KK, W]

Zip the given association with this association, appending on keys and values.

final def asInstanceOf[T0]: T0

def bimap[W, L](f: (K) ⇒ L, g: (V) ⇒ W): Association1[L, W]

Map two functions on the key and values (binary map).

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (V) ⇒ Boolean): Boolean

True if any values of the association satisfy the given predicate.

def finalize(): Unit

def find(p: (V) ⇒ Boolean): Option[V]

Return the first element in the values satisfying the given predicate.

def firstValue: V

Return the first value in the associated values.

def forall(p: (V) ⇒ Boolean): Boolean

True if all values of the association satisfy the given predicate.

def foreach[W](f: (V) ⇒ Unit): Unit

Run an effect on each value.

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def iterator: Iterator1[V]

Return an iterator on the values.

def map[W](f: (V) ⇒ W): Association1[K, W]

Map a function on the association.

def mapKey[L](f: (K) ⇒ L): Association1[L, V]

Run a function on the key to a new key.

def mapValues[W](f: (Iterable1[V]) ⇒ Iterable1[W]): Association1[K, W]

Run a function on the values to new values.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def nvalues: Int

Return the number of values in the association.

def productKey[L, VV >: V](w: Association1[L, VV]): Association1[(K, L), VV]

Zip the key of this association with the given association to produce an iterable of pairs.

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

def toString(): String

def traverseKey[F[_], L, VV >: V](f: (K) ⇒ F[L])(implicit arg0: Functor[F]): F[Association1[L, VV]]

Traverse this association with the given function on an arbitrary functor.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def zip[KK >: K, W](w: Association1[KK, W])(implicit S: Semigroup[KK]): Association1[KK, (V, W)]

Zip the values of this association with the given association to produce an iterable of pairs.