Reviewers: Michael Starzinger,
Message:
Please take a look.
Description:
Implement in-place rehashing of HashTable.
The algorithm puts elements into correct positions in multiple iterations.
On the first iteration it tries to put elements at entries specified by
their first hash probe. On the second iteration -- by the second
hash probe, and so on. Overall it does O(k*n) memory accesses, where
k is the maximum number of probes required for an element and n is the
capacity of the hash table. The expectation is that k will be small.
[email protected]
Please review this at https://chromiumcodereview.appspot.com/23658031/
SVN Base: https://v8.googlecode.com/svn/branches/bleeding_edge
Affected files (+128, -0 lines):
M src/objects.h
M src/objects.cc
M test/cctest/test-dictionary.cc
--
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
---
You received this message because you are subscribed to the Google Groups "v8-dev" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/groups/opt_out.
