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

Package org.apache.commons.collections.comparators

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

org.apache.commons.collections.comparators.ReverseComparator
Reverses the order of another comparator by reversing the arguments to its {@link #compare(Object,Object) compare} method. @since Commons Collections 2.0 @version $Revision: 1.20 $ $Date: 2004/05/16 11:49:24 $ @author Henri Yandell @author Michael A. Smith @see java.util.Collections#reverseOrder()

    }     
  }
  
  public void testBasicComparatorOps() {
    BinaryHeap heap = 
      new BinaryHeap(new ReverseComparator(new ComparableComparator()));
    
    assertTrue("heap should be empty after create", heap.isEmpty());
    
    try {
      heap.peek();

View Full Code Here

            fail("NoSuchElementException should be thrown if remove is called after all elements are removed");
        } catch (BufferUnderflowException ex) {}
    }


    public void testBasicComparatorOps() {
        PriorityBuffer heap = new PriorityBuffer(new ReverseComparator(new ComparableComparator()));


        assertTrue("heap should be empty after create", heap.isEmpty());


        try {
            heap.get();

View Full Code Here

    public TestDualTreeBidiMap2(String testName) {
        super(testName);
    }


    public BidiMap makeEmptyBidiMap() {
        return new DualTreeBidiMap(new ReverseComparator(ComparableComparator.getInstance()));
    }

View Full Code Here

    public BidiMap makeEmptyBidiMap() {
        return new DualTreeBidiMap(new ReverseComparator(ComparableComparator.getInstance()));
    }


    public Map makeConfirmedMap() {
        return new TreeMap(new ReverseComparator(ComparableComparator.getInstance()));
    }

View Full Code Here

    public void testSortOrder() throws Exception {
        SortedBidiMap sm = (SortedBidiMap) makeFullMap();


        // Sort by the comparator used in the makeEmptyBidiMap() method
        List newSortedKeys = Arrays.asList(getSampleKeys());
        Collections.sort(newSortedKeys, new ReverseComparator(ComparableComparator.getInstance()));
        newSortedKeys = Collections.unmodifiableList(newSortedKeys);


        Iterator mapIter = sm.keySet().iterator();
        Iterator expectedIter = newSortedKeys.iterator();
        while (expectedIter.hasNext()) {

View Full Code Here

            // expected
        }
    }


    public void testBasicComparatorOps() {
        BinaryHeap heap = new BinaryHeap(new ReverseComparator(new ComparableComparator()));


        assertTrue("heap should be empty after create", heap.isEmpty());


        try {
            heap.peek();

View Full Code Here

     */
    public static Comparator reversedComparator(Comparator comparator) {
        if (comparator == null) {
            comparator = NATURAL_COMPARATOR;
        }
        return new ReverseComparator(comparator);
    }

View Full Code Here


        /* .\ Filter by Newest Version \.___________________________________________ */


        // We have 2 or more nodes that are equal distance from the root.
        // Determine which one is 'newest' based on version id.
        Collections.sort( remainingNodes, new ReverseComparator( new NodeLocationVersionComparator() ) );


        NodeLocation nodeloc = (NodeLocation) remainingNodes.get( 0 );
        return nodeloc.artifact;
    }

View Full Code Here

                reverse = Boolean.valueOf((String) reverseProperty);
            }
            
            Class<?> clazz = Class.forName(comparatorClassName.toString());
            Comparator<?> comparator = (Comparator<?>)clazz.newInstance();
            return reverse ? new ReverseComparator(comparator) : comparator;
        }
        return null;
    }

View Full Code Here

        int ilimit = useLimit(rreq.getRequest());
        rreq.getRequest().setAttribute("limit", new Integer(ilimit));
        if (ioffset + ilimit > hits.length()) ilimit = hits.length()-ioffset;
        
        boolean websiteSpecificSearch = checkForWebsite(rreq.getRequest());
        TreeMap searchResults = new TreeMap(new ReverseComparator());
        TreeSet categories = new TreeSet();
        Roller roller = RollerFactory.getRoller();
        UserManager userMgr = roller.getUserManager();
        WeblogManager weblogMgr =roller.getWeblogManager();
        WeblogEntryData entry;

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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

br.com.ingenieux.mojo.beanstalk.AbstractBeanstalkMojo

com.cubusmail.gwtui.server.services.UserAccountService

com.suarte.webapp.action.BasePage

com.urbanairship.statshtable.StatsHTable

es.uma.crudframework.webapp.action.BasePage

mondrian.olap.fun.PartialSortTest

net.sf.jasperreports.crosstabs.fill.calculation.BucketDefinition

org.apache.cassandra.db.filter.SliceQueryFilter

org.apache.cayenne.ashwood.AshwoodEntitySorter

org.apache.cayenne.lifecycle.sort.WeightedAshwoodEntitySorter

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.