Package org.locomotive.util.data

Interface Summary
ComparisonKey Defines the compare function to allow arbitrary objects to be compared.
 

Class Summary
DataTree this class is an abstract implementation of a data tree, and can be extended to for heaps or binary search trees.
DateKey this class provides a comparison key for dates with times.
Heap this class implements a heap ADT.
NameKey this class provides a comparison key for names.
NumberKey this class provides a comparison key for most primitive data types
Stack This class contains a basic implementation of a stack using arrays At this point, resizing the array will simply double the present size of the array.
StringKey this class provides a comparison key for strings
 

Exception Summary
ComparisonKeyException Provides a basic exception class to be used by comparison keys.