Lines Matching refs:__s
1150 string_type __s(__f, __l);
1151 return __col_->transform(__s.data(), __s.data() + __s.size());
1180 const string_type __s(__f, __l);
1181 string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
1203 const string_type __s(__f, __l);
1204 string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
1222 _LIBCPP_FUNC_VIS string __get_collation_name(const char* __s);
1230 string_type __s(__f, __l);
1232 if (!__s.empty())
1234 __r = __get_collation_name(__s.c_str());
1235 if (__r.empty() && __s.size() <= 2)
1237 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1239 __r = __s;
1254 string_type __s(__f, __l);
1256 __n.reserve(__s.size());
1257 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1265 if (!__s.empty())
1270 else if (__s.size() <= 2)
1272 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1274 __r = __s;
1286 __get_classname(const char* __s, bool __icase);
1295 string_type __s(__f, __l);
1296 __ct_->tolower(&__s[0], &__s[0] + __s.size());
1297 return __get_classname(__s.c_str(), __icase);
1308 string_type __s(__f, __l);
1309 __ct_->tolower(&__s[0], &__s[0] + __s.size());
1311 __n.reserve(__s.size());
1312 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1473 __end_state<_CharT>::__exec(__state& __s) const
1475 __s.__do_ = __state::__end_state;
1488 explicit __has_one_state(__node<_CharT>* __s)
1489 : __first_(__s) {}
1507 explicit __owns_one_state(__node<_CharT>* __s)
1508 : base(__s) {}
1531 explicit __empty_state(__node<_CharT>* __s)
1532 : base(__s) {}
1539 __empty_state<_CharT>::__exec(__state& __s) const
1541 __s.__do_ = __state::__accept_but_not_consume;
1542 __s.__node_ = this->first();
1557 explicit __empty_non_own_state(__node<_CharT>* __s)
1558 : base(__s) {}
1565 __empty_non_own_state<_CharT>::__exec(__state& __s) const
1567 __s.__do_ = __state::__accept_but_not_consume;
1568 __s.__node_ = this->first();
1583 explicit __repeat_one_loop(__node<_CharT>* __s)
1584 : base(__s) {}
1591 __repeat_one_loop<_CharT>::__exec(__state& __s) const
1593 __s.__do_ = __state::__repeat;
1594 __s.__node_ = this->first();
1655 virtual void __exec(__state& __s) const;
1656 virtual void __exec_split(bool __second, __state& __s) const;
1660 void __init_repeat(__state& __s) const
1662 __s.__loop_data_[__loop_id_].second = __s.__current_;
1665 __s.__sub_matches_[__i].first = __s.__last_;
1666 __s.__sub_matches_[__i].second = __s.__last_;
1667 __s.__sub_matches_[__i].matched = false;
1674 __loop<_CharT>::__exec(__state& __s) const
1676 if (__s.__do_ == __state::__repeat)
1678 bool __do_repeat = ++__s.__loop_data_[__loop_id_].first < __max_;
1679 bool __do_alt = __s.__loop_data_[__loop_id_].first >= __min_;
1681 __s.__loop_data_[__loop_id_].second == __s.__current_)
1684 __s.__do_ = __state::__split;
1687 __s.__do_ = __state::__accept_but_not_consume;
1688 __s.__node_ = this->first();
1689 __init_repeat(__s);
1693 __s.__do_ = __state::__accept_but_not_consume;
1694 __s.__node_ = this->second();
1699 __s.__loop_data_[__loop_id_].first = 0;
1703 __s.__do_ = __state::__split;
1706 __s.__do_ = __state::__accept_but_not_consume;
1707 __s.__node_ = this->first();
1708 __init_repeat(__s);
1712 __s.__do_ = __state::__accept_but_not_consume;
1713 __s.__node_ = this->second();
1720 __loop<_CharT>::__exec_split(bool __second, __state& __s) const
1722 __s.__do_ = __state::__accept_but_not_consume;
1725 __s.__node_ = this->first();
1726 __init_repeat(__s);
1729 __s.__node_ = this->second();
1748 virtual void __exec(__state& __s) const;
1749 virtual void __exec_split(bool __second, __state& __s) const;
1754 __alternate<_CharT>::__exec(__state& __s) const
1756 __s.__do_ = __state::__split;
1761 __alternate<_CharT>::__exec_split(bool __second, __state& __s) const
1763 __s.__do_ = __state::__accept_but_not_consume;
1765 __s.__node_ = this->second();
1767 __s.__node_ = this->first();
1783 explicit __begin_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
1784 : base(__s), __mexp_(__mexp) {}
1791 __begin_marked_subexpression<_CharT>::__exec(__state& __s) const
1793 __s.__do_ = __state::__accept_but_not_consume;
1794 __s.__sub_matches_[__mexp_-1].first = __s.__current_;
1795 __s.__node_ = this->first();
1811 explicit __end_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
1812 : base(__s), __mexp_(__mexp) {}
1819 __end_marked_subexpression<_CharT>::__exec(__state& __s) const
1821 __s.__do_ = __state::__accept_but_not_consume;
1822 __s.__sub_matches_[__mexp_-1].second = __s.__current_;
1823 __s.__sub_matches_[__mexp_-1].matched = true;
1824 __s.__node_ = this->first();
1840 explicit __back_ref(unsigned __mexp, __node<_CharT>* __s)
1841 : base(__s), __mexp_(__mexp) {}
1848 __back_ref<_CharT>::__exec(__state& __s) const
1850 if (__mexp_ > __s.__sub_matches_.size())
1852 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1856 if (__s.__last_ - __s.__current_ >= __len &&
1857 _VSTD::equal(__sm.first, __sm.second, __s.__current_))
1859 __s.__do_ = __state::__accept_but_not_consume;
1860 __s.__current_ += __len;
1861 __s.__node_ = this->first();
1865 __s.__do_ = __state::__reject;
1866 __s.__node_ = nullptr;
1871 __s.__do_ = __state::__reject;
1872 __s.__node_ = nullptr;
1891 __node<_CharT>* __s)
1892 : base(__s), __traits_(__traits), __mexp_(__mexp) {}
1899 __back_ref_icase<_CharT, _Traits>::__exec(__state& __s) const
1901 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1905 if (__s.__last_ - __s.__current_ >= __len)
1910 __traits_.translate_nocase(__s.__current_[__i]))
1913 __s.__do_ = __state::__accept_but_not_consume;
1914 __s.__current_ += __len;
1915 __s.__node_ = this->first();
1919 __s.__do_ = __state::__reject;
1920 __s.__node_ = nullptr;
1926 __s.__do_ = __state::__reject;
1927 __s.__node_ = nullptr;
1946 __node<_CharT>* __s)
1947 : base(__s), __traits_(__traits), __mexp_(__mexp) {}
1954 __back_ref_collate<_CharT, _Traits>::__exec(__state& __s) const
1956 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1960 if (__s.__last_ - __s.__current_ >= __len)
1965 __traits_.translate(__s.__current_[__i]))
1968 __s.__do_ = __state::__accept_but_not_consume;
1969 __s.__current_ += __len;
1970 __s.__node_ = this->first();
1974 __s.__do_ = __state::__reject;
1975 __s.__node_ = nullptr;
1981 __s.__do_ = __state::__reject;
1982 __s.__node_ = nullptr;
2001 __node<_CharT>* __s)
2002 : base(__s), __traits_(__traits), __invert_(__invert) {}
2009 __word_boundary<_CharT, _Traits>::__exec(__state& __s) const
2012 if (__s.__first_ != __s.__last_)
2014 if (__s.__current_ == __s.__last_)
2016 if (!(__s.__flags_ & regex_constants::match_not_eow))
2018 _CharT __c = __s.__current_[-1];
2023 else if (__s.__current_ == __s.__first_ &&
2024 !(__s.__flags_ & regex_constants::match_prev_avail))
2026 if (!(__s.__flags_ & regex_constants::match_not_bow))
2028 _CharT __c = *__s.__current_;
2035 _CharT __c1 = __s.__current_[-1];
2036 _CharT __c2 = *__s.__current_;
2046 __s.__do_ = __state::__accept_but_not_consume;
2047 __s.__node_ = this->first();
2051 __s.__do_ = __state::__reject;
2052 __s.__node_ = nullptr;
2077 __l_anchor_multiline(bool __multiline, __node<_CharT>* __s)
2078 : base(__s), __multiline_(__multiline) {}
2085 __l_anchor_multiline<_CharT>::__exec(__state& __s) const
2087 if (__s.__at_first_ && __s.__current_ == __s.__first_ &&
2088 !(__s.__flags_ & regex_constants::match_not_bol))
2090 __s.__do_ = __state::__accept_but_not_consume;
2091 __s.__node_ = this->first();
2094 !__s.__at_first_ &&
2095 __is_eol(*_VSTD::prev(__s.__current_)))
2097 __s.__do_ = __state::__accept_but_not_consume;
2098 __s.__node_ = this->first();
2102 __s.__do_ = __state::__reject;
2103 __s.__node_ = nullptr;
2121 __r_anchor_multiline(bool __multiline, __node<_CharT>* __s)
2122 : base(__s), __multiline_(__multiline) {}
2129 __r_anchor_multiline<_CharT>::__exec(__state& __s) const
2131 if (__s.__current_ == __s.__last_ &&
2132 !(__s.__flags_ & regex_constants::match_not_eol))
2134 __s.__do_ = __state::__accept_but_not_consume;
2135 __s.__node_ = this->first();
2137 else if (__multiline_ && __is_eol(*__s.__current_))
2139 __s.__do_ = __state::__accept_but_not_consume;
2140 __s.__node_ = this->first();
2144 __s.__do_ = __state::__reject;
2145 __s.__node_ = nullptr;
2161 __match_any(__node<_CharT>* __s)
2162 : base(__s) {}
2169 __match_any<_CharT>::__exec(__state& __s) const
2171 if (__s.__current_ != __s.__last_ && *__s.__current_ != 0)
2173 __s.__do_ = __state::__accept_and_consume;
2174 ++__s.__current_;
2175 __s.__node_ = this->first();
2179 __s.__do_ = __state::__reject;
2180 __s.__node_ = nullptr;
2196 __match_any_but_newline(__node<_CharT>* __s)
2197 : base(__s) {}
2223 __match_char(_CharT __c, __node<_CharT>* __s)
2224 : base(__s), __c_(__c) {}
2231 __match_char<_CharT>::__exec(__state& __s) const
2233 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_)
2235 __s.__do_ = __state::__accept_and_consume;
2236 ++__s.__current_;
2237 __s.__node_ = this->first();
2241 __s.__do_ = __state::__reject;
2242 __s.__node_ = nullptr;
2263 __match_char_icase(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
2264 : base(__s), __traits_(__traits), __c_(__traits.translate_nocase(__c)) {}
2271 __match_char_icase<_CharT, _Traits>::__exec(__state& __s) const
2273 if (__s.__current_ != __s.__last_ &&
2274 __traits_.translate_nocase(*__s.__current_) == __c_)
2276 __s.__do_ = __state::__accept_and_consume;
2277 ++__s.__current_;
2278 __s.__node_ = this->first();
2282 __s.__do_ = __state::__reject;
2283 __s.__node_ = nullptr;
2304 __match_char_collate(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
2305 : base(__s), __traits_(__traits), __c_(__traits.translate(__c)) {}
2312 __match_char_collate<_CharT, _Traits>::__exec(__state& __s) const
2314 if (__s.__current_ != __s.__last_ &&
2315 __traits_.translate(*__s.__current_) == __c_)
2317 __s.__do_ = __state::__accept_and_consume;
2318 ++__s.__current_;
2319 __s.__node_ = this->first();
2323 __s.__do_ = __state::__reject;
2324 __s.__node_ = nullptr;
2356 __bracket_expression(const _Traits& __traits, __node<_CharT>* __s,
2358 : base(__s), __traits_(__traits), __mask_(), __neg_mask_(),
2435 void __add_equivalence(const string_type& __s)
2436 {__equivalences_.push_back(__s);}
2447 __bracket_expression<_CharT, _Traits>::__exec(__state& __s) const
2451 if (__s.__current_ != __s.__last_)
2456 const _CharT* __next = _VSTD::next(__s.__current_);
2457 if (__next != __s.__last_)
2459 pair<_CharT, _CharT> __ch2(*__s.__current_, *__next);
2525 // test *__s.__current_ as not a digraph
2526 _CharT __ch = *__s.__current_;
2595 __s.__do_ = __state::__accept_and_consume;
2596 __s.__current_ += __consumed;
2597 __s.__node_ = this->first();
2601 __s.__do_ = __state::__reject;
2602 __s.__node_ = nullptr;
2745 basic_regex& assign(const basic_string<value_type, _ST, _SA>& __s,
2747 {return assign(__s.begin(), __s.end(), __f);}
2868 __owns_one_state<_CharT>* __s,
2873 __owns_one_state<_CharT>* __s,
2974 void __push_greedy_inf_repeat(size_t __min, __owns_one_state<_CharT>* __s,
2976 {__push_loop(__min, numeric_limits<size_t>::max(), __s,
2979 void __push_nongreedy_inf_repeat(size_t __min, __owns_one_state<_CharT>* __s,
2981 {__push_loop(__min, numeric_limits<size_t>::max(), __s,
2983 void __push_loop(size_t __min, size_t __max, __owns_one_state<_CharT>* __s,
3057 regex_search(const basic_string<_Cp, _ST, _SA>& __s,
3064 regex_search(const basic_string<_Cp, _ST, _SA>& __s,
3151 …__lookahead(const basic_regex<_CharT, _Traits>& __exp, bool __invert, __node<_CharT>* __s, unsigne…
3152 : base(__s), __exp_(__exp), __mexp_(__mexp), __invert_(__invert) {}
3159 __lookahead<_CharT, _Traits>::__exec(__state& __s) const
3162 __m.__init(1 + __exp_.mark_count(), __s.__current_, __s.__last_);
3164 __s.__current_, __s.__last_,
3166 (__s.__flags_ | regex_constants::match_continuous) &
3168 __s.__at_first_ && __s.__current_ == __s.__first_);
3171 __s.__do_ = __state::__accept_but_not_consume;
3172 __s.__node_ = this->first();
3174 __s.__sub_matches_[__mexp_ + __i - 1] = __m.__matches_[__i];
3179 __s.__do_ = __state::__reject;
3180 __s.__node_ = nullptr;
3683 __owns_one_state<_CharT>* __s,
3691 __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3712 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end,
3725 __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3730 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end,
3746 __owns_one_state<_CharT>* __s,
3760 __push_nongreedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3763 __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3770 __push_nongreedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
3773 __push_greedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
3780 __push_loop(0, 1, __s, __mexp_begin, __mexp_end, false);
3783 __push_loop(0, 1, __s, __mexp_begin, __mexp_end);
3801 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end, false);
3804 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end);
3816 __push_nongreedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3819 __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3836 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end, false);
3839 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end);
4802 __owns_one_state<_CharT>* __s, size_t __mexp_begin, size_t __mexp_end,
4808 __s->first(), __e1.get(), __mexp_begin, __mexp_end, __greedy,
4810 __s->first() = nullptr;
4814 __s->first() = __e2.release();
5002 int compare(const sub_match& __s) const
5003 {return str().compare(__s.str());}
5005 int compare(const string_type& __s) const
5006 {return str().compare(__s);}
5008 int compare(const value_type* __s) const
5009 {return str().compare(__s);}
5574 void __init(unsigned __s,
5608 match_results<_BidirectionalIterator, _Allocator>::__init(unsigned __s,
5615 __matches_.assign(__s, __unmatched_);
5803 __state& __s = __states.back();
5804 if (__s.__node_)
5805 __s.__node_->__exec(__s);
5806 switch (__s.__do_)
5810 __s.__current_ == __first)
5816 __s.__current_ != __last)
5822 __m.__matches_[0].second = _VSTD::next(__first, __s.__current_ - __first);
5824 for (unsigned __i = 0; __i < __s.__sub_matches_.size(); ++__i)
5825 __m.__matches_[__i+1] = __s.__sub_matches_[__i];
5833 __state __snext = __s;
5834 __s.__node_->__exec_split(true, __s);
5884 __state& __s = __states.back();
5885 if (__s.__node_)
5886 __s.__node_->__exec(__s);
5887 switch (__s.__do_)
5891 __s.__current_ == __first)
5897 __s.__current_ != __last)
5902 if (!__matched || __highest_j < __s.__current_ - __s.__first_)
5903 __highest_j = __s.__current_ - __s.__first_;
5913 __states.push_front(_VSTD::move(__s));
5921 __state __snext = __s;
5922 __s.__node_->__exec_split(true, __s);
5985 __state& __s = __states.back();
5986 if (__s.__node_)
5987 __s.__node_->__exec(__s);
5988 switch (__s.__do_)
5992 __s.__current_ == __first)
5998 __s.__current_ != __last)
6003 if (!__matched || __highest_j < __s.__current_ - __s.__first_)
6005 __highest_j = __s.__current_ - __s.__first_;
6006 __best_state = __s;
6020 __state __snext = __s;
6021 __s.__node_->__exec_split(true, __s);
6114 basic_string<_CharT> __s(_VSTD::prev(__first, __offset), __last);
6116 bool __r = __e.__search(__s.data() + __offset, __s.data() + __s.size(), __mc, __flags);
6154 basic_string<_CharT> __s(__first, __last);
6156 return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
6193 regex_search(const basic_string<_CharT, _ST, _SA>& __s,
6198 return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
6204 regex_search(const basic_string<_CharT, _ST, _SA>& __s,
6210 bool __r = __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
6211 __m.__assign(__s.begin(), __s.end(), __mc, __flags & regex_constants::__no_update_pos);
6218 regex_search(const basic_string<_Cp, _ST, _SA>&& __s,
6270 regex_match(const basic_string<_CharT, _ST, _SA>& __s,
6275 return _VSTD::regex_match(__s.begin(), __s.end(), __m, __e, __flags);
6282 regex_match(const basic_string<_CharT, _ST, _SA>&& __s,
6300 regex_match(const basic_string<_CharT, _ST, _SA>& __s,
6304 return _VSTD::regex_match(__s.begin(), __s.end(), __e, __flags);
6789 regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
6795 _VSTD::regex_replace(back_inserter(__r), __s.begin(), __s.end(), __e,
6803 regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
6808 _VSTD::regex_replace(back_inserter(__r), __s.begin(), __s.end(), __e,
6816 regex_replace(const _CharT* __s,
6822 _VSTD::regex_replace(back_inserter(__r), __s,
6823 __s + char_traits<_CharT>::length(__s), __e,
6831 regex_replace(const _CharT* __s,
6837 _VSTD::regex_replace(back_inserter(__r), __s,
6838 __s + char_traits<_CharT>::length(__s), __e,