Go to the source code of this file.
Defines | |
#define | ctl_array_qsort_implement(type) |
Manufacture a quicker sort for a particular data type. | |
#define | ctl_array_bsort_implement(type) |
Manufacture a quicker sort for a particular data type. |
include this text multiple times with the various declarations redefined Uses ctl/declare.h and ctl/implement.h to manufacture the code and 'wash' the text into whatever types of code are required.
This version of the library looks like it wins: 1. Typos and errors appear on the line where they occur 2. Can be single-stepped (generally) with existing debuggers 3. Namespace is less cluttered 4. Slightly easier to type.
Definition in file algorithm.temp.h.