(C ) Extension to the list class defined by C STL.
Provides for a simplification of list element substitution for applications using referenced structures. Defines
emplates for wrapping referenced structures with interfaces required for management by the list extensions.
(C ) Template for maintaing graph structures based on relation objects.
Provides a means of constructing and using graphs based upon certain types of relations. The relation types
are used as template parameters to the graph template. Examples of graph and tree relation types are included.
The example types are used to implement a simple thesaurus tree
(C ) Templates for interfacing with odbc and for keeping a cursor.
Utilizing odbc this template provides an abstract description of a DB interface in which a C class corresponds to a
table. The DB interface, a data source, may be accessed by a cursor, which keeps track of objects in memory.
Examples utilize MySQL and QT, but other applications are possible.
(C ) Templates for a compiler and interpreter over some type of symbol. Currently, like ECMA script.
The source code here presents a framework for a language similar to ECMA Script with embedded formulas for DB
manipulation. Currently this code is being debugged. However, the architecture for compilation to data structures
such as parse trees is fairly complete. The interpretation is currently based on the tree structure.
Many implementations of the FFT make excessive calls to sin functions. This FFT allows an object to be created with
initialization of coefficient arrays for the recursive calculation of the frequency exponents. The FFT subroutines simply
access the buffers. The object structure of the code allows the FFT to be treated as a basic class to many
applications. For example, an FIR filter implementation would be a class descendent from the FFT class object.
Here is a sort routine that is quicker than quicker sort. The routine is quicker because there is never a greater than
Nlog(N) time execution. In fact, radix sorts have incredible time results, for instance, LSD radix sort on MSD or a
three-way radix quick sort. The routine here is unabashed about the use of space. It is a recursive MSD radix sort on
null terminated string keys. The sort partitions data by digit and recurses on each partition. Instead of counters,
a linked list is used for placing strings into partitions.
(C ) Template based application for generating HTML index pages.
This code represents a complete utility for generating pages of indexed classes and lists of items for sale.
This source code addresses basic needs for e-commerce sites. A binary download is avaible on the software
sales pages.
(C ) Templates for random numbers with simulation functions.
Random number generators for uniform random numbers and some distributions. Templates schemes allow for random
numbers to be defined in terms of parameters.
Software from this page may be used where ever you like.
Your comments and contributions are welcome.