2.9 KiB
[re.general]
28 Text processing library [text]
28.6 Regular expressions library [re]
28.6.1 General [re.general]
Subclause [re] describes components that C++ programs may use to perform operations involving regular expression matching and searching.
The following subclauses describe a basic regular expression class template and its traits that can handle char-like ([strings.general]) template arguments, two specializations of this class template that handle sequences of char and wchar_t, a class template that holds the result of a regular expression match, a series of algorithms that allow a character sequence to be operated upon by a regular expression, and two iterator types for enumerating regular expression matches, as summarized in Table 117.
Table 117 — Regular expressions library summary [tab:re.summary]
| ð | Subclause | Header |
|---|---|---|
| ð [re.req] |
Requirements | |
| ð [re.const] |
Constants | |
| ð [re.badexp] |
Exception type | |
| ð [re.traits] |
Traits | |
| ð [re.regex] |
Regular expression template | |
| ð [re.submatch] |
Submatches | |
| ð [re.results] |
Match results | |
| ð [re.alg] |
Algorithms | |
| ð [re.iter] |
Iterators | |
| ð [re.grammar] |
Grammar |
The ECMAScript Language Specification described in Standard Ecma-262 is called ECMA-262 in this Clause.