Lines Matching defs:kUnused
73 // value kUnused. This represents the initial state of the algorithm,
104 // left[l] == kUnused or right[left[l]] == l
105 // right[r] == kUnused or left[right[r]] == r
128 left_(graph_->LhsSize(), kUnused),
129 right_(graph_->RhsSize(), kUnused) {}
150 GTEST_CHECK_(left_[ilhs] == kUnused)
159 if (irhs == kUnused) continue;
166 static const size_t kUnused = static_cast<size_t>(-1);
180 // potentially transition from kUnused to another value. Any other
181 // left_ element holding kUnused before TryAugment will be holding it
193 // right_[irhs] == kUnused means that there is residual flow from
200 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) {
219 // Elements of left_ and right_ are either kUnused or mutually
226 const size_t MaxBipartiteMatchState::kUnused;