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

    backcolor = plot.getOwnBackcolor();
    orientation = plot.getOrientation();
    backgroundAlphaFloat = plot.getBackgroundAlphaFloat();
    foregroundAlphaFloat = plot.getForegroundAlphaFloat();
    labelRotationDouble = plot.getLabelRotationDouble();
    seriesColors = new TreeSet(plot.getSeriesColors());
  }

View Full Code Here

        seriesColor, seriesColors.size() - 1);
  }
  
  public void setSeriesColors(Collection colors)
  {
    Object old = new TreeSet(seriesColors);
    seriesColors.clear();
    if (colors != null)
    {
      seriesColors.addAll(colors);
    }

View Full Code Here

      throw new JRRuntimeException(e);
    }
    
    if (seriesColors != null)
    {
      clone.seriesColors = new TreeSet();
      for(Iterator it = seriesColors.iterator(); it.hasNext();)
      {
        clone.seriesColors.add(((JRChartPlot.JRSeriesColor)it.next()).clone());
      }
    }

View Full Code Here

        Long long2 = new Long(((UserSession) o2).getSessionInfo().getLastClickTime());
        return long1.compareTo(long2);
      }
    };
    // clusterNOK ?? invalidate only locale sessions ?
    TreeSet sortedSet = new TreeSet(sessionComparator);
    sortedSet.addAll(authUserSessions);
    int i = 0;  
    for (Iterator iterator = sortedSet.iterator(); iterator.hasNext() && i++<nbrSessions;) {
      try {
        UserSession userSession = (UserSession) iterator.next();
        if (!userSession.getRoles().isOLATAdmin() && !userSession.getSessionInfo().isWebDAV()) {
          userSession.signOffAndClear();
          invalidateCounter++;

View Full Code Here

  }


  private AutoCompleterController createTableSearchController(UserRequest ureq, WindowControl wControl) {
    ListProvider genericProvider = new ListProvider() {
      public void getResult(String searchValue, ListReceiver receiver) {
        Set<String> searchEntries = new TreeSet();
        // loop over hole data-model
        for (int rowIndex=0; rowIndex < table.getUnfilteredTableDataModel().getRowCount(); rowIndex++) {
          for (int colIndex=0; colIndex < table.getUnfilteredTableDataModel().getColumnCount(); colIndex++) {
            Object obj = table.getUnfilteredTableDataModel().getValueAt(rowIndex, colIndex);
            if (obj instanceof String) {
              String valueString = (String)obj;
              if (valueString.toLowerCase().indexOf(searchValue.toLowerCase()) != -1) {
                if (searchEntries.add(valueString) ) {
                  // Add to receiver list same entries only once
                  if (searchEntries.size() == 1) {
                    // before first entry, add searchValue. But add only when one search match
                    receiver.addEntry( searchValue, null );
                  }
                  receiver.addEntry(valueString, null);
                }

View Full Code Here

            NodeModel nm = NodeModel.parse(is);
            dataModel.put("doc", nm);
        }
        
        else if (testName.startsWith("sequence-builtins-with-")) {
            Set abcSet = new TreeSet();
            abcSet.add("a");
            abcSet.add("b");
            abcSet.add("c");
            dataModel.put("abcSet", abcSet);
        }
        
        else if (testName.equals("test-iso8601")) {
            dataModel.put("javaGMT02", TimeZone.getTimeZone("GMT+02"));

View Full Code Here

    {
      super();
      
      CollectedListComparator comparator = 
        new CollectedListComparator(bucketDefinition);
      list = new TreeSet(comparator);
    }

View Full Code Here

    doTeardown();
  }




  private static void initStartupTeardownMethods() throws SystemStartupException {
    Set propNames = new TreeSet();
    List clsNames = new Vector();
    Enumeration keys = System.getProperties().keys();
    String propPrefix = "ch.ethz.prose.ESSystem.";


    // retrieve the matching property names
    while(keys.hasMoreElements()) {
      String crtPropName = (String)keys.nextElement();
      if (crtPropName.startsWith(propPrefix) &&
          crtPropName.length() > propPrefix.length())
        propNames.add(crtPropName);
    }


    Iterator j = propNames.iterator();
    while (j.hasNext())
      clsNames.add(System.getProperty((String)j.next()));


    // retrieve the matching classNames
    Iterator i = clsNames.iterator();

View Full Code Here

   * Default CTOR
   */
  public RequestHandlerImpl() 
  {
    bindings = new TreeMap();
    oidKeys = new TreeSet();
  }

View Full Code Here

      {
         StringBuffer buff = new StringBuffer();


         buff.append("<table>");


         SortedSet keys = new TreeSet(this.keySet());
         Iterator iter = keys.iterator();
         while (iter.hasNext())
         {
            String key = (String) iter.next();
            buff.append("<tr><td align=\"left\"><b>")
               .append(key)

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.