| java.lang.Object
 com.ibm.icu.impl.SortedSetRelation
| SortedSetRelation | | public class SortedSetRelation (Code) | | Computationally efficient determination of the relationship between
two SortedSets.
|
| ANYCONTAINSDISJOINTISCONTAINEDNO_BEQUALSNO_ANONEADDALLACOMPLEMENTALLBREMOVEALLRETAINALLB_REMOVEALL | | final public static int ANYCONTAINSDISJOINTISCONTAINEDNO_BEQUALSNO_ANONEADDALLACOMPLEMENTALLBREMOVEALLRETAINALLB_REMOVEALL(Code) | | There are 8 combinations of the relationship bits. These correspond to
the filters (combinations of allowed bits) in hasRelation. They also
correspond to the modification functions, listed in comments.
|
| A_NOT_BA_AND_BB_NOT_A | | final public static int A_NOT_BA_AND_BB_NOT_A(Code) | | 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.
Bit 2 is true if A - B is not empty
Bit 1 is true if A & B is not empty
BIT 0 is true if B - A is not empty
|
| doOperation | | public static SortedSet doOperation(SortedSet a, int relation, SortedSet b)(Code) | | Utility that could be on SortedSet. Allows faster implementation than
what is in Java for doing addAll, removeAll, retainAll, (complementAll).
Parameters:
a - first set
Parameters:
relation - the relation filter, using ANY, CONTAINS, etc.
Parameters:
b - second set the new set |
| hasRelation | | public static boolean hasRelation(SortedSet a, int allow, SortedSet b)(Code) | | Utility that could be on SortedSet. Faster implementation than
what is in Java for doing contains, equals, etc.
Parameters:
a - first set
Parameters:
allow - filter, using ANY, CONTAINS, etc.
Parameters:
b - second set whether the filter relationship is true or not. |
|
|