Lines Matching refs:__s
1152 string_type __s(__f, __l);
1153 return __col_->transform(__s.data(), __s.data() + __s.size());
1182 const string_type __s(__f, __l);
1183 string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
1205 const string_type __s(__f, __l);
1206 string_type __d = __col_->transform(__s.data(), __s.data() + __s.size());
1224 _LIBCPP_FUNC_VIS string __get_collation_name(const char* __s);
1232 string_type __s(__f, __l);
1234 if (!__s.empty())
1236 __r = std::__get_collation_name(__s.c_str());
1237 if (__r.empty() && __s.size() <= 2)
1239 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1241 __r = __s;
1256 string_type __s(__f, __l);
1258 __n.reserve(__s.size());
1259 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1267 if (!__s.empty())
1272 else if (__s.size() <= 2)
1274 __r = __col_->transform(__s.data(), __s.data() + __s.size());
1276 __r = __s;
1288 __get_classname(const char* __s, bool __icase);
1297 string_type __s(__f, __l);
1298 __ct_->tolower(&__s[0], &__s[0] + __s.size());
1299 return std::__get_classname(__s.c_str(), __icase);
1310 string_type __s(__f, __l);
1311 __ct_->tolower(&__s[0], &__s[0] + __s.size());
1313 __n.reserve(__s.size());
1314 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1475 __end_state<_CharT>::__exec(__state& __s) const
1477 __s.__do_ = __state::__end_state;
1490 explicit __has_one_state(__node<_CharT>* __s)
1491 : __first_(__s) {}
1509 explicit __owns_one_state(__node<_CharT>* __s)
1510 : base(__s) {}
1533 explicit __empty_state(__node<_CharT>* __s)
1534 : base(__s) {}
1541 __empty_state<_CharT>::__exec(__state& __s) const
1543 __s.__do_ = __state::__accept_but_not_consume;
1544 __s.__node_ = this->first();
1559 explicit __empty_non_own_state(__node<_CharT>* __s)
1560 : base(__s) {}
1567 __empty_non_own_state<_CharT>::__exec(__state& __s) const
1569 __s.__do_ = __state::__accept_but_not_consume;
1570 __s.__node_ = this->first();
1585 explicit __repeat_one_loop(__node<_CharT>* __s)
1586 : base(__s) {}
1593 __repeat_one_loop<_CharT>::__exec(__state& __s) const
1595 __s.__do_ = __state::__repeat;
1596 __s.__node_ = this->first();
1657 virtual void __exec(__state& __s) const;
1658 virtual void __exec_split(bool __second, __state& __s) const;
1662 void __init_repeat(__state& __s) const
1664 __s.__loop_data_[__loop_id_].second = __s.__current_;
1667 __s.__sub_matches_[__i].first = __s.__last_;
1668 __s.__sub_matches_[__i].second = __s.__last_;
1669 __s.__sub_matches_[__i].matched = false;
1676 __loop<_CharT>::__exec(__state& __s) const
1678 if (__s.__do_ == __state::__repeat)
1680 bool __do_repeat = ++__s.__loop_data_[__loop_id_].first < __max_;
1681 bool __do_alt = __s.__loop_data_[__loop_id_].first >= __min_;
1683 __s.__loop_data_[__loop_id_].second == __s.__current_)
1686 __s.__do_ = __state::__split;
1689 __s.__do_ = __state::__accept_but_not_consume;
1690 __s.__node_ = this->first();
1691 __init_repeat(__s);
1695 __s.__do_ = __state::__accept_but_not_consume;
1696 __s.__node_ = this->second();
1701 __s.__loop_data_[__loop_id_].first = 0;
1705 __s.__do_ = __state::__split;
1708 __s.__do_ = __state::__accept_but_not_consume;
1709 __s.__node_ = this->first();
1710 __init_repeat(__s);
1714 __s.__do_ = __state::__accept_but_not_consume;
1715 __s.__node_ = this->second();
1722 __loop<_CharT>::__exec_split(bool __second, __state& __s) const
1724 __s.__do_ = __state::__accept_but_not_consume;
1727 __s.__node_ = this->first();
1728 __init_repeat(__s);
1731 __s.__node_ = this->second();
1750 virtual void __exec(__state& __s) const;
1751 virtual void __exec_split(bool __second, __state& __s) const;
1756 __alternate<_CharT>::__exec(__state& __s) const
1758 __s.__do_ = __state::__split;
1763 __alternate<_CharT>::__exec_split(bool __second, __state& __s) const
1765 __s.__do_ = __state::__accept_but_not_consume;
1767 __s.__node_ = this->second();
1769 __s.__node_ = this->first();
1785 explicit __begin_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
1786 : base(__s), __mexp_(__mexp) {}
1793 __begin_marked_subexpression<_CharT>::__exec(__state& __s) const
1795 __s.__do_ = __state::__accept_but_not_consume;
1796 __s.__sub_matches_[__mexp_-1].first = __s.__current_;
1797 __s.__node_ = this->first();
1813 explicit __end_marked_subexpression(unsigned __mexp, __node<_CharT>* __s)
1814 : base(__s), __mexp_(__mexp) {}
1821 __end_marked_subexpression<_CharT>::__exec(__state& __s) const
1823 __s.__do_ = __state::__accept_but_not_consume;
1824 __s.__sub_matches_[__mexp_-1].second = __s.__current_;
1825 __s.__sub_matches_[__mexp_-1].matched = true;
1826 __s.__node_ = this->first();
1842 explicit __back_ref(unsigned __mexp, __node<_CharT>* __s)
1843 : base(__s), __mexp_(__mexp) {}
1850 __back_ref<_CharT>::__exec(__state& __s) const
1852 if (__mexp_ > __s.__sub_matches_.size())
1854 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1858 if (__s.__last_ - __s.__current_ >= __len &&
1859 _VSTD::equal(__sm.first, __sm.second, __s.__current_))
1861 __s.__do_ = __state::__accept_but_not_consume;
1862 __s.__current_ += __len;
1863 __s.__node_ = this->first();
1867 __s.__do_ = __state::__reject;
1868 __s.__node_ = nullptr;
1873 __s.__do_ = __state::__reject;
1874 __s.__node_ = nullptr;
1893 __node<_CharT>* __s)
1894 : base(__s), __traits_(__traits), __mexp_(__mexp) {}
1901 __back_ref_icase<_CharT, _Traits>::__exec(__state& __s) const
1903 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1907 if (__s.__last_ - __s.__current_ >= __len)
1912 __traits_.translate_nocase(__s.__current_[__i]))
1915 __s.__do_ = __state::__accept_but_not_consume;
1916 __s.__current_ += __len;
1917 __s.__node_ = this->first();
1921 __s.__do_ = __state::__reject;
1922 __s.__node_ = nullptr;
1928 __s.__do_ = __state::__reject;
1929 __s.__node_ = nullptr;
1948 __node<_CharT>* __s)
1949 : base(__s), __traits_(__traits), __mexp_(__mexp) {}
1956 __back_ref_collate<_CharT, _Traits>::__exec(__state& __s) const
1958 sub_match<const _CharT*>& __sm = __s.__sub_matches_[__mexp_-1];
1962 if (__s.__last_ - __s.__current_ >= __len)
1967 __traits_.translate(__s.__current_[__i]))
1970 __s.__do_ = __state::__accept_but_not_consume;
1971 __s.__current_ += __len;
1972 __s.__node_ = this->first();
1976 __s.__do_ = __state::__reject;
1977 __s.__node_ = nullptr;
1983 __s.__do_ = __state::__reject;
1984 __s.__node_ = nullptr;
2003 __node<_CharT>* __s)
2004 : base(__s), __traits_(__traits), __invert_(__invert) {}
2011 __word_boundary<_CharT, _Traits>::__exec(__state& __s) const
2014 if (__s.__first_ != __s.__last_)
2016 if (__s.__current_ == __s.__last_)
2018 if (!(__s.__flags_ & regex_constants::match_not_eow))
2020 _CharT __c = __s.__current_[-1];
2025 else if (__s.__current_ == __s.__first_ &&
2026 !(__s.__flags_ & regex_constants::match_prev_avail))
2028 if (!(__s.__flags_ & regex_constants::match_not_bow))
2030 _CharT __c = *__s.__current_;
2037 _CharT __c1 = __s.__current_[-1];
2038 _CharT __c2 = *__s.__current_;
2048 __s.__do_ = __state::__accept_but_not_consume;
2049 __s.__node_ = this->first();
2053 __s.__do_ = __state::__reject;
2054 __s.__node_ = nullptr;
2079 __l_anchor_multiline(bool __multiline, __node<_CharT>* __s)
2080 : base(__s), __multiline_(__multiline) {}
2087 __l_anchor_multiline<_CharT>::__exec(__state& __s) const
2089 if (__s.__at_first_ && __s.__current_ == __s.__first_ &&
2090 !(__s.__flags_ & regex_constants::match_not_bol))
2092 __s.__do_ = __state::__accept_but_not_consume;
2093 __s.__node_ = this->first();
2096 !__s.__at_first_ &&
2097 std::__is_eol(*_VSTD::prev(__s.__current_)))
2099 __s.__do_ = __state::__accept_but_not_consume;
2100 __s.__node_ = this->first();
2104 __s.__do_ = __state::__reject;
2105 __s.__node_ = nullptr;
2123 __r_anchor_multiline(bool __multiline, __node<_CharT>* __s)
2124 : base(__s), __multiline_(__multiline) {}
2131 __r_anchor_multiline<_CharT>::__exec(__state& __s) const
2133 if (__s.__current_ == __s.__last_ &&
2134 !(__s.__flags_ & regex_constants::match_not_eol))
2136 __s.__do_ = __state::__accept_but_not_consume;
2137 __s.__node_ = this->first();
2139 else if (__multiline_ && std::__is_eol(*__s.__current_))
2141 __s.__do_ = __state::__accept_but_not_consume;
2142 __s.__node_ = this->first();
2146 __s.__do_ = __state::__reject;
2147 __s.__node_ = nullptr;
2163 __match_any(__node<_CharT>* __s)
2164 : base(__s) {}
2171 __match_any<_CharT>::__exec(__state& __s) const
2173 if (__s.__current_ != __s.__last_ && *__s.__current_ != 0)
2175 __s.__do_ = __state::__accept_and_consume;
2176 ++__s.__current_;
2177 __s.__node_ = this->first();
2181 __s.__do_ = __state::__reject;
2182 __s.__node_ = nullptr;
2198 __match_any_but_newline(__node<_CharT>* __s)
2199 : base(__s) {}
2225 __match_char(_CharT __c, __node<_CharT>* __s)
2226 : base(__s), __c_(__c) {}
2233 __match_char<_CharT>::__exec(__state& __s) const
2235 if (__s.__current_ != __s.__last_ && *__s.__current_ == __c_)
2237 __s.__do_ = __state::__accept_and_consume;
2238 ++__s.__current_;
2239 __s.__node_ = this->first();
2243 __s.__do_ = __state::__reject;
2244 __s.__node_ = nullptr;
2265 __match_char_icase(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
2266 : base(__s), __traits_(__traits), __c_(__traits.translate_nocase(__c)) {}
2273 __match_char_icase<_CharT, _Traits>::__exec(__state& __s) const
2275 if (__s.__current_ != __s.__last_ &&
2276 __traits_.translate_nocase(*__s.__current_) == __c_)
2278 __s.__do_ = __state::__accept_and_consume;
2279 ++__s.__current_;
2280 __s.__node_ = this->first();
2284 __s.__do_ = __state::__reject;
2285 __s.__node_ = nullptr;
2306 __match_char_collate(const _Traits& __traits, _CharT __c, __node<_CharT>* __s)
2307 : base(__s), __traits_(__traits), __c_(__traits.translate(__c)) {}
2314 __match_char_collate<_CharT, _Traits>::__exec(__state& __s) const
2316 if (__s.__current_ != __s.__last_ &&
2317 __traits_.translate(*__s.__current_) == __c_)
2319 __s.__do_ = __state::__accept_and_consume;
2320 ++__s.__current_;
2321 __s.__node_ = this->first();
2325 __s.__do_ = __state::__reject;
2326 __s.__node_ = nullptr;
2358 __bracket_expression(const _Traits& __traits, __node<_CharT>* __s,
2360 : base(__s), __traits_(__traits), __mask_(), __neg_mask_(),
2437 void __add_equivalence(const string_type& __s)
2438 {__equivalences_.push_back(__s);}
2449 __bracket_expression<_CharT, _Traits>::__exec(__state& __s) const
2453 if (__s.__current_ != __s.__last_)
2458 const _CharT* __next = _VSTD::next(__s.__current_);
2459 if (__next != __s.__last_)
2461 pair<_CharT, _CharT> __ch2(*__s.__current_, *__next);
2527 // test *__s.__current_ as not a digraph
2528 _CharT __ch = *__s.__current_;
2597 __s.__do_ = __state::__accept_and_consume;
2598 __s.__current_ += __consumed;
2599 __s.__node_ = this->first();
2603 __s.__do_ = __state::__reject;
2604 __s.__node_ = nullptr;
2747 basic_regex& assign(const basic_string<value_type, _ST, _SA>& __s,
2749 {return assign(__s.begin(), __s.end(), __f);}
2870 __owns_one_state<_CharT>* __s,
2875 __owns_one_state<_CharT>* __s,
2976 void __push_greedy_inf_repeat(size_t __min, __owns_one_state<_CharT>* __s,
2978 {__push_loop(__min, numeric_limits<size_t>::max(), __s,
2981 void __push_nongreedy_inf_repeat(size_t __min, __owns_one_state<_CharT>* __s,
2983 {__push_loop(__min, numeric_limits<size_t>::max(), __s,
2985 void __push_loop(size_t __min, size_t __max, __owns_one_state<_CharT>* __s,
3059 regex_search(const basic_string<_Cp, _ST, _SA>& __s,
3066 regex_search(const basic_string<_Cp, _ST, _SA>& __s,
3153 …__lookahead(const basic_regex<_CharT, _Traits>& __exp, bool __invert, __node<_CharT>* __s, unsigne…
3154 : base(__s), __exp_(__exp), __mexp_(__mexp), __invert_(__invert) {}
3161 __lookahead<_CharT, _Traits>::__exec(__state& __s) const
3164 __m.__init(1 + __exp_.mark_count(), __s.__current_, __s.__last_);
3166 __s.__current_, __s.__last_,
3168 (__s.__flags_ | regex_constants::match_continuous) &
3170 __s.__at_first_ && __s.__current_ == __s.__first_);
3173 __s.__do_ = __state::__accept_but_not_consume;
3174 __s.__node_ = this->first();
3176 __s.__sub_matches_[__mexp_ + __i - 1] = __m.__matches_[__i];
3181 __s.__do_ = __state::__reject;
3182 __s.__node_ = nullptr;
3685 __owns_one_state<_CharT>* __s,
3693 __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3714 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end,
3727 __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3732 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end,
3748 __owns_one_state<_CharT>* __s,
3762 __push_nongreedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3765 __push_greedy_inf_repeat(0, __s, __mexp_begin, __mexp_end);
3772 __push_nongreedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
3775 __push_greedy_inf_repeat(1, __s, __mexp_begin, __mexp_end);
3782 __push_loop(0, 1, __s, __mexp_begin, __mexp_end, false);
3785 __push_loop(0, 1, __s, __mexp_begin, __mexp_end);
3803 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end, false);
3806 __push_loop(__min, __min, __s, __mexp_begin, __mexp_end);
3818 __push_nongreedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3821 __push_greedy_inf_repeat(__min, __s, __mexp_begin, __mexp_end);
3838 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end, false);
3841 __push_loop(__min, __max, __s, __mexp_begin, __mexp_end);
4804 __owns_one_state<_CharT>* __s, size_t __mexp_begin, size_t __mexp_end,
4810 __s->first(), __e1.get(), __mexp_begin, __mexp_end, __greedy,
4812 __s->first() = nullptr;
4816 __s->first() = __e2.release();
5004 int compare(const sub_match& __s) const
5005 {return str().compare(__s.str());}
5007 int compare(const string_type& __s) const
5008 {return str().compare(__s);}
5010 int compare(const value_type* __s) const
5011 {return str().compare(__s);}
5576 void __init(unsigned __s,
5610 match_results<_BidirectionalIterator, _Allocator>::__init(unsigned __s,
5617 __matches_.assign(__s, __unmatched_);
5805 __state& __s = __states.back();
5806 if (__s.__node_)
5807 __s.__node_->__exec(__s);
5808 switch (__s.__do_)
5812 __s.__current_ == __first)
5818 __s.__current_ != __last)
5824 __m.__matches_[0].second = _VSTD::next(__first, __s.__current_ - __first);
5826 for (unsigned __i = 0; __i < __s.__sub_matches_.size(); ++__i)
5827 __m.__matches_[__i+1] = __s.__sub_matches_[__i];
5835 __state __snext = __s;
5836 __s.__node_->__exec_split(true, __s);
5886 __state& __s = __states.back();
5887 if (__s.__node_)
5888 __s.__node_->__exec(__s);
5889 switch (__s.__do_)
5893 __s.__current_ == __first)
5899 __s.__current_ != __last)
5904 if (!__matched || __highest_j < __s.__current_ - __s.__first_)
5905 __highest_j = __s.__current_ - __s.__first_;
5915 __states.push_front(_VSTD::move(__s));
5923 __state __snext = __s;
5924 __s.__node_->__exec_split(true, __s);
5987 __state& __s = __states.back();
5988 if (__s.__node_)
5989 __s.__node_->__exec(__s);
5990 switch (__s.__do_)
5994 __s.__current_ == __first)
6000 __s.__current_ != __last)
6005 if (!__matched || __highest_j < __s.__current_ - __s.__first_)
6007 __highest_j = __s.__current_ - __s.__first_;
6008 __best_state = __s;
6022 __state __snext = __s;
6023 __s.__node_->__exec_split(true, __s);
6116 basic_string<_CharT> __s(_VSTD::prev(__first, __offset), __last);
6118 bool __r = __e.__search(__s.data() + __offset, __s.data() + __s.size(), __mc, __flags);
6156 basic_string<_CharT> __s(__first, __last);
6158 return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
6195 regex_search(const basic_string<_CharT, _ST, _SA>& __s,
6200 return __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
6206 regex_search(const basic_string<_CharT, _ST, _SA>& __s,
6212 bool __r = __e.__search(__s.data(), __s.data() + __s.size(), __mc, __flags);
6213 __m.__assign(__s.begin(), __s.end(), __mc, __flags & regex_constants::__no_update_pos);
6220 regex_search(const basic_string<_Cp, _ST, _SA>&& __s,
6272 regex_match(const basic_string<_CharT, _ST, _SA>& __s,
6277 return _VSTD::regex_match(__s.begin(), __s.end(), __m, __e, __flags);
6284 regex_match(const basic_string<_CharT, _ST, _SA>&& __s,
6302 regex_match(const basic_string<_CharT, _ST, _SA>& __s,
6306 return _VSTD::regex_match(__s.begin(), __s.end(), __e, __flags);
6791 regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
6797 _VSTD::regex_replace(std::back_inserter(__r), __s.begin(), __s.end(), __e,
6805 regex_replace(const basic_string<_CharT, _ST, _SA>& __s,
6810 _VSTD::regex_replace(std::back_inserter(__r), __s.begin(), __s.end(), __e,
6818 regex_replace(const _CharT* __s,
6824 _VSTD::regex_replace(std::back_inserter(__r), __s,
6825 __s + char_traits<_CharT>::length(__s), __e,
6833 regex_replace(const _CharT* __s,
6839 _VSTD::regex_replace(std::back_inserter(__r), __s,
6840 __s + char_traits<_CharT>::length(__s), __e,