Download List

Projeto Descrição

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.

System Requirements

System requirement is not defined
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.

2013-01-17 07:02
1.20130114

Foram corrigidos vários bugs na última matriz associado radix introduzido árvore com base.
Several bugs in the last introduced radix tree based associate array were fixed.

2012-10-08 06:34
1.20121004

A interface para as seqüências baseados em árvores-B foi expandida, como tem uma das matrizes associativas chave cadeia de caracteres. O desempenho do array associativo chave anteriormente introduzidas de seqüência de caracteres baseados em árvores-B tem sido melhorada e uma nova seqüência de tamanho de chave e variável, introduziu-se a matriz de dados de características semelhantes. A nova matriz associativa é radix baseados em árvore. Foram adicionados mais perfis e testes.
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.

2012-07-09 06:32
1.20120708

É introduzida uma nova matriz associativa. A estrutura de dados mapeia seqüências de caracteres para itens de dados de tamanho variável. A matriz associativa é construído sobre árvores B, conosco, organizados como árvores pouco crítica. A nova estrutura de dados é ainda um desenvolvimento experimental.
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.

2012-06-11 08:57
1.20120609

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.

2012-04-30 08:27
0.20120427

Foi corrigido um bug no algoritmo de inserção de árvore pouco crítica introduzido com a versão anterior.
A bug in the critical bit tree insertion algorithm introduced with the previous release has been fixed.

Project Resources