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

sealed abstract class UIDSet[T <: UID] extends Set[T] with SetLike[T, 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.

Linear Supertypes
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
Known Subclasses
NonEmptyUIDSet, UIDSet0, UIDSet1, UIDSet2, UIDSet3
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UIDSet
  2. Set
  3. Set
  4. SetLike
  5. Subtractable
  6. GenSet
  7. GenericSetTemplate
  8. GenSetLike
  9. Function1
  10. Iterable
  11. Iterable
  12. IterableLike
  13. Equals
  14. GenIterable
  15. GenIterableLike
  16. Traversable
  17. Immutable
  18. Traversable
  19. GenTraversable
  20. GenericTraversableTemplate
  21. TraversableLike
  22. GenTraversableLike
  23. Parallelizable
  24. TraversableOnce
  25. GenTraversableOnce
  26. FilterMonadic
  27. HasNewBuilder
  28. AnyRef
  29. 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

Abstract Value Members

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

    Iterator over all ids.

  7. abstract def idSet: IntTrieSet
  8. abstract def isSingletonSet: Boolean
  9. abstract def iterator: RefIterator[T]
    Definition Classes
    UIDSet → GenSetLike → IterableLike → GenIterableLike

Concrete 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. def +(elem1: T, elem2: T, elems: T*): UIDSet[T]
    Definition Classes
    SetLike
  6. def ++(elems: GenTraversableOnce[T]): UIDSet[T]
    Definition Classes
    SetLike
  7. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  8. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike
  9. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike
  10. def -(elem1: T, elem2: T, elems: T*): UIDSet[T]
    Definition Classes
    Subtractable
  11. def --(xs: GenTraversableOnce[T]): UIDSet[T]
    Definition Classes
    Subtractable
  12. def /:[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. def :\[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. final def add[X >: T <: UID](e: X): UIDSet[X]
  16. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  17. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  18. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  19. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. def andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  21. def apply(elem: T): Boolean
    Definition Classes
    GenSetLike → Function1
  22. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  23. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  24. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  25. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  26. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  27. def companion: GenericCompanion[Set]
    Definition Classes
    Set → Set → GenSet → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  28. def compare(that: UIDSet[T]): SetRelation

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

  29. def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  30. final def contains(e: T): Boolean
    Definition Classes
    UIDSet → SetLike → GenSetLike
  31. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  35. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def diff(that: GenSet[T]): UIDSet[T]
    Definition Classes
    SetLike → GenSetLike
  37. def drop(n: Int): UIDSet[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  38. def dropRight(n: Int): UIDSet[T]
    Definition Classes
    IterableLike
  39. def dropWhile(p: (T) ⇒ Boolean): UIDSet[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  40. final def empty: UIDSet[T]
    Definition Classes
    UIDSet → SetLike → GenericSetTemplate
  41. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. def equals(that: Any): Boolean
    Definition Classes
    GenSetLike → Equals → AnyRef → Any
  43. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  44. def filter(p: (T) ⇒ Boolean): UIDSet[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  45. def filterNot(p: (T) ⇒ Boolean): UIDSet[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  46. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  47. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  49. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Set[B]
    Definition Classes
    GenericTraversableTemplate
  50. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  51. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  52. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  53. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  54. def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  55. def genericBuilder[B]: Builder[B, Set[B]]
    Definition Classes
    GenericTraversableTemplate
  56. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  57. def groupBy[K](f: (T) ⇒ K): Map[K, UIDSet[T]]
    Definition Classes
    TraversableLike → GenTraversableLike
  58. def grouped(size: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableLike
  59. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  60. def hashCode(): Int
    Definition Classes
    GenSetLike → AnyRef → Any
  61. def head: T
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  62. def headOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. final def includes[X >: T <: UID](e: X): Boolean
  64. def init: UIDSet[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def inits: Iterator[UIDSet[T]]
    Definition Classes
    TraversableLike
  66. def intersect(that: GenSet[T]): UIDSet[T]
    Definition Classes
    GenSetLike
  67. def isEmpty: Boolean
    Definition Classes
    SetLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  68. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  69. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  70. def last: T
    Definition Classes
    TraversableLike → GenTraversableLike
  71. def lastOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  72. 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.

  73. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  79. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  81. def newBuilder: Builder[T, UIDSet[T]]
    Attributes
    protected[this]
    Definition Classes
    SetLike → TraversableLike → HasNewBuilder
  82. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  84. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  85. def par: ParSet[T]
    Definition Classes
    Parallelizable
  86. def parCombiner: Combiner[T, ParSet[T]]
    Attributes
    protected
    Definition Classes
    Set → SetLike → Iterable → TraversableLike → Parallelizable
  87. def partition(p: (T) ⇒ Boolean): (UIDSet[T], UIDSet[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  88. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  91. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  94. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def repr: UIDSet[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  96. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  97. def sameElements[B >: T](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  98. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[UIDSet[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  100. 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.

  101. def seq: Set[T]
    Definition Classes
    Set → Set → GenSet → GenSetLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  102. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  104. def slice(from: Int, until: Int): UIDSet[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  105. def sliding(size: Int, step: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableLike
  106. def sliding(size: Int): Iterator[UIDSet[T]]
    Definition Classes
    IterableLike
  107. def span(p: (T) ⇒ Boolean): (UIDSet[T], UIDSet[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def splitAt(n: Int): (UIDSet[T], UIDSet[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def stringPrefix: String
    Definition Classes
    SetLike → TraversableLike → GenTraversableLike
  110. def subsetOf(that: GenSet[T]): Boolean
    Definition Classes
    GenSetLike
  111. def subsets(): Iterator[UIDSet[T]]
    Definition Classes
    SetLike
  112. def subsets(len: Int): Iterator[UIDSet[T]]
    Definition Classes
    SetLike
  113. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  115. def tail: UIDSet[T]
    Definition Classes
    UIDSet → TraversableLike → GenTraversableLike
  116. def tails: Iterator[UIDSet[T]]
    Definition Classes
    TraversableLike
  117. def take(n: Int): UIDSet[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  118. def takeRight(n: Int): UIDSet[T]
    Definition Classes
    IterableLike
  119. def takeWhile(p: (T) ⇒ Boolean): UIDSet[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  120. def thisCollection: Iterable[T]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  121. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  122. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def toBuffer[A1 >: T]: Buffer[A1]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  124. def toCollection(repr: UIDSet[T]): Iterable[T]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  125. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def toIterable: Iterable[T]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  127. def toIterator: Iterator[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  128. 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.)

  129. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def toRefArray: RefArray[T]
  132. def toSeq: Seq[T]
    Definition Classes
    SetLike → TraversableOnce → GenTraversableOnce
  133. def toSet[B >: T]: Set[B]
    Definition Classes
    Set → TraversableOnce → GenTraversableOnce
  134. def toStream: Stream[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  135. def toString(): String
    Definition Classes
    SetLike → Function1 → TraversableLike → AnyRef → Any
  136. def toTraversable: Traversable[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  137. final def toUIDSet[X >: T <: UID]: UIDSet[X]
  138. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. 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.

  140. def union(that: GenSet[T]): UIDSet[T]
    Definition Classes
    SetLike → GenSetLike
  141. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Set[A1], Set[A2])
    Definition Classes
    GenericTraversableTemplate
  142. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])
    Definition Classes
    GenericTraversableTemplate
  143. def view(from: Int, until: Int): IterableView[T, UIDSet[T]]
    Definition Classes
    IterableLike → TraversableLike
  144. def view: IterableView[T, UIDSet[T]]
    Definition Classes
    IterableLike → TraversableLike
  145. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  146. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  147. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  148. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, UIDSet[T]]
    Definition Classes
    TraversableLike → FilterMonadic
  149. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[UIDSet[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  150. 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
  151. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[UIDSet[T], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  152. def |(that: GenSet[T]): UIDSet[T]
    Definition Classes
    GenSetLike

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