Lines Matching refs:kUnused
147 // value kUnused. This represents the initial state of the algorithm,
178 // left[l] == kUnused or right[left[l]] == l
179 // right[r] == kUnused or left[right[r]] == r
202 left_(graph_->LhsSize(), kUnused),
203 right_(graph_->RhsSize(), kUnused) {
225 GTEST_CHECK_(left_[ilhs] == kUnused)
234 if (irhs == kUnused) continue;
241 static const size_t kUnused = static_cast<size_t>(-1);
255 // potentially transition from kUnused to another value. Any other
256 // left_ element holding kUnused before TryAugment will be holding it
270 // right_[irhs] == kUnused means that there is residual flow from
277 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) {
296 // Elements of left_ and right_ are either kUnused or mutually
305 const size_t MaxBipartiteMatchState::kUnused;