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

            if (this.single_content != null) {
                if (!this.auto_order) {
                    this.contents = new ArrayList();
                }
                else {
                    this.contents = new TreeSet(CONTENT_COMPARATOR);
                }
                this.contents.add(this.single_content);
                this.single_content = null;
            }
        }

View Full Code Here

        if (mode == this.auto_order) return;
        this.auto_order = mode;
        if (this.contents == null) return;
        Collection previous_contents = contents;
        if (this.auto_order) {
            this.contents = new TreeSet(CONTENT_COMPARATOR);
            this.contents.addAll(previous_contents);
        }
        else {
            this.contents = new ArrayList(previous_contents);
        }

View Full Code Here

     * the server.
     */
    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

    }


    SearchCollection scol = new SearchCollection();
    ArrayList list = scol.getSearchCollection(powerEditString);


    Set globalSet = new TreeSet();


    StringBuffer newsb = new StringBuffer();
    newsb.append(" And ( 1 =1 ");
    String searchClause = "";


    for (int i = 0; i < list.size(); i++)
    {


      String srecord = (String)list.get(i);
      SearchRecord aa = new SearchRecord(this.dataSource);
      aa.setPowerString(srecord);
      String tableName = aa.getTable();
      if (tableName != null)
        tableName = tableName.trim();
      String columnName = aa.getColumn();
      if (columnName != null)
        columnName = columnName.trim();


      String condition = aa.getCondition();
      if (condition != null)
        condition = condition.trim();


      String criteria = aa.getCriteria();
      if (criteria != null)
        criteria = criteria.trim();


      String join = aa.getJoin();
      if (join == null)
        join = "AND";


      //      String target = "Entity";
      //      String source = "Address";


      String source = tableName;
      HashMap map = mdir.getQuryData(target, source);
      searchClause = searchClause + (String)map.get("Search");
      Set tablesName = (Set)map.get("Table");


      Object[] objArray = tablesName.toArray();
      for (int j = 0; j < objArray.length; j++)
      {
        globalSet.add((String)objArray[j]);
      }


      String cl = " " + join + " " + tableName + "." + columnName;
      if (condition.equalsIgnoreCase("begins with")) 
      {
        cl = cl + "  like  '" + criteria + "%'";
      } else if (condition.equalsIgnoreCase("ends with")) {
        cl = cl + "  like  '%" + criteria + "'";
      } else if (condition.equalsIgnoreCase("contains")) {
        cl = cl + "  like  '%" + criteria + "%'";
      } else if (condition.equalsIgnoreCase("equals")) {
        cl = cl + "  =  '" + criteria + "'";
      } else if (condition.equalsIgnoreCase("less than")) {
        cl = cl + "  <  '" + criteria + "'";
      } else if (condition.equalsIgnoreCase("greater than")) {
        cl = cl + "  <  '" + criteria + "'";
      }
      newsb.append(cl);
    }// end of for
    newsb.append(" ) ");
    String finalSql = " Select " + primaryType + " from ";
    Object[] objArray = globalSet.toArray();
    for (int j = 0; j < objArray.length; j++)
    {
      finalSql = finalSql + " " + (String)objArray[j];
      if (j < objArray.length - 1)
      {

View Full Code Here

      else if (clazz.isAssignableFrom(Set.class))
        return new HashSet();
      else if (clazz.isAssignableFrom(Queue.class))
        return new ArrayDeque();
      else if (clazz.isAssignableFrom(SortedSet.class))
        return new TreeSet();
      else if (clazz.isAssignableFrom(BlockingQueue.class))
        return new LinkedBlockingDeque();
      else
        return null;
    } else {

View Full Code Here

   *         the HashMap.
   */
  public static ArrayList buildSelectOptionList(HashMap map)
  {
    ArrayList optionList = new ArrayList();
    TreeSet keySet = new TreeSet(map.keySet());
    Iterator keyIterator = keySet.iterator();
    // prepend an empty 0 label to the top of each OptionList
    optionList.add(new LabelValueBean("-- Select --", "0"));
    while (keyIterator.hasNext()) {
      Number key = (Number) keyIterator.next();
      String value = (String) map.get(key);

View Full Code Here

        globalReplaceForm.set("conditionList", conditionList);


        // Get all the appropriate field lists and stick them on the formbean
        // The fieldList (ArrayList of LabelValueBean) will be stored in a
        // HashMap with the key being the (Number)tableId
        TreeSet keySet = new TreeSet(tableMap.keySet());
        Iterator keyIterator = keySet.iterator();
        allFields = new HashMap();
        while(keyIterator.hasNext())
        {
          Number key = (Number)keyIterator.next();
          // iterate the tables and get all the field lists

View Full Code Here

        globalReplaceForm.set("conditionList", conditionList);


        // Get all the appropriate field lists and stick them on the formbean
        // The fieldList (ArrayList of LabelValueBean) will be stored in a
        // HashMap with the key being the (Number)tableId
        TreeSet keySet = new TreeSet(tableMap.keySet());
        Iterator keyIterator = keySet.iterator();
        allFields = new HashMap();
        while (keyIterator.hasNext()) {
          Number key = (Number)keyIterator.next();
          // iterate the tables and get all the field lists
          // stick them in a hashmap of arraylists on the form bean.

View Full Code Here

      advancedSearchForm.set("conditionList", conditionList);


      // Get all the appropriate field lists and stick them on the formbean
      // The fieldList (ArrayList of LabelValueBean) will be stored in a
      // HashMap with the key being the (Number)tableId
      TreeSet keySet = new TreeSet(tableMap.keySet());
      Iterator keyIterator = keySet.iterator();
      allFields = new HashMap();
      while (keyIterator.hasNext()) {
        Number key = (Number)keyIterator.next();
        // iterate the tables and get all the field lists
        // stick them in a hashmap of arraylists on the form bean.

View Full Code Here

    }
  }


  @Test
  public void testIsSet() throws Exception {
    Object[] values = new Object[] { new TreeSet(), new HashSet(), new HashSet() };
    for (int i = 0; i < values.length; i++) {
      assertTrue(CollectionUtils.isSet(values[i].getClass()));
    }
  }

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.