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