Lines Matching defs:first
737 unsigned first; // the first (matching) test to be executed
741 int subcase_filter_levels; // apply the subcase filters for the first N levels
1615 // is used first (has higher operator precedence compared to `<<`) so that we guarantee that
1616 // an operator of the MessageBuilder class is called first before the rest of the parameters
1790 // or isn't in the execution range (between first and last) (safe to cache a pointer to the input)
3097 // first value becomes desired", all others become 0.
5014 open_ts_tag = true; // first test case ==> first test suite
5046 .writeAttribute("priority", curr.first.first)
5047 .writeAttribute("name", curr.first.second);
5050 .writeAttribute("priority", curr.first.first)
5051 .writeAttribute("name", curr.first.second);
5088 .writeAttribute("first", opt.first)
5676 s << " -" DOCTEST_OPTIONS_PREFIX_DISPLAY "f, --" DOCTEST_OPTIONS_PREFIX_DISPLAY "first=<int> "
5677 << Whitespace(sizePrefixDisplay*1) << "the first test passing the filters to\n";
5685 << Whitespace(sizePrefixDisplay*1) << "apply filters for the first <int> levels\n";
5731 s << "priority: " << std::setw(5) << curr.first.first
5732 << " name: " << curr.first.second << "\n";
5994 // going from the end to the beginning and stopping on the first occurrence from the end
6184 DOCTEST_PARSE_INT_OPTION("first", "f", first, 0);
6332 if(matchesAny(curr.first.second.c_str(), p->filters[8], false, p->case_sensitive))
6371 const auto first = &testArray[0];
6375 const auto temp = first[i];
6377 first[i] = first[idxToSwap];
6378 first[idxToSwap] = temp;
6419 if((p->last < p->numTestCasesPassingFilters && p->first <= p->last) ||
6420 (p->first > p->numTestCasesPassingFilters))