[fpc-pascal] "Generics" Red Black Tree for fpc
Helmut Hartl
helmut.hartl at firmos.at
Fri Apr 3 13:08:42 CEST 2009
Hi all,
due to interest i post here our generic version of a red black tree implementation.
A R/B tree is a quite fast directory datastructure which allows o(log n) access times.
Warning: The code compiles only under 2.2.4RC1+, below that the compilation fails(crash).
Further info on http://fpcfun.firmos.at/bin/view/Freepascal/FirmOSOpenSource
A short description with usage guidelines and a testprogram demonstrating adding and searching
10 Million key / value pairs is provided there too.
The code was tested under FreeBSD (dev platform), linux and windows and has no dependancys.
have fun,
helmut
More information about the fpc-pascal
mailing list