21 package org.matsim.facilities;
23 import java.util.Collection;
24 import java.util.Iterator;
25 import java.util.SortedSet;
26 import java.util.TreeSet;
31 private Double
capacity = (double)Integer.MAX_VALUE;
48 TreeSet<OpeningTime> new_o_set =
new TreeSet<>();
50 while (o_it.hasNext()) {
52 int merge_type = o.compareTo(opentime);
53 if ((merge_type == -6) || (merge_type == 6)) {
56 new_o_set.add(opentime);
58 else if ((merge_type >= -1) && (merge_type <= 2)) {
62 else if ((merge_type == -3) || (merge_type == -2) || (merge_type == 3)) {
64 new_o_set.add(opentime);
67 if ((merge_type == -5) || (merge_type == -4)) {
70 new_o_set.add(opentime);
72 else if ((merge_type == 4) || (merge_type == 5)) {
75 new_o_set.add(opentime);
96 throw new NumberFormatException(
"A capacity of an activity must be >= 0.");
118 return "[type=" + this.type +
"]" +
119 "[capacity=" + this.capacity +
"]" +
final void setCapacity(double capacity)
void addOpeningTime(OpeningTime opentime)
ActivityOptionImpl(final String type)
SortedSet< OpeningTime > openingTimes
void setEndTime(double endtime)
final double getCapacity()
final SortedSet< OpeningTime > getOpeningTimes()
void setOpeningTimes(Collection< OpeningTime > times)
void setStartTime(double starttime)