libeds is an extensible data structures library for C language.
it contains:
lists:
- unary-linked lists
- double-linked lists
- multi-linked lists
trees:
binary:
- red-black
- randomized
- splay
- avl
other:
- b tree(... in progress)
- hash table
- vector
- stack
- queues
graphs:
... in progress
btw: you can hold data of any type in each data structure
Each data structure may be converted to other one.
main feature of this library is quite common API for all data structures, which contains in the same family(for example all list have identical API, all binary trees have identical API and so on...).
everyone can easily add his implementation of needed data structure, using data structure family API. if you want to add new kind of list or just replace implementation of some list function, it's really quite simple. you just use common list API.
Moreover, you can easily to add your own data structure family and implement some kinds of it.
join and enjoy.
30 Day Summary Apr 18 2013 — May 18 2013
|
12 Month Summary May 18 2012 — May 18 2013
|
Copyright
©
2013
Black Duck Software, Inc.
and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a
Creative Commons Attribution 3.0 Unported License
. Ohloh
®
and the Ohloh logo are trademarks of
Black Duck Software, Inc.
in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.