This project offers various tree implementations starting with the red black tree implementation.
The base for the project are provided by the libtree project on github which is a C implementation for various tree data structures. The code can be compiled on IBM i with the ILE C compiler with almost no changes to the code.
The keyword inline is not supported by the ILE C compiler. We need to define inline to __inline (which is implementation specific and works with the ILE C compiler).
This project contains prototypes for the C functions. On top of that the project has wrapper modules for the red black tree C implementation to make it easier to use the C functions. The wrapper modules support integer and strings as keys. The values are added untyped (via pointer).
The string module supports strings as keys. The value of the entry can be anything as it is passed as a pointer. The module provides two procedures for key comparison.
As the name already points out, the ignore case variant of the comparison procedure evaluates "My Key" and "my key" as equal.
Take a look in the example section to see how to use the procedures.
The documentation for the wrapper modules can be found at iledocs.sf.net.
This library is licensed under the GNU Lesser General Public License.
The includes packages from the download section are needed to compile.
For source packages take a look at the download area.