removed redundant function prototype

This commit is contained in:
Jeff Hill
1999-08-06 15:24:42 +00:00
parent 56ccc1f383
commit ff969dfaca
2 changed files with 2 additions and 36 deletions

View File

@@ -174,23 +174,6 @@ private:
T *findDelete (tsSLList<T> &list, const ID &idIn);
};
//
// resTableIntHash()
//
// converts any integer into a hash table index
//
// idWidth: the maximum number of ls bits in "id" which might
// be set during any given call be set.
//
// minIndexWidth: the minimum number of bits in a hash table
// index. This dermines the minimum size of the hash table.
// Knowing this value at compile time improves the performance
// of the hash. Set this parameter to zero if unsure of the
// correct minimum hash table size.
//
template <class T, unsigned minIndexWidth, unsigned idWidth>
resTableIndex resTableIntHash (const T &id);
//
// Some ID classes that work with the above template
//
@@ -314,7 +297,7 @@ private:
// converts any integer into a hash table index
//
// idWidth: the maximum number of ls bits in "id" which might
// be set during any given call be set.
// be set during any call to this function.
//
// minIndexWidth: the minimum number of bits in a hash table
// index. This dermines the minimum size of the hash table.

View File

@@ -174,23 +174,6 @@ private:
T *findDelete (tsSLList<T> &list, const ID &idIn);
};
//
// resTableIntHash()
//
// converts any integer into a hash table index
//
// idWidth: the maximum number of ls bits in "id" which might
// be set during any given call be set.
//
// minIndexWidth: the minimum number of bits in a hash table
// index. This dermines the minimum size of the hash table.
// Knowing this value at compile time improves the performance
// of the hash. Set this parameter to zero if unsure of the
// correct minimum hash table size.
//
template <class T, unsigned minIndexWidth, unsigned idWidth>
resTableIndex resTableIntHash (const T &id);
//
// Some ID classes that work with the above template
//
@@ -314,7 +297,7 @@ private:
// converts any integer into a hash table index
//
// idWidth: the maximum number of ls bits in "id" which might
// be set during any given call be set.
// be set during any call to this function.
//
// minIndexWidth: the minimum number of bits in a hash table
// index. This dermines the minimum size of the hash table.