libx1f4l2
libx1f4l2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed lists. The BST (binary search tree) selection includes AVL, red/black, AA, and RBST trees in simple, parent pointer, and threaded flavors. The BST backed lists are all-purpose lists, allowing for sequential and random access. The complexity for most operations is log(N), including reading, inserting, and deleting, random or sequential. Other library features include pointer sets and tries. A collection of demo, test, and data structure comparison programs is included.
| Tags | C Libraries POSIX Software Development |
|---|---|
| Licenses | GPL |
Recent releases
- 29 Apr 2012 23:27
Release Notes: A bug in the critical bit tree insertion algorithm introduced with the previous release has been fixed.
- 22 Apr 2012 23:50
Release Notes: Several bugs in the string key pointer value associative arrays have been fixed.
- 11 Dec 2011 21:53
Release Notes: A deletion algorithm for the last introduced B-tree based sequence was added. The sequence organizes the B-tree leaf nodes as sparse arrays to lower the amount of data shifted for edit operations. Its implementation was refined into taking advantage of the broader words of 64-bit architectures.
- 01 Nov 2011 21:05
Release Notes: The string key pointer value maps library has been expanded. Support for empty string keys has been added. A new string key pointer value map was added. The new map stores the short strings in place of the string pointers. Over the previous designs, the newly introduced map is slightly faster and more memory conservative.
- 17 Oct 2011 21:03
Release Notes: Support for 64-bit machines has been improved.
x1f42
11 Aug 2009 19:18
Heartbeat
- Popularity Score
- 231.08
- Vitality Score
- 28.06
- Subscriptions
- 16
