org.optaplanner.examples.common.experimental.impl.IntervalTree Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of optaplanner-examples Show documentation
Show all versions of optaplanner-examples Show documentation
OptaPlanner solves planning problems.
This lightweight, embeddable planning engine implements powerful and scalable algorithms
to optimize business resource scheduling and planning.
This module contains the examples which demonstrate how to use it in a normal Java application.
/*
* Copyright 2021 Red Hat, Inc. and/or its affiliates.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.optaplanner.examples.common.experimental.impl;
import java.util.Iterator;
import java.util.TreeSet;
import java.util.function.BiFunction;
import java.util.function.Function;
public final class IntervalTree, Difference_ extends Comparable> {
private final Function startMapping;
private final Function endMapping;
private final TreeSet> splitPointSet;
private final ConsecutiveIntervalInfoImpl consecutiveIntervalData;
public IntervalTree(Function startMapping, Function endMapping,
BiFunction differenceFunction) {
this.startMapping = startMapping;
this.endMapping = endMapping;
this.splitPointSet = new TreeSet<>();
this.consecutiveIntervalData = new ConsecutiveIntervalInfoImpl<>(splitPointSet, differenceFunction);
}
public Interval getInterval(Interval_ intervalValue) {
return new Interval<>(intervalValue, startMapping, endMapping);
}
public boolean isEmpty() {
return splitPointSet.isEmpty();
}
public boolean contains(Interval_ o) {
if (null == o || splitPointSet.isEmpty()) {
return false;
}
Interval interval = getInterval(o);
IntervalSplitPoint floorStartSplitPoint =
splitPointSet.floor(interval.getStartSplitPoint());
if (floorStartSplitPoint == null) {
return false;
}
return floorStartSplitPoint.containsIntervalStarting(interval);
}
public Iterator iterator() {
return new IntervalTreeIterator<>(splitPointSet);
}
public boolean add(Interval interval) {
IntervalSplitPoint startSplitPoint = interval.getStartSplitPoint();
IntervalSplitPoint endSplitPoint = interval.getEndSplitPoint();
boolean isChanged;
IntervalSplitPoint flooredStartSplitPoint = splitPointSet.floor(startSplitPoint);
if (flooredStartSplitPoint == null || !flooredStartSplitPoint.equals(startSplitPoint)) {
splitPointSet.add(startSplitPoint);
startSplitPoint.createCollections();
isChanged = startSplitPoint.addIntervalStartingAtSplitPoint(interval);
} else {
isChanged = flooredStartSplitPoint.addIntervalStartingAtSplitPoint(interval);
}
IntervalSplitPoint ceilingEndSplitPoint = splitPointSet.ceiling(endSplitPoint);
if (ceilingEndSplitPoint == null || !ceilingEndSplitPoint.equals(endSplitPoint)) {
splitPointSet.add(endSplitPoint);
endSplitPoint.createCollections();
isChanged |= endSplitPoint.addIntervalEndingAtSplitPoint(interval);
} else {
isChanged |= ceilingEndSplitPoint.addIntervalEndingAtSplitPoint(interval);
}
if (isChanged) {
consecutiveIntervalData.addInterval(interval);
}
return true;
}
public boolean remove(Interval interval) {
IntervalSplitPoint startSplitPoint = interval.getStartSplitPoint();
IntervalSplitPoint endSplitPoint = interval.getEndSplitPoint();
IntervalSplitPoint flooredStartSplitPoint = splitPointSet.floor(startSplitPoint);
if (flooredStartSplitPoint == null || !flooredStartSplitPoint.containsIntervalStarting(interval)) {
return false;
}
flooredStartSplitPoint.removeIntervalStartingAtSplitPoint(interval);
if (flooredStartSplitPoint.isEmpty()) {
splitPointSet.remove(flooredStartSplitPoint);
}
IntervalSplitPoint ceilEndSplitPoint = splitPointSet.ceiling(endSplitPoint);
// Not null since the start point contained the interval
ceilEndSplitPoint.removeIntervalEndingAtSplitPoint(interval);
if (ceilEndSplitPoint.isEmpty()) {
splitPointSet.remove(ceilEndSplitPoint);
}
consecutiveIntervalData.removeInterval(interval);
return true;
}
public ConsecutiveIntervalInfoImpl getConsecutiveIntervalData() {
return consecutiveIntervalData;
}
}