001: /*
002: The contents of this file are subject to the Common Public Attribution License
003: Version 1.0 (the "License"); you may not use this file except in compliance with
004: the License. You may obtain a copy of the License at
005: http://www.projity.com/license . The License is based on the Mozilla Public
006: License Version 1.1 but Sections 14 and 15 have been added to cover use of
007: software over a computer network and provide for limited attribution for the
008: Original Developer. In addition, Exhibit A has been modified to be consistent
009: with Exhibit B.
010:
011: Software distributed under the License is distributed on an "AS IS" basis,
012: WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for the
013: specific language governing rights and limitations under the License. The
014: Original Code is OpenProj. The Original Developer is the Initial Developer and
015: is Projity, Inc. All portions of the code written by Projity are Copyright (c)
016: 2006, 2007. All Rights Reserved. Contributors Projity, Inc.
017:
018: Alternatively, the contents of this file may be used under the terms of the
019: Projity End-User License Agreeement (the Projity License), in which case the
020: provisions of the Projity License are applicable instead of those above. If you
021: wish to allow use of your version of this file only under the terms of the
022: Projity License and not to allow others to use your version of this file under
023: the CPAL, indicate your decision by deleting the provisions above and replace
024: them with the notice and other provisions required by the Projity License. If
025: you do not delete the provisions above, a recipient may use your version of this
026: file under either the CPAL or the Projity License.
027:
028: [NOTE: The text of this license may differ slightly from the text of the notices
029: in Exhibits A and B of the license at http://www.projity.com/license. You should
030: use the latest text at http://www.projity.com/license for your modifications.
031: You may not remove this license text from the source files.]
032:
033: Attribution Information: Attribution Copyright Notice: Copyright © 2006, 2007
034: Projity, Inc. Attribution Phrase (not exceeding 10 words): Powered by OpenProj,
035: an open source solution from Projity. Attribution URL: http://www.projity.com
036: Graphic Image as provided in the Covered Code as file: openproj_logo.png with
037: alternatives listed on http://www.projity.com/logo
038:
039: Display of Attribution Information is required in Larger Works which are defined
040: in the CPAL as a work which combines Covered Code or portions thereof with code
041: not governed by the terms of the CPAL. However, in addition to the other notice
042: obligations, all copies of the Covered Code in Executable and Source Code form
043: distributed must, as a form of attribution of the original author, include on
044: each user interface screen the "OpenProj" logo visible to all users. The
045: OpenProj logo should be located horizontally aligned with the menu bar and left
046: justified on the top left of the screen adjacent to the File menu. The logo
047: must be at least 100 x 25 pixels. When users click on the "OpenProj" logo it
048: must direct them back to http://www.projity.com.
049: */
050: package com.projity.algorithm;
051:
052: import java.util.LinkedList;
053: import java.util.Collection;
054: import java.util.Iterator;
055:
056: /**
057: * An interval generator which is itself contains a collection of one or more other generators
058: */
059: public class IntervalGeneratorSet implements IntervalGenerator {
060: private IntervalGenerator currentIntervalGenerator = null;
061: private LinkedList generators = null;
062: private boolean sameEarliestEnding = true; // flag if more than one of the earliest generators has the same start time
063:
064: public Collection getGenerators() {
065: return generators;
066: }
067:
068: public static IntervalGenerator extractUnshared(
069: Collection generatorList) {
070: Iterator i = generatorList.iterator();
071: IntervalGenerator current;
072: while (i.hasNext()) {
073: current = (IntervalGenerator) i.next();
074: if (!current.canBeShared()) {
075: i.remove();
076: if (generatorList.isEmpty()) // list can't be empty. The fields themselves wouldn't be evalulated
077: generatorList.add(RangeIntervalGenerator
078: .continuous());
079: return current;
080: }
081: }
082: return null;
083: }
084:
085: public static IntervalGeneratorSet getInstance(
086: LinkedList intervalGenerators) {
087: return new IntervalGeneratorSet(intervalGenerators);
088: }
089:
090: public static IntervalGeneratorSet getInstance(
091: IntervalGenerator intervalGenerator) {
092: return new IntervalGeneratorSet(intervalGenerator);
093: }
094:
095: public static IntervalGeneratorSet getInstance(
096: IntervalGenerator intervalGenerator1,
097: IntervalGenerator intervalGenerator2) {
098: return new IntervalGeneratorSet(intervalGenerator1,
099: intervalGenerator2);
100: }
101:
102: /**
103: * The earliest ending interval is returned. In case of a tie, priority goes to the groupBy generator, and then
104: * the order of the from list
105: * @return
106: */
107: protected IntervalGenerator earliestEndingGenerator() {
108: long minEnd = Long.MAX_VALUE;
109: IntervalGenerator result = null;
110: if (generators != null) {
111: long generatorEnd;
112: Iterator i = generators.iterator();
113: IntervalGenerator current;
114: while (i.hasNext()) {
115: current = (IntervalGenerator) i.next();
116: generatorEnd = current.currentEnd();
117: if (generatorEnd == minEnd)
118: sameEarliestEnding = true;
119: if (generatorEnd < minEnd) {
120: minEnd = generatorEnd;
121: result = current;
122: }
123: }
124: }
125:
126: return result;
127: }
128:
129: // private long earliestStart() {
130: // long minStart = Long.MAX_VALUE;
131: // if (generators != null) {
132: // long generatorStart;
133: // Iterator i = generators.iterator();
134: // IntervalGenerator current;
135: // while (i.hasNext()) {
136: // current = (IntervalGenerator) i.next();
137: // generatorStart = current.currentStart();
138: // sameStart = generatorStart == minStart; // keep track if there is more than one with same start
139: // if (generatorStart < minStart) {
140: // minStart = generatorStart;
141: // }
142: // }
143: // }
144: // return minStart;
145: // }
146:
147: /**
148: *
149: */
150: private IntervalGeneratorSet(LinkedList intervalGenerators) {
151: super ();
152: generators = intervalGenerators;
153: initialize();
154: }
155:
156: private IntervalGeneratorSet(IntervalGenerator intervalGenerator) {
157: if (generators == null)
158: generators = new LinkedList();
159: generators.add(intervalGenerator);
160: initialize();
161: }
162:
163: private IntervalGeneratorSet(IntervalGenerator intervalGenerator1,
164: IntervalGenerator intervalGenerator2) {
165: if (generators == null)
166: generators = new LinkedList();
167: generators.add(intervalGenerator1);
168: generators.add(intervalGenerator2);
169: initialize();
170: }
171:
172: public void remove(IntervalGenerator removeMe) {
173: generators.remove(removeMe);
174: }
175:
176: public boolean isEmpty() {
177: return generators.isEmpty();
178: }
179:
180: private void initialize() {
181: currentIntervalGenerator = earliestEndingGenerator();
182: if (currentIntervalGenerator == null)
183: System.out
184: .println("0 intialize" + currentIntervalGenerator);
185: }
186:
187: /* (non-Javadoc)
188: * @see com.projity.algorithm.IntervalGenerator#current()
189: */
190: public Object current() {
191: return currentIntervalGenerator.current();
192: }
193:
194: /* (non-Javadoc)
195: * @see com.projity.algorithm.IntervalGenerator#currentEnd()
196: */
197: public long currentEnd() {
198: return currentIntervalGenerator.currentEnd();
199: }
200:
201: /* (non-Javadoc)
202: * @see com.projity.algorithm.IntervalGenerator#currentStart()
203: */
204: public long currentStart() {
205: return currentIntervalGenerator.currentStart();
206: }
207:
208: /* (non-Javadoc)
209: * @see com.projity.algorithm.IntervalGenerator#isCurrentActive()
210: */
211: public boolean isCurrentActive() {
212: return currentIntervalGenerator.isCurrentActive();
213: }
214:
215: /* (non-Javadoc)
216: * @see com.projity.algorithm.IntervalGenerator#hasNext()
217: */
218: public boolean hasNext() {
219: return currentIntervalGenerator != null;
220: }
221:
222: /* (non-Javadoc)
223: * @see com.projity.algorithm.IntervalGenerator#canBeShared()
224: */
225: public boolean canBeShared() {
226: return false;
227: }
228:
229: public boolean evaluate(Object arg0) {
230: boolean result = true;
231: currentIntervalGenerator = earliestEndingGenerator();
232: if (currentIntervalGenerator == null)
233: return false;
234:
235: // it is fairly common that two or more generators share the same endpoint. If so, they all must be evaluated
236: if (sameEarliestEnding) {
237: long earliestEnd = currentIntervalGenerator.currentEnd();
238: Iterator i = generators.iterator();
239: IntervalGenerator current;
240: while (i.hasNext()) {
241: current = (IntervalGenerator) i.next();
242: if (current.currentEnd() == earliestEnd) { // see if this generator is at the earliest end point too
243: if (!current.evaluate(arg0))
244: result = false;
245: }
246: }
247: } else { // only one generator
248: result = currentIntervalGenerator.evaluate(arg0);
249: }
250: return result;
251: }
252: }
|