Here are various utility functions, brief demo
programs, and libraries that I have either written or accumulated.
| wolf1.cpp | reference implementation of the Wolf1 one-way hash algorithm. |
| 10.c | Nifty little program to generate 1's and 0's. |
| cq.h | Quickie continue/quit function. |
| fxstk.h | FiXed size STacK. This little guy is a stack implementation utilizing an optional sizor at instantiation, and includes some extra features not often seen in stacks. |
| ia-pub.h | Infinite array code. Utilizes a templated class which will store items using array notation up to available memory. |
| implist.h | IMProved LIST implementation, adds all sorts of goodies to the basic list data type, requires tlistp.h |
| isasquare.h | Binary function to determine if number passed is a perfect square. |
| psni-cat | Available only in binary format. Directions for use are included in the read-me file in the zip archive. Currently tested on Win98. |
| uqsort.cpp | Unomptimized version of quicksort. |
| queue.h | Basic queue type, implemented dynamically, allowing nearly constant-time enq and deq operations |
| round.cpp | Variable-precision rounding function, defaulting to currency precision. Currently only handles rounding at or beyond decimal point. (This version may only be used in a C++ program.) |
| round.h | Variable-precision rounding function, undefaulted. (This version MUST be used in a C program.) |
| strfuncs.h | My C string library. Iincludes several nifty functions, including cutting and maneuvering utilities. Note: this only works with C-style strings (ie. NULL ('/0') terminated). |
| tandywp.cpp | One of the early programs I wrote in C++. Before I knew about pow(), I learned how to do logrithms to expedite powers. |
| tbstree.h | An implementation of a Binary Search Tree |
| tlistp.h | A dynamically-implemented list data type, required for implist.h |
| unfact.c | Quickie program to determine if a number is a factorial or not. |