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.4/scala/collection/immutable/Map$$WithDefault.html below:

Scala Standard Library 2.13.4 - scala.collection.immutable.Map.WithDefault

class WithDefault[K, +V] extends AbstractMap[K, V] with MapOps[K, V, Map, WithDefault[K, V]] with Serializable



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