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.buffer;
051:
052: import java.util.TreeMap;
053:
054: import com.projity.options.CalendarOption;
055: import com.projity.pm.calendar.WorkCalendar;
056:
057: /**
058: * Stores an array of values as a bunch of ordered values at dates.
059: */
060: public class NonGroupedCalculatedValues implements CalculatedValues {
061: TreeMap values = new TreeMap(); //(x,y pairs) //TODO a set would be better because this is often sparse
062: double yScale;
063: Long dates[];
064: Double vals[];
065: boolean cumulative;
066: long origin;
067: private static long MILLIS_PER_DAY = CalendarOption.getInstance()
068: .getMillisPerDay();
069:
070: public NonGroupedCalculatedValues(double yScale,
071: boolean cumulative, long origin) {
072: super ();
073: this .yScale = yScale;
074: this .cumulative = cumulative;
075: this .origin = origin;
076: }
077:
078: public NonGroupedCalculatedValues(boolean cumulative, long origin) {
079: this (1.0D, cumulative, origin);
080: }
081:
082: public int size() {
083: return vals.length;
084: }
085:
086: /**
087: * Add or modify existing point
088: * @param date
089: * @param value
090: */
091: private void setValue(long date, double value) {
092: Long longDate = new Long(date);
093: Double v = (Double) values.get(longDate);
094: if (v != null) // if already present, add to it
095: v = new Double(v.doubleValue() + value);
096: else
097: v = new Double(value);
098: values.put(longDate, v);
099: }
100:
101: /**
102: * Here is how ranges are added
103: * @param startDate - date value increases
104: * @param endDate - date value decreases
105: * @param value - amount of increase/decrease
106: */
107: public void set(final int index, final long startDate,
108: final long endDate, final double value,
109: final WorkCalendar assignmentCalendar) {
110: if (startDate == 0)
111: return;
112:
113: if (!cumulative) {
114: long duration = 0;
115: double v = value;
116: if (assignmentCalendar != null) { // can be null in case of value at date where start and end are the same
117: duration = assignmentCalendar.compare(endDate,
118: startDate, false); // need to divide by duration to get value
119: if (duration != 0) // avoid divide by zero
120: v /= (((double) duration) / CalendarOption
121: .getInstance().getMillisPerDay());
122: // else if (origin == 0) // for bars
123: // return;
124: }
125:
126: setValue(startDate, v);
127: setValue(endDate, -v);
128:
129: } else {
130: //System.out.println("start " + new Date(startDate) + " end " + new Date(endDate) + " value" + value );//+ " v/s " + v/s + " cal " + DurationFormat.format(duration));
131: setValue(startDate, 0);
132: setValue(endDate, value);
133: }
134: }
135:
136: // public void finish() {
137: // Long[] d = new Long[values.size()];
138: // Double[] v = new Double[values.size()];
139: // values.keySet().toArray(d);
140: // values.values().toArray(v);
141: // dates = new Long[d.length*2];
142: // vals = new Double[d.length*2];
143: // Double previous = new Double(0);
144: // double sum = 0;
145: // for (int i = 0; i < d.length; i++) {
146: // dates[2*i] = d[i];
147: // dates[2*i+1] = d[i];
148: // vals[2*i] = previous;
149: // sum += v[i].doubleValue();
150: //
151: // vals[2*i+1] = new Double(sum);
152: // previous = vals[2*i+1];
153: // }
154: //
155: // //makeCumulative(true); // converts + and - into correct values
156: // }
157:
158: public void makeSeries(boolean cumulative, SeriesCallback callback) {
159: Long[] d = new Long[values.size()];
160: Double[] v = new Double[values.size()];
161: values.keySet().toArray(d);
162: values.values().toArray(v);
163: double sum = 0;
164: double cum = 0;
165: double z;
166: if (cumulative) {
167: for (int i = 0; i < d.length; i++) {
168: sum += v[i].doubleValue();
169: callback.add(i, d[i].doubleValue(), sum);
170: }
171: } else {
172: for (int i = 0; i < d.length; i++) {
173: callback.add(2 * i, d[i].doubleValue(), sum);
174: sum += v[i].doubleValue();
175: callback.add(2 * i + 1, d[i].doubleValue(), sum);
176: }
177: }
178: }
179:
180: public void makeRectilinearSeries(SeriesCallback callback) {
181: makeSeries(false, callback);
182:
183: }
184:
185: public void makeContiguousNonZero(IntervalCallback callback,
186: WorkCalendar workCalendar) {
187: Long[] d = new Long[values.size()];
188: Double[] v = new Double[values.size()];
189: values.keySet().toArray(d);
190: values.values().toArray(v);
191: double sum = 0;
192: for (int i = 0; i < d.length - 1; i++) {
193: sum += v[i].doubleValue();
194: callback.add(d.length - 2 - i, d[i].longValue(), d[i + 1]
195: .longValue(), sum);
196: }
197: }
198:
199: public void makeCumulative(boolean cumulative) {
200: double sum = 0;
201: for (int i = 0; i < vals.length; i++) {
202: if (cumulative) {
203: sum += vals[i].doubleValue();
204: vals[i] = new Double(sum);
205: } else {
206: vals[i] = new Double(vals[i].doubleValue() - sum);
207: sum += vals[i].doubleValue();
208: }
209: }
210: }
211:
212: public Long getDate(int index) {
213: return dates[index];
214: }
215:
216: public Double getValue(int index) {
217: return vals[index];
218: }
219:
220: public void dump() {
221: for (int i = 0; i < vals.length; i++)
222: System.out.println(i + " "
223: + new java.util.Date(dates[i].longValue()) + " "
224: + vals[i]);
225: }
226:
227: }
|