public class SortedSetRelation extends Object
| Modifier and Type | Field and Description |
|---|---|
static int |
A
There are 8 combinations of the relationship bits.
|
static int |
A_AND_B
The relationship between two sets A and B can be determined by looking at:
A - B
A & B (intersection)
B - A
These are represented by a set of bits.
|
static int |
A_NOT_B
The relationship between two sets A and B can be determined by looking at:
A - B
A & B (intersection)
B - A
These are represented by a set of bits.
|
static int |
ADDALL
There are 8 combinations of the relationship bits.
|
static int |
ANY
There are 8 combinations of the relationship bits.
|
static int |
B
There are 8 combinations of the relationship bits.
|
static int |
B_NOT_A
The relationship between two sets A and B can be determined by looking at:
A - B
A & B (intersection)
B - A
These are represented by a set of bits.
|
static int |
B_REMOVEALL
There are 8 combinations of the relationship bits.
|
static int |
COMPLEMENTALL
There are 8 combinations of the relationship bits.
|
static int |
CONTAINS
There are 8 combinations of the relationship bits.
|
static int |
DISJOINT
There are 8 combinations of the relationship bits.
|
static int |
EQUALS
There are 8 combinations of the relationship bits.
|
static int |
ISCONTAINED
There are 8 combinations of the relationship bits.
|
static int |
NO_A
There are 8 combinations of the relationship bits.
|
static int |
NO_B
There are 8 combinations of the relationship bits.
|
static int |
NONE
There are 8 combinations of the relationship bits.
|
static int |
REMOVEALL
There are 8 combinations of the relationship bits.
|
static int |
RETAINALL
There are 8 combinations of the relationship bits.
|
| Constructor and Description |
|---|
SortedSetRelation() |
| Modifier and Type | Method and Description |
|---|---|
static <T extends Object & Comparable<? super T>> |
doOperation(SortedSet<T> a,
int relation,
SortedSet<T> b)
Utility that could be on SortedSet.
|
static <T extends Object & Comparable<? super T>> |
hasRelation(SortedSet<T> a,
int allow,
SortedSet<T> b)
Utility that could be on SortedSet.
|
public static final int A_NOT_B
public static final int A_AND_B
public static final int B_NOT_A
public static final int ANY
public static final int CONTAINS
public static final int DISJOINT
public static final int ISCONTAINED
public static final int NO_B
public static final int EQUALS
public static final int NO_A
public static final int NONE
public static final int ADDALL
public static final int A
public static final int COMPLEMENTALL
public static final int B
public static final int REMOVEALL
public static final int RETAINALL
public static final int B_REMOVEALL
public static <T extends Object & Comparable<? super T>> boolean hasRelation(SortedSet<T> a, int allow, SortedSet<T> b)
a - first setallow - filter, using ANY, CONTAINS, etc.b - second setpublic static <T extends Object & Comparable<? super T>> SortedSet<? extends T> doOperation(SortedSet<T> a, int relation, SortedSet<T> b)
a - first setrelation - the relation filter, using ANY, CONTAINS, etc.b - second set