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

          } catch (IllegalAccessException iaex) {
          }
        }
      }
    }
    Collections.sort(result, new Comparator() {
      public int compare(Object o1, Object o2) {
        return o1.getClass().getSimpleName()
            .compareTo(o2.getClass().getSimpleName());
      }
    });

View Full Code Here

  private boolean buildTree(TreeNode tParent, VFSContainer parentContainer, String parentPath) {
    List children = parentContainer.getItems(fileFilter);
    if (children.size() == 0) return false;


    // sort the children
    Collections.sort(children, new Comparator(){
      final Collator c = collator;
      public int compare(final Object o1, final Object o2) {
        return c.compare(((VFSItem)o1).getName(), ((VFSItem)o2).getName());
      }});

View Full Code Here

   */
  public static int invalidateOldestSessions(int nbrSessions) {
    int invalidateCounter = 0;
    // 1. Copy authUserSessions in sorted TreeMap
    // This is the Comparator that will be used to sort the TreeSet:
    Comparator sessionComparator = new Comparator() {
      public int compare(Object o1, Object o2) {
        Long long1 = new Long(((UserSession) o1).getSessionInfo().getLastClickTime());
        Long long2 = new Long(((UserSession) o2).getSessionInfo().getLastClickTime());
        return long1.compareTo(long2);
      }

View Full Code Here

   * @param sortingCriteria
   * @param itemComparator
   * @return
   */
  protected List getSortedList(List itemList, SortingCriteria sortingCriteria) {
    Comparator itemComparator = getComparator(sortingCriteria);
    Collections.sort(itemList, itemComparator);
    // check here is asscending or descending and return the first max entries
    int maxEntries = sortingCriteria.getMaxEntries();
    List returnList = itemList.subList(0, Math.min(itemList.size(), maxEntries));
    return returnList;

View Full Code Here

   * choosen manually order (available in the sortedItems map).
   * @param sortedItems
   * @return
   */
  protected Comparator getPortletEntryComparator(final Map<Long,Integer> sortedItems) {
    return new Comparator(){      
      public int compare(final Object o1, final Object o2) {
        PortletEntry portletEntry1= (PortletEntry)o1;
        PortletEntry portletEntry2 = (PortletEntry)o2;    
        int comparisonResult = 0;
        Integer portletEntry1Index = sortedItems.get(portletEntry1.getKey());

View Full Code Here

  }


  
  protected static Comparator createOrderComparator(Comparator comparator, SortOrderEnum order)
  {
    Comparator orderComparator;
    switch (order)
    {
      case DESCENDING:
      {
        if (comparator == null)

View Full Code Here

      {
         list.add(new Integer(unsorted[i]));
      }
      
      Collections.sort(list, 
            new Comparator()
            {
             public boolean equals(Object obj)
             {
                return false;
             }

View Full Code Here

    System.out.println(sb.toString());


    if (item instanceof VFSContainer) {
      VFSContainer cont = (VFSContainer) item;
      List items = cont.getItems();
      Collections.sort(items, new Comparator() {
        public int compare(Object a, Object b) {
          VFSItem va = (VFSItem)a;
          VFSItem vb = (VFSItem)b;
          boolean ac = (va instanceof VFSContainer);
          boolean bc = (vb instanceof VFSContainer);

View Full Code Here

        ArrayList color_groups = new ArrayList();
        ColorGroup root = new ColorGroup(new ArrayList(color_map.values()));
        {
            color_groups.add(root);


            final Comparator comparator = new Comparator()
            {
                public int compare(Object o1, Object o2)
                {
                    ColorGroup cg1 = (ColorGroup) o1;
                    ColorGroup cg2 = (ColorGroup) o2;

View Full Code Here

            ColorCount color_count = (ColorCount) color_group.color_counts
                    .get(i);
            count_total += color_count.count;
        }


        Comparator comparator = new Comparator()
        {
            public int compare(Object o1, Object o2)
            {
                ColorCount c1 = (ColorCount) o1;
                ColorCount c2 = (ColorCount) o2;

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.