From 8fbf5fda24392d2a2ee19d6f40699a5de29da662 Mon Sep 17 00:00:00 2001 From: Mike Buland Date: Tue, 21 Nov 2006 20:26:23 +0000 Subject: Everything in libbu++ now passes -Wall, this should have been done a long time ago. --- src/hashtable.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'src/hashtable.cpp') diff --git a/src/hashtable.cpp b/src/hashtable.cpp index 725ebc4..dbcd964 100644 --- a/src/hashtable.cpp +++ b/src/hashtable.cpp @@ -41,7 +41,7 @@ bool HashTable::isFilled( int j ) return (aTable[j].id != NULL)||(aTable[j].bDeleted); } -bool HashTable::reHash( unsigned long int nNewSize ) +void HashTable::reHash( unsigned long int nNewSize ) { HashNode *aOldTable = aTable; unsigned long int oldSize = nTableSize; @@ -90,7 +90,7 @@ unsigned long int HashTable::probe( unsigned long int nStart, const void *id ) */ if( isFilled( nStart ) ) { - int nOldStart = nStart; + unsigned long int nOldStart = nStart; for( nStart++; isFilled( nStart ) && nStart != nOldStart; @@ -221,7 +221,7 @@ const void *HashTable::get( const void *id, unsigned long int nSkip ) if( bAllowDupes ) { - int nOldPos = nPos; + unsigned long int nOldPos = nPos; for( nPos++; nPos != nOldPos; nPos=(nPos+1)%nTableSize ) { if( !isFilled( nPos ) ) return NULL; @@ -270,7 +270,7 @@ const void *HashTable::getKey( const void *id, unsigned long int nSkip ) if( bAllowDupes ) { - int nOldPos = nPos; + unsigned long int nOldPos = nPos; for( nPos++; nPos != nOldPos; nPos=(nPos+1)%nTableSize ) { if( !isFilled( nPos ) ) return NULL; -- cgit v1.2.3