-
Notifications
You must be signed in to change notification settings - Fork 0
Home
This wiki is the long-form companion to the code. Each page takes one topic, states what it is, points at the exact classes in my implementation, and draws the structure. Read it as a compact personal reference for the STL pieces and the design patterns I worked through in CS34001 at Kent State.
- Word List. A dynamic array that counts word occurrences, with the rule of three.
-
Templated Linked List. A generic
node<T>andCollection<T>. -
STL Vector, List & Move Semantics.
std::vector,std::list, and a movable object. - STL Map & Set. Associative containers keyed by a custom comparator.
-
STL Algorithms & Priority Queue.
<algorithm>,priority_queue, andmultimap. - Hashmap. A custom hash table with separate chaining.
- Singleton & Template Method
- Bridge & Abstract Factory
- Adapter & State
- Decorator & Chain of Responsibility
- Composite, Command & Memento
Each folder was renamed from its original course lab number to a name the code earns. The table keeps the provenance straight.
| Course lab | Folder | Verified topic |
|---|---|---|
| Lab 02 | 02-word-list |
Dynamic array with the rule of three |
| Lab 03 | 03-templated-linked-list |
Templated node<T> and Collection<T>
|
| Lab 04 | 04-stl-vector-list-move |
vector, list, and move semantics |
| Lab 05 | 05-stl-map-set |
map, set, multiset with a custom comparator |
| Lab 06 | 06-stl-algorithms-priority-queue |
<algorithm>, priority_queue, multimap
|
| Lab 07 | 07-hashmap |
Custom hash table with separate chaining |
| Lab 08 | 08-singleton-template-method |
Singleton, Template Method |
| Lab 09 | 09-bridge-abstract-factory |
Bridge, Abstract Factory |
| Lab 10 | 10-adapter-state |
Adapter, State |
| Lab 11 | 11-decorator-chain-of-responsibility |
Decorator, Chain of Responsibility |
| Lab 12 | 12-composite-command-memento |
Composite, Visitor, Command, Memento, Prototype |
Each folder name starts with the lab number from the course. The main program in each folder is named after the problem it solves. Where a folder holds more than one program, every page below names the entry point and how to build it. A handful of files began as instructor skeletons; the page says so when the design is not mine.
Data structures & STL
Design patterns