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/concurrent/TrieMap.html below:

Scala Standard Library 2.13.10 - scala.collection.concurrent.TrieMap

final class TrieMap[K, V] extends mutable.AbstractMap[K, V] with Map[K, V] with mutable.MapOps[K, V, TrieMap, TrieMap[K, V]] with MapFactoryDefaults[K, V, TrieMap, mutable.Iterable] with DefaultSerializable



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

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