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/immutable/ListMap.html below:

Scala Standard Library 2.13.10 - scala.collection.immutable.ListMap

sealed class ListMap[K, +V] extends AbstractMap[K, V] with SeqMap[K, V] with StrictOptimizedMapOps[K, V, ListMap, ListMap[K, V]] with MapFactoryDefaults[K, V, ListMap, Iterable] with DefaultSerializable



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