Lines Matching refs:i1
130 for (uptr i1 = 0; i1 < BV::kSize; i1++)
131 l2_[i0][i1].setAll();
146 uptr i1 = idx1(idx);
148 if (!l1_[i0].getBit(i1)) {
149 l1_[i0].setBit(i1);
150 l2_[i0][i1].clear();
152 bool res = l2_[i0][i1].setBit(i2);
154 // idx, i0, i1, i2, res);
161 uptr i1 = idx1(idx);
164 if (l1_[i0].getBit(i1)) {
165 res = l2_[i0][i1].clearBit(i2);
166 if (l2_[i0][i1].empty())
167 l1_[i0].clearBit(i1);
175 uptr i1 = idx1(idx);
177 // Printf("%s: %zd => %zd %zd %zd\n", __func__, idx, i0, i1, i2);
178 return l1_[i0].getBit(i1) && l2_[i0][i1].getBit(i2);
184 uptr i1 = l1_[i0].getAndClearFirstOne();
185 uptr i2 = l2_[i0][i1].getAndClearFirstOne();
186 if (!l2_[i0][i1].empty())
187 l1_[i0].setBit(i1);
188 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2;
189 // Printf("getAndClearFirstOne: %zd %zd %zd => %zd\n", i0, i1, i2, res);
202 uptr i1 = t.getAndClearFirstOne();
203 if (l1_[i0].setBit(i1))
204 l2_[i0][i1].clear();
205 if (l2_[i0][i1].setUnion(v.l2_[i0][i1]))
221 uptr i1 = t.getAndClearFirstOne();
222 if (l2_[i0][i1].setIntersection(v.l2_[i0][i1]))
224 if (l2_[i0][i1].empty())
225 l1_[i0].clearBit(i1);
239 uptr i1 = t.getAndClearFirstOne();
240 if (l2_[i0][i1].setDifference(v.l2_[i0][i1]))
242 if (l2_[i0][i1].empty())
243 l1_[i0].clearBit(i1);
260 uptr i1 = t.getAndClearFirstOne();
261 if (!v.l1_[i0].getBit(i1)) continue;
262 if (l2_[i0][i1].intersectsWith(v.l2_[i0][i1]))
304 // Printf("++i1: %zd %zd; %d %d; size %zd\n", i0_, i1_, it1_.hasNext(),