Examples of java.util.TreeSet

java.util.TreeSet
A {@link NavigableSet} implementation based on a {@link TreeMap}. The elements are ordered using their {@linkplain Comparable naturalordering}, or by a {@link Comparator} provided at set creationtime, depending on which constructor is used.
This implementation provides guaranteed log(n) time cost for the basic operations ( {@code add}, {@code remove} and {@code contains}).
Note that the ordering maintained by a set (whether or not an explicit comparator is provided) must be consistent with equals if it is to correctly implement the {@code Set} interface. (See {@code Comparable}or {@code Comparator} for a precise definition of consistent withequals.) This is so because the {@code Set} interface is defined interms of the {@code equals} operation, but a {@code TreeSet} instanceperforms all element comparisons using its {@code compareTo} (or{@code compare}) method, so two elements that are deemed equal by this method are, from the standpoint of the set, equal. The behavior of a set is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the {@code Set} interface.
Note that this implementation is not synchronized. If multiple threads access a tree set concurrently, and at least one of the threads modifies the set, it must be synchronized externally. This is typically accomplished by synchronizing on some object that naturally encapsulates the set. If no such object exists, the set should be "wrapped" using the {@link Collections#synchronizedSortedSet Collections.synchronizedSortedSet}method. This is best done at creation time, to prevent accidental unsynchronized access to the set:
```
 SortedSet s = Collections.synchronizedSortedSet(new TreeSet(...));
```
The iterators returned by this class's {@code iterator} method arefail-fast: if the set is modified at any time after the iterator is created, in any way except through the iterator's own {@code remove}method, the iterator will throw a {@link ConcurrentModificationException}. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw {@code ConcurrentModificationException} on a best-effort basis.Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.
This class is a member of the Java Collections Framework. @param < E> the type of elements maintained by this set @author Josh Bloch @version 1.37, 05/10/06 @see Collection @see Set @see HashSet @see Comparable @see Comparator @see TreeMap @since 1.2

        this.allowManualColScale = allowManualColScale;
    }
    
    /** Returns the maximum value of all datasets.  */
    public Number getMaximumValue() {
        TreeSet ordered_values = (TreeSet)model.getOrderedValues(axis);
        
        if(ordered_values.size() == 0)
            return new Integer(1);
        else if(model.isManualScale()) {
            //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]);
                return new Double(ChartUtilities.performAutoScale(min/2, 
                                                                  2 * max)[1]);
             }
            else {
                //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();
    }

View Full Code Here

            return (Number)ordered_values.last();
    }    


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


        if(ordered_values.size() == 0)
            return new Integer(0);
        else if(model.isManualScale()) {
            //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]);
                return new Double(ChartUtilities.performAutoScale(min/2, 
                                                                  2 * max)[0]);
             }
            else {
                //System.out.println("** ChartUtilities.performAutoScale(min, max)[0]"+ChartUtilities.performAutoScale(min, max)[0]);
                return new Double(ChartUtilities.performAutoScale(min, 
                                                              max)[0]);
             }
        } else                
           return (Number)ordered_values.first();
    }

View Full Code Here

     */
    public ObjectChartDataModel() {
        data = new DefaultDataSet[0];
        columns = new Object[0];
        
        TreeSet set1 = new TreeSet();
        valuesbyaxis.put(new Integer(CoordSystem.FIRST_YAXIS), set1);
        
        TreeSet set2 = new TreeSet();
        valuesbyaxis.put(new Integer(CoordSystem.SECOND_YAXIS), set2);
        
        constraints1 = new DefaultChartDataModelConstraints(this, CoordSystem.FIRST_YAXIS, false);
        constraints2 = new DefaultChartDataModelConstraints(this, CoordSystem.SECOND_YAXIS, false);
    }

View Full Code Here

        
        this.columns = columns;
        
        this.data = new DefaultDataSet[data.length];
        
        TreeSet set = 
            (TreeSet)valuesbyaxis.get(new Integer(CoordSystem.FIRST_YAXIS));
                
        ChartUtilities.addDataToSet(set, data);
        
        for(int i = 0; i < data.length; i++) {

View Full Code Here

        
        this.columns = columns;
        
        this.data = new DefaultDataSet[data.length];
        
        TreeSet set = 
            (TreeSet)valuesbyaxis.get(new Integer(CoordSystem.FIRST_YAXIS));
        
        ChartUtilities.addDataToSet(set, numdata);
        
        for(int i = 0; i < data.length; i++) {

View Full Code Here

        
        this.columns = columns;
        
        this.data = new DefaultDataSet[data.length];
        
        TreeSet set = 
            (TreeSet)valuesbyaxis.get(new Integer(CoordSystem.FIRST_YAXIS));
        
        ChartUtilities.addDataToSet(set, numdata);
        
        for(int i = 0; i < data.length; i++) {

View Full Code Here

    public ObjectChartDataModel(DataSet[] ds, Object[] columns) {
        this();
        data = ds;
        this.columns = columns;
        
        TreeSet set;
      
        HashMap map = new HashMap();
        
        for(int i = 0; i < ds.length; i++) {
            map.clear();
            Number[] numdata = new Number[columns.length];
            
            for(int j = 0; j < columns.length; j++)
                map.put(columns[j], new Double(Double.NaN));
      
            set = (TreeSet)valuesbyaxis.get(new Integer(ds[i].getYAxis()));
            
            for(int j = 0; j < ds[i].getDataSetLength(); j++) {
                map.put(ds[i].getColumnValueAt(j), ds[i].getValueAt(j));
                set.add(ds[i].getValueAt(j));
            }
          
            for(int j = 0; j < columns.length; j++) {
                numdata[j] = (Number)map.get(columns[j]);
            }

View Full Code Here

        AboutFieldTableModel modelproperties = new AboutFieldTableModel();
        jTableProperties.setModel(modelproperties);


        try {
            Enumeration props = System.getProperties().propertyNames();
            SortedSet s = new TreeSet();
            while (props.hasMoreElements()) {
                s.add((String) props.nextElement());
            }
            Iterator i = s.iterator();
            while (i.hasNext()) {
                String prop = (String) i.next();
                modelproperties.addField(new SystemInfo(prop, System
                        .getProperty(prop)));
            }

View Full Code Here

       */
      public Enumeration getLocales()
      {
         // TODO: cache result
         String al = getHeader(ACCEPT_LANGUAGE);
         TreeSet ts = new TreeSet();
         if (al != null)
         {
            // System.err.println("Accept lang:"+al);
            StringTokenizer st = new StringTokenizer(al, ";", false);
            try
            {
               while (st.hasMoreTokens())
               {
                  String langs = st.nextToken(";");
                  // System.err.println("Langs:"+langs);
                  String q = st.nextToken(";=");
                  // System.err.println("q:"+q);
                  q = st.nextToken("=,");
                  // System.err.println("q:"+q);
                  float w = 0;
                  try
                  {
                     w = Float.valueOf(q).floatValue();
                  }
                  catch (NumberFormatException nfe)
                  {
                  }
                  if (w > 0)
                  {
                     StringTokenizer lst = new StringTokenizer(langs, ", ", false);
                     while (lst.hasMoreTokens())
                     {
                        String lan = lst.nextToken();
                        int di = lan.indexOf('-');
                        if (di < 0)
                           ts.add(new LocaleWithWeight(new Locale(lan.trim()) /* 1.4 */, w));
                        else
                           ts.add(new LocaleWithWeight(new Locale(lan.substring(0, di), lan.substring(di + 1)
                                   .trim().toUpperCase()), w));
                     }
                  }
               }
            }
            catch (NoSuchElementException ncee)
            {
               // can't parse
            }
         }
         if (ts.size() == 0)
            ts.add(new LocaleWithWeight(Locale.getDefault(), 1));
         return new AcceptLocaleEnumeration(ts);
      }

View Full Code Here

        {
            // Normal persistence
            // Put the classes into a sorter so we make sure we get the initial implementations first followed
            // by any subclasses of these implementations. This is needed because when generating the schema we require
            // the subclass implementations to already have their datastore column created
            Collection classesSorted = new TreeSet(new InterfaceClassComparator());
            Iterator classesIter = classes.iterator();
            while (classesIter.hasNext())
            {
                classesSorted.add(classesIter.next());
            }


            // Return the class names (in the same order)
            String[] classNames = new String[classesSorted.size()];
            Iterator iter = classesSorted.iterator();
            int i = 0;
            while (iter.hasNext())
            {
                classNames[i++] = ((Class)iter.next()).getName();
            }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.TreeSet

br.gov.serpro.ouvidoria.controller.gerencial.administracao.FuncionarioCtrl

br.gov.serpro.ouvidoria.controller.gerencial.administracao.SubOrgaoCtrl

br.gov.serpro.ouvidoria.controller.gerencial.administracao.TipoAssuntoCtrl

br.gov.serpro.ouvidoria.controller.MenuCtrl

br.gov.serpro.ouvidoria.struts.action.gerencial.administracao.AtualizarUsuarioAction

com.alibaba.antx.config.props.PropertiesFile

com.beust.jcommander.ParameterDescription

com.calexo.openhra.serveur.ejb.GestionClientsBean

com.cedarsoftware.util.io.JsonReader

com.cedarsoftware.util.io.JsonReader$CollectionFactory

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.