blob: aae072360fd9447493b3a3eb084af39a9e1eaf95 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
|
LibDS is a small but powerful and easy to use library containing a few
very useful data structures. Currently, the following data structures are
supported:
- a balanced binary tree (an AVL tree);
- a binary HEAP;
- a QUEUE;
- a HASH table;
- a SET and a BAG;
- a variable length array that can grows dynamically as new elements are
added or deleted (PARRAY).
- a STACK;
LibDS has been designed to be very easy to use, without sacrificing either
flexibility or speed. The API is small, and clean.
|
