HashTrie 1.0

In category

Components > Tools > Sort, Search

Description

High efficient dynamic hash table with tree organization.

The existing implementations of hash-tables have the important disadvantage - fixed size. As a corollary, if the table is filled more than 90% search and insert operation become very slow. HashTrie represents new efficient data structure. It combines in herself properties of the hash-tables and trie (digital-trees). As against the usual hash-tables the size HashTrie is not fixed, that allows to work with a unknown beforehand amount of datas.

Informations

• Status: Fully functional
• Source: FW
• Size: 103 046kB

Platforms:

• C++ Builder 3
• C++ Builder 4
• C++ Builder 5
• C++ Builder 6
• Delphi 2
• Delphi 3
• Delphi 4
• Delphi 5
• Delphi 6
• Delphi 7

Downloads

• C++ Builder 3 , C++ Builder 4 , C++ Builder 5 , C++ Builder 6 , Delphi 2 , Delphi 3 , Delphi 4 , Delphi 5 , Delphi 6 , Delphi 7