chapter5ppt整理.ppt

5.3 how to solve a collision Quadratic probing Find function public Hashable find( Hashable x ) { int currentPos = findPos( x ); return isActive( currentPos ) ? array[ currentPos ].element : null ; } private int findPos( hashable x ) { int collisionNum = 0; int currentPos = x.hash( array.length ); while( array[ currentPos ] != null !array[ currentPos ].element.equals( x ) ) { currentPos += 2 * ++collisionNum – 1; if( currentPos = array . length ) currentPos -= array . length; } return currentPos; } 5.3 how to solve a collision Quadratic probing private boolean isActive( int currentPos ) { return array[ currentPos ] != null array[ currentPos ].isActive; } Insert function public void insert( Hashable x ) { int currentPos = findPos( x ); if( isActive( currentPos ) ) return; array[ currentPos ] = new HashEntry( x, true ); if( ++currentSize array . length / 2 ) rehash( ); } 5.3 how to solve a collision Quadratic probing Remove function public final void remove( Hashable x ) { int currentPos = findPos( x ); if( isActive( currentPos) ) array[ currentPos ] . isActive = false; } 5.3 how to solve a collision Double Hashing 3) Double Hashing If hash1(k)=d and the bucket is already occupied then we will counting hash2(k) =c, examine successive buckets d+c, d+2c, d+3c……, in the array example: hash1(k) = k % 10; hash2(k) = R – (k % R ); 其中 R TableSize的质数 ( 89, 18, 49, 58, 69 ) hash2(49)=7-49%7=7 (R=7) hash2(58)=7-58%7=5 hash2(69)=7-69%7=1 0 1 2 3 4 5 6 7 8 9 69 58 49 18 89 rehashing example: