Miscellaneous Support Code
This page provides links to the support code used in various programs.
-
Miscellaneous utilities.
This implements a variety of miscellaneous utilities, mostly for
IO processing.
Header and
Source files.
-
Basic linked list.
This implements implements a linked list data structure.
Header and
Source files.
-
List set.
This data structure implements a collection of linked lists of integers,
where each integer appears on at most one list.
Header and
Source files.
-
Modulo Min-or-Max heap.
This data structure implements a heap data structure, where the key
values are interpreted relative to a circular key space.
It's useful for representing time values that wrap around after
a long time has elapsed.
It can be configured to efficeintly support either the
deletemin or deletmax operations, but not both.
Header and
Source files.
-
2-Left Hash Table.
This data structure implements a hash table data structure,
using the 2-left design to minimize variability in access times.
It is designed to maintain a set of (key, value) pairs.
When used to implement a lookup table, the value part is typically
an index into a separate table of data (like a routing table).
Header and
Source files.
-
Makefile.
Last updated 8/23/09.
