sealed abstract class IntTrieSet extends IntSet[IntTrieSet] with IntCollectionWithStableOrdering[IntTrieSet] with IntWorkSet[IntTrieSet]
An unordered set of integer values backed by a trie set. The branching is done using the least significant bit and values are only stored in leaf nodes. This ensure that we have a stable iteration order.
- Self Type
- IntTrieSet
- Alphabetic
- By Inheritance
- IntTrieSet
- IntWorkSet
- IntCollectionWithStableOrdering
- IntSet
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
+(i: Int): IntTrieSet
- Definition Classes
- IntSet
-
abstract
def
+!(value: Int): IntTrieSet
Tries to add the given method to this trie set by mutating the set if possible.
Tries to add the given method to this trie set by mutating the set if possible. Due to the internal organization, mutating the set is not always possible. In this case, a new set containing the new value is returned. Hence, the return value does not have to be ignored!
-
abstract
def
-(i: Int): IntTrieSet
- Definition Classes
- IntSet
-
abstract
def
contains(value: Int): Boolean
- Definition Classes
- IntSet
-
abstract
def
exists(p: (Int) ⇒ Boolean): Boolean
- Definition Classes
- IntSet
- abstract def filter(p: (Int) ⇒ Boolean): IntTrieSet
-
abstract
def
flatMap(f: (Int) ⇒ IntTrieSet): IntTrieSet
- Definition Classes
- IntSet
-
abstract
def
foldLeft[B](z: B)(f: (B, Int) ⇒ B): B
- Definition Classes
- IntSet
-
abstract
def
forall(f: (Int) ⇒ Boolean): Boolean
- Definition Classes
- IntSet
-
abstract
def
foreach[U](f: (Int) ⇒ U): Unit
- Definition Classes
- IntSet
-
abstract
def
foreachPair[U](f: (Int, Int) ⇒ U): Unit
Returns each pairing of two values.
Returns each pairing of two values. I.e., if the set contains 1, 4, 8, the pairings ((1,4) XOR (4,1)),((1,8) XOR (8,1)) and ((4,8) XOR (8,4)) will be returned; hence, the order between the two values is not defined.
-
abstract
def
hasMultipleElements: Boolean
Tests if this set has more than one element (complexity: O(1)).
Tests if this set has more than one element (complexity: O(1)).
- Definition Classes
- IntSet
-
abstract
def
head: Int
- Definition Classes
- IntSet
-
abstract
def
headAndTail: IntRefPair[IntTrieSet]
Returns some value and removes it from this set.
Returns some value and removes it from this set.
- Definition Classes
- IntTrieSet → IntWorkSet
-
abstract
def
isEmpty: Boolean
- Definition Classes
- IntSet
-
abstract
def
isSingletonSet: Boolean
Tests if this set has exactly one element (complexity: O(1)).
Tests if this set has exactly one element (complexity: O(1)).
- Definition Classes
- IntSet
-
abstract
def
iterator: IntIterator
- Definition Classes
- IntSet
-
abstract
def
map(map: Array[Int]): IntTrieSet
Uses the keys of this set to map them to the value found in the given array at the respective index.
Uses the keys of this set to map them to the value found in the given array at the respective index.
- Definition Classes
- IntSet
-
abstract
def
map(f: (Int) ⇒ Int): IntTrieSet
- Definition Classes
- IntSet
-
abstract
def
size: Int
The size of the set; may not be a constant operation; if possible use isEmpty, nonEmpty, etc.; or lookup the complexity in the concrete data structures.
The size of the set; may not be a constant operation; if possible use isEmpty, nonEmpty, etc.; or lookup the complexity in the concrete data structures.
- Definition Classes
- IntSet
-
abstract
def
toChain: Chain[Int]
- Definition Classes
- IntSet
-
abstract
def
withFilter(p: (Int) ⇒ Boolean): IntTrieSet
- Definition Classes
- IntTrieSet → IntSet
Concrete Value Members
-
final
def
!++!(that: IntTrieSet): IntTrieSet
Merges the values of this and the given set into the set that is larger.
Merges the values of this and the given set into the set that is larger. If both sets have equal sizes, then the given one is merged into this one.
- See also
+!(Int)for details!
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
++(that: IntIterator): IntTrieSet
- Definition Classes
- IntSet
-
final
def
++(that: TraversableOnce[Int]): IntTrieSet
- Definition Classes
- IntSet
-
final
def
++(that: IntTrieSet): IntTrieSet
- Definition Classes
- IntSet
-
final
def
++!(that: IntTrieSet): IntTrieSet
- See also
+!(Int)for details!
-
final
def
--(is: IntSet[_]): IntTrieSet
- Definition Classes
- IntSet
-
final
def
--(is: TraversableOnce[Int]): IntTrieSet
- Definition Classes
- IntSet
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def intersect(other: IntTrieSet): IntTrieSet
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
map[A <: AnyRef](f: (Int) ⇒ A): Set[A]
- Definition Classes
- IntSet
-
final
def
mkString(in: String): String
- Definition Classes
- IntSet
-
final
def
mkString(pre: String, in: String, post: String): String
- Definition Classes
- IntSet
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nonEmpty: Boolean
- Definition Classes
- IntSet
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
subsetOf(other: IntTrieSet): Boolean
- Definition Classes
- IntTrieSet → IntCollectionWithStableOrdering
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toArray: Array[Int]
- Definition Classes
- IntSet
-
final
def
toString(): String
- Definition Classes
- IntTrieSet → AnyRef → Any
-
final
def
transform[B, To](f: (Int) ⇒ B, b: Builder[B, To]): To
- Definition Classes
- IntSet
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )