.TH "std::sub_match< _BiIter >" 3cxx "libstdc++" \" -*- nroff -*- .ad l .nh .SH NAME std::sub_match< _BiIter > .SH SYNOPSIS .br .PP .PP \fC#include \fP .PP Inherits \fBstd::pair< _BiIter, _BiIter >\fP\&. .SS "Public Types" .in +1c .ti -1c .RI "\fBtypedef\fP __iter_traits::difference_type \fBdifference_type\fP" .br .ti -1c .RI "\fBtypedef\fP _BiIter \fBfirst_type\fP" .br .RI "The type of the \fCfirst\fP member\&. " .ti -1c .RI "\fBtypedef\fP _BiIter \fBiterator\fP" .br .ti -1c .RI "\fBtypedef\fP _BiIter \fBsecond_type\fP" .br .RI "The type of the \fCsecond\fP member\&. " .ti -1c .RI "\fBtypedef\fP \fBbasic_string\fP< value_type > \fBstring_type\fP" .br .ti -1c .RI "\fBtypedef\fP __iter_traits::value_type \fBvalue_type\fP" .br .in -1c .SS "Public Member Functions" .in +1c .ti -1c .RI "int \fBcompare\fP (\fBconst\fP \fBsub_match\fP &\fB__s\fP) \fBconst\fP" .br .RI "Compares this and another matched sequence\&. " .ti -1c .RI "difference_type \fBlength\fP () \fBconst\fP \fBnoexcept\fP" .br .RI "Gets the length of the matching sequence\&. " .ti -1c .RI "\fBoperator string_type\fP () \fBconst\fP" .br .RI "Gets the matching sequence as a string\&. " .ti -1c .RI "\fBstring_type\fP \fBstr\fP () \fBconst\fP" .br .RI "Gets the matching sequence as a string\&. " .ti -1c .RI "\fBconstexpr\fP \fBvoid\fP \fBswap\fP (\fBpair\fP &__p) \fBnoexcept\fP(__and_< \fB__is_nothrow_swappable\fP< _BiIter >, \fB__is_nothrow_swappable\fP< _BiIter > >::value)" .br .RI "Swap the first members and then the second members\&. " .in -1c .PP .RI "\fB\fP" .br .in +1c .in +1c .ti -1c .RI "int \fBcompare\fP (\fBconst\fP \fBstring_type\fP &\fB__s\fP) \fBconst\fP" .br .RI "Compares this \fCsub_match\fP to a string\&. " .ti -1c .RI "int \fBcompare\fP (\fBconst\fP value_type *\fB__s\fP) \fBconst\fP" .br .RI "Compares this \fCsub_match\fP to a string\&. " .in -1c .in -1c .SS "Public Attributes" .in +1c .ti -1c .RI "_BiIter \fBfirst\fP" .br .RI "The first member\&. " .ti -1c .RI "bool \fBmatched\fP" .br .ti -1c .RI "_BiIter \fBsecond\fP" .br .RI "The second member\&. " .in -1c .SS "Related Symbols" (Note that these are not member symbols\&.) .in +1c .ti -1c .RI "\fBconstexpr\fP \fBpair\fP< \fBtypename\fP \fB__decay_and_strip\fP< _BiIter >::__type, \fBtypename\fP \fB__decay_and_strip\fP< _BiIter >::__type > \fBmake_pair\fP (_BiIter &&__x, _BiIter &&\fB__y\fP)" .br .RI "A convenience wrapper for creating a pair from two objects\&. " .in -1c .PP .RI "\fB\fP" .br .in +1c .in +1c .ti -1c .RI "template<\fBtypename\fP _BiIter > bool \fBoperator==\fP (\fBconst\fP \fBsub_match\fP< _BiIter > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _BiIter > &\fB__rhs\fP)" .br .RI "Tests the equivalence of two regular expression submatches\&. " .ti -1c .RI "template<\fBtypename\fP _BiIter > bool \fBoperator!=\fP (\fBconst\fP \fBsub_match\fP< _BiIter > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _BiIter > &\fB__rhs\fP)" .br .RI "Tests the inequivalence of two regular expression submatches\&. " .ti -1c .RI "template<\fBtypename\fP _BiIter > bool \fBoperator<\fP (\fBconst\fP \fBsub_match\fP< _BiIter > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _BiIter > &\fB__rhs\fP)" .br .RI "Tests the ordering of two regular expression submatches\&. " .ti -1c .RI "template<\fBtypename\fP _BiIter > bool \fBoperator<=\fP (\fBconst\fP \fBsub_match\fP< _BiIter > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _BiIter > &\fB__rhs\fP)" .br .RI "Tests the ordering of two regular expression submatches\&. " .ti -1c .RI "template<\fBtypename\fP _BiIter > bool \fBoperator>=\fP (\fBconst\fP \fBsub_match\fP< _BiIter > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _BiIter > &\fB__rhs\fP)" .br .RI "Tests the ordering of two regular expression submatches\&. " .ti -1c .RI "template<\fBtypename\fP _BiIter > bool \fBoperator>\fP (\fBconst\fP \fBsub_match\fP< _BiIter > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _BiIter > &\fB__rhs\fP)" .br .RI "Tests the ordering of two regular expression submatches\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator==\fP (\fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the equivalence of a string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator!=\fP (\fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the inequivalence of a string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator<\fP (\fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator>\fP (\fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator>=\fP (\fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator<=\fP (\fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator==\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__rhs\fP)" .br .RI "Tests the equivalence of a regular expression submatch and a string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator!=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__rhs\fP)" .br .RI "Tests the inequivalence of a regular expression submatch and a string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator<\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator>\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator>=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP \fB_Ch_alloc\fP > bool \fBoperator<=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBconst\fP \fB__sub_match_string\fP< _Bi_iter, \fB_Ch_traits\fP, \fB_Ch_alloc\fP > &\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator==\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the equivalence of a C string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator!=\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the inequivalence of a C string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator<\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a C string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator>\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a C string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator>=\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a C string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator<=\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a C string and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator==\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__rhs\fP)" .br .RI "Tests the equivalence of a regular expression submatch and a C string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator!=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__rhs\fP)" .br .RI "Tests the inequivalence of a regular expression submatch and a string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator<\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a C string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator>\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a C string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator>=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a C string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator<=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP *\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a C string\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator==\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the equivalence of a character and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator!=\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the inequivalence of a character and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator<\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a character and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator>\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a character and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator>=\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a character and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator<=\fP (\fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__lhs\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__rhs\fP)" .br .RI "Tests the ordering of a character and a regular expression submatch\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator==\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__rhs\fP)" .br .RI "Tests the equivalence of a regular expression submatch and a character\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator!=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__rhs\fP)" .br .RI "Tests the inequivalence of a regular expression submatch and a character\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator<\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a character\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator>\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a character\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator>=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a character\&. " .ti -1c .RI "template<\fBtypename\fP _Bi_iter > bool \fBoperator<=\fP (\fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__lhs\fP, \fBtypename\fP \fBiterator_traits\fP< _Bi_iter >::value_type \fBconst\fP &\fB__rhs\fP)" .br .RI "Tests the ordering of a regular expression submatch and a character\&. " .ti -1c .RI "template<\fBtypename\fP \fB_Ch_type\fP , \fBtypename\fP \fB_Ch_traits\fP , \fBtypename\fP _Bi_iter > \fBbasic_ostream\fP< \fB_Ch_type\fP, \fB_Ch_traits\fP > & \fBoperator<<\fP (\fBbasic_ostream\fP< \fB_Ch_type\fP, \fB_Ch_traits\fP > &\fB__os\fP, \fBconst\fP \fBsub_match\fP< _Bi_iter > &\fB__m\fP)" .br .RI "Inserts a matched string into an output stream\&. " .in -1c .in -1c .PP .RI "\fB\fP" .br .in +1c .in +1c .ti -1c .RI "\fBconstexpr\fP \fBenable_if\fP< __and_< \fB__is_swappable\fP< _BiIter >, \fB__is_swappable\fP< _BiIter > >::value >::type \fBswap\fP (\fBpair\fP< _BiIter, _BiIter > &__x, \fBpair\fP< _BiIter, _BiIter > &\fB__y\fP) \fBnoexcept\fP(\fBnoexcept\fP(__x\&.swap(\fB__y\fP)))" .br .ti -1c .RI "\fBconstexpr\fP bool \fBoperator==\fP (\fBconst\fP \fBpair\fP< _BiIter, _BiIter > &__x, \fBconst\fP \fBpair\fP< _BiIter, _BiIter > &\fB__y\fP)" .br .ti -1c .RI "\fBconstexpr\fP bool \fBoperator<\fP (\fBconst\fP \fBpair\fP< _BiIter, _BiIter > &__x, \fBconst\fP \fBpair\fP< _BiIter, _BiIter > &\fB__y\fP)" .br .ti -1c .RI "\fBconstexpr\fP bool \fBoperator!=\fP (\fBconst\fP \fBpair\fP< _BiIter, _BiIter > &__x, \fBconst\fP \fBpair\fP< _BiIter, _BiIter > &\fB__y\fP)" .br .RI "Uses \fCoperator==\fP to find the result\&. " .ti -1c .RI "\fBconstexpr\fP bool \fBoperator>\fP (\fBconst\fP \fBpair\fP< _BiIter, _BiIter > &__x, \fBconst\fP \fBpair\fP< _BiIter, _BiIter > &\fB__y\fP)" .br .RI "Uses \fCoperator<\fP to find the result\&. " .ti -1c .RI "\fBconstexpr\fP bool \fBoperator<=\fP (\fBconst\fP \fBpair\fP< _BiIter, _BiIter > &__x, \fBconst\fP \fBpair\fP< _BiIter, _BiIter > &\fB__y\fP)" .br .RI "Uses \fCoperator<\fP to find the result\&. " .ti -1c .RI "\fBconstexpr\fP bool \fBoperator>=\fP (\fBconst\fP \fBpair\fP< _BiIter, _BiIter > &__x, \fBconst\fP \fBpair\fP< _BiIter, _BiIter > &\fB__y\fP)" .br .RI "Uses \fCoperator<\fP to find the result\&. " .in -1c .in -1c .SH "Detailed Description" .PP .SS "template<\fBtypename\fP _BiIter> .br class std::sub_match< _BiIter >"A sequence of characters matched by a particular marked sub-expression\&. .PP An object of this class is essentially a pair of iterators marking a matched subexpression within a regular expression pattern match\&. Such objects can be converted to and compared with std::basic_string objects of a similar base character type as the pattern matched by the regular expression\&. .PP The iterators that make up the pair are the usual half-open interval referencing the actual original pattern matched\&. .SH "Member Typedef Documentation" .PP .SS "\fBtypedef\fP _BiIter \fBstd::pair\fP< _BiIter , _BiIter >::first_type\fC [inherited]\fP" .PP The type of the \fCfirst\fP member\&. .SS "\fBtypedef\fP _BiIter \fBstd::pair\fP< _BiIter , _BiIter >::second_type\fC [inherited]\fP" .PP The type of the \fCsecond\fP member\&. .SH "Member Function Documentation" .PP .SS "template<\fBtypename\fP _BiIter > int \fBstd::sub_match\fP< _BiIter >::compare (\fBconst\fP \fBstring_type\fP & __s) const\fC [inline]\fP" .PP Compares this \fCsub_match\fP to a string\&. .PP \fBParameters\fP .RS 4 \fI__s\fP A string to compare to this \fCsub_match\fP\&. .RE .PP \fBReturn values\fP .RS 4 \fInegative\fP This matched sequence will collate before \fC__s\fP\&. .br \fIzero\fP This matched sequence is equivalent to \fC__s\fP\&. .br \fIpositive\fP This matched sequence will collate after \fC__s\fP\&. .RE .PP .SS "template<\fBtypename\fP _BiIter > int \fBstd::sub_match\fP< _BiIter >::compare (\fBconst\fP \fBsub_match\fP< _BiIter > & __s) const\fC [inline]\fP" .PP Compares this and another matched sequence\&. .PP \fBParameters\fP .RS 4 \fI__s\fP Another matched sequence to compare to this one\&. .RE .PP \fBReturn values\fP .RS 4 \fInegative\fP This matched sequence will collate before \fC__s\fP\&. .br \fIzero\fP This matched sequence is equivalent to \fC__s\fP\&. .br \fIpositive\fP This matched sequence will collate after \fC__s\fP\&. .RE .PP .SS "template<\fBtypename\fP _BiIter > int \fBstd::sub_match\fP< _BiIter >::compare (\fBconst\fP value_type * __s) const\fC [inline]\fP" .PP Compares this \fCsub_match\fP to a string\&. .PP \fBParameters\fP .RS 4 \fI__s\fP A string to compare to this \fCsub_match\fP\&. .RE .PP \fBReturn values\fP .RS 4 \fInegative\fP This matched sequence will collate before \fC__s\fP\&. .br \fIzero\fP This matched sequence is equivalent to \fC__s\fP\&. .br \fIpositive\fP This matched sequence will collate after \fC__s\fP\&. .RE .PP .SS "template<\fBtypename\fP _BiIter > difference_type \fBstd::sub_match\fP< _BiIter >::length () const\fC [inline]\fP, \fC [noexcept]\fP" .PP Gets the length of the matching sequence\&. .PP References \fBstd::distance()\fP, \fBstd::pair< _BiIter, _BiIter >::first\fP, and \fBstd::pair< _BiIter, _BiIter >::second\fP\&. .SS "template<\fBtypename\fP _BiIter > \fBstd::sub_match\fP< _BiIter >::operator \fBstring_type\fP () const\fC [inline]\fP" .PP Gets the matching sequence as a string\&. .PP \fBReturns\fP .RS 4 the matching sequence as a string\&. .RE .PP This is the implicit conversion operator\&. It is identical to the str() member function except that it will want to pop up in unexpected places and cause a great deal of confusion and cursing from the unwary\&. .PP References \fBstd::sub_match< _BiIter >::str()\fP\&. .SS "template<\fBtypename\fP _BiIter > \fBstring_type\fP \fBstd::sub_match\fP< _BiIter >::str () const\fC [inline]\fP" .PP Gets the matching sequence as a string\&. .PP \fBReturns\fP .RS 4 the matching sequence as a string\&. .RE .PP .PP References \fBstd::pair< _BiIter, _BiIter >::first\fP, and \fBstd::pair< _BiIter, _BiIter >::second\fP\&. .PP Referenced by \fBstd::sub_match< _BiIter >::operator string_type()\fP\&. .SS "\fBconstexpr\fP \fBvoid\fP \fBstd::pair\fP< _BiIter , _BiIter >::swap (\fBpair\fP< _BiIter, _BiIter > & __p)\fC [inline]\fP, \fC [constexpr]\fP, \fC [noexcept]\fP, \fC [inherited]\fP" .PP Swap the first members and then the second members\&. .SH "Friends And Related Symbol Documentation" .PP .SS "\fBconstexpr\fP \fBpair\fP< \fBtypename\fP \fB__decay_and_strip\fP< _BiIter >::__type, \fBtypename\fP \fB__decay_and_strip\fP< _BiIter >::__type > make_pair (_BiIter && __x, _BiIter && __y)\fC [related]\fP" .PP A convenience wrapper for creating a pair from two objects\&. .PP \fBParameters\fP .RS 4 \fI__x\fP The first object\&. .br \fI__y\fP The second object\&. .RE .PP \fBReturns\fP .RS 4 A newly-constructed pair<> object of the appropriate type\&. .RE .PP The C++98 standard says the objects are passed by reference-to-const, but C++03 says they are passed by value (this was LWG issue #181)\&. .PP Since C++11 they have been passed by forwarding reference and then forwarded to the new members of the pair\&. To create a pair with a member of reference type, pass a \fCreference_wrapper\fP to this function\&. .SS "\fBconstexpr\fP bool operator!= (\fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __x, \fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __y)\fC [related]\fP" .PP Uses \fCoperator==\fP to find the result\&. .SS "\fBconstexpr\fP bool \fBoperator\fP< (\fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __x, \fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __y)\fC [related]\fP" Defines a lexicographical order for pairs\&. .PP For two pairs of the same type, \fCP\fP is ordered before \fCQ\fP if \fCP\&.first\fP is less than \fCQ\&.first\fP, or if \fCP\&.first\fP and \fCQ\&.first\fP are equivalent (neither is less than the other) and \fCP\&.second\fP is less than \fCQ\&.second\fP\&. .SS "\fBconstexpr\fP bool \fBoperator\fP<= (\fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __x, \fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __y)\fC [related]\fP" .PP Uses \fCoperator<\fP to find the result\&. .SS "\fBconstexpr\fP bool \fBoperator\fP== (\fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __x, \fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __y)\fC [related]\fP" Two pairs of the same type are equal iff their members are equal\&. .SS "\fBconstexpr\fP bool \fBoperator\fP> (\fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __x, \fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __y)\fC [related]\fP" .PP Uses \fCoperator<\fP to find the result\&. .SS "\fBconstexpr\fP bool \fBoperator\fP>= (\fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __x, \fBconst\fP \fBpair\fP< _BiIter , _BiIter > & __y)\fC [related]\fP" .PP Uses \fCoperator<\fP to find the result\&. .SS "\fBconstexpr\fP \fBenable_if\fP< __and_< \fB__is_swappable\fP< _BiIter >, \fB__is_swappable\fP< _BiIter > >::value >::type swap (\fBpair\fP< _BiIter , _BiIter > & __x, \fBpair\fP< _BiIter , _BiIter > & __y)\fC [related]\fP" Swap overload for pairs\&. Calls std::pair::swap()\&. .PP \fBNote\fP .RS 4 This std::swap overload is not declared in C++03 mode, which has performance implications, e\&.g\&. see https://gcc.gnu.org/PR38466 .RE .PP .SH "Member Data Documentation" .PP .SS "_BiIter \fBstd::pair\fP< _BiIter , _BiIter >::first\fC [inherited]\fP" .PP The first member\&. .SS "_BiIter \fBstd::pair\fP< _BiIter , _BiIter >::second\fC [inherited]\fP" .PP The second member\&. .SH "Author" .PP Generated automatically by Doxygen for libstdc++ from the source code\&.