Attachment 15190 Details for Bug 60117 – Stefans new test suites

[patch] Stefans new test suites

ui_tests_patch.txt (text/plain), 84.59 KB, created by Tod Creasey

on 2004-10-15 10:24:00 EDT

(hide)

Description:

Filename:

MIME Type:

Creator: Tod Creasey

Created: 2004-10-15 10:24:00 EDT

Size: 84.59 KB

patch

obsolete

>Index: plugin.xml
>===================================================================
>RCS file: /home/eclipse/org.eclipse.ui.tests/plugin.xml,v
>retrieving revision 1.103
>diff -u -r1.103 plugin.xml
>--- plugin.xml	29 Sep 2004 15:59:56 -0000	1.103
>+++ plugin.xml	5 Oct 2004 01:30:11 -0000
>@@ -315,7 +315,16 @@
>             class="org.eclipse.ui.tests.decorators.DecoratorTableTreeView"
>             category="org.eclipse.ui.tests.decoratorCategory"
>             name="Table Tree Test"
>-            id="org.eclipse.ui.tests.decorator.TableTreeTest"/>      
>+            id="org.eclipse.ui.tests.decorator.TableTreeTest"/>
>+      <view
>+            class="org.eclipse.jface.tests.viewers.interactive.ConcurrentTableTestView"
>+            name="Concurrent Table Test View"
>+            id="org.eclipse.ui.tests.concurrentTableTest"/>      
>+      <view
>+            class="org.eclipse.jface.tests.viewers.interactive.TestMarkerView"
>+            name="Test Marker View"
>+            id="org.eclipse.ui.tests.testMarkerView"/>      
>+
>             
>    </extension>
>    <extension
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/AllTests.java
>===================================================================
>RCS file: /home/eclipse/org.eclipse.ui.tests/Eclipse JFace Tests/org/eclipse/jface/tests/viewers/AllTests.java,v
>retrieving revision 1.15
>diff -u -r1.15 AllTests.java
>--- Eclipse JFace Tests/org/eclipse/jface/tests/viewers/AllTests.java	28 Sep 2004 13:44:38 -0000	1.15
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/AllTests.java	5 Oct 2004 01:30:11 -0000
>@@ -23,6 +23,7 @@
> 
>     public static Test suite() {
>         TestSuite suite = new TestSuite();
>+        suite.addTest(new TestSuite(LazySortedCollectionTest.class));
>         suite.addTest(new TestSuite(TreeViewerTest.class));
>         suite.addTest(new TestSuite(TableViewerTest.class));
>         suite.addTest(new TestSuite(TableTreeViewerTest.class));
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/LazySortedCollectionTest.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/LazySortedCollectionTest.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/LazySortedCollectionTest.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/LazySortedCollectionTest.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,562 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import java.util.Arrays;
>+import java.util.Iterator;
>+import java.util.TreeSet;
>+
>+import junit.framework.Assert;
>+import junit.framework.Test;
>+import junit.framework.TestCase;
>+import junit.framework.TestSuite;
>+
>+import org.eclipse.jface.viewers.deferred.LazySortedCollection;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class LazySortedCollectionTest extends TestCase {
>+    
>+    public static void main(String[] args) {
>+        junit.textui.TestRunner.run(LazySortedCollectionTest.class);
>+    }
>+    
>+    public static Test suite() {
>+        return new TestSuite(LazySortedCollectionTest.class);
>+    }
>+    
>+    private TestComparator comparator;
>+    private TestComparator comparisonComparator;
>+    
>+    // All operations will be done on both collections -- after each operation, the result
>+    // will be compared
>+    private LazySortedCollection collection;
>+    private TreeSet comparisonCollection;
>+
>+    /**
>+     * Please don't add or remove from this set -- we rely on the exact insertion order
>+     * to get full coverage from the removal tests.
>+     */
>+    private String[] se = new String[] {
>+            "v00 aaaaaa",
>+            "v01 apple",
>+            "v02 booger",
>+            "v03 car",
>+            "v04 dog",
>+            "v05 elephant",
>+            "v06 fox",
>+            "v07 goose",
>+            "v08 hippie",
>+            "v09 iguana",
>+            "v10 junk",
>+            "v11 karma",
>+            "v12 lemon",
>+            "v13 mongoose",
>+            "v14 noodle",
>+            "v15 opal",
>+            "v16 pumpkin",
>+            "v17 quirks",
>+            "v18 resteraunt",
>+            "v19 soap",
>+            "v20 timmy",
>+            "v21 ugly",
>+            "v22 virus",
>+            "v23 wigwam",
>+            "v24 xerxes",
>+            "v25 yellow",
>+            "v26 zero"
>+    };
>+    
>+    /**
>+     * Please don't mess with the insertion order here or add or remove from this set -- 
>+     * we rely on the exact order in order to get full coverage for the removal tests.
>+     */
>+    private String[] elements = new String[] {
>+            se[19],
>+            se[7],
>+            se[6],
>+            se[1],
>+            se[20],
>+            se[8],
>+            se[0],
>+            se[23],
>+            se[17],
>+            se[18],
>+            se[24],
>+            se[25],
>+            se[10],
>+            se[5],
>+            se[15],
>+            se[16],
>+            se[21],
>+            se[26],
>+            se[22],
>+            se[3],
>+            se[9],
>+            se[4],
>+            se[11],
>+            se[12],
>+            se[13],
>+            se[14],
>+            se[2]  
>+        };
>+
>+    
>+    public static void printArray(Object[] array) {
>+        for (int i = 0; i < array.length; i++) {
>+            Object object = array[i];
>+            
>+            System.out.println("[" + i + "] = " + array[i]);
>+        }
>+    }
>+    
>+    /* (non-Javadoc)
>+     * @see junit.framework.TestCase#setUp()
>+     */
>+    protected void setUp() throws Exception {
>+        System.out.println("--- " + getName());
>+        
>+        comparator = new TestComparator();
>+        collection = new LazySortedCollection(comparator);
>+        // Ensure a predictable tree structure
>+        collection.enableRandomization = false;
>+     
>+        comparisonComparator = new TestComparator();
>+        comparisonCollection = new TreeSet(comparisonComparator);
>+        
>+        addAll(elements);
>+        
>+        super.setUp();
>+    }
>+    
>+    /* (non-Javadoc)
>+     * @see junit.framework.TestCase#tearDown()
>+     */
>+    protected void tearDown() throws Exception {
>+        System.out.println("Comparisons required by lazy collection: " + comparator.comparisons);
>+        System.out.println("Comparisons required by reference implementation: " + comparisonComparator.comparisons);
>+        System.out.println("");
>+        
>+        super.tearDown();
>+    }
>+    
>+    /**
>+     * Computes the entries that are expected to lie in the given range. The result
>+     * is sorted.
>+     * 
>+     * @param start
>+     * @param length
>+     * @return
>+     * @since 3.1
>+     */
>+    private Object[] computeExpectedElementsInRange(int start, int length) {
>+        int counter = 0;
>+        
>+        Iterator iter = comparisonCollection.iterator();
>+        while(iter.hasNext() && counter < start) {
>+            iter.next();
>+            counter++;
>+        }
>+        
>+        Object[] result = new Object[length];
>+        for (int i = 0; i < result.length; i++) {
>+            result[i] = iter.next(); 
>+        }
>+                
>+        return result;
>+    }
>+
>+    private void addAll(Object[] elements) {
>+        collection.addAll(elements);
>+        comparisonCollection.addAll(Arrays.asList(elements));
>+    }
>+    
>+    private void add(Object toAdd) {
>+        collection.add(toAdd);
>+        comparisonCollection.add(toAdd);
>+    }
>+    
>+    private void remove(Object toRemove) {
>+        collection.remove(toRemove);
>+        comparisonCollection.remove(toRemove);
>+    }
>+    
>+    private void removeRange(int start, int length) {
>+        collection.removeRange(start, length);
>+        
>+        Object[] expected = computeExpectedElementsInRange(start, length);
>+
>+        // Alternative remove implementation that removes one-at-a-time
>+        for (int i = 0; i < expected.length; i++) {
>+            Object object = expected[i];
>+            
>+            comparisonCollection.remove(expected[i]);
>+        }
>+    }
>+    
>+    private void clear() {
>+        collection.clear();
>+        comparisonCollection.clear();
>+    }
>+    
>+    /**
>+     * Force the collection to sort all elements immediately.
>+     * 
>+     * @since 3.1
>+     */
>+    private void forceFullSort() {
>+        queryRange(0, elements.length, true);
>+    }
>+    
>+    private void assertContentsValid() {
>+        queryRange(0, comparisonCollection.size(), false);
>+        Assert.assertEquals(comparisonCollection.size(), collection.size());
>+        Assert.assertEquals(comparisonCollection.isEmpty(), collection.isEmpty());
>+    }
>+    
>+    private void assertIsPermutation(Object[] array1, Object[] array2) {
>+        Object[] sorted1 = new Object[array1.length];
>+        System.arraycopy(array1, 0, sorted1, 0, array1.length);
>+        Arrays.sort(sorted1, new TestComparator());
>+        
>+        Object[] sorted2 = new Object[array2.length];
>+        System.arraycopy(array2, 0, sorted2, 0, array2.length);
>+        Arrays.sort(sorted2, new TestComparator());
>+        
>+        assertArrayEquals(sorted1, sorted2);
>+    }
>+
>+    /**
>+     * Queries the collection for the given range, and throws an assertation failure if the 
>+     * result was unexpected. Assumes that the "elements" array was initially added and that nothing
>+     * has been added or removed since.
>+     * 
>+     * @param start
>+     * @param length
>+     * @param sorted
>+     * @since 3.1
>+     */
>+    private Object[] queryRange(int start, int length, boolean sorted) {
>+        Object[] result = new Object[length];
>+        
>+        int returnValue = collection.getRange(result, start, sorted);
>+        
>+        Assert.assertEquals(returnValue, length);
>+        
>+        Object[] expectedResult = computeExpectedElementsInRange(start, length);
>+        
>+        if (sorted) {
>+            // If the result is supposed to be sorted, it will match the expected
>+            // result exactly
>+            assertArrayEquals(expectedResult, result);
>+        } else {
>+            // Otherwise, the result merely needs to be a permutation of the
>+            // expected result.
>+            assertIsPermutation(result, expectedResult);
>+        }
>+        
>+        collection.testInvariants();
>+        
>+        return result;
>+    }
>+    
>+    private void assertArrayEquals(Object[] array1, Object[] array2) {
>+        for (int i = 0; i < array1.length; i++) {
>+
>+            Assert.assertEquals(array1[i], array2[i]);
>+        }        
>+    }
>+    
>+    public void testComparisonCount() {
>+        Assert.assertTrue("additions should not require any comparisons", comparator.comparisons == 0);
>+        
>+        queryRange(0, elements.length, false);
>+
>+        Assert.assertTrue("requesting the complete set of unsorted elements should not require any comparisons", comparator.comparisons == 0);
>+    }
>+    
>+    /**
>+     * Ensure that no comparisons are required for range queries once the collection is fully sorted
>+     * 
>+     * @since 3.1
>+     */
>+    public void testSortAll() {
>+        // Test that sorting the entire array works
>+        queryRange(0, elements.length, true);
>+        
>+        int comparisons = comparator.comparisons;
>+        
>+        // Ensure that subsequent operations require no comparisons
>+        queryRange(elements.length - 10, 10, true);
>+        queryRange(0, 10, false);
>+        
>+        Assert.assertEquals("Once the lazy collection is fully sorted, it should not require further comparisons", 
>+                comparisons, comparator.comparisons);
>+    }
>+    
>+    /**
>+     * Tests LazySortedCollection.removeNode(int) when removing a leaf node
>+     */
>+    public void testRemoveLeafNode() {
>+        forceFullSort();
>+        remove(se[9]);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Tests LazySortedCollection.removeNode(int) when removing a node with no left child
>+     */
>+    public void testRemoveNodeWithNoLeftChild() {
>+        forceFullSort();
>+        remove(se[23]);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Tests LazySortedCollection.removeNode(int) when removing a node with no right child
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveNodeWithNoRightChild() {
>+        forceFullSort();
>+        remove(se[13]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Tests LazySortedCollection.remove when removing the root node
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveRootNode() {
>+        forceFullSort();
>+        remove(se[19]);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Tests LazySortedCollection.remove when the removal
>+     * will require swapping with a non-leaf node. (The descendent with the closest value
>+     * in the largest subtree has at least 1 child).
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveWhereSwappedNodeIsntLeaf() {
>+        forceFullSort();
>+        remove(se[14]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Tests LazySortedCollection.remove when the removal
>+     * will require swapping with a non-leaf node, and both the removed node and the swapped
>+     * node contain unsorted children.
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveWithUnsortedSwap() {
>+        // Ensure that we've sorted nodes 13 and 14 
>+        queryRange(14, 1, true);
>+        queryRange(13, 1, true);
>+        
>+        // Add some unsorted nodes that will become children of the node with value "v13 mongoose"
>+        addAll(new String[] {"v13 n", "v13 l"});
>+        // Ensure that the new nodes are pushed down to node 14 by querying its parent (currently at position 8)
>+        queryRange(8, 1, true);
>+        
>+        // Add some unsorted nodes that will become children of the node with value "v14 noodle" 
>+        addAll(new String[] {"v14 m", "v14 o"});
>+        // Push down the unsorted nodes by querying for the parent of "v14 noodle" 
>+        // (the parent is currently at position 7) 
>+        queryRange(7, 1, true);
>+        
>+        // Now remove node with value "v14 noodle" -- this should swap it with the node "v13 mongoose", requiring
>+        // both sets of unsorted children to be dealt with
>+        
>+        remove(se[14]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove an element from an initially unsorted collection
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveFromUnsorted() {
>+        remove(se[10]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove the root from an initially-unsorted collection
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveRootFromUnsorted() {
>+        remove(se[19]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Ensure that removing an element that isn't in the collection is a no-op
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveUnknown() {
>+        remove("some unknown element");
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Tests that the swaps during removal don't mess up the internal hashmap.
>+     * Perform a removal that will require a swap, add a new item, then
>+     * remove the item that was previously swapped. If the hashmap was not updated,
>+     * then the removed item may still be pointing to its old index and the 
>+     * new item will be removed instead. 
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemovePreviouslySwappedNode() {
>+        queryRange(0, elements.length, true);
>+        remove(se[14]);
>+        // Add a new item -- should reuse the same index used by the previous item
>+        add("something new");
>+        assertContentsValid();
>+        remove(se[13]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove all nodes using removeRange
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveFullRange() {
>+        removeRange(0, se.length);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove a range that includes the start
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveFromStart() {
>+        removeRange(0, se.length / 2);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove a range that includes the last node
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveFromEnd() {
>+        int start = se.length / 2;
>+        removeRange(start, se.length - start);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove a range that includes the root, but leaves nodes in both subtrees intact.
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveIncludingRoot() {
>+        removeRange(14, 6);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Test boundary conditions: 
>+     * 
>+     * Tests moving an entire right subtree, and a left subtree including the tree itself
>+     */
>+    public void testRemoveRightSubtree() {
>+        int start = 20;
>+        removeRange(9, 5);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Test boundary conditions: Tests moving an entire left subtree
>+     */
>+    public void testRemoveLeftSubtree() {
>+        removeRange(3, 4);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Test boundary conditions: Tests moving an entire left subtree including the tree itself
>+     */
>+    public void testRemoveRightIncludingRoot() {
>+        removeRange(3, 5);
>+        assertContentsValid();
>+    }
>+    
>+    public void testClear() {
>+        clear();
>+        assertContentsValid();
>+    }
>+    
>+    public void testClearSorted() {
>+        forceFullSort();
>+        clear();
>+        assertContentsValid();
>+    }
>+    
>+    //    
>+//    
>+//    public static void testAdditions() {
>+//        TestComparator comparator = new TestComparator();
>+//        LazySortedCollection collection = new LazySortedCollection(comparator);
>+//
>+//        addSomeElements(collection);
>+//        
>+//        System.out.println("comparisons after add = " + comparator.comparisons);
>+//        comparator.comparisons = 0;
>+//        
>+//        // Getfirst10Elements
>+//        Object[] first10Elements = new Object[10];
>+//        collection.getFirst(first10Elements, false);
>+//        System.out.println("first 10 elements:");
>+//        printArray(first10Elements);
>+//        System.out.println("comparisons after getFirst = " + comparator.comparisons);
>+//        comparator.comparisons = 0;
>+//        
>+//        collection.print();
>+//        
>+//        // remove the 10th element
>+//        collection.remove(first10Elements[9]);
>+//        
>+//        collection.print();
>+//
>+////        
>+////        collection.getFirst(first10Elements, true);
>+////        System.out.println("first 10 elements (sorted):");
>+////        printArray(first10Elements);
>+////        System.out.println("comparisons after getFirst = " + comparator.comparisons);
>+////        comparator.comparisons = 0;
>+////        
>+////        
>+////        
>+////        // get elements 8-13
>+////        Object[] eightThrough14 = new Object[7];
>+////        collection.getRange(eightThrough14, 8, false);
>+////        System.out.println("elements 8-14:");
>+////        printArray(eightThrough14);
>+////        System.out.println("comparisons after 8-14 query = " + comparator.comparisons);
>+////        comparator.comparisons = 0;
>+//        
>+//        collection.print();
>+//    }
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/ListContentProvider.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/ListContentProvider.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/ListContentProvider.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/ListContentProvider.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,80 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import java.util.ArrayList;
>+import java.util.Collection;
>+
>+import org.eclipse.jface.viewers.deferred.AbstractConcurrentContentProvider;
>+import org.eclipse.jface.viewers.deferred.IConcurrentContentProviderListener;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class ListContentProvider extends AbstractConcurrentContentProvider {
>+    
>+    private ArrayList data = new ArrayList();
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.jface.viewers.deferred.IConcurrentContentProvider#getElements(org.eclipse.core.runtime.IProgressMonitor)
>+     */
>+    public Object[] getElements() {
>+        return data.toArray();
>+    }
>+
>+    public void set(Object[] newContents) {
>+        clear();
>+        addAll(newContents);
>+    }
>+    
>+    public void clear() {
>+        Object[] removed = data.toArray();
>+        data.clear();
>+        fireRemove(removed);
>+    }
>+    
>+    public void addAll(Object[] toAdd) {
>+        for (int i = 0; i < toAdd.length; i++) {
>+            Object object = toAdd[i];
>+            
>+            data.add(object);
>+        }
>+        
>+        fireAdd(toAdd);
>+    }
>+    
>+    public void addAll(Collection toAdd) {
>+        addAll(toAdd.toArray());
>+    }
>+    
>+    public void changeAll(Object[] changed) {
>+        fireUpdate(changed);
>+    }
>+    
>+    public void removeAll(Object[] toRemove) {
>+        for (int i = 0; i < toRemove.length; i++) {
>+            Object object = toRemove[i];
>+            
>+            data.add(object);
>+        }        
>+        
>+        fireRemove(toRemove);
>+    }
>+
>+    /* (non-Javadoc)
>+     * @see org.eclipse.jface.viewers.deferred.IConcurrentContentProvider#requestUpdate(org.eclipse.jface.viewers.deferred.IConcurrentContentProviderListener)
>+     */
>+    public void requestUpdate(IConcurrentContentProviderListener listener) {
>+        listener.setContents(getElements());
>+        
>+    }
>+    
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestComparator.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestComparator.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestComparator.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestComparator.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,30 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import java.util.Comparator;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class TestComparator implements Comparator {
>+
>+    public volatile int comparisons = 0;
>+    
>+    /* (non-Javadoc)
>+     * @see java.util.Comparator#compare(java.lang.Object, java.lang.Object)
>+     */
>+    public int compare(Object arg0, Object arg1) {
>+        comparisons++;
>+
>+        return (arg0.toString()).compareTo(arg1.toString());
>+    }
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestConcurrentTable.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestConcurrentTable.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestConcurrentTable.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestConcurrentTable.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,142 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import java.util.Comparator;
>+
>+import org.eclipse.jface.viewers.deferred.ConcurrentTableManager;
>+import org.eclipse.jface.viewers.deferred.IConcurrentContentProvider;
>+import org.eclipse.jface.viewers.deferred.IConcurrentTable;
>+import org.eclipse.swt.SWT;
>+import org.eclipse.swt.events.DisposeEvent;
>+import org.eclipse.swt.events.DisposeListener;
>+import org.eclipse.swt.widgets.Composite;
>+import org.eclipse.swt.widgets.Event;
>+import org.eclipse.swt.widgets.Listener;
>+import org.eclipse.swt.widgets.Table;
>+import org.eclipse.swt.widgets.TableColumn;
>+import org.eclipse.swt.widgets.TableItem;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class TestConcurrentTable {
>+
>+    private Table tbl; 
>+    private ConcurrentTableManager manager;
>+    private IConcurrentContentProvider provider;
>+    private Comparator sortOrder;
>+    private int limit = -1;
>+    private DisposeListener dl = new DisposeListener() {
>+
>+        public void widgetDisposed(DisposeEvent e) {
>+            disposed();
>+        }
>+
>+    };
>+    
>+    private IConcurrentTable concurrentTable = new IConcurrentTable() {
>+
>+        public void flushCache(Object element) {
>+            
>+        }
>+
>+        public void update(int itemIndex, Object element) {
>+            TableItem item = tbl.getItem(itemIndex);
>+
>+            item.setText(0, element.toString());            
>+        }
>+
>+        public void setTotalItems(int total) {
>+            tbl.setItemCount(total);
>+            tbl.redraw();
>+            scrolled();            
>+        }
>+        
>+    };
>+    
>+    private Listener scrollListener = new Listener() {
>+
>+        public void handleEvent(Event event) {
>+            scrolled();
>+        }
>+        
>+    };
>+    
>+    public TestConcurrentTable(Composite parent, Comparator sortOrder) {
>+        tbl = new Table(parent, SWT.MULTI | SWT.H_SCROLL | SWT.V_SCROLL | SWT.BORDER | SWT.VIRTUAL);
>+        tbl.setHeaderVisible(true);
>+        TableColumn column = new TableColumn(tbl, SWT.CENTER);
>+        column.setText("test");
>+        column.setWidth(400);
>+        tbl.getVerticalBar().addListener(SWT.Selection, scrollListener);
>+        tbl.getVerticalBar().addListener(SWT.Show, scrollListener);
>+        tbl.getVerticalBar().addListener(SWT.Hide, scrollListener);
>+        tbl.addListener(SWT.Resize, scrollListener);
>+        this.sortOrder = sortOrder;
>+    }
>+    
>+    public void refresh() {
>+        manager.refresh();
>+    }
>+    
>+    public void setLimit(int newLimit) {
>+        if (manager != null) {
>+            manager.setLimit(newLimit);
>+        }
>+        this.limit = newLimit;
>+    }
>+    
>+    public int getLimit() {
>+        return limit;
>+    }
>+    
>+    /**
>+     * 
>+     * @since 3.1
>+     */
>+    protected void scrolled() {
>+        if (manager != null) {
>+            manager.setRangeOfInterest(tbl.getTopIndex(), 
>+                    (tbl.getBounds().height / tbl.getItemHeight()) + 1);
>+        }
>+    }
>+
>+    public Table getControl() {
>+        return tbl;
>+    }
>+    
>+    public void setContentProvider(IConcurrentContentProvider contentProvider) {
>+        tbl.removeAll();
>+        disposeManager();
>+        
>+        manager = new ConcurrentTableManager(concurrentTable, contentProvider, sortOrder, tbl.getDisplay());
>+        manager.setLimit(limit);
>+        manager.refresh();
>+        scrolled();
>+    }
>+    
>+    protected void disposed() {
>+        disposeManager();
>+    }
>+    
>+    private void disposeManager() {
>+        if (manager != null) {
>+            manager.dispose();
>+            manager = null;
>+        }
>+    }
>+        
>+    public Table getTable() {
>+        return tbl;
>+    }
>+
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/VirtualTableTest.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/VirtualTableTest.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/VirtualTableTest.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/VirtualTableTest.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,30 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import org.eclipse.swt.widgets.Display;
>+import org.eclipse.swt.widgets.Shell;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class VirtualTableTest {
>+
>+    public static void main(String[] args) {
>+		Display display = new Display ();
>+		final Shell shell = new Shell (display);
>+				
>+		while (!shell.isDisposed()) {
>+			if (!display.readAndDispatch ()) display.sleep ();
>+		}
>+		display.dispose ();
>+    }
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/ConcurrentTableTestView.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/ConcurrentTableTestView.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/ConcurrentTableTestView.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/ConcurrentTableTestView.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,188 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers.interactive;
>+
>+import java.util.ArrayList;
>+import java.util.Random;
>+
>+import org.eclipse.core.runtime.IProgressMonitor;
>+import org.eclipse.core.runtime.IStatus;
>+import org.eclipse.core.runtime.Status;
>+import org.eclipse.jface.tests.viewers.ListContentProvider;
>+import org.eclipse.jface.tests.viewers.TestComparator;
>+import org.eclipse.jface.tests.viewers.TestConcurrentTable;
>+import org.eclipse.swt.SWT;
>+import org.eclipse.swt.events.SelectionAdapter;
>+import org.eclipse.swt.events.SelectionEvent;
>+import org.eclipse.swt.layout.GridData;
>+import org.eclipse.swt.layout.GridLayout;
>+import org.eclipse.swt.widgets.Button;
>+import org.eclipse.swt.widgets.Composite;
>+import org.eclipse.swt.widgets.Label;
>+import org.eclipse.ui.part.ViewPart;
>+import org.eclipse.ui.progress.WorkbenchJob;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class ConcurrentTableTestView extends ViewPart {
>+
>+    private TestConcurrentTable table;
>+    private TestComparator comparator = new TestComparator() {
>+        
>+        /* (non-Javadoc)
>+         * @see java.util.Comparator#compare(java.lang.Object, java.lang.Object)
>+         */
>+        public int compare(Object arg0, Object arg1) {
>+//            try {
>+//                // Insert a bogus delay to simulate doing work
>+//                Thread.sleep(1);
>+//            } catch (InterruptedException e) {
>+//            }
>+
>+//            int delay = 2; // Time to spin the CPU for (milliseconds)
>+//            
>+//            // Do some work to occupy time 
>+//            int counter = 0;
>+//            long timestamp = System.currentTimeMillis();
>+//            while (System.currentTimeMillis() < timestamp + delay) {
>+//                counter++;
>+//            }
>+            
>+            int result = super.compare(arg0, arg1);
>+            
>+            scheduleComparisonUpdate();
>+            
>+            return result;
>+        };
>+    };
>+    
>+    private WorkbenchJob updateCountRunnable = new WorkbenchJob("") {
>+        
>+        /* (non-Javadoc)
>+         * @see org.eclipse.ui.progress.UIJob#runInUIThread(org.eclipse.core.runtime.IProgressMonitor)
>+         */
>+        public IStatus runInUIThread(IProgressMonitor monitor) {
>+            updateCount.setText("Comparison count = " + comparator.comparisons);
>+            return Status.OK_STATUS;
>+        }
>+    };
>+    
>+    
>+    
>+    private Label updateCount;
>+    private ListContentProvider contentProvider = new ListContentProvider();
>+    private Random rand = new Random();
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#createPartControl(org.eclipse.swt.widgets.Composite)
>+     */
>+    public void createPartControl(Composite temp) {
>+        Composite parent = new Composite(temp, SWT.NONE);
>+        GridLayout layout = new GridLayout();
>+        layout.numColumns = 2;
>+        
>+        parent.setLayout(layout);
>+        
>+        // Create the table
>+        {
>+	        table = new TestConcurrentTable(parent, comparator);
>+	        table.setLimit(400);
>+	        GridData data = new GridData(GridData.FILL_BOTH);
>+	        table.getControl().setLayoutData(data);
>+	        table.setContentProvider(contentProvider);
>+        }
>+        
>+        // Create the buttons
>+        Composite buttonBar = new Composite(parent, SWT.NONE);
>+        buttonBar.setLayoutData(new GridData(GridData.FILL_BOTH));
>+        GridLayout buttonBarLayout = new GridLayout();
>+        buttonBarLayout.numColumns = 1;
>+        buttonBar.setLayout(buttonBarLayout);
>+        {
>+
>+            updateCount = new Label(buttonBar, SWT.NONE);
>+            updateCount.setLayoutData(new GridData(GridData.FILL_BOTH));
>+
>+            Button resetCountButton = new Button(buttonBar, SWT.PUSH);
>+            resetCountButton.setLayoutData(new GridData(GridData.FILL_BOTH));
>+            resetCountButton.setText("Reset comparison count");
>+	        resetCountButton.addSelectionListener(new SelectionAdapter() {
>+		        /* (non-Javadoc)
>+	             * @see org.eclipse.swt.events.SelectionListener#widgetSelected(org.eclipse.swt.events.SelectionEvent)
>+	             */
>+	            public void widgetSelected(SelectionEvent e) {
>+	                comparator.comparisons = 0;
>+	                scheduleComparisonUpdate();
>+	            } 
>+	        });
>+	        
>+	        Button testButton = new Button(buttonBar, SWT.PUSH);
>+	        testButton.setLayoutData(new GridData(GridData.FILL_BOTH));
>+	        testButton.setText("add 1000 elements");
>+	        testButton.addSelectionListener(new SelectionAdapter() {
>+		        /* (non-Javadoc)
>+	             * @see org.eclipse.swt.events.SelectionListener#widgetSelected(org.eclipse.swt.events.SelectionEvent)
>+	             */
>+	            public void widgetSelected(SelectionEvent e) {
>+	                addRandomElements(1000);
>+	            } 
>+	        });
>+	        
>+	        Button removeButton = new Button(buttonBar, SWT.PUSH);
>+	        removeButton.setLayoutData(new GridData(GridData.FILL_BOTH));
>+	        removeButton.setText("remove all");
>+	        removeButton.addSelectionListener(new SelectionAdapter() {
>+		        /* (non-Javadoc)
>+	             * @see org.eclipse.swt.events.SelectionListener#widgetSelected(org.eclipse.swt.events.SelectionEvent)
>+	             */
>+	            public void widgetSelected(SelectionEvent e) {
>+	                clear();
>+	            } 
>+	        });
>+
>+        }
>+    }
>+    
>+    
>+    /**
>+     * 
>+     * @since 3.1
>+     */
>+    protected void scheduleComparisonUpdate() {
>+        updateCountRunnable.schedule(100);
>+    }
>+
>+
>+
>+    public void addRandomElements(int amount) {
>+        
>+        ArrayList tempList = new ArrayList();
>+
>+        for (int counter = 0; counter < amount; counter++) {
>+            tempList.add("" + rand.nextLong() + " " + counter );
>+        }
>+        
>+        contentProvider.addAll(tempList);
>+    }
>+    
>+    public void clear() {
>+        contentProvider.clear();
>+    }
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#setFocus()
>+     */
>+    public void setFocus() {
>+        // TODO Auto-generated method stub
>+
>+    }
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/TestMarkerView.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/TestMarkerView.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/TestMarkerView.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/TestMarkerView.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,105 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers.interactive;
>+
>+import java.util.Random;
>+
>+import org.eclipse.jface.tests.viewers.TestComparator;
>+import org.eclipse.jface.tests.viewers.TestConcurrentTable;
>+import org.eclipse.swt.SWT;
>+import org.eclipse.swt.events.SelectionAdapter;
>+import org.eclipse.swt.events.SelectionEvent;
>+import org.eclipse.swt.layout.GridData;
>+import org.eclipse.swt.layout.GridLayout;
>+import org.eclipse.swt.widgets.Button;
>+import org.eclipse.swt.widgets.Composite;
>+import org.eclipse.ui.IViewSite;
>+import org.eclipse.ui.PartInitException;
>+import org.eclipse.ui.part.ViewPart;
>+import org.eclipse.ui.views.markers.internal.MarkerProvider;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class TestMarkerView extends ViewPart {
>+
>+    private TestConcurrentTable table;
>+    private TestComparator comparator = new TestComparator();
>+    private MarkerProvider contentProvider;
>+    private Random rand = new Random();
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IViewPart#init(org.eclipse.ui.IViewSite)
>+     */
>+    public void init(IViewSite site) throws PartInitException {
>+        super.init(site);
>+        
>+        contentProvider = new MarkerProvider();
>+    }
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#dispose()
>+     */
>+    public void dispose() {
>+        super.dispose();
>+        
>+        contentProvider.dispose();
>+    }
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#createPartControl(org.eclipse.swt.widgets.Composite)
>+     */
>+    public void createPartControl(Composite temp) {
>+        Composite parent = new Composite(temp, SWT.NONE);
>+        GridLayout layout = new GridLayout();
>+        layout.numColumns = 2;
>+        
>+        parent.setLayout(layout);
>+        
>+        // Create the table
>+        {
>+	        table = new TestConcurrentTable(parent, comparator);
>+	        //table.setLimit(400);
>+	        GridData data = new GridData(GridData.FILL_BOTH);
>+	        table.getControl().setLayoutData(data);
>+	        table.setContentProvider(contentProvider);
>+        }
>+        
>+        // Create the buttons
>+        Composite buttonBar = new Composite(parent, SWT.NONE);
>+        buttonBar.setLayoutData(new GridData(GridData.FILL_BOTH));
>+        GridLayout buttonBarLayout = new GridLayout();
>+        buttonBarLayout.numColumns = 1;
>+        buttonBar.setLayout(buttonBarLayout);
>+        {
>+
>+            Button refreshButton = new Button(buttonBar, SWT.PUSH);
>+            refreshButton.setLayoutData(new GridData(GridData.FILL_BOTH));
>+            refreshButton.setText("Refresh");
>+	        refreshButton.addSelectionListener(new SelectionAdapter() {
>+		        /* (non-Javadoc)
>+	             * @see org.eclipse.swt.events.SelectionListener#widgetSelected(org.eclipse.swt.events.SelectionEvent)
>+	             */
>+	            public void widgetSelected(SelectionEvent e) {
>+	                table.refresh();
>+	            } 
>+	        });
>+	        
>+        }
>+    }
>+        
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#setFocus()
>+     */
>+    public void setFocus() {
>+        // TODO Auto-generated method stub
>+
>+    }
>+}
>Content-Type: text/plain
>
>Index: plugin.xml
>===================================================================
>RCS file: /home/eclipse/org.eclipse.ui.tests/plugin.xml,v
>retrieving revision 1.103
>diff -u -r1.103 plugin.xml
>--- plugin.xml	29 Sep 2004 15:59:56 -0000	1.103
>+++ plugin.xml	5 Oct 2004 01:30:11 -0000
>@@ -315,7 +315,16 @@
>             class="org.eclipse.ui.tests.decorators.DecoratorTableTreeView"
>             category="org.eclipse.ui.tests.decoratorCategory"
>             name="Table Tree Test"
>-            id="org.eclipse.ui.tests.decorator.TableTreeTest"/>      
>+            id="org.eclipse.ui.tests.decorator.TableTreeTest"/>
>+      <view
>+            class="org.eclipse.jface.tests.viewers.interactive.ConcurrentTableTestView"
>+            name="Concurrent Table Test View"
>+            id="org.eclipse.ui.tests.concurrentTableTest"/>      
>+      <view
>+            class="org.eclipse.jface.tests.viewers.interactive.TestMarkerView"
>+            name="Test Marker View"
>+            id="org.eclipse.ui.tests.testMarkerView"/>      
>+
>             
>    </extension>
>    <extension
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/AllTests.java
>===================================================================
>RCS file: /home/eclipse/org.eclipse.ui.tests/Eclipse JFace Tests/org/eclipse/jface/tests/viewers/AllTests.java,v
>retrieving revision 1.15
>diff -u -r1.15 AllTests.java
>--- Eclipse JFace Tests/org/eclipse/jface/tests/viewers/AllTests.java	28 Sep 2004 13:44:38 -0000	1.15
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/AllTests.java	5 Oct 2004 01:30:11 -0000
>@@ -23,6 +23,7 @@
> 
>     public static Test suite() {
>         TestSuite suite = new TestSuite();
>+        suite.addTest(new TestSuite(LazySortedCollectionTest.class));
>         suite.addTest(new TestSuite(TreeViewerTest.class));
>         suite.addTest(new TestSuite(TableViewerTest.class));
>         suite.addTest(new TestSuite(TableTreeViewerTest.class));
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/LazySortedCollectionTest.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/LazySortedCollectionTest.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/LazySortedCollectionTest.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/LazySortedCollectionTest.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,562 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import java.util.Arrays;
>+import java.util.Iterator;
>+import java.util.TreeSet;
>+
>+import junit.framework.Assert;
>+import junit.framework.Test;
>+import junit.framework.TestCase;
>+import junit.framework.TestSuite;
>+
>+import org.eclipse.jface.viewers.deferred.LazySortedCollection;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class LazySortedCollectionTest extends TestCase {
>+    
>+    public static void main(String[] args) {
>+        junit.textui.TestRunner.run(LazySortedCollectionTest.class);
>+    }
>+    
>+    public static Test suite() {
>+        return new TestSuite(LazySortedCollectionTest.class);
>+    }
>+    
>+    private TestComparator comparator;
>+    private TestComparator comparisonComparator;
>+    
>+    // All operations will be done on both collections -- after each operation, the result
>+    // will be compared
>+    private LazySortedCollection collection;
>+    private TreeSet comparisonCollection;
>+
>+    /**
>+     * Please don't add or remove from this set -- we rely on the exact insertion order
>+     * to get full coverage from the removal tests.
>+     */
>+    private String[] se = new String[] {
>+            "v00 aaaaaa",
>+            "v01 apple",
>+            "v02 booger",
>+            "v03 car",
>+            "v04 dog",
>+            "v05 elephant",
>+            "v06 fox",
>+            "v07 goose",
>+            "v08 hippie",
>+            "v09 iguana",
>+            "v10 junk",
>+            "v11 karma",
>+            "v12 lemon",
>+            "v13 mongoose",
>+            "v14 noodle",
>+            "v15 opal",
>+            "v16 pumpkin",
>+            "v17 quirks",
>+            "v18 resteraunt",
>+            "v19 soap",
>+            "v20 timmy",
>+            "v21 ugly",
>+            "v22 virus",
>+            "v23 wigwam",
>+            "v24 xerxes",
>+            "v25 yellow",
>+            "v26 zero"
>+    };
>+    
>+    /**
>+     * Please don't mess with the insertion order here or add or remove from this set -- 
>+     * we rely on the exact order in order to get full coverage for the removal tests.
>+     */
>+    private String[] elements = new String[] {
>+            se[19],
>+            se[7],
>+            se[6],
>+            se[1],
>+            se[20],
>+            se[8],
>+            se[0],
>+            se[23],
>+            se[17],
>+            se[18],
>+            se[24],
>+            se[25],
>+            se[10],
>+            se[5],
>+            se[15],
>+            se[16],
>+            se[21],
>+            se[26],
>+            se[22],
>+            se[3],
>+            se[9],
>+            se[4],
>+            se[11],
>+            se[12],
>+            se[13],
>+            se[14],
>+            se[2]  
>+        };
>+
>+    
>+    public static void printArray(Object[] array) {
>+        for (int i = 0; i < array.length; i++) {
>+            Object object = array[i];
>+            
>+            System.out.println("[" + i + "] = " + array[i]);
>+        }
>+    }
>+    
>+    /* (non-Javadoc)
>+     * @see junit.framework.TestCase#setUp()
>+     */
>+    protected void setUp() throws Exception {
>+        System.out.println("--- " + getName());
>+        
>+        comparator = new TestComparator();
>+        collection = new LazySortedCollection(comparator);
>+        // Ensure a predictable tree structure
>+        collection.enableRandomization = false;
>+     
>+        comparisonComparator = new TestComparator();
>+        comparisonCollection = new TreeSet(comparisonComparator);
>+        
>+        addAll(elements);
>+        
>+        super.setUp();
>+    }
>+    
>+    /* (non-Javadoc)
>+     * @see junit.framework.TestCase#tearDown()
>+     */
>+    protected void tearDown() throws Exception {
>+        System.out.println("Comparisons required by lazy collection: " + comparator.comparisons);
>+        System.out.println("Comparisons required by reference implementation: " + comparisonComparator.comparisons);
>+        System.out.println("");
>+        
>+        super.tearDown();
>+    }
>+    
>+    /**
>+     * Computes the entries that are expected to lie in the given range. The result
>+     * is sorted.
>+     * 
>+     * @param start
>+     * @param length
>+     * @return
>+     * @since 3.1
>+     */
>+    private Object[] computeExpectedElementsInRange(int start, int length) {
>+        int counter = 0;
>+        
>+        Iterator iter = comparisonCollection.iterator();
>+        while(iter.hasNext() && counter < start) {
>+            iter.next();
>+            counter++;
>+        }
>+        
>+        Object[] result = new Object[length];
>+        for (int i = 0; i < result.length; i++) {
>+            result[i] = iter.next(); 
>+        }
>+                
>+        return result;
>+    }
>+
>+    private void addAll(Object[] elements) {
>+        collection.addAll(elements);
>+        comparisonCollection.addAll(Arrays.asList(elements));
>+    }
>+    
>+    private void add(Object toAdd) {
>+        collection.add(toAdd);
>+        comparisonCollection.add(toAdd);
>+    }
>+    
>+    private void remove(Object toRemove) {
>+        collection.remove(toRemove);
>+        comparisonCollection.remove(toRemove);
>+    }
>+    
>+    private void removeRange(int start, int length) {
>+        collection.removeRange(start, length);
>+        
>+        Object[] expected = computeExpectedElementsInRange(start, length);
>+
>+        // Alternative remove implementation that removes one-at-a-time
>+        for (int i = 0; i < expected.length; i++) {
>+            Object object = expected[i];
>+            
>+            comparisonCollection.remove(expected[i]);
>+        }
>+    }
>+    
>+    private void clear() {
>+        collection.clear();
>+        comparisonCollection.clear();
>+    }
>+    
>+    /**
>+     * Force the collection to sort all elements immediately.
>+     * 
>+     * @since 3.1
>+     */
>+    private void forceFullSort() {
>+        queryRange(0, elements.length, true);
>+    }
>+    
>+    private void assertContentsValid() {
>+        queryRange(0, comparisonCollection.size(), false);
>+        Assert.assertEquals(comparisonCollection.size(), collection.size());
>+        Assert.assertEquals(comparisonCollection.isEmpty(), collection.isEmpty());
>+    }
>+    
>+    private void assertIsPermutation(Object[] array1, Object[] array2) {
>+        Object[] sorted1 = new Object[array1.length];
>+        System.arraycopy(array1, 0, sorted1, 0, array1.length);
>+        Arrays.sort(sorted1, new TestComparator());
>+        
>+        Object[] sorted2 = new Object[array2.length];
>+        System.arraycopy(array2, 0, sorted2, 0, array2.length);
>+        Arrays.sort(sorted2, new TestComparator());
>+        
>+        assertArrayEquals(sorted1, sorted2);
>+    }
>+
>+    /**
>+     * Queries the collection for the given range, and throws an assertation failure if the 
>+     * result was unexpected. Assumes that the "elements" array was initially added and that nothing
>+     * has been added or removed since.
>+     * 
>+     * @param start
>+     * @param length
>+     * @param sorted
>+     * @since 3.1
>+     */
>+    private Object[] queryRange(int start, int length, boolean sorted) {
>+        Object[] result = new Object[length];
>+        
>+        int returnValue = collection.getRange(result, start, sorted);
>+        
>+        Assert.assertEquals(returnValue, length);
>+        
>+        Object[] expectedResult = computeExpectedElementsInRange(start, length);
>+        
>+        if (sorted) {
>+            // If the result is supposed to be sorted, it will match the expected
>+            // result exactly
>+            assertArrayEquals(expectedResult, result);
>+        } else {
>+            // Otherwise, the result merely needs to be a permutation of the
>+            // expected result.
>+            assertIsPermutation(result, expectedResult);
>+        }
>+        
>+        collection.testInvariants();
>+        
>+        return result;
>+    }
>+    
>+    private void assertArrayEquals(Object[] array1, Object[] array2) {
>+        for (int i = 0; i < array1.length; i++) {
>+
>+            Assert.assertEquals(array1[i], array2[i]);
>+        }        
>+    }
>+    
>+    public void testComparisonCount() {
>+        Assert.assertTrue("additions should not require any comparisons", comparator.comparisons == 0);
>+        
>+        queryRange(0, elements.length, false);
>+
>+        Assert.assertTrue("requesting the complete set of unsorted elements should not require any comparisons", comparator.comparisons == 0);
>+    }
>+    
>+    /**
>+     * Ensure that no comparisons are required for range queries once the collection is fully sorted
>+     * 
>+     * @since 3.1
>+     */
>+    public void testSortAll() {
>+        // Test that sorting the entire array works
>+        queryRange(0, elements.length, true);
>+        
>+        int comparisons = comparator.comparisons;
>+        
>+        // Ensure that subsequent operations require no comparisons
>+        queryRange(elements.length - 10, 10, true);
>+        queryRange(0, 10, false);
>+        
>+        Assert.assertEquals("Once the lazy collection is fully sorted, it should not require further comparisons", 
>+                comparisons, comparator.comparisons);
>+    }
>+    
>+    /**
>+     * Tests LazySortedCollection.removeNode(int) when removing a leaf node
>+     */
>+    public void testRemoveLeafNode() {
>+        forceFullSort();
>+        remove(se[9]);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Tests LazySortedCollection.removeNode(int) when removing a node with no left child
>+     */
>+    public void testRemoveNodeWithNoLeftChild() {
>+        forceFullSort();
>+        remove(se[23]);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Tests LazySortedCollection.removeNode(int) when removing a node with no right child
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveNodeWithNoRightChild() {
>+        forceFullSort();
>+        remove(se[13]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Tests LazySortedCollection.remove when removing the root node
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveRootNode() {
>+        forceFullSort();
>+        remove(se[19]);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Tests LazySortedCollection.remove when the removal
>+     * will require swapping with a non-leaf node. (The descendent with the closest value
>+     * in the largest subtree has at least 1 child).
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveWhereSwappedNodeIsntLeaf() {
>+        forceFullSort();
>+        remove(se[14]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Tests LazySortedCollection.remove when the removal
>+     * will require swapping with a non-leaf node, and both the removed node and the swapped
>+     * node contain unsorted children.
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveWithUnsortedSwap() {
>+        // Ensure that we've sorted nodes 13 and 14 
>+        queryRange(14, 1, true);
>+        queryRange(13, 1, true);
>+        
>+        // Add some unsorted nodes that will become children of the node with value "v13 mongoose"
>+        addAll(new String[] {"v13 n", "v13 l"});
>+        // Ensure that the new nodes are pushed down to node 14 by querying its parent (currently at position 8)
>+        queryRange(8, 1, true);
>+        
>+        // Add some unsorted nodes that will become children of the node with value "v14 noodle" 
>+        addAll(new String[] {"v14 m", "v14 o"});
>+        // Push down the unsorted nodes by querying for the parent of "v14 noodle" 
>+        // (the parent is currently at position 7) 
>+        queryRange(7, 1, true);
>+        
>+        // Now remove node with value "v14 noodle" -- this should swap it with the node "v13 mongoose", requiring
>+        // both sets of unsorted children to be dealt with
>+        
>+        remove(se[14]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove an element from an initially unsorted collection
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveFromUnsorted() {
>+        remove(se[10]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove the root from an initially-unsorted collection
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveRootFromUnsorted() {
>+        remove(se[19]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Ensure that removing an element that isn't in the collection is a no-op
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveUnknown() {
>+        remove("some unknown element");
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Tests that the swaps during removal don't mess up the internal hashmap.
>+     * Perform a removal that will require a swap, add a new item, then
>+     * remove the item that was previously swapped. If the hashmap was not updated,
>+     * then the removed item may still be pointing to its old index and the 
>+     * new item will be removed instead. 
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemovePreviouslySwappedNode() {
>+        queryRange(0, elements.length, true);
>+        remove(se[14]);
>+        // Add a new item -- should reuse the same index used by the previous item
>+        add("something new");
>+        assertContentsValid();
>+        remove(se[13]);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove all nodes using removeRange
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveFullRange() {
>+        removeRange(0, se.length);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove a range that includes the start
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveFromStart() {
>+        removeRange(0, se.length / 2);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove a range that includes the last node
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveFromEnd() {
>+        int start = se.length / 2;
>+        removeRange(start, se.length - start);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Remove a range that includes the root, but leaves nodes in both subtrees intact.
>+     * 
>+     * @since 3.1
>+     */
>+    public void testRemoveIncludingRoot() {
>+        removeRange(14, 6);
>+        assertContentsValid();
>+    }
>+    
>+    /**
>+     * Test boundary conditions: 
>+     * 
>+     * Tests moving an entire right subtree, and a left subtree including the tree itself
>+     */
>+    public void testRemoveRightSubtree() {
>+        int start = 20;
>+        removeRange(9, 5);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Test boundary conditions: Tests moving an entire left subtree
>+     */
>+    public void testRemoveLeftSubtree() {
>+        removeRange(3, 4);
>+        assertContentsValid();
>+    }
>+
>+    /**
>+     * Test boundary conditions: Tests moving an entire left subtree including the tree itself
>+     */
>+    public void testRemoveRightIncludingRoot() {
>+        removeRange(3, 5);
>+        assertContentsValid();
>+    }
>+    
>+    public void testClear() {
>+        clear();
>+        assertContentsValid();
>+    }
>+    
>+    public void testClearSorted() {
>+        forceFullSort();
>+        clear();
>+        assertContentsValid();
>+    }
>+    
>+    //    
>+//    
>+//    public static void testAdditions() {
>+//        TestComparator comparator = new TestComparator();
>+//        LazySortedCollection collection = new LazySortedCollection(comparator);
>+//
>+//        addSomeElements(collection);
>+//        
>+//        System.out.println("comparisons after add = " + comparator.comparisons);
>+//        comparator.comparisons = 0;
>+//        
>+//        // Getfirst10Elements
>+//        Object[] first10Elements = new Object[10];
>+//        collection.getFirst(first10Elements, false);
>+//        System.out.println("first 10 elements:");
>+//        printArray(first10Elements);
>+//        System.out.println("comparisons after getFirst = " + comparator.comparisons);
>+//        comparator.comparisons = 0;
>+//        
>+//        collection.print();
>+//        
>+//        // remove the 10th element
>+//        collection.remove(first10Elements[9]);
>+//        
>+//        collection.print();
>+//
>+////        
>+////        collection.getFirst(first10Elements, true);
>+////        System.out.println("first 10 elements (sorted):");
>+////        printArray(first10Elements);
>+////        System.out.println("comparisons after getFirst = " + comparator.comparisons);
>+////        comparator.comparisons = 0;
>+////        
>+////        
>+////        
>+////        // get elements 8-13
>+////        Object[] eightThrough14 = new Object[7];
>+////        collection.getRange(eightThrough14, 8, false);
>+////        System.out.println("elements 8-14:");
>+////        printArray(eightThrough14);
>+////        System.out.println("comparisons after 8-14 query = " + comparator.comparisons);
>+////        comparator.comparisons = 0;
>+//        
>+//        collection.print();
>+//    }
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/ListContentProvider.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/ListContentProvider.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/ListContentProvider.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/ListContentProvider.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,80 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import java.util.ArrayList;
>+import java.util.Collection;
>+
>+import org.eclipse.jface.viewers.deferred.AbstractConcurrentContentProvider;
>+import org.eclipse.jface.viewers.deferred.IConcurrentContentProviderListener;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class ListContentProvider extends AbstractConcurrentContentProvider {
>+    
>+    private ArrayList data = new ArrayList();
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.jface.viewers.deferred.IConcurrentContentProvider#getElements(org.eclipse.core.runtime.IProgressMonitor)
>+     */
>+    public Object[] getElements() {
>+        return data.toArray();
>+    }
>+
>+    public void set(Object[] newContents) {
>+        clear();
>+        addAll(newContents);
>+    }
>+    
>+    public void clear() {
>+        Object[] removed = data.toArray();
>+        data.clear();
>+        fireRemove(removed);
>+    }
>+    
>+    public void addAll(Object[] toAdd) {
>+        for (int i = 0; i < toAdd.length; i++) {
>+            Object object = toAdd[i];
>+            
>+            data.add(object);
>+        }
>+        
>+        fireAdd(toAdd);
>+    }
>+    
>+    public void addAll(Collection toAdd) {
>+        addAll(toAdd.toArray());
>+    }
>+    
>+    public void changeAll(Object[] changed) {
>+        fireUpdate(changed);
>+    }
>+    
>+    public void removeAll(Object[] toRemove) {
>+        for (int i = 0; i < toRemove.length; i++) {
>+            Object object = toRemove[i];
>+            
>+            data.add(object);
>+        }        
>+        
>+        fireRemove(toRemove);
>+    }
>+
>+    /* (non-Javadoc)
>+     * @see org.eclipse.jface.viewers.deferred.IConcurrentContentProvider#requestUpdate(org.eclipse.jface.viewers.deferred.IConcurrentContentProviderListener)
>+     */
>+    public void requestUpdate(IConcurrentContentProviderListener listener) {
>+        listener.setContents(getElements());
>+        
>+    }
>+    
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestComparator.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestComparator.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestComparator.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestComparator.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,30 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import java.util.Comparator;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class TestComparator implements Comparator {
>+
>+    public volatile int comparisons = 0;
>+    
>+    /* (non-Javadoc)
>+     * @see java.util.Comparator#compare(java.lang.Object, java.lang.Object)
>+     */
>+    public int compare(Object arg0, Object arg1) {
>+        comparisons++;
>+
>+        return (arg0.toString()).compareTo(arg1.toString());
>+    }
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestConcurrentTable.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestConcurrentTable.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestConcurrentTable.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/TestConcurrentTable.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,142 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import java.util.Comparator;
>+
>+import org.eclipse.jface.viewers.deferred.ConcurrentTableManager;
>+import org.eclipse.jface.viewers.deferred.IConcurrentContentProvider;
>+import org.eclipse.jface.viewers.deferred.IConcurrentTable;
>+import org.eclipse.swt.SWT;
>+import org.eclipse.swt.events.DisposeEvent;
>+import org.eclipse.swt.events.DisposeListener;
>+import org.eclipse.swt.widgets.Composite;
>+import org.eclipse.swt.widgets.Event;
>+import org.eclipse.swt.widgets.Listener;
>+import org.eclipse.swt.widgets.Table;
>+import org.eclipse.swt.widgets.TableColumn;
>+import org.eclipse.swt.widgets.TableItem;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class TestConcurrentTable {
>+
>+    private Table tbl; 
>+    private ConcurrentTableManager manager;
>+    private IConcurrentContentProvider provider;
>+    private Comparator sortOrder;
>+    private int limit = -1;
>+    private DisposeListener dl = new DisposeListener() {
>+
>+        public void widgetDisposed(DisposeEvent e) {
>+            disposed();
>+        }
>+
>+    };
>+    
>+    private IConcurrentTable concurrentTable = new IConcurrentTable() {
>+
>+        public void flushCache(Object element) {
>+            
>+        }
>+
>+        public void update(int itemIndex, Object element) {
>+            TableItem item = tbl.getItem(itemIndex);
>+
>+            item.setText(0, element.toString());            
>+        }
>+
>+        public void setTotalItems(int total) {
>+            tbl.setItemCount(total);
>+            tbl.redraw();
>+            scrolled();            
>+        }
>+        
>+    };
>+    
>+    private Listener scrollListener = new Listener() {
>+
>+        public void handleEvent(Event event) {
>+            scrolled();
>+        }
>+        
>+    };
>+    
>+    public TestConcurrentTable(Composite parent, Comparator sortOrder) {
>+        tbl = new Table(parent, SWT.MULTI | SWT.H_SCROLL | SWT.V_SCROLL | SWT.BORDER | SWT.VIRTUAL);
>+        tbl.setHeaderVisible(true);
>+        TableColumn column = new TableColumn(tbl, SWT.CENTER);
>+        column.setText("test");
>+        column.setWidth(400);
>+        tbl.getVerticalBar().addListener(SWT.Selection, scrollListener);
>+        tbl.getVerticalBar().addListener(SWT.Show, scrollListener);
>+        tbl.getVerticalBar().addListener(SWT.Hide, scrollListener);
>+        tbl.addListener(SWT.Resize, scrollListener);
>+        this.sortOrder = sortOrder;
>+    }
>+    
>+    public void refresh() {
>+        manager.refresh();
>+    }
>+    
>+    public void setLimit(int newLimit) {
>+        if (manager != null) {
>+            manager.setLimit(newLimit);
>+        }
>+        this.limit = newLimit;
>+    }
>+    
>+    public int getLimit() {
>+        return limit;
>+    }
>+    
>+    /**
>+     * 
>+     * @since 3.1
>+     */
>+    protected void scrolled() {
>+        if (manager != null) {
>+            manager.setRangeOfInterest(tbl.getTopIndex(), 
>+                    (tbl.getBounds().height / tbl.getItemHeight()) + 1);
>+        }
>+    }
>+
>+    public Table getControl() {
>+        return tbl;
>+    }
>+    
>+    public void setContentProvider(IConcurrentContentProvider contentProvider) {
>+        tbl.removeAll();
>+        disposeManager();
>+        
>+        manager = new ConcurrentTableManager(concurrentTable, contentProvider, sortOrder, tbl.getDisplay());
>+        manager.setLimit(limit);
>+        manager.refresh();
>+        scrolled();
>+    }
>+    
>+    protected void disposed() {
>+        disposeManager();
>+    }
>+    
>+    private void disposeManager() {
>+        if (manager != null) {
>+            manager.dispose();
>+            manager = null;
>+        }
>+    }
>+        
>+    public Table getTable() {
>+        return tbl;
>+    }
>+
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/VirtualTableTest.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/VirtualTableTest.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/VirtualTableTest.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/VirtualTableTest.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,30 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers;
>+
>+import org.eclipse.swt.widgets.Display;
>+import org.eclipse.swt.widgets.Shell;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class VirtualTableTest {
>+
>+    public static void main(String[] args) {
>+		Display display = new Display ();
>+		final Shell shell = new Shell (display);
>+				
>+		while (!shell.isDisposed()) {
>+			if (!display.readAndDispatch ()) display.sleep ();
>+		}
>+		display.dispose ();
>+    }
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/ConcurrentTableTestView.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/ConcurrentTableTestView.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/ConcurrentTableTestView.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/ConcurrentTableTestView.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,188 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers.interactive;
>+
>+import java.util.ArrayList;
>+import java.util.Random;
>+
>+import org.eclipse.core.runtime.IProgressMonitor;
>+import org.eclipse.core.runtime.IStatus;
>+import org.eclipse.core.runtime.Status;
>+import org.eclipse.jface.tests.viewers.ListContentProvider;
>+import org.eclipse.jface.tests.viewers.TestComparator;
>+import org.eclipse.jface.tests.viewers.TestConcurrentTable;
>+import org.eclipse.swt.SWT;
>+import org.eclipse.swt.events.SelectionAdapter;
>+import org.eclipse.swt.events.SelectionEvent;
>+import org.eclipse.swt.layout.GridData;
>+import org.eclipse.swt.layout.GridLayout;
>+import org.eclipse.swt.widgets.Button;
>+import org.eclipse.swt.widgets.Composite;
>+import org.eclipse.swt.widgets.Label;
>+import org.eclipse.ui.part.ViewPart;
>+import org.eclipse.ui.progress.WorkbenchJob;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class ConcurrentTableTestView extends ViewPart {
>+
>+    private TestConcurrentTable table;
>+    private TestComparator comparator = new TestComparator() {
>+        
>+        /* (non-Javadoc)
>+         * @see java.util.Comparator#compare(java.lang.Object, java.lang.Object)
>+         */
>+        public int compare(Object arg0, Object arg1) {
>+//            try {
>+//                // Insert a bogus delay to simulate doing work
>+//                Thread.sleep(1);
>+//            } catch (InterruptedException e) {
>+//            }
>+
>+//            int delay = 2; // Time to spin the CPU for (milliseconds)
>+//            
>+//            // Do some work to occupy time 
>+//            int counter = 0;
>+//            long timestamp = System.currentTimeMillis();
>+//            while (System.currentTimeMillis() < timestamp + delay) {
>+//                counter++;
>+//            }
>+            
>+            int result = super.compare(arg0, arg1);
>+            
>+            scheduleComparisonUpdate();
>+            
>+            return result;
>+        };
>+    };
>+    
>+    private WorkbenchJob updateCountRunnable = new WorkbenchJob("") {
>+        
>+        /* (non-Javadoc)
>+         * @see org.eclipse.ui.progress.UIJob#runInUIThread(org.eclipse.core.runtime.IProgressMonitor)
>+         */
>+        public IStatus runInUIThread(IProgressMonitor monitor) {
>+            updateCount.setText("Comparison count = " + comparator.comparisons);
>+            return Status.OK_STATUS;
>+        }
>+    };
>+    
>+    
>+    
>+    private Label updateCount;
>+    private ListContentProvider contentProvider = new ListContentProvider();
>+    private Random rand = new Random();
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#createPartControl(org.eclipse.swt.widgets.Composite)
>+     */
>+    public void createPartControl(Composite temp) {
>+        Composite parent = new Composite(temp, SWT.NONE);
>+        GridLayout layout = new GridLayout();
>+        layout.numColumns = 2;
>+        
>+        parent.setLayout(layout);
>+        
>+        // Create the table
>+        {
>+	        table = new TestConcurrentTable(parent, comparator);
>+	        table.setLimit(400);
>+	        GridData data = new GridData(GridData.FILL_BOTH);
>+	        table.getControl().setLayoutData(data);
>+	        table.setContentProvider(contentProvider);
>+        }
>+        
>+        // Create the buttons
>+        Composite buttonBar = new Composite(parent, SWT.NONE);
>+        buttonBar.setLayoutData(new GridData(GridData.FILL_BOTH));
>+        GridLayout buttonBarLayout = new GridLayout();
>+        buttonBarLayout.numColumns = 1;
>+        buttonBar.setLayout(buttonBarLayout);
>+        {
>+
>+            updateCount = new Label(buttonBar, SWT.NONE);
>+            updateCount.setLayoutData(new GridData(GridData.FILL_BOTH));
>+
>+            Button resetCountButton = new Button(buttonBar, SWT.PUSH);
>+            resetCountButton.setLayoutData(new GridData(GridData.FILL_BOTH));
>+            resetCountButton.setText("Reset comparison count");
>+	        resetCountButton.addSelectionListener(new SelectionAdapter() {
>+		        /* (non-Javadoc)
>+	             * @see org.eclipse.swt.events.SelectionListener#widgetSelected(org.eclipse.swt.events.SelectionEvent)
>+	             */
>+	            public void widgetSelected(SelectionEvent e) {
>+	                comparator.comparisons = 0;
>+	                scheduleComparisonUpdate();
>+	            } 
>+	        });
>+	        
>+	        Button testButton = new Button(buttonBar, SWT.PUSH);
>+	        testButton.setLayoutData(new GridData(GridData.FILL_BOTH));
>+	        testButton.setText("add 1000 elements");
>+	        testButton.addSelectionListener(new SelectionAdapter() {
>+		        /* (non-Javadoc)
>+	             * @see org.eclipse.swt.events.SelectionListener#widgetSelected(org.eclipse.swt.events.SelectionEvent)
>+	             */
>+	            public void widgetSelected(SelectionEvent e) {
>+	                addRandomElements(1000);
>+	            } 
>+	        });
>+	        
>+	        Button removeButton = new Button(buttonBar, SWT.PUSH);
>+	        removeButton.setLayoutData(new GridData(GridData.FILL_BOTH));
>+	        removeButton.setText("remove all");
>+	        removeButton.addSelectionListener(new SelectionAdapter() {
>+		        /* (non-Javadoc)
>+	             * @see org.eclipse.swt.events.SelectionListener#widgetSelected(org.eclipse.swt.events.SelectionEvent)
>+	             */
>+	            public void widgetSelected(SelectionEvent e) {
>+	                clear();
>+	            } 
>+	        });
>+
>+        }
>+    }
>+    
>+    
>+    /**
>+     * 
>+     * @since 3.1
>+     */
>+    protected void scheduleComparisonUpdate() {
>+        updateCountRunnable.schedule(100);
>+    }
>+
>+
>+
>+    public void addRandomElements(int amount) {
>+        
>+        ArrayList tempList = new ArrayList();
>+
>+        for (int counter = 0; counter < amount; counter++) {
>+            tempList.add("" + rand.nextLong() + " " + counter );
>+        }
>+        
>+        contentProvider.addAll(tempList);
>+    }
>+    
>+    public void clear() {
>+        contentProvider.clear();
>+    }
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#setFocus()
>+     */
>+    public void setFocus() {
>+        // TODO Auto-generated method stub
>+
>+    }
>+}
>Index: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/TestMarkerView.java
>===================================================================
>RCS file: Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/TestMarkerView.java
>diff -N Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/TestMarkerView.java
>--- /dev/null	1 Jan 1970 00:00:00 -0000
>+++ Eclipse JFace Tests/org/eclipse/jface/tests/viewers/interactive/TestMarkerView.java	1 Jan 1970 00:00:00 -0000
>@@ -0,0 +1,105 @@
>+/*******************************************************************************
>+ * Copyright (c) 2004 IBM Corporation and others.
>+ * All rights reserved. This program and the accompanying materials 
>+ * are made available under the terms of the Common Public License v1.0
>+ * which accompanies this distribution, and is available at
>+ * http://www.eclipse.org/legal/cpl-v10.html
>+ * 
>+ * Contributors:
>+ *     IBM Corporation - initial API and implementation
>+ *******************************************************************************/
>+package org.eclipse.jface.tests.viewers.interactive;
>+
>+import java.util.Random;
>+
>+import org.eclipse.jface.tests.viewers.TestComparator;
>+import org.eclipse.jface.tests.viewers.TestConcurrentTable;
>+import org.eclipse.swt.SWT;
>+import org.eclipse.swt.events.SelectionAdapter;
>+import org.eclipse.swt.events.SelectionEvent;
>+import org.eclipse.swt.layout.GridData;
>+import org.eclipse.swt.layout.GridLayout;
>+import org.eclipse.swt.widgets.Button;
>+import org.eclipse.swt.widgets.Composite;
>+import org.eclipse.ui.IViewSite;
>+import org.eclipse.ui.PartInitException;
>+import org.eclipse.ui.part.ViewPart;
>+import org.eclipse.ui.views.markers.internal.MarkerProvider;
>+
>+/**
>+ * @since 3.1
>+ */
>+public class TestMarkerView extends ViewPart {
>+
>+    private TestConcurrentTable table;
>+    private TestComparator comparator = new TestComparator();
>+    private MarkerProvider contentProvider;
>+    private Random rand = new Random();
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IViewPart#init(org.eclipse.ui.IViewSite)
>+     */
>+    public void init(IViewSite site) throws PartInitException {
>+        super.init(site);
>+        
>+        contentProvider = new MarkerProvider();
>+    }
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#dispose()
>+     */
>+    public void dispose() {
>+        super.dispose();
>+        
>+        contentProvider.dispose();
>+    }
>+    
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#createPartControl(org.eclipse.swt.widgets.Composite)
>+     */
>+    public void createPartControl(Composite temp) {
>+        Composite parent = new Composite(temp, SWT.NONE);
>+        GridLayout layout = new GridLayout();
>+        layout.numColumns = 2;
>+        
>+        parent.setLayout(layout);
>+        
>+        // Create the table
>+        {
>+	        table = new TestConcurrentTable(parent, comparator);
>+	        //table.setLimit(400);
>+	        GridData data = new GridData(GridData.FILL_BOTH);
>+	        table.getControl().setLayoutData(data);
>+	        table.setContentProvider(contentProvider);
>+        }
>+        
>+        // Create the buttons
>+        Composite buttonBar = new Composite(parent, SWT.NONE);
>+        buttonBar.setLayoutData(new GridData(GridData.FILL_BOTH));
>+        GridLayout buttonBarLayout = new GridLayout();
>+        buttonBarLayout.numColumns = 1;
>+        buttonBar.setLayout(buttonBarLayout);
>+        {
>+
>+            Button refreshButton = new Button(buttonBar, SWT.PUSH);
>+            refreshButton.setLayoutData(new GridData(GridData.FILL_BOTH));
>+            refreshButton.setText("Refresh");
>+	        refreshButton.addSelectionListener(new SelectionAdapter() {
>+		        /* (non-Javadoc)
>+	             * @see org.eclipse.swt.events.SelectionListener#widgetSelected(org.eclipse.swt.events.SelectionEvent)
>+	             */
>+	            public void widgetSelected(SelectionEvent e) {
>+	                table.refresh();
>+	            } 
>+	        });
>+	        
>+        }
>+    }
>+        
>+    /* (non-Javadoc)
>+     * @see org.eclipse.ui.IWorkbenchPart#setFocus()
>+     */
>+    public void setFocus() {
>+        // TODO Auto-generated method stub
>+
>+    }
>+}

Actions: View | Diff

Attachments on bug 60117: 15188 | 15189 | 15190 | 15191 | 17580 | 17581 | 17582