sealed abstract class IntArraySet extends (Int) ⇒ Int with IntSet[IntArraySet] with IntCollectionWithStableOrdering[IntArraySet]
A sorted set of integer values backed by an ordered array to store the values; this guarantees log2(n) lookup.
- Alphabetic
- By Inheritance
- IntArraySet
- IntCollectionWithStableOrdering
- IntSet
- Function1
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
+(i: Int): IntArraySet
- Definition Classes
- IntSet
-
abstract
def
-(i: Int): IntArraySet
- Definition Classes
- IntSet
-
abstract
def
apply(v1: Int): Int
- Definition Classes
- Function1
-
abstract
def
contains(value: Int): Boolean
- Definition Classes
- IntSet
-
abstract
def
exists(p: (Int) ⇒ Boolean): Boolean
- Definition Classes
- IntSet
-
abstract
def
flatMap(f: (Int) ⇒ IntArraySet): IntArraySet
- 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),(1,8) and (4,8) will be returned; the pairings (4,1) etc. will not be returned. 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
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]): IntArraySet
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): IntArraySet
- Definition Classes
- IntSet
- abstract def max: Int
- abstract def min: Int
- abstract def reverseIntIterator: IntIterator
-
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): IntArraySet
- Definition Classes
- IntSet
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
++(that: IntIterator): IntArraySet
- Definition Classes
- IntSet
-
final
def
++(that: TraversableOnce[Int]): IntArraySet
- Definition Classes
- IntSet
-
final
def
++(that: IntArraySet): IntArraySet
- Definition Classes
- IntSet
-
final
def
--(is: IntSet[_]): IntArraySet
- Definition Classes
- IntSet
-
final
def
--(is: TraversableOnce[Int]): IntArraySet
- Definition Classes
- IntSet
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
andThen[A](g: (Int) ⇒ A): (Int) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ Int
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
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()
-
final
def
head: Int
- Definition Classes
- IntArraySet → IntSet
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def last: Int
-
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()
-
def
subsetOf(other: IntArraySet): Boolean
- Definition Classes
- IntCollectionWithStableOrdering
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toArray: Array[Int]
- Definition Classes
- IntSet
-
final
def
toString(): String
- Definition Classes
- IntArraySet → Function1 → 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( ... )