CMP 338 Libraries and Abstract Data Types

Here is the Javadoc for Java classes listed below.

• Search
  • Implementation: SequentialSearch<Item>.
  • Implementation: BinarySearch<Item>.
• List
  • Interface: List<Item>.
  • Percursor: AbstractList<Item>.
  • Implementation: LinkedList<Item>.
  • Interface: TwoWayList<Item>.
  • Implementation: ArrayList<Item>.
  • Implementation: TwoWayLinkedList<Item>.
  • Implementation: Sequence<Item>.
  • Implementation: MoveToFrontSequence<Item>.
• Bag
  • Interface: Bag<Item>.
  • Percursor: AbstractBag<Item>.
  • Implementation: LinkedBag<Item>.
  • Implementation: ArrayBag<Item>.
• Stack
  • Interface: Stack<Item>.
  • Percursor: AbstractStack<Item>.
  • Implementation: LinkedStack<Item>.
  • Implementation: ArrayStack<Item>.
• Queue
  • Interface: Queue<Item>.
  • Percursor: AbstractQueue<Item>.
  • Implementation: LinkedQueue<Item>.
  • Implementation: ArrayQueue<Item>.
• Deque
  • Interface: Deque<Item>.
  • Percursor: AbstractDeque<Item>.
  • Implementation: ArrayDeque<Item>.
  • Implementation: LinkedDeque<Item>.
• UnionFind
  • Interface: UnionFind<Vertex>.
  • Percursor: AbstractUnionFind<Vertex>.
  • Implementation: SlowUnionUnionFind<Vertex>.
  • Implementation: ListUnionFind<Vertex>.
  • Implementation: TreeUnionFind<Vertex>.
  • Implementation: WeightedListUnionFind<Vertex>.
  • Implementation: WeightedTreeUnionFind<Vertex>.
  • Implementation: WeightedTreePathCompressionUnionFind<Vertex>.
• Symbol Table (Map)
  • Interface: SymbolTable<Key, Value>.
  • Percursor: AbstractSymbolTable<Key, Value>.
  • Implementation: LazySequenceSymbolTable<Key, Value>.
  • Implementation: SequenceSymbolTable<Key, Value>.
• Integer Table (Symbol Table with small Integer keys)
  • Implementation: IntegerTable<Value>.
  • Implementation: LinkedListIntegerTable<Value>.
  • Implementation: SequenceIntegerTable<Value>.
• Hash Map (Hash Table)
  • Implementation: ExternalHashTable<Key, Value>.
  • Implementation: InternalHashTable<Key, Value>.
  • Implementation: SequenceHashTable<Key, Value>.
  • Implementation: SequenceExternalHashTable<Key, Value>.
  • Implementation: SequenceInternalHashTable<Key, Value>.
• Set
  • Interface: Set<Item>.
  • Percursor: AbstractSet<Item>.
  • Implementation: SequenceSet<Item>.
  • Implementation: HashSet<Item>.
• Util
  • Utility: Link<Item>.
  • Utility: Pair<Key, Value>.
  • Percursor: Ordered<Item>.
  • Implementation: NaturalOrder<Item>.
  • Implementation: ReverseOrder<Item>.
  • Interface: HasKey<Key>.
  • Interface: KeyFor<Item, Key>.
• Sort
  • Interface: Sort<Item>.
  • Percursor: AbstractSort<Item>.
• Comparison Sort
  • Implementation: SelectionSort<Item>.
  • Implementation: InsertionSort<Item>.
  • Implementation: MergeSort<Item>.
  • Implementation: QuickSort<Item>.
  • Implementation: ThreeWayQuickSort<Item>.
  • Implementation: HeapSort<Item>.
• Boolean Sort
  • Implementation:BooleanSort.
• Integer Sort
  • Implementation:CountingSort<Item>.
• String Sort
  • Percursor: AbstractStringSort.
  • Implementation:LSDRadixSort.
  • Implementation:MSDRadixSort.
  • Implementation:ThreeWayQuickSort.
  • Implementation:LSDRadixSortWithCutoff.
  • Implementation:MSDRadixSortWithCutoff.
  • Implementation:ThreeWayQuickSortWithCutoff.
• Priority Queue
  • Interface: PriorityQueue<Item>.
  • Implementation: SelectionPriorityQueue<Item>.
  • Implementation: InsertionPriorityQueue<Item>.
  • Percursor: AbstractPriorityQueue<Item>.
  • Implementation: TreeHeapPriorityQueue<Item>.
  • Implementation: ArrayHeapPriorityQueue<Item>.
• Search Tree (Ordered Symbol Table)
  • Interface: OrderedSymbolTable<Key, Value>.
  • Percursor: AbstractOrderedSymbolTable<Key, Value>.
  • Implementation: MinimalLazyBinarySearchTree<Key, Value>.
  • Implementation: LazyBinarySearchTree<Key, Value>.
  • Implementation: BinarySearchTree<Key, Value>.
  • Implementation: LazyRedBlackSearchTree<Key, Value>.
  • Implementation: RedBlackSearchTree<Key, Value>.
• Trie (String Symbol Table)
  • Interface: StringSymbolTable<Value>.
  • Percursor: AbstractStringSymbolTable<Value>.
  • Implementation: MinimalTrie<Value>.
  • Implementation: Trie<Value>.
  • Implementation: MinimalTernarySearchTrie<Value>.
  • Implementation: TernarySearchTrie<Value>.

These classes are also available as a jar file:cmp338.jar (last modified: 12/13/12). To import them into Eclipse:

1. Download the jar file onto your computer.
2. Create a new java project, API (say), under Eclipse.
3. From the File menu, select Import....
4. In the Import popup, select General ~> Archive File, then push Next.
5. Use the Browse... button, to put the path to the just downloaded jar file in the From archive file: field.
6. Ignore any conflicting Manifest files.
7. Open the API project folder.
8. Drag the edu folder into the src folder.