A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/mutable/WeakHashMap.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.WeakHashMap

class WeakHashMap[K, V] extends JMapWrapper[K, V] with JMapWrapperLike[K, V, WeakHashMap, WeakHashMap[K, V]] with MapFactoryDefaults[K, V, WeakHashMap, Iterable]



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WeakHashMap
  2. JMapWrapper
  3. AbstractJMapWrapper
  4. Serializable
  5. JMapWrapperLike
  6. StrictOptimizedMapOps
  7. StrictOptimizedIterableOps
  8. AbstractMap
  9. Map
  10. MapOps
  11. Shrinkable
  12. Builder
  13. Growable
  14. Clearable
  15. Cloneable
  16. Cloneable
  17. Iterable
  18. AbstractMap
  19. Map
  20. Equals
  21. MapFactoryDefaults
  22. MapOps
  23. PartialFunction
  24. Function1
  25. AbstractIterable
  26. Iterable
  27. IterableFactoryDefaults
  28. IterableOps
  29. IterableOnceOps
  30. IterableOnce
  31. AnyRef
  32. Any
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Instance Constructors
  1.  new WeakHashMap()
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  def ++[V2 >: V](xs: IterableOnce[(K, V2)]): WeakHashMap[K, V2]
  4.  final def ++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
  5.  final def ++=(xs: IterableOnce[(K, V)]): WeakHashMap.this.type
  6.  final def +=(elem: (K, V)): WeakHashMap.this.type
  7.  final def --=(xs: IterableOnce[K]): WeakHashMap.this.type
  8.  final def -=(elem: K): WeakHashMap.this.type
  9.  def ->[B](y: B): (WeakHashMap[K, V], B)
  10.  final def ==(arg0: Any): Boolean
  11.  def addAll(xs: IterableOnce[(K, V)]): WeakHashMap.this.type
  12.  def addOne(kv: (K, V)): WeakHashMap.this.type
  13.  def addString(sb: StringBuilder, start: String, sep: String, end: String): sb.type
  14.  final def addString(b: StringBuilder): b.type
  15.  final def addString(b: StringBuilder, sep: String): b.type
  16.  def andThen[C](k: PartialFunction[V, C]): PartialFunction[K, C]
  17.  def andThen[C](k: (V) => C): PartialFunction[K, C]
  18.  def apply(key: K): V
  19.  def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) => V1): V1
  20.  final def asInstanceOf[T0]: T0
  21.  def canEqual(that: Any): Boolean
  22.  def className: String
  23.  def clear(): Unit
  24.  def clone(): WeakHashMap[K, V]
  25.  final def coll: WeakHashMap.this.type
  26.  def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): WeakHashMap[K2, V2]
  27.  def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]
  28.  def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
  29.  def compose[R](k: PartialFunction[R, K]): PartialFunction[R, V]
  30.  def compose[A](g: (A) => K): (A) => V
  31.  def concat[V2 >: V](suffix: IterableOnce[(K, V2)]): WeakHashMap[K, V2]
  32.  def concat[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
  33.  def contains(key: K): Boolean
  34.  def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Int
  35.  def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Int
  36.  def copyToArray[B >: (K, V)](xs: Array[B]): Int
  37.  def corresponds[B](that: IterableOnce[B])(p: ((K, V), B) => Boolean): Boolean
  38.  def count(p: ((K, V)) => Boolean): Int
  39.  def default(key: K): V
  40.  def drop(n: Int): WeakHashMap[K, V]
  41.  def dropRight(n: Int): WeakHashMap[K, V]
  42.  def dropWhile(p: ((K, V)) => Boolean): WeakHashMap[K, V]
  43.  def elementWise: ElementWiseExtractor[K, V]
  44.  def empty: WeakHashMap[K, V]
  45.  def ensuring(cond: (WeakHashMap[K, V]) => Boolean, msg: => Any): WeakHashMap[K, V]
  46.  def ensuring(cond: (WeakHashMap[K, V]) => Boolean): WeakHashMap[K, V]
  47.  def ensuring(cond: Boolean, msg: => Any): WeakHashMap[K, V]
  48.  def ensuring(cond: Boolean): WeakHashMap[K, V]
  49.  final def eq(arg0: AnyRef): Boolean
  50.  def equals(o: Any): Boolean
  51.  def exists(p: ((K, V)) => Boolean): Boolean
  52.  def filter(pred: ((K, V)) => Boolean): WeakHashMap[K, V]
  53.  def filterImpl(pred: ((K, V)) => Boolean, isFlipped: Boolean): WeakHashMap[K, V]
  54.  def filterInPlace(p: (K, V) => Boolean): WeakHashMap.this.type
  55.  def filterNot(pred: ((K, V)) => Boolean): WeakHashMap[K, V]
  56.  def finalize(): Unit
  57.  def find(p: ((K, V)) => Boolean): Option[(K, V)]
  58.  def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): WeakHashMap[K2, V2]
  59.  def flatMap[B](f: ((K, V)) => IterableOnce[B]): Iterable[B]
  60.  def flatten[B](implicit toIterableOnce: ((K, V)) => IterableOnce[B]): Iterable[B]
  61.  def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) => A1): A1
  62.  def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
  63.  def foldRight[B](z: B)(op: ((K, V), B) => B): B
  64.  def forall(p: ((K, V)) => Boolean): Boolean
  65.  def foreach[U](f: ((K, V)) => U): Unit
  66.  def foreachEntry[U](f: (K, V) => U): Unit
  67.  def fromSpecific(coll: IterableOnce[(K, V)]): WeakHashMap[K, V]
  68.  def get(k: K): Option[V]
  69.  final def getClass(): Class[_ <: AnyRef]
  70.  def getOrElse[V1 >: V](key: K, default: => V1): V1
  71.  def getOrElseUpdate(key: K, op: => V): V
  72.  def groupBy[K](f: ((K, V)) => K): immutable.Map[K, WeakHashMap[K, V]]
  73.  def groupMap[K, B](key: ((K, V)) => K)(f: ((K, V)) => B): immutable.Map[K, Iterable[B]]
  74.  def groupMapReduce[K, B](key: ((K, V)) => K)(f: ((K, V)) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  75.  def grouped(size: Int): Iterator[WeakHashMap[K, V]]
  76.  def hashCode(): Int
  77.  def head: (K, V)
  78.  def headOption: Option[(K, V)]
  79.  def init: WeakHashMap[K, V]
  80.  def inits: Iterator[WeakHashMap[K, V]]
  81.  def isDefinedAt(key: K): Boolean
  82.  def isEmpty: Boolean
  83.  final def isInstanceOf[T0]: Boolean
  84.  def isTraversableAgain: Boolean
  85.  def iterableFactory: IterableFactory[Iterable]
  86.  def iterator: Iterator[(K, V)]
  87.  def keySet: collection.Set[K]
  88.  def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S
  89.  def keys: collection.Iterable[K]
  90.  def keysIterator: Iterator[K]
  91.  def knownSize: Int
  92.  def last: (K, V)
  93.  def lastOption: Option[(K, V)]
  94.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, WeakHashMap.this.type]
  95.  def lift: (K) => Option[V]
  96.  def map[K2, V2](f: ((K, V)) => (K2, V2)): WeakHashMap[K2, V2]
  97.  def map[B](f: ((K, V)) => B): Iterable[B]
  98.  def mapFactory: MapFactory[WeakHashMap]
  99.  final def mapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)]): WeakHashMap[K2, V2]
  100.  def mapResult[NewTo](f: (WeakHashMap[K, V]) => NewTo): Builder[(K, V), NewTo]
  101.  def mapValuesInPlace(f: (K, V) => V): WeakHashMap.this.type
  102.  def max[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)
  103.  def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
  104.  def maxByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]
  105.  def maxOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]
  106.  def min[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)
  107.  def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
  108.  def minByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]
  109.  def minOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]
  110.  final def mkString: String
  111.  final def mkString(sep: String): String
  112.  final def mkString(start: String, sep: String, end: String): String
  113.  final def ne(arg0: AnyRef): Boolean
  114.  def newSpecificBuilder: Builder[(K, V), WeakHashMap[K, V]]
  115.  def nonEmpty: Boolean
  116.  final def notify(): Unit
  117.  final def notifyAll(): Unit
  118.  def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  119.  def partition(p: ((K, V)) => Boolean): (WeakHashMap[K, V], WeakHashMap[K, V])
  120.  def partitionMap[A1, A2](f: ((K, V)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
  121.  def product[B >: (K, V)](implicit num: math.Numeric[B]): B
  122.  def put(k: K, v: V): Option[V]
  123.  def reduce[B >: (K, V)](op: (B, B) => B): B
  124.  def reduceLeft[B >: (K, V)](op: (B, (K, V)) => B): B
  125.  def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) => B): Option[B]
  126.  def reduceOption[B >: (K, V)](op: (B, B) => B): Option[B]
  127.  def reduceRight[B >: (K, V)](op: ((K, V), B) => B): B
  128.  def reduceRightOption[B >: (K, V)](op: ((K, V), B) => B): Option[B]
  129.  def remove(k: K): Option[V]
  130.  def result(): WeakHashMap[K, V]
  131.  def reversed: collection.Iterable[(K, V)]
  132.  def runWith[U](action: (V) => U): (K) => Boolean
  133.  def scan[B >: (K, V)](z: B)(op: (B, B) => B): Iterable[B]
  134.  def scanLeft[B](z: B)(op: (B, (K, V)) => B): Iterable[B]
  135.  def scanRight[B](z: B)(op: ((K, V), B) => B): Iterable[B]
  136.  def size: Int
  137.  def sizeCompare(that: collection.Iterable[_]): Int
  138.  def sizeCompare(otherSize: Int): Int
  139.  final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit
  140.  def sizeHint(size: Int): Unit
  141.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit
  142.  final def sizeIs: SizeCompareOps
  143.  def slice(from: Int, until: Int): WeakHashMap[K, V]
  144.  def sliding(size: Int, step: Int): Iterator[WeakHashMap[K, V]]
  145.  def sliding(size: Int): Iterator[WeakHashMap[K, V]]
  146.  def span(p: ((K, V)) => Boolean): (WeakHashMap[K, V], WeakHashMap[K, V])
  147.  def splitAt(n: Int): (WeakHashMap[K, V], WeakHashMap[K, V])
  148.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S
  149.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[(K, V), B]): C2
  150.  final def strictOptimizedConcat[B >: (K, V), C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  151.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: ((K, V)) => IterableOnce[B]): C2
  152.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: ((K, V)) => IterableOnce[B]): C2
  153.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: ((K, V)) => B): C2
  154.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[((K, V), B), C2]): C2
  155.  def stringPrefix: String
  156.  def subtractAll(xs: IterableOnce[K]): WeakHashMap.this.type
  157.  def subtractOne(key: K): WeakHashMap.this.type
  158.  def sum[B >: (K, V)](implicit num: math.Numeric[B]): B
  159.  final def synchronized[T0](arg0: => T0): T0
  160.  def tail: WeakHashMap[K, V]
  161.  def tails: Iterator[WeakHashMap[K, V]]
  162.  def take(n: Int): WeakHashMap[K, V]
  163.  def takeRight(n: Int): WeakHashMap[K, V]
  164.  def takeWhile(p: ((K, V)) => Boolean): WeakHashMap[K, V]
  165.  def tapEach[U](f: ((K, V)) => U): WeakHashMap[K, V]
  166.  def to[C1](factory: Factory[(K, V), C1]): C1
  167.  def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
  168.  final def toBuffer[B >: (K, V)]: Buffer[B]
  169.  def toIndexedSeq: immutable.IndexedSeq[(K, V)]
  170.  def toList: immutable.List[(K, V)]
  171.  def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
  172.  def toSeq: immutable.Seq[(K, V)]
  173.  def toSet[B >: (K, V)]: immutable.Set[B]
  174.  def toString(): String
  175.  def toVector: immutable.Vector[(K, V)]
  176.  def transpose[B](implicit asIterable: ((K, V)) => collection.Iterable[B]): Iterable[Iterable[B]]
  177.  def unapply(a: K): Option[V]
  178.  val underlying: java.util.Map[K, V]
  179.  def unlift: PartialFunction[K, B]
  180.  def unzip[A1, A2](implicit asPair: ((K, V)) => (A1, A2)): (Iterable[A1], Iterable[A2])
  181.  def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
  182.  def update(k: K, v: V): Unit
  183.  def updateWith(key: K)(remappingFunction: (Option[V]) => Option[V]): Option[V]
  184.  def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[V, S]): S
  185.  def values: collection.Iterable[V]
  186.  def valuesIterator: Iterator[V]
  187.  def view: MapView[K, V]
  188.  final def wait(): Unit
  189.  final def wait(arg0: Long, arg1: Int): Unit
  190.  final def wait(arg0: Long): Unit
  191.  def withDefault(d: (K) => V): Map[K, V]
  192.  def withDefaultValue(d: V): Map[K, V]
  193.  def withFilter(p: ((K, V)) => Boolean): MapOps.WithFilter[K, V, [x]Iterable[x], [x, y]WeakHashMap[x, y]]
  194.  def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]
  195.  def zipAll[A1 >: (K, V), B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
  196.  def zipWithIndex: Iterable[((K, V), Int)]
Deprecated Value Members
  1.  def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): WeakHashMap[K, V1]
  2.  def +[V1 >: V](kv: (K, V1)): WeakHashMap[K, V1]
  3.  def ++:[V1 >: V](that: IterableOnce[(K, V1)]): WeakHashMap[K, V1]
  4.  def ++:[B >: (K, V)](that: IterableOnce[B]): Iterable[B]
  5.  final def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): WeakHashMap.this.type
  6.  final def -(key1: K, key2: K, keys: K*): WeakHashMap[K, V]
  7.  final def -(key: K): WeakHashMap[K, V]
  8.  def --(keys: IterableOnce[K]): WeakHashMap[K, V]
  9.  def -=(elem1: K, elem2: K, elems: K*): WeakHashMap.this.type
  10.  def /:[B](z: B)(op: (B, (K, V)) => B): B
  11.  final def /:[B](z: B)(op: (B, (K, V)) => B): B
  12.  def :\[B](z: B)(op: ((K, V), B) => B): B
  13.  final def :\[B](z: B)(op: ((K, V), B) => B): B
  14.  def aggregate[B](z: => B)(seqop: (B, (K, V)) => B, combop: (B, B) => B): B
  15.  def collectFirst[B](f: PartialFunction[(K, V), B]): Option[B]
  16.  def companion: IterableFactory[[_]Iterable[_]]
  17.  def copyToBuffer(dest: Buffer[(K, V)]): Unit
  18.  final def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
  19.  def count(f: ((K, V)) => Boolean): Int
  20.  def exists(f: ((K, V)) => Boolean): Boolean
  21.  def filter(f: ((K, V)) => Boolean): Iterator[(K, V)]
  22.  def filterKeys(p: (K) => Boolean): MapView[K, V]
  23.  def find(p: ((K, V)) => Boolean): Option[(K, V)]
  24.  def flatMap[B](f: ((K, V)) => IterableOnce[B]): IterableOnce[B]
  25.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  26.  def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
  27.  def foldRight[B](z: B)(op: ((K, V), B) => B): B
  28.  def forall(f: ((K, V)) => Boolean): Boolean
  29.  def foreach[U](f: ((K, V)) => U): Unit
  30.  def formatted(fmtstr: String): String
  31.  def hasDefiniteSize: Boolean
  32.  def isEmpty: Boolean
  33.  def map[B](f: ((K, V)) => B): IterableOnce[B]
  34.  def mapValues[W](f: (V) => W): MapView[K, W]
  35.  def max(implicit ord: math.Ordering[(K, V)]): (K, V)
  36.  def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
  37.  def min(implicit ord: math.Ordering[(K, V)]): (K, V)
  38.  def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
  39.  def mkString: String
  40.  def mkString(sep: String): String
  41.  def mkString(start: String, sep: String, end: String): String
  42.  def nonEmpty: Boolean
  43.  def product(implicit num: math.Numeric[(K, V)]): (K, V)
  44.  def reduce(f: ((K, V), (K, V)) => (K, V)): (K, V)
  45.  def reduceLeft(f: ((K, V), (K, V)) => (K, V)): (K, V)
  46.  def reduceLeftOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
  47.  def reduceOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
  48.  def reduceRight(f: ((K, V), (K, V)) => (K, V)): (K, V)
  49.  def reduceRightOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
  50.  final def repr: WeakHashMap[K, V]
  51.  final def retain(p: (K, V) => Boolean): WeakHashMap.this.type
  52.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  53.  def seq: WeakHashMap.this.type
  54.  def size: Int
  55.  def sum(implicit num: math.Numeric[(K, V)]): (K, V)
  56.  def to[C1](factory: Factory[(K, V), C1]): C1
  57.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  58.  def toBuffer[B >: A]: Buffer[B]
  59.  def toIndexedSeq: collection.IndexedSeq[(K, V)]
  60.  final def toIterable: collection.Iterable[(K, V)]
  61.  final def toIterable: WeakHashMap.this.type
  62.  def toIterator: Iterator[(K, V)]
  63.  final def toIterator: Iterator[(K, V)]
  64.  def toList: immutable.List[(K, V)]
  65.  def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
  66.  def toSeq: immutable.Seq[(K, V)]
  67.  def toSet[B >: A]: immutable.Set[B]
  68.  def toStream: immutable.Stream[(K, V)]
  69.  final def toStream: immutable.Stream[(K, V)]
  70.  final def toTraversable: collection.Traversable[(K, V)]
  71.  final def toTraversable: collection.Traversable[(K, V)]
  72.  def toVector: immutable.Vector[(K, V)]
  73.  final def transform(f: (K, V) => V): WeakHashMap.this.type
  74.  def updated[V1 >: V](key: K, value: V1): WeakHashMap[K, V1]
  75.  def view(from: Int, until: Int): View[(K, V)]
  76.  def withFilter(f: ((K, V)) => Boolean): Iterator[(K, V)]
  77.  def →[B](y: B): (WeakHashMap[K, V], B)

Inherited from JMapWrapper[K, V]

Inherited from AbstractJMapWrapper[K, V]

Inherited from (K) => V

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4