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

Package org.apache.commons.collections.comparators

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

org.apache.commons.collections.comparators.ComparableComparator
A {@link Comparator Comparator} that compares {@link Comparable Comparable} objects.
This Comparator is useful, for example, for enforcing the natural order in custom implementations of SortedSet and SortedMap.
Note: In the 2.0 and 2.1 releases of Commons Collections, this class would throw a {@link ClassCastException} ifeither of the arguments to {@link #compare(Object,Object) compare}were null, not {@link Comparable Comparable}, or for which {@link Comparable#compareTo(Object) compareTo} gaveinconsistent results. This is no longer the case. See {@link #compare(Object,Object) compare} for details. @since Commons Collections 2.0 @version $Revision: 1.15 $ $Date: 2004/05/15 13:24:11 $ @author Henri Yandell @see java.util.Collections#reverseOrder()

            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

            // 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

    private ArrayList odds = null; 
    private ArrayList fib = null; 


    public void setUp() throws Exception {
        super.setUp();
        comparator = new ComparableComparator();
        evens = new ArrayList();
        odds = new ArrayList();
        for(int i=0;i<20;i++) {
            if(0 == i%2) {
                evens.add(new Integer(i));

View Full Code Here

    }     
  }
  
  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

            // 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

    private ArrayList odds = null; 
    private ArrayList fib = null; 


    public void setUp() throws Exception {
        super.setUp();
        comparator = new ComparableComparator();
        evens = new ArrayList();
        odds = new ArrayList();
        for(int i=0;i<20;i++) {
            if(0 == i%2) {
                evens.add(new Integer(i));

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

    private ArrayList odds = null; 
    private ArrayList fib = null; 


    public void setUp() throws Exception {
        super.setUp();
        comparator = new ComparableComparator();
        evens = new ArrayList();
        odds = new ArrayList();
        for(int i=0;i<20;i++) {
            if(0 == i%2) {
                evens.add(new Integer(i));

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

0 1

TOP

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

com.thinkaurelius.titan.graphdb.query.GraphCentricQuery

org.apache.commons.collections.buffer.TestPriorityBuffer

org.apache.commons.collections.iterators.TestCollatingIterator

org.apache.commons.collections.TestBinaryHeap

org.fenixedu.academic.ui.renderers.providers.alumni.AlumniSearchDegreeProvider

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.