Lines Matching refs:size

82     ASSERT_EQ(values.empty() ? 0 : values[0].size(), value_len_found);  in CheckFileContents()
83 ASSERT_EQ(props->raw_value_size, values.size()*value_len_found); in CheckFileContents()
101 ASSERT_EQ(props->num_entries, keys.size()); in CheckFileContents()
103 ASSERT_EQ(props->fixed_key_len, keys.empty() ? 0 : keys[0].size()); in CheckFileContents()
104 ASSERT_EQ(props->data_size, expected_unused_bucket.size() * in CheckFileContents()
106 ASSERT_EQ(props->raw_key_size, keys.size()*props->fixed_key_len); in CheckFileContents()
112 std::vector<bool> keys_found(keys.size(), false); in CheckFileContents()
113 size_t bucket_size = expected_unused_bucket.size(); in CheckFileContents()
121 if (key_idx == keys.size()) { in CheckFileContents()
124 ASSERT_EQ(0, expected_unused_bucket.size()); in CheckFileContents()
207 uint64_t expected_table_size = GetExpectedTableSize(keys.size()); in TEST_F()
220 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()
225 size_t bucket_size = keys[0].size() + values[0].size(); in TEST_F()
232 expected_unused_bucket += std::string(values[0].size(), 'a'); in TEST_F()
257 uint64_t expected_table_size = GetExpectedTableSize(keys.size()); in TEST_F()
270 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()
275 size_t bucket_size = keys[0].size() + values[0].size(); in TEST_F()
282 expected_unused_bucket += std::string(values[0].size(), 'a'); in TEST_F()
306 uint64_t expected_table_size = GetExpectedTableSize(keys.size()); in TEST_F()
320 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()
325 size_t bucket_size = keys[0].size() + values[0].size(); in TEST_F()
332 expected_unused_bucket += std::string(values[0].size(), 'a'); in TEST_F()
361 uint64_t expected_table_size = GetExpectedTableSize(keys.size()); in TEST_F()
374 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()
379 size_t bucket_size = keys[0].size() + values[0].size(); in TEST_F()
386 expected_unused_bucket += std::string(values[0].size(), 'a'); in TEST_F()
412 uint64_t expected_table_size = GetExpectedTableSize(keys.size()); in TEST_F()
425 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()
430 size_t bucket_size = keys[0].size() + values[0].size(); in TEST_F()
437 expected_unused_bucket += std::string(values[0].size(), 'a'); in TEST_F()
456 uint64_t expected_table_size = GetExpectedTableSize(user_keys.size()); in TEST_F()
469 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()
474 size_t bucket_size = user_keys[0].size() + values[0].size(); in TEST_F()
481 expected_unused_bucket += std::string(values[0].size(), 'a'); in TEST_F()
501 uint64_t expected_table_size = GetExpectedTableSize(user_keys.size()); in TEST_F()
514 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()
519 size_t bucket_size = user_keys[0].size() + values[0].size(); in TEST_F()
526 expected_unused_bucket += std::string(values[0].size(), 'a'); in TEST_F()
548 uint64_t expected_table_size = GetExpectedTableSize(user_keys.size()); in TEST_F()
561 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()
566 size_t bucket_size = user_keys[0].size() + values[0].size(); in TEST_F()
573 expected_unused_bucket += std::string(values[0].size(), 'a'); in TEST_F()
607 for (uint32_t i = 0; i < user_keys.size(); i++) { in TEST_F()