Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
GenAncestorClasses |
|
| 3.5;3.5 |
1 | /* $Id: GenAncestorClasses.java 17846 2010-01-12 19:37:12Z linus $ | |
2 | ***************************************************************************** | |
3 | * Copyright (c) 2009 Contributors - see below | |
4 | * All rights reserved. This program and the accompanying materials | |
5 | * are made available under the terms of the Eclipse Public License v1.0 | |
6 | * which accompanies this distribution, and is available at | |
7 | * http://www.eclipse.org/legal/epl-v10.html | |
8 | * | |
9 | * Contributors: | |
10 | * tfmorris | |
11 | ***************************************************************************** | |
12 | * | |
13 | * Some portions of this file was previously release using the BSD License: | |
14 | */ | |
15 | ||
16 | // Copyright (c) 1996-2006 The Regents of the University of California. All | |
17 | // Rights Reserved. Permission to use, copy, modify, and distribute this | |
18 | // software and its documentation without fee, and without a written | |
19 | // agreement is hereby granted, provided that the above copyright notice | |
20 | // and this paragraph appear in all copies. This software program and | |
21 | // documentation are copyrighted by The Regents of the University of | |
22 | // California. The software program and documentation are supplied "AS | |
23 | // IS", without any accompanying services from The Regents. The Regents | |
24 | // does not warrant that the operation of the program will be | |
25 | // uninterrupted or error-free. The end-user understands that the program | |
26 | // was developed for research purposes and is advised not to rely | |
27 | // exclusively on the program for any reason. IN NO EVENT SHALL THE | |
28 | // UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, | |
29 | // SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, | |
30 | // ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF | |
31 | // THE UNIVERSITY OF CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF | |
32 | // SUCH DAMAGE. THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY | |
33 | // WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF | |
34 | // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE | |
35 | // PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY OF | |
36 | // CALIFORNIA HAS NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, | |
37 | // UPDATES, ENHANCEMENTS, OR MODIFICATIONS. | |
38 | ||
39 | package org.argouml.uml; | |
40 | ||
41 | import java.util.Collection; | |
42 | import java.util.Collections; | |
43 | import java.util.Enumeration; | |
44 | import java.util.HashSet; | |
45 | import java.util.Set; | |
46 | ||
47 | import org.argouml.model.Model; | |
48 | import org.tigris.gef.util.ChildGenerator; | |
49 | /** Utility class to generate the base classes of a class. It | |
50 | * recursively moves up the class hierarchy. But it does that in a | |
51 | * safe way that will not hang in case of cyclic inheritance. | |
52 | */ | |
53 | 0 | public class GenAncestorClasses implements ChildGenerator { |
54 | ||
55 | /* | |
56 | * @see org.tigris.gef.util.ChildGenerator#gen(java.lang.Object) | |
57 | */ | |
58 | public Enumeration gen(Object cls) { | |
59 | 0 | Set res = new HashSet(); |
60 | 0 | if (Model.getFacade().isAGeneralizableElement(cls)) { |
61 | 0 | accumulateAncestors(cls, res); |
62 | } | |
63 | 0 | return Collections.enumeration(res); |
64 | } | |
65 | ||
66 | /** | |
67 | * @param cls the class (in fact any GeneralizableElement will do) | |
68 | * @param accum the accumulated list of generalizations | |
69 | */ | |
70 | public void accumulateAncestors(Object cls, Collection accum) { | |
71 | 0 | Collection gens = Model.getFacade().getGeneralizations(cls); |
72 | 0 | if (gens == null) { |
73 | 0 | return; |
74 | } | |
75 | 0 | for (Object g : gens) { |
76 | 0 | Object ge = Model.getFacade().getGeneral(g); |
77 | 0 | if (!accum.contains(ge)) { |
78 | 0 | accum.add(ge); |
79 | 0 | accumulateAncestors(cls, accum); |
80 | } | |
81 | 0 | } |
82 | 0 | } |
83 | } |