Constructor and Description |
---|
OrdinalSet(IntSet S,
OrdinalSetMapping<T> mapping) |
Modifier and Type | Method and Description |
---|---|
boolean |
contains(T object) |
boolean |
containsAny(OrdinalSet<T> that) |
static <T> OrdinalSet<T> |
empty() |
static <T> boolean |
equals(OrdinalSet<T> a,
OrdinalSet<T> b) |
IntSet |
getBackingSet()
Dangerous.
|
OrdinalSetMapping<T> |
getMapping() |
static <T> OrdinalSet<T> |
intersect(OrdinalSet<T> A,
OrdinalSet<T> B) |
boolean |
isEmpty() |
Iterator<T> |
iterator() |
SparseIntSet |
makeSparseCopy() |
int |
size() |
static <T> Collection<T> |
toCollection(OrdinalSet<T> instances) |
static <T> OrdinalSet<T> |
toOrdinalSet(Collection<T> c,
OrdinalSetMapping<T> m)
Precondition: the ordinal set mapping has an index for every element of c Convert a "normal" collection to an OrdinalSet, based
on the given mapping.
|
String |
toString() |
static <T> OrdinalSet<T> |
unify(OrdinalSet<T> A,
OrdinalSet<T> B)
Creates the union of two ordinal sets.
|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
forEach, spliterator
public OrdinalSet(IntSet S, OrdinalSetMapping<T> mapping)
public static <T> OrdinalSet<T> empty()
public boolean containsAny(OrdinalSet<T> that)
public int size()
public static <T> OrdinalSet<T> intersect(OrdinalSet<T> A, OrdinalSet<T> B)
IllegalArgumentException
- if A is nullpublic static <T> boolean equals(OrdinalSet<T> a, OrdinalSet<T> b)
public static <T> OrdinalSet<T> unify(OrdinalSet<T> A, OrdinalSet<T> B)
A
- ordinal set aB
- ordinal set bIllegalArgumentException
- iff A or B is nullpublic SparseIntSet makeSparseCopy()
public IntSet getBackingSet()
public boolean contains(T object)
public boolean isEmpty()
public static <T> Collection<T> toCollection(OrdinalSet<T> instances)
NullPointerException
- if instances is nullpublic static <T> OrdinalSet<T> toOrdinalSet(Collection<T> c, OrdinalSetMapping<T> m)
IllegalArgumentException
- if c is nullpublic OrdinalSetMapping<T> getMapping()