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
  • Chain
  • ConstArray
  • ConstCovariantArray
  • EmptyIntArraySet
  • EmptyIntTrieSet
  • EmptyLongTrieSet
  • FilteredIntTrieSet
  • FilteredLongTrieSet
  • IdentityPair
  • IntArray
  • IntArraySet
  • IntArraySet1
  • IntArraySetBuilder
  • IntArraySetN
  • IntIntPair
  • IntRefPair
  • IntTrieSet
  • IntTrieSet1
  • IntTrieSetBuilder
  • IntWorkSet
  • LongRefPair
  • LongTrieSet
  • LongTrieSet1
  • LongTrieSetBuilder
  • LongWorkSet
  • Naught
  • NonEmptyUIDSet
  • Pair
  • RefArray
  • UIDLinearProbingSet
  • UIDSet
  • UIDSet0
  • UIDSet1
  • UIDSet2
  • UIDSet3
  • UIDTrieSetInnerNode
  • UIDTrieSetLeaf
  • UShortPair

final class UIDTrieSetLeaf[T <: UID] extends UIDTrieSetNodeLike[T]

Linear Supertypes
UIDTrieSetNodeLike[T], NonEmptyUIDSet[T], UIDSet[T], Set[T], Set[T], SetLike[T, UIDSet[T]], Subtractable[T, UIDSet[T]], GenSet[T], GenericSetTemplate[T, Set], GenSetLike[T, UIDSet[T]], (T) ⇒ Boolean, Iterable[T], Iterable[T], IterableLike[T, UIDSet[T]], Equals, GenIterable[T], GenIterableLike[T, UIDSet[T]], Traversable[T], Immutable, Traversable[T], GenTraversable[T], GenericTraversableTemplate[T, Set], TraversableLike[T, UIDSet[T]], GenTraversableLike[T, UIDSet[T]], Parallelizable[T, ParSet[T]], TraversableOnce[T], GenTraversableOnce[T], FilterMonadic[T, UIDSet[T]], HasNewBuilder[T, UIDSet[T]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UIDTrieSetLeaf
  2. UIDTrieSetNodeLike
  3. NonEmptyUIDSet
  4. UIDSet
  5. Set
  6. Set
  7. SetLike
  8. Subtractable
  9. GenSet
  10. GenericSetTemplate
  11. GenSetLike
  12. Function1
  13. Iterable
  14. Iterable
  15. IterableLike
  16. Equals
  17. GenIterable
  18. GenIterableLike
  19. Traversable
  20. Immutable
  21. Traversable
  22. GenTraversable
  23. GenericTraversableTemplate
  24. TraversableLike
  25. GenTraversableLike
  26. Parallelizable
  27. TraversableOnce
  28. GenTraversableOnce
  29. FilterMonadic
  30. HasNewBuilder
  31. AnyRef
  32. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Self = UIDSet[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def &(that: GenSet[T]): UIDSet[T]
    Definition Classes
    GenSetLike
  4. def &~(that: GenSet[T]): UIDSet[T]
    Definition Classes
    GenSetLike
  5. final def +(e: T): UIDSet[T]
    Definition Classes
    UIDTrieSetNodeLike → UIDSet → SetLike → GenSetLike
  6. def +(elem1: T, elem2: T, elems: T*): UIDSet[T]
    Definition Classes
    SetLike
  7. def ++(es: UIDSet[T]): UIDSet[T]
    Definition Classes
    UIDTrieSetNodeLike → UIDSet
  8. def ++(elems: GenTraversableOnce[T]): UIDSet[T]
    Definition Classes
    SetLike
  9. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  10. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike
  11. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike
  12. final def -(e: T): UIDSet[T]
    Definition Classes
    UIDTrieSetNodeLike → UIDSet → SetLike → Subtractable → GenSetLike
  13. def -(elem1: T, elem2: T, elems: T*): UIDSet[T]
    Definition Classes
    Subtractable
  14. def --(xs: GenTraversableOnce[T]): UIDSet[T]
    Definition Classes
    Subtractable
  15. def /:[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. def :\[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  18. final def add[X >: T <: UID](e: X): UIDSet[X]
    Definition Classes
    UIDSet
  19. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  20. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  21. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  22. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  24. def apply(elem: T): Boolean
    Definition Classes
    GenSetLike → Function1
  25. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  26. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  27. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  28. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  29. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  30. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  31. 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
  32. def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  33. final def contains(e: T): Boolean
    Definition Classes
    UIDSet → SetLike → GenSetLike
  34. def containsId(id: Int): Boolean
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → UIDSet
  35. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  36. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  38. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  39. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def diff(that: GenSet[T]): UIDSet[T]
    Definition Classes
    SetLike → GenSetLike
  41. def drop(n: Int): UIDSet[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  42. def dropRight(n: Int): UIDSet[T]
    Definition Classes
    IterableLike
  43. def dropWhile(p: (T) ⇒ Boolean): UIDSet[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  44. final def empty: UIDSet[T]
    Definition Classes
    UIDSet → SetLike → GenericSetTemplate
  45. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  46. def equals(that: Any): Boolean
    Definition Classes
    UIDTrieSetLeaf → GenSetLike → Equals → AnyRef → Any
  47. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → UIDSet → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. def filter(p: (T) ⇒ Boolean): UIDSet[T]
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → TraversableLike → GenTraversableLike
  49. def filterNot(p: (T) ⇒ Boolean): UIDSet[T]
    Definition Classes
    UIDTrieSetNodeLike → TraversableLike → GenTraversableLike
  50. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  51. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. def findById(id: Int): Option[T]
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → UIDSet
  53. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  54. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  55. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → UIDSet → TraversableOnce → GenTraversableOnce
  57. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  58. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → UIDSet → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  60. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  61. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  62. def groupBy[K](f: (T) ⇒ K): Map[K, UIDSet[T]]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def grouped(size: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableLike
  64. def growIdSet(set: IntTrieSet): IntTrieSet
    Attributes
    protected[org.opalj.collection.immutable]
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike
  65. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  66. def hashCode(): Int
    Definition Classes
    UIDTrieSetLeaf → GenSetLike → AnyRef → Any
  67. def head: T
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → UIDSet → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  68. final def headOption: Option[T]
    Definition Classes
    NonEmptyUIDSet → TraversableLike → GenTraversableLike
  69. def idIterator: IntIterator

    Iterator over all ids.

    Iterator over all ids.

    Definition Classes
    UIDTrieSetNodeLike → UIDSet
  70. def idSet: IntTrieSet
    Definition Classes
    UIDTrieSetNodeLike → UIDSet
  71. final def includes[X >: T <: UID](e: X): Boolean
    Definition Classes
    UIDSet
  72. def init: UIDSet[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def inits: Iterator[UIDSet[T]]
    Definition Classes
    TraversableLike
  74. def intersect(that: GenSet[T]): UIDSet[T]
    Definition Classes
    GenSetLike
  75. final def isEmpty: Boolean
    Definition Classes
    NonEmptyUIDSet → SetLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
  76. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  77. def isSingletonSet: Boolean
    Definition Classes
    UIDTrieSetNodeLike → UIDSet
  78. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  79. def iterator: RefIterator[T]
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → UIDSet → GenSetLike → IterableLike → GenIterableLike
  80. 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
    UIDTrieSetLeaf → UIDSet → TraversableLike → GenTraversableLike
  81. def lastOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def left: UIDTrieSetNodeLike[T]
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike
  83. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike → FilterMonadic
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.

  84. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  92. def newBuilder: Builder[T, UIDSet[T]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  93. final def nonEmpty: Boolean
    Definition Classes
    NonEmptyUIDSet → TraversableOnce → GenTraversableOnce
  94. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  95. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  96. def par: ParSet[T]
    Definition Classes
    Parallelizable
  97. def parCombiner: Combiner[T, ParSet[T]]
    Attributes
    protected
    Definition Classes
    Set → SetLike → Iterable → TraversableLike → Parallelizable
  98. def partition(p: (T) ⇒ Boolean): (UIDSet[T], UIDSet[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  102. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  105. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def repr: UIDSet[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  107. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  108. def right: UIDTrieSetNodeLike[T]
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike
  109. def sameElements[B >: T](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  110. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  112. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  113. def seq: Set[T]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  114. def showTree(level: Int = 0): String
    Definition Classes
    UIDTrieSetNodeLike
  115. def size: Int
    Definition Classes
    UIDTrieSetLeaf → GenTraversableLike → TraversableOnce → GenTraversableOnce
  116. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  117. def slice(from: Int, until: Int): UIDSet[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  118. def sliding(size: Int, step: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableLike
  119. def sliding(size: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableLike
  120. def span(p: (T) ⇒ Boolean): (UIDSet[T], UIDSet[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  121. def splitAt(n: Int): (UIDSet[T], UIDSet[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def stringPrefix: String
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike
  123. def subsetOf(that: GenSet[T]): Boolean
    Definition Classes
    GenSetLike
  124. def subsets(): Iterator[UIDSet[T]]
    Definition Classes
    SetLike
  125. def subsets(len: Int): Iterator[UIDSet[T]]
    Definition Classes
    SetLike
  126. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  128. def tail: UIDSet[T]
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike → UIDSet → TraversableLike → GenTraversableLike
  129. def tails: Iterator[UIDSet[T]]
    Definition Classes
    TraversableLike
  130. def take(n: Int): UIDSet[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  131. def takeRight(n: Int): UIDSet[T]
    Definition Classes
    IterableLike
  132. def takeWhile(p: (T) ⇒ Boolean): UIDSet[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  133. def thisCollection: Iterable[T]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  134. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  135. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def toBuffer[A1 >: T]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  137. def toCollection(repr: UIDSet[T]): Iterable[T]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  138. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def toIterable: Iterable[T]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  140. def toIterator: Iterator[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  141. final def toLinearProbingSet[X >: T <: UID](implicit arg0: ClassTag[X]): UIDLinearProbingSet[X]

    Converts this UIDSet to a UIDLinearProbingSet which generally offers much better query (contains check) performance - in particular if the sets are larger.

    Converts this UIDSet to a UIDLinearProbingSet which generally offers much better query (contains check) performance - in particular if the sets are larger. (Factory 2 to 3 times better for larger sets.)

    Definition Classes
    UIDSet
  142. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toRefArray: RefArray[T]
    Definition Classes
    UIDSet
  145. def toSeq: Seq[T]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  146. def toSet[B >: T]: Set[B]
    Definition Classes
    Set → TraversableOnce → GenTraversableOnce
  147. def toStream: Stream[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  148. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  149. def toTraversable: Traversable[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  150. final def toUIDSet[X >: T <: UID]: UIDSet[X]
    Definition Classes
    UIDSet
  151. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Set[Set[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  153. def union(that: GenSet[T]): UIDSet[T]
    Definition Classes
    SetLike → GenSetLike
  154. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  155. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  156. val value: T
    Definition Classes
    UIDTrieSetLeaf → UIDTrieSetNodeLike
  157. def view(from: Int, until: Int): IterableView[T, UIDSet[T]]
    Definition Classes
    IterableLike → TraversableLike
  158. def view: IterableView[T, UIDSet[T]]
    Definition Classes
    IterableLike → TraversableLike
  159. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  160. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  161. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  162. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, UIDSet[T]]
    Definition Classes
    TraversableLike → FilterMonadic
  163. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[UIDSet[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  164. def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[UIDSet[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  165. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[UIDSet[T], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  166. def |(that: GenSet[T]): UIDSet[T]
    Definition Classes
    GenSetLike

Inherited from UIDTrieSetNodeLike[T]

Inherited from NonEmptyUIDSet[T]

Inherited from UIDSet[T]

Inherited from Set[T]

Inherited from Set[T]

Inherited from SetLike[T, UIDSet[T]]

Inherited from Subtractable[T, UIDSet[T]]

Inherited from GenSet[T]

Inherited from GenericSetTemplate[T, Set]

Inherited from GenSetLike[T, UIDSet[T]]

Inherited from (T) ⇒ Boolean

Inherited from Iterable[T]

Inherited from Iterable[T]

Inherited from IterableLike[T, UIDSet[T]]

Inherited from Equals

Inherited from GenIterable[T]

Inherited from GenIterableLike[T, UIDSet[T]]

Inherited from Traversable[T]

Inherited from Immutable

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, Set]

Inherited from TraversableLike[T, UIDSet[T]]

Inherited from GenTraversableLike[T, UIDSet[T]]

Inherited from Parallelizable[T, ParSet[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, UIDSet[T]]

Inherited from HasNewBuilder[T, UIDSet[T]]

Inherited from AnyRef

Inherited from Any

Ungrouped