Searched refs:kUnused (Results 1 - 2 of 2) sorted by relevance

/gem5/ext/googletest/googlemock/src/
H A Dgmock-matchers.cc147 // 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); member in class:testing::internal::MaxBipartiteMatchState
255 // potentially transition from kUnused to another value. Any other
256 // left_ element holding kUnused befor
305 const size_t MaxBipartiteMatchState::kUnused; member in class:testing::internal::MaxBipartiteMatchState
[all...]
/gem5/ext/googletest/googlemock/test/
H A Dgmock-matchers_test.cc5022 lhs_used_.assign(graph_->LhsSize(), kUnused);
5023 rhs_used_.assign(graph_->RhsSize(), kUnused);
5034 static const size_t kUnused = static_cast<size_t>(-1); member in class:testing::gmock_matchers_test::__anon19::BacktrackingMaxBPMState
5047 lhs_used_[back.first] = kUnused;
5048 rhs_used_[back.second] = kUnused;
5053 if (rhs_used_[irhs] != kUnused) {
5057 if (lhs_used_[ilhs] != kUnused) {
5083 const size_t BacktrackingMaxBPMState<Graph>::kUnused; member in class:testing::gmock_matchers_test::__anon19::BacktrackingMaxBPMState

Completed in 27 milliseconds