Lines Matching refs:__s
1100 string_type __s(__f, __l);
1101 return __col_->transform(__s.data(), __s.data() + __s.size());
1124 const string_type __s(__f, __l);
1125 string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
1144 const string_type __s(__f, __l);
1145 string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
1162 _LIBCPP_EXPORTED_FROM_ABI string __get_collation_name(const char* __s);
1168 string_type __s(__f, __l);
1170 if (!__s.empty()) {
1171 __r = std::__get_collation_name(__s.c_str());
1172 if (__r.empty() && __s.size() <= 2) {
1173 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1175 __r = __s;
1188 string_type __s(__f, __l);
1190 __n.reserve(__s.size());
1191 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end(); __i != __e; ++__i) {
1197 if (!__s.empty()) {
1201 else if (__s.size() <= 2) {
1202 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1204 __r = __s;
1215 regex_traits<char>::char_class_type _LIBCPP_EXPORTED_FROM_ABI __get_classname(const char* __s, bool…
1221 string_type __s(__f, __l);
1222 __ct_->tolower(&__s[0], &__s[0] + __s.size());
1223 return std::__get_classname(__s.c_str(), __icase);
1231 string_type __s(__f, __l);
1232 __ct_->tolower(&__s[0], &__s[0] + __s.size());
1234 __n.reserve(__s.size());
1235 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end(); __i != __e; ++__i) {
1376 void __end_state<_CharT>::__exec(__state& __s) const {
1377 __s.__do_ = __state::__end_state;
1387 _LIBCPP_HIDE_FROM_ABI explicit __has_one_state(__node<_CharT>* __s) : __first_(__s) {}
1400 _LIBCPP_HIDE_FROM_ABI explicit __owns_one_state(__node<_CharT>* __s) : base(__s) {}
1419 _LIBCPP_HIDE_FROM_ABI explicit __empty_state(__node<_CharT>* __s) : base(__s) {}
1425 void __empty_state<_CharT>::__exec(__state& __s) const {
1426 __s.__do_ = __state::__accept_but_not_consume;
1427 __s.__node_ = this->first();
1439 _LIBCPP_HIDE_FROM_ABI explicit __empty_non_own_state(__node<_CharT>* __s) : base(__s) {}
1445 void __empty_non_own_state<_CharT>::__exec(__state& __s) const {
1446 __s.__do_ = __state::__accept_but_not_consume;
1447 __s.__node_ = this->first();
1459 _LIBCPP_HIDE_FROM_ABI explicit __repeat_one_loop(__node<_CharT>* __s) : base(__s) {}
1465 void __repeat_one_loop<_CharT>::__exec(__state& __s) const {
1466 __s.__do_ = __state::__repeat;
1467 __s.__node_ = this->first();
1525 _LIBCPP_HIDE_FROM_ABI_VIRTUAL virtual void __exec(__state& __s) const;
1526 _LIBCPP_HIDE_FROM_ABI_VIRTUAL virtual void __exec_split(bool __second, __state& __s) const;
1529 _LIBCPP_HIDE_FROM_ABI void __init_repeat(__state& __s) const {
1530 __s.__loop_data_[__loop_id_].second = __s.__current_;
1532 __s.__sub_matches_[__i].first = __s.__last_;
1533 __s.__sub_matches_[__i].second = __s.__last_;
1534 __s.__sub_matches_[__i].matched = false;
1540 void __loop<_CharT>::__exec(__state& __s) const {
1541 if (__s.__do_ == __state::__repeat) {
1542 bool __do_repeat = ++__s.__loop_data_[__loop_id_].first < __max_;
1543 bool __do_alt = __s.__loop_data_[__loop_id_].first >= __min_;
1544 if (__do_repeat && __do_alt && __s.__loop_data_[__loop_id_].second == __s.__current_)
1547 __s.__do_ = __state::__split;
1549 __s.__do_ = __state::__accept_but_not_consume;
1550 __s.__node_ = this->first();
1551 __init_repeat(__s);
1553 __s.__do_ = __state::__accept_but_not_consume;
1554 __s.__node_ = this->second();
1557 __s.__loop_data_[__loop_id_].first = 0;
1561 __s.__do_ = __state::__split;
1563 __s.__do_ = __state::__accept_but_not_consume;
1564 __s.__node_ = this->first();
1565 __init_repeat(__s);
1567 __s.__do_ = __state::__accept_but_not_consume;
1568 __s.__node_ = this->second();
1574 void __loop<_CharT>::__exec_split(bool __second, __state& __s) const {
1575 __s.__do_ = __state::__accept_but_not_consume;
1577 __s.__node_ = this->first();
1578 __init_repeat(__s);
1580 __s.__node_ = this->second();
1595 _LIBCPP_HIDE_FROM_ABI_VIRTUAL virtual void __exec(__state& __s) const;
1596 _LIBCPP_HIDE_FROM_ABI_VIRTUAL virtual void __exec_split(bool __second, __state& __s) const;
1600 void __alternate<_CharT>::__exec(__state& __s) const {
1601 __s.__do_ = __state::__split;
1605 void __alternate<_CharT>::__exec_split(bool __second, __state& __s) const {
1606 __s.__do_ = __state::__accept_but_not_consume;
1608 __s.__node_ = this->second();
1610 __s.__node_ = this->first();
1624 _LIBCPP_HIDE_FROM_ABI explicit __begin_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
1625 : base(__s), __mexp_(__mexp) {}
1631 void __begin_marked_subexpression<_CharT>::__exec(__state& __s) const {
1632 __s.__do_ = __state::__accept_but_not_consume;
1633 __s.__sub_matches_[__mexp_ - 1].first = __s.__current_;
1634 __s.__node_ = this->first();
1648 _LIBCPP_HIDE_FROM_ABI explicit __end_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
1649 : base(__s), __mexp_(__mexp) {}
1655 void __end_marked_subexpression<_CharT>::__exec(__state& __s) const {
1656 __s.__do_ = __state::__accept_but_not_consume;
1657 __s.__sub_matches_[__mexp_ - 1].second = __s.__current_;
1658 __s.__sub_matches_[__mexp_ - 1].matched = true;
1659 __s.__node_ = this->first();
1673 …_LIBCPP_HIDE_FROM_ABI explicit __back_ref(unsigned __mexp, __node<_CharT>* __s) : base(__s), __mex…
1679 void __back_ref<_CharT>::__exec(__state& __s) const {
1680 if (__mexp_ > __s.__sub_matches_.size())
1682 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_ - 1];
1685 …if (__s.__last_ - __s.__current_ >= __len && std::equal(__sm.first, __sm.second, __s.__current_)) {
1686 __s.__do_ = __state::__accept_but_not_consume;
1687 __s.__current_ += __len;
1688 __s.__node_ = this->first();
1690 __s.__do_ = __state::__reject;
1691 __s.__node_ = nullptr;
1694 __s.__do_ = __state::__reject;
1695 __s.__node_ = nullptr;
1711 …E_FROM_ABI explicit __back_ref_icase(const _Traits& __traits, unsigned __mexp, __node<_CharT>* __s)
1712 : base(__s), __traits_(__traits), __mexp_(__mexp) {}
1718 void __back_ref_icase<_CharT, _Traits>::__exec(__state& __s) const {
1719 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_ - 1];
1722 if (__s.__last_ - __s.__current_ >= __len) {
1724 …if (__traits_.translate_nocase(__sm.first[__i]) != __traits_.translate_nocase(__s.__current_[__i]))
1727 __s.__do_ = __state::__accept_but_not_consume;
1728 __s.__current_ += __len;
1729 __s.__node_ = this->first();
1731 __s.__do_ = __state::__reject;
1732 __s.__node_ = nullptr;
1736 __s.__do_ = __state::__reject;
1737 __s.__node_ = nullptr;
1753 …FROM_ABI explicit __back_ref_collate(const _Traits& __traits, unsigned __mexp, __node<_CharT>* __s)
1754 : base(__s), __traits_(__traits), __mexp_(__mexp) {}
1760 void __back_ref_collate<_CharT, _Traits>::__exec(__state& __s) const {
1761 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_ - 1];
1764 if (__s.__last_ - __s.__current_ >= __len) {
1766 if (__traits_.translate(__sm.first[__i]) != __traits_.translate(__s.__current_[__i]))
1769 __s.__do_ = __state::__accept_but_not_consume;
1770 __s.__current_ += __len;
1771 __s.__node_ = this->first();
1773 __s.__do_ = __state::__reject;
1774 __s.__node_ = nullptr;
1778 __s.__do_ = __state::__reject;
1779 __s.__node_ = nullptr;
1795 …HIDE_FROM_ABI explicit __word_boundary(const _Traits& __traits, bool __invert, __node<_CharT>* __s)
1796 : base(__s), __traits_(__traits), __invert_(__invert) {}
1802 void __word_boundary<_CharT, _Traits>::__exec(__state& __s) const {
1804 if (__s.__first_ != __s.__last_) {
1805 if (__s.__current_ == __s.__last_) {
1806 if (!(__s.__flags_ & regex_constants::match_not_eow)) {
1807 _CharT __c = __s.__current_[-1];
1810 …} else if (__s.__current_ == __s.__first_ && !(__s.__flags_ & regex_constants::match_prev_avail)) {
1811 if (!(__s.__flags_ & regex_constants::match_not_bow)) {
1812 _CharT __c = *__s.__current_;
1816 _CharT __c1 = __s.__current_[-1];
1817 _CharT __c2 = *__s.__current_;
1824 __s.__do_ = __state::__accept_but_not_consume;
1825 __s.__node_ = this->first();
1827 __s.__do_ = __state::__reject;
1828 __s.__node_ = nullptr;
1848 _LIBCPP_HIDE_FROM_ABI __l_anchor_multiline(bool __multiline, __node<_CharT>* __s)
1849 : base(__s), __multiline_(__multiline) {}
1855 void __l_anchor_multiline<_CharT>::__exec(__state& __s) const {
1856 …if (__s.__at_first_ && __s.__current_ == __s.__first_ && !(__s.__flags_ & regex_constants::match_n…
1857 __s.__do_ = __state::__accept_but_not_consume;
1858 __s.__node_ = this->first();
1859 } else if (__multiline_ && !__s.__at_first_ && std::__is_eol(*std::prev(__s.__current_))) {
1860 __s.__do_ = __state::__accept_but_not_consume;
1861 __s.__node_ = this->first();
1863 __s.__do_ = __state::__reject;
1864 __s.__node_ = nullptr;
1879 _LIBCPP_HIDE_FROM_ABI __r_anchor_multiline(bool __multiline, __node<_CharT>* __s)
1880 : base(__s), __multiline_(__multiline) {}
1886 void __r_anchor_multiline<_CharT>::__exec(__state& __s) const {
1887 if (__s.__current_ == __s.__last_ && !(__s.__flags_ & regex_constants::match_not_eol)) {
1888 __s.__do_ = __state::__accept_but_not_consume;
1889 __s.__node_ = this->first();
1890 } else if (__multiline_ && std::__is_eol(*__s.__current_)) {
1891 __s.__do_ = __state::__accept_but_not_consume;
1892 __s.__node_ = this->first();
1894 __s.__do_ = __state::__reject;
1895 __s.__node_ = nullptr;
1908 _LIBCPP_HIDE_FROM_ABI __match_any(__node<_CharT>* __s) : base(__s) {}
1914 void __match_any<_CharT>::__exec(__state& __s) const {
1915 if (__s.__current_ != __s.__last_ && *__s.__current_ != 0) {
1916 __s.__do_ = __state::__accept_and_consume;
1917 ++__s.__current_;
1918 __s.__node_ = this->first();
1920 __s.__do_ = __state::__reject;
1921 __s.__node_ = nullptr;
1934 _LIBCPP_HIDE_FROM_ABI __match_any_but_newline(__node<_CharT>* __s) : base(__s) {}
1957 _LIBCPP_HIDE_FROM_ABI __match_char(_CharT __c, __node<_CharT>* __s) : base(__s), __c_(__c) {}
1966 void __match_char<_CharT>::__exec(__state& __s) const {
1967 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_) {
1968 __s.__do_ = __state::__accept_and_consume;
1969 ++__s.__current_;
1970 __s.__node_ = this->first();
1972 __s.__do_ = __state::__reject;
1973 __s.__node_ = nullptr;
1989 _LIBCPP_HIDE_FROM_ABI __match_char_icase(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
1990 : base(__s), __traits_(__traits), __c_(__traits.translate_nocase(__c)) {}
1999 void __match_char_icase<_CharT, _Traits>::__exec(__state& __s) const {
2000 if (__s.__current_ != __s.__last_ && __traits_.translate_nocase(*__s.__current_) == __c_) {
2001 __s.__do_ = __state::__accept_and_consume;
2002 ++__s.__current_;
2003 __s.__node_ = this->first();
2005 __s.__do_ = __state::__reject;
2006 __s.__node_ = nullptr;
2022 …LIBCPP_HIDE_FROM_ABI __match_char_collate(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
2023 : base(__s), __traits_(__traits), __c_(__traits.translate(__c)) {}
2032 void __match_char_collate<_CharT, _Traits>::__exec(__state& __s) const {
2033 if (__s.__current_ != __s.__last_ && __traits_.translate(*__s.__current_) == __c_) {
2034 __s.__do_ = __state::__accept_and_consume;
2035 ++__s.__current_;
2036 __s.__node_ = this->first();
2038 __s.__do_ = __state::__reject;
2039 __s.__node_ = nullptr;
2067 …__bracket_expression(const _Traits& __traits, __node<_CharT>* __s, bool __negate, bool __icase, bo…
2068 : base(__s),
2133 …PP_HIDE_FROM_ABI void __add_equivalence(const string_type& __s) { __equivalences_.push_back(__s); }
2141 void __bracket_expression<_CharT, _Traits>::__exec(__state& __s) const {
2144 if (__s.__current_ != __s.__last_) {
2147 const _CharT* __next = std::next(__s.__current_);
2148 if (__next != __s.__last_) {
2149 pair<_CharT, _CharT> __ch2(*__s.__current_, *__next);
2196 // test *__s.__current_ as not a digraph
2197 _CharT __ch = *__s.__current_;
2249 __s.__do_ = __state::__accept_and_consume;
2250 __s.__current_ += __consumed;
2251 __s.__node_ = this->first();
2253 __s.__do_ = __state::__reject;
2254 __s.__node_ = nullptr;
2372 …assign(const basic_string<value_type, _ST, _SA>& __s, flag_type __f = regex_constants::ECMAScript)…
2373 return assign(__s.begin(), __s.end(), __f);
2462 __owns_one_state<_CharT>* __s,
2469 __owns_one_state<_CharT>* __s,
2545 … size_t __min, __owns_one_state<_CharT>* __s, unsigned __mexp_begin = 0, unsigned __mexp_end = 0) {
2546 __push_loop(__min, numeric_limits<size_t>::max(), __s, __mexp_begin, __mexp_end);
2549 … size_t __min, __owns_one_state<_CharT>* __s, unsigned __mexp_begin = 0, unsigned __mexp_end = 0) {
2550 __push_loop(__min, numeric_limits<size_t>::max(), __s, __mexp_begin, __mexp_end, false);
2554 __owns_one_state<_CharT>* __s,
2625 friend bool regex_search(const basic_string<_Cp, _ST, _SA>& __s,
2630 friend bool regex_search(const basic_string<_Cp, _ST, _SA>& __s,
2705 …__lookahead(const basic_regex<_CharT, _Traits>& __exp, bool __invert, __node<_CharT>* __s, unsigne…
2706 : base(__s), __exp_(__exp), __mexp_(__mexp), __invert_(__invert) {}
2715 void __lookahead<_CharT, _Traits>::__exec(__state& __s) const {
2717 __m.__init(1 + __exp_.mark_count(), __s.__current_, __s.__last_);
2719 __s.__current_,
2720 __s.__last_,
2722 (__s.__flags_ | regex_constants::match_continuous) & ~regex_constants::__full_match,
2723 __s.__at_first_ && __s.__current_ == __s.__first_);
2725 __s.__do_ = __state::__accept_but_not_consume;
2726 __s.__node_ = this->first();
2728 __s.__sub_matches_[__mexp_ + __i - 1] = __m.__matches_[__i];
2731 __s.__do_ = __state::__reject;
2732 __s.__node_ = nullptr;
3140 __owns_one_state<_CharT>* __s,
3145 __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3162 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end, true);
3172 __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3176 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end, true);
3191 __owns_one_state<_CharT>* __s,
3201 __push_nongreedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3203 __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3209 __push_nongreedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
3211 __push_greedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
3217 __push_loop(0, 1, __s, __mexp_begin, __mexp_end, false);
3219 __push_loop(0, 1, __s, __mexp_begin, __mexp_end);
3234 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end, false);
3236 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end);
3246 __push_nongreedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3248 __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3262 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end, false);
3264 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end);
4067 …size_t __min, size_t __max, __owns_one_state<_CharT>* __s, size_t __mexp_begin, size_t __mexp_end,…
4071 …new __loop<_CharT>(__loop_count_, __s->first(), __e1.get(), __mexp_begin, __mexp_end, __greedy, __…
4072 __s->first() = nullptr;
4076 __s->first() = __e2.release();
4212 _LIBCPP_HIDE_FROM_ABI int compare(const sub_match& __s) const { return str().compare(__s.str()); }
4213 _LIBCPP_HIDE_FROM_ABI int compare(const string_type& __s) const { return str().compare(__s); }
4214 _LIBCPP_HIDE_FROM_ABI int compare(const value_type* __s) const { return str().compare(__s); }
4216 …_LIBCPP_HIDE_FROM_ABI void swap(sub_match& __s) _NOEXCEPT_(__is_nothrow_swappable_v<_Bidirectional…
4217 this->pair<_BidirectionalIterator, _BidirectionalIterator>::swap(__s);
4218 std::swap(matched, __s.matched);
4684 …void __init(unsigned __s, _BidirectionalIterator __f, _BidirectionalIterator __l, bool __no_update…
4709 unsigned __s, _BidirectionalIterator __f, _BidirectionalIterator __l, bool __no_update_pos) {
4713 __matches_.assign(__s, __unmatched_);
4865 __state& __s = __states.back();
4866 if (__s.__node_)
4867 __s.__node_->__exec(__s);
4868 switch (__s.__do_) {
4870 if ((__flags & regex_constants::match_not_null) && __s.__current_ == __first) {
4874 if ((__flags & regex_constants::__full_match) && __s.__current_ != __last) {
4879 __m.__matches_[0].second = std::next(__first, __s.__current_ - __first);
4881 for (unsigned __i = 0; __i < __s.__sub_matches_.size(); ++__i)
4882 __m.__matches_[__i + 1] = __s.__sub_matches_[__i];
4889 __state __snext = __s;
4890 __s.__node_->__exec_split(true, __s);
4935 __state& __s = __states.back();
4936 if (__s.__node_)
4937 __s.__node_->__exec(__s);
4938 switch (__s.__do_) {
4940 if ((__flags & regex_constants::match_not_null) && __s.__current_ == __first) {
4944 if ((__flags & regex_constants::__full_match) && __s.__current_ != __last) {
4948 if (!__matched || __highest_j < __s.__current_ - __s.__first_)
4949 __highest_j = __s.__current_ - __s.__first_;
4959 __states.push_front(std::move(__s));
4966 __state __snext = __s;
4967 __s.__node_->__exec_split(true, __s);
5025 __state& __s = __states.back();
5026 if (__s.__node_)
5027 __s.__node_->__exec(__s);
5028 switch (__s.__do_) {
5030 if ((__flags & regex_constants::match_not_null) && __s.__current_ == __first) {
5034 if ((__flags & regex_constants::__full_match) && __s.__current_ != __last) {
5038 if (!__matched || __highest_j < __s.__current_ - __s.__first_) {
5039 __highest_j = __s.__current_ - __s.__first_;
5040 __best_state = __s;
5053 __state __snext = __s;
5054 __s.__node_->__exec_split(true, __s);
5145 basic_string<_CharT> __s(std::prev(__first, __offset), __last);
5147 bool __r = __e.__search(__s.data() + __offset, __s.data() + __s.size(), __mc, __flags);
5181 basic_string<_CharT> __s(__first, __last);
5183 return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
5216 regex_search(const basic_string<_CharT, _ST, _SA>& __s,
5220 return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
5225 regex_search(const basic_string<_CharT, _ST, _SA>& __s,
5230 bool __r = __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
5231 __m.__assign(__s.begin(), __s.end(), __mc, __flags & regex_constants::__no_update_pos);
5237 bool regex_search(const basic_string<_Cp, _ST, _SA>&& __s,
5283 regex_match(const basic_string<_CharT, _ST, _SA>& __s,
5287 return std::regex_match(__s.begin(), __s.end(), __m, __e, __flags);
5293 regex_match(const basic_string<_CharT, _ST, _SA>&& __s,
5309 regex_match(const basic_string<_CharT, _ST, _SA>& __s,
5312 return std::regex_match(__s.begin(), __s.end(), __e, __flags);
5759 regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
5764 std::regex_replace(std::back_inserter(__r), __s.begin(), __s.end(), __e, __fmt.c_str(), __flags);
5770 regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
5775 std::regex_replace(std::back_inserter(__r), __s.begin(), __s.end(), __e, __fmt, __flags);
5781 regex_replace(const _CharT* __s,
5786 …std::regex_replace(std::back_inserter(__r), __s, __s + char_traits<_CharT>::length(__s), __e, __fm…
5792 regex_replace(const _CharT* __s,
5797 …std::regex_replace(std::back_inserter(__r), __s, __s + char_traits<_CharT>::length(__s), __e, __fm…