Lines Matching refs:i
44 inline Slice Seq(uint64_t i) { in Seq()
45 a = i; in Seq()
49 inline Slice Nonseq(uint64_t i) { in Nonseq()
50 a = i; in Nonseq()
51 b = i * 123; in Nonseq()
54 inline Slice Key(uint64_t i, bool nonseq) { in Key()
55 return nonseq ? Nonseq(i) : Seq(i); in Key()
143 for (uint64_t i = 0; i < num; i++) { in TEST_F() local
144 bloom.Add(km.Key(i, nonseq)); in TEST_F()
145 ASSERT_TRUE(bloom.MayContain(km.Key(i, nonseq))); in TEST_F()
149 for (uint64_t i = 0; i < num; i++) { in TEST_F() local
150 ASSERT_TRUE(bloom.MayContain(km.Key(i, nonseq))); in TEST_F()
155 for (uint64_t i = 0; i < 30000; i++) { in TEST_F() local
156 if (bloom.MayContain(km.Key(i + 1000000000, nonseq))) { in TEST_F()
196 for (uint64_t i = 1; i <= num_keys; ++i) { in TEST_F() local
197 std_bloom.Add(km.Seq(i)); in TEST_F()
206 for (uint64_t i = 1; i <= num_keys; ++i) { in TEST_F() local
207 if (std_bloom.MayContain(km.Seq(i))) { in TEST_F()
243 for (uint64_t i = 1 + t; i <= num_keys; i += num_threads) { in TEST_F() local
244 std_bloom.AddConcurrently(km.Seq(i)); in TEST_F()
266 for (uint64_t i = 1 + t; i <= num_keys; i += num_threads) { in TEST_F() local
267 bool f = std_bloom.MayContain(km.Seq(i)); in TEST_F()
291 for (uint64_t i = num_keys + 1 + t; i <= 2 * num_keys; i += num_threads) { in TEST_F() local
292 bool f = std_bloom.MayContain(km.Seq(i)); in TEST_F()