Lines Matching refs:__s
1068 string_type __s(__f, __l);
1069 return __col_->transform(__s.data(), __s.data() + __s.size());
1098 const string_type __s(__f, __l);
1099 string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
1120 const string_type __s(__f, __l);
1121 string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
1138 _LIBCPP_FUNC_VIS string __get_collation_name(const char* __s);
1146 string_type __s(__f, __l);
1148 if (!__s.empty())
1150 __r = __get_collation_name(__s.c_str());
1151 if (__r.empty() && __s.size() <= 2)
1153 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1155 __r = __s;
1169 string_type __s(__f, __l);
1171 __n.reserve(__s.size());
1172 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1180 if (!__s.empty())
1185 else if (__s.size() <= 2)
1187 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1189 __r = __s;
1199 ctype_base::mask _LIBCPP_FUNC_VIS __get_classname(const char* __s, bool __icase);
1208 string_type __s(__f, __l);
1209 __ct_->tolower(&__s[0], &__s[0] + __s.size());
1210 return __get_classname(__s.c_str(), __icase);
1220 string_type __s(__f, __l);
1221 __ct_->tolower(&__s[0], &__s[0] + __s.size());
1223 __n.reserve(__s.size());
1224 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1350 __end_state<_CharT>::__exec(__state& __s) const
1352 __s.__do_ = __state::__end_state;
1365 explicit __has_one_state(__node<_CharT>* __s)
1366 : __first_(__s) {}
1384 explicit __owns_one_state(__node<_CharT>* __s)
1385 : base(__s) {}
1408 explicit __empty_state(__node<_CharT>* __s)
1409 : base(__s) {}
1416 __empty_state<_CharT>::__exec(__state& __s) const
1418 __s.__do_ = __state::__accept_but_not_consume;
1419 __s.__node_ = this->first();
1434 explicit __empty_non_own_state(__node<_CharT>* __s)
1435 : base(__s) {}
1442 __empty_non_own_state<_CharT>::__exec(__state& __s) const
1444 __s.__do_ = __state::__accept_but_not_consume;
1445 __s.__node_ = this->first();
1460 explicit __repeat_one_loop(__node<_CharT>* __s)
1461 : base(__s) {}
1468 __repeat_one_loop<_CharT>::__exec(__state& __s) const
1470 __s.__do_ = __state::__repeat;
1471 __s.__node_ = this->first();
1532 virtual void __exec(__state& __s) const;
1533 virtual void __exec_split(bool __second, __state& __s) const;
1537 void __init_repeat(__state& __s) const
1539 __s.__loop_data_[__loop_id_].second = __s.__current_;
1542 __s.__sub_matches_[__i].first = __s.__last_;
1543 __s.__sub_matches_[__i].second = __s.__last_;
1544 __s.__sub_matches_[__i].matched = false;
1551 __loop<_CharT>::__exec(__state& __s) const
1553 if (__s.__do_ == __state::__repeat)
1555 bool __do_repeat = ++__s.__loop_data_[__loop_id_].first < __max_;
1556 bool __do_alt = __s.__loop_data_[__loop_id_].first >= __min_;
1558 __s.__loop_data_[__loop_id_].second == __s.__current_)
1561 __s.__do_ = __state::__split;
1564 __s.__do_ = __state::__accept_but_not_consume;
1565 __s.__node_ = this->first();
1566 __init_repeat(__s);
1570 __s.__do_ = __state::__accept_but_not_consume;
1571 __s.__node_ = this->second();
1576 __s.__loop_data_[__loop_id_].first = 0;
1580 __s.__do_ = __state::__split;
1583 __s.__do_ = __state::__accept_but_not_consume;
1584 __s.__node_ = this->first();
1585 __init_repeat(__s);
1589 __s.__do_ = __state::__accept_but_not_consume;
1590 __s.__node_ = this->second();
1597 __loop<_CharT>::__exec_split(bool __second, __state& __s) const
1599 __s.__do_ = __state::__accept_but_not_consume;
1602 __s.__node_ = this->first();
1603 __init_repeat(__s);
1606 __s.__node_ = this->second();
1625 virtual void __exec(__state& __s) const;
1626 virtual void __exec_split(bool __second, __state& __s) const;
1631 __alternate<_CharT>::__exec(__state& __s) const
1633 __s.__do_ = __state::__split;
1638 __alternate<_CharT>::__exec_split(bool __second, __state& __s) const
1640 __s.__do_ = __state::__accept_but_not_consume;
1642 __s.__node_ = this->second();
1644 __s.__node_ = this->first();
1660 explicit __begin_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
1661 : base(__s), __mexp_(__mexp) {}
1668 __begin_marked_subexpression<_CharT>::__exec(__state& __s) const
1670 __s.__do_ = __state::__accept_but_not_consume;
1671 __s.__sub_matches_[__mexp_-1].first = __s.__current_;
1672 __s.__node_ = this->first();
1688 explicit __end_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
1689 : base(__s), __mexp_(__mexp) {}
1696 __end_marked_subexpression<_CharT>::__exec(__state& __s) const
1698 __s.__do_ = __state::__accept_but_not_consume;
1699 __s.__sub_matches_[__mexp_-1].second = __s.__current_;
1700 __s.__sub_matches_[__mexp_-1].matched = true;
1701 __s.__node_ = this->first();
1717 explicit __back_ref(unsigned __mexp, __node<_CharT>* __s)
1718 : base(__s), __mexp_(__mexp) {}
1725 __back_ref<_CharT>::__exec(__state& __s) const
1727 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1731 if (__s.__last_ - __s.__current_ >= __len &&
1732 _VSTD::equal(__sm.first, __sm.second, __s.__current_))
1734 __s.__do_ = __state::__accept_but_not_consume;
1735 __s.__current_ += __len;
1736 __s.__node_ = this->first();
1740 __s.__do_ = __state::__reject;
1741 __s.__node_ = nullptr;
1746 __s.__do_ = __state::__reject;
1747 __s.__node_ = nullptr;
1766 __node<_CharT>* __s)
1767 : base(__s), __traits_(__traits), __mexp_(__mexp) {}
1774 __back_ref_icase<_CharT, _Traits>::__exec(__state& __s) const
1776 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1780 if (__s.__last_ - __s.__current_ >= __len)
1785 __traits_.translate_nocase(__s.__current_[__i]))
1788 __s.__do_ = __state::__accept_but_not_consume;
1789 __s.__current_ += __len;
1790 __s.__node_ = this->first();
1794 __s.__do_ = __state::__reject;
1795 __s.__node_ = nullptr;
1801 __s.__do_ = __state::__reject;
1802 __s.__node_ = nullptr;
1821 __node<_CharT>* __s)
1822 : base(__s), __traits_(__traits), __mexp_(__mexp) {}
1829 __back_ref_collate<_CharT, _Traits>::__exec(__state& __s) const
1831 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1835 if (__s.__last_ - __s.__current_ >= __len)
1840 __traits_.translate(__s.__current_[__i]))
1843 __s.__do_ = __state::__accept_but_not_consume;
1844 __s.__current_ += __len;
1845 __s.__node_ = this->first();
1849 __s.__do_ = __state::__reject;
1850 __s.__node_ = nullptr;
1856 __s.__do_ = __state::__reject;
1857 __s.__node_ = nullptr;
1876 __node<_CharT>* __s)
1877 : base(__s), __traits_(__traits), __invert_(__invert) {}
1884 __word_boundary<_CharT, _Traits>::__exec(__state& __s) const
1887 if (__s.__first_ != __s.__last_)
1889 if (__s.__current_ == __s.__last_)
1891 if (!(__s.__flags_ & regex_constants::match_not_eow))
1893 _CharT __c = __s.__current_[-1];
1898 else if (__s.__current_ == __s.__first_ &&
1899 !(__s.__flags_ & regex_constants::match_prev_avail))
1901 if (!(__s.__flags_ & regex_constants::match_not_bow))
1903 _CharT __c = *__s.__current_;
1910 _CharT __c1 = __s.__current_[-1];
1911 _CharT __c2 = *__s.__current_;
1921 __s.__do_ = __state::__accept_but_not_consume;
1922 __s.__node_ = this->first();
1926 __s.__do_ = __state::__reject;
1927 __s.__node_ = nullptr;
1943 __l_anchor(__node<_CharT>* __s)
1944 : base(__s) {}
1951 __l_anchor<_CharT>::__exec(__state& __s) const
1953 if (__s.__at_first_ && __s.__current_ == __s.__first_)
1955 __s.__do_ = __state::__accept_but_not_consume;
1956 __s.__node_ = this->first();
1960 __s.__do_ = __state::__reject;
1961 __s.__node_ = nullptr;
1977 __r_anchor(__node<_CharT>* __s)
1978 : base(__s) {}
1985 __r_anchor<_CharT>::__exec(__state& __s) const
1987 if (__s.__current_ == __s.__last_)
1989 __s.__do_ = __state::__accept_but_not_consume;
1990 __s.__node_ = this->first();
1994 __s.__do_ = __state::__reject;
1995 __s.__node_ = nullptr;
2011 __match_any(__node<_CharT>* __s)
2012 : base(__s) {}
2019 __match_any<_CharT>::__exec(__state& __s) const
2021 if (__s.__current_ != __s.__last_ && *__s.__current_ != 0)
2023 __s.__do_ = __state::__accept_and_consume;
2024 ++__s.__current_;
2025 __s.__node_ = this->first();
2029 __s.__do_ = __state::__reject;
2030 __s.__node_ = nullptr;
2046 __match_any_but_newline(__node<_CharT>* __s)
2047 : base(__s) {}
2071 __match_char(_CharT __c, __node<_CharT>* __s)
2072 : base(__s), __c_(__c) {}
2079 __match_char<_CharT>::__exec(__state& __s) const
2081 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_)
2083 __s.__do_ = __state::__accept_and_consume;
2084 ++__s.__current_;
2085 __s.__node_ = this->first();
2089 __s.__do_ = __state::__reject;
2090 __s.__node_ = nullptr;
2111 __match_char_icase(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
2112 : base(__s), __traits_(__traits), __c_(__traits.translate_nocase(__c)) {}
2119 __match_char_icase<_CharT, _Traits>::__exec(__state& __s) const
2121 if (__s.__current_ != __s.__last_ &&
2122 __traits_.translate_nocase(*__s.__current_) == __c_)
2124 __s.__do_ = __state::__accept_and_consume;
2125 ++__s.__current_;
2126 __s.__node_ = this->first();
2130 __s.__do_ = __state::__reject;
2131 __s.__node_ = nullptr;
2152 __match_char_collate(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
2153 : base(__s), __traits_(__traits), __c_(__traits.translate(__c)) {}
2160 __match_char_collate<_CharT, _Traits>::__exec(__state& __s) const
2162 if (__s.__current_ != __s.__last_ &&
2163 __traits_.translate(*__s.__current_) == __c_)
2165 __s.__do_ = __state::__accept_and_consume;
2166 ++__s.__current_;
2167 __s.__node_ = this->first();
2171 __s.__do_ = __state::__reject;
2172 __s.__node_ = nullptr;
2204 __bracket_expression(const _Traits& __traits, __node<_CharT>* __s,
2206 : base(__s), __traits_(__traits), __mask_(), __neg_mask_(),
2285 void __add_equivalence(const string_type& __s)
2286 {__equivalences_.push_back(__s);}
2297 __bracket_expression<_CharT, _Traits>::__exec(__state& __s) const
2301 if (__s.__current_ != __s.__last_)
2306 const _CharT* __next = _VSTD::next(__s.__current_);
2307 if (__next != __s.__last_)
2309 pair<_CharT, _CharT> __ch2(*__s.__current_, *__next);
2375 // test *__s.__current_ as not a digraph
2376 _CharT __ch = *__s.__current_;
2442 __s.__do_ = __state::__accept_and_consume;
2443 __s.__current_ += __consumed;
2444 __s.__node_ = this->first();
2448 __s.__do_ = __state::__reject;
2449 __s.__node_ = nullptr;
2564 basic_regex& assign(const basic_string<value_type, _ST, _SA>& __s,
2566 {return assign(__s.begin(), __s.end(), __f);}
2685 __owns_one_state<_CharT>* __s,
2690 __owns_one_state<_CharT>* __s,
2789 void __push_greedy_inf_repeat(size_t __min, __owns_one_state<_CharT>* __s,
2791 {__push_loop(__min, numeric_limits<size_t>::max(), __s,
2794 void __push_nongreedy_inf_repeat(size_t __min, __owns_one_state<_CharT>* __s,
2796 {__push_loop(__min, numeric_limits<size_t>::max(), __s,
2798 void __push_loop(size_t __min, size_t __max, __owns_one_state<_CharT>* __s,
2872 regex_search(const basic_string<_Cp, _ST, _SA>& __s,
2879 regex_search(const basic_string<_Cp, _ST, _SA>& __s,
2957 …__lookahead(const basic_regex<_CharT, _Traits>& __exp, bool __invert, __node<_CharT>* __s, unsigne…
2958 : base(__s), __exp_(__exp), __invert_(__invert), __mexp_(__mexp) {}
2965 __lookahead<_CharT, _Traits>::__exec(__state& __s) const
2968 __m.__init(1 + __exp_.mark_count(), __s.__current_, __s.__last_);
2969 bool __matched = __exp_.__match_at_start_ecma(__s.__current_, __s.__last_,
2971 __s.__flags_ | regex_constants::match_continuous,
2972 … __s.__at_first_ && __s.__current_ == __s.__first_);
2975 __s.__do_ = __state::__accept_but_not_consume;
2976 __s.__node_ = this->first();
2978 __s.__sub_matches_[__mexp_ + __i - 1] = __m.__matches_[__i];
2983 __s.__do_ = __state::__reject;
2984 __s.__node_ = nullptr;
3498 __owns_one_state<_CharT>* __s,
3506 __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3533 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end,
3548 __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3555 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end,
3571 __owns_one_state<_CharT>* __s,
3585 __push_nongreedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3588 __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3595 __push_nongreedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
3598 __push_greedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
3605 __push_loop(0, 1, __s, __mexp_begin, __mexp_end, false);
3608 __push_loop(0, 1, __s, __mexp_begin, __mexp_end);
3630 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end, false);
3633 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end);
3647 __push_nongreedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3650 __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3673 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end, false);
3676 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end);
4673 __owns_one_state<_CharT>* __s, size_t __mexp_begin, size_t __mexp_end,
4679 __s->first(), __e1.get(), __mexp_begin, __mexp_end, __greedy,
4681 __s->first() = nullptr;
4685 __s->first() = __e2.release();
4863 int compare(const sub_match& __s) const
4864 {return str().compare(__s.str());}
4866 int compare(const string_type& __s) const
4867 {return str().compare(__s);}
4869 int compare(const value_type* __s) const
4870 {return str().compare(__s);}
5401 void __init(unsigned __s,
5435 match_results<_BidirectionalIterator, _Allocator>::__init(unsigned __s,
5442 __matches_.assign(__s, __unmatched_);
5621 __state& __s = __states.back();
5622 if (__s.__node_)
5623 __s.__node_->__exec(__s);
5624 switch (__s.__do_)
5628 __m.__matches_[0].second = _VSTD::next(__first, __s.__current_ - __first);
5630 for (unsigned __i = 0; __i < __s.__sub_matches_.size(); ++__i)
5631 __m.__matches_[__i+1] = __s.__sub_matches_[__i];
5639 __state __snext = __s;
5640 __s.__node_->__exec_split(true, __s);
5686 __state& __s = __states.back();
5687 if (__s.__node_)
5688 __s.__node_->__exec(__s);
5689 switch (__s.__do_)
5692 if (!__matched || __highest_j < __s.__current_ - __s.__first_)
5693 __highest_j = __s.__current_ - __s.__first_;
5703 __states.push_front(_VSTD::move(__s));
5711 __state __snext = __s;
5712 __s.__node_->__exec_split(true, __s);
5768 __state& __s = __states.back();
5769 if (__s.__node_)
5770 __s.__node_->__exec(__s);
5771 switch (__s.__do_)
5774 if (!__matched || __highest_j < __s.__current_ - __s.__first_)
5776 __highest_j = __s.__current_ - __s.__first_;
5777 __best_state = __s;
5786 __j += __s.__current_ - __current;
5787 __current = __s.__current_;
5794 __state __snext = __s;
5795 __s.__node_->__exec_split(true, __s);
5887 basic_string<_CharT> __s(_VSTD::prev(__first, __offset), __last);
5889 bool __r = __e.__search(__s.data() + __offset, __s.data() + __s.size(), __mc, __flags);
5927 basic_string<_CharT> __s(__first, __last);
5929 return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
5966 regex_search(const basic_string<_CharT, _ST, _SA>& __s,
5971 return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
5977 regex_search(const basic_string<_CharT, _ST, _SA>& __s,
5983 bool __r = __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
5984 __m.__assign(__s.begin(), __s.end(), __mc, __flags & regex_constants::__no_update_pos);
5991 regex_search(const basic_string<_Cp, _ST, _SA>&& __s,
6041 regex_match(const basic_string<_CharT, _ST, _SA>& __s,
6046 return _VSTD::regex_match(__s.begin(), __s.end(), __m, __e, __flags);
6053 regex_match(const basic_string<_CharT, _ST, _SA>&& __s,
6071 regex_match(const basic_string<_CharT, _ST, _SA>& __s,
6075 return _VSTD::regex_match(__s.begin(), __s.end(), __e, __flags);
6538 regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
6544 _VSTD::regex_replace(back_inserter(__r), __s.begin(), __s.end(), __e,
6552 regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
6557 _VSTD::regex_replace(back_inserter(__r), __s.begin(), __s.end(), __e,
6565 regex_replace(const _CharT* __s,
6571 _VSTD::regex_replace(back_inserter(__r), __s,
6572 __s + char_traits<_CharT>::length(__s), __e,
6580 regex_replace(const _CharT* __s,
6586 _VSTD::regex_replace(back_inserter(__r), __s,
6587 __s + char_traits<_CharT>::length(__s), __e,