libv Documentation


This manual documents the low-level libv C API.
libv implements common data structures such as linked lists, dynamic arrays, binary trees, AVL-trees, maps, hashes, stacks, queues and others.

"For all intent and purpose, any description of what the codes are doing should be construed as being a note of what we thought the codes did on our machine on a particular Tuesday of last year. If you're really lucky, they might do the same for you someday. Then again, do you really feel *that* lucky?"
(citing from the README of a mathematical subroutine package by R. Freund)
Caveats aside, project goals include:

This manual also contains docs for libv internals, so you can use it to get oriented to the libv source code if you're interested in patching the code. You should also read the file HACKING which comes with the source code if you plan to contribute to libv.

How to use this manual
This manual is devided into several parts. In the Modules section, the complete API for a given module is documented. If you're developing an application using libv, this is the place to go. The other two sections, namely "Data Structures" and "Files", additionally document internal data structures and functions you shouldn't have to care about unless you plan to work on libv itself.

Generated on Thu Jul 19 13:36:09 2007 for libv by  doxygen 1.5.1-p1. Thank you, Logo