Home
last modified time | relevance | path

Searched refs:answer_table (Results 1 – 6 of 6) sorted by relevance

/external/sdv/vsomeip/third_party/boost/regex/test/regress/
Dtest_mfc.cpp39 const int* answer_table = test_info<char>::answer_table(); in test_mfc() local
48 test_result(what, s.GetString(), answer_table); in test_mfc()
50 else if(answer_table[0] >= 0) in test_mfc()
58 if(answer_table[0] < 0) in test_mfc()
67 if((answer_table[0] > 0) && boost::regex_match(s, r, opts)) in test_mfc()
71 else if((answer_table[0] == 0) && (answer_table[1] == static_cast<int>(ss.size()))) in test_mfc()
79 test_result(what, s.GetString(), answer_table); in test_mfc()
86 else if(answer_table[0] >= 0) in test_mfc()
108 test_result(*start, s.GetString(), answer_table); in test_mfc()
112 if(*answer_table != -2) in test_mfc()
[all …]
Dtest_regex_search.hpp32 …h<BidirectionalIterator>& sub, BidirectionalIterator base, const int* answer_table, int i, bool re… in test_sub_match() argument
41 test_sub_match(copy, base, answer_table, i, false); in test_sub_match()
49 if(answer_table[2*i] >= 0) in test_sub_match()
58 if(std::distance(base, sub.first) != answer_table[2*i]) in test_sub_match()
63 << ", expected " << answer_table[2*i] << ".", charT); in test_sub_match()
65 if(std::distance(base, sub.second) != answer_table[1+ 2*i]) in test_sub_match()
70 << ", expected " << answer_table[1 + 2*i] << ".", charT); in test_sub_match()
79 …nalIterator, Allocator>& what, BidirectionalIterator base, const int* answer_table, bool recurse =… in test_result() argument
84 test_result(copy, base, answer_table, false); in test_result()
87 test_result(s, base, answer_table, false); in test_result()
[all …]
Dtest_partial_match.hpp29 …:sub_match<BidirectionalIterator>& sub, BidirectionalIterator base, const int* answer_table, int i) in test_sub_match() argument
41 if(answer_table[2*i] >= 0) in test_sub_match()
50 if(std::distance(base, sub.first) != answer_table[2*i]) in test_sub_match()
55 << ", expected " << answer_table[2*i] << ".", charT); in test_sub_match()
57 if(std::distance(base, sub.second) != answer_table[1+ 2*i]) in test_sub_match()
62 << ", expected " << answer_table[1 + 2*i] << ".", charT); in test_sub_match()
71 …sults<BidirectionalIterator, Allocator>& what, BidirectionalIterator base, const int* answer_table) in test_result() argument
75 test_sub_match(what[i], base, answer_table, i); in test_result()
85 const int* answer_table = test_info<charT>::answer_table(); in test_simple_search() local
94 test_result(what, search_text.begin(), answer_table); in test_simple_search()
[all …]
Dinfo.hpp89 const int* answer_table; member
128 const int* answer_table = 0, in set_info() argument
139 dat.answer_table = answer_table; in set_info()
169 static const int* answer_table() in answer_table() function in test_info_base
171 return data().answer_table; in answer_table()
Dtest_icu.cpp171 const int* answer_table = test_info<wchar_t>::answer_table(); in test_icu_grep() local
185 test_result(*start, search_text.begin(), answer_table); in test_icu_grep()
215 if(*answer_table != -2) in test_icu_grep()
216 while(*answer_table++ != -2){} in test_icu_grep()
218 if(answer_table[0] >= 0) in test_icu_grep()
266 const int* answer_table = test_info<wchar_t>::answer_table(); in test_icu() local
275 … test_result(what, const_cast<std::vector< ::UChar32>const&>(search_text).begin(), answer_table); in test_icu()
277 else if(answer_table[0] >= 0) in test_icu()
306 else if(answer_table[0] >= 0) in test_icu()
322 else if(answer_table[0] >= 0) in test_icu()
[all …]
Dtest_deprecated.cpp93 const int* results = test_info<char>::answer_table(); in test_deprecated()
156 const int* results = test_info<wchar_t>::answer_table(); in test_deprecated()