A library of data structures for key-data pairs
Libdict provides several data structures to allow one to very efficiently store and retrieve key-data pairs. T provides solid implementations of a hashtable, a red-black tree, a splay tree, weight-balanced tree, a height-balanced AVL tree and more. Now anyone can learn to program properly, no excuses!
|Operating System||Architecture||Package Type||Package Size||Date Archived||View Contents?||Download|
|32-bit PA-RISC 1.1||Gzipped|
|52 K||26 Apr 2001||Yes||HTTP FTP|
|30 K||26 Apr 2001||Yes||HTTP FTP|