Coverage Report - org.jtheque.primary.view.impl.models.tree.RootElement
 
Classes in this File Line Coverage Branch Coverage Complexity
RootElement
0 %
0/38
0 %
0/22
2.071
 
 1  
 package org.jtheque.primary.view.impl.models.tree;
 2  
 
 3  
 /*
 4  
  * This file is part of JTheque.
 5  
  *
 6  
  * JTheque is free software: you can redistribute it and/or modify
 7  
  * it under the terms of the GNU General Public License as published by
 8  
  * the Free Software Foundation, either version 3 of the License.
 9  
  *
 10  
  * JTheque is distributed in the hope that it will be useful,
 11  
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
 12  
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 13  
  * GNU General Public License for more details.
 14  
  *
 15  
  * You should have received a copy of the GNU General Public License
 16  
  * along with JTheque.  If not, see <http://www.gnu.org/licenses/>.
 17  
  */
 18  
 
 19  
 import javax.swing.Icon;
 20  
 import java.util.ArrayList;
 21  
 import java.util.List;
 22  
 
 23  
 /**
 24  
  * Represents the root element of a tree model.
 25  
  *
 26  
  * @author Baptiste Wicht
 27  
  */
 28  
 public final class RootElement implements TreeElement {
 29  0
         private final List<TreeElement> categories = new ArrayList<TreeElement>(10);
 30  0
         private final List<TreeElement> elements = new ArrayList<TreeElement>(25);
 31  
         private final String name;
 32  
 
 33  
         /**
 34  
          * Constructs a new <code>RootElement</code>.
 35  
          *
 36  
          * @param name The name of element
 37  
          */
 38  
         public RootElement(String name){
 39  0
                 super();
 40  
 
 41  0
                 this.name = name;
 42  0
         }
 43  
 
 44  
         @Override
 45  
         public void add(TreeElement element){
 46  0
                 if (element.isLeaf()){
 47  0
                         elements.add(element);
 48  0
                 } else if (element.isCategory()){
 49  0
                         categories.add(element);
 50  
                 }
 51  0
         }
 52  
 
 53  
         @Override
 54  
         public void addAll(Iterable<? extends TreeElement> elements){
 55  0
                 for (TreeElement element : elements){
 56  0
                         add(element);
 57  
                 }
 58  0
         }
 59  
 
 60  
         @Override
 61  
         public String getElementName(){
 62  0
                 return name;
 63  
         }
 64  
 
 65  
         @Override
 66  
         public Icon getIcon(){
 67  0
                 return null;
 68  
         }
 69  
 
 70  
         @Override
 71  
         public boolean isRoot(){
 72  0
                 return true;
 73  
         }
 74  
 
 75  
         @Override
 76  
         public boolean isCategory(){
 77  0
                 return false;
 78  
         }
 79  
 
 80  
         @Override
 81  
         public boolean isLeaf(){
 82  0
                 return false;
 83  
         }
 84  
 
 85  
         @Override
 86  
         public TreeElement getChild(int index){
 87  0
                 if (hasCategories()){
 88  0
                         return categories.get(index);
 89  0
                 } else if (hasElements()){
 90  0
                         return elements.get(index);
 91  
                 }
 92  
 
 93  0
                 return null;
 94  
         }
 95  
 
 96  
         /**
 97  
          * Test if there is elements.
 98  
          *
 99  
          * @return <code>true</code> if there is elements else <code>false</code>.
 100  
          */
 101  
         private boolean hasElements(){
 102  0
                 return !elements.isEmpty();
 103  
         }
 104  
 
 105  
         /**
 106  
          * Test if there is categories.
 107  
          *
 108  
          * @return <code>true</code> if there is categories else <code>false</code>.
 109  
          */
 110  
         private boolean hasCategories(){
 111  0
                 return !categories.isEmpty();
 112  
         }
 113  
 
 114  
         @Override
 115  
         public int getChildCount(){
 116  0
                 if (hasCategories()){
 117  0
                         return categories.size();
 118  0
                 } else if (hasElements()){
 119  0
                         return elements.size();
 120  
                 }
 121  
 
 122  0
                 return 0;
 123  
         }
 124  
 
 125  
         @Override
 126  
         public int indexOf(TreeElement element){
 127  0
                 if (categories.contains(element)){
 128  0
                         return categories.indexOf(element);
 129  0
                 } else if (hasElements()){
 130  0
                         return elements.indexOf(element);
 131  
                 }
 132  
 
 133  0
                 return -1;
 134  
         }
 135  
 
 136  
         @Override
 137  
         public void clear(){
 138  0
                 elements.clear();
 139  0
                 categories.clear();
 140  0
         }
 141  
 }