Coverage Report - org.argouml.cognitive.ui.PriorityNode
 
Classes in this File Line Coverage Branch Coverage Complexity
PriorityNode
100%
18/18
100%
2/2
1.2
 
 1  
 /* $Id: PriorityNode.java 17818 2010-01-12 18:39:46Z 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  
  *    mvw
 11  
  *****************************************************************************
 12  
  *
 13  
  * Some portions of this file was previously release using the BSD License:
 14  
  */
 15  
 
 16  
 // Copyright (c) 1996-2009 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.cognitive.ui;
 40  
 
 41  
 import java.util.ArrayList;
 42  
 import java.util.List;
 43  
 
 44  
 import org.argouml.cognitive.ToDoItem;
 45  
 import org.argouml.cognitive.Translator;
 46  
 
 47  
 /**
 48  
  * This class represents a "priority". Which is a classification for critics.
 49  
  *
 50  
  */
 51  
 public class PriorityNode {
 52  
 
 53  900
     private static final String HIGH = 
 54  
         Translator.localize("misc.level.high");
 55  
 
 56  900
     private static final String MEDIUM = 
 57  
         Translator.localize("misc.level.medium");
 58  
 
 59  900
     private static final String LOW =
 60  
         Translator.localize("misc.level.low");
 61  
 
 62  900
     private static List<PriorityNode> priorities = null;
 63  
 
 64  
     private String name;
 65  
 
 66  
     private int priority;
 67  
 
 68  
     /**
 69  
      * The constructor.
 70  
      *
 71  
      * @param n the name of this priority
 72  
      * @param pri the priority number
 73  
      */
 74  2700
     public PriorityNode(String n, int pri) {
 75  2700
         name = n;
 76  2700
         priority = pri;
 77  2700
     }
 78  
 
 79  
 
 80  
     /**
 81  
      * @return the list of all the priorities
 82  
      */
 83  
     public static List<PriorityNode> getPriorityList() {
 84  21997
         if (priorities == null) {
 85  900
             List<PriorityNode> p =  new ArrayList<PriorityNode>();
 86  900
             p.add(new PriorityNode(HIGH,
 87  
                     ToDoItem.HIGH_PRIORITY));
 88  900
             p.add(new PriorityNode(MEDIUM,
 89  
                     ToDoItem.MED_PRIORITY));
 90  900
             p.add(new PriorityNode(LOW,
 91  
                     ToDoItem.LOW_PRIORITY));
 92  
             /* Correct lazy initialization of static field 
 93  
              * without further updates: */
 94  900
             priorities = p;
 95  
         }
 96  21997
         return priorities;
 97  
     }
 98  
 
 99  
 
 100  
     /**
 101  
      * @return the name
 102  
      */
 103  
     public String getName() {
 104  9666
         return name;
 105  
     }
 106  
 
 107  
     /**
 108  
      * @return the priority
 109  
      */
 110  
     public int getPriority() {
 111  22861
         return priority;
 112  
     }
 113  
 
 114  
     /*
 115  
      * @see java.lang.Object#toString()
 116  
      */
 117  
     @Override
 118  
     public String toString() {
 119  9666
         return getName();
 120  
     }
 121  
 
 122  
 }