sortedMap

Type Members

type BuildKeyConstraint[K] = Order[K]

Definition Classes
MapSubSortedMap
trait MapMonoid[K, V] extends Monoid[XMap[K, V]]

Attributes
protected[this]
Definition Classes
MapSub
type XMap[K, +V] = SortedMap[K, V]

Definition Classes
MapSubSortedMap

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
final def ab_+[K, V](m: XMap[K, V], k: K, v: V)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

Attributes
protected
Definition Classes
MapSubSortedMap
final def ab_-[K, V](m: XMap[K, V], k: K)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

Attributes
protected
Definition Classes
MapSubSortedMap
final def alter[K, A](m: XMap[K, A], k: K)(f: (Option[A]) ⇒ Option[A])(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

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

Definition Classes
MapSubFunctions
final def asInstanceOf[T0]: T0

Definition Classes
Any
final def buildXMap[K, V, K2, V2](implicit arg0: BuildKeyConstraint[K2]): CanBuildFrom[XMap[K, V], (K2, V2), XMap[K2, V2]]

Attributes
protected
Definition Classes
MapSubSortedMap
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
final def getOrAdd[F[_], K, A](m: XMap[K, A], k: K)(fa: ⇒ F[A])(implicit F: Applicative[F], K: BuildKeyConstraint[K]): F[(XMap[K, A], A)]

Grab a value out of Map if it's present.
Grab a value out of Map if it's present. Otherwise evaluate a value to be placed at that key in the Map.

Definition Classes
MapSubFunctions
def hashCode(): Int

Definition Classes
AnyRef → Any
final def insertWith[K, A](m1: XMap[K, A], k: K, v: A)(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[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
MapSubFunctions
final def intersectWith[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[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
MapSubFunctions
final def intersectWithKey[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (K, A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[K, C]

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

Definition Classes
MapSubFunctions
final def isInstanceOf[T0]: Boolean

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

Definition Classes
MapSubInstances0
implicit def mapFoldable[K]: Foldable[[β$1$]XMap[K, β$1$]]

Definition Classes
MapSubInstances0
implicit def mapInstance[K](implicit arg0: BuildKeyConstraint[K]): Traverse[[β$2$]XMap[K, β$2$]] with IsEmpty[[β$3$]XMap[K, β$3$]] with Bind[[β$4$]XMap[K, β$4$]] with Align[[β$5$]XMap[K, β$5$]]

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
MapSubInstances
final def mapKeys[K, K2, A](m: XMap[K, A])(f: (K) ⇒ K2)(implicit arg0: BuildKeyConstraint[K2]): XMap[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
MapSubFunctions
implicit def mapMonoid[K, V](implicit arg0: BuildKeyConstraint[K], arg1: Semigroup[V]): Monoid[XMap[K, V]]

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

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

Definition Classes
MapSubInstances
implicit def mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[XMap[K, V]]

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
implicit def sortedMapBand[K, V](implicit B: BuildKeyConstraint[K], S: Band[V]): Band[SortedMap[K, V]]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def unionWith[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[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
MapSubFunctions
Note
iff f gives rise to a scalaz.Semigroup, so does unionWith(_, _)(f).
final def unionWithKey[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (K, A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

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

Definition Classes
MapSubFunctions
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( ... )

object sortedMap extends MapSubInstances with MapSubFunctions with MapSubSortedMap

Type Members

type BuildKeyConstraint[K] = Order[K]

trait MapMonoid[K, V] extends Monoid[XMap[K, V]]

type XMap[K, +V] = SortedMap[K, V]

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def ab_+[K, V](m: XMap[K, V], k: K, v: V)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

final def ab_-[K, V](m: XMap[K, V], k: K)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

final def alter[K, A](m: XMap[K, A], k: K)(f: (Option[A]) ⇒ Option[A])(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

final def asInstanceOf[T0]: T0

final def buildXMap[K, V, K2, V2](implicit arg0: BuildKeyConstraint[K2]): CanBuildFrom[XMap[K, V], (K2, V2), XMap[K2, V2]]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

final def getOrAdd[F[_], K, A](m: XMap[K, A], k: K)(fa: ⇒ F[A])(implicit F: Applicative[F], K: BuildKeyConstraint[K]): F[(XMap[K, A], A)]

def hashCode(): Int

final def insertWith[K, A](m1: XMap[K, A], k: K, v: A)(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

final def intersectWith[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[K, C]

final def intersectWithKey[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (K, A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[K, C]

final def isInstanceOf[T0]: Boolean

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

implicit def mapFoldable[K]: Foldable[[β$1$]XMap[K, β$1$]]

implicit def mapInstance[K](implicit arg0: BuildKeyConstraint[K]): Traverse[[β$2$]XMap[K, β$2$]] with IsEmpty[[β$3$]XMap[K, β$3$]] with Bind[[β$4$]XMap[K, β$4$]] with Align[[β$5$]XMap[K, β$5$]]

final def mapKeys[K, K2, A](m: XMap[K, A])(f: (K) ⇒ K2)(implicit arg0: BuildKeyConstraint[K2]): XMap[K2, A]

implicit def mapMonoid[K, V](implicit arg0: BuildKeyConstraint[K], arg1: Semigroup[V]): Monoid[XMap[K, V]]

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

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit def sortedMapBand[K, V](implicit B: BuildKeyConstraint[K], S: Band[V]): Band[SortedMap[K, V]]

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

def toString(): String

final def unionWith[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

final def unionWithKey[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (K, A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from MapSubSortedMap

Inherited from MapSubInstances

Inherited from MapSubFunctions

Inherited from MapSubInstances0

Inherited from MapSub

Inherited from AnyRef

Inherited from Any

Ungrouped