Package java.util

Examples of java.util.TreeSet.last()


    } // next
    int nUnionDates = oUnionDates.size();
    oRetVal = new WorkingCalendar(nUnionDates,
                                  getStringNull(DB.nm_calendar,"")+"+"+oLocalCalendar.getStringNull(DB.nm_calendar,""),
                                  toDate(oUnionDates.first().toString()),
                                  toDate(oUnionDates.last().toString()));
    Iterator oIter = oUnionDates.iterator();
    int iCurrentDateIndex = 0;
    while (oIter.hasNext()) {
      int iDate = Integer.parseInt((String) oIter.next());
      int iLocalDateIndex = Arrays.binarySearch(oLocalCalendar.aDates, iDate);
View Full Code Here


            //System.out.println("** model.getManualMaximumValue() = "+model.getManualMaximumValue());
            return model.getManualMaximumValue();
        }
        else if(model.isAutoScale()) {
            double min = ((Number)ordered_values.first()).doubleValue();
            double max = ((Number)ordered_values.last()).doubleValue();
           
            //System.out.println("** min = "+min+"  max = "+max);
           
            if(min / max > 0.95) {
                //System.out.println("** ChartUtilities.performAutoScale(min/2, 2 * max)[1]"+ChartUtilities.performAutoScale(min/2, 2 * max)[1]);
 
View Full Code Here

                //System.out.println("** ChartUtilities.performAutoScale(min, max)[1]"+ChartUtilities.performAutoScale(min, max)[1]);
                return new Double(ChartUtilities.performAutoScale(min,
                                                              max)[1]);
             }
        } else
            return (Number)ordered_values.last();
    }   

    /** Returns the minimum value of all datasets.  */
    public Number getMinimumValue() {
        TreeSet ordered_values = (TreeSet)model.getOrderedValues(axis);
View Full Code Here

            //System.out.println("** model.getManualMinimumValue() = "+model.getManualMinimumValue());
            return model.getManualMinimumValue();
        }
        else if(model.isAutoScale()) {
            double min = ((Number)ordered_values.first()).doubleValue();
            double max = ((Number)ordered_values.last()).doubleValue();

            //System.out.println("** min = "+min+"  max = "+max);
           
            if(min / max > 0.95) {
                //System.out.println("** ChartUtilities.performAutoScale(min/2, 2 * max)[0]"+ChartUtilities.performAutoScale(min/2, 2 * max)[0]);
 
View Full Code Here

    public String toString() {
        StringBuffer sb=new StringBuffer();
        sb.append(msgs.size()).append(" msgs (").append("next=").append(next_to_remove).append(")");
        TreeSet s=new TreeSet(msgs.keySet());
        if(s.size() > 0) {
            sb.append(" [").append(s.first()).append(" - ").append(s.last()).append("]");
            sb.append(": ").append(s);
        }
        return sb.toString();
    }
View Full Code Here

            }

            if (list.isEmpty()) {
                return null;
            }
            return (Artifact) list.last();
        }

        // more than one version of the artifact was loaded...

        // if one of parents already loaded the artifact, use that version
View Full Code Here

                return moves[m_random.nextInt(moves.length)];
            }
        }
       
        if (m_random.nextDouble() <= 0.4) {
            Memory mem = (Memory)items.last();
            return mem.m_move;
        }
       
        int half = items.size() / 2;
        if (half == 0) {
View Full Code Here

            return mem.m_move;
        }
       
        int half = items.size() / 2;
        if (half == 0) {
            Memory mem = (Memory)items.last();
            return mem.m_move;
        }
        int start = m_random.nextInt(2) * half;
        int idx = start + m_random.nextInt(half);
       
View Full Code Here

        private ServiceReference highestTrackedCache(long serviceId) {
            Long sid = Long.valueOf(serviceId);
            synchronized (this) {
              TreeSet services = (TreeSet) m_highestTrackedCache.get(sid);
              if (services != null && services.size() > 0) {
                ServiceReference result = (ServiceReference) services.last();
                return result;
              }
      }
            return null;
        }
View Full Code Here

        private ServiceReference highestHiddenCache(long serviceId) {
            Long sid = Long.valueOf(serviceId);
            synchronized (this) {
              TreeSet services = (TreeSet) m_highestHiddenCache.get(sid);
              if (services != null && services.size() > 0) {
                  ServiceReference result = (ServiceReference) services.last();
                  return result;
              }
            }
            return null;
        }
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.