libcontc Files

<make>
 + `cd' to the libcont directory.
 + type `./configure' to configure the package for your system.
 + type `make' to compile the package.
 + type `make install' to install the package (root).
 + update shared library links (ldconfig).
 + done. libcont is now available.
 + see INSTALL for more options and information.

<containers>
 + array_t  flat array.
 + btree_t  binary tree.
 + deque_t  double ended queue.
 + dlist_t  doubly linked list.
 + hasht_t  hash table.
 + prioq_t  max priority queue.
 + queue_t  queue.
 + stack_t  stack.

<extensions>
 + strmap_t     string associative map.
 + uo_strmap_t  string associative map (unordered).

<note>
 the algo family of functions are designed to be stand alone, they do not use
 any C99 features and can be applied to any flat array type, however, most of
 the containers use C99 features.

<note>
 these are pretty easy to use once you get used to dealing with everything as
 pointers. storing data is pretty straight forward. storing pointers requires
 a little more attention since the compiler won't issue an error when passing
 a pointer by object instead of address. in any case there will always be one
 additional level of indirection regardless of the type being stored.

<example>
 int i;
 array_push_back(&a, &i);
 assert(i == *(int*) array_back(&a));

 int* pi;
 array_push_back(&a, &pi); /* address of pointer. */
 assert(pi == *(int**) array_back(&a));

<references>
 + sgi standard template library.
 + Introduction to Algorithms - Thomas H. Cormen et al. 2nd ed.
 + GNU linux.