cytoscape.util.intr.test
Class IntBTreePerformance

java.lang.Object
  cytoscape.util.intr.test.IntBTreePerformance

public class IntBTreePerformance
extends Object

Constructor Summary

IntBTreePerformance()

Method Summary

static void

main(String[] args) This test is analagous to cytoscape.intr.util.test.MinIntHeapPerformance, only it uses a B-tree instead of a heap.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

IntBTreePerformance

public IntBTreePerformance()

Method Detail

main

public static void main(String[] args)
                 throws Exception

This test is analagous to cytoscape.intr.util.test.MinIntHeapPerformance, only it uses a B-tree instead of a heap. So the purpose of this test is to compare the performance between a heap and a B-tree when using these objects solely for the purpose of pruning duplicate integers from a set of integers.

Throws:

Exception