scalax.collection.mutable

EqHashMap

class EqHashMap[K <: AnyRef, V] extends Map[K, V] with MapLike[K, V, EqHashMap[K, V]]

Linear Supertypes
Map[K, V], MapLike[K, V, EqHashMap[K, V]], Cloneable[EqHashMap[K, V]], Cloneable, Cloneable, Shrinkable[K], Builder[(K, V), EqHashMap[K, V]], Growable[(K, V)], Clearable, Map[K, V], MapLike[K, V, EqHashMap[K, V]], Subtractable[K, EqHashMap[K, V]], PartialFunction[K, V], (K) ⇒ V, GenMap[K, V], GenMapLike[K, V, EqHashMap[K, V]], Iterable[(K, V)], Iterable[(K, V)], IterableLike[(K, V), EqHashMap[K, V]], Equals, GenIterable[(K, V)], GenIterableLike[(K, V), EqHashMap[K, V]], Traversable[(K, V)], Mutable, Traversable[(K, V)], GenTraversable[(K, V)], GenericTraversableTemplate[(K, V), Iterable], TraversableLike[(K, V), EqHashMap[K, V]], GenTraversableLike[(K, V), EqHashMap[K, V]], Parallelizable[(K, V), ParMap[K, V]], TraversableOnce[(K, V)], GenTraversableOnce[(K, V)], FilterMonadic[(K, V), EqHashMap[K, V]], HasNewBuilder[(K, V), EqHashMap[K, V]], AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EqHashMap
  2. Map
  3. MapLike
  4. Cloneable
  5. Cloneable
  6. Cloneable
  7. Shrinkable
  8. Builder
  9. Growable
  10. Clearable
  11. Map
  12. MapLike
  13. Subtractable
  14. PartialFunction
  15. Function1
  16. GenMap
  17. GenMapLike
  18. Iterable
  19. Iterable
  20. IterableLike
  21. Equals
  22. GenIterable
  23. GenIterableLike
  24. Traversable
  25. Mutable
  26. Traversable
  27. GenTraversable
  28. GenericTraversableTemplate
  29. TraversableLike
  30. GenTraversableLike
  31. Parallelizable
  32. TraversableOnce
  33. GenTraversableOnce
  34. FilterMonadic
  35. HasNewBuilder
  36. AnyRef
  37. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by MonadOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  7. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EqHashMap(other: EqHashMap[K, V])

  2. new EqHashMap(sizeHint: Int = EqHashMap.defCapacity)

Type Members

  1. class DefaultKeySet extends AbstractSet[A] with Set[A] with Serializable

    Attributes
    protected
    Definition Classes
    MapLike

  2. class DefaultValuesIterable extends AbstractIterable[B] with Iterable[B] with Serializable

    Attributes
    protected
    Definition Classes
    MapLike

  3. class EntryIterator extends EqHashMapIterator[(K, V)]

    Attributes
    protected

  4. abstract class EqHashMapIterator[A] extends Iterator[A]

    Attributes
    protected

  5. class FilteredKeys extends AbstractMap[A, B] with DefaultMap[A, B]

    Attributes
    protected
    Definition Classes
    MapLike

  6. class KeyIterator extends EqHashMapIterator[K]

    Attributes
    protected

  7. class MappedValues[C] extends AbstractMap[A, C] with DefaultMap[A, C]

    Attributes
    protected
    Definition Classes
    MapLike

  8. type Self = EqHashMap[K, V]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  9. class ValueIterator extends EqHashMapIterator[V]

    Attributes
    protected

  10. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

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

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. def +[B1 >: V](elem1: (K, B1), elem2: (K, B1), elems: (K, B1)*): Map[K, B1]

    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new map. Use += to add an element to this map and return that map itself.

  4. def +[B1 >: V](kv: (K, B1)): Map[K, B1]

    Definition Classes
    MapLike → MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) + creates a new map. Use += to add an element to this map and return that map itself.

  5. def ++[B1 >: V](xs: GenTraversableOnce[(K, B1)]): Map[K, B1]

    Definition Classes
    MapLike → MapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new map. Use ++= to add an element to this map and return that map itself.

  6. def ++[B >: (K, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  7. def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike

  8. def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike

  9. def ++=(xs: TraversableOnce[(K, V)]): EqHashMap.this.type

    Definition Classes
    Growable

  10. def +=(kv: (K, V)): EqHashMap.this.type

    Definition Classes
    EqHashMap → MapLike → Builder → Growable

  11. def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): EqHashMap.this.type

    Definition Classes
    Growable

  12. def -(elem1: K, elem2: K, elems: K*): EqHashMap[K, V]

    Definition Classes
    MapLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new map. Use -= to remove an element from this map and return that map itself.

  13. def -(key: K): EqHashMap[K, V]

    Definition Classes
    MapLike → MapLike → Subtractable → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new map. Use -= to remove an element from this map and return that map itself.

  14. def --(xs: GenTraversableOnce[K]): EqHashMap[K, V]

    Definition Classes
    MapLike → Subtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new map. Use --= to remove an element from this map and return that map itself.

  15. def --=(xs: TraversableOnce[K]): EqHashMap.this.type

    Definition Classes
    Shrinkable

  16. def -=(key: K): EqHashMap.this.type

    Definition Classes
    EqHashMap → MapLike → Shrinkable

  17. def -=(elem1: K, elem2: K, elems: K*): EqHashMap.this.type

    Definition Classes
    Shrinkable

  18. def ->[B](y: B): (EqHashMap[K, V], B)

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to ArrowAssoc[EqHashMap[K, V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  19. def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  20. def :\[B](z: B)(op: ((K, V), B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  21. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  22. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    MapLike → TraversableOnce

  23. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

  24. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce

  25. def aggregate[B](z: ⇒ B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  26. def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]

    Definition Classes
    PartialFunction → Function1

  27. final def apply(key: K): V

    Definition Classes
    EqHashMap → MapLike → Function1 → GenMapLike
    Annotations
    @inline()

  28. def applyOrElse[A1 <: K, B1 >: V](x: A1, default: (A1) ⇒ B1): B1

    Definition Classes
    PartialFunction

  29. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  30. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals

  31. def clear(): Unit

    Definition Classes
    EqHashMap → MapLike → Builder → Growable → Clearable

  32. def clone(): EqHashMap[K, V]

    Definition Classes
    EqHashMap → MapLike → Cloneable → AnyRef

  33. def collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  34. def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]

    Definition Classes
    TraversableOnce

  35. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate

  36. def compose[A](g: (A) ⇒ K): (A) ⇒ V

    Definition Classes
    Function1
    Annotations
    @unspecialized()

  37. final def contains(key: K): Boolean

    Definition Classes
    EqHashMap → MapLike → GenMapLike
    Annotations
    @inline()

  38. def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  39. def copyToArray[B >: (K, V)](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  40. def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  41. def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  42. def count(p: ((K, V)) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  43. def default(key: K): V

    Definition Classes
    MapLike → GenMapLike

  44. def drop(n: Int): EqHashMap[K, V]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  45. def dropRight(n: Int): EqHashMap[K, V]

    Definition Classes
    IterableLike

  46. def dropWhile(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]

    Definition Classes
    TraversableLike → GenTraversableLike

  47. def empty: EqHashMap[K, V]

    Definition Classes
    EqHashMap → Map → Map → MapLike

  48. def ensuring(cond: (EqHashMap[K, V]) ⇒ Boolean, msg: ⇒ Any): EqHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  49. def ensuring(cond: (EqHashMap[K, V]) ⇒ Boolean): EqHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  50. def ensuring(cond: Boolean, msg: ⇒ Any): EqHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  51. def ensuring(cond: Boolean): EqHashMap[K, V]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  52. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  53. def equals(that: Any): Boolean

    Definition Classes
    GenMapLike → Equals → AnyRef → Any

  54. def exists(p: ((K, V)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  55. def filter(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]

    Definition Classes
    TraversableLike → GenTraversableLike

  56. def filterKeys(p: (K) ⇒ Boolean): Map[K, V]

    Definition Classes
    MapLike → GenMapLike

  57. def filterNot(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  58. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  59. def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  60. def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  61. def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate

  62. def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  63. def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  64. def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  65. def forall(p: ((K, V)) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  66. def foreach[U](f: ((K, V)) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  67. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to StringFormat[EqHashMap[K, V]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  68. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate

  69. final def get(key: K): Option[V]

    Definition Classes
    EqHashMap → MapLike → GenMapLike
    Annotations
    @inline()

  70. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  71. def getOrElse[B1 >: V](key: K, default: ⇒ B1): B1

    Definition Classes
    MapLike → GenMapLike

  72. def getOrElseUpdate(key: K, op: ⇒ V): V

    Definition Classes
    MapLike

  73. def getOrNull(key: K): AnyRef

  74. def groupBy[K](f: ((K, V)) ⇒ K): Map[K, EqHashMap[K, V]]

    Definition Classes
    TraversableLike → GenTraversableLike

  75. def grouped(size: Int): Iterator[EqHashMap[K, V]]

    Definition Classes
    IterableLike

  76. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  77. def hashCode(): Int

    Definition Classes
    EqHashMap → GenMapLike → AnyRef → Any

  78. def head: (K, V)

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  79. def headOption: Option[(K, V)]

    Definition Classes
    TraversableLike → GenTraversableLike

  80. def init: EqHashMap[K, V]

    Definition Classes
    TraversableLike → GenTraversableLike

  81. def inits: Iterator[EqHashMap[K, V]]

    Definition Classes
    TraversableLike

  82. def isDefinedAt(key: K): Boolean

    Definition Classes
    MapLike → GenMapLike → PartialFunction

  83. def isEmpty: Boolean

    Definition Classes
    MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  84. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  85. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  86. def iterator: Iterator[(K, V)]

    Definition Classes
    EqHashMap → MapLike → IterableLike → GenIterableLike

  87. def keySet: Set[K]

    Definition Classes
    MapLike → GenMapLike

  88. def keys: Iterable[K]

    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) keys returns Iterable[A] rather than Iterator[A].

  89. def keysIterator: Iterator[K]

    Definition Classes
    EqHashMap → MapLike → GenMapLike

  90. def last: (K, V)

    Definition Classes
    TraversableLike → GenTraversableLike

  91. def lastOption: Option[(K, V)]

    Definition Classes
    TraversableLike → GenTraversableLike

  92. def lift: (K) ⇒ Option[V]

    Definition Classes
    PartialFunction

  93. def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  94. def mapResult[NewTo](f: (EqHashMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]

    Definition Classes
    Builder

  95. def mapValues[C](f: (V) ⇒ C): Map[K, C]

    Definition Classes
    MapLike → GenMapLike

  96. def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  97. def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  98. def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  99. def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)

    Definition Classes
    TraversableOnce → GenTraversableOnce

  100. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  101. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  102. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  103. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  104. def newBuilder: Builder[(K, V), EqHashMap[K, V]]

    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → HasNewBuilder

  105. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  106. final def notify(): Unit

    Definition Classes
    AnyRef

  107. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  108. def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction

  109. def par: ParMap[K, V]

    Definition Classes
    Parallelizable

  110. def parCombiner: Combiner[(K, V), ParMap[K, V]]

    Attributes
    protected[this]
    Definition Classes
    MapLike → MapLike → TraversableLike → Parallelizable

  111. def partition(p: ((K, V)) ⇒ Boolean): (EqHashMap[K, V], EqHashMap[K, V])

    Definition Classes
    TraversableLike → GenTraversableLike

  112. def product[B >: (K, V)](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  113. def put(key: K, value: V): Option[V]

    Definition Classes
    EqHashMap → MapLike

  114. def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B

    Definition Classes
    TraversableOnce

  116. def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  117. def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  119. def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  120. def remove(key: K): Option[V]

    Definition Classes
    EqHashMap → MapLike

  121. def repr: EqHashMap[K, V]

    Definition Classes
    TraversableLike → GenTraversableLike

  122. def result(): EqHashMap[K, V]

    Definition Classes
    MapLike → Builder

  123. def retain(p: (K, V) ⇒ Boolean): EqHashMap.this.type

    Definition Classes
    MapLike

  124. def reversed: List[(K, V)]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  125. def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean

    Definition Classes
    PartialFunction

  126. def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

  127. def scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  128. def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  129. def scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[EqHashMap[K, V], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  130. def seq: Map[K, V]

    Definition Classes
    Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  131. final def size: Int

    Definition Classes
    EqHashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @inline()

  132. def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

    Definition Classes
    Builder

  133. def sizeHint(coll: TraversableLike[_, _]): Unit

    Definition Classes
    Builder

  134. def sizeHint(size: Int): Unit

    Definition Classes
    Builder

  135. def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

    Definition Classes
    Builder

  136. def slice(from: Int, until: Int): EqHashMap[K, V]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  137. def sliding(size: Int, step: Int): Iterator[EqHashMap[K, V]]

    Definition Classes
    IterableLike

  138. def sliding(size: Int): Iterator[EqHashMap[K, V]]

    Definition Classes
    IterableLike

  139. def span(p: ((K, V)) ⇒ Boolean): (EqHashMap[K, V], EqHashMap[K, V])

    Definition Classes
    TraversableLike → GenTraversableLike

  140. def splitAt(n: Int): (EqHashMap[K, V], EqHashMap[K, V])

    Definition Classes
    TraversableLike → GenTraversableLike

  141. def stringPrefix: String

    Definition Classes
    MapLike → TraversableLike → GenTraversableLike

  142. def sum[B >: (K, V)](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  144. def tail: EqHashMap[K, V]

    Definition Classes
    TraversableLike → GenTraversableLike

  145. def tails: Iterator[EqHashMap[K, V]]

    Definition Classes
    TraversableLike

  146. def take(n: Int): EqHashMap[K, V]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  147. def takeRight(n: Int): EqHashMap[K, V]

    Definition Classes
    IterableLike

  148. def takeWhile(p: ((K, V)) ⇒ Boolean): EqHashMap[K, V]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  149. def thisCollection: Iterable[(K, V)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  150. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  151. def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  152. def toBuffer[C >: (K, V)]: Buffer[C]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

  153. def toCollection(repr: EqHashMap[K, V]): Iterable[(K, V)]

    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike

  154. def toIndexedSeq: IndexedSeq[(K, V)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  155. def toIterable: Iterable[(K, V)]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  156. def toIterator: Iterator[(K, V)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  157. def toList: List[(K, V)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  158. def toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  159. def toParArray: ParArray[T]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to CollectionsHaveToParArray[EqHashMap[K, V], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (EqHashMap[K, V]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray

  160. def toSeq: Seq[(K, V)]

    Definition Classes
    MapLike → TraversableOnce → GenTraversableOnce

  161. def toSet[B >: (K, V)]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  162. def toStream: Stream[(K, V)]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  163. def toString(): String

    Definition Classes
    MapLike → TraversableLike → Function1 → AnyRef → Any

  164. def toTraversable: Traversable[(K, V)]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  165. def toVector: Vector[(K, V)]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  166. def transform(f: (K, V) ⇒ V): EqHashMap.this.type

    Definition Classes
    MapLike

  167. def transpose[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  168. def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate

  169. def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate

  170. def update(key: K, value: V): Unit

    Definition Classes
    MapLike

  171. def updated[B1 >: V](key: K, value: B1): Map[K, B1]

    Definition Classes
    MapLike → MapLike

  172. def values: Iterable[V]

    Definition Classes
    MapLike → GenMapLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) values returns Iterable[B] rather than Iterator[B].

  173. def valuesIterator: Iterator[V]

    Definition Classes
    EqHashMap → MapLike → GenMapLike

  174. def view(from: Int, until: Int): IterableView[(K, V), EqHashMap[K, V]]

    Definition Classes
    IterableLike → TraversableLike

  175. def view: IterableView[(K, V), EqHashMap[K, V]]

    Definition Classes
    IterableLike → TraversableLike

  176. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  178. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  179. def withDefault(d: (K) ⇒ V): Map[K, V]

    Definition Classes
    Map

  180. def withDefaultValue(d: V): Map[K, V]

    Definition Classes
    Map

  181. def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), EqHashMap[K, V]]

    Definition Classes
    TraversableLike → FilterMonadic

  182. def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  183. def zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  184. def zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[EqHashMap[K, V], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

  185. def →[B](y: B): (EqHashMap[K, V], B)

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to ArrowAssoc[EqHashMap[K, V]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to any2stringadd[EqHashMap[K, V]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: any2stringadd[EqHashMap[K, V]]).+(other)
    Definition Classes
    any2stringadd

  2. def filter(p: ((K, V)) ⇒ Boolean): TraversableOnce[(K, V)]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to MonadOps[(K, V)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: MonadOps[(K, V)]).filter(p)
    Definition Classes
    MonadOps

  3. def flatMap[B](f: ((K, V)) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to MonadOps[(K, V)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: MonadOps[(K, V)]).flatMap(f)
    Definition Classes
    MonadOps

  4. def map[B](f: ((K, V)) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to MonadOps[(K, V)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: MonadOps[(K, V)]).map(f)
    Definition Classes
    MonadOps

  5. def withFilter(p: ((K, V)) ⇒ Boolean): Iterator[(K, V)]

    Implicit information
    This member is added by an implicit conversion from EqHashMap[K, V] to MonadOps[(K, V)] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (eqHashMap: MonadOps[(K, V)]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from Map[K, V]

Inherited from MapLike[K, V, EqHashMap[K, V]]

Inherited from Cloneable[EqHashMap[K, V]]

Inherited from Cloneable

Inherited from Cloneable

Inherited from Shrinkable[K]

Inherited from Builder[(K, V), EqHashMap[K, V]]

Inherited from Growable[(K, V)]

Inherited from Clearable

Inherited from Map[K, V]

Inherited from MapLike[K, V, EqHashMap[K, V]]

Inherited from Subtractable[K, EqHashMap[K, V]]

Inherited from PartialFunction[K, V]

Inherited from (K) ⇒ V

Inherited from GenMap[K, V]

Inherited from GenMapLike[K, V, EqHashMap[K, V]]

Inherited from Iterable[(K, V)]

Inherited from Iterable[(K, V)]

Inherited from IterableLike[(K, V), EqHashMap[K, V]]

Inherited from Equals

Inherited from GenIterable[(K, V)]

Inherited from GenIterableLike[(K, V), EqHashMap[K, V]]

Inherited from Traversable[(K, V)]

Inherited from Mutable

Inherited from Traversable[(K, V)]

Inherited from GenTraversable[(K, V)]

Inherited from GenericTraversableTemplate[(K, V), Iterable]

Inherited from TraversableLike[(K, V), EqHashMap[K, V]]

Inherited from GenTraversableLike[(K, V), EqHashMap[K, V]]

Inherited from Parallelizable[(K, V), ParMap[K, V]]

Inherited from TraversableOnce[(K, V)]

Inherited from GenTraversableOnce[(K, V)]

Inherited from FilterMonadic[(K, V), EqHashMap[K, V]]

Inherited from HasNewBuilder[(K, V), EqHashMap[K, V]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion CollectionsHaveToParArray from EqHashMap[K, V] to CollectionsHaveToParArray[EqHashMap[K, V], T]

Inherited by implicit conversion MonadOps from EqHashMap[K, V] to MonadOps[(K, V)]

Inherited by implicit conversion any2stringadd from EqHashMap[K, V] to any2stringadd[EqHashMap[K, V]]

Inherited by implicit conversion StringFormat from EqHashMap[K, V] to StringFormat[EqHashMap[K, V]]

Inherited by implicit conversion Ensuring from EqHashMap[K, V] to Ensuring[EqHashMap[K, V]]

Inherited by implicit conversion ArrowAssoc from EqHashMap[K, V] to ArrowAssoc[EqHashMap[K, V]]

Inherited by implicit conversion alternateImplicit from EqHashMap[K, V] to ForceImplicitAmbiguity

Ungrouped