Solved

insert() function of a HashTable.......

Posted on 2003-12-06
1
290 Views
Last Modified: 2010-04-02
To C++ Experts,
 
     I am still struggling to understand the logic of a hashtable. This is a continued question of :
http://www.experts-exchange.com/Programming/Programming_Languages/Cplusplus/Q_20817844.html

The implementation of the insert() function looks like :
---------------------------------------------------------------------
template <class K, class T, class H>
bool HashTable<K,T,H>::insert(K key, T val)
{   const K ZERO_K = K() ;
    int k0 = hash(key), k = k0 ;  // line01 .... Q1
    while ( _[k].first != key && _[k].first != ZERO_K)
      k=(k+1)%_.size() ;
    if (_[k].first == key) return false ;
    if (size()+1 < LOAD*_.size()) _[k] = Pair(key,val) ;
    else
    {  rebuild() ;
       insert(key,val) ;
    }
    return true ;
}
------------------------------------------------------
 So here is my question :
Q1. in line01: k0 and k could be values larger than 1, and "_" is a vector of pair in the HashTable. Then it seems to me that : the vector "_" does not start from 0 ? (I mean _[0], v[1] ... could be empty). It starts at certain k dependes on the pair we inserted and the first several elements of "_" could be empty ???

Q2. if the above statement is true, it troubles me a lot ! If the first several elements of "_" is empty, what does _.size() mean ? Then how do we know the later implementation such as "size()+1 < LOAD*_.size()" is correct ?

Thanks very much !!!

meow.
0
Comment
Question by:meow00
1 Comment
 
LVL 11

Accepted Solution

by:
bcladd earned 150 total points
ID: 9889461
(1) You don't show the hash() function but it returns a number modulo the table size (_.size()). Modular arithmetic works with values on the range 0 - (_.size()-1), exactly the range of indices in a C++ array (or vector).
The point of a hash function is to "randomize" the key values to avoid clustering. So, if there is one item in your hash there is no guarantee that it is in _[0]. Your hash table is using open address hashing where if two keys do hash to the same location (which is bound to happen by the pigeon hole principle), the collision is resolved by walking the table the the +1 direction (modular arithmetic again) until an opening is found. Notice that the load factor makes sure that there is at least one free slot so the loop must terminate

(2) A hash table's size is the number of SLOTs in the hash table. So _.size() is initialized (remembering from another of your posts) to 109? That means there is room for 109 pairs and when there are too many in the table rebuild is called to expand _ (and _.size()). You would keep track of the size() of the hash table (the number of entries inserted into it) and _.size() separately (as your implementation seems to do).

Hope this helps, -bcl
0

Featured Post

Is Your Active Directory as Secure as You Think?

More than 75% of all records are compromised because of the loss or theft of a privileged credential. Experts have been exploring Active Directory infrastructure to identify key threats and establish best practices for keeping data safe. Attend this month’s webinar to learn more.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

IntroductionThis article is the second in a three part article series on the Visual Studio 2008 Debugger.  It provides tips in setting and using breakpoints. If not familiar with this debugger, you can find a basic introduction in the EE article loc…
Many modern programming languages support the concept of a property -- a class member that combines characteristics of both a data member and a method.  These are sometimes called "smart fields" because you can add logic that is applied automaticall…
The viewer will learn how to pass data into a function in C++. This is one step further in using functions. Instead of only printing text onto the console, the function will be able to perform calculations with argumentents given by the user.
The viewer will learn how to user default arguments when defining functions. This method of defining functions will be contrasted with the non-default-argument of defining functions.

863 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

20 Experts available now in Live!

Get 1:1 Help Now