Lines Matching refs:test_cases
105 const std::vector<NumberTest>& test_cases,
108 for (std::vector<NumberTest>::const_iterator test = test_cases.begin();
109 test != test_cases.end(); ++test) {
128 const std::vector<NumberTest>& test_cases,
131 for (std::vector<NumberTest>::const_iterator test = test_cases.begin();
132 test != test_cases.end(); ++test) {
932 std::vector<NumberTest> test_cases;
933 test_cases.insert(test_cases.begin(), kPossibleOnlyCases,
935 test_cases.insert(test_cases.begin(), kValidCases,
937 test_cases.insert(
938 test_cases.begin(), kStrictGroupingCases,
940 test_cases.insert(test_cases.begin(), kExactGroupingCases,
942 DoTestNumberMatchesForLeniency(test_cases, PhoneNumberMatcher::POSSIBLE);
946 std::vector<NumberTest> test_cases;
947 test_cases.insert(test_cases.begin(), kImpossibleCases,
949 DoTestNumberNonMatchesForLeniency(test_cases, PhoneNumberMatcher::POSSIBLE);
953 std::vector<NumberTest> test_cases;
954 test_cases.insert(test_cases.begin(), kValidCases,
956 test_cases.insert(
957 test_cases.begin(), kStrictGroupingCases,
959 test_cases.insert(test_cases.begin(), kExactGroupingCases,
961 DoTestNumberMatchesForLeniency(test_cases, PhoneNumberMatcher::VALID);
965 std::vector<NumberTest> test_cases;
966 test_cases.insert(test_cases.begin(), kImpossibleCases,
968 test_cases.insert(test_cases.begin(), kPossibleOnlyCases,
970 DoTestNumberNonMatchesForLeniency(test_cases, PhoneNumberMatcher::VALID);
974 std::vector<NumberTest> test_cases;
975 test_cases.insert(
976 test_cases.begin(), kStrictGroupingCases,
978 test_cases.insert(test_cases.begin(), kExactGroupingCases,
980 DoTestNumberMatchesForLeniency(test_cases,
985 std::vector<NumberTest> test_cases;
986 test_cases.insert(test_cases.begin(), kImpossibleCases,
988 test_cases.insert(test_cases.begin(), kPossibleOnlyCases,
990 test_cases.insert(test_cases.begin(), kValidCases,
992 DoTestNumberNonMatchesForLeniency(test_cases,
997 std::vector<NumberTest> test_cases;
998 test_cases.insert(test_cases.begin(), kExactGroupingCases,
1000 DoTestNumberMatchesForLeniency(test_cases,
1005 std::vector<NumberTest> test_cases;
1006 test_cases.insert(test_cases.begin(), kImpossibleCases,
1008 test_cases.insert(test_cases.begin(), kPossibleOnlyCases,
1010 test_cases.insert(test_cases.begin(), kValidCases,
1012 test_cases.insert(
1013 test_cases.begin(), kStrictGroupingCases,
1015 DoTestNumberNonMatchesForLeniency(test_cases,