Scala Standard Library 2.13.1 - scala.collection.IndexedSeqView.Map (original) (raw)
class Map[A, B] extends SeqView.Map[A, B] with IndexedSeqView[B]
Ordering
- Alphabetic
- By Inheritance
Inherited
- Map
- IndexedSeqView
- IndexedSeqOps
- Map
- SeqView
- SeqOps
- Map
- AbstractView
- View
- Serializable
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
Implicitly
by iterableOnceExtensionMethods
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
Hide All
Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def +(other: String): String
- final def ++[B >: B](suffix: IterableOnce[B]): View[B]
- final def ++:[B >: B](prefix: IterableOnce[B]): View[B]
- final def +:[B >: B](elem: B): View[B]
- def ->[B](y: B): (Map[A, B], B)
- final def :+[B >: B](elem: B): View[B]
- final def :++[B >: B](suffix: IterableOnce[B]): View[B]
- final def ==(arg0: Any): Boolean
- final def addString(b: mutable.StringBuilder): mutable.StringBuilder
- final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
- def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
- def appended[B >: B](elem: B): IndexedSeqView[B]
- def appendedAll[B >: B](suffix: SomeIndexedSeqOps[B]): IndexedSeqView[B]
- def appendedAll[B >: B](suffix: SomeSeqOps[B]): SeqView[B]
- def appendedAll[B >: B](suffix: IterableOnce[B]): View[B]
- def apply(idx: Int): B
- final def asInstanceOf[T0]: T0
- def className: String
- def clone(): AnyRef
- final def coll: Map.this.type
- def collect[B](pf: PartialFunction[B, B]): View[B]
- def collectFirst[B](pf: PartialFunction[B, B]): Option[B]
- def combinations(n: Int): Iterator[View[B]]
- def concat[B >: B](suffix: SomeIndexedSeqOps[B]): IndexedSeqView[B]
- def concat[B >: B](suffix: SomeSeqOps[B]): SeqView[B]
- final def concat[B >: B](suffix: IterableOnce[B]): View[B]
- def contains[A1 >: B](elem: A1): Boolean
- def containsSlice[B](that: Seq[B]): Boolean
- def copyToArray[B >: B](xs: Array[B], start: Int, len: Int): Int
- def copyToArray[B >: B](xs: Array[B], start: Int): Int
- def copyToArray[B >: B](xs: Array[B]): Int
- def corresponds[B](that: Seq[B])(p: (B, B) => Boolean): Boolean
- def corresponds[B](that: IterableOnce[B])(p: (B, B) => Boolean): Boolean
- def count(p: (B) => Boolean): Int
- def diff[B >: B](that: Seq[B]): View[B]
- def distinct: View[B]
- def distinctBy[B](f: (B) => B): View[B]
- def drop(n: Int): IndexedSeqView[B]
- def dropRight(n: Int): IndexedSeqView[B]
- def dropWhile(p: (B) => Boolean): View[B]
- def empty: View[B]
- def endsWith[B >: B](that: Iterable[B]): Boolean
- def ensuring(cond: (Map[A, B]) => Boolean, msg: => Any): Map[A, B]
- def ensuring(cond: (Map[A, B]) => Boolean): Map[A, B]
- def ensuring(cond: Boolean, msg: => Any): Map[A, B]
- def ensuring(cond: Boolean): Map[A, B]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def exists(p: (B) => Boolean): Boolean
- def filter(pred: (B) => Boolean): View[B]
- def filterNot(pred: (B) => Boolean): View[B]
- def finalize(): Unit
- def find(p: (B) => Boolean): Option[B]
- def findLast(p: (B) => Boolean): Option[B]
- def flatMap[B](f: (B) => IterableOnce[B]): View[B]
- def flatten[B](implicit asIterable: (B) => IterableOnce[B]): View[B]
- def fold[A1 >: B](z: A1)(op: (A1, A1) => A1): A1
- def foldLeft[B](z: B)(op: (B, B) => B): B
- def foldRight[B](z: B)(op: (B, B) => B): B
- def forall(p: (B) => Boolean): Boolean
- def foreach[U](f: (B) => U): Unit
- def formatted(fmtstr: String): String
- def fromSpecific(coll: IterableOnce[B]): View[B]
- final def getClass(): Class[_ <: AnyRef]
- def groupBy[K](f: (B) => K): immutable.Map[K, View[B]]
- def groupMap[K, B](key: (B) => K)(f: (B) => B): immutable.Map[K, View[B]]
- def groupMapReduce[K, B](key: (B) => K)(f: (B) => B)(reduce: (B, B) => B): immutable.Map[K, B]
- def grouped(size: Int): Iterator[View[B]]
- def hashCode(): Int
- def head: B
- def headOption: Option[B]
- def indexOf[B >: B](elem: B): Int
- def indexOf[B >: B](elem: B, from: Int): Int
- def indexOfSlice[B >: B](that: Seq[B]): Int
- def indexOfSlice[B >: B](that: Seq[B], from: Int): Int
- def indexWhere(p: (B) => Boolean): Int
- def indexWhere(p: (B) => Boolean, from: Int): Int
- def indices: immutable.Range
- def init: View[B]
- def inits: Iterator[View[B]]
- def intersect[B >: B](that: Seq[B]): View[B]
- def isDefinedAt(idx: Int): Boolean
- def isEmpty: Boolean
- final def isInstanceOf[T0]: Boolean
- def isTraversableAgain: Boolean
- def iterableFactory: IterableFactory[View]
- def iterator: Iterator[B]
- def knownSize: Int
- def last: B
- def lastIndexOf[B >: B](elem: B, end: Int = length - 1): Int
- def lastIndexOfSlice[B >: B](that: Seq[B]): Int
- def lastIndexOfSlice[B >: B](that: Seq[B], end: Int): Int
- def lastIndexWhere(p: (B) => Boolean): Int
- def lastIndexWhere(p: (B) => Boolean, end: Int): Int
- def lastOption: Option[B]
- def lazyZip[B](that: Iterable[B]): LazyZip2[B, B, Map.this.type]
- def length: Int
- final def lengthCompare(that: Iterable[_]): Int
- final def lengthCompare(len: Int): Int
- final def lengthIs: SizeCompareOps
- def map[B](f: (B) => B): IndexedSeqView[B]
- def max[B >: B](implicit ord: math.Ordering[B]): B
- def maxBy[B](f: (B) => B)(implicit cmp: math.Ordering[B]): B
- def maxByOption[B](f: (B) => B)(implicit cmp: math.Ordering[B]): Option[B]
- def maxOption[B >: B](implicit ord: math.Ordering[B]): Option[B]
- def min[B >: B](implicit ord: math.Ordering[B]): B
- def minBy[B](f: (B) => B)(implicit cmp: math.Ordering[B]): B
- def minByOption[B](f: (B) => B)(implicit cmp: math.Ordering[B]): Option[B]
- def minOption[B >: B](implicit ord: math.Ordering[B]): Option[B]
- final def mkString: String
- final def mkString(sep: String): String
- final def mkString(start: String, sep: String, end: String): String
- final def ne(arg0: AnyRef): Boolean
- def newSpecificBuilder: Builder[B, View[B]]
- def nonEmpty: Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def occCounts[B](sq: Seq[B]): mutable.Map[B, Int]
- def padTo[B >: B](len: Int, elem: B): View[B]
- def partition(p: (B) => Boolean): (View[B], View[B])
- def partitionMap[A1, A2](f: (B) => Either[A1, A2]): (View[A1], View[A2])
- def patch[B >: B](from: Int, other: IterableOnce[B], replaced: Int): View[B]
- def permutations: Iterator[View[B]]
- def prepended[B >: B](elem: B): IndexedSeqView[B]
- def prependedAll[B >: B](prefix: SomeIndexedSeqOps[B]): IndexedSeqView[B]
- def prependedAll[B >: B](prefix: SomeSeqOps[B]): SeqView[B]
- def prependedAll[B >: B](prefix: IterableOnce[B]): View[B]
- def product[B >: B](implicit num: math.Numeric[B]): B
- def reduce[B >: B](op: (B, B) => B): B
- def reduceLeft[B >: B](op: (B, B) => B): B
- def reduceLeftOption[B >: B](op: (B, B) => B): Option[B]
- def reduceOption[B >: B](op: (B, B) => B): Option[B]
- def reduceRight[B >: B](op: (B, B) => B): B
- def reduceRightOption[B >: B](op: (B, B) => B): Option[B]
- def reverse: IndexedSeqView[B]
- def reverseIterator: Iterator[B]
- def reversed: Iterable[B]
- def sameElements[B >: B](that: IterableOnce[B]): Boolean
- def scan[B >: B](z: B)(op: (B, B) => B): View[B]
- def scanLeft[B](z: B)(op: (B, B) => B): View[B]
- def scanRight[B](z: B)(op: (B, B) => B): View[B]
- def search[B >: B](elem: B, from: Int, to: Int)(implicit ord: math.Ordering[B]): SearchResult
- def search[B >: B](elem: B)(implicit ord: math.Ordering[B]): SearchResult
- def segmentLength(p: (B) => Boolean, from: Int): Int
- final def segmentLength(p: (B) => Boolean): Int
- final def size: Int
- final def sizeCompare(that: Iterable[_]): Int
- final def sizeCompare(otherSize: Int): Int
- final def sizeIs: SizeCompareOps
- def slice(from: Int, until: Int): IndexedSeqView[B]
- def sliding(size: Int, step: Int): Iterator[View[B]]
- def sliding(size: Int): Iterator[View[B]]
- def sortBy[B](f: (B) => B)(implicit ord: Ordering[B]): View[B]
- def sortWith(lt: (B, B) => Boolean): View[B]
- def sorted[B >: B](implicit ord: Ordering[B]): SeqView[B]
- def span(p: (B) => Boolean): (View[B], View[B])
- def splitAt(n: Int): (View[B], View[B])
- def startsWith[B >: B](that: IterableOnce[B], offset: Int = 0): Boolean
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[B, S]): S with EfficientSplit
- def stringPrefix: String
- def sum[B >: B](implicit num: math.Numeric[B]): B
- final def synchronized[T0](arg0: => T0): T0
- def tail: View[B]
- def tails: Iterator[View[B]]
- def take(n: Int): IndexedSeqView[B]
- def takeRight(n: Int): IndexedSeqView[B]
- def takeWhile(p: (B) => Boolean): View[B]
- def tapEach[U](f: (B) => U): IndexedSeqView[B]
- def to[C1](factory: Factory[B, C1]): C1
- def toArray[B >: B](implicit arg0: ClassTag[B]): Array[B]
- final def toBuffer[B >: B]: Buffer[B]
- def toIndexedSeq: immutable.IndexedSeq[B]
- final def toIterable: Map.this.type
- def toList: immutable.List[B]
- def toMap[K, V](implicit ev: <:<[B, (K, V)]): immutable.Map[K, V]
- def toSeq: immutable.Seq[B]
- def toSet[B >: B]: immutable.Set[B]
- def toString(): String
- def toVector: immutable.Vector[B]
- def transpose[B](implicit asIterable: (B) => Iterable[B]): View[View[B]]
- def unzip[A1, A2](implicit asPair: (B) => (A1, A2)): (View[A1], View[A2])
- def unzip3[A1, A2, A3](implicit asTriple: (B) => (A1, A2, A3)): (View[A1], View[A2], View[A3])
- def updated[B >: B](index: Int, elem: B): View[B]
- def view: IndexedSeqView[B]
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def withFilter(p: (B) => Boolean): WithFilter[B, [_]View[_]]
- def zip[B](that: IterableOnce[B]): View[(B, B)]
- def zipAll[A1 >: B, B](that: Iterable[B], thisElem: A1, thatElem: B): View[(A1, B)]
- def zipWithIndex: View[(B, Int)]
Deprecated Value Members
- def /:[B](z: B)(op: (B, B) => B): B
- final def /:[B](z: B)(op: (B, B) => B): B
- def :\[B](z: B)(op: (B, B) => B): B
- final def :\[B](z: B)(op: (B, B) => B): B
- def aggregate[B](z: => B)(seqop: (B, B) => B, combop: (B, B) => B): B
- def collectFirst[B](f: PartialFunction[B, B]): Option[B]
- def companion: IterableFactory[[_]View[_]]
- def copyToBuffer(dest: Buffer[B]): Unit
- final def copyToBuffer[B >: B](dest: Buffer[B]): Unit
- def count(f: (B) => Boolean): Int
- def exists(f: (B) => Boolean): Boolean
- def filter(f: (B) => Boolean): Iterator[B]
- def find(p: (B) => Boolean): Option[B]
- def flatMap[B](f: (B) => IterableOnce[B]): IterableOnce[B]
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- def foldLeft[B](z: B)(op: (B, B) => B): B
- def foldRight[B](z: B)(op: (B, B) => B): B
- def forall(f: (B) => Boolean): Boolean
- def force: IndexedSeq[B]
- def foreach[U](f: (B) => U): Unit
- def hasDefiniteSize: Boolean
- def isEmpty: Boolean
- def map[B](f: (B) => B): IterableOnce[B]
- def max(implicit ord: math.Ordering[B]): B
- def maxBy[B](f: (B) => B)(implicit cmp: math.Ordering[B]): B
- def min(implicit ord: math.Ordering[B]): B
- def minBy[B](f: (B) => B)(implicit cmp: math.Ordering[B]): B
- def mkString: String
- def mkString(sep: String): String
- def mkString(start: String, sep: String, end: String): String
- def nonEmpty: Boolean
- final def prefixLength(p: (B) => Boolean): Int
- def product(implicit num: math.Numeric[B]): B
- def reduce(f: (B, B) => B): B
- def reduceLeft(f: (B, B) => B): B
- def reduceLeftOption(f: (B, B) => B): Option[B]
- def reduceOption(f: (B, B) => B): Option[B]
- def reduceRight(f: (B, B) => B): B
- def reduceRightOption(f: (B, B) => B): Option[B]
- final def repr: View[B]
- def reverseMap[B](f: (B) => B): View[B]
- def sameElements[B >: A](that: IterableOnce[B]): Boolean
- def seq: Map.this.type
- def size: Int
- def sum(implicit num: math.Numeric[B]): B
- def to[C1](factory: Factory[B, C1]): C1
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- def toBuffer[B >: A]: Buffer[B]
- def toIndexedSeq: IndexedSeq[B]
- final def toIterable: Iterable[B]
- def toIterator: Iterator[B]
- final def toIterator: Iterator[B]
- def toList: immutable.List[B]
- def toMap[K, V](implicit ev: <:<[B, (K, V)]): immutable.Map[K, V]
- def toSeq: immutable.Seq[B]
- def toSet[B >: A]: immutable.Set[B]
- def toStream: immutable.Stream[B]
- final def toStream: immutable.Stream[B]
- final def toTraversable: Traversable[B]
- final def toTraversable: Traversable[B]
- def toVector: immutable.Vector[B]
- final def union[B >: B](that: Seq[B]): View[B]
- def view(from: Int, until: Int): IndexedSeqView[B]
- def withFilter(f: (B) => Boolean): Iterator[B]
- def →[B](y: B): (Map[A, B], B)