Examples of org.apache.commons.collections15.map.AbstractLinkedMap

Package org.apache.commons.collections15.map

Examples of org.apache.commons.collections15.map.AbstractLinkedMap

org.apache.commons.collections15.Bag
An abstract implementation of a hash-based map that links entries to create an ordered map and which provides numerous points for subclasses to override.
This class implements all the features necessary for a subclass linked hash-based map. Key-value entries are stored in instances of the LinkEntry class which can be overridden and replaced. The iterators can similarly be replaced, without the need to replace the KeySet, EntrySet and Values view classes.
Overridable methods are provided to change the default hashing behaviour, and to change how entries are added to and removed from the map. Hopefully, all you need for unusual subclasses is here.
This implementation maintains order by original insertion, but subclasses may work differently. The OrderedMap interface is implemented to provide access to bidirectional iteration and extra convenience methods.
The orderedMapIterator() method provides direct access to a bidirectional iterator. The iterators from the other views can also be cast to OrderedIterator if required.
All the available iterators can be reset back to the start by casting to ResettableIterator and calling reset().
The implementation is also designed to be subclassed, with lots of useful methods exposed. @author java util LinkedHashMap @author Matt Hall, John Watkinson, Stephen Colebourne @version $Revision: 1.1 $ $Date: 2005/10/11 17:05:32 $ @since Commons Collections 3.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.map.AbstractLinkedMap

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.