001: /* ====================================================================
002: * The JRefactory License, Version 1.0
003: *
004: * Copyright (c) 2001 JRefactory. All rights reserved.
005: *
006: * Redistribution and use in source and binary forms, with or without
007: * modification, are permitted provided that the following conditions
008: * are met:
009: *
010: * 1. Redistributions of source code must retain the above copyright
011: * notice, this list of conditions and the following disclaimer.
012: *
013: * 2. Redistributions in binary form must reproduce the above copyright
014: * notice, this list of conditions and the following disclaimer in
015: * the documentation and/or other materials provided with the
016: * distribution.
017: *
018: * 3. The end-user documentation included with the redistribution,
019: * if any, must include the following acknowledgment:
020: * "This product includes software developed by the
021: * JRefactory (http://www.sourceforge.org/projects/jrefactory)."
022: * Alternately, this acknowledgment may appear in the software itself,
023: * if and wherever such third-party acknowledgments normally appear.
024: *
025: * 4. The names "JRefactory" must not be used to endorse or promote
026: * products derived from this software without prior written
027: * permission. For written permission, please contact seguin@acm.org.
028: *
029: * 5. Products derived from this software may not be called "JRefactory",
030: * nor may "JRefactory" appear in their name, without prior written
031: * permission of Chris Seguin.
032: *
033: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
034: * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
035: * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
036: * DISCLAIMED. IN NO EVENT SHALL THE CHRIS SEGUIN OR
037: * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
038: * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
039: * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
040: * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
041: * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
042: * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
043: * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
044: * SUCH DAMAGE.
045: * ====================================================================
046: *
047: * This software consists of voluntary contributions made by many
048: * individuals on behalf of JRefactory. For more information on
049: * JRefactory, please see
050: * <http://www.sourceforge.org/projects/jrefactory>.
051: */
052: package org.acm.seguin.uml;
053:
054: import java.util.TreeMap;
055: import java.util.Iterator;
056: import javax.swing.AbstractListModel;
057: import org.acm.seguin.summary.PackageSummary;
058:
059: /**
060: * Holds a list of packages for the list box
061: *
062: *@author Chris Seguin
063: *@created August 11, 1999
064: */
065: public class PackageSummaryListModel extends AbstractListModel {
066: // Instance Variables
067: private TreeMap orderedMap;
068: private PackageSummary[] array;
069: private boolean ready;
070:
071: /**
072: * Constructor for the PackageSummaryListModel object
073: */
074: public PackageSummaryListModel() {
075: orderedMap = new TreeMap();
076: ready = false;
077: array = null;
078: }
079:
080: /**
081: * Return the requested item
082: *
083: *@param index the index of the item required
084: *@return The object
085: */
086: public Object getElementAt(int index) {
087: if (!ready) {
088: prepare();
089: }
090:
091: return array[index];
092: }
093:
094: /**
095: * Return the number of items
096: *
097: *@return The size
098: */
099: public int getSize() {
100: return orderedMap.size();
101: }
102:
103: /**
104: * Adds a package summary
105: *
106: *@param summary the new summary
107: */
108: public void add(PackageSummary summary) {
109: orderedMap.put(summary.getName(), summary);
110: ready = false;
111: }
112:
113: /**
114: * Prepare to handle the incoming requests
115: */
116: private void prepare() {
117: // Check that we have enough array
118: if ((array == null) || (array.length < orderedMap.size())) {
119: array = new PackageSummary[orderedMap.size() + 5];
120: }
121:
122: // Load the array
123: Iterator iter = orderedMap.values().iterator();
124: int ndx = 0;
125: while (iter.hasNext()) {
126: array[ndx] = (PackageSummary) iter.next();
127: ndx++;
128: }
129:
130: // Finish
131: ready = true;
132: }
133: }
|