Scala Standard Library 2.13.1 - scala.collection.immutable.MapOps.ImmutableKeySet (original) (raw)
class ImmutableKeySet extends AbstractSet[K] with GenKeySet with DefaultSerializable
Ordering
- Alphabetic
- By Inheritance
Inherited
- ImmutableKeySet
- DefaultSerializable
- Serializable
- GenKeySet
- AbstractSet
- Set
- SetOps
- Iterable
- AbstractSet
- Set
- Equals
- SetOps
- Function1
- 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
Instance Constructors
- new ImmutableKeySet()
Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- final def &(that: collection.Set[K]): Set[K]
- final def &~(that: collection.Set[K]): Set[K]
- final def +(elem: K): Set[K]
- final def ++(that: IterableOnce[K]): Set[K]
- final def ++[B >: K](suffix: IterableOnce[B]): Set[B]
- final def -(elem: K): Set[K]
- final def --(that: IterableOnce[K]): Set[K]
- def ->[B](y: B): (ImmutableKeySet, 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 andThen[A](g: (Boolean) => A): (K) => A
- final def apply(elem: K): Boolean
- final def asInstanceOf[T0]: T0
- def canEqual(that: Any): Boolean
- def className: String
- def clone(): AnyRef
- final def coll: ImmutableKeySet.this.type
- def collect[B](pf: PartialFunction[K, B]): Set[B]
- def collectFirst[B](pf: PartialFunction[K, B]): Option[B]
- def compose[A](g: (A) => K): (A) => Boolean
- def concat(that: IterableOnce[K]): Set[K]
- def concat[B >: K](suffix: IterableOnce[B]): Set[B]
- def contains(key: K): Boolean
- def copyToArray[B >: K](xs: Array[B], start: Int, len: Int): Int
- def copyToArray[B >: K](xs: Array[B], start: Int): Int
- def copyToArray[B >: K](xs: Array[B]): Int
- def corresponds[B](that: IterableOnce[B])(p: (K, B) => Boolean): Boolean
- def count(p: (K) => Boolean): Int
- def diff(that: collection.Set[K]): Set[K]
- def drop(n: Int): Set[K]
- def dropRight(n: Int): Set[K]
- def dropWhile(p: (K) => Boolean): Set[K]
- def empty: Set[K]
- def ensuring(cond: (ImmutableKeySet) => Boolean, msg: => Any): ImmutableKeySet
- def ensuring(cond: (ImmutableKeySet) => Boolean): ImmutableKeySet
- def ensuring(cond: Boolean, msg: => Any): ImmutableKeySet
- def ensuring(cond: Boolean): ImmutableKeySet
- final def eq(arg0: AnyRef): Boolean
- def equals(that: Any): Boolean
- def excl(elem: K): Set[K]
- def exists(p: (K) => Boolean): Boolean
- def filter(pred: (K) => Boolean): Set[K]
- def filterNot(pred: (K) => Boolean): Set[K]
- def finalize(): Unit
- def find(p: (K) => Boolean): Option[K]
- def flatMap[B](f: (K) => IterableOnce[B]): Set[B]
- def flatten[B](implicit asIterable: (K) => IterableOnce[B]): Set[B]
- def fold[A1 >: K](z: A1)(op: (A1, A1) => A1): A1
- def foldLeft[B](z: B)(op: (B, K) => B): B
- def foldRight[B](z: B)(op: (K, B) => B): B
- def forall(p: (K) => Boolean): Boolean
- def foreach[U](f: (K) => U): Unit
- def formatted(fmtstr: String): String
- def fromSpecific(coll: IterableOnce[K]): Set[K]
- final def getClass(): Class[_ <: AnyRef]
- def groupBy[K](f: (K) => K): Map[K, Set[K]]
- def groupMap[K, B](key: (K) => K)(f: (K) => B): Map[K, Set[B]]
- def groupMapReduce[K, B](key: (K) => K)(f: (K) => B)(reduce: (B, B) => B): Map[K, B]
- def grouped(size: Int): Iterator[Set[K]]
- def hashCode(): Int
- def head: K
- def headOption: Option[K]
- def incl(elem: K): Set[K]
- def init: Set[K]
- def inits: Iterator[Set[K]]
- def intersect(that: collection.Set[K]): Set[K]
- def isEmpty: Boolean
- final def isInstanceOf[T0]: Boolean
- def isTraversableAgain: Boolean
- def iterableFactory: IterableFactory[Set]
- def iterator: Iterator[K]
- def knownSize: Int
- def last: K
- def lastOption: Option[K]
- def lazyZip[B](that: collection.Iterable[B]): LazyZip2[K, B, ImmutableKeySet.this.type]
- def map[B](f: (K) => B): Set[B]
- def max[B >: K](implicit ord: math.Ordering[B]): K
- def maxBy[B](f: (K) => B)(implicit cmp: math.Ordering[B]): K
- def maxByOption[B](f: (K) => B)(implicit cmp: math.Ordering[B]): Option[K]
- def maxOption[B >: K](implicit ord: math.Ordering[B]): Option[K]
- def min[B >: K](implicit ord: math.Ordering[B]): K
- def minBy[B](f: (K) => B)(implicit cmp: math.Ordering[B]): K
- def minByOption[B](f: (K) => B)(implicit cmp: math.Ordering[B]): Option[K]
- def minOption[B >: K](implicit ord: math.Ordering[B]): Option[K]
- 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[K, Set[K]]
- def nonEmpty: Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def partition(p: (K) => Boolean): (Set[K], Set[K])
- def partitionMap[A1, A2](f: (K) => Either[A1, A2]): (Set[A1], Set[A2])
- def product[B >: K](implicit num: math.Numeric[B]): B
- def reduce[B >: K](op: (B, B) => B): B
- def reduceLeft[B >: K](op: (B, K) => B): B
- def reduceLeftOption[B >: K](op: (B, K) => B): Option[B]
- def reduceOption[B >: K](op: (B, B) => B): Option[B]
- def reduceRight[B >: K](op: (K, B) => B): B
- def reduceRightOption[B >: K](op: (K, B) => B): Option[B]
- def removedAll(that: IterableOnce[K]): Set[K]
- def reversed: collection.Iterable[K]
- def scan[B >: K](z: B)(op: (B, B) => B): Set[B]
- def scanLeft[B](z: B)(op: (B, K) => B): Set[B]
- def scanRight[B](z: B)(op: (K, B) => B): Set[B]
- def size: Int
- def sizeCompare(that: collection.Iterable[_]): Int
- def sizeCompare(otherSize: Int): Int
- final def sizeIs: SizeCompareOps
- def slice(from: Int, until: Int): Set[K]
- def sliding(size: Int, step: Int): Iterator[Set[K]]
- def sliding(size: Int): Iterator[Set[K]]
- def span(p: (K) => Boolean): (Set[K], Set[K])
- def splitAt(n: Int): (Set[K], Set[K])
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S
- def stringPrefix: String
- def subsetOf(that: collection.Set[K]): Boolean
- def subsets(): Iterator[Set[K]]
- def subsets(len: Int): Iterator[Set[K]]
- def sum[B >: K](implicit num: math.Numeric[B]): B
- final def synchronized[T0](arg0: => T0): T0
- def tail: Set[K]
- def tails: Iterator[Set[K]]
- def take(n: Int): Set[K]
- def takeRight(n: Int): Set[K]
- def takeWhile(p: (K) => Boolean): Set[K]
- def tapEach[U](f: (K) => U): Set[K]
- def to[C1](factory: Factory[K, C1]): C1
- def toArray[B >: K](implicit arg0: ClassTag[B]): Array[B]
- final def toBuffer[B >: K]: Buffer[B]
- def toIndexedSeq: IndexedSeq[K]
- final def toIterable: ImmutableKeySet.this.type
- def toList: List[K]
- def toMap[K, V](implicit ev: <:<[K, (K, V)]): Map[K, V]
- def toSeq: Seq[K]
- def toSet[B >: K]: Set[B]
- def toString(): String
- def toVector: Vector[K]
- def transpose[B](implicit asIterable: (K) => collection.Iterable[B]): Set[Set[B]]
- final def union(that: collection.Set[K]): Set[K]
- def unzip[A1, A2](implicit asPair: (K) => (A1, A2)): (Set[A1], Set[A2])
- def unzip3[A1, A2, A3](implicit asTriple: (K) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
- def view: View[K]
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def withFilter(p: (K) => Boolean): WithFilter[K, [_]Set[_]]
- def writeReplace(): AnyRef
- def zip[B](that: IterableOnce[B]): Set[(K, B)]
- def zipAll[A1 >: K, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
- def zipWithIndex: Set[(K, Int)]
- final def |(that: collection.Set[K]): Set[K]
Deprecated Value Members
- def +(elem1: K, elem2: K, elems: K*): Set[K]
- def ++:[B >: K](that: IterableOnce[B]): Set[B]
- def -(elem1: K, elem2: K, elems: K*): Set[K]
- def /:[B](z: B)(op: (B, K) => B): B
- final def /:[B](z: B)(op: (B, K) => B): B
- def :\[B](z: B)(op: (K, B) => B): B
- final def :\[B](z: B)(op: (K, B) => B): B
- def aggregate[B](z: => B)(seqop: (B, K) => B, combop: (B, B) => B): B
- def collectFirst[B](f: PartialFunction[K, B]): Option[B]
- def companion: IterableFactory[[_]Set[_]]
- def copyToBuffer(dest: Buffer[K]): Unit
- final def copyToBuffer[B >: K](dest: Buffer[B]): Unit
- def count(f: (K) => Boolean): Int
- def exists(f: (K) => Boolean): Boolean
- def filter(f: (K) => Boolean): Iterator[K]
- def find(p: (K) => Boolean): Option[K]
- def flatMap[B](f: (K) => IterableOnce[B]): IterableOnce[B]
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- def foldLeft[B](z: B)(op: (B, K) => B): B
- def foldRight[B](z: B)(op: (K, B) => B): B
- def forall(f: (K) => Boolean): Boolean
- def foreach[U](f: (K) => U): Unit
- def hasDefiniteSize: Boolean
- def isEmpty: Boolean
- def map[B](f: (K) => B): IterableOnce[B]
- def max(implicit ord: math.Ordering[K]): K
- def maxBy[B](f: (K) => B)(implicit cmp: math.Ordering[B]): K
- def min(implicit ord: math.Ordering[K]): K
- def minBy[B](f: (K) => B)(implicit cmp: math.Ordering[B]): K
- def mkString: String
- def mkString(sep: String): String
- def mkString(start: String, sep: String, end: String): String
- def nonEmpty: Boolean
- def product(implicit num: math.Numeric[K]): K
- def reduce(f: (K, K) => K): K
- def reduceLeft(f: (K, K) => K): K
- def reduceLeftOption(f: (K, K) => K): Option[K]
- def reduceOption(f: (K, K) => K): Option[K]
- def reduceRight(f: (K, K) => K): K
- def reduceRightOption(f: (K, K) => K): Option[K]
- final def repr: Set[K]
- def sameElements[B >: A](that: IterableOnce[B]): Boolean
- def seq: ImmutableKeySet.this.type
- def size: Int
- def sum(implicit num: math.Numeric[K]): K
- def to[C1](factory: Factory[K, C1]): C1
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- def toBuffer[B >: A]: Buffer[B]
- def toIndexedSeq: collection.IndexedSeq[K]
- final def toIterable: collection.Iterable[K]
- def toIterator: Iterator[K]
- final def toIterator: Iterator[K]
- def toList: List[K]
- def toMap[K, V](implicit ev: <:<[K, (K, V)]): Map[K, V]
- def toSeq: Seq[K]
- def toSet[B >: A]: Set[B]
- def toStream: Stream[K]
- final def toStream: Stream[K]
- final def toTraversable: collection.Traversable[K]
- final def toTraversable: collection.Traversable[K]
- def toVector: Vector[K]
- def view(from: Int, until: Int): View[K]
- def withFilter(f: (K) => Boolean): Iterator[K]
- def →[B](y: B): (ImmutableKeySet, B)