Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package opalj

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode.

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode. OPAL is designed with performance, scalability and adaptability in mind.

    Its main components are:

    • a library (Common) which provides generally useful data-structures and algorithms for static analyses.
    • a framework for implementing lattice based static analyses (Static Analysis Infrastructure)
    • a framework for parsing Java bytecode (Bytecode Infrastructure) that can be used to create arbitrary representations.
    • a library to create a one-to-one in-memory representation of Java bytecode (Bytecode Disassembler).
    • a library to create a representation of Java bytecode that facilitates writing simple static analyses (Bytecode Representation - org.opalj.br).
    • a scalable, easily customizable framework for the abstract interpretation of Java bytecode (Abstract Interpretation Framework - org.opalj.ai).
    • a library to extract dependencies between code elements and to facilitate checking architecture definitions.
    • a library for the lightweight manipulation and creation of Java bytecode (Bytecode Assembler).

    General Design Decisions

    Thread Safety

    Unless explicitly noted, OPAL is thread safe. I.e., the classes defined by OPAL can be considered to be thread safe unless otherwise stated. (For example, it is possible to read and process class files concurrently without explicit synchronization on the client side.)

    No null Values

    Unless explicitly noted, OPAL does not null values I.e., fields that are accessible will never contain null values and methods will never return null. If a method accepts null as a value for a parameter or returns a null value it is always explicitly documented. In general, the behavior of methods that are passed null values is undefined unless explicitly documented.

    No Typecasts for Collections

    For efficiency reasons, OPAL sometimes uses mutable data-structures internally. After construction time, these data-structures are generally represented using their generic interfaces (e.g., scala.collection.{Set,Map}). However, a downcast (e.g., to add/remove elements) is always forbidden as it would effectively prevent thread-safety.

    Assertions

    OPAL makes heavy use of Scala's Assertion Facility to facilitate writing correct code. Hence, for production builds (after thorough testing(!)) it is highly recommend to build OPAL again using -Xdisable-assertions.

    Definition Classes
    org
  • package collection

    OPAL's collection library is primarily designed with high performance in mind.

    Design Goals

    OPAL's collection library is primarily designed with high performance in mind. I.e., all methods provided by the collection library are reasonably optimized. However, providing a very large number of methods is a non-goal. Overall, OPAL's collection library provides:

    • collection classes that are manually specialized for primitive data-types.
    • collection classes that are optimized for particularly small collections of values.
    • collection classes that target special use cases such as using a collection as a workset/worklist.
    • collection classes that offer special methods that minimize the number of steps when compared to general purpose methods.

    Integration With Scala's Collection Library

    Hence, OPAL's collection library complements Scala's default collection library and is not intended to replace it. Integration with Scala's collection library is primarily provided by means of iterators (OPAL's Iterators inherit from Scala's Iterators). Furthermore the companion object of each of OPAL's collection classes generally provides factory methods that facilitate the conversion from Scala collection classes to OPAL collection classes.

    Status

    The collection library is growing. Nevertheless, the existing classes are production ready.

    Definition Classes
    opalj
  • package immutable
    Definition Classes
    collection
  • BitArraySet
  • EmptyIntArraySet
  • EmptyIntList
  • EmptyIntTrieSet
  • FilteredIntTrieSet
  • IdentityPair
  • Int2List
  • Int2ListEnd
  • Int2ListNode
  • IntArraySet
  • IntArraySet1
  • IntArraySetBuilder
  • IntArraySetN
  • IntIntPair
  • IntList
  • IntListNode
  • IntRefPair
  • IntTrieSet
  • IntTrieSet1
  • IntTrieSetBuilder
  • IntWorkSet
  • LargeLongLinkedTrieSet
  • Long2List
  • Long2List0
  • LongLinkedSet
  • LongLinkedTrieSet
  • LongLinkedTrieSet0
  • LongLinkedTrieSet1
  • LongLinkedTrieSetN4
  • LongList
  • LongList0
  • LongListNode
  • LongRefPair
  • LongTrieSet
  • LongTrieSetWithList
  • LongWorkSet
  • NonEmptyUIDSet
  • Pair
  • Ref2List
  • RefIntPair
  • UIDSet
  • UIDSet0
  • UIDSet1
  • UIDSet2
  • UIDSet3
  • UIDSetInnerNode
  • UIDSetLeaf
  • UIDTrieSet
  • UIDTrieSet0
  • UIDTrieSet1
  • UShortPair

sealed abstract class UIDSet[T <: UID] extends Set[T] with StrictOptimizedSetOps[T, Set, UIDSet[T]]

An unordered trie-set based on the unique ids of the stored UID objects. I.e., equality of two sets is defined in terms of the unique ids and not in terms of structural or reference equality of the stored elements.

Implementation

This trie set uses the least significant bit to decide whether the search is continued in the right or left branch.

Small sets are represented using a UIDSet0...3.

Compared to Scala's Set implementations in particular the tail and filter methods are much faster.

Self Type
UIDSet[T]
Source
UIDSet.scala
Linear Supertypes
StrictOptimizedSetOps[T, Set, UIDSet[T]], StrictOptimizedSetOps[T, Set, UIDSet[T]], StrictOptimizedIterableOps[T, Set, UIDSet[T]], Set[T], SetOps[T, [X]Set[X], UIDSet[T]], Set[T], Equals, SetOps[T, [_]Set[_], UIDSet[T]], (T) => Boolean, Iterable[T], Iterable[T], IterableFactoryDefaults[T, [x]Set[x]], IterableOps[T, [_]Set[_], UIDSet[T]], IterableOnceOps[T, [_]Set[_], UIDSet[T]], IterableOnce[T], AnyRef, Any
Known Subclasses
NonEmptyUIDSet, UIDSet0, UIDSet1, UIDSet2, UIDSet3
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UIDSet
  2. StrictOptimizedSetOps
  3. StrictOptimizedSetOps
  4. StrictOptimizedIterableOps
  5. Set
  6. SetOps
  7. Set
  8. Equals
  9. SetOps
  10. Function1
  11. Iterable
  12. Iterable
  13. IterableFactoryDefaults
  14. IterableOps
  15. IterableOnceOps
  16. IterableOnce
  17. AnyRef
  18. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def ++(es: UIDSet[T]): UIDSet[T]
  2. abstract def containsId(id: Int): Boolean
  3. abstract def excl(e: T): UIDSet[T]
    Definition Classes
    UIDSet → SetOps
  4. abstract def findById(id: Int): Option[T]
  5. abstract def idIterator: IntIterator

    Iterator over all ids.

  6. abstract def idSet: IntTrieSet
  7. abstract def incl(e: T): UIDSet[T]
    Definition Classes
    UIDSet → SetOps
  8. abstract def isSingletonSet: Boolean
  9. abstract def iterator: Iterator[T]
    Definition Classes
    UIDSet → IterableOnce

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def &(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps
    Annotations
    @inline()
  4. final def &~(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps
    Annotations
    @inline()
  5. final def +(elem: T): UIDSet[T]
    Definition Classes
    SetOps → SetOps
  6. final def ++(that: IterableOnce[T]): UIDSet[T]
    Definition Classes
    SetOps
    Annotations
    @inline()
  7. final def ++[B >: T](suffix: IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  8. final def -(elem: T): UIDSet[T]
    Definition Classes
    SetOps → SetOps
    Annotations
    @inline()
  9. final def --(that: IterableOnce[T]): UIDSet[T]
    Definition Classes
    SetOps → SetOps
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. final def add[X >: T <: UID](e: X): UIDSet[X]
  12. final def addString(b: StringBuilder): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  13. final def addString(b: StringBuilder, sep: String): b.type
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  14. def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
    Definition Classes
    IterableOnceOps
  15. def andThen[A](g: (Boolean) => A): (T) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  16. final def apply(elem: T): Boolean
    Definition Classes
    SetOps → Function1
    Annotations
    @inline()
  17. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  18. def canEqual(that: Any): Boolean
    Definition Classes
    Set → Equals
  19. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  20. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
  21. final def coll: UIDSet.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  22. def collect[B](pf: PartialFunction[T, B]): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  23. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    IterableOnceOps
  24. def compare(that: UIDSet[T]): SetRelation

    Performs a qualified comparison of this set with the given set.

  25. def compose[A](g: (A) => T): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  26. def concat(that: IterableOnce[T]): UIDSet[T]
    Definition Classes
    StrictOptimizedSetOps → StrictOptimizedSetOps → SetOps
  27. def concat[B >: T](suffix: IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
  28. final def contains(e: T): Boolean
    Definition Classes
    UIDSet → SetOps
  29. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  30. def copyToArray[B >: T](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  31. def copyToArray[B >: T](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  32. def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  33. def count(p: (T) => Boolean): Int
    Definition Classes
    IterableOnceOps
  34. def diff(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps → SetOps
  35. def drop(n: Int): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  36. def dropRight(n: Int): UIDSet[T]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  37. def dropWhile(p: (T) => Boolean): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  38. final def empty: UIDSet[T]
    Definition Classes
    UIDSet → IterableFactoryDefaults → IterableOps
  39. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  40. def equals(that: Any): Boolean
    Definition Classes
    Set → Equals → AnyRef → Any
  41. def exists(p: (T) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  42. def filter(pred: (T) => Boolean): UIDSet[T]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  43. def filterImpl(pred: (T) => Boolean, isFlipped: Boolean): UIDSet[T]
    Attributes
    protected[scala.collection]
    Definition Classes
    StrictOptimizedIterableOps
  44. def filterNot(pred: (T) => Boolean): UIDSet[T]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  45. def find(p: (T) => Boolean): Option[T]
    Definition Classes
    IterableOnceOps
  46. def flatMap[B](f: (T) => IterableOnce[B]): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  47. def flatten[B](implicit toIterableOnce: (T) => IterableOnce[B]): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  48. def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  49. def foldLeft[B](z: B)(op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  50. def foldRight[B](z: B)(op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  51. def forall(p: (T) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  52. def foreach[U](f: (T) => U): Unit
    Definition Classes
    IterableOnceOps
  53. def foreachIterator: ForeachRefIterator[T]
  54. def fromSpecific(coll: IterableOnce[T]): UIDSet[T]
    Definition Classes
    UIDSet → IterableFactoryDefaults → IterableOps
  55. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  56. def groupBy[K](f: (T) => K): Map[K, UIDSet[T]]
    Definition Classes
    IterableOps
  57. def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, Set[B]]
    Definition Classes
    IterableOps
  58. def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  59. def grouped(size: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  60. def hashCode(): Int
    Definition Classes
    Set → AnyRef → Any
  61. def head: T
    Definition Classes
    IterableOps
  62. def headOption: Option[T]
    Definition Classes
    IterableOps
  63. final def includes[X >: T <: UID](e: X): Boolean
  64. def init: UIDSet[T]
    Definition Classes
    IterableOps
  65. def inits: Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  66. def intersect(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps
  67. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  68. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  69. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  70. def iterableFactory: IterableFactory[Set]
    Definition Classes
    Set → Set → Iterable → Iterable → IterableOps
  71. def knownSize: Int
    Definition Classes
    IterableOnce
  72. def last: T
    Definition Classes
    IterableOps
  73. def lastOption: Option[T]
    Definition Classes
    IterableOps
  74. def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, UIDSet.this.type]
    Definition Classes
    Iterable
  75. def map[B](f: (T) => B): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  76. def mapUIDSet[B <: UID](f: (T) => B): UIDSet[B]
  77. def max[B >: T](implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  78. def maxBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  79. def maxByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  80. def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  81. def min[B >: T](implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  82. def minBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  83. def minByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  84. def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  85. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  86. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  87. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  88. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  89. def newSpecificBuilder: Builder[T, UIDSet[T]]
    Definition Classes
    UIDSet → IterableFactoryDefaults → IterableOps
  90. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  91. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  92. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  93. def partition(p: (T) => Boolean): (UIDSet[T], UIDSet[T])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  94. def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (Set[A1], Set[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  95. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  96. def reduce[B >: T](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  97. def reduceLeft[B >: T](op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  98. def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
    Definition Classes
    IterableOnceOps
  99. def reduceOption[B >: T](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  100. def reduceRight[B >: T](op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  101. def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  102. def removedAll(that: IterableOnce[T]): UIDSet[T]
    Definition Classes
    SetOps
  103. def reversed: Iterable[T]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  104. def scan[B >: T](z: B)(op: (B, B) => B): Set[B]
    Definition Classes
    IterableOps
  105. def scanLeft[B](z: B)(op: (B, T) => B): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  106. def scanRight[B](z: B)(op: (T, B) => B): Set[B]
    Definition Classes
    IterableOps
  107. def size: Int
    Definition Classes
    IterableOnceOps
  108. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  109. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  110. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  111. def slice(from: Int, until: Int): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  112. def sliding(size: Int, step: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  113. def sliding(size: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  114. def span(p: (T) => Boolean): (UIDSet[T], UIDSet[T])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  115. def splitAt(n: Int): (UIDSet[T], UIDSet[T])
    Definition Classes
    IterableOps → IterableOnceOps
  116. def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
    Definition Classes
    IterableOnce
  117. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[T, B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  118. final def strictOptimizedConcat[B >: T, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  119. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (T) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  120. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (T) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  121. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (T) => B): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  122. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(T, B), C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  123. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Set → Iterable
  124. def subsetOf(that: Set[T]): Boolean
    Definition Classes
    SetOps
  125. def subsets(): Iterator[UIDSet[T]]
    Definition Classes
    SetOps
  126. def subsets(len: Int): Iterator[UIDSet[T]]
    Definition Classes
    SetOps
  127. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  128. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  129. def tail: UIDSet[T]
    Definition Classes
    UIDSet → IterableOps
  130. def tails: Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  131. def take(n: Int): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  132. def takeRight(n: Int): UIDSet[T]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  133. def takeWhile(p: (T) => Boolean): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  134. def tapEach[U](f: (T) => U): UIDSet[T]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  135. def to[C1](factory: Factory[T, C1]): C1
    Definition Classes
    IterableOnceOps
  136. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  137. def toArraySeq(implicit classTag: ClassTag[T]): ArraySeq[T]
  138. final def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  139. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    IterableOnceOps
  140. def toList: List[T]
    Definition Classes
    IterableOnceOps
  141. def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  142. def toSeq: Seq[T]
    Definition Classes
    IterableOnceOps
  143. def toSet[B >: T]: Set[B]
    Definition Classes
    IterableOnceOps
  144. def toString(): String
    Definition Classes
    Set → Function1 → Iterable → AnyRef → Any
  145. final def toUIDSet[X >: T <: UID]: UIDSet[X]
  146. def toVector: Vector[T]
    Definition Classes
    IterableOnceOps
  147. def transpose[B](implicit asIterable: (T) => Iterable[B]): Set[Set[B]]
    Definition Classes
    IterableOps
  148. final def union(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps
    Annotations
    @inline()
  149. def unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  150. def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  151. def view: View[T]
    Definition Classes
    IterableOps
  152. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  153. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  154. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  155. def withFilter(p: (T) => Boolean): WithFilter[T, [_]Set[_]]
    Definition Classes
    IterableOps
  156. def zip[B](that: IterableOnce[B]): Set[(T, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  157. def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
    Definition Classes
    IterableOps
  158. def zipWithIndex: Set[(T, Int)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  159. final def |(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps
    Annotations
    @inline()

Deprecated Value Members

  1. def +(elem1: T, elem2: T, elems: T*): UIDSet[T]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ with an explicit collection argument instead of + with varargs

  2. def ++:[B >: T](that: IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  3. def -(elem1: T, elem2: T, elems: T*): UIDSet[T]
    Definition Classes
    SetOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use &- with an explicit collection argument instead of - with varargs

  4. final def /:[B](z: B)(op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  5. final def :\[B](z: B)(op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  6. def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  7. def companion: IterableFactory[[_]Set[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  8. final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  9. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  10. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  11. final def repr: UIDSet[T]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  12. def seq: UIDSet.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  13. final def toIterable: UIDSet.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  14. final def toIterator: Iterator[T]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  15. final def toStream: Stream[T]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  16. final def toTraversable: Traversable[T]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  17. def view(from: Int, until: Int): View[T]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from StrictOptimizedSetOps[T, Set, UIDSet[T]]

Inherited from StrictOptimizedSetOps[T, Set, UIDSet[T]]

Inherited from StrictOptimizedIterableOps[T, Set, UIDSet[T]]

Inherited from Set[T]

Inherited from SetOps[T, [X]Set[X], UIDSet[T]]

Inherited from Set[T]

Inherited from Equals

Inherited from SetOps[T, [_]Set[_], UIDSet[T]]

Inherited from (T) => Boolean

Inherited from Iterable[T]

Inherited from Iterable[T]

Inherited from IterableFactoryDefaults[T, [x]Set[x]]

Inherited from IterableOps[T, [_]Set[_], UIDSet[T]]

Inherited from IterableOnceOps[T, [_]Set[_], UIDSet[T]]

Inherited from IterableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped