Examples of java.util.Comparator

java.util.Comparator
A comparison function, which imposes a total ordering on some collection of objects. Comparators can be passed to a sort method (such as {@link Collections#sort(List,Comparator) Collections.sort} or {@link Arrays#sort(Object[],Comparator) Arrays.sort}) to allow precise control over the sort order. Comparators can also be used to control the order of certain data structures (such as {@link SortedSet sorted sets} or {@link SortedMap sorted maps}), or to provide an ordering for collections of objects that don't have a {@link Comparable natural ordering}.
The ordering imposed by a comparator c on a set of elements S is said to be consistent with equals if and only if c.compare(e1, e2)==0 has the same boolean value as e1.equals(e2) for every e1 and e2 in S.
Caution should be exercised when using a comparator capable of imposing an ordering inconsistent with equals to order a sorted set (or sorted map). Suppose a sorted set (or sorted map) with an explicit comparator c is used with elements (or keys) drawn from a set S. If the ordering imposed by c on S is inconsistent with equals, the sorted set (or sorted map) will behave "strangely." In particular the sorted set (or sorted map) will violate the general contract for set (or map), which is defined in terms of equals.
For example, suppose one adds two elements {@code a} and {@code b} such that{@code (a.equals(b) && c.compare(a, b) != 0)}to an empty {@code TreeSet} with comparator {@code c}. The second {@code add} operation will returntrue (and the size of the tree set will increase) because {@code a} and{@code b} are not equivalent from the tree set's perspective, even thoughthis is contrary to the specification of the {@link Set#add Set.add} method.
Note: It is generally a good idea for comparators to also implement java.io.Serializable, as they may be used as ordering methods in serializable data structures (like {@link TreeSet}, {@link TreeMap}). In order for the data structure to serialize successfully, the comparator (if provided) must implement Serializable.
For the mathematically inclined, the relation that defines the imposed ordering that a given comparator c imposes on a given set of objects S is:
```
 {(x, y) such that c.compare(x, y) <= 0}. 
```
The quotient for this total order is:
```
 {(x, y) such that c.compare(x, y) == 0}. 
```
It follows immediately from the contract for compare that the quotient is an equivalence relation on S, and that the imposed ordering is a total order on S. When we say that the ordering imposed by c on S is consistent with equals, we mean that the quotient for the ordering is the equivalence relation defined by the objects' {@link Object#equals(Object) equals(Object)} method(s):
```
{(x, y) such that x.equals(y)}. 
```
This interface is a member of the Java Collections Framework. @param < T> the type of objects that may be compared by this comparator @author Josh Bloch @author Neal Gafter @version 1.26, 04/21/06 @see Comparable @see java.io.Serializable @since 1.2

            Panel p = (Panel) i.next();
            if ((placement == -1 || p.getPlacement() == placement) && p.isAvailable(request, response, "main")) {
                a.add(p);
            }
        }
        Collections.sort(a, new Comparator() {
            public int compare(Object arg0, Object arg1) {
                Panel p1 = (Panel) arg0;
                Panel p2 = (Panel) arg1;
                return new Integer(p1.getWeight()).compareTo(new Integer(p2.getWeight()));
            }

View Full Code Here

                {
                    //some datastores do not support backingStores
                }
            }
            // Set up our delegate, using a suitable comparator
            Comparator comparator = SCOUtils.getComparator(fmd, ownerSM.getObjectManager().getClassLoaderResolver());
            if (comparator != null)
            {
                this.delegate = new java.util.TreeSet(comparator);
            }
            else

View Full Code Here

    }


    private List sortByGrouping(List set)
    {
        Object[] o = set.toArray();
        Arrays.sort(o, new Comparator()
        {
            public int compare(Object arg0, Object arg1)
            {
                for( int i=0; i<grouping.length; i++)
                {

View Full Code Here

        {
            symtbl.addSymbol(symbol);
        }
        symbol.setValue(set);
        Object[] o = set.toArray();
        Arrays.sort(o, new Comparator()
        {
        
            public int compare(Object arg0, Object arg1)
            {
                for( int i=0; i<ordering.length; i++)

View Full Code Here

     * @param resultSet The resultSet containing al elements
     * @return A list with aggregated elements
     */
    private List handleAggregates(List resultSet)
    {
        Comparator c = new Comparator()
        {
            public int compare(Object arg0, Object arg1)
            {
                for( int i=0; i<grouping.length; i++)
                {
                    symtbl.getSymbol("this").setValue(arg0);
                    Object a = grouping[i].evaluate(evaluator);
                    symtbl.getSymbol("this").setValue(arg1);
                    Object b = grouping[i].evaluate(evaluator);
                    int result = ((Comparable)a).compareTo(b);
                    if( result != 0)
                    {
                        return result;
                    }
                }
                return 0;
            }
        
        };
        List groups = new ArrayList();
        List group = new ArrayList();
        groups.add(group);
        for (int i=0; i<resultSet.size(); i++)
        {
            if (i > 0)
            {
                if (c.compare(resultSet.get(i-1),resultSet.get(i)) != 0)
                {
                    group = new ArrayList();
                    groups.add(group);
                }
            }

View Full Code Here

     * @param resultSet The resultSet containing al elements
     * @return A list with aggregated elements
     */
    private List handleResult(List resultSet)
    {
        Comparator c = new Comparator()
        {
            public int compare(Object arg0, Object arg1)
            {
                if (grouping != null)
                {
                    for (int i = 0; i < grouping.length; i++)
                    {
                        // TODO Remove HARDCODED "this". Should be alias of some name
                        symtbl.getSymbol("this").setValue(arg0);
                        Object a = grouping[i].evaluate(evaluator);
                        // TODO Remove HARDCODED "this". Should be alias of some name
                        symtbl.getSymbol("this").setValue(arg1);
                        Object b = grouping[i].evaluate(evaluator);
                        int result = ((Comparable) a).compareTo(b);
                        if (result != 0)
                        {
                            return result;
                        }
                    }
                }
                return 0;
            }
        };


        List result = new ArrayList();
        if (grouping != null)
        {
            List groups = new ArrayList();
            List group = new ArrayList();
            if (resultSet.size() > 0)
            {
                groups.add(group);
            }
            for (int i = 0; i < resultSet.size(); i++)
            {
                if (i > 0)
                {
                    if (c.compare(resultSet.get(i - 1), resultSet.get(i)) != 0)
                    {
                        group = new ArrayList();
                        groups.add(group);
                    }
                }

View Full Code Here

        if (_pathinfo.length()>1) {
          printFile(out, "..", parent);
        }
      }


      Comparator cmp = SORT_BY_NAME;


      if (context != null) {
        HttpServletRequest request = context.getRequest();
        String sortby = request.getParameter("S");
        if (sortby != null) {

View Full Code Here

  /// @param data Data passed as a fifth parameter to searching function
  /// @return this array sorted
  public static final Object[] p_sort = new Object[] { null, "comparator", "*data", UNDEFINED };
  public Any m_sort(Context context, Any comparator_, Any data)
  {
    Comparator comparator = new AnyUtils.ArrayComparator(context, comparator_, data);
    sort(comparator, true);
    return this;
  }

View Full Code Here

        ArrayList sourceColumns = new ArrayList();
      for (int i=0; i<source.getSize(); i++) {
        Column nextField = source.getField(i);
        sourceColumns.add(nextField);
      }
      Collections.sort(sourceColumns, new Comparator() {
        public int compare(Object o1, Object o2) {
          Column lhs = (Column) o1;
          Column rhs = (Column) o2;
          return lhs.getOrder()-rhs.getOrder();
        }

View Full Code Here

                    //some datastores do not support backingStores
                }
            }


            // Set up our delegate, using a comparator
            Comparator comparator = SCOUtils.getComparator(fmd, ownerSM.getObjectManager().getClassLoaderResolver());
            if (comparator != null)
            {
                this.delegate = new java.util.TreeMap(comparator);
            }
            else

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.Comparator

ae.sun.awt.datatransfer.DataTransferer

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

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

com.cedarsoftware.ncube.Axis

com.extjs.gxt.ui.client.widget.table.TableView

com.google.gwt.junit.viewer.client.ReportViewer

com.ibm.icu.dev.test.util.CollectionUtilities

com.ibm.icu.dev.test.util.ICUServiceTest

com.ibm.icu.util.ULocale$IDParser

com.jidesoft.comparator.ObjectComparatorManager

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.