|
Class Summary |
| BinaryTreeNode<T> |
Binary tree node |
| BoundMap |
|
| BoundMap.TestBean |
|
| DoubleArray |
User: mbellew
Date: May 24, 2004
Time: 9:09:24 PM |
| FloatArray |
User: mbellew
Date: May 24, 2004
Time: 9:09:24 PM |
| FloatRange |
User: mbellew
Date: May 24, 2004
Time: 9:10:38 PM |
| InOrderBinaryTree<T> |
An in-order (left child < parent < right child) binary tree implementation
This is a Tree that only allows two children, uses a Comparator to ensure that the
left child is somehow "less than or equal to" the parent and the right child is "greater". |
| IntegerArray |
User: mbellew
Date: May 24, 2004
Time: 9:09:24 PM |
| Pair<Type1,Type2> |
|
| ParentAwareTreeNode<T> |
Tree node that's aware of its parent |
| SpatialQuadrantTreeNode<T extends List<XYDataPoint>> |
Tree node that's aware of spatial information and has up to four children,
one in each quadrant. |
| SpatialQuadrantTreeNode.DataPointXComparatorAsc |
|
| SpatialQuadrantTreeNode.DataPointYComparatorAsc |
|
| SpatialQuadrantTreeNode.DistanceToInterestingPointComparatorAsc |
|
| Tree<T> |
Represents a Tree of Objects of generic type T. |
| Tree2D |
User: mbellew
Date: Sep 16, 2004
Time: 2:03:20 PM
Dumb implementation of 2D tree, find good open source implementation, or get back to this
Not thead safe |
| TreeNode<T> |
Represents a node of the Tree class. |