Lines Matching refs:size_t
147 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
157 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) {
158 size_t irhs = left_[ilhs];
166 static const size_t kUnused = static_cast<size_t>(-1);
184 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) {
185 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
222 ::std::vector<size_t> left_;
223 ::std::vector<size_t> right_;
226 const size_t MaxBipartiteMatchState::kUnused;
248 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
249 for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
262 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
263 for (size_t irhs = 0; irhs < RhsSize(); ++irhs) {
273 for (size_t i = 0; i < LhsSize(); ++i) {
275 for (size_t j = 0; j < RhsSize(); ++j) {
308 for (size_t i = 0; i != matcher_describers_.size(); ++i) {
349 for (size_t i = 0; i != matcher_describers_.size(); ++i) {
394 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) {
395 for (size_t irhs = 0; irhs < matrix.RhsSize(); irhs++) {
405 for (size_t mi = 0; mi < matcher_matched.size(); ++mi) {
423 for (size_t ei = 0; ei < element_matched.size(); ++ei) {
441 size_t max_flow = matches.size();
468 for (size_t mi = 0; mi < matches.size(); ++mi) {