Lines Matching refs:bv
84 // for (BasicBitVector<>::Iterator it(bv); it.hasNext();) {
91 explicit Iterator(const BasicBitVector &bv) : bv_(bv) {}
107 // Fixed size bit vector of (kLevel1Size*BV::kSize**2) bits.
110 template <uptr kLevel1Size = 1, class BV = BasicBitVector<> >
113 // Set bit in the first level BV indicates that there are set bits
114 // in the corresponding BV of the second level.
118 enum SizeEnum { kSize = BV::kSize * BV::kSize * kLevel1Size };
131 for (uptr i1 = 0; i1 < BV::kSize; i1++)
189 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2;
201 BV t = v.l1_[i0];
220 BV t = l1_[i0];
237 BV t = l1_[i0];
258 BV t = l1_[i0];
270 // for (TwoLevelBitVector<>::Iterator it(bv); it.hasNext();) {
277 explicit Iterator(const TwoLevelBitVector &bv) : bv_(bv), i0_(0), i1_(0) {
295 it1_ = typename BV::Iterator(bv_.l1_[i0_]);
304 it2_ = typename BV::Iterator(bv_.l2_[i0_][i1_]);
310 uptr res = i0_ * BV::kSize * BV::kSize + i1_ * BV::kSize + i2;
321 typename BV::Iterator it1_, it2_;
328 uptr res = idx / (BV::kSize * BV::kSize);
334 uptr res = (idx / BV::kSize) % BV::kSize;
335 CHECK_LE(res, BV::kSize);
340 uptr res = idx % BV::kSize;
341 CHECK_LE(res, BV::kSize);
345 BV l1_[kLevel1Size];
346 BV l2_[kLevel1Size][BV::kSize];
