diff options
author | Joshua Haberman <joshua@reverberate.org> | 2009-07-21 23:28:49 -0700 |
---|---|---|
committer | Joshua Haberman <joshua@reverberate.org> | 2009-07-21 23:28:49 -0700 |
commit | edf5f9e8ed8bc62fc0eb769bd5aa27de66f185f3 (patch) | |
tree | 0e9ff2105f9e91f6ca846b7b6e918dce2e766035 /tests/test_table.cc | |
parent | b2a890263f4284b109b667aaa0fe341d74201aba (diff) |
Update test_table to new table API.
Diffstat (limited to 'tests/test_table.cc')
-rw-r--r-- | tests/test_table.cc | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/tests/test_table.cc b/tests/test_table.cc index 24a93c3..f61a85c 100644 --- a/tests/test_table.cc +++ b/tests/test_table.cc @@ -108,7 +108,7 @@ void test_inttable(int32_t *keys, size_t num_entries) /* Test correctness. */ for(uint32_t i = 1; i <= largest_key; i++) { struct inttable_entry *e = (struct inttable_entry*)upb_inttable_lookup( - &table, i, sizeof(struct inttable_entry)); + &table, i); if(m.find(i) != m.end()) { /* Assume map implementation is correct. */ assert(e); assert(e->e.key == i); @@ -151,7 +151,7 @@ void test_inttable(int32_t *keys, size_t num_entries) for(unsigned int i = 0; i < iterations; i++) { int32_t key = keys[i & mask]; struct inttable_entry *e = (struct inttable_entry*)upb_inttable_lookup( - &table, key, sizeof(struct inttable_entry)); + &table, key); x += (uintptr_t)e; } double total = get_usertime() - before; @@ -164,7 +164,7 @@ void test_inttable(int32_t *keys, size_t num_entries) for(unsigned int i = 0; i < iterations; i++) { int32_t key = keys[rand() & mask]; struct inttable_entry *e = (struct inttable_entry*)upb_inttable_lookup( - &table, key, sizeof(struct inttable_entry)); + &table, key); x += (uintptr_t)e; } total = get_usertime() - before; |