Examples of org.apache.commons.collections15.bidimap.TreeBidiMap

Package org.apache.commons.collections15.bidimap

Examples of org.apache.commons.collections15.bidimap.TreeBidiMap

org.apache.commons.collections15.Bag
Red-Black tree-based implementation of BidiMap where all objects added implement the Comparable interface.
This class guarantees that the map will be in both ascending key order and ascending value order, sorted according to the natural order for the key's and value's classes.
This Map is intended for applications that need to be able to look up a key-value pairing by either key or value, and need to do so with equal efficiency.
While that goal could be accomplished by taking a pair of TreeMaps and redirecting requests to the appropriate TreeMap (e.g., containsKey would be directed to the TreeMap that maps values to keys, containsValue would be directed to the TreeMap that maps keys to values), there are problems with that implementation. If the data contained in the TreeMaps is large, the cost of redundant storage becomes significant. The {@link DualTreeBidiMap} and{@link DualHashBidiMap} implementations use this approach.
This solution keeps minimizes the data storage by holding data only once. The red-black algorithm is based on java util TreeMap, but has been modified to simultaneously map a tree node by key and by value. This doubles the cost of put operations (but so does using two TreeMaps), and nearly doubles the cost of remove operations (there is a savings in that the lookup of the node to be removed only has to be performed once). And since only one node contains the key and value, storage is significantly less than that required by two TreeMaps.
The Map.Entry instances returned by the appropriate methods will not allow setValue() and will throw an UnsupportedOperationException on attempts to call that method. @author Marc Johnson @author Matt Hall, John Watkinson, Stephen Colebourne @version $Revision: 1.1 $ $Date: 2005/10/11 17:05:19 $ @since Commons Collections 3.0 (previously DoubleOrderedMap v2.0)

        buffer.addAll(Arrays.asList(getFullElements()));
        return UnmodifiableBuffer.decorate(buffer);
    }


    public Collection makeConfirmedCollection() {
        ArrayStack list = new ArrayStack();
        return list;
    }

View Full Code Here

        ArrayStack list = new ArrayStack();
        return list;
    }


    public Collection makeConfirmedFullCollection() {
        ArrayStack list = new ArrayStack();
        list.addAll(Arrays.asList(getFullElements()));
        return list;
    }

View Full Code Here

        buffer.addAll(Arrays.asList(getFullElements()));
        return SynchronizedBuffer.decorate(buffer);
    }


    public Collection makeConfirmedCollection() {
        ArrayStack list = new ArrayStack();
        return list;
    }

View Full Code Here

        ArrayStack list = new ArrayStack();
        return list;
    }


    public Collection makeConfirmedFullCollection() {
        ArrayStack list = new ArrayStack();
        list.addAll(Arrays.asList(getFullElements()));
        return list;
    }

View Full Code Here

    protected Buffer decorateBuffer(Buffer buffer, Predicate predicate) {
        return PredicatedBuffer.decorate(buffer, predicate);
    }


    public Collection makeCollection() {
        return decorateBuffer(new ArrayStack(), truePredicate);
    }

View Full Code Here

    public Collection makeCollection() {
        return decorateBuffer(new ArrayStack(), truePredicate);
    }


    public Collection makeConfirmedCollection() {
        return new ArrayStack();
    }

View Full Code Here

    public Collection makeConfirmedCollection() {
        return new ArrayStack();
    }


    public Collection makeConfirmedFullCollection() {
        ArrayStack list = new ArrayStack();
        list.addAll(java.util.Arrays.asList(getFullElements()));
        return list;
    }

View Full Code Here

    }
    
    //------------------------------------------------------------
    
    public Buffer makeTestBuffer() {
        return decorateBuffer(new ArrayStack(), testPredicate);
    }

View Full Code Here

        String[] testCaseName = {TestTransformedBuffer.class.getName()};
        junit.textui.TestRunner.main(testCaseName);
    }


    public void testTransformedBuffer() {
        Buffer buffer = TransformedBuffer.decorate(new ArrayStack(), TestTransformedCollection.STRING_TO_INTEGER_TRANSFORMER);
        assertEquals(0, buffer.size());
        Object[] els = new Object[]{"1", "3", "5", "7", "2", "4", "6"};
        for (int i = 0; i < els.length; i++) {
            buffer.add(els[i]);
            assertEquals(i + 1, buffer.size());

View Full Code Here

    }
    
    //--------------------------------------------------------------------------


    public void testlegalAddRemove() {
        Bag bag = makeTestBag();
        assertEquals(0, bag.size());
        Object[] els = new Object[]{"1", "3", "5", "7", "2", "4", "1"};
        for (int i = 0; i < els.length; i++) {
            bag.add(els[i]);
            assertEquals(i + 1, bag.size());
            assertEquals(true, bag.contains(els[i]));
        }
        Set set = ((PredicatedBag) bag).uniqueSet();
        assertTrue("Unique set contains the first element", set.contains(els[0]));
        assertEquals(true, bag.remove(els[0]));
        set = ((PredicatedBag) bag).uniqueSet();
        assertTrue("Unique set now does not contain the first element", !set.contains(els[0]));
    }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.commons.collections15.bidimap.TreeBidiMap

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

org.apache.commons.collections15.bag.TestTreeBag

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.