Projects / libx1f4l2 / Releases

All releases of libx1f4l2

  •  22 Apr 2014 19:46
Avatar

    Release Notes: Bugs were fixed.

    •  26 Jan 2014 00:36
    Avatar

      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
      Avatar

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

        •  14 Apr 2013 14:06
        Avatar

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

          •  18 Mar 2013 02:42
          Avatar

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

            •  10 Mar 2013 15:54
            Avatar

              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 02:53
              Avatar

                Release Notes: Several bugs in the last introduced radix tree based associate array were fixed.

                •  07 Oct 2012 21:18
                Avatar

                  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.

                  •  08 Jul 2012 20:18
                  Avatar

                    Release Notes: A new associative array is introduced. The data structure maps strings for variable size data items. The associative array is constructed over B-trees, with nodes organized as critical bit trees. The new data structure is as of yet an experimental development.

                    •  10 Jun 2012 20:07
                    Avatar

                      Release Notes: This release introduces a new critical bit tree variety. The new tree caches a small number of critical bit-adjacent bits to eliminate the final string comparison. Several bugs have been fixed across the featured data structures, and new methods have been introduced. The license is now GPLv3.

                      Screenshot

                      Project Spotlight

                      episoder

                      A tool to tell you about new episodes of your favourite TV shows.

                      Screenshot

                      Project Spotlight

                      BalanceNG

                      A modern software IP load balancer.