Projects / 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.


Recent releases

  •  22 Apr 2014 19:46

    Release Notes: Bugs were fixed.

    •  26 Jan 2014 00:36

      Release Notes: This release adds a new trie-based associative array. The new breed uses one or more bytes for branch selection. Several recursive trie insertion algorithms are replaced by non-recursive versions.

      •  11 Aug 2013 16:41

        Release Notes: The b-tree based sequence library has been extended.

        •  14 Apr 2013 14:06

          Release Notes: Data swapping utilities for some of the featured data structures were added.

          •  18 Mar 2013 02:42

            Release Notes: A bug in the deletion algorithm of the previously-introduced radix tree associative array was fixed.


            Project Spotlight


            A Fluent OpenStack client API for Java.


            Project Spotlight

            TurnKey TWiki Appliance

            A TWiki appliance that is easy to use and lightweight.