This is my implementation of a hash table. It stores data in a table based on the data's key. The user can supply their own hashing functions or use simple linear probing.
The files below are my implementation of A*. The files were used on a pathfinding comparison tool I worked on. I designed and implemented the framework and A* pathfinding.
Binary Space Partitioning Tree
This is my implementation of a BSP Tree. A BSP tree sorts a 3D scene's polygons by depth. This involves selecting optimal scene dividing planes and sorting each polygon on the front or back of each plane. If a polygon straddles the plane then it must be split into two polygons.
Below are files from a network engine I designed and implemented. The focus of the engine was to build a reliable network engine on top of UDP.[ Packets.h ]
Low Level Direct Sound Engine
Below is the source for a sound engine that I worked on. It is the low level side of a sound engine that creates "voices" and is in charge of writing these voices into the Direct Sound buffer.
*Due to variances in web browser display settings these files may be best viewed in a development environment such as Visual Studio*