GeneralMapOps

Instance Constructors

new GeneralMapOps(these: Map[A, T])

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 asInstanceOf[T0]: T0

Definition Classes
Any
def choose[B](q: PartialFunction[(A, T), B]): Option[B]

Returns the application of a partial function to the first entry of this map for which the function is defined.
Returns the application of a partial function to the first entry of this map for which the function is defined.
q
the partial function to test entries against and to apply to the first found entry.
returns
some found and mapped entry, or none if no entry applies to q.

Annotations
@macroImpl()
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def count(p: ((A, T)) ⇒ Boolean): Int

Returns the number of entries in this map that satisfy a predicate.
Returns the number of entries in this map that satisfy a predicate.
p
the predicate to test entries against.
returns
the number of entries satisfying p.

Annotations
@macroImpl()
def eagerly: StrictMapOps[A, T, Map[A, T]]

Returns a strict operations interface to this map.
Returns a strict operations interface to this map.

Annotations
@macroImpl()
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def exists(p: ((A, T)) ⇒ Boolean): Boolean

Returns true if a predicate holds for some entry of this map.
Returns true if a predicate holds for some entry of this map.
p
the predicate to test entries against.
returns
true if any entry satisfies p, otherwise false.

Annotations
@macroImpl()
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
def find(p: ((A, T)) ⇒ Boolean): Option[(A, T)]

Returns the first entry of this map that satisfies a predicate.
Returns the first entry of this map that satisfies a predicate.
p
the predicate to test entries against.
returns
some found entry, or none if no entry satisfies p.

Annotations
@macroImpl()
def fold[B >: (A, T)](z: B)(op: (B, B) ⇒ B): B

Returns the repeated application of an associative binary operator between an identity entry and all entries of this map.
Returns the repeated application of an associative binary operator between an identity entry and all entries of this map.
z
the operator's identity element.
op
the associative binary operator to apply.
returns
the folded value.

Annotations
@macroImpl()
def foldLeft[B](z: B)(op: (B, (A, T)) ⇒ B): B

Returns the left-to-right application of a binary operator between a start value and all entries of this map.
Returns the left-to-right application of a binary operator between a start value and all entries of this map.
z
the starting value.
op
the binary operator to apply right-recursively.
returns
the folded value.

Annotations
@macroImpl()
def forall(p: ((A, T)) ⇒ Boolean): Boolean

Returns true if a predicate holds for all entries of this map.
Returns true if a predicate holds for all entries of this map.
p
the predicate to test entries against.
returns
true if all entries satisfy p, otherwise false.

Annotations
@macroImpl()
def foreach[U](f: ((A, T)) ⇒ U): Unit

Sequentially applies a function to each entry of this map.
Sequentially applies a function to each entry of this map.
f
the function to apply to each entry.

Annotations
@macroImpl()
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def lazily: NonStrictMapOps[A, T]

Returns a non-strict operations interface to this map.
Returns a non-strict operations interface to this map.

Annotations
@macroImpl()
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def reduce[B >: (A, T)](op: (B, B) ⇒ B): B

Returns the repeated application of an associative binary operator between all entries of this non-empty map.
Returns the repeated application of an associative binary operator between all entries of this non-empty map.
op
the associative binary operator to apply.
returns
the reduced value.

Annotations
@macroImpl()
def reduceLeft[B >: (A, T)](op: (B, (A, T)) ⇒ B): B

Returns the left-to-right application of a binary operator between all entries of this non-empty map.
Returns the left-to-right application of a binary operator between all entries of this non-empty map.
op
the binary operator to apply right-recursively.
returns
the reduced value.

Annotations
@macroImpl()
def reduceLeftOption[B >: (A, T)](op: (B, (A, T)) ⇒ B): Option[B]

Returns the left-to-right application of a binary operator between all entries of this map.
Returns the left-to-right application of a binary operator between all entries of this map.
op
the binary operator to apply right-recursively.
returns
some reduced value, or none if this map is empty.

Annotations
@macroImpl()
def reduceOption[B >: (A, T)](op: (B, B) ⇒ B): Option[B]

Returns the repeated application of an associative binary operator between all entries of this map.
Returns the repeated application of an associative binary operator between all entries of this map.
op
the associative binary operator to apply.
returns
some reduced value, or none if this map is empty.

Annotations
@macroImpl()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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()

final class GeneralMapOps[+A, +T] extends AnyRef

Instance Constructors

new GeneralMapOps(these: Map[A, T])

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 asInstanceOf[T0]: T0

def choose[B](q: PartialFunction[(A, T), B]): Option[B]

def clone(): AnyRef

def count(p: ((A, T)) ⇒ Boolean): Int

def eagerly: StrictMapOps[A, T, Map[A, T]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: ((A, T)) ⇒ Boolean): Boolean

def finalize(): Unit

def find(p: ((A, T)) ⇒ Boolean): Option[(A, T)]

def fold[B >: (A, T)](z: B)(op: (B, B) ⇒ B): B

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

def forall(p: ((A, T)) ⇒ Boolean): Boolean

def foreach[U](f: ((A, T)) ⇒ U): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lazily: NonStrictMapOps[A, T]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def reduce[B >: (A, T)](op: (B, B) ⇒ B): B

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

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

def reduceOption[B >: (A, T)](op: (B, B) ⇒ B): Option[B]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Traversing

Reducing

Querying

Transforming

Ungrouped