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/mutable/LinkedHashSet.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.LinkedHashSet

class LinkedHashSet[A] extends AbstractSet[A] with SetOps[A, LinkedHashSet, LinkedHashSet[A]] with StrictOptimizedIterableOps[A, LinkedHashSet, LinkedHashSet[A]] with IterableFactoryDefaults[A, LinkedHashSet] with DefaultSerializable



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LinkedHashSet
  2. DefaultSerializable
  3. Serializable
  4. StrictOptimizedIterableOps
  5. AbstractSet
  6. Set
  7. SetOps
  8. Shrinkable
  9. Builder
  10. Growable
  11. Clearable
  12. Cloneable
  13. Cloneable
  14. Iterable
  15. AbstractSet
  16. Set
  17. Equals
  18. SetOps
  19. Function1
  20. AbstractIterable
  21. Iterable
  22. IterableFactoryDefaults
  23. IterableOps
  24. IterableOnceOps
  25. IterableOnce
  26. AnyRef
  27. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Instance Constructors
  1.  new LinkedHashSet()
Type Members
  1.  type Entry = LinkedHashSet.Entry[A]
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  final def &(that: collection.Set[A]): LinkedHashSet[A]
  4.  final def &~(that: collection.Set[A]): LinkedHashSet[A]
  5.  final def ++(that: IterableOnce[A]): LinkedHashSet[A]
  6.  final def ++[B >: A](suffix: IterableOnce[B]): LinkedHashSet[B]
  7.  final def ++=(xs: IterableOnce[A]): LinkedHashSet.this.type
  8.  final def +=(elem: A): LinkedHashSet.this.type
  9.  final def --=(xs: IterableOnce[A]): LinkedHashSet.this.type
  10.  final def -=(elem: A): LinkedHashSet.this.type
  11.  def ->[B](y: B): (LinkedHashSet[A], B)
  12.  final def ==(arg0: Any): Boolean
  13.  def add(elem: A): Boolean
  14.  def addAll(xs: IterableOnce[A]): LinkedHashSet.this.type
  15.  def addOne(elem: A): LinkedHashSet.this.type
  16.  final def addString(b: StringBuilder): b.type
  17.  final def addString(b: StringBuilder, sep: String): b.type
  18.  def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
  19.  def andThen[A](g: (Boolean) => A): (A) => A
  20.  final def apply(elem: A): Boolean
  21.  final def asInstanceOf[T0]: T0
  22.  def canEqual(that: Any): Boolean
  23.  def className: String
  24.  def clear(): Unit
  25.  def clone(): LinkedHashSet[A]
  26.  final def coll: LinkedHashSet.this.type
  27.  def collect[B](pf: PartialFunction[A, B]): LinkedHashSet[B]
  28.  def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
  29.  def compose[A](g: (A) => A): (A) => Boolean
  30.  def concat(that: IterableOnce[A]): LinkedHashSet[A]
  31.  def concat[B >: A](suffix: IterableOnce[B]): LinkedHashSet[B]
  32.  def contains(elem: A): Boolean
  33.  def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
  34.  def copyToArray[B >: A](xs: Array[B], start: Int): Int
  35.  def copyToArray[B >: A](xs: Array[B]): Int
  36.  def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
  37.  def count(p: (A) => Boolean): Int
  38.  def diff(that: collection.Set[A]): LinkedHashSet[A]
  39.  def drop(n: Int): LinkedHashSet[A]
  40.  def dropRight(n: Int): LinkedHashSet[A]
  41.  def dropWhile(p: (A) => Boolean): LinkedHashSet[A]
  42.  def empty: LinkedHashSet[A]
  43.  def ensuring(cond: (LinkedHashSet[A]) => Boolean, msg: => Any): LinkedHashSet[A]
  44.  def ensuring(cond: (LinkedHashSet[A]) => Boolean): LinkedHashSet[A]
  45.  def ensuring(cond: Boolean, msg: => Any): LinkedHashSet[A]
  46.  def ensuring(cond: Boolean): LinkedHashSet[A]
  47.  final def eq(arg0: AnyRef): Boolean
  48.  def equals(that: Any): Boolean
  49.  def exists(p: (A) => Boolean): Boolean
  50.  def filter(pred: (A) => Boolean): LinkedHashSet[A]
  51.  def filterImpl(pred: (A) => Boolean, isFlipped: Boolean): LinkedHashSet[A]
  52.  def filterInPlace(p: (A) => Boolean): LinkedHashSet.this.type
  53.  def filterNot(pred: (A) => Boolean): LinkedHashSet[A]
  54.  def finalize(): Unit
  55.  def find(p: (A) => Boolean): Option[A]
  56.  var firstEntry: Entry
  57.  def flatMap[B](f: (A) => IterableOnce[B]): LinkedHashSet[B]
  58.  def flatten[B](implicit toIterableOnce: (A) => IterableOnce[B]): LinkedHashSet[B]
  59.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  60.  def foldLeft[B](z: B)(op: (B, A) => B): B
  61.  def foldRight[B](z: B)(op: (A, B) => B): B
  62.  def forall(p: (A) => Boolean): Boolean
  63.  def foreach[U](f: (A) => U): Unit
  64.  def fromSpecific(coll: IterableOnce[A]): LinkedHashSet[A]
  65.  final def getClass(): Class[_ <: AnyRef]
  66.  def groupBy[K](f: (A) => K): immutable.Map[K, LinkedHashSet[A]]
  67.  def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, LinkedHashSet[B]]
  68.  def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  69.  def grouped(size: Int): Iterator[LinkedHashSet[A]]
  70.  def hashCode(): Int
  71.  def head: A
  72.  def headOption: Option[A]
  73.  def init: LinkedHashSet[A]
  74.  def inits: Iterator[LinkedHashSet[A]]
  75.  def intersect(that: collection.Set[A]): LinkedHashSet[A]
  76.  def isEmpty: Boolean
  77.  final def isInstanceOf[T0]: Boolean
  78.  def isTraversableAgain: Boolean
  79.  def iterableFactory: IterableFactory[LinkedHashSet]
  80.  def iterator: Iterator[A]
  81.  def knownSize: Int
  82.  def last: A
  83.  var lastEntry: Entry
  84.  def lastOption: Option[A]
  85.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, LinkedHashSet.this.type]
  86.  def map[B](f: (A) => B): LinkedHashSet[B]
  87.  def mapResult[NewTo](f: (LinkedHashSet[A]) => NewTo): Builder[A, NewTo]
  88.  def max[B >: A](implicit ord: math.Ordering[B]): A
  89.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  90.  def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  91.  def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  92.  def min[B >: A](implicit ord: math.Ordering[B]): A
  93.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  94.  def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
  95.  def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
  96.  final def mkString: String
  97.  final def mkString(sep: String): String
  98.  final def mkString(start: String, sep: String, end: String): String
  99.  final def ne(arg0: AnyRef): Boolean
  100.  def newSpecificBuilder: Builder[A, LinkedHashSet[A]]
  101.  def nonEmpty: Boolean
  102.  final def notify(): Unit
  103.  final def notifyAll(): Unit
  104.  def partition(p: (A) => Boolean): (LinkedHashSet[A], LinkedHashSet[A])
  105.  def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (LinkedHashSet[A1], LinkedHashSet[A2])
  106.  def product[B >: A](implicit num: math.Numeric[B]): B
  107.  def reduce[B >: A](op: (B, B) => B): B
  108.  def reduceLeft[B >: A](op: (B, A) => B): B
  109.  def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
  110.  def reduceOption[B >: A](op: (B, B) => B): Option[B]
  111.  def reduceRight[B >: A](op: (A, B) => B): B
  112.  def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
  113.  def remove(elem: A): Boolean
  114.  def result(): LinkedHashSet[A]
  115.  def reversed: collection.Iterable[A]
  116.  def scan[B >: A](z: B)(op: (B, B) => B): LinkedHashSet[B]
  117.  def scanLeft[B](z: B)(op: (B, A) => B): LinkedHashSet[B]
  118.  def scanRight[B](z: B)(op: (A, B) => B): LinkedHashSet[B]
  119.  def size: Int
  120.  def sizeCompare(that: collection.Iterable[_]): Int
  121.  def sizeCompare(otherSize: Int): Int
  122.  final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit
  123.  def sizeHint(size: Int): Unit
  124.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit
  125.  final def sizeIs: SizeCompareOps
  126.  def slice(from: Int, until: Int): LinkedHashSet[A]
  127.  def sliding(size: Int, step: Int): Iterator[LinkedHashSet[A]]
  128.  def sliding(size: Int): Iterator[LinkedHashSet[A]]
  129.  def span(p: (A) => Boolean): (LinkedHashSet[A], LinkedHashSet[A])
  130.  def splitAt(n: Int): (LinkedHashSet[A], LinkedHashSet[A])
  131.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
  132.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[A, B]): C2
  133.  final def strictOptimizedConcat[B >: A, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  134.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (A) => IterableOnce[B]): C2
  135.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (A) => IterableOnce[B]): C2
  136.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (A) => B): C2
  137.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(A, B), C2]): C2
  138.  def stringPrefix: String
  139.  def subsetOf(that: collection.Set[A]): Boolean
  140.  def subsets(): Iterator[LinkedHashSet[A]]
  141.  def subsets(len: Int): Iterator[LinkedHashSet[A]]
  142.  def subtractAll(xs: IterableOnce[A]): LinkedHashSet.this.type
  143.  def subtractOne(elem: A): LinkedHashSet.this.type
  144.  def sum[B >: A](implicit num: math.Numeric[B]): B
  145.  final def synchronized[T0](arg0: => T0): T0
  146.  def tail: LinkedHashSet[A]
  147.  def tails: Iterator[LinkedHashSet[A]]
  148.  def take(n: Int): LinkedHashSet[A]
  149.  def takeRight(n: Int): LinkedHashSet[A]
  150.  def takeWhile(p: (A) => Boolean): LinkedHashSet[A]
  151.  def tapEach[U](f: (A) => U): LinkedHashSet[A]
  152.  def to[C1](factory: Factory[A, C1]): C1
  153.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  154.  final def toBuffer[B >: A]: Buffer[B]
  155.  def toIndexedSeq: immutable.IndexedSeq[A]
  156.  def toList: immutable.List[A]
  157.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  158.  def toSeq: immutable.Seq[A]
  159.  def toSet[B >: A]: immutable.Set[B]
  160.  def toString(): String
  161.  def toVector: immutable.Vector[A]
  162.  def transpose[B](implicit asIterable: (A) => collection.Iterable[B]): LinkedHashSet[LinkedHashSet[B]]
  163.  final def union(that: collection.Set[A]): LinkedHashSet[A]
  164.  def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (LinkedHashSet[A1], LinkedHashSet[A2])
  165.  def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (LinkedHashSet[A1], LinkedHashSet[A2], LinkedHashSet[A3])
  166.  def update(elem: A, included: Boolean): Unit
  167.  def view: View[A]
  168.  final def wait(): Unit
  169.  final def wait(arg0: Long, arg1: Int): Unit
  170.  final def wait(arg0: Long): Unit
  171.  def withFilter(p: (A) => Boolean): WithFilter[A, [_]LinkedHashSet[_]]
  172.  def writeReplace(): AnyRef
  173.  def zip[B](that: IterableOnce[B]): LinkedHashSet[(A, B)]
  174.  def zipAll[A1 >: A, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): LinkedHashSet[(A1, B)]
  175.  def zipWithIndex: LinkedHashSet[(A, Int)]
  176.  final def |(that: collection.Set[A]): LinkedHashSet[A]
Deprecated Value Members
  1.  def +(elem1: A, elem2: A, elems: A*): LinkedHashSet[A]
  2.  def +(elem: A): LinkedHashSet[A]
  3.  def ++:[B >: A](that: IterableOnce[B]): LinkedHashSet[B]
  4.  final def +=(elem1: A, elem2: A, elems: A*): LinkedHashSet.this.type
  5.  def -(elem1: A, elem2: A, elems: A*): LinkedHashSet[A]
  6.  def -(elem: A): LinkedHashSet[A]
  7.  def --(that: IterableOnce[A]): LinkedHashSet[A]
  8.  def -=(elem1: A, elem2: A, elems: A*): LinkedHashSet.this.type
  9.  def /:[B](z: B)(op: (B, A) => B): B
  10.  final def /:[B](z: B)(op: (B, A) => B): B
  11.  def :\[B](z: B)(op: (A, B) => B): B
  12.  final def :\[B](z: B)(op: (A, B) => B): B
  13.  def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
  14.  def collectFirst[B](f: PartialFunction[A, B]): Option[B]
  15.  def companion: IterableFactory[[_]LinkedHashSet[_]]
  16.  def copyToBuffer(dest: Buffer[A]): Unit
  17.  final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
  18.  def count(f: (A) => Boolean): Int
  19.  def exists(f: (A) => Boolean): Boolean
  20.  def filter(f: (A) => Boolean): Iterator[A]
  21.  def find(p: (A) => Boolean): Option[A]
  22.  def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
  23.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  24.  def foldLeft[B](z: B)(op: (B, A) => B): B
  25.  def foldRight[B](z: B)(op: (A, B) => B): B
  26.  def forall(f: (A) => Boolean): Boolean
  27.  def foreach[U](f: (A) => U): Unit
  28.  def formatted(fmtstr: String): String
  29.  def hasDefiniteSize: Boolean
  30.  def isEmpty: Boolean
  31.  def map[B](f: (A) => B): IterableOnce[B]
  32.  def max(implicit ord: math.Ordering[A]): A
  33.  def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  34.  def min(implicit ord: math.Ordering[A]): A
  35.  def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
  36.  def mkString: String
  37.  def mkString(sep: String): String
  38.  def mkString(start: String, sep: String, end: String): String
  39.  def nonEmpty: Boolean
  40.  def product(implicit num: math.Numeric[A]): A
  41.  def reduce(f: (A, A) => A): A
  42.  def reduceLeft(f: (A, A) => A): A
  43.  def reduceLeftOption(f: (A, A) => A): Option[A]
  44.  def reduceOption(f: (A, A) => A): Option[A]
  45.  def reduceRight(f: (A, A) => A): A
  46.  def reduceRightOption(f: (A, A) => A): Option[A]
  47.  final def repr: LinkedHashSet[A]
  48.  final def retain(p: (A) => Boolean): Unit
  49.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  50.  def seq: LinkedHashSet.this.type
  51.  def size: Int
  52.  def sum(implicit num: math.Numeric[A]): A
  53.  def to[C1](factory: Factory[A, C1]): C1
  54.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  55.  def toBuffer[B >: A]: Buffer[B]
  56.  def toIndexedSeq: collection.IndexedSeq[A]
  57.  final def toIterable: collection.Iterable[A]
  58.  final def toIterable: LinkedHashSet.this.type
  59.  def toIterator: Iterator[A]
  60.  final def toIterator: Iterator[A]
  61.  def toList: immutable.List[A]
  62.  def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  63.  def toSeq: immutable.Seq[A]
  64.  def toSet[B >: A]: immutable.Set[B]
  65.  def toStream: immutable.Stream[A]
  66.  final def toStream: immutable.Stream[A]
  67.  final def toTraversable: collection.Traversable[A]
  68.  final def toTraversable: collection.Traversable[A]
  69.  def toVector: immutable.Vector[A]
  70.  def view(from: Int, until: Int): View[A]
  71.  def withFilter(f: (A) => Boolean): Iterator[A]
  72.  def →[B](y: B): (LinkedHashSet[A], 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