Coverage Report - org.argouml.ui.ChildGenSearch
 
Classes in this File Line Coverage Branch Coverage Complexity
ChildGenSearch
0%
0/13
0%
0/6
4
 
 1  
 /* $Id: ChildGenSearch.java 17841 2010-01-12 19:17:52Z 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-2008 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.ui;
 40  
 
 41  
 import java.util.ArrayList;
 42  
 import java.util.Iterator;
 43  
 import java.util.List;
 44  
 
 45  
 import org.argouml.kernel.Project;
 46  
 import org.argouml.model.Model;
 47  
 import org.argouml.uml.diagram.ArgoDiagram;
 48  
 import org.argouml.util.ChildGenerator;
 49  
 
 50  
 /**
 51  
  * ChildGenerator that returns the "children" of any given part of the project.
 52  
  * It traverses a Project to Diagrams and Models, then uses
 53  
  * getModelElementContents to traverse the Models.
 54  
  * 
 55  
  * @author jrobbins
 56  
  * @author Tom Morris <tfmorris@gmail.com>
 57  
  */
 58  0
 public class ChildGenSearch implements ChildGenerator {
 59  
     
 60  
     /**
 61  
      * Reply a Collection of the children of the given Object
 62  
      * {@inheritDoc}
 63  
      */
 64  
     public Iterator childIterator(Object o) {
 65  
         // TODO: This could be made more efficient by working with iterators
 66  
         // directly and creating a composite iterator made up of all the 
 67  
         // various sub iterators.
 68  0
         List res = new ArrayList();
 69  0
         if (o instanceof Project) {
 70  0
             Project p = (Project) o;
 71  0
             res.addAll(p.getUserDefinedModelList());
 72  0
             res.addAll(p.getDiagramList());
 73  0
         } else if (o instanceof ArgoDiagram) {
 74  0
             ArgoDiagram d = (ArgoDiagram) o;
 75  0
             res.addAll(d.getGraphModel().getNodes());
 76  0
             res.addAll(d.getGraphModel().getEdges());
 77  0
         } else if (Model.getFacade().isAModelElement(o)) {
 78  0
             res.addAll(Model.getFacade().getModelElementContents(o));
 79  
         }
 80  
         
 81  0
         return res.iterator();
 82  
     }
 83  
 
 84  
 }