About Qweas     RSS Feeds     BBS Forum Make Qweas.com My Home Page     Bookmark this page Register     Login     Help     Send Feedback  
Windows   Mac   Linux   Mobile   Games   Screensavers
Audio/Video Business Communication Desktop Develop Education Games Graphic Home Network Security Servers System Web
Active X , Basic, VB, VB DotNet , C / C++ / C# , Compilers & Interpreters , Components & Libraries , Debugging , Delphi , Help Tools , Install & Setup , Management & Distribution , Other , Source Editors
ImTOO DVD Ripper Standard

Tipard MKV Video Converter for Mac

Tracks Eraser Pro

Wondershare DVD Slideshow Builder

ViVi DVD Player

Business Letter Professional

Monkeymen Calendar

DVD Boy Player

Test Construction Kit

iPhone Video Recorder

Xilisoft DVD Audio Ripper

ImTOO DVD to iPod Converter

Related Reviews - more
documents management

database development

game development

docuemtns development

flow chart design

video activex

ftp activex

activex tools

com and dll

email activex

audio activex

mp3 activex

mp4 activex

dvd activex

basic tools

vb activex

vb tools

vb dotnet tools

vb ocx

vb programming

dotnet tools

source code editors

c programming

c++ components
Home > Development > Other > HashTrie

Detailed Description of HashTrie 1.0

HashTrie 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.

Initially HashTrie contains one item (TTreeItem) and behaves as hash-table. The conflicts of duties are allowed through the list of overflow. As hashing function we shall use CRC32 (hereinafter we shall return to a problem of choice hashing function). Is important that outcome of calculation hashing function it 32-bit unsigned integer. For addressing in the table (at the first level) we use a low byte.

For example we add in HashTrie string "ABCDE" so:

* calculate hash-function. H:=hash("ABCDE");
* calculate index in array. i:=H and $FF;
* if Items[i] is nil we create list, otherwise add item to list.
* if list length is more than some predefined constant (by example 8) we converse list to new tree item.
* Step 4 determines a rule of construction a HashTrie.
* if Items[i] contains pointer to other TTreeItem we add value to it. But at the second level of a tree we shall use second byte of hashing function, on third - third etc.

HashTrie is designed for:

HashTrie has the following requirements :



forgot password , walpaper hot , free disc tools , panic puzzle , controller timer software , you tube flv converter , manage documents , 4800 foot steps , live update , make my name to a screen saver , 9-ball pool

Site Map | Sort by Letters | Submit Software | Popular Downloads | Editor Picks | New Releases : Mac , Freeware | Updates : Mac , Freeware
Copyright © 2005-2012 Qweas Inc. All rights reserved. Get Buttons - Link to Us - About Qweas - Contact Us - Terms of Service - Copyright Policy - Guidelines - Privacy Policy