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

final class UIDSetLeaf[T <: UID] extends UIDSetNodeLike[T]

Source
UIDSet.scala
Linear Supertypes
UIDSetNodeLike[T], NonEmptyUIDSet[T], UIDSet[T], 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
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UIDSetLeaf
  2. UIDSetNodeLike
  3. NonEmptyUIDSet
  4. UIDSet
  5. StrictOptimizedSetOps
  6. StrictOptimizedSetOps
  7. StrictOptimizedIterableOps
  8. Set
  9. SetOps
  10. Set
  11. Equals
  12. SetOps
  13. Function1
  14. Iterable
  15. Iterable
  16. IterableFactoryDefaults
  17. IterableOps
  18. IterableOnceOps
  19. IterableOnce
  20. AnyRef
  21. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

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

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

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

    Definition Classes
    UIDSet
  26. def compose[A](g: (A) => T): (A) => Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  27. def concat(that: IterableOnce[T]): UIDSet[T]
    Definition Classes
    StrictOptimizedSetOps → StrictOptimizedSetOps → SetOps
  28. def concat[B >: T](suffix: IterableOnce[B]): Set[B]
    Definition Classes
    IterableOps
  29. final def contains(e: T): Boolean
    Definition Classes
    UIDSet → SetOps
  30. def containsId(id: Int): Boolean
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → UIDSet
  31. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  32. def copyToArray[B >: T](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  33. def copyToArray[B >: T](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  34. def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  35. def count(p: (T) => Boolean): Int
    Definition Classes
    IterableOnceOps
  36. def diff(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps → SetOps
  37. def drop(n: Int): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  38. def dropRight(n: Int): UIDSet[T]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  39. def dropWhile(p: (T) => Boolean): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  40. final def empty: UIDSet[T]
    Definition Classes
    UIDSet → IterableFactoryDefaults → IterableOps
  41. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. def equals(that: Any): Boolean
    Definition Classes
    UIDSetLeaf → Set → Equals → AnyRef → Any
  43. final def excl(e: T): UIDSet[T]
    Definition Classes
    UIDSetNodeLike → UIDSet → SetOps
  44. def exists(p: (T) => Boolean): Boolean
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → UIDSet → IterableOnceOps
  45. def filter(p: (T) => Boolean): UIDSet[T]
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  46. def filterImpl(pred: (T) => Boolean, isFlipped: Boolean): UIDSet[T]
    Attributes
    protected[scala.collection]
    Definition Classes
    StrictOptimizedIterableOps
  47. def filterNot(p: (T) => Boolean): UIDSet[T]
    Definition Classes
    UIDSetNodeLike → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  48. def find(p: (T) => Boolean): Option[T]
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → IterableOnceOps
  49. def findById(id: Int): Option[T]
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → UIDSet
  50. def flatMap[B](f: (T) => IterableOnce[B]): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  51. def flatten[B](implicit toIterableOnce: (T) => IterableOnce[B]): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  52. def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  53. def foldLeft[B](z: B)(op: (B, T) => B): B
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → UIDSet → IterableOnceOps
  54. def foldRight[B](z: B)(op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  55. def forall(p: (T) => Boolean): Boolean
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → UIDSet → IterableOnceOps
  56. def foreach[U](f: (T) => U): Unit
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → IterableOnceOps
  57. def foreachIterator: ForeachRefIterator[T]
    Definition Classes
    UIDSet
  58. def fromSpecific(coll: IterableOnce[T]): UIDSet[T]
    Definition Classes
    UIDSet → IterableFactoryDefaults → IterableOps
  59. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  60. def groupBy[K](f: (T) => K): Map[K, UIDSet[T]]
    Definition Classes
    IterableOps
  61. def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, Set[B]]
    Definition Classes
    IterableOps
  62. def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  63. def grouped(size: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  64. def growIdSet(set: IntTrieSet): IntTrieSet
    Attributes
    protected[immutable]
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike
  65. def hashCode(): Int
    Definition Classes
    UIDSetLeaf → Set → AnyRef → Any
  66. def head: T
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → UIDSet → IterableOps
  67. final def headOption: Option[T]
    Definition Classes
    NonEmptyUIDSet → IterableOps
  68. def idIterator: IntIterator

    Iterator over all ids.

    Iterator over all ids.

    Definition Classes
    UIDSetNodeLike → UIDSet
  69. def idSet: IntTrieSet
    Definition Classes
    UIDSetNodeLike → UIDSet
  70. final def incl(e: T): UIDSet[T]
    Definition Classes
    UIDSetNodeLike → UIDSet → SetOps
  71. final def includes[X >: T <: UID](e: X): Boolean
    Definition Classes
    UIDSet
  72. def init: UIDSet[T]
    Definition Classes
    IterableOps
  73. def inits: Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  74. def intersect(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps
  75. final def isEmpty: Boolean
    Definition Classes
    NonEmptyUIDSet → IterableOnceOps
  76. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  77. def isSingletonSet: Boolean
    Definition Classes
    UIDSetNodeLike → UIDSet
  78. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  79. def iterableFactory: IterableFactory[Set]
    Definition Classes
    Set → Set → Iterable → Iterable → IterableOps
  80. def iterator: Iterator[T]
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → UIDSet → IterableOnce
  81. def knownSize: Int
    Definition Classes
    IterableOnce
  82. def last: T

    Returns the current last value, which is never head if the underlying set contains at least two values.

    Returns the current last value, which is never head if the underlying set contains at least two values. The last value can be different for two sets containing the same values if both sets were created in different ways.

    Definition Classes
    UIDSetLeaf → UIDSet → IterableOps
  83. def lastOption: Option[T]
    Definition Classes
    IterableOps
  84. def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, UIDSetLeaf.this.type]
    Definition Classes
    Iterable
  85. def left: UIDSetNodeLike[T]
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike
  86. def map[B](f: (T) => B): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  87. def mapUIDSet[B <: UID](f: (T) => B): UIDSet[B]
    Definition Classes
    UIDSet
  88. def max[B >: T](implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  89. def maxBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  90. def maxByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  91. def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  92. def min[B >: T](implicit ord: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  93. def minBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
    Definition Classes
    IterableOnceOps
  94. def minByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  95. def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
    Definition Classes
    IterableOnceOps
  96. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  97. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  98. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  99. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  100. def newSpecificBuilder: Builder[T, UIDSet[T]]
    Definition Classes
    UIDSet → IterableFactoryDefaults → IterableOps
  101. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  102. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  103. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  104. def partition(p: (T) => Boolean): (UIDSet[T], UIDSet[T])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  105. def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (Set[A1], Set[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  106. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  107. def reduce[B >: T](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  108. def reduceLeft[B >: T](op: (B, T) => B): B
    Definition Classes
    IterableOnceOps
  109. def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
    Definition Classes
    IterableOnceOps
  110. def reduceOption[B >: T](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  111. def reduceRight[B >: T](op: (T, B) => B): B
    Definition Classes
    IterableOnceOps
  112. def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  113. def removedAll(that: IterableOnce[T]): UIDSet[T]
    Definition Classes
    SetOps
  114. def reversed: Iterable[T]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  115. def right: UIDSetNodeLike[T]
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike
  116. def scan[B >: T](z: B)(op: (B, B) => B): Set[B]
    Definition Classes
    IterableOps
  117. def scanLeft[B](z: B)(op: (B, T) => B): Set[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  118. def scanRight[B](z: B)(op: (T, B) => B): Set[B]
    Definition Classes
    IterableOps
  119. def showTree(level: Int = 0): String
    Definition Classes
    UIDSetNodeLike
  120. def size: Int
    Definition Classes
    UIDSetLeaf → IterableOnceOps
  121. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  122. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  123. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  124. def slice(from: Int, until: Int): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  125. def sliding(size: Int, step: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  126. def sliding(size: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  127. def span(p: (T) => Boolean): (UIDSet[T], UIDSet[T])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  128. def splitAt(n: Int): (UIDSet[T], UIDSet[T])
    Definition Classes
    IterableOps → IterableOnceOps
  129. def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
    Definition Classes
    IterableOnce
  130. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[T, B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  131. final def strictOptimizedConcat[B >: T, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  132. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (T) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  133. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (T) => IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  134. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (T) => B): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  135. final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(T, B), C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  136. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Set → Iterable
  137. def subsetOf(that: Set[T]): Boolean
    Definition Classes
    SetOps
  138. def subsets(): Iterator[UIDSet[T]]
    Definition Classes
    SetOps
  139. def subsets(len: Int): Iterator[UIDSet[T]]
    Definition Classes
    SetOps
  140. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  141. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  142. def tail: UIDSet[T]
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike → UIDSet → IterableOps
  143. def tails: Iterator[UIDSet[T]]
    Definition Classes
    IterableOps
  144. def take(n: Int): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  145. def takeRight(n: Int): UIDSet[T]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  146. def takeWhile(p: (T) => Boolean): UIDSet[T]
    Definition Classes
    IterableOps → IterableOnceOps
  147. def tapEach[U](f: (T) => U): UIDSet[T]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  148. def to[C1](factory: Factory[T, C1]): C1
    Definition Classes
    IterableOnceOps
  149. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  150. def toArraySeq(implicit classTag: ClassTag[T]): ArraySeq[T]
    Definition Classes
    UIDSet
  151. final def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  152. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    IterableOnceOps
  153. def toList: List[T]
    Definition Classes
    IterableOnceOps
  154. def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  155. def toSeq: Seq[T]
    Definition Classes
    IterableOnceOps
  156. def toSet[B >: T]: Set[B]
    Definition Classes
    IterableOnceOps
  157. def toString(): String
    Definition Classes
    Set → Function1 → Iterable → AnyRef → Any
  158. final def toUIDSet[X >: T <: UID]: UIDSet[X]
    Definition Classes
    UIDSet
  159. def toVector: Vector[T]
    Definition Classes
    IterableOnceOps
  160. def transpose[B](implicit asIterable: (T) => Iterable[B]): Set[Set[B]]
    Definition Classes
    IterableOps
  161. final def union(that: Set[T]): UIDSet[T]
    Definition Classes
    SetOps
    Annotations
    @inline()
  162. def unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  163. def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  164. val value: T
    Definition Classes
    UIDSetLeaf → UIDSetNodeLike
  165. def view: View[T]
    Definition Classes
    IterableOps
  166. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  167. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  168. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  169. def withFilter(p: (T) => Boolean): WithFilter[T, [_]Set[_]]
    Definition Classes
    IterableOps
  170. def zip[B](that: IterableOnce[B]): Set[(T, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  171. def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): Set[(A1, B)]
    Definition Classes
    IterableOps
  172. def zipWithIndex: Set[(T, Int)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  173. 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: UIDSetLeaf.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

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

  13. final def toIterable: UIDSetLeaf.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 UIDSetNodeLike[T]

Inherited from NonEmptyUIDSet[T]

Inherited from UIDSet[T]

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