Examples of org.apache.commons.collections15.buffer.PriorityBuffer

Package org.apache.commons.collections15.buffer

Examples of org.apache.commons.collections15.buffer.PriorityBuffer

org.apache.commons.collections15.comparators.ReverseComparator
Binary heap implementation of Buffer that provides for removal based on Comparator ordering.
The removal order of a binary heap is based on either the natural sort order of its elements or a specified {@link Comparator}. The {@link #remove()} method always returns the first element as determinedby the sort order. (The ascendingOrder flag in the constructors can be used to reverse the sort order, in which case {@link #remove()}will always remove the last element.) The removal order is not the same as the order of iteration; elements are returned by the iterator in no particular order.
The {@link #add(Object)} and {@link #remove()} operations performin logarithmic time. The {@link #get()} operation performs in constanttime. All other operations perform in linear time or worse.
Note that this implementation is not synchronized. Use {@link org.apache.commons.collections15.BufferUtils#synchronizedBuffer(Buffer)} or{@link org.apache.commons.collections15.buffer.SynchronizedBuffer#decorate(Buffer)}to provide synchronized access to a PriorityBuffer:
```
 Buffer heap = SynchronizedBuffer.decorate(new PriorityBuffer()); 
```
@author Peter Donald @author Ram Chidambaram @author Michael A. Smith @author Paul Jack @author Matt Hall, John Watkinson, Stephen Colebourne @version $Revision: 1.1 $ $Date: 2005/10/11 17:05:20 $ @since Commons Collections 3.0 (previously BinaryHeap v1.0)

            // success
        }
    }


    private void verifyElementsInPredicate(final String[] elements) {
        Predicate pred = new Predicate() {
            public boolean evaluate(Object x) {
                for (int i = 0; i < elements.length; i++)
                    if (elements[i].equals(x))
                        return true;
                return false;

View Full Code Here

     *
     * @param i the Iterator to "filter"
     * @return "filtered" iterator
     */
    protected FilterIterator makePassThroughFilter(Iterator i) {
        Predicate pred = new Predicate() {
            public boolean evaluate(Object x) {
                return true;
            }
        };
        return new FilterIterator(i, pred);

View Full Code Here

     *
     * @param i the Iterator to "filter"
     * @return "filtered" iterator
     */
    protected FilterIterator makeBlockAllFilter(Iterator i) {
        Predicate pred = new Predicate() {
            public boolean evaluate(Object x) {
                return false;
            }
        };
        return new FilterIterator(i, pred);

View Full Code Here

            assertTrue("NoSuchElementException must be thrown", e.getClass().equals((new NoSuchElementException()).getClass()));
        }
    }


    public void testReset() {
        ResettableListIterator it = (ResettableListIterator) makeObject();


        assertEquals(true, it.hasNext());
        assertEquals(false, it.hasPrevious());
        assertEquals(testValue, it.next());
        assertEquals(false, it.hasNext());
        assertEquals(true, it.hasPrevious());


        it.reset();


        assertEquals(true, it.hasNext());
        assertEquals(false, it.hasPrevious());
        assertEquals(testValue, it.next());
        assertEquals(false, it.hasNext());
        assertEquals(true, it.hasPrevious());


        it.reset();
        it.reset();


        assertEquals(true, it.hasNext());
    }

View Full Code Here

            }


            vv.setBackground(Color.WHITE);




            Transformer labelTransformer = new ChainedTransformer<String, String>(new Transformer[]{
                        new ToStringLabeller<Node>() {


                            public String transform(Node v) {
                                return v.getLabel();
                                //return ((primitives.graph.Node)(v.getVertex())).getLabel();

View Full Code Here

     * their natural ordering.
     */
    @SuppressWarnings("unchecked")
    public SortedSparseMultigraph()
    {
        this(new ComparableComparator(), new ComparableComparator());
    }

View Full Code Here

        } 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

     * OrderedMap uses TreeMap as its known comparison.
     *
     * @return a map that is known to be valid
     */
    public Map makeConfirmedMap() {
        return new TreeMap(new NullComparator(ComparableComparator.getInstance()));
    }

View Full Code Here

     * The only confirmed collection we have that is ordered is the sorted one.
     * Thus, sort the keys.
     */
    public Object[] getSampleKeys() {
        List list = new ArrayList(Arrays.asList(super.getSampleKeys()));
        Collections.sort(list, new NullComparator(ComparableComparator.getInstance()));
        return list.toArray();
    }

View Full Code Here

        } 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

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.commons.collections15.buffer.PriorityBuffer

edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance

edu.uci.ics.jung.samples.PluggableRendererDemo

junit.framework.TestSuite

org.apache.commons.collections15.ArrayStack

org.apache.commons.collections15.Bag

org.apache.commons.collections15.bag.AbstractMapBag

org.apache.commons.collections15.bag.AbstractTestBag

org.apache.commons.collections15.bag.HashBag

org.apache.commons.collections15.bag.TestPredicatedBag

org.apache.commons.collections15.bag.TestPredicatedSortedBag

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.