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 | GPLv3 |
Recent releases
- 14 Apr 2013 18:42
Release Notes: Data swapping utilities for some of the featured data structures were added.
- 18 Mar 2013 13:57
Release Notes: A bug in the deletion algorithm of the previously-introduced radix tree associative array was fixed.
- 10 Mar 2013 19:11
Release Notes: A new radix tree associative array breed is introduced. The array maps pointer for string keys. It organizes its dense nodes as lookup tables and the sparse nodes as sorted compact tables. The new structure generally performs better than similar structures that keep all nodes organized as sorted tables, except for deletion.
- 16 Jan 2013 22:02
Release Notes: Several bugs in the last introduced radix tree based associate array were fixed.
- 07 Oct 2012 21:34
Release Notes: The interface for the B-tree-based sequences has been expanded, as has one of the string key associative arrays. The performance of the previously-introduced B-tree-based string key associative array has been improved, and a new string key and variable size data array of similar traits has been introduced. The new associative array is radix tree-based. More profiling and tests have been added.
x1f42
11 Aug 2009 19:18
Heartbeat
- Popularity Score
- 290.40
- Vitality Score
- 35.80
- Subscriptions
- 17
