Examples of ca.odell.glazedlists.impl.adt.barcode2.SimpleTree

Package ca.odell.glazedlists.impl.adt.barcode2

Examples of ca.odell.glazedlists.impl.adt.barcode2.SimpleTree

ca.odell.glazedlists.impl.adt.barcode2.SimpleTreeIterator
Our second generation tree class.
Currently the API for this class is fairly low-level, particularly the use of bytes as color values. This is an implementation detail, exposed to maximize performance. Wherever necessary, consider creating a facade around this Tree class that provides methods more appropriate for your particular application.
This is a prototype replacement for the Barcode class that adds support for up to seven different colors. As well, this supports values in the node. It will hopefully also replace our IndexedTree class. This class is designed after those two classes and hopefully improves upon them in a few interesting ways:
Avoid recursion wherever possible to increase performance
Be generic to simplify handling of black/white values. These can be handled in one case rather than one case for each.
Make the node class a dataholder only and put most of the logic in the tree class. This allows us to share different Node classes with different memory requirements, while using the same logic class
This class came into being so we could use a tree to replace ListEventBlocks, which has only mediocre performance, particularly due to having to sort elements. As well, we might be able to keep a moved value in the tree, to support moved elements in ListEvents. @author Jesse Wilson

     */
    public void setComparator(Comparator<? super E> comparator) {
        // save this comparator
        this.comparator = comparator;
        // keep the old trees to construct the reordering
        SimpleTree previousSorted = sorted;
        // create the sorted list with a simple comparator
        final Comparator treeComparator;
        if(comparator != null) treeComparator = new ElementComparator(comparator);
        else treeComparator = new ElementRawOrderComparator();
        sorted = new SimpleTree<Element>(treeComparator);

View Full Code Here

         * Removes the last value returned by this iterator.
         */
        public void remove() {
            int indexToRemove = treeIterator.index();
            SortedList.this.source.remove(getSourceIndex(indexToRemove));
            treeIterator = new SimpleTreeIterator(sorted, indexToRemove, ALL_COLORS);
        }

View Full Code Here

0 1

TOP

Related Classes of ca.odell.glazedlists.impl.adt.barcode2.SimpleTree

ca.odell.glazedlists.io.CachingList

ca.odell.glazedlists.SortedList

ca.odell.glazedlists.SortedList$ElementComparator

ca.odell.glazedlists.SortedList$ElementRawOrderComparator

ca.odell.glazedlists.SortedList$SortedListIterator

ca.odell.glazedlists.TreeList$FinderInserter

java.util.ArrayList

java.util.List

java.util.NoSuchElementException

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.