Examples of org.apache.commons.collections.comparators.ComparatorChain

Package org.apache.commons.collections.comparators

Examples of org.apache.commons.collections.comparators.ComparatorChain

org.apache.commons.collections.comparators.ComparatorChain

A ComparatorChain is a Comparator that wraps one or more Comparators in sequence. The ComparatorChain calls each Comparator in sequence until either 1) any single Comparator returns a non-zero result (and that result is then returned), or 2) the ComparatorChain is exhausted (and zero is returned). This type of sorting is very similar to multi-column sorting in SQL, and this class allows Java classes to emulate that kind of behaviour when sorting a List.

To further facilitate SQL-like sorting, the order of any single Comparator in the list can be reversed.

Calling a method that adds new Comparators or changes the ascend/descend sort after compare(Object, Object) has been called will result in an UnsupportedOperationException. However, take care to not alter the underlying List of Comparators or the BitSet that defines the sort order.

Instances of ComparatorChain are not synchronized. The class is not thread-safe at construction time, but it is thread-safe to perform multiple comparisons after all the setup operations are complete.
@since Commons Collections 2.0 @author Morgan Delagrange @version $Revision: 1.18 $ $Date: 2004/05/16 11:48:49 $


        };


        // sort by degreeCurricularPlan.degree.nome ascending,
        // executionYear.year descending
        ComparatorChain comparatorChain = new ComparatorChain();
        comparatorChain.addComparator(degreNameComparator, false);
        comparatorChain.addComparator(yearComparator, true);


        Collections.sort(result, comparatorChain);


        return result;
    }

View Full Code Here

                    }
                }
                // Reorder fields: empty after
                List<BeanComparator> sortFields = Arrays.asList(new BeanComparator("empty"),
                        new BeanComparator("name"));
                ComparatorChain multiSort = new ComparatorChain(sortFields);
                Collections.sort(solrAttributes, multiSort);
            } catch (Exception ex) {
                LOGGER.log(Level.SEVERE, ex.getMessage(), ex);
            }
        }

View Full Code Here

                }
            }


            // Ordering
            if (filter.getOrders() != null) {
                ComparatorChain cchain = new ComparatorChain();
                for (String key : filter.getOrders()) {
                    boolean ascending = true;
                    String orderKey = key;
                    if (key.startsWith("+") || key.startsWith("-")) {
                        orderKey = key.substring(1, key.length());
                        if (key.startsWith("-"))
                            ascending = false;
                    }


                    Comparator c;
                    if ("name".equals(orderKey))
                        c = new Comparator<ProcessConf>() {
                            public int compare(ProcessConf o1, ProcessConf o2) {
                                return o1.getProcessId().getLocalPart().compareTo(o2.getProcessId().getLocalPart());
                            }
                        };
                    else if ("namespace".equals(orderKey))
                        c = new Comparator<ProcessConf>() {
                            public int compare(ProcessConf o1, ProcessConf o2) {
                                String ns1 = o1.getProcessId().getNamespaceURI() == null ? "" : o1.getProcessId()
                                        .getNamespaceURI();
                                String ns2 = o2.getProcessId().getNamespaceURI() == null ? "" : o2.getProcessId()
                                        .getNamespaceURI();
                                return ns1.compareTo(ns2);
                            }
                        };
                    else if ("version".equals(orderKey))
                        c = new Comparator<ProcessConf>() {
                            public int compare(ProcessConf o1, ProcessConf o2) {
                                // TODO: implement version comparisons.
                                return 0;
                            }
                        };
                    else if ("deployed".equals(orderKey))
                        c = new Comparator<ProcessConf>() {
                            public int compare(ProcessConf o1, ProcessConf o2) {
                                return o1.getDeployDate().compareTo(o2.getDeployDate());
                            }


                        };


                    else {
                        // unrecognized
                        __log.debug("unrecognized order key" + orderKey);
                        continue;
                    }


                    cchain.addComparator(c, !ascending);
                }


                Collections.sort(confs, cchain);
            }

View Full Code Here

                }
            }
            if (comps == null)
                comp = null;
            else
                comp = new ComparatorChain(comps);
        }


        if (comp == null)
            return val;

View Full Code Here

/*  79 */     return chainedComparator(new Comparator[] { comparator1, comparator2 });
/*     */   }
/*     */ 
/*     */   public static Comparator chainedComparator(Comparator[] comparators)
/*     */   {
/*  92 */     ComparatorChain chain = new ComparatorChain();
/*  93 */     for (int i = 0; i < comparators.length; i++) {
/*  94 */       if (comparators[i] == null) {
/*  95 */         throw new NullPointerException("Comparator cannot be null");
/*     */       }
/*  97 */       chain.addComparator(comparators[i]);
/*     */     }
/*  99 */     return chain;
/*     */   }

View Full Code Here

            if (memberList.size() <= 1) {
                return memberList;
            }
        }


        ComparatorChain chain = new ComparatorChain();
        for (SortKeySpec key : keySpecList) {
            boolean brk = key.direction.brk;
            MemberComparator comp;
            if (brk) {
                comp = new BreakMemberComparator(
                    evaluator, key.key, key.direction.descending);
            } else {
                comp = new HierarchicalMemberComparator(
                    evaluator, key.key, key.direction.descending);
            }
            comp.preloadValues(memberList);
            chain.addComparator(comp.wrap(), false);
        }


        Collections.sort(memberList, chain);
        return memberList;
    }

View Full Code Here

        }
        if (tupleList.size() <= 1) {
            return tupleList;
        }


        ComparatorChain chain = new ComparatorChain();
        for (SortKeySpec key : keySpecList) {
            boolean brk = key.direction.brk;
            boolean orderByKey =
                key.key.isWrapperFor(MemberOrderKeyFunDef.CalcImpl.class);
            if (brk) {
                TupleExpMemoComparator comp =
                    new BreakTupleComparator(evaluator, key.key, arity);
                comp.preloadValues(tupleList);
                chain.addComparator(comp, key.direction.descending);
            } else if (orderByKey) {
                TupleExpMemoComparator comp =
                    new HierarchicalTupleKeyComparator(
                        evaluator, key.key, arity);
                comp.preloadValues(tupleList);
                chain.addComparator(comp, key.direction.descending);
            } else {
                TupleExpComparator comp =
                    new HierarchicalTupleComparator(
                        evaluator, key.key, arity, key.direction.descending);
                chain.addComparator(comp, false);
            }
        }


        Collections.sort(tupleList, chain);

View Full Code Here

                }
            }
            if (comps == null)
                comp = null;
            else
                comp = new ComparatorChain(comps);
        }


        if (comp == null)
            return val;

View Full Code Here

0 1 2 3 4 5

TOP

Related Classes of org.apache.commons.collections.comparators.ComparatorChain

com.sparc.knappsack.components.controllers.SearchController

com.sparc.knappsack.components.controllers.SystemNotificationController

com.sparc.knappsack.components.services.SearchServiceImpl

mondrian.olap.fun.FunUtil

org.andromda.core.engine.ModelProcessor

org.andromda.utils.beans.BeanSorter

org.apache.commons.collections.ComparatorUtils

org.apache.ode.bpel.engine.ProcessAndInstanceManagementImpl

org.apache.openjpa.meta.FieldMetaData

org.fenixedu.academic.domain.ExecutionDegree

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.