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.pm.graphic.model.event;
051:
052: import java.util.ArrayList;
053: import java.util.EventObject;
054: import java.util.Iterator;
055: import java.util.List;
056:
057: import org.apache.commons.collections.ListUtils;
058:
059: /**
060: *
061: */
062: public class CompositeCacheEvent extends EventObject {
063: protected List nodeEvents;
064: protected List edgeEvents;
065:
066: /**
067: * @param source
068: * @param nodeEvents
069: * @param edgeEvents
070: */
071: public CompositeCacheEvent(Object source, List nodeEvents,
072: List edgeEvents) {
073: super (source);
074: this .nodeEvents = nodeEvents;
075: this .edgeEvents = edgeEvents;
076: }
077:
078: public List getEdgeEvents() {
079: return edgeEvents;
080: }
081:
082: public void setEdgeEvents(List edgeEvents) {
083: this .edgeEvents = edgeEvents;
084: }
085:
086: public List getNodeEvents() {
087: return nodeEvents;
088: }
089:
090: public void setNodeEvents(List nodeEvents) {
091: this .nodeEvents = nodeEvents;
092: }
093:
094: // public ScheduleEvent getScheduleEvent() {
095: // return scheduleEvent;
096: // }
097: // public ObjectEvent getObjectEvent() {
098: // return objectEvent;
099: // }
100:
101: public String toString() {
102: return "CompositeGraphicNodeEvent: \n\t" + nodeEvents + " \n\t"
103: + edgeEvents;
104: }
105:
106: protected List insertedNodes;
107: protected List removedNodes;
108: protected List updatedNodes;
109: protected List insertedEdges;
110: protected List removedEdges;
111: protected List updatedEdges;
112: protected boolean diffListsGenerated = false;
113:
114: private void generateDiffLists() {
115: if (diffListsGenerated)
116: return;
117:
118: //nodes
119: CacheEvent event;
120: List nodes;
121: for (Iterator i = nodeEvents.iterator(); i.hasNext();) {
122: event = (CacheEvent) i.next();
123: nodes = event.getNodes();
124: switch (event.getType()) {
125: case CacheEvent.NODES_CHANGED:
126: if (nodes != null && nodes.size() > 0) {
127: if (updatedNodes == null)
128: updatedNodes = new ArrayList(nodes.size());
129: updatedNodes.addAll(nodes);
130: }
131: break;
132: case CacheEvent.NODES_INSERTED:
133: // check for hidden updates
134: if (removedNodes != null) {
135: List inter = ListUtils.intersection(nodes,
136: removedNodes);
137: if (inter.size() > 0) {
138: removedNodes.removeAll(inter);
139: nodes.removeAll(inter);
140: if (updatedNodes == null)
141: updatedNodes = new ArrayList(nodes.size());
142: updatedNodes.addAll(inter);
143: }
144: }
145:
146: if (nodes != null && nodes.size() > 0) {
147: if (insertedNodes == null)
148: insertedNodes = new ArrayList(nodes.size());
149: insertedNodes.addAll(nodes);
150: }
151: break;
152: case CacheEvent.NODES_REMOVED:
153: //INSERT FOLLOWED BY REMOVE NEVER HAPPENS
154: //nothing special to handle
155: if (nodes != null && nodes.size() > 0) {
156: if (removedNodes == null)
157: removedNodes = new ArrayList(nodes.size());
158: removedNodes.addAll(nodes);
159: }
160: break;
161: default:
162: break;
163: }
164: }
165:
166: //edges
167: for (Iterator i = edgeEvents.iterator(); i.hasNext();) {
168: event = (CacheEvent) i.next();
169: nodes = event.getNodes();
170: switch (event.getType()) {
171: case CacheEvent.NODES_CHANGED:
172: if (nodes != null && nodes.size() > 0) {
173: if (updatedEdges == null)
174: updatedEdges = new ArrayList(nodes.size());
175: updatedEdges.addAll(nodes);
176: }
177: break;
178: case CacheEvent.NODES_INSERTED:
179: if (nodes != null && nodes.size() > 0) {
180: if (insertedEdges == null)
181: insertedEdges = new ArrayList(nodes.size());
182: insertedEdges.addAll(nodes);
183: }
184: break;
185: case CacheEvent.NODES_REMOVED:
186: if (nodes != null && nodes.size() > 0) {
187: if (removedEdges == null)
188: removedEdges = new ArrayList(nodes.size());
189: removedEdges.addAll(nodes);
190: }
191: break;
192: default:
193: break;
194: }
195: }
196:
197: diffListsGenerated = true;
198: }
199:
200: public List getInsertedNodes() {
201: generateDiffLists();
202: return insertedNodes;
203: }
204:
205: public List getRemovedNodes() {
206: generateDiffLists();
207: return removedNodes;
208: }
209:
210: public List getUpdatedNodes() {
211: generateDiffLists();
212: return updatedNodes;
213: }
214:
215: public List getInsertedEdges() {
216: generateDiffLists();
217: return insertedEdges;
218: }
219:
220: public List getRemovedEdges() {
221: generateDiffLists();
222: return removedEdges;
223: }
224:
225: public List getUpdatedEdges() {
226: generateDiffLists();
227: return updatedEdges;
228: }
229:
230: public boolean isNodeHierarchy() {
231: return nodeEvents != null;
232: }
233: }
|