This helps writing test cases. Also adapt the test case that
expected 64-bit.
Nothing changes performance wise, the distribution of the hash
values remains intact.
table (480 used items) */
map_id_t pkgCache::sHash(const string &Str) const
{
table (480 used items) */
map_id_t pkgCache::sHash(const string &Str) const
{
- unsigned long Hash = 0;
for (string::const_iterator I = Str.begin(); I != Str.end(); ++I)
Hash = 41 * Hash + tolower_ascii(*I);
return Hash % HeaderP->GetHashTableSize();
for (string::const_iterator I = Str.begin(); I != Str.end(); ++I)
Hash = 41 * Hash + tolower_ascii(*I);
return Hash % HeaderP->GetHashTableSize();
map_id_t pkgCache::sHash(const char *Str) const
{
map_id_t pkgCache::sHash(const char *Str) const
{
- unsigned long Hash = tolower_ascii(*Str);
+ uint32_t Hash = tolower_ascii(*Str);
for (const char *I = Str + 1; *I != 0; ++I)
Hash = 41 * Hash + tolower_ascii(*I);
return Hash % HeaderP->GetHashTableSize();
for (const char *I = Str + 1; *I != 0; ++I)
Hash = 41 * Hash + tolower_ascii(*I);
return Hash % HeaderP->GetHashTableSize();
testsuccessequal 'dpkg
bar
testsuccessequal 'dpkg
bar
foo' aptcache pkgnames
testsuccessequal 'bar' aptcache pkgnames bar
testsuccessequal 'fancy
foo' aptcache pkgnames
testsuccessequal 'bar' aptcache pkgnames bar
testsuccessequal 'fancy