static <T extends RingPosition<T>> void |
Range.assertNormalized(java.util.List<Range<T>> ranges) |
|
static <T extends RingPosition<T>> AbstractBounds<T> |
AbstractBounds.bounds(AbstractBounds.Boundary<T> min,
AbstractBounds.Boundary<T> max) |
|
static <T extends RingPosition<T>> AbstractBounds<T> |
AbstractBounds.bounds(T min,
boolean inclusiveMin,
T max,
boolean inclusiveMax) |
|
static <T extends RingPosition<T>> boolean |
Range.contains(T left,
T right,
T point) |
|
static <T extends RingPosition<T>> java.util.List<Range<T>> |
Range.deoverlap(java.util.List<Range<T>> ranges) |
Given a list of unwrapped ranges sorted by left position, return an
equivalent list of ranges but with no overlapping ranges.
|
static <T extends RingPosition<T>> java.util.Set<Bounds<T>> |
Bounds.getNonOverlappingBounds(java.lang.Iterable<Bounds<T>> bounds) |
Retrieves non-overlapping bounds for the list of input bounds
Assume we have the following bounds
(brackets representing left/right bound):
[ ] [ ] [ ] [ ]
[ ] [ ]
This method will return the following bounds:
[ ] [ ]
|
static <T extends RingPosition<T>> java.util.List<Range<T>> |
Range.intersect(java.util.Collection<Range<T>> ranges1,
java.util.Collection<Range<T>> ranges2) |
|
static <T extends RingPosition<T>> boolean |
AbstractBounds.isEmpty(AbstractBounds.Boundary<T> left,
AbstractBounds.Boundary<T> right) |
|
static <T extends RingPosition<T>> boolean |
Bounds.isInBounds(T token,
java.lang.Iterable<Bounds<T>> bounds) |
|
static <T extends RingPosition<T>> boolean |
Range.isInRanges(T token,
java.lang.Iterable<Range<T>> ranges) |
|
static <T extends RingPosition<T>> boolean |
Range.isWrapAround(T left,
T right) |
Tells if the given range is a wrap around.
|
static <T extends RingPosition<T>> AbstractBounds.Boundary<T> |
AbstractBounds.maxLeft(AbstractBounds.Boundary<T> left1,
AbstractBounds.Boundary<T> left2) |
|
static <T extends RingPosition<T>> AbstractBounds.Boundary<T> |
AbstractBounds.maxLeft(AbstractBounds.Boundary<T> left1,
T left2,
boolean isInclusiveLeft2) |
|
static <T extends RingPosition<T>> AbstractBounds.Boundary<T> |
AbstractBounds.minRight(AbstractBounds.Boundary<T> right1,
AbstractBounds.Boundary<T> right2) |
|
static <T extends RingPosition<T>> AbstractBounds.Boundary<T> |
AbstractBounds.minRight(AbstractBounds.Boundary<T> right1,
T right2,
boolean isInclusiveRight2) |
|
static <T extends RingPosition<T>> boolean |
AbstractBounds.noneStrictlyWrapsAround(java.util.Collection<AbstractBounds<T>> bounds) |
|
static <T extends RingPosition<T>> java.util.List<Range<T>> |
Range.normalize(java.util.Collection<Range<T>> ranges) |
|
static <T extends RingPosition<T>> java.util.Set<Range<T>> |
Range.rangeSet(Range<T> range) |
|
static <T extends RingPosition<T>> java.util.Set<Range<T>> |
Range.rangeSet(Range<T>... ranges) |
|
static <T extends RingPosition<T>> java.util.List<Range<T>> |
Range.sort(java.util.Collection<Range<T>> ranges) |
|
static <T extends RingPosition<T>> boolean |
AbstractBounds.strictlyWrapsAround(T left,
T right) |
Whether left and right forms a wrapping interval, that is if unwrapping wouldn't be a no-op.
|
static <T extends RingPosition<T>> java.util.Set<Range<T>> |
Range.subtract(java.util.Collection<Range<T>> ranges,
java.util.Collection<Range<T>> subtract) |
|