hi,
iam looking at the following code which does lookup in the hash table
int HashTable<Shape, Key>::FindEntry(Key key) {
...
Object* element = KeyAt(entry);
if (!element->IsNull() && Shape::IsMatch(key, element)) return entry;
...
the key match seems to be unconditional. is it required in case there
are no collisions in the table or is it optimized in some way in this
case.
sorry if iam being naive.
Thanks,
Zaheer
--
v8-users mailing list
[email protected]
http://groups.google.com/group/v8-users
