Class SortedDisjointIntervalList
java.lang.Object
com.google.ortools.util.SortedDisjointIntervalList
This class represents a sorted list of disjoint, closed intervals. When an
interval is inserted, all intervals that overlap it or are adjacent to it are
merged into one. I.e. [0,14] and [15,30] will be merged to [0,30].
Iterators returned by this class are invalidated by non-const operations.
interval is inserted, all intervals that overlap it or are adjacent to it are
merged into one. I.e. [0,14] and [15,30] will be merged to [0,30].
Iterators returned by this class are invalidated by non-const operations.
-
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionSortedDisjointIntervalList(int[] starts, int[] ends) SortedDisjointIntervalList(long[] starts, long[] ends) Creates a SortedDisjointIntervalList and fills it with intervals
[starts[i]..ends[i]].SortedDisjointIntervalList(long cPtr, boolean cMemoryOwn) -
Method Summary
Modifier and TypeMethodDescriptionbuildComplementOnInterval(long start, long end) Builds the complement of the interval list on the interval [start, end].voiddelete()protected voidfinalize()static longvoidinsertInterval(long start, long end) voidinsertIntervals(int[] starts, int[] ends) voidinsertIntervals(long[] starts, long[] ends) Adds all intervals [starts[i]..ends[i]].
Same behavior as InsertInterval() upon invalid intervals.intReturns the number of disjoint intervals in the list.static longtoString()
-
Field Details
-
swigCMemOwn
protected transient boolean swigCMemOwn
-
-
Constructor Details
-
SortedDisjointIntervalList
public SortedDisjointIntervalList(long cPtr, boolean cMemoryOwn) -
SortedDisjointIntervalList
public SortedDisjointIntervalList() -
SortedDisjointIntervalList
public SortedDisjointIntervalList(long[] starts, long[] ends) Creates a SortedDisjointIntervalList and fills it with intervals
[starts[i]..ends[i]]. All intervals must be consistent (starts[i] <=
ends[i]). There are two version, one for int64_t and one for int. -
SortedDisjointIntervalList
public SortedDisjointIntervalList(int[] starts, int[] ends)
-
-
Method Details
-
getCPtr
-
swigRelease
-
finalize
-
delete
public void delete() -
buildComplementOnInterval
Builds the complement of the interval list on the interval [start, end]. -
insertIntervals
public void insertIntervals(long[] starts, long[] ends) Adds all intervals [starts[i]..ends[i]].
Same behavior as InsertInterval() upon invalid intervals. There's a version
with int64_t and int32_t. -
insertIntervals
public void insertIntervals(int[] starts, int[] ends) -
numIntervals
public int numIntervals()Returns the number of disjoint intervals in the list. -
toString
-
insertInterval
public void insertInterval(long start, long end)
-