Searched refs:t2 (Results 1 – 4 of 4) sorted by relevance
1372 self.t2 = Deque() # T2: frequent entries1381 if self.t2:1382 old = self.t2.pop()1395 self.t2.appendleft(key)1398 if key in self.t2:1399 self.t2.remove(key)1400 self.t2.appendleft(key)1411 self.t2.appendleft(key)1420 self.t2.appendleft(key)1428 total = len(self.t1) + len(self.b1) + len(self.t2) + len(self.b2)
190 auto t2 = rep_.transform_->Transform(k2); in Next() local191 advance_prev = t1.compare(t2) == 0; in Next()
442 ROCKSDB_NAMESPACE::port::Thread t2( in SnapshotConcurrentAccessTestInternal() local445 t2.join(); in SnapshotConcurrentAccessTestInternal()471 ROCKSDB_NAMESPACE::port::Thread t2( in SnapshotConcurrentAccessTestInternal() local474 t2.join(); in SnapshotConcurrentAccessTestInternal()1387 ROCKSDB_NAMESPACE::port::Thread t2([&]() { in TEST_P() local1404 t2.join(); in TEST_P()1431 ROCKSDB_NAMESPACE::port::Thread t2([&]() { in TEST_P() local1462 t2.join(); in TEST_P()
1934 static bool Eq(const Tuple1& t1, const Tuple2& t2) {1935 return SameSizeTuplePrefixComparator<k - 1, k - 1>::Eq(t1, t2) &&1936 ::std::tr1::get<k - 1>(t1) == ::std::tr1::get<k - 1>(t2);