|
| _Alloc_traits::_S_on_swap (_M_get_Tp_allocator(), __x._M_get_Tp_allocator()) |
|
pointer | _M_allocate (size_t __n) |
|
pointer | _M_allocate_and_copy (size_type __n, _ForwardIterator __first, _ForwardIterator __last) |
|
void | _M_assign_aux (_InputIterator __first, _InputIterator __last, std::input_iterator_tag) |
|
void | _M_assign_aux (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) |
|
void | _M_assign_dispatch (_Integer __n, _Integer __val, __true_type) |
|
void | _M_assign_dispatch (_InputIterator __first, _InputIterator __last, __false_type) |
|
size_type | _M_check_len (size_type __n, const char *__s) const |
|
void | _M_deallocate (pointer __p, size_t __n) |
|
void | _M_default_append (size_type __n) |
|
void | _M_default_initialize (size_type __n) |
|
void | _M_emplace_back_aux (_Args &&...__args) |
|
iterator | _M_erase (iterator __position) |
|
iterator | _M_erase (iterator __first, iterator __last) |
|
void | _M_erase_at_end (pointer __pos) noexcept |
|
void | _M_fill_assign (size_type __n, const value_type &__val) |
|
void | _M_fill_initialize (size_type __n, const value_type &__value) |
|
void | _M_fill_insert (iterator __pos, size_type __n, const value_type &__x) |
|
_Tp_alloc_type & | _M_get_Tp_allocator () noexcept |
|
const _Tp_alloc_type & | _M_get_Tp_allocator () const noexcept |
|
void | _M_initialize_dispatch (_Integer __n, _Integer __value, __true_type) |
|
void | _M_initialize_dispatch (_InputIterator __first, _InputIterator __last, __false_type) |
|
void | _M_insert_aux (iterator __position, _Args &&...__args) |
|
void | _M_insert_dispatch (iterator __pos, _Integer __n, _Integer __val, __true_type) |
|
void | _M_insert_dispatch (iterator __pos, _InputIterator __first, _InputIterator __last, __false_type) |
|
void | _M_range_check (size_type __n) const |
|
void | _M_range_initialize (_InputIterator __first, _InputIterator __last, std::input_iterator_tag) |
|
void | _M_range_initialize (_ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) |
|
void | _M_range_insert (iterator __pos, _InputIterator __first, _InputIterator __last, std::input_iterator_tag) |
|
void | _M_range_insert (iterator __pos, _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag) |
|
bool | _M_shrink_to_fit () |
|
void | assign (size_type __n, const value_type &__val) |
|
void | assign (_InputIterator __first, _InputIterator __last) |
|
void | assign (initializer_list< value_type > __l) |
|
reference | at (size_type __n) |
|
const_reference | at (size_type __n) const |
|
reference | back () noexcept |
|
const_reference | back () const noexcept |
|
iterator | begin () noexcept |
|
size_type | capacity () const noexcept |
|
void | clear () noexcept |
|
const_reverse_iterator | crbegin () const noexcept |
|
const_reverse_iterator | crend () const noexcept |
|
sub_match< _Bi_iter > * | data () noexcept |
|
const sub_match< _Bi_iter > * | data () const noexcept |
|
iterator | emplace (const_iterator __position, _Args &&...__args) |
|
void | emplace_back (_Args &&...__args) |
|
iterator | end () noexcept |
|
reference | front () noexcept |
|
const_reference | front () const noexcept |
|
iterator | insert (const_iterator __position, const value_type &__x) |
|
iterator | insert (const_iterator __position, value_type &&__x) |
|
iterator | insert (const_iterator __position, initializer_list< value_type > __l) |
|
iterator | insert (const_iterator __position, size_type __n, const value_type &__x) |
|
iterator | insert (const_iterator __position, _InputIterator __first, _InputIterator __last) |
|
reference | operator[] (size_type __n) noexcept |
|
const_reference | operator[] (size_type __n) const noexcept |
|
void | pop_back () noexcept |
|
void | push_back (const value_type &__x) |
|
void | push_back (value_type &&__x) |
|
reverse_iterator | rbegin () noexcept |
|
const_reverse_iterator | rbegin () const noexcept |
|
reverse_iterator | rend () noexcept |
|
const_reverse_iterator | rend () const noexcept |
|
void | reserve (size_type __n) |
|
void | resize (size_type __new_size) |
|
void | resize (size_type __new_size, const value_type &__x) |
|
void | shrink_to_fit () |
|
|
These functions perform formatted substitution of the matched character sequences into their target. The format specifiers and escape sequences accepted by these functions are determined by their flags parameter as documented above.
|
template<typename _Out_iter > |
_Out_iter | format (_Out_iter __out, const char_type *__fmt_first, const char_type *__fmt_last, match_flag_type __flags=regex_constants::format_default) const |
|
template<typename _Out_iter , typename _St , typename _Sa > |
_Out_iter | format (_Out_iter __out, const basic_string< char_type, _St, _Sa > &__fmt, match_flag_type __flags=regex_constants::format_default) const |
|
template<typename _Out_iter , typename _St , typename _Sa > |
basic_string< char_type, _St, _Sa > | format (const basic_string< char_type, _St, _Sa > &__fmt, match_flag_type __flags=regex_constants::format_default) const |
|
string_type | format (const char_type *__fmt, match_flag_type __flags=regex_constants::format_default) const |
|
template<typename _Bi_iter, typename _Alloc = allocator<sub_match<_Bi_iter> >>
class std::match_results< _Bi_iter, _Alloc >
The results of a match or search operation.
A collection of character sequences representing the result of a regular expression match. Storage for the collection is allocated and freed as necessary by the member functions of class template match_results.
This class satisfies the Sequence requirements, with the exception that only the operations defined for a const-qualified Sequence are supported.
The sub_match object stored at index 0 represents sub-expression 0, i.e. the whole match. In this case the sub_match member matched is always true. The sub_match object stored at index n denotes what matched the marked sub-expression n within the matched expression. If the sub-expression n participated in a regular expression match then the sub_match member matched evaluates to true, and members first and second denote the range of characters [first, second) which formed that match. Otherwise matched is false, and members first and second point to the end of the sequence that was searched.
Definition at line 1476 of file regex.h.
template<typename _Bi_iter, typename _Alloc = allocator<sub_match<_Bi_iter> >>
difference_type std::match_results< _Bi_iter, _Alloc >::position |
( |
size_type |
__sub = 0 | ) |
const |
|
inline |
Gets the offset of the beginning of the indicated submatch.
- Parameters
-
__sub | indicates the submatch. |
- Precondition
- ready() == true
This function returns the offset from the beginning of the target sequence to the beginning of the submatch, unless the value of __sub
is zero (the default), in which case this function returns the offset from the beginning of the target sequence to the beginning of the match.
Returns -1 if __sub
is out of range.
Definition at line 1644 of file regex.h.