Q. I can't get regex++ to work with escape
@@ -115,10 +115,10 @@
throw specifications, others support them but with reduced efficiency. Throw
specifications may be added at a later date as compilers begin to handle
this better. The library should throw only three types of exception: [boost::regex_error]
- can be thrown by basic_regex when compiling a regular
+ can be thrown by basic_regex when compiling a regular
expression, std::runtime_error can be thrown when a call
to basic_regex::imbue tries to open a message catalogue
- that doesn't exist, or when a call to regex_search or regex_match results in an "everlasting"
+ that doesn't exist, or when a call to regex_search or regex_match results in an "everlasting"
search, or when a call to RegEx::GrepFiles
or RegEx::FindFiles tries to open a file that cannot
be opened, finally std::bad_alloc can be thrown by just about any
diff --git a/doc/html/boost_regex/background_information/futher.html b/doc/html/boost_regex/background_information/futher.html
index 8ce07356..6573efe2 100644
--- a/doc/html/boost_regex/background_information/futher.html
+++ b/doc/html/boost_regex/background_information/futher.html
@@ -3,7 +3,7 @@
References and Further Information
-
+
@@ -24,7 +24,7 @@
There are two main headers used by this library: <boost/regex.hpp>
@@ -34,7 +34,7 @@
There is also a header containing only forward declarations <boost/regex_fwd.hpp>
- for use when an interface is dependent upon basic_regex, but otherwise does
+ for use when an interface is dependent upon basic_regex, but otherwise does
not need the full definitions.
Boost.Regex provides extensive support for run-time localization, the localization
@@ -58,14 +58,14 @@
There are three separate localization mechanisms supported by Boost.Regex:
This is the default model when the library is compiled under Win32, and is
encapsulated by the traits class w32_regex_traits.
- When this model is in effect each basic_regex object gets it's own
+ When this model is in effect each basic_regex object gets it's own
LCID, by default this is the users default setting as returned by GetUserDefaultLCID,
but you can call imbue on the basic_regex
object to set it's locale to some other LCID if you wish. All the settings
@@ -74,8 +74,7 @@
a string table with the user-defined strings. The traits class exports the
function:
This model is the default for non-Windows compilers.
- When this model is in effect each instance of basic_regex has its own instance
- of std::locale, class basic_regex also has a member function
+ When this model is in effect each instance of basic_regex has its own instance
+ of std::locale, class basic_regex also has a member function
imbue which allows the locale
for the expression to be set on a per-instance basis. Front end localization
requires a POSIX message catalogue, which will be loaded via the std::messages
facet of the expression's locale, the traits class exports the symbol:
which needs to be called with a string identifying the name of the message
catalogue, before your code compiles any regular expressions (but not necessarily
before you construct any basic_regex instances):
Note that calling basic_regex<>::imbue
- will invalidate any expression currently compiled in that instance of basic_regex.
+ will invalidate any expression currently compiled in that instance of basic_regex.
Finally note that if you build the library with a non-default localization
@@ -155,8 +151,8 @@
in your code. The best way to ensure this is to add the #define to <boost/regex/user.hpp>.
The performance of Boost.Regex in both recursive and non-recursive modes
diff --git a/doc/html/boost_regex/background_information/redist.html b/doc/html/boost_regex/background_information/redist.html
index 4de0859a..a4c2158a 100644
--- a/doc/html/boost_regex/background_information/redist.html
+++ b/doc/html/boost_regex/background_information/redist.html
@@ -3,7 +3,7 @@
If you are using Microsoft or Borland C++ and link to a dll version of the
diff --git a/doc/html/boost_regex/background_information/standards.html b/doc/html/boost_regex/background_information/standards.html
index e680d1c1..db70edb4 100644
--- a/doc/html/boost_regex/background_information/standards.html
+++ b/doc/html/boost_regex/background_information/standards.html
@@ -3,7 +3,7 @@
@@ -34,26 +34,26 @@
support is turned on in your compiler.
- Class basic_regex
+ Class basic_regex
and its typedefs regex and wregex are thread safe, in that compiled regular
expressions can safely be shared between threads. The matching algorithms
- regex_match,
- regex_search,
- and regex_replace
- are all re-entrant and thread safe. Class match_results is now thread safe,
+ regex_match,
+ regex_search,
+ and regex_replace
+ are all re-entrant and thread safe. Class match_results is now thread safe,
in that the results of a match can be safely copied from one thread to another
- (for example one thread may find matches and push match_results instances onto a queue,
+ (for example one thread may find matches and push match_results instances onto a queue,
while another thread pops them off the other end), otherwise use a separate
- instance of match_results
+ instance of match_results
per thread.
- The POSIX API functions are
+ The POSIX API functions are
all re-entrant and thread safe, regular expressions compiled with regcomp
can also be shared between threads.
- The class
+ The class
RegEx is only thread safe if each thread gets its own RegEx instance
(apartment threading) - this is a consequence of RegEx handling both compiling
and matching regular expressions.
diff --git a/doc/html/boost_regex/captures.html b/doc/html/boost_regex/captures.html
index 5c4ecb1d..9d48399d 100644
--- a/doc/html/boost_regex/captures.html
+++ b/doc/html/boost_regex/captures.html
@@ -3,7 +3,7 @@
Every time a Perl regular expression contains a parenthesis group (), it spits out an extra field, known as a
@@ -131,11 +131,10 @@
- In Boost.Regex all these are accessible via the match_results class that gets filled
- in when calling one of the regular expression matching algorithms ( regex_search, regex_match, or regex_iterator). So given:
+ In Boost.Regex all these are accessible via the match_results class that gets filled
+ in when calling one of the regular expression matching algorithms ( regex_search, regex_match, or regex_iterator). So given:
-
-boost::match_results<IteratorType>m;
+
boost::match_results<IteratorType>m;
The Perl and Boost.Regex equivalents are as follows:
@@ -209,18 +208,18 @@
- In Boost.Regex each sub-expression match is represented by a sub_match object, this is basically
+ In Boost.Regex each sub-expression match is represented by a sub_match object, this is basically
just a pair of iterators denoting the start and end position of the sub-expression
match, but there are some additional operators provided so that objects of
- type sub_match
+ type sub_match
behave a lot like a std::basic_string: for example they are implicitly
convertible to a basic_string,
they can be compared to a string, added to a string, or streamed out to an
output stream.
When a regular expression match is found there is no need for all of the marked
@@ -232,8 +231,8 @@
you can determine which sub-expressions matched by accessing the sub_match::matched data member.
When a marked sub-expression is repeated, then the sub-expression gets "captured"
@@ -256,8 +255,7 @@
the regular expression matching. The following example program shows how this
information may be used:
You shouldn't need to do anything special to configure Boost.Regex for use
diff --git a/doc/html/boost_regex/configuration/linkage.html b/doc/html/boost_regex/configuration/linkage.html
index f773537b..511dc37c 100644
--- a/doc/html/boost_regex/configuration/linkage.html
+++ b/doc/html/boost_regex/configuration/linkage.html
@@ -3,7 +3,7 @@
The following option applies only if BOOST_REGEX_RECURSIVE is set.
diff --git a/doc/html/boost_regex/format.html b/doc/html/boost_regex/format.html
index 6aefc96e..22d67e10 100644
--- a/doc/html/boost_regex/format.html
+++ b/doc/html/boost_regex/format.html
@@ -3,7 +3,7 @@
Search and Replace Format String Syntax
-
+
@@ -24,7 +24,7 @@
Alternatively, when the flag format_literal
diff --git a/doc/html/boost_regex/format/boost_format_syntax.html b/doc/html/boost_regex/format/boost_format_syntax.html
index 842bb55f..cb22bcda 100644
--- a/doc/html/boost_regex/format/boost_format_syntax.html
+++ b/doc/html/boost_regex/format/boost_format_syntax.html
@@ -3,7 +3,7 @@
Boost-Extended Format String Syntax
-
+
@@ -24,7 +24,7 @@
When you extract the library from its zip file, you must preserve its internal
@@ -49,8 +49,8 @@
file before you can use it, instructions for specific platforms are as follows:
You can build with gcc using the normal boost Jamfile in <boost>/libs/regex/build, alternatively
@@ -302,8 +302,8 @@
see the config library documentation.
There is a makefile for the sun (6.1) compiler (C++ version 3.12). From the
@@ -347,8 +347,8 @@
will build v9 variants of the regex library named libboost_regex_v9.a etc.
- The class basic_regex
+ The class basic_regex
is the key class in this library; it represents a "machine readable"
regular expression, and is very closely modeled on std::basic_string,
think of it as a string plus the actual state-machine required by the regular
@@ -47,8 +47,7 @@
there are two typedefs that are almost always the means by which this class
is referenced:
-
-namespaceboost{
+
namespaceboost{template<classcharT,classtraits=regex_traits<charT>>
@@ -86,8 +85,7 @@
Now let's take that expression and place it in some C++ code to validate the
format of a credit card number:
-
-boolvalidate_card_format(conststd::string&s)
+
boolvalidate_card_format(conststd::string&s){staticconstboost::regexe("(\\d{4}[- ]){3}\\d{4}");returnregex_match(s,e);
@@ -112,11 +110,10 @@
the utilities sed and Perl will already be ahead here; we need two strings
- one a regular expression - the other a "format string" that provides
a description of the text to replace the match with. In Boost.Regex this search
- and replace operation is performed with the algorithm regex_replace, for our credit card
+ and replace operation is performed with the algorithm regex_replace, for our credit card
example we can write two algorithms like this to provide the format conversions:
-
-// match any format with the regular expression:
+
// match any format with the regular expression:
constboost::regexe("\\A(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})\\z");conststd::stringmachine_format("\\1\\2\\3\\4");conststd::stringhuman_format("\\1-\\2-\\3-\\4");
@@ -141,11 +138,10 @@
expression match, however in general the result of a match contains a number
of sub-expression matches in addition to the overall match. When the library
needs to report a regular expression match it does so using an instance of
- the class match_results,
+ the class match_results,
as before there are typedefs of this class for the most common cases:
-
- The algorithms regex_search
- and regex_match
- make use of match_results
- to report what matched; the difference between these algorithms is that regex_match
+ The algorithms regex_search
+ and regex_match
+ make use of match_results
+ to report what matched; the difference between these algorithms is that regex_match
will only find matches that consume all of the input text,
- where as regex_search
+ where as regex_search
will search for a match anywhere within the text being matched.
@@ -169,21 +165,21 @@
of seamlessly searching almost any kind of data.
- For search and replace operations, in addition to the algorithm regex_replace that we have already
- seen, the match_results
+ For search and replace operations, in addition to the algorithm regex_replace that we have already
+ seen, the match_results
class has a format member that
takes the result of a match and a format string, and produces a new string
by merging the two.
For iterating through all occurences of an expression within a text, there
- are two iterator types: regex_iterator will enumerate over
- the match_results
- objects found, while regex_token_iterator will enumerate
+ are two iterator types: regex_iterator will enumerate over
+ the match_results
+ objects found, while regex_token_iterator will enumerate
a series of strings (similar to perl style split operations).
- For those that dislike templates, there is a high level wrapper class RegEx
+ For those that dislike templates, there is a high level wrapper class RegEx
that is an encapsulation of the lower level template code - it provides a simplified
interface for those that don't need the full power of the library, and supports
only narrow characters, and the "extended" regular expression syntax.
@@ -191,12 +187,12 @@
C++ standard library proposal.
- The POSIX API functions: regcomp, regexec, regfree and [regerr], are available
+ The POSIX API functions: regcomp, regexec, regfree and [regerr], are available
in both narrow character and Unicode versions, and are provided for those who
need compatibility with these API's.
- Finally, note that the library now has run-time
+ Finally, note that the library now has run-time
localization support, and recognizes the full POSIX regular expression
syntax - including advanced features like multi-character collating elements
and equivalence classes - as well as providing compatibility with other regular
diff --git a/doc/html/boost_regex/partial_matches.html b/doc/html/boost_regex/partial_matches.html
index 20cce870..0543b089 100644
--- a/doc/html/boost_regex/partial_matches.html
+++ b/doc/html/boost_regex/partial_matches.html
@@ -3,7 +3,7 @@
- The match_flag_type
+ The match_flag_typematch_partial can be passed
- to the following algorithms: regex_match, regex_search, and regex_grep, and used with the iterator
- regex_iterator.
+ to the following algorithms: regex_match, regex_search, and regex_grep, and used with the iterator
+ regex_iterator.
When used it indicates that partial as well as full matches should be found.
A partial match is one that matched one or more characters at the end of the
text input, but did not match all of the regular expression (although it may
@@ -40,9 +40,9 @@
into memory (or even into a memory mapped file), or are of indeterminate length
(for example the source may be a socket or similar). Partial and full matches
can be differentiated as shown in the following table (the variable M represents
- an instance of match_results as filled in by regex_match,
- regex_search
- or regex_grep):
+ an instance of match_results as filled in by regex_match,
+ regex_search
+ or regex_grep):
@@ -192,8 +192,7 @@
the input could never become a valid number, and the inputted character must
be discarded, and a suitable error indication displayed to the user.
-
-#include<string>
+
#include<string>#include<iostream>#include<boost/regex.hpp>
@@ -228,8 +227,7 @@
if a partial match was encountered, then the partial match gets searched a
second time as the start of the next batch of text:
-
The class regex_error defines
the type of objects thrown as exceptions to report errors during the conversion
from a string representing a regular expression to a finite state machine.
For ease of use there are two typedefs that define the two standard basic_regex instances, unless you want
to use custom traits classes or non-standard character types (for example
- see unicode support),
+ see unicode support),
you won't need to use anything other than these:
-
-namespaceboost{
+
namespaceboost{template<classcharT,classtraits=regex_traits<charT>>classbasic_regex;
@@ -74,8 +72,7 @@
follows: it is based very closely on class basic_string,
and fulfils the requirements for a constant-container of charT.
-
- The meaning of these options is documented in the syntax_option_type section.
+ The meaning of these options is documented in the syntax_option_type section.
The static constant members are provided as synonyms for the constants declared
in namespace boost::regex_constants; for each constant of type
- syntax_option_type
+ syntax_option_type
declared in namespace boost::regex_constants
then a constant with the same name, type and value is declared within the
scope of basic_regex.
-
-basic_regex();
+
basic_regex();
Effects: Constructs an object of class
basic_regex.
-
Table 1. basic_regex default construction postconditions
+
Table 1. basic_regex default construction postconditions
Effects: Constructs an object of class
- basic_regex;
+ basic_regex;
the object's internal finite state machine is constructed from the regular
expression contained in the sequence of characters [p1,p2), and interpreted
- according the option flags
+ according the option flags
specified in f.
-
Table 3. Postconditions for basic_regex construction
+
Table 3. Postconditions for basic_regex construction
Requires: p shall not
@@ -611,19 +603,19 @@
max_size().
- Throws: bad_expression if p
+ Throws: bad_expression if p
is not a valid regular expression, unless the flag no_except
is set in f.
Effects: Constructs an object of class
- basic_regex;
+ basic_regex;
the object's internal finite state machine is constructed from the regular
expression contained in the sequence of characters [p, p+len), and interpreted
according the option flags specified in f.
-
Table 4. Postconditions for basic_regex construction
+
Table 4. Postconditions for basic_regex construction
@@ -707,36 +699,34 @@
-
-basic_regex(constbasic_regex&e);
+
basic_regex(constbasic_regex&e);
Effects: Constructs an object of class
- basic_regex
+ basic_regex
as a copy of the object e.
- Throws: bad_expression if s
+ Throws: bad_expression if s
is not a valid regular expression, unless the flag no_except
is set in f.
Effects: Constructs an object of class
- basic_regex;
+ basic_regex;
the object's internal finite state machine is constructed from the regular
expression contained in the string s, and interpreted
- according to the option
+ according to the option
flags specified in f.
-
Table 5. Postconditions for basic_regex construction
+
Table 5. Postconditions for basic_regex construction
- Throws: bad_expression if the sequence [first,
+ Throws: bad_expression if the sequence [first,
last) is not a valid regular expression, unless the flag no_except
is set in f.
Effects: Constructs an object of class
- basic_regex;
+ basic_regex;
the object's internal finite state machine is constructed from the regular
expression contained in the sequence of characters [first, last), and interpreted
- according to the option
+ according to the option
flags specified in f.
-
Table 6. Postconditions for basic_regex construction
+
Table 6. Postconditions for basic_regex construction
@@ -923,16 +912,14 @@
-
-basic_regex&operator=(constbasic_regex&e);
+
basic_regex&operator=(constbasic_regex&e);
Effects: Returns the result of assign(e.str(),e.flags()).
Effects: Returns zero if the expression
@@ -1169,8 +1142,7 @@
-
-basic_string<charT>str()const;
+
basic_string<charT>str()const;
Effects: Returns a copy of the character
@@ -1178,8 +1150,7 @@
-
-intcompare(basic_regex&e)const;
+
intcompare(basic_regex&e)const;
Effects: If flags()==e.flags() then returns str().compare(e.str()),
@@ -1188,8 +1159,7 @@
-
-locale_typeimbue(locale_typel);
+
locale_typeimbue(locale_typel);
Effects: Returns the result of traits_inst.imbue(l) where
@@ -1203,8 +1173,7 @@
-
-locale_typegetloc()const;
+
locale_typegetloc()const;
Effects: Returns the result of traits_inst.getloc()
@@ -1214,8 +1183,7 @@
-
-voidswap(basic_regex&e)throw();
+
voidswap(basic_regex&e)throw();
Effects: Swaps the contents of the two regular
@@ -1235,17 +1203,16 @@
Note
- Comparisons between basic_regex objects are provided
+ Comparisons between basic_regex objects are provided
on an experimental basis: please note that these are not present in the
Technical
Report on C++ Library Extensions, so use with care if you are writing
- code that may need to be ported to other implementations of basic_regex.
+ code that may need to be ported to other implementations of basic_regex.
Type charT used a template
- argument to class template basic_regex, must have a trivial
+ argument to class template basic_regex, must have a trivial
default constructor, copy constructor, assignment operator, and destructor.
In addition the following requirements must be met for objects; c
of type charT, c1
diff --git a/doc/html/boost_regex/ref/concepts/iterator_concepts.html b/doc/html/boost_regex/ref/concepts/iterator_concepts.html
index 3ff649cf..c6b6d4c7 100644
--- a/doc/html/boost_regex/ref/concepts/iterator_concepts.html
+++ b/doc/html/boost_regex/ref/concepts/iterator_concepts.html
@@ -3,7 +3,7 @@
There are two sets of requirements for the traits
- template argument to basic_regex: a mininal interface
+ template argument to basic_regex: a mininal interface
(which is part of the regex standardization proposal), and an optional
Boost-specific enhanced interface.
The following additional requirements are strictly optional, however in
- order for basic_regex
+ order for basic_regex
to take advantage of these additional interfaces, all of the following
- requirements must be met; basic_regex will detect the presence
+ requirements must be met; basic_regex will detect the presence
or absense of the member boost_extensions_tag
and configure itself appropriately.
@@ -33,8 +33,7 @@
exists, and existing code will continue to compile, however the following
documentation is unlikely to be further updated.
-
-#include<boost/cregex.hpp>
+
#include<boost/cregex.hpp>
The class RegEx provides a high level simplified interface to the regular
@@ -42,8 +41,7 @@
regular expressions always follow the "normal" syntax - that
is the same as the perl / ECMAScript synatx.
Constructs an instance of RegEx, setting the expression to c,
if icase is true then matching is insensitive
- to case, otherwise it is sensitive to case. Throws bad_expression on failure.
+ to case, otherwise it is sensitive to case. Throws bad_expression on failure.
@@ -187,7 +185,7 @@
Constructs an instance of RegEx, setting the expression to s,
if icase is true then matching is insensitive
- to case, otherwise it is sensitive to case. Throws bad_expression on failure.
+ to case, otherwise it is sensitive to case. Throws bad_expression on failure.
@@ -213,7 +211,7 @@
- Assignment operator, equivalent to calling SetExpression(p,false). Throws bad_expression on failure.
+ Assignment operator, equivalent to calling SetExpression(p,false). Throws bad_expression on failure.
@@ -226,7 +224,7 @@
- Assignment operator, equivalent to calling SetExpression(s,false). Throws bad_expression on failure.
+ Assignment operator, equivalent to calling SetExpression(s,false). Throws bad_expression on failure.
@@ -244,7 +242,7 @@
Sets the current expression to p, if icase
is true then matching is insensitive to case, otherwise it is sensitive
- to case. Throws bad_expression on failure.
+ to case. Throws bad_expression on failure.
@@ -261,7 +259,7 @@
Sets the current expression to s, if icase
is true then matching is insensitive to case, otherwise it is sensitive
- to case. Throws bad_expression on failure.
+ to case. Throws bad_expression on failure.
@@ -290,7 +288,7 @@
Attempts to match the current expression against the text p
- using the match flags flags - see match_flag_type. Returns
+ using the match flags flags - see match_flag_type. Returns
true if the expression matches the whole of
the input string.
@@ -309,7 +307,7 @@
Attempts to match the current expression against the text s
- using the match_flag_typeflags.
+ using the match_flag_typeflags.
Returns true if the expression matches the
whole of the input string.
@@ -328,7 +326,7 @@
Attempts to find a match for the current expression somewhere in
- the text p using the match_flag_typeflags.
+ the text p using the match_flag_typeflags.
Returns true if the match succeeds.
@@ -346,7 +344,7 @@
Attempts to find a match for the current expression somewhere in
- the text s using the match_flag_type flags.
+ the text s using the match_flag_type flags.
Returns true if the match succeeds.
@@ -365,7 +363,7 @@
Finds all matches of the current expression in the text p
- using the match_flag_typeflags.
+ using the match_flag_typeflags.
For each match found calls the call-back function cb as: cb(*this);
If at any stage the call-back function returns false
then the grep operation terminates, otherwise continues until no
@@ -387,7 +385,7 @@
Finds all matches of the current expression in the text s
- using the match_flag_type flags.
+ using the match_flag_type flags.
For each match found calls the call-back function cb as: cb(*this);
If at any stage the call-back function returns false then the grep
operation terminates, otherwise continues until no further matches
@@ -409,7 +407,7 @@
Finds all matches of the current expression in the text p
- using the match_flag_type flags.
+ using the match_flag_type flags.
For each match pushes a copy of what matched onto v.
Returns the number of matches found.
@@ -429,7 +427,7 @@
Finds all matches of the current expression in the text s
- using the match_flag_typeflags.
+ using the match_flag_typeflags.
For each match pushes a copy of what matched onto v.
Returns the number of matches found.
@@ -449,7 +447,7 @@
Finds all matches of the current expression in the text p
- using the match_flag_typeflags.
+ using the match_flag_typeflags.
For each match pushes the starting index of what matched onto
v. Returns the number of matches found.
@@ -469,7 +467,7 @@
Finds all matches of the current expression in the text s
- using the match_flag_typeflags.
+ using the match_flag_typeflags.
For each match pushes the starting index of what matched onto
v. Returns the number of matches found.
@@ -491,7 +489,7 @@
Finds all matches of the current expression in the files files
- using the match_flag_typeflags.
+ using the match_flag_typeflags.
For each match calls the call-back function cb. If the call-back
returns false then the algorithm returns without considering further
matches in the current file, or any further files.
@@ -526,7 +524,7 @@
Finds all matches of the current expression in the files files
- using the match_flag_typeflags.
+ using the match_flag_typeflags.
For each match calls the call-back function cb.
@@ -564,7 +562,7 @@
Searches files to find all those which contain at least one match
- of the current expression using the match_flag_typeflags.
+ of the current expression using the match_flag_typeflags.
For each matching file calls the call-back function cb. If the
call-back returns false then the algorithm returns without considering
any further files.
@@ -599,7 +597,7 @@
Searches files to find all those which contain at least one match
- of the current expression using the match_flag_typeflags.
+ of the current expression using the match_flag_typeflags.
For each matching file calls the call-back function cb.
@@ -643,8 +641,8 @@
If copy is true then all unmatched sections
of input are copied unchanged to output, if the flag format_first_only
is set then only the first occurance of the pattern found is replaced.
- Returns the new string. See also format
- string syntax, and match_flag_type.
+ Returns the new string. See also format
+ string syntax, and match_flag_type.
@@ -671,8 +669,8 @@
If copy is true then all unmatched sections
of input are copied unchanged to output, if the flag format_first_only
is set then only the first occurance of the pattern found is replaced.
- Returns the new string. See also format
- string syntax, and match_flag_type.
+ Returns the new string. See also format
+ string syntax, and match_flag_type.
diff --git a/doc/html/boost_regex/ref/deprecated_interfaces/regex_format.html b/doc/html/boost_regex/ref/deprecated_interfaces/regex_format.html
index 792d6411..0163436f 100644
--- a/doc/html/boost_regex/ref/deprecated_interfaces/regex_format.html
+++ b/doc/html/boost_regex/ref/deprecated_interfaces/regex_format.html
@@ -3,7 +3,7 @@
regex_format (Deprecated)
-
+
@@ -24,22 +24,21 @@
The algorithm regex_format
- is deprecated; new code should use match_results<>::format instead. Existing code
+ is deprecated; new code should use match_results<>::format instead. Existing code
will continue to compile, the following documentation is taken from the
previous version of Boost.Regex and will not be further updated:
The algorithm regex_grep
- is deprecated in favor of regex_iterator which provides
+ is deprecated in favor of regex_iterator which provides
a more convenient and standard library friendly interface.
The following documentation is taken unchanged from the previous boost
release, and will not be updated in future.
-
-#include<boost/regex.hpp>
+
#include<boost/regex.hpp>
regex_grep allows you to
search through a bidirectional-iterator range and locate all the (non-overlapping)
matches with a given regular expression. The function is declared as:
template<classPredicate,classiterator,classcharT,classtraits>unsignedintregex_grep(Predicatefoo,iteratorfirst,iteratorlast,
@@ -58,8 +56,7 @@
std::basic_string<>&
in place of a pair of iterators.
-
structgrep_predicate{booloperator()(constmatch_results<iterator_type>&m);};
@@ -133,10 +129,9 @@
(if Boost.Regex is configured in non-recursive mode).
- Example: convert the example from regex_search to use regex_grep instead:
+ Example: convert the example from regex_search to use regex_grep instead:
-
-#include<string>
+
#include<string>#include<map>#include<boost/regex.hpp>
@@ -198,8 +193,7 @@
Example: Use regex_grep
to call a global callback function:
-
-#include<string>
+
#include<string>#include<map>#include<boost/regex.hpp>
@@ -259,8 +253,7 @@
to call a class member function, use the standard library adapters std::mem_fun and std::bind1st
to convert the member function into a predicate:
-
-#include<string>
+
#include<string>#include<map>#include<boost/regex.hpp>#include<functional>
@@ -313,8 +306,7 @@
Finally, C++ Builder users can use C++ Builder's closure type as a callback
argument:
-
- The algorithm regex_split has been deprecated
- in favor of the iterator regex_token_iterator which has
+ The algorithm regex_split has been deprecated
+ in favor of the iterator regex_token_iterator which has
a more flexible and powerful interface, as well as following the more usual
standard library "pull" rather than "push" semantics.
- Code which uses regex_split will continue to compile,
+ Code which uses regex_split will continue to compile,
the following documentation is taken from a previous Boost.Regex version:
-
-#include<boost/regex.hpp>
+
#include<boost/regex.hpp>
- Algorithm regex_split performs a similar
+ Algorithm regex_split performs a similar
operation to the perl split operation, and comes in three overloaded forms:
template<classOutputIterator,classcharT,classTraits1,classAlloc1,classTraits2>std::size_tregex_split(OutputIteratorout,std::basic_string<charT,Traits1,Alloc1>&s,constbasic_regex<charT,Traits2>&e,
@@ -90,8 +88,7 @@
the input string into a series of tokens, and remove each token from the
string s:
-
unsignedtokenise(std::list<std::string>&l,std::string&s){returnboost::regex_split(std::back_inserter(l),s);}
@@ -100,8 +97,7 @@
Example: the following short program will extract all of the URL's from
a html file, and print them out to cout:
-
The type error_type is an
diff --git a/doc/html/boost_regex/ref/match_flag_type.html b/doc/html/boost_regex/ref/match_flag_type.html
index 4d57b228..9bcc0dac 100644
--- a/doc/html/boost_regex/ref/match_flag_type.html
+++ b/doc/html/boost_regex/ref/match_flag_type.html
@@ -3,7 +3,7 @@
The type match_flag_type
is an implementation specific bitmask type (see C++ std 17.3.2.1.2) that
controls how a regular expression is matched against a character sequence.
- The behavior of the format flags is described in more detail in the format syntax guide.
+ The behavior of the format flags is described in more detail in the format syntax guide.
Specifies that the expression should be matched according to the
- POSIX leftmost-longest
+ POSIX leftmost-longest
rule, regardless of what kind of expression was compiled.
Be warned that these rules do not work well with many Perl-specific
features such as non-greedy repeats.
@@ -344,7 +343,7 @@
Specifies that the expression should be matched according to the
- Perl
+ Perl
matching rules, irrespective of what kind of expression was
compiled.
@@ -359,7 +358,7 @@
Makes the expression behave as if it had no marked subexpressions,
- no matter how many capturing groups are actually present. The match_results
+ no matter how many capturing groups are actually present. The match_results
class will only contain information about the overall match, and
not any sub-expressions.
@@ -401,7 +400,7 @@
Specifies that when a regular expression match is to be replaced
by a new string, that the new string is constructed using the rules
used by the Unix sed utility in IEEE Std 1003.1-2001, Portable Operating
- SystemInterface (POSIX ), Shells and Utilities. See also the Sed Format string reference.
+ SystemInterface (POSIX ), Shells and Utilities. See also the Sed Format string reference.
Regular expressions are different from many simple pattern-matching algorithms
@@ -40,14 +39,14 @@
parenthesis (...). There has to be some method for reporting sub-expression
matches back to the user: this is achieved this by defining a class match_results that acts as an indexed collection
of sub-expression matches, each sub-expression match being contained in an
- object of type sub_match.
+ object of type sub_match.
Template class match_results
denotes a collection of character sequences representing the result of a
regular expression match. Objects of type match_results
- are passed to the algorithms regex_match and regex_search, and are returned by
- the iterator regex_iterator. Storage for the
+ are passed to the algorithms regex_match and regex_search, and are returned by
+ the iterator regex_iterator. Storage for the
collection is allocated and freed as necessary by the member functions of
class match_results.
In all match_results constructors,
@@ -154,8 +152,7 @@
-
-match_results(constAllocator&a=Allocator());
+
match_results(constAllocator&a=Allocator());
Effects: Constructs an object of class
@@ -220,8 +217,7 @@
-
-match_results(constmatch_results&m);
+
match_results(constmatch_results&m);
Effects: Constructs an object of class match_results,
@@ -229,8 +225,7 @@
-
-match_results&operator=(constmatch_results&m);
+
match_results&operator=(constmatch_results&m);
Effects: Assigns m to *this. The postconditions
@@ -354,36 +349,32 @@
-
-size_typesize()const;
+
size_typesize()const;
- Effects: Returns the number of sub_match elements stored in *this;
+ Effects: Returns the number of sub_match elements stored in *this;
that is the number of marked sub-expressions in the regular expression that
was matched plus one.
-
-size_typemax_size()const;
+
size_typemax_size()const;
Effects: Returns the maximum number of
- sub_match
+ sub_match
elements that can be stored in *this.
-
-boolempty()const;
+
boolempty()const;
Effects: Returns size() == 0.
-
-difference_typelength(intsub=0)const;
+
difference_typelength(intsub=0)const;
Effects: Returns the length of sub-expression
@@ -391,8 +382,7 @@
Effects: Returns the starting location of
@@ -403,8 +393,7 @@
-
-string_typestr(intsub=0)const;
+
string_typestr(intsub=0)const;
Effects: Returns sub-expression sub
@@ -412,43 +401,39 @@
-
-const_referenceoperator[](intn)const;
+
const_referenceoperator[](intn)const;
- Effects: Returns a reference to the sub_match
+ Effects: Returns a reference to the sub_match
object representing the character sequence that matched marked sub-expression
n. If n==0 then returns
- a reference to a sub_match object representing the
+ a reference to a sub_match object representing the
character sequence that matched the whole regular expression. If n
is out of range, or if n is an unmatched sub-expression,
- then returns a sub_match
+ then returns a sub_match
object whose matched member is false.
-
-const_referenceprefix()const;
+
const_referenceprefix()const;
- Effects: Returns a reference to the sub_match
+ Effects: Returns a reference to the sub_match
object representing the character sequence from the start of the string being
matched or searched, to the start of the match found.
-
-const_referencesuffix()const;
+
const_referencesuffix()const;
- Effects: Returns a reference to the sub_match
+ Effects: Returns a reference to the sub_match
object representing the character sequence from the end of the match found
to the end of the string being matched or searched.
-
-const_iteratorbegin()const;
+
const_iteratorbegin()const;
Effects: Returns a starting iterator that
@@ -456,8 +441,7 @@
-
-const_iteratorend()const;
+
const_iteratorend()const;
Effects: Returns a terminating iterator
@@ -465,8 +449,7 @@
-
-template<classOutputIterator>
+
template<classOutputIterator>OutputIteratorformat(OutputIteratorout,conststring_type&fmt,match_flag_typeflags=format_default);
@@ -487,15 +470,14 @@
Chapter 15 part 5.4.11 String.prototype.replace.
- The regular expression algorithms regex_match, regex_search and regex_replace all expect that
+ The regular expression algorithms regex_match, regex_search and regex_replace all expect that
the character sequence upon which they operate, is encoded in the same
character encoding as the regular expression object with which they are
used. For Unicode regular expressions that behavior is undesirable: while
@@ -43,11 +43,11 @@
on to the "real" algorithm.
- For each regex_match
+ For each regex_match
algorithm defined by <boost/regex.hpp>,
then <boost/regex/icu.hpp> defines an overloaded algorithm that
takes the same arguments, but which is called u32regex_match,
@@ -57,8 +57,7 @@
Example: match a password, encoded in a UTF-16 UnicodeString:
-
-//
+
//
// Find out if *password* meets our password requirements,
// as defined by the regular expression *requirements*.
//
@@ -70,8 +69,7 @@
Example: match a UTF-8 encoded filename:
-
-//
+
//
// Extract filename part of a path from a UTF-8 encoded std::string and return the result
// as another std::string:
//
@@ -91,11 +89,11 @@
}
- For each regex_search
+ For each regex_search
algorithm defined by <boost/regex.hpp>,
then <boost/regex/icu.hpp> defines an overloaded algorithm that
takes the same arguments, but which is called u32regex_search,
@@ -105,8 +103,7 @@
Example: search for a character sequence in a specific language block:
UnicodeStringextract_greek(constUnicodeString&text){// searches through some UTF-16 encoded text for a block encoded in Greek,
// this expression is imperfect, but the best we can do for now - searching
@@ -131,11 +128,11 @@
}
- For each regex_replace algorithm defined
+ For each regex_replace algorithm defined
by <boost/regex.hpp>, then <boost/regex/icu.hpp>
defines an overloaded algorithm that takes the same arguments, but which
is called u32regex_replace,
@@ -149,8 +146,7 @@
Example: Credit card number reformatting:
-
-//
+
//
// Take a credit card number as a string of digits,
// and reformat it as a human readable string with "-"
// separating each group of four digit;,
diff --git a/doc/html/boost_regex/ref/non_std_strings/icu/unicode_iter.html b/doc/html/boost_regex/ref/non_std_strings/icu/unicode_iter.html
index f188b7e5..debc21d2 100644
--- a/doc/html/boost_regex/ref/non_std_strings/icu/unicode_iter.html
+++ b/doc/html/boost_regex/ref/non_std_strings/icu/unicode_iter.html
@@ -3,7 +3,7 @@
Unicode Aware Regex Iterators
-
+
@@ -24,23 +24,22 @@
Type u32regex_iterator
- is in all respects the same as regex_iterator except that since
+ is in all respects the same as regex_iterator except that since
the regular expression type is always u32regex
it only takes one template parameter (the iterator type). It also calls
u32regex_search internally,
allowing it to interface correctly with UTF-8, UTF-16, and UTF-32 data:
-
-template<classBidirectionalIterator>
+
template<classBidirectionalIterator>classu32regex_iterator{// for members see regex_iterator
@@ -55,8 +54,7 @@
from a string, there are a series of non-member helper functions called
make_u32regex_iterator:
-
-u32regex_iterator<constchar*>
+
u32regex_iterator<constchar*>make_u32regex_iterator(constchar*s,constu32regex&e,regex_constants::match_flag_typem=regex_constants::match_default);
@@ -91,8 +89,7 @@
Example: search for international currency symbols, along with their
associated numeric value:
-
voidenumerate_currencies(conststd::string&text){// enumerate and print all the currency symbols, along
// with any associated numeric values:
@@ -129,19 +126,18 @@
Provided of course that the input is encoded as UTF-8.
Type u32regex_token_iterator
- is in all respects the same as regex_token_iterator except
+ is in all respects the same as regex_token_iterator except
that since the regular expression type is always u32regex
it only takes one template parameter (the iterator type). It also calls
u32regex_search internally,
allowing it to interface correctly with UTF-8, UTF-16, and UTF-32 data:
-
-template<classBidirectionalIterator>
+
template<classBidirectionalIterator>classu32regex_token_iterator{// for members see regex_token_iterator
@@ -156,8 +152,7 @@
from a string, there are a series of non-member helper functions called
make_u32regex_token_iterator:
-
-u32regex_token_iterator<constchar*>
+
u32regex_token_iterator<constchar*>make_u32regex_token_iterator(constchar*s,constu32regex&e,
@@ -198,8 +193,7 @@
of marked sub-expression sub in regular expression e,
found in text s, using match_flags m.
-
-template<std::size_tN>
+
template<std::size_tN>u32regex_token_iterator<constchar*>make_u32regex_token_iterator(constchar*p,
@@ -244,8 +238,7 @@
for each submatch in regular expression e, found
in text s, using match_flags m.
-
-u32regex_token_iterator<constchar*>
+
u32regex_token_iterator<constchar*>make_u32regex_token_iterator(constchar*p,constu32regex&e,
@@ -290,8 +283,7 @@
Example: search for international currency symbols, along with their
associated numeric value:
-
There are two overloads, the first reports what matched in a match_results
structure, the second does not.
- All the usual caveats for regex_match apply, in particular
+ All the usual caveats for regex_match apply, in particular
the algorithm will only report a successful match if all of the input
- text matches the expression, if this isn't what you want then use regex_search
+ text matches the expression, if this isn't what you want then use regex_search
instead.
- There are two additional overloads for regex_search, the first reports
+ There are two additional overloads for regex_search, the first reports
what matched the second does not:
-
-template<classcharT,classA,classT>
+
template<classcharT,classA,classT>boolregex_search(constATL::CSimpleStringT<charT>&s,match_results<constcharT*,A>&what,constbasic_regex<charT,T>&e,
@@ -136,8 +131,7 @@
Example: Postcode extraction from an
address string.
-
-CStringextract_postcode(constCString&address)
+
CStringextract_postcode(constCString&address){// searches throw address for a UK postcode and returns the result,
// the expression used is by Phil A. on www.regxlib.com:
@@ -155,12 +149,11 @@
}
- There are two additional overloads for regex_replace, the first sends
+ There are two additional overloads for regex_replace, the first sends
output to an output iterator, while the second creates a new string
Effects: returns a new string created
- using regex_replace,
+ using regex_replace,
and the same memory manager as string s.
Example:
-
-//
+
//
// Take a credit card number as a string of digits,
// and reformat it as a human readable string with "-"
// separating each group of four digits:
diff --git a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_intro.html b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_intro.html
index 2633b62c..0c3c45d8 100644
--- a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_intro.html
+++ b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_intro.html
@@ -3,7 +3,7 @@
Introduction to Boost.Regex and MFC Strings
-
+
@@ -24,7 +24,7 @@
voidenumerate_links(constCString&html){// enumerate and print all the links in some HTML text,
// the expression used is by Andew Lee on www.regxlib.com:
@@ -70,12 +68,11 @@
}
voidenumerate_links2(constCString&html){// enumerate and print all the links in some HTML text,
// the expression used is by Andew Lee on www.regxlib.com:
diff --git a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_regex_create.html b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_regex_create.html
index 6d10879b..cda7adca 100644
--- a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_regex_create.html
+++ b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_regex_create.html
@@ -3,7 +3,7 @@
Regular Expression Creation From an MFC String
-
+
@@ -24,15 +24,14 @@
- A regex_iterator
+ A regex_iterator
is constructed from a pair of iterators, and enumerates all occurrences of
a regular expression within that iterator range.
- Effects: constructs a regex_iterator that will enumerate
+ Effects: constructs a regex_iterator that will enumerate
all occurrences of the expression re, within the sequence
- [a,b), and found using match_flag_typem.
- The object re must exist for the lifetime of the regex_iterator.
+ [a,b), and found using match_flag_typem.
+ The object re must exist for the lifetime of the regex_iterator.
Throws: std::runtime_error
@@ -119,8 +116,7 @@
-
-regex_iterator(constregex_iterator&that);
+
regex_iterator(constregex_iterator&that);
Effects: constructs a copy of that.
@@ -130,8 +126,7 @@
Effects: sets *this equal to those in that.
@@ -141,8 +136,7 @@
-
-booloperator==(constregex_iterator&that)const;
+
booloperator==(constregex_iterator&that)const;
Effects: returns true if *this is equal
@@ -150,20 +144,18 @@
-
-booloperator!=(constregex_iterator&)const;
+
booloperator!=(constregex_iterator&)const;
Effects: returns !(*this==that).
-
-constvalue_type&operator*()const;
+
constvalue_type&operator*()const;
- Effects: dereferencing a regex_iterator object it yields
- a const reference to a match_results object, whose members
+ Effects: dereferencing a regex_iterator object it yields
+ a const reference to a match_results object, whose members
are set as follows:
@@ -383,22 +375,20 @@
-
-constvalue_type*operator->()const;
+
constvalue_type*operator->()const;
Effects: returns &(*this).
-
-regex_iterator&operator++();
+
regex_iterator&operator++();
Effects: moves the iterator to the next
match in the underlying sequence, or the end of sequence iterator if none
if found. When the last match found matched a zero length string, then the
- regex_iterator
+ regex_iterator
will find the next match as follows: if there exists a non-zero length match
that starts at the same location as the last one, then returns it, otherwise
starts looking for the next (possibly zero length) match from one position
@@ -417,8 +407,7 @@
-
-regex_iteratoroperator++(int);
+
regex_iteratoroperator++(int);
Effects: constructs a copy result of *this, then
@@ -429,8 +418,7 @@
- The algorithm regex_match
+ The algorithm regex_match
determines whether a given regular expression matches all
of a given character sequence denoted by a pair of bidirectional-iterators,
the algorithm is defined as follows, the main use of this function is data
@@ -43,13 +42,12 @@
Note that the result is true only if the expression matches the whole of the input sequence. If you want to search
- for an expression somewhere within the sequence then use regex_search. If you want to match
- a prefix of the character string then use regex_search with the flag match_continuous
+ for an expression somewhere within the sequence then use regex_search. If you want to match
+ a prefix of the character string then use regex_search with the flag match_continuous
set.
template<classBidirectionalIterator,classAllocator,classcharT,classtraits>boolregex_match(BidirectionalIteratorfirst,BidirectionalIteratorlast,match_results<BidirectionalIterator,Allocator>&m,constbasic_regex<charT,traits>&e,
@@ -100,7 +97,7 @@
Effects: Determines whether there is an
exact match between the regular expression e, and all
of the character sequence [first, last), parameter flags
- (see match_flag_type)
+ (see match_flag_type)
is used to control how the expression is matched against the character sequence.
Returns true if such a match exists, false otherwise.
@@ -313,8 +310,7 @@
template<classBidirectionalIterator,classcharT,classtraits>boolregex_match(BidirectionalIteratorfirst,BidirectionalIteratorlast,constbasic_regex<charT,traits>&e,match_flag_typeflags=match_default);
@@ -325,8 +321,7 @@
and then returning the result of regex_match(first,last,what,e,flags).
-
template<classST,classSA,classcharT,classtraits>boolregex_match(constbasic_string<charT,ST,SA>&s,constbasic_regex<charT,traits>&e,match_flag_typeflags=match_default);
@@ -368,14 +360,13 @@
Effects: Returns the result of regex_match(s.begin(),s.end(),e,flags).
- The algorithm regex_replace searches through a
+ The algorithm regex_replace searches through a
string finding all the matches to the regular expression: for each match
- it then calls match_results<>::format to format the string and
+ it then calls match_results<>::format to format the string and
sends the result to the output iterator. Sections of text that do not match
are copied to the output unchanged only if the flags
parameter does not have the flag format_no_copy
set. If the flag format_first_only
is set then only the first occurrence is replaced rather than all occurrences.
The manner in which the format string fmt is interpretted,
along with the rules used for finding matches, are determined by the flags
- set in flags: see match_flag_type.
+ set in flags: see match_flag_type.
and uses i to enumerate through all of the matches
- m of type match_results<BidirectionalIterator>
+ m of type match_results<BidirectionalIterator>
that occur within the sequence [first, last).
where last_m is a copy of the last match found.
@@ -161,8 +150,7 @@
Returns: out.
-
-template<classtraits,classcharT>
+
template<classtraits,classcharT>basic_string<charT>regex_replace(constbasic_string<charT>&s,constbasic_regex<charT,traits>&e,constbasic_string<charT>&fmt,
@@ -175,15 +163,14 @@
and then returns result.
- The algorithm regex_search will search a range
+ The algorithm regex_search will search a range
denoted by a pair of bidirectional-iterators for a given regular expression.
The algorithm uses various heuristics to reduce the search time by only checking
for a match if a match could conceivably start at that position. The algorithm
is defined as follows:
Effects: Returns the result of regex_search(s.begin(),s.end(),m,e,flags).
-
-template<classiterator,classcharT,classtraits>
+
template<classiterator,classcharT,classtraits>boolregex_search(iteratorfirst,iteratorlast,constbasic_regex<charT,traits>&e,match_flag_typeflags=match_default);
@@ -342,8 +336,7 @@
and then returning the result of regex_search(first,last,what,e,flags).
-
template<classST,classSA,classcharT,classtraits>boolregex_search(constbasic_string<charT,ST,SA>&s,constbasic_regex<charT,traits>&e,match_flag_typeflags=match_default);
@@ -363,8 +355,8 @@
Effects: Returns the result of regex_search(s.begin(),s.end(),e,flags).
The following example, takes the contents of a file in the form of a string,
@@ -373,8 +365,7 @@
is implemented, for example it could easily be modified to work with the
SGI rope class, which uses a non-contiguous storage strategy.
- The template class regex_token_iterator is an iterator
+ The template class regex_token_iterator is an iterator
adapter; that is to say it represents a new view of an existing iterator
sequence, by enumerating all the occurrences of a regular expression within
that sequence, and presenting one or more character sequence for each match
- found. Each position enumerated by the iterator is a sub_match object that represents
+ found. Each position enumerated by the iterator is a sub_match object that represents
what matched a particular sub-expression within the regular expression. When
- class regex_token_iterator is used to
+ class regex_token_iterator is used to
enumerate a single sub-expression with index -1, then the iterator performs
field splitting: that is to say it enumerates one character sequence for
each section of the character container sequence that does not match the
regular expression specified.
regex_token_iterator(BidirectionalIteratora,BidirectionalIteratorb,constregex_type&re,intsubmatch=0,
@@ -162,10 +159,10 @@
for the lifetime of the iterator constructed from it.
- Effects: constructs a regex_token_iterator that will enumerate
+ Effects: constructs a regex_token_iterator that will enumerate
one string for each regular expression match of the expression re
found within the sequence [a,b), using match flags m
- (see match_flag_type).
+ (see match_flag_type).
The string enumerated is the sub-expression submatch
for each match found; if submatch is -1, then enumerates
all the text sequences that did not match the expression re
@@ -181,8 +178,7 @@
-
-regex_token_iterator(BidirectionalIteratora,
+
regex_token_iterator(BidirectionalIteratora,BidirectionalIteratorb,constregex_type&re,conststd::vector<int>&submatches,
@@ -194,11 +190,11 @@
for the lifetime of the iterator constructed from it.
- Effects: constructs a regex_token_iterator that will enumerate
+ Effects: constructs a regex_token_iterator that will enumerate
submatches.size()
strings for each regular expression match of the expression re
found within the sequence [a,b), using match flags m
- (see match_flag_type).
+ (see match_flag_type).
For each match found one string will be enumerated for each sub-expression
index contained within submatches vector; if submatches[0]
is -1, then the first string enumerated for each match will be all of the
@@ -216,8 +212,7 @@
-
-template<std::size_tN>
+
template<std::size_tN>regex_token_iterator(BidirectionalIteratora,BidirectionalIteratorb,constregex_type&re,
@@ -229,10 +224,10 @@
for the lifetime of the iterator constructed from it.
- Effects: constructs a regex_token_iterator that will enumerate
+ Effects: constructs a regex_token_iterator that will enumerate
R strings for each regular expression match of the expression
re found within the sequence [a,b), using match flags
- m (see match_flag_type). For each match
+ m (see match_flag_type). For each match
found one string will be enumerated for each sub-expression index contained
within the submatches array; if submatches[0]
is -1, then the first string enumerated for each match will be all of the
@@ -250,8 +245,7 @@
The following example takes a string and splits it into a series of tokens:
-
-#include<iostream>
+
#include<iostream>#include<boost/regex.hpp>usingnamespacestd;
@@ -442,8 +427,7 @@
The following example takes a html file and outputs a list of all the linked
files:
-
Regular expressions are different from many simple pattern-matching algorithms
in that as well as finding an overall match they can also produce sub-expression
matches: each sub-expression being delimited in the pattern by a pair of
parenthesis (...). There has to be some method for reporting sub-expression
- matches back to the user: this is achieved this by defining a class match_results
+ matches back to the user: this is achieved this by defining a class match_results
that acts as an indexed collection of sub-expression matches, each sub-expression
- match being contained in an object of type sub_match.
+ match being contained in an object of type sub_match.
- Objects of type sub_match
- may only be obtained by subscripting an object of type match_results.
+ Objects of type sub_match
+ may only be obtained by subscripting an object of type match_results.
- Objects of type sub_match
+ Objects of type sub_match
may be compared to objects of type std::basic_string,
or constcharT* or constcharT.
- Objects of type sub_match
+ Objects of type sub_match
may be added to objects of type std::basic_string,
or constcharT* or constcharT, to produce a new std::basic_string
object.
- When the marked sub-expression denoted by an object of type sub_match participated in a regular
+ When the marked sub-expression denoted by an object of type sub_match participated in a regular
expression match then member matched evaluates to true,
and members first and second denote
the range of characters [first,second) which formed that match. Otherwise
@@ -65,25 +64,24 @@
values.
- When the marked sub-expression denoted by an object of type sub_match was repeated, then the
- sub_match
+ When the marked sub-expression denoted by an object of type sub_match was repeated, then the
+ sub_match
object represents the match obtained by the last repeat.
The complete set of all the captures obtained for all the repeats, may be
accessed via the captures() member function (Note: this has serious performance
implications, you have to explicitly enable this feature).
- If an object of type sub_match represents sub-expression
+ If an object of type sub_match represents sub-expression
0 - that is to say the whole match - then member matched
- is always true, unless a partial
+ is always true, unless a partial
match was obtained as a result of the flag match_partial
being passed to a regular expression algorithm, in which case member matched
is false, and members first and
second represent the character range that formed the
partial match.
Defines an implementation-specific type that satisfies the requirements of
@@ -455,8 +440,7 @@
-
-constcapture_sequence_type&captures()const;
+
constcapture_sequence_type&captures()const;
Effects: returns a sequence containing all
@@ -466,7 +450,7 @@
Preconditions: the library must be built
and used with BOOST_REGEX_MATCH_EXTRA defined, and you must pass the flag
match_extra to the regex
- matching functions ( regex_match, regex_search, regex_iterator or regex_token_iterator) in order for
+ matching functions ( regex_match, regex_search, regex_iterator or regex_token_iterator) in order for
this member #function to be defined and return useful information.
- The addition operators for sub_match allow you to add a sub_match
+ The addition operators for sub_match allow you to add a sub_match
to any type to which you can add a std::string
and obtain a new string as the result.
Specifies that the grammar recognized by the regular expression
- engine is the same as that used by POSIX
+ engine is the same as that used by POSIX
basic regular expressions in IEEE Std 1003.1-2001, Portable
Operating System Interface (POSIX ), Base Definitions and Headers,
Section 9, Regular Expressions (FWD.1).
@@ -112,7 +112,7 @@
Section 4, Utilit\ies, grep (FWD.1).
- That is to say, the same as POSIX
+ That is to say, the same as POSIX
basic syntax, but with the newline character acting as an
alternation character; the expression is treated as a newline separated
list of alternatives.
@@ -132,7 +132,7 @@
- Specifies that the grammar recognised is the superset of the POSIX-Basic syntax
+ Specifies that the grammar recognised is the superset of the POSIX-Basic syntax
used by the emacs program.
@@ -199,7 +199,7 @@
Specifies that when a regular expression is matched against a character
container sequence, then no sub-expression matches are to be stored
- in the supplied match_results structure.
+ in the supplied match_results structure.
@@ -238,7 +238,7 @@
Specifies that character ranges of the form [a-b]
- should be locale sensitive. This bit is on by default for POSIX-Basic regular expressions,
+ should be locale sensitive. This bit is on by default for POSIX-Basic regular expressions,
but can be unset to force ranges to be compared by code point only.
Specifies that when a regular expression is matched against a character
container sequence, then no sub-expression matches are to be stored
- in the supplied match_results structure.
+ in the supplied match_results structure.
@@ -323,7 +323,7 @@
- Prevents basic_regex from throwing
+ Prevents basic_regex from throwing
an exception when an invalid expression is encountered.
- The type syntax_option_type is an implementation
+ The type syntax_option_type is an implementation
specific bitmask type (see C++ standard 17.3.2.1.2). Setting its elements
- has the effects listed in the table below, a valid value of type syntax_option_type
+ has the effects listed in the table below, a valid value of type syntax_option_type
will always have exactly one of the elements normal,
basic, extended,
awk, grep,
@@ -39,23 +39,20 @@
Note that for convenience all the constants listed here are duplicated
- within the scope of class template basic_regex, so you can use any
+ within the scope of class template basic_regex, so you can use any
of:
-
-boost::regex_constants::constant_name
+
boost::regex_constants::constant_name
or
-
-boost::regex::constant_name
+
boost::regex::constant_name
or
-
-boost::wregex::constant_name
+
boost::wregex::constant_name
in an interchangeable manner.
diff --git a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_perl.html b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_perl.html
index f60f42a2..64365cc8 100644
--- a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_perl.html
+++ b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_perl.html
@@ -3,7 +3,7 @@
Specifies that when a regular expression is matched against a character
container sequence, then no sub-expression matches are to be stored
- in the supplied match_results structure.
+ in the supplied match_results structure.
@@ -286,7 +286,7 @@
- Prevents basic_regex from throwing
+ Prevents basic_regex from throwing
an exception when an invalid expression is encountered.
- Type syntax_option_type
+ Type syntax_option_type
is an implementation specific bitmask type that controls how a regular
expression string is to be interpreted. For convenience note that all the
constants listed here, are also duplicated within the scope of class template
- basic_regex.
+ basic_regex.
The POSIX-Extended regular expression syntax is supported by the POSIX C
@@ -38,8 +38,7 @@
the flag extended to the
regex constructor, for example:
-
-// e1 is a case sensitive POSIX-Extended expression:
+
// e1 is a case sensitive POSIX-Extended expression:
boost::regexe1(my_expression,boost::regex::extended);// e2 a case insensitive POSIX-Extended expression:
boost::regexe2(my_expression,boost::regex::extended|boost::regex::icase);
@@ -47,8 +46,8 @@
A '^' character shall match the start of a line when used as the first character
@@ -87,8 +86,8 @@
of an expression, or the last character of a sub-expression.
@@ -266,13 +260,13 @@ cab
within the range y to z, if it
collates within that range; this results in locale specific behavior . This
behavior can be turned off by unsetting the collate
- option flag - in
+ option flag - in
which case whether a character appears within a range is determined by comparing
the code points of the characters only.
An expression of the form [[:name:]]
matches the named character class "name", for example [[:lower:]] matches any lower case character. See
- character class names.
+ character class names.
@@ -310,24 +304,23 @@ cab
match either one of the characters 'abc^'.
- As an extension, a collating element may also be specified via its symbolic name, for example:
+ As an extension, a collating element may also be specified via its symbolic name, for example:
An expression of the form [[=col=]],
matches any character or collating element whose primary sort key is the
same as that for collating element col, as with colating
- elements the name col may be a symbolic
+ elements the name col may be a symbolic
name. A primary sort key is one that ignores case, accentation, or
locale-specific tailorings; so for example [[=a=]] matches
any of the characters: a, À, Á, Â, Ã, Ä, Å, A, à, á, â, ã, ä and å. Unfortunately implementation
@@ -336,16 +329,16 @@ cab
or even all locales on one platform.
@@ -1008,13 +1001,12 @@ cab
as literals, until either the end of the regular expression or \E is found.
For example the expression: \Q\*+\Ea+ would match either of:
The POSIX-Basic regular expression syntax is used by the Unix utility sed, and variations are used by grep and emacs.
You can construct POSIX basic regular expressions in Boost.Regex by passing
the flag basic to the regex
- constructor (see syntax_option_type), for example:
+ constructor (see syntax_option_type), for example:
-
-// e1 is a case sensitive POSIX-Basic expression:
+
// e1 is a case sensitive POSIX-Basic expression:
boost::regexe1(my_expression,boost::regex::basic);// e2 a case insensitive POSIX-Basic expression:
boost::regexe2(my_expression,boost::regex::basic|boost::regex::icase);
@@ -46,8 +45,8 @@
A '^' character shall match the start of a line when used as the first character
@@ -86,8 +85,8 @@
of an expression, or the last character of a sub-expression.
An expression of the form [[:name:]]
matches the named character class "name", for example [[:lower:]] matches any lower case character. See
- character class names.
+ character class names.
An expression of theform [[=col=]],
matches any character or collating element whose primary sort key is the
same as that for collating element col, as with collating
- elements the name col may be a collating
+ elements the name col may be a collating
symbolic name. A primary sort key is one that ignores case, accentation,
or locale-specific tailorings; so for example [[=a=]] matches
any of the characters: a, À, Á, Â, Ã, Ä, Å, A, à, á, â, ã, ä and å. Unfortunately implementation
@@ -277,16 +276,16 @@ aaaa
or even all locales on one platform.
When an expression is compiled with the flag grep
- set, then the expression is treated as a newline separated list of POSIX-Basic expressions, a match
+ set, then the expression is treated as a newline separated list of POSIX-Basic expressions, a match
is found if any of the expressions in the list match, for example:
The following are treated as valid digraphs when used as a collating name:
diff --git a/doc/html/boost_regex/syntax/collating_names/named_unicode.html b/doc/html/boost_regex/syntax/collating_names/named_unicode.html
index c6c09460..e9c3bc90 100644
--- a/doc/html/boost_regex/syntax/collating_names/named_unicode.html
+++ b/doc/html/boost_regex/syntax/collating_names/named_unicode.html
@@ -3,7 +3,7 @@
- When using Unicode aware regular expressions
+ When using Unicode aware regular expressions
(with the u32regex type),
all the normal symbolic names for Unicode characters (those given in Unidata.txt)
are recognised. So for example:
diff --git a/doc/html/boost_regex/syntax/collating_names/posix_symbolic_names.html b/doc/html/boost_regex/syntax/collating_names/posix_symbolic_names.html
index 7e06aabc..220c7e81 100644
--- a/doc/html/boost_regex/syntax/collating_names/posix_symbolic_names.html
+++ b/doc/html/boost_regex/syntax/collating_names/posix_symbolic_names.html
@@ -3,7 +3,7 @@
The Perl regular expression syntax is based on that used by the programming
language Perl . Perl regular expressions are the default behavior in Boost.Regex
or you can pass the flag perl
- to the basic_regex
+ to the basic_regex
constructor, for example:
-
-// e1 is a case sensitive Perl regular expression:
+
// e1 is a case sensitive Perl regular expression:
// since Perl is the default option there's no need to explicitly specify the syntax used here:
boost::regexe1(my_expression);// e2 a case insensitive Perl regular expression:
boost::regexe2(my_expression,boost::regex::perl|boost::regex::icase);
Any atom (a single character, a marked sub-expression, or a character class)
@@ -126,8 +125,7 @@
preceding atom zero or more times, for example the expression a*b
will match any of the following:
-
-b
+
babaaaaaaaab
@@ -136,30 +134,26 @@
preceding atom one or more times, for example the expression a+b
will match any of the following:
-
-ab
+
abaaaaaaaab
But will not match:
-
-b
+
b
The ? operator will match the
preceding atom zero or one times, for example the expression ca?b will match
any of the following:
-
-cb
+
cbcab
But will not match:
-
-caab
+
caab
An atom can also be repeated with a bounded repeat:
@@ -183,31 +177,28 @@
Will match either of:
-
-aa
+
aaaaa
But neither of:
-
-a
+
aaaaa
It is an error to use a repeat operator, if the preceding construct can not
be repeated, for example:
-
-a(*)
+
a(*)
Will raise an error, as there is nothing for the *
operator to be applied to.
@@ -318,12 +307,12 @@
will match any single character in the range 'a' to 'c'. By default, for
Perl regular expressions, a character x is within the range y to z, if the
code point of the character lies within the codepoints of the endpoints of
- the range. Alternatively, if you set the collate flag when constructing the
+ the range. Alternatively, if you set the collate flag when constructing the
regular expression, then ranges are locale sensitive.
An expression of the form [[:name:]]
matches the named character class "name", for example [[:lower:]] matches any lower case character. See
- character class names.
+ character class names.
@@ -356,25 +345,24 @@
a single collating element in the current locale.
- As an extension, a collating element may also be specified via it's symbolic name, for example:
+ As an extension, a collating element may also be specified via it's symbolic name, for example:
An expression of the form [[=col=]],
matches any character or collating element whose primary sort key is the
same as that for collating element col, as with collating
- elements the name col may be a symbolic
+ elements the name col may be a symbolic
name. A primary sort key is one that ignores case, accentation, or
locale-specific tailorings; so for example [[=a=]] matches
any of the characters: a, À, Á, Â, Ã, Ä, Å, A, à, á, â, ã, ä and å. Unfortunately implementation
@@ -383,8 +371,8 @@
or even all locales on one platform.
The escape sequence \Q
@@ -926,13 +914,12 @@
as literals, until either the end of the regular expression or \E is found.
For example the expression: \Q\*+\Ea+ would match either of:
(?=pattern) consumes zero characters, only if pattern
@@ -1010,15 +997,14 @@
letter, a punctuation symbol, and be at least 6 characters long, then the
expression:
- There are a variety
+ There are a variety
of flags that may be combined with the perl
option when constructing the regular expression, in particular note that
the newline_alt option alters
@@ -1307,20 +1293,20 @@
sensitivity are to be applied.
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
@@ -196,7 +196,7 @@
-
Last revised: March 15, 2008 at 14:03:54 GMT
+
Last revised: April 11, 2008 at 08:50:33 GMT
diff --git a/doc/syntax_perl.qbk b/doc/syntax_perl.qbk
index 916ed018..9a76276d 100644
--- a/doc/syntax_perl.qbk
+++ b/doc/syntax_perl.qbk
@@ -34,7 +34,7 @@ The single character '.' when used outside of a character set will match
any single character except:
* The NULL character when the [link boost_regex.ref.match_flag_type flag
- `match_no_dot_null`] is passed to the matching algorithms.
+ `match_not_dot_null`] is passed to the matching algorithms.
* The newline character when the [link boost_regex.ref.match_flag_type
flag `match_not_dot_newline`] is passed to
the matching algorithms.
diff --git a/example/snippets/icu_example.cpp b/example/snippets/icu_example.cpp
index 8e5f22ca..8f4a41ed 100644
--- a/example/snippets/icu_example.cpp
+++ b/example/snippets/icu_example.cpp
@@ -157,7 +157,7 @@ int main()
assert(greek == L"\x0391\x039D\x0395\x0398\x0391 2004");
// extract currency symbols with associated value, use iterator interface:
- std::string text2 = " $100.23 or \xC2\xA3""198.12 "; // \xC2\xA3 is the £ sign encoded in UTF-8
+ std::string text2 = " $100.23 or \xC2\xA3""198.12 "; // \xC2\xA3 is the pound sign encoded in UTF-8
enumerate_currencies(text2);
enumerate_currencies2(text2);
diff --git a/include/boost/regex/concepts.hpp b/include/boost/regex/concepts.hpp
index 0f5677a2..99c6eea5 100644
--- a/include/boost/regex/concepts.hpp
+++ b/include/boost/regex/concepts.hpp
@@ -368,8 +368,6 @@ struct BaseRegexConcept
// access:
const Regex ce;
- bool b = ce.empty();
- ignore_unused_variable_warning(b);
unsigned i = ce.mark_count();
ignore_unused_variable_warning(i);
m_flags = ce.flags();
@@ -385,7 +383,7 @@ struct BaseRegexConcept
typedef typename sub_match_type::iterator sub_iter_type;
BOOST_STATIC_ASSERT((::boost::is_same::value));
BOOST_STATIC_ASSERT((::boost::is_same::value));
- b = m_sub.matched;
+ bool b = m_sub.matched;
ignore_unused_variable_warning(b);
BidiIterator bi = m_sub.first;
ignore_unused_variable_warning(bi);
@@ -806,6 +804,8 @@ struct BoostRegexConcept
ignore_unused_variable_warning(i2);
bool b = ce == ce2;
ignore_unused_variable_warning(b);
+ b = ce.empty();
+ ignore_unused_variable_warning(b);
b = ce != ce2;
ignore_unused_variable_warning(b);
b = ce < ce2;
diff --git a/include/boost/regex/pending/object_cache.hpp b/include/boost/regex/pending/object_cache.hpp
index bc37e276..2a7e00bc 100644
--- a/include/boost/regex/pending/object_cache.hpp
+++ b/include/boost/regex/pending/object_cache.hpp
@@ -119,7 +119,7 @@ boost::shared_ptr