Bug 89250 [Viewers] - API Review - LazySortedCollection review comments
There are two unused private methods in LazySortedCollection. setNextUnsorted(...) getEdgeTo(...) Attached is a patch with other javadoc review comments also.
bundles/org.eclipse.jface/src/org/eclipse/jface/viewers/deferred/LazySortedCollection.java
int unsorted = nextUnsorted[node];
        
        if (isUnsorted(node)) {
            Assert.isTrue(left == -1, "unsorted nodes shouldn't have a left subtree"); 
            Assert.isTrue(right == -1, "unsorted nodes shouldn't have a right subtree"); 
        }
        
        if (left != -1) {
            testInvariants(left);
            Assert.isTrue(parentTree[left] == node, "left node has invalid parent pointer"); 
        }
        if (right != -1) {
            testInvariants(right);
            Assert.isTrue(parentTree[right] == node, "right node has invalid parent pointer");             
        }
        int previous = node;
        while (unsorted != -1) {
            int oldTreeSize = this.treeSize[unsorted];
            recomputeTreeSize(unsorted);
            
            Assert.isTrue(this.treeSize[unsorted] == oldTreeSize, 
                    "Invalid node size for unsorted node"); 
            Assert.isTrue(leftSubTree[unsorted] == -1, "unsorted nodes shouldn't have left subtrees"); 
            Assert.isTrue(rightSubTree[unsorted] == -1, "unsorted nodes shouldn't have right subtrees"); 
            Assert.isTrue(parentTree[unsorted] == previous, "unsorted node has invalid parent pointer"); 
            Assert.isTrue(contents[unsorted] != lazyRemovalFlag, "unsorted nodes should not be lazily removed"); 
            previous = unsorted;
            unsorted = nextUnsorted[unsorted];
        }