- <init>
- alterB
Changes an existing B key, past, to another B key, future, if past exists in
this K2 and future does
- alterBAt
Changes the B key at index to another B key, future, if index is valid and
future does not yet exist
- containsB
Returns true if this contains the B, key, in its collection of B items.
- getAAt
Given an int index, finds the associated A key (using index as a point in the
ordering).
- getAFromB
Given a B object, finds the associated A object (it will be at the same point in
the ordering).
- getBAt
Given an int index, finds the associated B key (using index as a point in the
ordering).
- getBFromA
Given an A object, finds the associated B object (it will be at the same point
in the ordering).
- getOrderedSetB
Returns a separate (shallow) copy of the set of B keys as an OrderedSet. To be
called sparingly, sin
- getSetB
Gets and caches the B keys as a Collection that implements SortedSet (and so
also implements Set). T
- indexOfB
Given a B object key, finds the position in the ordering that B has, or -1 if
key is not present. Un
- iteratorB
Creates a new iterator over the B keys this holds. This can be problematic for
garbage collection if