diff --git a/doc/html/boost_regex/background_information.html b/doc/html/boost_regex/background_information.html index ecf49934..45d793e6 100644 --- a/doc/html/boost_regex/background_information.html +++ b/doc/html/boost_regex/background_information.html @@ -3,11 +3,12 @@ Background Information - + - - + + @@ -24,8 +25,7 @@

-Background Information -

+Background Information
Headers
Localization
@@ -65,7 +65,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/acknowledgements.html b/doc/html/boost_regex/background_information/acknowledgements.html index d5356278..0e9a5827 100644 --- a/doc/html/boost_regex/background_information/acknowledgements.html +++ b/doc/html/boost_regex/background_information/acknowledgements.html @@ -1,13 +1,14 @@ -Acknowledgements + + Acknowledgements - + - - + + @@ -24,9 +25,9 @@

- - Acknowledgements -

+ + Acknowledgements

The author can be contacted at john - at - johnmaddock.co.uk; the home page for this library is at www.boost.org. @@ -74,7 +75,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/examples.html b/doc/html/boost_regex/background_information/examples.html index 983c20c4..7c929efe 100644 --- a/doc/html/boost_regex/background_information/examples.html +++ b/doc/html/boost_regex/background_information/examples.html @@ -1,13 +1,16 @@ -Test and Example Programs + Test and + Example Programs - + - - + + @@ -24,16 +27,16 @@
-
- + Test and + Example Programs
+

+ Test Programs -

+

- regress: + regress:

A regression test application that gives the matching/searching algorithms @@ -49,7 +52,7 @@ Files: See directory.

- bad_expression_test: + bad_expression_test:

Verifies that "bad" regular expressions don't cause the matcher @@ -62,7 +65,7 @@ Files: bad_expression_test.cpp.

- recursion_test: + recursion_test:

Verifies that the matcher can't overrun the stack (no matter what the expression). @@ -74,7 +77,7 @@ Files: recursion_test.cpp.

- concepts: + concepts:

Verifies that the library meets all documented concepts (a compile only test). @@ -86,7 +89,7 @@ Files: concept_check.cpp.

- captures_test: + captures_test:

Test code for captures. @@ -97,13 +100,13 @@

Files: captures_test.cpp.

-
- +

+ Example programs -

+

- grep + grep

A simple grep implementation, run with the -h command line option to find @@ -113,7 +116,7 @@ Files: grep.cpp

- timer.exe + timer.exe

A simple interactive expression matching application, the results of all @@ -123,11 +126,11 @@

Files: regex_timer.cpp.

-
- +

+ Code snippets -

+

The snippets examples contain the code examples used in the documentation:

@@ -208,7 +211,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/faq.html b/doc/html/boost_regex/background_information/faq.html index e860f4a3..e2b8b781 100644 --- a/doc/html/boost_regex/background_information/faq.html +++ b/doc/html/boost_regex/background_information/faq.html @@ -1,13 +1,14 @@ -FAQ + FAQ - + - - + + @@ -24,14 +25,13 @@

- FAQ -

+ FAQ

- Q. I can't get regex++ to work with escape + Q. I can't get regex++ to work with escape characters, what's going on?

- A. If you embed regular expressions in C++ + A. If you embed regular expressions in C++ code, then remember that escape characters are processed twice: once by the C++ compiler, and once by the Boost.Regex expression compiler, so to pass the regular expression \d+ to Boost.Regex, you need to embed "\d+" @@ -39,21 +39,21 @@ "\\" in your code.

- Q. No matter what I do regex_match always + Q. No matter what I do regex_match always returns false, what's going on?

- A. The algorithm regex_match only succeeds - if the expression matches all of the text, - if you want to find a sub-string within + A. The algorithm regex_match only succeeds + if the expression matches all of the text, + if you want to find a sub-string within the text that matches the expression then use regex_search instead.

- Q. Why does using parenthesis in a POSIX + Q. Why does using parenthesis in a POSIX regular expression change the result of a match?

- A. For POSIX (extended and basic) regular + A. For POSIX (extended and basic) regular expressions, but not for perl regexes, parentheses don't only mark; they determine what the best match is as well. When the expression is compiled as a POSIX basic or extended regex then Boost.Regex follows the POSIX standard @@ -85,11 +85,11 @@ as the expression.

- Q. Why don't character ranges work properly + Q. Why don't character ranges work properly (POSIX mode only)?

- A. The POSIX standard specifies that character + A. The POSIX standard specifies that character range expressions are locale sensitive - so for example the expression [A-Z] will match any collating element that collates between 'A' and 'Z'. That means that for most locales other than "C" or "POSIX", @@ -97,39 +97,39 @@ most people expect - or at least not what most people have come to expect from regular expression engines. For this reason, the default behaviour of Boost.Regex (perl mode) is to turn locale sensitive collation off by not - setting the regex_constants::collate + setting the regex_constants::collate compile time flag. However if you set a non-default compile time flag - for - example regex_constants::extended or regex_constants::basic, + example regex_constants::extended or regex_constants::basic, then locale dependent collation will be enabled, this also applies to the - POSIX API functions which use either regex_constants::extended - or regex_constants::basic internally. [Note - when regex_constants::nocollate in effect, the library behaves + POSIX API functions which use either regex_constants::extended + or regex_constants::basic internally. [Note - when regex_constants::nocollate in effect, the library behaves "as if" the LC_COLLATE locale category were always "C", regardless of what its actually set to - end note].

- Q. Why are there no throw specifications + Q. Why are there no throw specifications on any of the functions? What exceptions can the library throw?

- A. Not all compilers support (or honor) + A. Not all compilers support (or honor) 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 - 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" - 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 + 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" + 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 of the functions in this library.

- Q. Why can't I use the "convenience" + Q. Why can't I use the "convenience" versions of regex_match / regex_search / regex_grep / regex_format / regex_merge?

- A. These versions may or may not be available + A. These versions may or may not be available depending upon the capabilities of your compiler, the rules determining the format of these functions are quite complex - and only the versions visible to a standard compliant compiler are given in the help. To find out what @@ -141,7 +141,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/futher.html b/doc/html/boost_regex/background_information/futher.html index cb7087ef..4463bda9 100644 --- a/doc/html/boost_regex/background_information/futher.html +++ b/doc/html/boost_regex/background_information/futher.html @@ -1,13 +1,15 @@ -References and Further Information + References + and Further Information - + - - + + @@ -24,9 +26,9 @@
+ References + and Further Information

Short tutorials on regular expressions can be found here and here. @@ -62,7 +64,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/headers.html b/doc/html/boost_regex/background_information/headers.html index e88973ff..a351f381 100644 --- a/doc/html/boost_regex/background_information/headers.html +++ b/doc/html/boost_regex/background_information/headers.html @@ -1,13 +1,13 @@ -Headers + Headers - + - + @@ -24,23 +24,25 @@
+ Headers

- There are two main headers used by this library: <boost/regex.hpp> - provides full access to the main template library, while <boost/cregex.hpp> + There are two main headers used by this library: <boost/regex.hpp> + provides full access to the main template library, while <boost/cregex.hpp> provides access to the (deprecated) high level class RegEx, and the POSIX API functions.

- 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 + 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 not need the full definitions.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/history.html b/doc/html/boost_regex/background_information/history.html index d71e74b2..db846835 100644 --- a/doc/html/boost_regex/background_information/history.html +++ b/doc/html/boost_regex/background_information/history.html @@ -1,12 +1,13 @@ -History + History - + - + @@ -23,13 +24,12 @@
-
- + History
+

+ Boost 1.34 -

+
  • Fix for non-greedy repeats and partial matches not working correctly in @@ -48,11 +48,11 @@ the same as |.
-
- +

+ Boost 1.33.1 -

+
  • Fixed broken makefiles. @@ -118,11 +118,11 @@ Fixed bug that allowed some invalid expressions to be accepted.
-
- +

+ Boost 1.33.0 -

+
  • Completely rewritten expression parsing code, and traits class support; @@ -173,19 +173,19 @@ in the expression the error occured.
-
- +

+ Boost 1.32.1 -

+
  • Fixed bug in partial matches of bounded repeats of '.'.
-
- +

+ Boost 1.31.0 -

+
  • Completely rewritten pattern matching code - it is now up to 10 times faster @@ -220,7 +220,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/locale.html b/doc/html/boost_regex/background_information/locale.html index f0e6aefb..78e77de2 100644 --- a/doc/html/boost_regex/background_information/locale.html +++ b/doc/html/boost_regex/background_information/locale.html @@ -1,13 +1,14 @@ -Localization + Localization - + - - + + @@ -24,8 +25,7 @@
+ Localization

Boost.Regex provides extensive support for run-time localization, the localization model used can be split into two parts: front-end and back-end. @@ -57,17 +57,17 @@

There are three separate localization mechanisms supported by Boost.Regex:

-
- +

+ Win32 localization model. -

+

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 + encapsulated by the traits class w32_regex_traits. + 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 + 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 used by Boost.Regex are acquired directly from the operating system bypassing the C run time library. Front-end localization requires a resource dll, containing @@ -80,7 +80,7 @@

which needs to be called with a string identifying the name of the resource dll, before your code compiles any regular expressions (but not necessarily - before you construct any basic_regex + before you construct any basic_regex instances): 

@@ -91,18 +91,18 @@
         library degrades gracefully - characters 0 to 255 are supported, the remainder
         are treated as "unknown" graphic characters.
       

-

-
+

+
         C
         localization model.
-      

+      
 

         This model has been deprecated in favor of the C++ locale for all non-Windows
         compilers that support it. This locale is encapsulated by the traits class
-        c_regex_traits, Win32 users
+        c_regex_traits, Win32 users
         can force this model to take effect by defining the pre-processor symbol
         BOOST_REGEX_USE_C_LOCALE. When this model is in effect there is a single
-        global locale, as set by setlocale.
+        global locale, as set by setlocale.
         All settings are acquired from your run time library, consequently Unicode
         support is dependent upon your run time library implementation.
       

@@ -111,24 +111,24 @@
       

 

         Note that calling setlocale invalidates all compiled regular expressions,
-        calling setlocale(LC_ALL, "C")
+        calling setlocale(LC_ALL, "C")
         will make this library behave equivalent to most traditional regular expression
         libraries including version 1 of this library.
       

-

-
+

+
         C++
         localization model.
-      

+      
 

         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
-        imbue which allows the locale
+        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
+        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:
       

 
@@ -143,22 +143,22 @@
 boost::cpp_regex_traits<char>::set_message_catalogue("mycatalogue");
 

 

-        Note that calling basic_regex<>::imbue
-        will invalidate any expression currently compiled in that instance of basic_regex.
+        Note that calling basic_regex<>::imbue
+        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
         model, then the appropriate pre-processor symbol (BOOST_REGEX_USE_C_LOCALE
         or BOOST_REGEX_USE_CPP_LOCALE) must be defined both when you build the support
-        library, and when you include <boost/regex.hpp>
-        or <boost/cregex.hpp>
-        in your code. The best way to ensure this is to add the #define to <boost/regex/user.hpp>.
+        library, and when you include <boost/regex.hpp>
+        or <boost/cregex.hpp>
+        in your code. The best way to ensure this is to add the #define to <boost/regex/user.hpp>.
       

-

-
+

+
         Providing
         a message catalogue
-      

+      
 

         In order to localize the front end of the library, you need to provide the
         library with the appropriate message strings contained either in a resource
@@ -1272,7 +1272,7 @@
@@ -178,7 +179,7 @@ @@ -190,7 +191,7 @@ @@ -202,26 +203,26 @@

- "Unmatched [ or " + "Unmatched [ or "

@@ -1779,7 +1779,10 @@ - +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/performance.html b/doc/html/boost_regex/background_information/performance.html index 1732fd58..be5ed7c2 100644 --- a/doc/html/boost_regex/background_information/performance.html +++ b/doc/html/boost_regex/background_information/performance.html @@ -1,13 +1,14 @@ -Performance + Performance - + - - + + @@ -24,8 +25,7 @@
+ Performance

The performance of Boost.Regex in both recursive and non-recursive modes should be broadly comparable to other regular expression libraries: recursive @@ -46,7 +46,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/redist.html b/doc/html/boost_regex/background_information/redist.html index 4e3434ce..fb7917f6 100644 --- a/doc/html/boost_regex/background_information/redist.html +++ b/doc/html/boost_regex/background_information/redist.html @@ -1,13 +1,15 @@ -Redistributables + Redistributables - + - - + + @@ -24,8 +26,7 @@
+ Redistributables

If you are using Microsoft or Borland C++ and link to a dll version of the run time library, then you can choose to also link to a dll version of Boost.Regex @@ -47,7 +48,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/standards.html b/doc/html/boost_regex/background_information/standards.html index 910d0d3a..8efaff79 100644 --- a/doc/html/boost_regex/background_information/standards.html +++ b/doc/html/boost_regex/background_information/standards.html @@ -1,13 +1,14 @@ -Standards Conformance + Standards + Conformance - + - - + + @@ -24,22 +25,22 @@
-
- + Standards + Conformance
+

+ C++ -

+

Boost.Regex is intended to conform to the Technical Report on C++ Library Extensions.

-
- +

+ ECMAScript / JavaScript -

+

All of the ECMAScript regular expression syntax features are supported, except that: @@ -48,10 +49,10 @@ The escape sequence \u matches any upper case character (the same as [[:upper:]]) rather than a Unicode escape sequence; use \x{DDDD} for Unicode escape sequences.

-
- +

+ Perl -

+

Almost all Perl features are supported, except for:

@@ -61,10 +62,10 @@

(??{code}) Not implementable in a compiled strongly typed language.

-
- +

+ POSIX -

+

All the POSIX basic and extended regular expression features are supported, except that: @@ -81,10 +82,10 @@ implementation doesn't work on your platform, then you will need to supply a custom traits class.

-
- +

+ Unicode -

+

The following comments refer to Unicode Technical Standard #18: Unicode Regular Expressions version 11. @@ -164,13 +165,13 @@ Indirectly support by forward-lookahead:

- (?=[[:X:]])[[:Y:]] + (?=[[:X:]])[[:Y:]]

Gives the intersection of character properties X and Y.

- (?![[:X:]])[[:Y:]] + (?![[:X:]])[[:Y:]]

Gives everything in Y that is not in X (subtraction). @@ -468,7 +469,7 @@

@@ -549,7 +550,10 @@

- Supported: pass the flag match_partial + Supported: pass the flag match_partial to the regex algorithms.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/background_information/thread_safety.html b/doc/html/boost_regex/background_information/thread_safety.html index 86f73d7f..d76d568d 100644 --- a/doc/html/boost_regex/background_information/thread_safety.html +++ b/doc/html/boost_regex/background_information/thread_safety.html @@ -1,13 +1,15 @@ -Thread Safety + Thread + Safety - + - - + + @@ -24,43 +26,44 @@
+ Thread + Safety

The Boost.Regex library is thread safe when Boost is: you can verify that - Boost is in thread safe mode by checking to see if BOOST_HAS_THREADS + Boost is in thread safe mode by checking to see if BOOST_HAS_THREADS is defined: this macro is set automatically by the config system when threading 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.

Finally note that changing the global locale invalidates all compiled regular - expressions, therefore calling set_locale + expressions, therefore calling set_locale from one thread while another uses regular expressions will produce unpredictable results.

@@ -71,7 +74,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/captures.html b/doc/html/boost_regex/captures.html index af64a95d..5d984fed 100644 --- a/doc/html/boost_regex/captures.html +++ b/doc/html/boost_regex/captures.html @@ -1,13 +1,14 @@ -Understanding Marked Sub-Expressions and Captures + Understanding Marked Sub-Expressions + and Captures - + - - + + @@ -24,9 +25,9 @@
+ Understanding Marked Sub-Expressions + and Captures

Captures are the iterator ranges that are "captured" by marked sub-expressions as a regular expression gets matched. Each marked sub-expression can result @@ -34,12 +35,12 @@ how captures and marked sub-expressions in Boost.Regex are represented and accessed.

-
- +

+ Marked sub-expressions -

+

- Every time a Perl regular expression contains a parenthesis group (), it spits out an extra field, known as a + Every time a Perl regular expression contains a parenthesis group (), it spits out an extra field, known as a marked sub-expression, for example the expression: 

(\w+)\W+(\w+)
@@ -47,7 +48,7 @@ Has two marked sub-expressions (known as $1 and $2 respectively), in addition the complete match is known as $&, everything before the first match as $`, and everything after the match as $'. So if the above expression is searched - for within "@abc def--", + for within "@abc def--", then we obtain:

@@ -131,8 +132,8 @@

- 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;
@@ -166,7 +167,7 @@

- m.prefix() + m.prefix()

- m[0] + m[0]

- m[n] + m[n]

- m.suffix() + m.suffix()

- 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 - behave a lot like a std::basic_string: for example they are implicitly - convertible to a basic_string, + 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.

-
- +

+ Unmatched Sub-Expressions -

+

When a regular expression match is found there is no need for all of the marked sub-expressions to have participated in the match, for example the expression: @@ -229,12 +230,12 @@ 

(abc)|(def)

can match either $1 or $2, but never both at the same time. In Boost.Regex - you can determine which sub-expressions matched by accessing the sub_match::matched data member. + you can determine which sub-expressions matched by accessing the sub_match::matched data member.

-
- +

+ Repeated Captures -

+

When a marked sub-expression is repeated, then the sub-expression gets "captured" multiple times, however normally only the final capture is available, for example @@ -251,7 +252,7 @@

However, Boost.Regex has an experimental feature that allows all the capture - information to be retained - this is accessed either via the match_results::captures member function or the sub_match::captures member function. These functions + information to be retained - this is accessed either via the match_results::captures member function or the sub_match::captures member function. These functions return a container that contains a sequence of all the captures obtained during the regular expression matching. The following example program shows how this information may be used: @@ -371,7 +372,10 @@ Text: "now is the time for all good men to come to the aid of the party"

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/configuration.html b/doc/html/boost_regex/configuration.html index df6a4d80..fb86953e 100644 --- a/doc/html/boost_regex/configuration.html +++ b/doc/html/boost_regex/configuration.html @@ -1,13 +1,13 @@ -Configuration + Configuration - + - + @@ -24,8 +24,7 @@
+ Configuration
Compiler Setup
Locale and traits @@ -37,7 +36,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/configuration/algorithm.html b/doc/html/boost_regex/configuration/algorithm.html index 50320abb..1c8cce84 100644 --- a/doc/html/boost_regex/configuration/algorithm.html +++ b/doc/html/boost_regex/configuration/algorithm.html @@ -1,13 +1,13 @@ -Algorithm Selection + Algorithm Selection - + - - - + + + @@ -24,8 +24,7 @@
+ Algorithm Selection
@@ -79,7 +78,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/configuration/compiler.html b/doc/html/boost_regex/configuration/compiler.html index ee8f55ea..6549e66e 100644 --- a/doc/html/boost_regex/configuration/compiler.html +++ b/doc/html/boost_regex/configuration/compiler.html @@ -1,13 +1,14 @@ -Compiler Setup + Compiler Setup - + - - - + + + @@ -24,8 +25,7 @@
+ Compiler Setup

You shouldn't need to do anything special to configure Boost.Regex for use with your compiler - the Boost.Config @@ -36,7 +36,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/configuration/linkage.html b/doc/html/boost_regex/configuration/linkage.html index a4959292..1711f2fc 100644 --- a/doc/html/boost_regex/configuration/linkage.html +++ b/doc/html/boost_regex/configuration/linkage.html @@ -1,13 +1,14 @@ -Linkage Options + Linkage Options - + - - - + + + @@ -24,8 +25,7 @@
+ Linkage Options
@@ -77,7 +77,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/configuration/locale.html b/doc/html/boost_regex/configuration/locale.html index 9b5c16c3..bfab7b14 100644 --- a/doc/html/boost_regex/configuration/locale.html +++ b/doc/html/boost_regex/configuration/locale.html @@ -1,13 +1,14 @@ -Locale and traits class selection + Locale and traits + class selection - + - - - + + + @@ -24,9 +25,9 @@
+ Locale and traits + class selection

The following macros (see user.hpp) control how Boost.Regex interacts with the user's locale: @@ -95,7 +96,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/configuration/tuning.html b/doc/html/boost_regex/configuration/tuning.html index c58319ac..05412d1d 100644 --- a/doc/html/boost_regex/configuration/tuning.html +++ b/doc/html/boost_regex/configuration/tuning.html @@ -1,13 +1,13 @@ -Algorithm Tuning + Algorithm Tuning - + - - - + + + @@ -24,8 +24,7 @@
+ Algorithm Tuning

The following option applies only if BOOST_REGEX_RECURSIVE is set.

@@ -140,7 +139,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/format.html b/doc/html/boost_regex/format.html index 1e24ee79..9efc4524 100644 --- a/doc/html/boost_regex/format.html +++ b/doc/html/boost_regex/format.html @@ -1,13 +1,14 @@ -Search and Replace Format String Syntax + Search and Replace Format String Syntax - + - - + + @@ -24,8 +25,7 @@
+ Search and Replace Format String Syntax
Sed Format String Syntax
Perl Format String Syntax
@@ -33,15 +33,16 @@ Format String Syntax

- Format strings are used by the algorithm regex_replace and by match_results<>::format, and are used to transform + Format strings are used by the algorithm regex_replace and by match_results<>::format, and are used to transform one string into another.

- There are three kind of format string: Sed, - Perl and Boost-Extended. + There are three kind of format string: Sed, + Perl and Boost-Extended.

- Alternatively, when the flag format_literal + Alternatively, when the flag format_literal is passed to one of these functions, then the format string is treated as a string literal, and is copied unchanged to the output.

@@ -54,7 +55,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/format/boost_format_syntax.html b/doc/html/boost_regex/format/boost_format_syntax.html index b2fc8352..134712c2 100644 --- a/doc/html/boost_regex/format/boost_format_syntax.html +++ b/doc/html/boost_regex/format/boost_format_syntax.html @@ -1,13 +1,14 @@ -Boost-Extended Format String Syntax + Boost-Extended + Format String Syntax - + - - - + + + @@ -24,25 +25,25 @@
+ Boost-Extended + Format String Syntax

Boost-Extended format strings treat all characters as literals except for '$', '\', '(', ')', '?', and ':'.

-
- +

+ Grouping -

+

The characters '(' and ')' perform lexical grouping, so use \( and \) if you want a to output literal parenthesis.

-
- +

+ Conditionals -

+

The character '?' begins a conditional expression, the general form is:

@@ -65,11 +66,11 @@ match found with "foo" if the sub-expression $1 was matched, and with "bar" otherwise.

-
- +

+ Placeholder Sequences -

+

Placeholder sequences specify that some part of what matched the regular expression should be sent to output as follows: @@ -160,11 +161,11 @@ Any $-placeholder sequence not listed above, results in '$' being treated as a literal.

-
- +

+ Escape Sequences -

+

An escape character followed by any character x, outputs that character unless x is one of the escape sequences shown below. @@ -389,7 +390,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/format/perl_format.html b/doc/html/boost_regex/format/perl_format.html index a04deb0a..94e2d7f0 100644 --- a/doc/html/boost_regex/format/perl_format.html +++ b/doc/html/boost_regex/format/perl_format.html @@ -1,13 +1,14 @@ -Perl Format String Syntax + Perl Format String Syntax - + - - - + + + @@ -24,8 +25,7 @@
+ Perl Format String Syntax

Perl-style format strings treat all characters as literals except '$' and '\' which start placeholder and escape sequences respectively. @@ -344,7 +344,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/format/sed_format.html b/doc/html/boost_regex/format/sed_format.html index 6a142e76..7e79ca46 100644 --- a/doc/html/boost_regex/format/sed_format.html +++ b/doc/html/boost_regex/format/sed_format.html @@ -1,13 +1,13 @@ -Sed Format String Syntax + Sed Format String Syntax - + - - - + + + @@ -24,8 +24,7 @@
+ Sed Format String Syntax

Sed-style format strings treat all characters as literals except:

@@ -235,7 +234,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/install.html b/doc/html/boost_regex/install.html index 9facdc5f..37092833 100644 --- a/doc/html/boost_regex/install.html +++ b/doc/html/boost_regex/install.html @@ -1,13 +1,14 @@ -Building and Installing the Library + Building and Installing the Library - + - - + + @@ -24,8 +25,7 @@
+ Building and Installing the Library

When you extract the library from its zip file, you must preserve its internal directory structure (for example by using the -d option when extracting). If @@ -48,20 +48,20 @@ it is necessary to build the library's support code into a library or archive file before you can use it, instructions for specific platforms are as follows:

-
- +

+ Building with bjam -

+

This is now the preferred method for building and installing this library, please refer to the getting started guide for more information.

-
- +

+ Building With Unicode and ICU Support -

+

A default build of this library does not enable Unciode support via ICU. There is no need to enable this support if you don't need it, but if you use ICU @@ -75,16 +75,16 @@

If you're building on a Unix-like platform, and ICU is already installed in - your compilers search path (with an install prefix of /usr or /usr/local - for example), then set the environment variable HAVE_ICU + your compilers search path (with an install prefix of /usr or /usr/local + for example), then set the environment variable HAVE_ICU to enable ICU support. For example you might build with the command line: 

bjam -sHAVE_ICU=1 --toolset=toolset-name install

If ICU is not already in your compiler's path then you need to set the environment - variable ICU_PATH to point + variable ICU_PATH to point to the root directory of your ICU installation, for example if ICU was installed - to /usr/local/icu/3.3 + to /usr/local/icu/3.3 you might use: 

bjam -sICU_PATH=/usr/local/icu/3.3 --toolset=toolset-name install
@@ -95,17 +95,17 @@ ensure that this is the case: it is up to you to ensure that the version of ICU you are using is binary compatible with the toolset you use to build Boost.

-
- +

+ Building via makefiles -

-
- +
+
+ Borland C++ Builder: -
+
  • - Open up a console window and change to the <boost>\libs\regex\build + Open up a console window and change to the <boost>\libs\regex\build directory.
  • @@ -127,7 +127,7 @@ 

    make -fbcb5.mak install

    - library files will be copied to <BCROOT>/lib and the dll's to <BCROOT>/bin, where <BCROOT> + library files will be copied to <BCROOT>/lib and the dll's to <BCROOT>/bin, where <BCROOT> corresponds to the install path of your Borland C++ tools.

    @@ -136,7 +136,7 @@ 

    make -fbcb5.mak clean

    - Finally when you use Boost.Regex it is only necessary for you to add the <boost> root director to your list of include directories + Finally when you use Boost.Regex it is only necessary for you to add the <boost> root director to your list of include directories for that project. It is not necessary for you to manually add a .lib file to the project; the headers will automatically select the correct .lib file for your build mode and tell the linker to include it. There is one caveat however: @@ -159,17 +159,17 @@ build of the lib) then define BOOST_REGEX_NO_LIB.

    - If you are building with C++ Builder 6, you will find that <boost/regex.hpp> - can not be used in a pre-compiled header (the actual problem is in <locale> which gets included by <boost/regex.hpp>), + If you are building with C++ Builder 6, you will find that <boost/regex.hpp> + can not be used in a pre-compiled header (the actual problem is in <locale> which gets included by <boost/regex.hpp>), if this causes problems for you, then try defining BOOST_NO_STD_LOCALE when building, this will disable some features throughout boost, but may save you a lot in compile times!

    -
    - +

    + Microsoft Visual C++ 6, 7, 7.1 and 8 -

    +

    You need version 6 or later of MSVC to build this library. If you are using VC5 then you may want to look at one of the previous releases of this library. @@ -177,7 +177,7 @@

    Open up a command prompt, which has the necessary MSVC environment variables defined (for example by using the batch file Vcvars32.bat installed by the - Visual Studio installation), and change to the <boost>\libs\regex\build directory. + Visual Studio installation), and change to the <boost>\libs\regex\build directory.

    Select the correct makefile - vc6.mak for "vanilla" Visual C++ 6 @@ -193,7 +193,7 @@ 

    nmake -fvc6.mak install

    - The lib files will be copied to your <VC6>\lib directory and the dll files to <VC6>\bin, where <VC6> is + The lib files will be copied to your <VC6>\lib directory and the dll files to <VC6>\bin, where <VC6> is the root of your Visual C++ 6 installation.

    @@ -207,7 +207,7 @@ 

    nmake ICU_PATH=c:\open-source\icu -fvc71.mak install

    - Finally when you use Boost.Regex it is only necessary for you to add the <boost> root directory to your list of include + Finally when you use Boost.Regex it is only necessary for you to add the <boost> root directory to your list of include directories for that project. It is not necessary for you to manually add a .lib file to the project; the headers will automatically select the correct .lib file for your build mode and tell the linker to include it. @@ -252,12 +252,12 @@ to modify the makefile to add /Zc:wchar_t before building the library.

-
- +
+ GCC(2.95 and later) -
+

- You can build with gcc using the normal boost Jamfile in <boost>/libs/regex/build, alternatively + You can build with gcc using the normal boost Jamfile in <boost>/libs/regex/build, alternatively there is a conservative makefile for the g++ compiler. From the command prompt change to the <boost>/libs/regex/build directory and type:

@@ -298,16 +298,16 @@ LIBS: additional library files.

- For the more adventurous there is a configure script in <boost>/libs/config; + For the more adventurous there is a configure script in <boost>/libs/config; see the config library documentation.

-
- +
+ Sun Workshop 6.1 -
+

There is a makefile for the sun (6.1) compiler (C++ version 3.12). From the - command prompt change to the <boost>/libs/regex/build directory + command prompt change to the <boost>/libs/regex/build directory and type: 

dmake -f sunpro.mak
@@ -316,7 +316,7 @@ single and multithread versions of the library (libboost_regex.a, libboost_regex.so, libboost_regex_mt.a and libboost_regex_mt.so). When you build projects that use Boost.Regex, you will need to add the boost install directory to your list - of include paths and add <boost>/libs/regex/build/sunpro/ to + of include paths and add <boost>/libs/regex/build/sunpro/ to your library search path.

@@ -342,23 +342,26 @@ This makefile does not set any architecture specific options like -xarch=v9, you can set these by defining the appropriate macros, for example:

-
dmake CXXFLAGS="-xarchv9" LDFLAGS"-xarchv9" LIBSUFFIX"_v9" -f sunpro.mak
+
dmake CXXFLAGS="-xarchv9" LDFLAGS"-xarchv9" LIBSUFFIX"_v9" -f sunpro.mak

will build v9 variants of the regex library named libboost_regex_v9.a etc.

-
- +
+ Makefiles for Other compilers -
+

- There is a generic makefile (generic.mak ) provided in <boost-root>/libs/regex/build - see that makefile for details of + There is a generic makefile (generic.mak ) provided in <boost-root>/libs/regex/build - see that makefile for details of environment variables that need to be set before use.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/introduction_and_overview.html b/doc/html/boost_regex/introduction_and_overview.html index a9132aa7..ad97c7eb 100644 --- a/doc/html/boost_regex/introduction_and_overview.html +++ b/doc/html/boost_regex/introduction_and_overview.html @@ -1,13 +1,14 @@ -Introduction and Overview +Introduction and + Overview - + - - + + @@ -24,9 +25,9 @@
+Introduction and + Overview

Regular expressions are a form of pattern-matching that are often used in text processing; many users will be familiar with the Unix utilities grep, sed and @@ -39,11 +40,11 @@ libraries can not do.

- 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, + 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 - expression algorithms. Like std::basic_string + expression algorithms. Like std::basic_string there are two typedefs that are almost always the means by which this class is referenced:

@@ -99,7 +100,7 @@ regular expression engine, consequently escapes in regular expressions have to be doubled up when embedding them in C/C++ code. Also note that all the examples assume that your compiler supports argument-dependent-lookup lookup, - if yours doesn't (for example VC6), then you will have to add some boost:: prefixes + if yours doesn't (for example VC6), then you will have to add some boost:: prefixes to some of the function calls in the examples.

@@ -112,7 +113,7 @@ 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: 

@@ -141,7 +142,7 @@
       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:
     

 
@@ -155,12 +156,12 @@
 }
 

 

-      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 +170,22 @@
       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
-      class has a format member that
+      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 +193,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
@@ -205,7 +207,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/partial_matches.html b/doc/html/boost_regex/partial_matches.html index c02f0333..b5befab7 100644 --- a/doc/html/boost_regex/partial_matches.html +++ b/doc/html/boost_regex/partial_matches.html @@ -1,13 +1,14 @@ -Partial Matches + Partial Matches - + - - + + @@ -24,13 +25,13 @@
+ Partial Matches

- The match_flag_type - match_partial can be passed - to the following algorithms: regex_match, regex_search, and regex_grep, and used with the iterator - regex_iterator. + The match_flag_type + match_partial can be passed + 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 +41,10 @@ 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):

@@ -184,7 +186,7 @@

The following example tests to see whether the text could be a valid credit card number, as the user presses a key, the character entered would be added - to the string being built up, and passed to is_possible_card_number. + to the string being built up, and passed to is_possible_card_number. If this returns true then the text could be a valid card number, so the user interface's OK button would be enabled. If it returns false, then this is not yet a valid card number, but could be with more input, so the user interface @@ -295,7 +297,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref.html b/doc/html/boost_regex/ref.html index 814fbecd..5bf87bab 100644 --- a/doc/html/boost_regex/ref.html +++ b/doc/html/boost_regex/ref.html @@ -1,13 +1,14 @@ -Reference + Reference - + - - + + @@ -24,8 +25,7 @@
+ Reference
basic_regex
match_results
@@ -130,7 +130,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/bad_expression.html b/doc/html/boost_regex/ref/bad_expression.html index 52d66acd..53c10241 100644 --- a/doc/html/boost_regex/ref/bad_expression.html +++ b/doc/html/boost_regex/ref/bad_expression.html @@ -1,13 +1,13 @@ -bad_expression + bad_expression - + - - - + + + @@ -24,17 +24,16 @@
-
- + bad_expression
+

+ Synopsis -

+ 
 #include <boost/pattern_except.hpp>

- The class regex_error defines + 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.

@@ -55,46 +54,49 @@ }// namespace boost -
- +

+ Description -

+ 
 regex_error(const std::string& s, regex_constants::error_type err, std::ptrdiff_t pos);
 regex_error(boost::regex_constants::error_type err);

- Effects: Constructs an object of class regex_error. + Effects: Constructs an object of class regex_error. 

 boost::regex_constants::error_type code()const;

- Effects: returns the error code that represents + Effects: returns the error code that represents parsing error that occurred. 

 std::ptrdiff_t position()const;

- Effects: returns the location in the expression + Effects: returns the location in the expression where parsing stopped.

- Footnotes: the choice of std::runtime_error - as the base class for regex_error + Footnotes: the choice of std::runtime_error + as the base class for regex_error is moot; depending upon how the library is used exceptions may be either logic errors (programmer supplied expressions) or run time errors (user supplied - expressions). The library previously used bad_pattern - and bad_expression for errors, - these have been replaced by the single class regex_error + expressions). The library previously used bad_pattern + and bad_expression for errors, + these have been replaced by the single class regex_error to keep the library in synchronization with the Technical Report on C++ Library Extensions.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/basic_regex.html b/doc/html/boost_regex/ref/basic_regex.html index 06568384..905f35e0 100644 --- a/doc/html/boost_regex/ref/basic_regex.html +++ b/doc/html/boost_regex/ref/basic_regex.html @@ -1,13 +1,13 @@ -basic_regex + basic_regex - + - - - + + + @@ -24,38 +24,39 @@
-
- + basic_regex
+

+ Synopsis -

+ 
 #include <boost/regex.hpp>

- The template class basic_regex + The template class basic_regex encapsulates regular expression parsing and compilation. The class takes two template parameters:

- For ease of use there are two typedefs that define the two standard basic_regex instances, unless you want + 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: 

@@ -70,9 +71,9 @@
 }

- The definition of basic_regex - follows: it is based very closely on class basic_string, - and fulfils the requirements for a constant-container of charT. + The definition of basic_regex + follows: it is based very closely on class basic_string, + and fulfils the requirements for a constant-container of charT. 

 namespace boost{
@@ -88,66 +89,66 @@
    typedef          const charT&                         const_reference;           
    typedef          std::ptrdiff_t                       difference_type;                 
    typedef          std::size_t                          size_type;
-   typedef          regex_constants:: syntax_option_type  flag_type;
+   typedef          regex_constants:: syntax_option_type  flag_type;
    typedef typename traits::locale_type                  locale_type;
 
    // constants:
    // main option selection:
-   static const regex_constants:: syntax_option_type normal          
+   static const regex_constants:: syntax_option_type normal          
                                                 = regex_constants::normal;
-   static const regex_constants:: syntax_option_type ECMAScript      
+   static const regex_constants:: syntax_option_type ECMAScript      
                                                 = normal;
-   static const regex_constants:: syntax_option_type JavaScript      
+   static const regex_constants:: syntax_option_type JavaScript      
                                                 = normal;
-   static const regex_constants:: syntax_option_type JScript         
+   static const regex_constants:: syntax_option_type JScript         
                                                 = normal;
-   static const regex_constants:: syntax_option_type basic           
+   static const regex_constants:: syntax_option_type basic           
                                                 = regex_constants::basic;
-   static const regex_constants:: syntax_option_type extended        
+   static const regex_constants:: syntax_option_type extended        
                                                 = regex_constants::extended;
-   static const regex_constants:: syntax_option_type awk             
+   static const regex_constants:: syntax_option_type awk             
                                                 = regex_constants::awk;
-   static const regex_constants:: syntax_option_type grep            
+   static const regex_constants:: syntax_option_type grep            
                                                 = regex_constants::grep;
-   static const regex_constants:: syntax_option_type egrep           
+   static const regex_constants:: syntax_option_type egrep           
                                                 = regex_constants::egrep;
-   static const regex_constants:: syntax_option_type sed             
+   static const regex_constants:: syntax_option_type sed             
                                                 = basic = regex_constants::sed;
-   static const regex_constants:: syntax_option_type perl            
+   static const regex_constants:: syntax_option_type perl            
                                                 = regex_constants::perl;
-   static const regex_constants:: syntax_option_type literal         
+   static const regex_constants:: syntax_option_type literal         
                                                 = regex_constants::literal;
 
    // modifiers specific to perl expressions:
-   static const regex_constants:: syntax_option_type no_mod_m        
+   static const regex_constants:: syntax_option_type no_mod_m        
                                                 = regex_constants::no_mod_m;
-   static const regex_constants:: syntax_option_type no_mod_s        
+   static const regex_constants:: syntax_option_type no_mod_s        
                                                 = regex_constants::no_mod_s;
-   static const regex_constants:: syntax_option_type mod_s           
+   static const regex_constants:: syntax_option_type mod_s           
                                                 = regex_constants::mod_s;
-   static const regex_constants:: syntax_option_type mod_x           
+   static const regex_constants:: syntax_option_type mod_x           
                                                 = regex_constants::mod_x;
 
    // modifiers specific to POSIX basic expressions:
-   static const regex_constants:: syntax_option_type bk_plus_qm      
+   static const regex_constants:: syntax_option_type bk_plus_qm      
                                                 = regex_constants::bk_plus_qm;
-   static const regex_constants:: syntax_option_type bk_vbar         
+   static const regex_constants:: syntax_option_type bk_vbar         
                                                 = regex_constants::bk_vbar
-   static const regex_constants:: syntax_option_type no_char_classes 
+   static const regex_constants:: syntax_option_type no_char_classes 
                                                 = regex_constants::no_char_classes
-   static const regex_constants:: syntax_option_type no_intervals    
+   static const regex_constants:: syntax_option_type no_intervals    
                                                 = regex_constants::no_intervals
 
    // common modifiers:
-   static const regex_constants:: syntax_option_type nosubs          
+   static const regex_constants:: syntax_option_type nosubs          
                                                 = regex_constants::nosubs;
-   static const regex_constants:: syntax_option_type optimize        
+   static const regex_constants:: syntax_option_type optimize        
                                                 = regex_constants::optimize;
-   static const regex_constants:: syntax_option_type collate         
+   static const regex_constants:: syntax_option_type collate         
                                                 = regex_constants::collate;
-   static const regex_constants:: syntax_option_type newline_alt     
+   static const regex_constants:: syntax_option_type newline_alt     
                                                 = regex_constants::newline_alt;
-   static const regex_constants:: syntax_option_type no_except       
+   static const regex_constants:: syntax_option_type no_except       
                                                 = regex_constants::newline_alt;
 
    // construct/copy/destroy:
@@ -245,79 +246,79 @@
 
 } // namespace boost
-
- +

+ Description -

+

- Class basic_regex has the + Class basic_regex has the following public members: 

 // main option selection:
-static const regex_constants:: syntax_option_type normal           
+static const regex_constants:: syntax_option_type normal           
                                           = regex_constants::normal;
-static const regex_constants:: syntax_option_type ECMAScript       
+static const regex_constants:: syntax_option_type ECMAScript       
                                           = normal;
-static const regex_constants:: syntax_option_type JavaScript       
+static const regex_constants:: syntax_option_type JavaScript       
                                           = normal;
-static const regex_constants:: syntax_option_type JScript          
+static const regex_constants:: syntax_option_type JScript          
                                           = normal;
-static const regex_constants:: syntax_option_type basic            
+static const regex_constants:: syntax_option_type basic            
                                           = regex_constants::basic;
-static const regex_constants:: syntax_option_type extended         
+static const regex_constants:: syntax_option_type extended         
                                           = regex_constants::extended;
-static const regex_constants:: syntax_option_type awk              
+static const regex_constants:: syntax_option_type awk              
                                           = regex_constants::awk;
-static const regex_constants:: syntax_option_type grep             
+static const regex_constants:: syntax_option_type grep             
                                           = regex_constants::grep;
-static const regex_constants:: syntax_option_type egrep            
+static const regex_constants:: syntax_option_type egrep            
                                           = regex_constants::egrep;
-static const regex_constants:: syntax_option_type sed              
+static const regex_constants:: syntax_option_type sed              
                                           = regex_constants::sed;
-static const regex_constants:: syntax_option_type perl             
+static const regex_constants:: syntax_option_type perl             
                                           = regex_constants::perl;
-static const regex_constants:: syntax_option_type literal          
+static const regex_constants:: syntax_option_type literal          
                                           = regex_constants::literal;
 
 // modifiers specific to perl expressions:
-static const regex_constants:: syntax_option_type no_mod_m         
+static const regex_constants:: syntax_option_type no_mod_m         
                                           = regex_constants::no_mod_m;
-static const regex_constants:: syntax_option_type no_mod_s         
+static const regex_constants:: syntax_option_type no_mod_s         
                                           = regex_constants::no_mod_s;
-static const regex_constants:: syntax_option_type mod_s            
+static const regex_constants:: syntax_option_type mod_s            
                                           = regex_constants::mod_s;
-static const regex_constants:: syntax_option_type mod_x            
+static const regex_constants:: syntax_option_type mod_x            
                                           = regex_constants::mod_x;
 
 // modifiers specific to POSIX basic expressions:
-static const regex_constants:: syntax_option_type bk_plus_qm       
+static const regex_constants:: syntax_option_type bk_plus_qm       
                                           = regex_constants::bk_plus_qm;
-static const regex_constants:: syntax_option_type bk_vbar          
+static const regex_constants:: syntax_option_type bk_vbar          
                                           = regex_constants::bk_vbar
-static const regex_constants:: syntax_option_type no_char_classes  
+static const regex_constants:: syntax_option_type no_char_classes  
                                           = regex_constants::no_char_classes
-static const regex_constants:: syntax_option_type no_intervals     
+static const regex_constants:: syntax_option_type no_intervals     
                                           = regex_constants::no_intervals
 
 // common modifiers:
-static const regex_constants:: syntax_option_type nosubs           
+static const regex_constants:: syntax_option_type nosubs           
                                           = regex_constants::nosubs;
-static const regex_constants:: syntax_option_type optimize         
+static const regex_constants:: syntax_option_type optimize         
                                           = regex_constants::optimize;
-static const regex_constants:: syntax_option_type collate          
+static const regex_constants:: syntax_option_type collate          
                                           = regex_constants::collate;
-static const regex_constants:: syntax_option_type newline_alt      
+static const regex_constants:: syntax_option_type newline_alt      
                                           = regex_constants::newline_alt;

- 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 - declared in namespace boost::regex_constants + in namespace boost::regex_constants; for each constant of 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.

@@ -327,12 +328,12 @@ basic_regex();

- Effects: Constructs an object of class - basic_regex. + Effects: Constructs an object of class + basic_regex.

-

Table 1. basic_regex default construction postconditions

-
+

Table 1. basic_regex default construction postconditions

+
@@ -353,67 +354,67 @@ -

- empty() + empty()

- true + true

- size() + size()

- 0 + 0

- str() + str()

- basic_string<charT>() + basic_string<charT>()

+
-

+

 basic_regex(const charT* p, flag_type f = regex_constants::normal);

- Requires: p shall not + Requires: p shall not be a null pointer.

- Throws: bad_expression if p - is not a valid regular expression, unless the flag no_except + 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; + Effects: Constructs an object of class + basic_regex; the object's internal finite state machine is constructed from the regular expression contained in the null-terminated string p, - and interpreted according to the option + and interpreted according to the option flags specified in f.

-

Table 2. Postconditions for basic_regex construction

-
+

Table 2. Postconditions for basic_regex construction

+
@@ -434,43 +435,43 @@ -

- empty() + empty()

- false + false

- size() + size()

- char_traits<charT>::length(p) + char_traits<charT>::length(p)

- str() + str()

- basic_string<charT>(p) + basic_string<charT>(p)

- flags() + flags()

@@ -482,7 +483,7 @@

- mark_count() + mark_count()

@@ -492,34 +493,34 @@
+
-

+

 basic_regex(const charT* p1, const charT* p2, 
             flag_type f = regex_constants::normal);

- Requires: p1 and p2 - are not null pointers, p1 < p2. + Requires: p1 and p2 + are not null pointers, p1 < p2.

- Throws: bad_expression if [p1,p2) is not - a valid regular expression, unless the flag no_except + Throws: bad_expression if [p1,p2) is not + a valid regular expression, unless the flag no_except is set in f.

- Effects: Constructs an object of class - basic_regex; + Effects: Constructs an object of class + 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

+
@@ -540,43 +541,43 @@ -

- empty() + empty()

- false + false

- size() + size()

- std::distance(p1,p2) + std::distance(p1,p2)

- str() + str()

- basic_string<charT>(p1,p2) + basic_string<charT>(p1,p2)

- flags() + flags()

@@ -588,7 +589,7 @@

- mark_count() + mark_count()

@@ -598,33 +599,33 @@
+
-

+

 basic_regex(const charT* p, size_type len, flag_type f);

- Requires: p shall not - be a null pointer, len < - max_size(). + Requires: p shall not + be a null pointer, len < + max_size().

- Throws: bad_expression if p - is not a valid regular expression, unless the flag no_except + 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; + Effects: Constructs an object of class + 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

+
@@ -645,19 +646,19 @@ -

- empty() + empty()

- false + false

- size() + size()

@@ -669,19 +670,19 @@

- str() + str()

- basic_string<charT>(p, len) + basic_string<charT>(p, len)

- flags() + flags()

@@ -693,7 +694,7 @@

- mark_count() + mark_count()

@@ -703,16 +704,16 @@
+
-

+

 basic_regex(const basic_regex& e);

- Effects: Constructs an object of class - basic_regex + Effects: Constructs an object of class + basic_regex as a copy of the object e.

@@ -723,21 +724,21 @@ flag_type f = regex_constants::normal);

- Throws: bad_expression if s - is not a valid regular expression, unless the flag no_except + 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; + Effects: Constructs an object of class + 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

+
@@ -758,31 +759,31 @@ -

- empty() + empty()

- false + false

- size() + size()

- s.size() + s.size()

- str() + str()

@@ -794,7 +795,7 @@

- flags() + flags()

@@ -806,7 +807,7 @@

- mark_count() + mark_count()

@@ -816,9 +817,9 @@
+
-

+

 template <class ForwardIterator>
@@ -826,21 +827,21 @@
             flag_type f = regex_constants::normal);

- Throws: bad_expression if the sequence [first, - last) is not a valid regular expression, unless the flag no_except + 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; + Effects: Constructs an object of class + 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

+
@@ -861,43 +862,43 @@ -

- empty() + empty()

- false + false

- size() + size()

- distance(first,last) + distance(first,last)

- str() + str()

- basic_string<charT>(first,last) + basic_string<charT>(first,last)

- flags() + flags()

@@ -909,7 +910,7 @@

- mark_count() + mark_count()

@@ -919,15 +920,15 @@
+
-

+

 basic_regex& operator=(const basic_regex& e);

- Effects: Returns the result of assign(e.str(), e.flags()). + Effects: Returns the result of assign(e.str(), e.flags()).

@@ -935,11 +936,11 @@ basic_regex& operator=(const charT* ptr);

- Requires: p shall not + Requires: p shall not be a null pointer.

- Effects: Returns the result of assign(ptr). + Effects: Returns the result of assign(ptr).

@@ -948,7 +949,7 @@ basic_regex& operator=(const basic_string<charT, ST, SA>& p);

- Effects: Returns the result of assign(p). + Effects: Returns the result of assign(p).

@@ -956,7 +957,7 @@ const_iterator begin() const;

- Effects: Returns a starting iterator to + Effects: Returns a starting iterator to a sequence of characters representing the regular expression.

@@ -965,7 +966,7 @@ const_iterator end() const;

- Effects: Returns termination iterator to + Effects: Returns termination iterator to a sequence of characters representing the regular expression.

@@ -974,7 +975,7 @@ size_type size() const;

- Effects: Returns the length of the sequence + Effects: Returns the length of the sequence of characters representing the regular expression.

@@ -983,7 +984,7 @@ size_type max_size() const;

- Effects: Returns the maximum length of the + Effects: Returns the maximum length of the sequence of characters representing the regular expression.

@@ -992,7 +993,7 @@ bool empty() const;

- Effects: Returns true if the object does + Effects: Returns true if the object does not contain a valid regular expression, otherwise false.

@@ -1001,7 +1002,7 @@ unsigned mark_count() const;

- Effects: Returns the number of marked sub-expressions + Effects: Returns the number of marked sub-expressions within the regular expresion.

@@ -1010,7 +1011,7 @@ basic_regex& assign(const basic_regex& that);

- Effects: Returns assign(that.str(), that.flags()). + Effects: Returns assign(that.str(), that.flags()).

@@ -1018,7 +1019,7 @@ basic_regex& assign(const charT* ptr, flag_type f = regex_constants::normal);

- Effects: Returns assign(string_type(ptr), f). + Effects: Returns assign(string_type(ptr), f).

@@ -1026,7 +1027,7 @@ basic_regex& assign(const charT* ptr, unsigned int len, flag_type f);

- Effects: Returns assign(string_type(ptr, len), f). + Effects: Returns assign(string_type(ptr, len), f).

@@ -1036,22 +1037,22 @@ flag_type f = regex_constants::normal);

- Throws: bad_expression if s - is not a valid regular expression, unless the flag no_except + Throws: bad_expression if s + is not a valid regular expression, unless the flag no_except is set in f.

- Returns: *this. + Returns: *this.

- Effects: Assigns the regular expression + Effects: Assigns the regular expression contained in the string s, interpreted according the - option flags specified + option flags specified in f.

-

Table 7. Postconditions for basic_regex::assign

-
+

Table 7. Postconditions for basic_regex::assign

+
@@ -1072,31 +1073,31 @@ -

- empty() + empty()

- false + false

- size() + size()

- s.size() + s.size()

- str() + str()

@@ -1108,7 +1109,7 @@

- flags() + flags()

@@ -1120,7 +1121,7 @@

- mark_count() + mark_count()

@@ -1130,9 +1131,9 @@
+
-

+

 template <class InputIterator>
@@ -1140,12 +1141,12 @@
                     flag_type f = regex_constants::normal);

- Requires: The type InputIterator + Requires: The type InputIterator corresponds to the Input Iterator requirements (24.1.1).

- Effects: Returns assign(string_type(first, last), f). + Effects: Returns assign(string_type(first, last), f).

@@ -1153,9 +1154,9 @@ flag_type flags() const;

- Effects: Returns a copy of the regular + Effects: Returns a copy of the regular expression syntax flags that were passed to the object's constructor, - or the last call to assign. + or the last call to assign.

@@ -1163,7 +1164,7 @@ int status() const;

- Effects: Returns zero if the expression + Effects: Returns zero if the expression contains a valid regular expression, otherwise an error code. This member function is retained for use in environments that cannot use exception handling.

@@ -1173,7 +1174,7 @@ basic_string<charT> str() const;

- Effects: Returns a copy of the character + Effects: Returns a copy of the character sequence passed to the object's constructor, or the last call to assign.

@@ -1182,9 +1183,9 @@ int compare(basic_regex& e)const;

- Effects: If flags() == e.flags() then returns str().compare(e.str()), - otherwise returns flags() - - e.flags(). + Effects: If flags() == e.flags() then returns str().compare(e.str()), + otherwise returns flags() + - e.flags().

@@ -1192,14 +1193,14 @@ locale_type imbue(locale_type l);

- Effects: Returns the result of traits_inst.imbue(l) where - traits_inst is a (default - initialized) instance of the template parameter traits - stored within the object. Calls to imbue + Effects: Returns the result of traits_inst.imbue(l) where + traits_inst is a (default + initialized) instance of the template parameter traits + stored within the object. Calls to imbue invalidate any currently contained regular expression.

- Postcondition: empty() == true. + Postcondition: empty() == true.

@@ -1207,8 +1208,8 @@ locale_type getloc() const;

- Effects: Returns the result of traits_inst.getloc() - where traits_inst is a (default + Effects: Returns the result of traits_inst.getloc() + where traits_inst is a (default initialized) instance of the template parameter traits stored within the object.

@@ -1218,28 +1219,28 @@ void swap(basic_regex& e) throw();

- Effects: Swaps the contents of the two regular + Effects: Swaps the contents of the two regular expressions.

- Postcondition: *this contains the regular expression that + Postcondition: *this contains the regular expression that was in e, e contains the regular - expression that was in *this. + expression that was in *this.

- Complexity: constant time. + Complexity: constant time.

-
[Note] 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.

@@ -1250,8 +1251,8 @@ const basic_regex<charT, traits>& rhs);

- Effects: Returns lhs.compare(rhs) - == 0. + Effects: Returns lhs.compare(rhs) + == 0.

@@ -1261,8 +1262,8 @@ const basic_regex<charT, traits>& rhs);

- Effects: Returns lhs.compare(rhs) - != 0. + Effects: Returns lhs.compare(rhs) + != 0.

@@ -1272,8 +1273,8 @@ const basic_regex<charT, traits>& rhs);

- Effects: Returns lhs.compare(rhs) - < 0. + Effects: Returns lhs.compare(rhs) + < 0.

@@ -1283,8 +1284,8 @@ const basic_regex<charT, traits>& rhs);

- Effects: Returns lhs.compare(rhs) - <= 0. + Effects: Returns lhs.compare(rhs) + <= 0.

@@ -1294,8 +1295,8 @@ const basic_regex<charT, traits>& rhs);

- Effects: Returns lhs.compare(rhs) - >= 0. + Effects: Returns lhs.compare(rhs) + >= 0.

@@ -1305,15 +1306,15 @@ const basic_regex<charT, traits>& rhs);

- Effects: Returns lhs.compare(rhs) - > 0. + Effects: Returns lhs.compare(rhs) + > 0.

- @@ -1327,7 +1328,7 @@ constbasic_regex<charT,re_traits>&e);

- Effects: Returns (os << e.str()). + Effects: Returns (os << e.str()).

@@ -1337,12 +1338,15 @@ basic_regex<charT,traits>&rhs);

- Effects: calls lhs.swap(rhs). + Effects: calls lhs.swap(rhs).

[Note] Note

+

The basic_regex stream inserter is provided on an experimental basis, and outputs the textual representation of the expression to the stream.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/concepts.html b/doc/html/boost_regex/ref/concepts.html index fe2ea0cb..92dd469b 100644 --- a/doc/html/boost_regex/ref/concepts.html +++ b/doc/html/boost_regex/ref/concepts.html @@ -1,13 +1,13 @@ -Concepts + Concepts - + - - - + + + @@ -24,8 +24,7 @@
+ Concepts
charT Requirements
Traits Class @@ -36,7 +35,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/concepts/charT_concept.html b/doc/html/boost_regex/ref/concepts/charT_concept.html index 5deae2df..b4a51491 100644 --- a/doc/html/boost_regex/ref/concepts/charT_concept.html +++ b/doc/html/boost_regex/ref/concepts/charT_concept.html @@ -1,13 +1,14 @@ -charT Requirements + charT Requirements - + - - - + + + @@ -24,17 +25,16 @@
+ charT Requirements

- Type charT used a template - argument to class template basic_regex, must have a trivial + Type charT used a template + 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 - and c2 of type charT - const, and i - of type int: + of type charT, c1 + and c2 of type charT + const, and i + of type int:

@@ -258,7 +258,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/concepts/iterator_concepts.html b/doc/html/boost_regex/ref/concepts/iterator_concepts.html index f65480a8..8e117a29 100644 --- a/doc/html/boost_regex/ref/concepts/iterator_concepts.html +++ b/doc/html/boost_regex/ref/concepts/iterator_concepts.html @@ -1,12 +1,14 @@ -Iterator Rrequirements + Iterator + Rrequirements - + - - + + @@ -24,16 +26,19 @@
+ Iterator + Rrequirements

The regular expression algorithms (and iterators) take all require a Bidirectional-Iterator.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/concepts/traits_concept.html b/doc/html/boost_regex/ref/concepts/traits_concept.html index d791f879..5a634cad 100644 --- a/doc/html/boost_regex/ref/concepts/traits_concept.html +++ b/doc/html/boost_regex/ref/concepts/traits_concept.html @@ -1,13 +1,15 @@ -Traits Class Requirements + Traits Class + Requirements - + - - - + + + @@ -24,37 +26,37 @@
+ Traits Class + Requirements

- There are two sets of requirements for the traits - template argument to basic_regex: a mininal interface + There are two sets of requirements for the traits + template argument to basic_regex: a mininal interface (which is part of the regex standardization proposal), and an optional Boost-specific enhanced interface.

-
- +

+ Minimal requirements. -

+

- In the following table X + In the following table X denotes a traits class defining types and functions for the character container - type charT; u - is an object of type X; - v is an object of type const - X; p is - a value of type const charT*; I1 and I2 - are Input Iterators; c is a value of type const charT; - s is an object of type X::string_type; - cs is an object of type const - X::string_type; b is - a value of type bool; I - is a value of type int; F1 - and F2 are values of type const - charT*; - and loc is an object of type X::locale_type. + type charT; u + is an object of type X; + v is an object of type const + X; p is + a value of type const charT*; I1 and I2 + are Input Iterators; c is a value of type const charT; + s is an object of type X::string_type; + cs is an object of type const + X::string_type; b is + a value of type bool; I + is a value of type int; F1 + and F2 are values of type const + charT*; + and loc is an object of type X::locale_type.

@@ -400,17 +402,17 @@
-
- +

+ Additional Optional Requirements -

+

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 - or absense of the member boost_extensions_tag + requirements must be met; basic_regex will detect the presence + or absense of the member boost_extensions_tag and configure itself appropriately.

@@ -491,8 +493,8 @@ that signifies the meaning of character c within the regular expression grammar, when c has been preceded by an escape character. Precondition: if b is the character preceding c in the expression being parsed - then: v.syntax_type(b) - == syntax_escape + then: v.syntax_type(b) + == syntax_escape

@@ -510,9 +512,9 @@ @@ -529,9 +531,9 @@ @@ -336,17 +338,17 @@ @@ -354,19 +356,19 @@ @@ -513,20 +515,20 @@ @@ -551,20 +553,20 @@ @@ -586,20 +588,20 @@ @@ -623,14 +625,14 @@

Returns a character d such that: for any character d that is to - be considered equivalent to c then v.translate(c,false)==v.translate(d,false). Likewise for all characters C + be considered equivalent to c then v.translate(c,false)==v.translate(d,false). Likewise for all characters C that are to be considered equivalent to c when comparisons are - to be performed without regard to case, then v.translate(c,true)==v.translate(C,true). + to be performed without regard to case, then v.translate(c,true)==v.translate(C,true).

- Behaves as follows: if p - == q - or if *p + Behaves as follows: if p + == q + or if *p is not a digit character then returns -1. Otherwise performs formatted numeric input on the sequence [p,q) and returns the result as an int. Postcondition: either p == q or *p is a non-digit character. @@ -599,7 +601,10 @@ - +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/deprecated_interfaces.html b/doc/html/boost_regex/ref/deprecated_interfaces.html index 07045e17..7d3f52f1 100644 --- a/doc/html/boost_regex/ref/deprecated_interfaces.html +++ b/doc/html/boost_regex/ref/deprecated_interfaces.html @@ -3,11 +3,13 @@ Deprecated Interfaces - + - - - + + + @@ -24,8 +26,7 @@
+Deprecated Interfaces
regex_format (Deprecated)
@@ -47,7 +48,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/deprecated_interfaces/old_regex.html b/doc/html/boost_regex/ref/deprecated_interfaces/old_regex.html index ba37fb11..ea155135 100644 --- a/doc/html/boost_regex/ref/deprecated_interfaces/old_regex.html +++ b/doc/html/boost_regex/ref/deprecated_interfaces/old_regex.html @@ -1,12 +1,14 @@ -High Level Class RegEx (Deprecated) + High + Level Class RegEx (Deprecated) - + - + @@ -24,9 +26,9 @@
+ High + Level Class RegEx (Deprecated)

The high level wrapper class RegEx is now deprecated and does not form part of the regular expression standardization proposal. This type still @@ -136,7 +138,7 @@

- RegEx(); + RegEx();

@@ -149,7 +151,7 @@

- RegEx(const RegEx& o); + RegEx(const RegEx& o);

@@ -162,40 +164,40 @@

- RegEx(const char* c, bool + RegEx(const char* c, bool icase = - false); + false);

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.

- RegEx(const std::string& s, bool + RegEx(const std::string& s, bool icase = - false); + false);

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.

- RegEx& - operator=(const RegEx& o); + RegEx& + operator=(const RegEx& o);

@@ -207,68 +209,68 @@

- RegEx& - operator=(const char* p); + RegEx& + operator=(const char* p);

- 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.

- RegEx& - operator=(const std::string& s); + RegEx& + operator=(const std::string& s);

- 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.

- unsigned int + unsigned int SetExpression(constchar* p, bool icase - = false); + = false);

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.

- unsigned int + unsigned int SetExpression(const std::string& s, bool icase = - false); + false);

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.

- std::string Expression()const; + std::string Expression()const;

@@ -280,17 +282,17 @@

- bool Match(const + bool Match(const char* p, boost::match_flag_type flags - = match_default); + = match_default);

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.

@@ -299,17 +301,17 @@

- bool Match(const + bool Match(const std::string& s, boost::match_flag_type flags - = match_default); + = match_default);

Attempts to match the current expression against the text s - using the match_flag_type flags. + using the match_flag_type flags. Returns true if the expression matches the whole of the input string.

@@ -318,17 +320,17 @@

- bool Search(const + bool Search(const char* p, boost::match_flag_type flags - = match_default); + = match_default);

Attempts to find a match for the current expression somewhere in - the text p using the match_flag_type flags. + the text p using the match_flag_type flags. Returns true if the match succeeds.

- bool Search(const + bool Search(const std::string& s, boost::match_flag_type flags - = match_default); + = match_default);

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.

- unsigned int + unsigned int Grep(GrepCallback cb, const char* p, boost::match_flag_type flags - = match_default); + = match_default);

Finds all matches of the current expression in the text p - using the match_flag_type flags. - For each match found calls the call-back function cb as: cb(*this); + 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 are found. Returns the number of matches found. @@ -376,19 +378,19 @@

- unsigned int + unsigned int Grep(GrepCallback cb, const std::string& s, boost::match_flag_type flags - = match_default); + = match_default);

Finds all matches of the current expression in the text s - using the match_flag_type flags. - For each match found calls the call-back function cb as: cb(*this); + 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 are found. Returns the number of matches found. @@ -398,18 +400,18 @@

- unsigned int + unsigned int Grep(std::vector<std::string>& v, const char* p, boost::match_flag_type flags = - match_default); + match_default);

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.

@@ -418,18 +420,18 @@

- unsigned int + unsigned int Grep(std::vector<std::string>& v, const std::string& s, boost::match_flag_type flags = - match_default); + match_default);

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 pushes a copy of what matched onto v. Returns the number of matches found.

@@ -438,18 +440,18 @@

- unsigned int + unsigned int Grep(std::vector<unsigned int>& v, const char* p, boost::match_flag_type flags - = match_default); + = match_default);

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 the starting index of what matched onto v. Returns the number of matches found.

@@ -458,18 +460,18 @@

- unsigned int + unsigned int Grep(std::vector<unsigned int>& v, const std::string& s, boost::match_flag_type flags - = match_default); + = match_default);

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 pushes the starting index of what matched onto v. Returns the number of matches found.

@@ -478,20 +480,20 @@

- unsigned int + unsigned int GrepFiles(GrepFileCallback cb, const char* files, bool recurse = false, boost::match_flag_type flags = - match_default); + match_default);

Finds all matches of the current expression in the files files - using the match_flag_type flags. + using the match_flag_type flags. 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. @@ -505,7 +507,7 @@ Returns the total number of matches found.

- May throw an exception derived from std::runtime_error + May throw an exception derived from std::runtime_error if file io fails.

- unsigned int + unsigned int GrepFiles(GrepFileCallback cb, const std::string& files, bool recurse = false, boost::match_flag_type flags = - match_default); + match_default);

Finds all matches of the current expression in the files files - using the match_flag_type flags. + using the match_flag_type flags. For each match calls the call-back function cb.

@@ -543,7 +545,7 @@ Returns the total number of matches found.

- May throw an exception derived from std::runtime_error + May throw an exception derived from std::runtime_error if file io fails.

- unsigned int + unsigned int FindFiles(FindFilesCallback cb, const char* files, bool recurse = false, boost::match_flag_type flags = - match_default); + match_default);

Searches files to find all those which contain at least one match - of the current expression using the match_flag_type flags. + of the current expression using the match_flag_type flags. 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. @@ -578,7 +580,7 @@ Returns the total number of files found.

- May throw an exception derived from std::runtime_error + May throw an exception derived from std::runtime_error if file io fails.

- unsigned int + unsigned int FindFiles(FindFilesCallback cb, const std::string& files, bool recurse = false, boost::match_flag_type flags = - match_default); + match_default);

Searches files to find all those which contain at least one match - of the current expression using the match_flag_type flags. + of the current expression using the match_flag_type flags. For each matching file calls the call-back function cb.

@@ -615,7 +617,7 @@ Returns the total number of files found.

- May throw an exception derived from std::runtime_error + May throw an exception derived from std::runtime_error if file io fails.

- std::string Merge(const + std::string Merge(const std::string& in, const std::string& fmt, bool copy = true, boost::match_flag_type flags - = match_default); + = match_default);

@@ -643,22 +645,22 @@ 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.

- std::string Merge(const + std::string Merge(const char* in, const char* fmt, bool copy = true, boost::match_flag_type flags - = match_default); + = match_default);

@@ -671,19 +673,19 @@ 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.

- unsigned Split(std::vector<std::string>& v, std::string& s, boost::match_flag_type + unsigned Split(std::vector<std::string>& v, std::string& s, boost::match_flag_type flags = match_default, unsigned max_count - = ~0); + = ~0);

@@ -704,17 +706,17 @@

- unsigned int + unsigned int Position(int i - = 0)const; + = 0)const;

Returns the position of what matched sub-expression i. - If i = - 0 then returns the position - of the whole match. Returns RegEx::npos + If i = + 0 then returns the position + of the whole match. Returns RegEx::npos if the supplied index is invalid, or if the specified sub-expression did not participate in the match.

@@ -723,16 +725,16 @@

- unsigned int + unsigned int Length(int i - = 0)const; + = 0)const;

- Returns the length of what matched sub-expression i. If i = - 0 then returns the length - of the whole match. Returns RegEx::npos + Returns the length of what matched sub-expression i. If i = + 0 then returns the length + of the whole match. Returns RegEx::npos if the supplied index is invalid, or if the specified sub-expression did not participate in the match.

@@ -741,8 +743,8 @@

- bool Matched(int i = - 0)const; + bool Matched(int i = + 0)const;

@@ -755,23 +757,23 @@

- unsigned int - Line()const; + unsigned int + Line()const;

Returns the line on which the match occurred, indexes start from - 1 not zero, if no match occurred then returns RegEx::npos. + 1 not zero, if no match occurred then returns RegEx::npos.

- unsigned int + unsigned int Marks() - const; + const;

@@ -785,14 +787,14 @@

- std::string What(int i)const; + std::string What(int i)const;

Returns a copy of what matched sub-expression i. - If i = - 0 then returns a copy of + If i = + 0 then returns a copy of the whole match. Returns a null string if the index is invalid or if the specified sub-expression did not participate in a match.

@@ -801,13 +803,13 @@

- std::string operator[](int - i)const ; + std::string operator[](int + i)const ;

- Returns what(i); + Returns what(i); Can be used to simplify access to sub-expression matches, and make usage more perl-like.

@@ -818,7 +820,10 @@ - +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

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 28ef42c8..559d3a9e 100644 --- a/doc/html/boost_regex/ref/deprecated_interfaces/regex_format.html +++ b/doc/html/boost_regex/ref/deprecated_interfaces/regex_format.html @@ -1,13 +1,15 @@ -regex_format (Deprecated) + + regex_format (Deprecated) - + - + @@ -24,27 +26,27 @@
+ + regex_format (Deprecated)

- The algorithm regex_format - is deprecated; new code should use match_results<>::format instead. Existing code + The algorithm regex_format + 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:

-
- +

+ Algorithm regex_format -

+ 
 #include <boost/regex.hpp>

- The algorithm regex_format + The algorithm regex_format takes the results of a match and creates a new string based upon a format - string, regex_format can + string, regex_format can be used for search and replace operations: 

@@ -60,7 +62,7 @@
                            match_flag_type flags = 0);

- The library also defines the following convenience variation of regex_format, which returns the result + The library also defines the following convenience variation of regex_format, which returns the result directly as a string, rather than outputting to an iterator.

@@ -68,7 +70,7 @@ - @@ -110,7 +112,7 @@ @@ -136,7 +138,7 @@
[Note] Note

+

This version may not be available, or may be available in a more limited form, depending upon your compilers capabilities

- OutputIterator out + OutputIterator out

@@ -123,12 +125,12 @@

- const match_results<iterator, Allocator>& m + const match_results<iterator, Allocator>& m

- An instance of match_results obtained + An instance of match_results obtained from one of the matching algorithms above, and denoting what matched.

- const charT* fmt + const charT* fmt

@@ -149,7 +151,7 @@

- unsigned flags + unsigned flags

@@ -161,16 +163,19 @@

- Format flags are described under match_flag_type. + Format flags are described under match_flag_type.

The format string syntax (and available options) is described more fully - under format strings. + under format strings.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/deprecated_interfaces/regex_grep.html b/doc/html/boost_regex/ref/deprecated_interfaces/regex_grep.html index 33fd7e4e..13d2a5bf 100644 --- a/doc/html/boost_regex/ref/deprecated_interfaces/regex_grep.html +++ b/doc/html/boost_regex/ref/deprecated_interfaces/regex_grep.html @@ -1,13 +1,16 @@ -regex_grep (Deprecated) + + regex_grep (Deprecated) - + - - + + @@ -24,12 +27,12 @@
+ + regex_grep (Deprecated)

- The algorithm regex_grep - is deprecated in favor of regex_iterator which provides + The algorithm regex_grep + is deprecated in favor of regex_iterator which provides a more convenient and standard library friendly interface.

@@ -40,7 +43,7 @@ #include <boost/regex.hpp>

- regex_grep allows you to + 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:

@@ -54,8 +57,8 @@

The library also defines the following convenience versions, which take - either a const charT*, or a const - std::basic_string<>& + either a const charT*, or a const + std::basic_string<>& in place of a pair of iterators. 

@@ -72,7 +75,7 @@
             boost::match_flag_type flags = match_default);

- The parameters for the primary version of regex_grep + The parameters for the primary version of regex_grep have the following meanings:

@@ -94,9 +97,9 @@

The algorithm finds all of the non-overlapping matches of the expression - e, for each match it fills a match_results<iterator> structure, which contains information + e, for each match it fills a match_results<iterator> structure, which contains information on what matched, and calls the predicate foo, passing - the match_results<iterator> + the match_results<iterator> as a single argument. If the predicate returns true, then the grep operation continues, otherwise it terminates without searching for further matches. The function returns the number of matches found. @@ -120,12 +123,12 @@ utilities would output the results to the screen, another program could index a file based on a regular expression and store a set of bookmarks in a list, or a text file conversion utility would output to file. The - results of one regex_grep - can even be chained into another regex_grep + results of one regex_grep + can even be chained into another regex_grep to create recursive parsers.

- The algorithm may throw std::runtime_error + The algorithm may throw std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured @@ -133,7 +136,7 @@ (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> 
@@ -195,7 +198,7 @@
 }

- Example: Use regex_grep + Example: Use regex_grep to call a global callback function: 

@@ -255,8 +258,8 @@
 }

- Example: use regex_grep - to call a class member function, use the standard library adapters std::mem_fun and std::bind1st + Example: use regex_grep + 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: 

@@ -370,7 +373,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/deprecated_interfaces/regex_split.html b/doc/html/boost_regex/ref/deprecated_interfaces/regex_split.html index dd07bf04..ce02c4a1 100644 --- a/doc/html/boost_regex/ref/deprecated_interfaces/regex_split.html +++ b/doc/html/boost_regex/ref/deprecated_interfaces/regex_split.html @@ -1,13 +1,16 @@ -regex_split (deprecated) + + regex_split (deprecated) - + - - + + @@ -24,24 +27,27 @@
+ + regex_split (deprecated)

- 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>

- Algorithm regex_split performs a similar + Algorithm regex_split performs a similar operation to the perl split operation, and comes in three overloaded forms: 

@@ -63,7 +69,7 @@
                         std::basic_string<charT, Traits1, Alloc1>& s);

- Effects: Each version of the algorithm + Effects: Each version of the algorithm takes an output-iterator for output, and a string for input. If the expression contains no marked sub-expressions, then the algorithm writes one string onto the output-iterator for each section of input that does not match @@ -74,11 +80,11 @@ processed will be deleted from the string s (if max_split is not reached then all of s will be deleted). Returns the number of strings written to the output-iterator. If the parameter - max_split is not specified then it defaults to UINT_MAX. If no expression is specified, + max_split is not specified then it defaults to UINT_MAX. If no expression is specified, then it defaults to "\s+", and splitting occurs on whitespace.

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), @@ -86,7 +92,7 @@ is configured in non-recursive mode).

- Example: the following function will split + Example: the following function will split the input string into a series of tokens, and remove each token from the string s:

@@ -153,7 +159,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/error_type.html b/doc/html/boost_regex/ref/error_type.html index d2deb78b..b362c115 100644 --- a/doc/html/boost_regex/ref/error_type.html +++ b/doc/html/boost_regex/ref/error_type.html @@ -1,13 +1,13 @@ -error_type + error_type - + - - - + + + @@ -24,12 +24,11 @@
-
- + error_type
+

+ Synopsis -

+

Type error type represents the different types of errors that can be raised by the library when parsing a regular expression. @@ -57,12 +56,12 @@ } // namespace regex_constants } // namespace boost -

- +

+ Description -

+

- The type error_type is an + The type error_type is an implementation-specific enumeration type that may take one of the following values:

@@ -258,7 +257,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/match_flag_type.html b/doc/html/boost_regex/ref/match_flag_type.html index e0ebccba..bf5a7e95 100644 --- a/doc/html/boost_regex/ref/match_flag_type.html +++ b/doc/html/boost_regex/ref/match_flag_type.html @@ -1,13 +1,14 @@ -match_flag_type + match_flag_type - + - - - + + + @@ -24,13 +25,12 @@
+ match_flag_type

- The type match_flag_type + 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. 

 namespace boost{ namespace regex_constants{
@@ -69,12 +69,12 @@
 } // namespace regex_constants
 } // namespace boost
-
- +

+ Description -

+

- The type match_flag_type + The type match_flag_type is an implementation specific bitmask type (see C++ std 17.3.2.1.2). When matching a regular expression against a sequence of characters [first, last) then setting its elements has the effects listed in the table below: @@ -328,7 +328,8 @@

@@ -414,7 +415,7 @@ @@ -442,7 +443,8 @@ @@ -479,7 +481,10 @@

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. @@ -359,7 +360,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.

@@ -379,7 +380,7 @@ Specification, Chapter 15 part 5.4.11 String.prototype.replace. (FWD.1).

- This is functionally identical to the Perl + This is functionally identical to the Perl format string rules.

@@ -401,7 +402,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.

Specifies that when a regular expression match is to be replaced - by a new string, that the new string is constructed using the + by a new string, that the new string is constructed using the same rules as Perl 5.

Specifies that all syntax extensions are enabled, including conditional - (?ddexpression1:expression2) replacements: see the format + (?ddexpression1:expression2) replacements: see the format string guide for more details.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/match_results.html b/doc/html/boost_regex/ref/match_results.html index 086ba614..2e6fca10 100644 --- a/doc/html/boost_regex/ref/match_results.html +++ b/doc/html/boost_regex/ref/match_results.html @@ -1,13 +1,13 @@ -match_results + match_results - + - - - + + + @@ -24,12 +24,11 @@
-
- + match_results
+

+ Synopsis -

+ 
 #include <boost/regex.hpp>
@@ -38,29 +37,29 @@ 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 that acts as an indexed collection + 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 + 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 + 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 collection is allocated and freed as necessary by the member functions of - class match_results. + class match_results.

- The template class match_results + The template class match_results conforms to the requirements of a Sequence, as specified in (lib.sequence.reqmts), except that only operations defined for const-qualified Sequences are supported.

- Class template match_results - is most commonly used as one of the typedefs cmatch, - wcmatch, smatch, - or wsmatch: + Class template match_results + is most commonly used as one of the typedefs cmatch, + wcmatch, smatch, + or wsmatch: 

 template <class BidirectionalIterator,
@@ -143,12 +142,12 @@
 void swap(match_results<BidirectionalIterator, Allocator>& m1,
          match_results<BidirectionalIterator, Allocator>& m2);
-
- +

+ Description -

+

- In all match_results constructors, + In all match_results constructors, a copy of the Allocator argument is used for any memory allocation performed by the constructor or member functions during the lifetime of the object.

@@ -158,8 +157,8 @@ match_results(constAllocator&a=Allocator());

- Effects: Constructs an object of class - match_results. The postconditions + Effects: Constructs an object of class + match_results. The postconditions of this function are indicated in the table:

@@ -224,7 +223,7 @@ match_results(constmatch_results&m);

- Effects: Constructs an object of class match_results, + Effects: Constructs an object of class match_results, as a copy of m.

@@ -233,7 +232,7 @@ match_results& operator=(const match_results& m);

- Effects: Assigns m to *this. The postconditions + Effects: Assigns m to *this. The postconditions of this function are indicated in the table:

@@ -358,7 +357,7 @@ 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.

@@ -368,8 +367,8 @@ size_typemax_size()const;

- Effects: Returns the maximum number of - sub_match + Effects: Returns the maximum number of + sub_match elements that can be stored in *this.

@@ -378,7 +377,7 @@ bool empty()const;

- Effects: Returns size() == 0. + Effects: Returns size() == 0.

@@ -386,8 +385,8 @@ difference_typelength(intsub=0)const;

- Effects: Returns the length of sub-expression - sub, that is to say: (*this)[sub].length(). + Effects: Returns the length of sub-expression + sub, that is to say: (*this)[sub].length().

@@ -395,10 +394,10 @@ difference_typeposition(unsignedintsub=0)const;

- Effects: Returns the starting location of + Effects: Returns the starting location of sub-expression sub, or -1 if sub - was not matched. Note that if this represents a partial match , then position() - will return the location of the partial match even though (*this)[0].matched + was not matched. Note that if this represents a partial match , then position() + will return the location of the partial match even though (*this)[0].matched is false.

@@ -407,8 +406,8 @@ string_type str(int sub = 0)const;

- Effects: Returns sub-expression sub - as a string: string_type((*this)[sub]). + Effects: Returns sub-expression sub + as a string: string_type((*this)[sub]).

@@ -416,13 +415,13 @@ 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 + n. If n == 0 then returns + 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.

@@ -431,7 +430,7 @@ const_reference prefix()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.

@@ -441,7 +440,7 @@ 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.

@@ -451,7 +450,7 @@ const_iteratorbegin()const;

- Effects: Returns a starting iterator that + Effects: Returns a starting iterator that enumerates over all the marked sub-expression matches stored in *this.

@@ -460,7 +459,7 @@ const_iterator end()const;

- Effects: Returns a terminating iterator + Effects: Returns a terminating iterator that enumerates over all the marked sub-expression matches stored in *this.

@@ -472,25 +471,25 @@ match_flag_type flags = format_default);

- Requires: The type OutputIterator + Requires: The type OutputIterator conforms to the Output Iterator requirements (C++ std 24.1.2).

- Effects: Copies the character sequence - [fmt.begin(), fmt.end()) - to OutputIterator out. + Effects: Copies the character sequence + [fmt.begin(), fmt.end()) + to OutputIterator out. For each format specifier or escape sequence in fmt, replace that sequence with either the character(s) it represents, or the - sequence of characters within *this to which it refers. The bitmasks specified + sequence of characters within *this to which it refers. The bitmasks specified in flags determines what format specifiers or escape sequences are recognized, by default this is the format used by ECMA-262, ECMAScript Language Specification, Chapter 15 part 5.4.11 String.prototype.replace.

- See the format syntax guide for more information. + See the format syntax guide for more information.

- Returns: out. + Returns: out.

@@ -499,16 +498,16 @@ match_flag_typeflags=format_default);

- Effects: Returns a copy of the string fmt. + Effects: Returns a copy of the string fmt. For each format specifier or escape sequence in fmt, replace that sequence with either the character(s) it represents, or the - sequence of characters within *this to which it refers. The bitmasks specified + sequence of characters within *this to which it refers. The bitmasks specified in flags determines what format specifiers or escape sequences are recognized, by default this is the format used by ECMA-262, ECMAScript Language Specification, Chapter 15 part 5.4.11 String.prototype.replace.

- See the format syntax guide for more information. + See the format syntax guide for more information.

@@ -516,7 +515,7 @@ allocator_typeget_allocator()const;

- Effects: Returns a copy of the Allocator + Effects: Returns a copy of the Allocator that was passed to the object's constructor.

@@ -525,15 +524,15 @@ void swap(match_results& that);

- Effects: Swaps the contents of the two sequences. + Effects: Swaps the contents of the two sequences.

- Postcondition: *this contains the sequence + Postcondition: *this contains the sequence of matched sub-expressions that were in that, that contains the sequence of matched sub-expressions that were in *this.

- Complexity: constant time. + Complexity: constant time.

@@ -543,7 +542,7 @@

Defines an implementation-specific type that satisfies the requirements of a standard library Sequence (21.1.1 including the optional Table 68 operations), - whose value_type is a sub_match<BidirectionalIterator>. This type happens to be std::vector<sub_match<BidirectionalIterator> >, + whose value_type is a sub_match<BidirectionalIterator>. This type happens to be std::vector<sub_match<BidirectionalIterator> >, but you shouldn't actually rely on that.

@@ -552,20 +551,20 @@ const capture_sequence_type& captures(std::size_t i)const;

- Effects: returns a sequence containing all + Effects: returns a sequence containing all the captures obtained for sub-expression i.

- Returns: (*this)[i].captures(); + Returns: (*this)[i].captures();

- Preconditions: the library must be built + 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 + match_extra to the regex 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.

- Rationale: Enabling this feature has several + Rationale: Enabling this feature has several consequences:

    @@ -591,7 +590,7 @@ const match_results<BidirectionalIterator, Allocator>& m2);

    - Effects: Compares the two sequences for + Effects: Compares the two sequences for equality.

    @@ -602,7 +601,7 @@ const match_results<BidirectionalIterator, Allocator>& m2);

    - Effects: Compares the two sequences for + Effects: Compares the two sequences for inequality.

    @@ -614,9 +613,9 @@ const match_results<BidirectionalIterator, Allocator>& m);

    - Effects: Writes the contents of m - to the stream os as if by calling os - << m.str(); + Effects: Writes the contents of m + to the stream os as if by calling os + << m.str(); Returns os.

    @@ -627,12 +626,15 @@ match_results<BidirectionalIterator, Allocator>& m2);

    - Effects: Swaps the contents of the two sequences. + Effects: Swaps the contents of the two sequences.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings.html b/doc/html/boost_regex/ref/non_std_strings.html index 62ad63d5..5d2f434d 100644 --- a/doc/html/boost_regex/ref/non_std_strings.html +++ b/doc/html/boost_regex/ref/non_std_strings.html @@ -1,13 +1,15 @@ -Interfacing With Non-Standard String Types + Interfacing With Non-Standard + String Types - + - - - + + + @@ -24,9 +26,9 @@
+ Interfacing With Non-Standard + String Types
Working With Unicode and ICU String Types
@@ -75,7 +77,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings/icu.html b/doc/html/boost_regex/ref/non_std_strings/icu.html index 337c084b..83799cc1 100644 --- a/doc/html/boost_regex/ref/non_std_strings/icu.html +++ b/doc/html/boost_regex/ref/non_std_strings/icu.html @@ -1,13 +1,17 @@ -Working With Unicode and ICU String Types + Working With + Unicode and ICU String Types - + - - - + + + @@ -24,9 +28,9 @@
+ Working With + Unicode and ICU String Types
Introduction to using Regex with ICU
@@ -40,7 +44,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings/icu/intro.html b/doc/html/boost_regex/ref/non_std_strings/icu/intro.html index 5e719f6f..87fe0850 100644 --- a/doc/html/boost_regex/ref/non_std_strings/icu/intro.html +++ b/doc/html/boost_regex/ref/non_std_strings/icu/intro.html @@ -1,13 +1,17 @@ -Introduction to using Regex with ICU + Introduction + to using Regex with ICU - + - - - + + + @@ -24,9 +28,9 @@
+ Introduction + to using Regex with ICU

The header:

@@ -63,7 +67,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings/icu/unicode_algo.html b/doc/html/boost_regex/ref/non_std_strings/icu/unicode_algo.html index 0691e820..5d4ae06e 100644 --- a/doc/html/boost_regex/ref/non_std_strings/icu/unicode_algo.html +++ b/doc/html/boost_regex/ref/non_std_strings/icu/unicode_algo.html @@ -1,13 +1,17 @@ -Unicode Regular Expression Algorithms + + Unicode Regular Expression Algorithms - + - - - + + + @@ -24,33 +28,33 @@
+ + Unicode Regular Expression Algorithms

- 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 we may want to process the data in UTF-32 "chunks", the actual data is much more likely to encoded as either UTF-8 or UTF-16. Therefore the header <boost/regex/icu.hpp> provides a series of thin wrappers - around these algorithms, called u32regex_match, - u32regex_search, and - u32regex_replace. These + around these algorithms, called u32regex_match, + u32regex_search, and + u32regex_replace. These wrappers use iterator-adapters internally to make external UTF-8 or UTF-16 data look as though it's really a UTF-32 sequence, that can then be passed on to the "real" algorithm.

-
- +

+ u32regex_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, + 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, and which will accept UTF-8, UTF-16 or UTF-32 encoded data, as well as an ICU UnicodeString as input.

@@ -90,15 +94,15 @@ }} -
- +

+ u32regex_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, + 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, and which will accept UTF-8, UTF-16 or UTF-32 encoded data, as well as an ICU UnicodeString as input.

@@ -130,15 +134,15 @@ }} -
- +

+ u32regex_replace -

+

- For each regex_replace algorithm defined - by <boost/regex.hpp>, then <boost/regex/icu.hpp> + 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, + is called u32regex_replace, and which will accept UTF-8, UTF-16 or UTF-32 encoded data, as well as an ICU UnicodeString as input. The input sequence and the format string specifier passed to the algorithm, can be encoded independently (for @@ -170,7 +174,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

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 031f60af..f3c9352c 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 @@ -1,13 +1,17 @@ -Unicode Aware Regex Iterators + + Unicode Aware Regex Iterators - + - - - + + + @@ -24,19 +28,19 @@
-
- + + Unicode Aware Regex Iterators
+

+ u32regex_iterator -

+

- Type u32regex_iterator - is in all respects the same as regex_iterator except that since - the regular expression type is always u32regex + Type u32regex_iterator + 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, + u32regex_search internally, allowing it to interface correctly with UTF-8, UTF-16, and UTF-32 data: 

@@ -51,7 +55,7 @@
 typedef u32regex_iterator<const UChar32*>  utf32regex_iterator;

- In order to simplify the construction of a u32regex_iterator + In order to simplify the construction of a u32regex_iterator from a string, there are a series of non-member helper functions called make_u32regex_iterator:

@@ -128,16 +132,16 @@

Provided of course that the input is encoded as UTF-8.

-
- +

+ u32regex_token_iterator -

+

- Type u32regex_token_iterator - is in all respects the same as regex_token_iterator except - that since the regular expression type is always u32regex + Type u32regex_token_iterator + 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, + u32regex_search internally, allowing it to interface correctly with UTF-8, UTF-16, and UTF-32 data: 

@@ -152,9 +156,9 @@
 typedef u32regex_token_iterator<const UChar32*>  utf32regex_token_iterator;

- In order to simplify the construction of a u32regex_token_iterator + In order to simplify the construction of a u32regex_token_iterator from a string, there are a series of non-member helper functions called - make_u32regex_token_iterator: + make_u32regex_token_iterator: 

 u32regex_token_iterator<const char*> 
@@ -317,7 +321,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings/icu/unicode_types.html b/doc/html/boost_regex/ref/non_std_strings/icu/unicode_types.html index 54c37692..6f42cbf9 100644 --- a/doc/html/boost_regex/ref/non_std_strings/icu/unicode_types.html +++ b/doc/html/boost_regex/ref/non_std_strings/icu/unicode_types.html @@ -1,13 +1,17 @@ -Unicode regular expression types + + Unicode regular expression types - + - - - + + + @@ -24,11 +28,11 @@
+ + Unicode regular expression types

- Header <boost/regex/icu.hpp> provides a regular expression traits + Header <boost/regex/icu.hpp> provides a regular expression traits class that handles UTF-32 characters: 

@@ -41,15 +45,15 @@
 typedef basic_regex<UChar32,icu_regex_traits> u32regex;

- The type u32regex is + The type u32regex is regular expression type to use for all Unicode regular expressions; internally it uses UTF-32 code points, but can be created from, and used to search, either UTF-8, or UTF-16 encoded strings as well as UTF-32 ones.

- The constructors, and assign member functions of u32regex, + The constructors, and assign member functions of u32regex, require UTF-32 encoded strings, but there are a series of overloaded - algorithms called make_u32regex + algorithms called make_u32regex which allow regular expressions to be created from UTF-8, UTF-16, or UTF-32 encoded strings:

@@ -60,7 +64,7 @@ boost::regex_constants::syntax_option_typeopt);

- Effects: Creates a regular expression + Effects: Creates a regular expression object from the iterator sequence [i,j). The character encoding of the sequence is determined based upon sizeof(*i): 1 implies UTF-8, 2 implies UTF-16, and 4 implies UTF-32. @@ -71,7 +75,7 @@ = boost::regex_constants::perl);

- Effects: Creates a regular expression + Effects: Creates a regular expression object from the Null-terminated UTF-8 characater sequence p. 

@@ -80,7 +84,7 @@
                            = boost::regex_constants::perl);

- Effects: Creates a regular expression + Effects: Creates a regular expression object from the Null-terminated UTF-8 characater sequence p. 

@@ -89,7 +93,7 @@
                            = boost::regex_constants::perl);

- Effects: Creates a regular expression + Effects: Creates a regular expression object from the Null-terminated characater sequence p. The character encoding of the sequence is determined based upon sizeof(wchar_t): 1 implies UTF-8, 2 implies UTF-16, and 4 implies UTF-32. @@ -100,7 +104,7 @@ = boost::regex_constants::perl);

- Effects: Creates a regular expression + Effects: Creates a regular expression object from the Null-terminated UTF-16 characater sequence p. 

@@ -110,7 +114,7 @@
                            = boost::regex_constants::perl);

- Effects: Creates a regular expression + Effects: Creates a regular expression object from the string s. The character encoding of the string is determined based upon sizeof(C): 1 implies UTF-8, 2 implies UTF-16, and 4 implies UTF-32. @@ -121,13 +125,16 @@ = boost::regex_constants::perl);

- Effects: Creates a regular expression + Effects: Creates a regular expression object from the UTF-16 encoding string s.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings/mfc_strings.html b/doc/html/boost_regex/ref/non_std_strings/mfc_strings.html index 3298ba2f..f17f4620 100644 --- a/doc/html/boost_regex/ref/non_std_strings/mfc_strings.html +++ b/doc/html/boost_regex/ref/non_std_strings/mfc_strings.html @@ -1,13 +1,17 @@ -Using Boost Regex With MFC Strings + Using + Boost Regex With MFC Strings - + - - - + + + @@ -24,9 +28,9 @@
+ Using + Boost Regex With MFC Strings
Introduction to Boost.Regex and MFC Strings
@@ -42,7 +46,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_algo.html b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_algo.html index 76d42e1b..0d05bf1c 100644 --- a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_algo.html +++ b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_algo.html @@ -1,13 +1,17 @@ -Overloaded Algorithms For MFC String Types + + Overloaded Algorithms For MFC String Types - + - - - + + + @@ -24,27 +28,27 @@
+ + Overloaded Algorithms For MFC String Types

- For each regular expression algorithm that's overloaded for a std::basic_string argument, there is also + For each regular expression algorithm that's overloaded for a std::basic_string argument, there is also one overloaded for the MFC/ATL string types. These algorithm signatures all look a lot more complex than they actually are, but for completeness here they are anyway:

-
- +

+ regex_match -

+

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. 

@@ -56,12 +60,12 @@
    boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);

- Effects: returns ::boost::regex_match(s.GetString(), + Effects: returns ::boost::regex_match(s.GetString(), s.GetString() - + s.GetLength(), what, e, f); + + s.GetLength(), what, e, f);

- Example: + Example: 

 //
@@ -83,11 +87,11 @@
    }
 }
-
- +

+ regex_match (second overload) -

+ 
 template <class charT, class T>
 bool regex_match(
@@ -96,12 +100,12 @@
    boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)

- Effects: returns ::boost::regex_match(s.GetString(), + Effects: returns ::boost::regex_match(s.GetString(), s.GetString() - + s.GetLength(), e, f); + + s.GetLength(), e, f);

- Example: + Example: 

 //
@@ -113,12 +117,12 @@
    return boost::regex_match(password, boost::make_regex(requirements));
 }
-
- +

+ regex_search -

+

- 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: 

@@ -129,11 +133,11 @@
                   boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)

- Effects: returns ::boost::regex_search(s.GetString(), + Effects: returns ::boost::regex_search(s.GetString(), s.GetString() + s.GetLength(), what, e, f);

- Example: Postcode extraction from an + Example: Postcode extraction from an address string. 

@@ -154,11 +158,11 @@
    }
 }
-
- +

+ regex_search (second overload) -

+ 
 template <class charT, class T>
 inline bool regex_search(const ATL::CSimpleStringT<charT>& s,
@@ -166,16 +170,16 @@
                boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)

- Effects: returns ::boost::regex_search(s.GetString(), + Effects: returns ::boost::regex_search(s.GetString(), s.GetString() - + s.GetLength(), e, f); + + s.GetLength(), e, f);

-
- +

+ regex_replace -

+

- 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 

@@ -189,8 +193,8 @@
                            match_flag_type flags = match_default)

- Effects: returns ::boost::regex_replace(out, first, last, e, fmt.GetString(), - flags); + Effects: returns ::boost::regex_replace(out, first, last, e, fmt.GetString(), + flags); 

 template <class traits, charT>
@@ -200,12 +204,12 @@
                            match_flag_type flags = match_default)

- Effects: returns a new string created - using regex_replace, + Effects: returns a new string created + using regex_replace, and the same memory manager as string s.

- Example: + Example: 

 //
@@ -224,7 +228,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

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 0923a1f9..017ca050 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 @@ -1,13 +1,17 @@ -Introduction to Boost.Regex and MFC Strings + + Introduction to Boost.Regex and MFC Strings - + - - - + + + @@ -24,11 +28,11 @@
+ + Introduction to Boost.Regex and MFC Strings

- The header <boost/regex/mfc.hpp> provides Boost.Regex support for + The header <boost/regex/mfc.hpp> provides Boost.Regex support for MFC string types: note that this support requires Visual Studio .NET (Visual C++ 7) or later, where all of the MFC and ATL string types are based around the CSimpleStringT class template. @@ -52,7 +56,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_iter.html b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_iter.html index 04c5c41e..beabcfcf 100644 --- a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_iter.html +++ b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_iter.html @@ -1,13 +1,16 @@ -Iterating Over the Matches Within An MFC String + + Iterating Over the Matches Within An MFC String - + - - - + + + @@ -24,18 +27,18 @@
+ + Iterating Over the Matches Within An MFC String

The following helper functions are provided to ease the conversion from - an MFC/ATL string to a regex_iterator or regex_token_iterator: + an MFC/ATL string to a regex_iterator or regex_token_iterator:

-
- +

+ regex_iterator creation helper -

+ 
 template <class charT>
 regex_iterator<charT const*> 
@@ -45,12 +48,12 @@
       ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);

- Effects: returns regex_iterator(s.GetString(), s.GetString() + s.GetLength(), + Effects: returns regex_iterator(s.GetString(), s.GetString() + s.GetLength(), e, - f); + f);

- Example: + Example: 

 void enumerate_links(const CString& html)
@@ -69,11 +72,11 @@
    }
 }
-
- +

+ regex_token_iterator creation helpers -

+ 
 template <class charT> 
 regex_token_iterator<charT const*> 
@@ -84,10 +87,10 @@
       ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);

- Effects: returns regex_token_iterator(s.GetString(), s.GetString() + s.GetLength(), + Effects: returns regex_token_iterator(s.GetString(), s.GetString() + s.GetLength(), e, sub, - f); + f); 

 template <class charT> 
@@ -99,10 +102,10 @@
       ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);

- Effects: returns regex_token_iterator(s.GetString(), s.GetString() + s.GetLength(), + Effects: returns regex_token_iterator(s.GetString(), s.GetString() + s.GetLength(), e, subs, - f); + f); 

 template <class charT, std::size_t N> 
@@ -114,13 +117,13 @@
       ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);

- Effects: returns regex_token_iterator(s.GetString(), s.GetString() + s.GetLength(), + Effects: returns regex_token_iterator(s.GetString(), s.GetString() + s.GetLength(), e, subs, - f); + f);

- Example: + Example: 

 void enumerate_links2(const CString& html)
@@ -142,7 +145,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

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 7ddd4f7b..5c4f3b44 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 @@ -1,13 +1,17 @@ -Regular Expression Creation From an MFC String + + Regular Expression Creation From an MFC String - + - - - + + + @@ -24,9 +28,9 @@
+ + Regular Expression Creation From an MFC String

The following helper function is available to assist in the creation of a regular expression from an MFC/ATL string type: @@ -38,13 +42,16 @@ ::boost::regex_constants::syntax_option_type f = boost::regex_constants::normal);

- Effects: returns basic_regex<charT>(s.GetString(), s.GetString() + s.GetLength(), - f); + Effects: returns basic_regex<charT>(s.GetString(), s.GetString() + s.GetLength(), + f);

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_regex_types.html b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_regex_types.html index 8edd6c09..452240b8 100644 --- a/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_regex_types.html +++ b/doc/html/boost_regex/ref/non_std_strings/mfc_strings/mfc_regex_types.html @@ -1,13 +1,17 @@ -Regex Types Used With MFC Strings + + Regex Types Used With MFC Strings - + - - - + + + @@ -24,9 +28,9 @@
+ + Regex Types Used With MFC Strings

The following typedefs are provided for the convenience of those working with TCHAR's: @@ -39,13 +43,16 @@

If you are working with explicitly narrow or wide characters rather than - TCHAR, then use the regular Boost.Regex types regex - and wregex instead. + TCHAR, then use the regular Boost.Regex types regex + and wregex instead.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/posix.html b/doc/html/boost_regex/ref/posix.html index c2bd5a77..18acf970 100644 --- a/doc/html/boost_regex/ref/posix.html +++ b/doc/html/boost_regex/ref/posix.html @@ -1,13 +1,14 @@ -POSIX Compatible C API's + POSIX Compatible C API's - + - - - + + + @@ -24,14 +25,13 @@
+ POSIX Compatible C API's
- - @@ -125,13 +125,13 @@ -
[Note] Note

+

this is an abridged reference to the POSIX API functions, these are provided for compatibility with other libraries, rather than as an API to be used in new code (unless you need access from a language other than C++). This @@ -59,9 +59,9 @@

[Important] Important

- Note that all the symbols defined here are enclosed inside namespace boost when used in C++ programs, unless - you use #include <boost/regex.h> +

+ Note that all the symbols defined here are enclosed inside namespace boost when used in C++ programs, unless + you use #include <boost/regex.h> instead - in which case the symbols are still defined in namespace boost, but are made available in the global namespace as well.

- unsigned int - re_nsub + unsigned int + re_nsub

- This is filled in by regcomp + This is filled in by regcomp and indicates the number of sub-expressions contained in the regular expression.

@@ -140,7 +140,7 @@

- const TCHAR* re_endp + const TCHAR* re_endp

@@ -157,23 +157,23 @@ [Note] Note

- regex_t is actually a - #define - it is either - regex_tA or regex_tW depending upon whether UNICODE is defined or not, TCHAR is either char - or wchar_t again depending - upon the macro UNICODE. +

+ regex_t is actually a + #define - it is either + regex_tA or regex_tW depending upon whether UNICODE is defined or not, TCHAR is either char + or wchar_t again depending + upon the macro UNICODE.

-
- +

+ regcomp -

+

- regcomp takes a pointer to - a regex_t, a pointer to the + regcomp takes a pointer to + a regex_t, a pointer to the expression to compile and a flags parameter which can be a combination of:

@@ -202,9 +202,9 @@ @@ -217,12 +217,12 @@ @@ -346,8 +346,8 @@ @@ -359,8 +359,8 @@ @@ -372,8 +372,8 @@ @@ -381,10 +381,10 @@

- Compiles modern regular expressions. Equivalent to regbase::char_classes | + Compiles modern regular expressions. Equivalent to regbase::char_classes | regbase::intervals | - regbase::bk_refs. + regbase::bk_refs.

Compiles basic (obsolete) regular expression syntax. Equivalent to - regbase::char_classes | + regbase::char_classes | regbase::intervals | regbase::limited_ops | regbase::bk_braces | regbase::bk_parens | - regbase::bk_refs. + regbase::bk_refs.

- A shortcut for awk-like behavior: REG_EXTENDED - | REG_ESCAPE_IN_LISTS + A shortcut for awk-like behavior: REG_EXTENDED + | REG_ESCAPE_IN_LISTS

- A shortcut for grep like behavior: REG_BASIC - | REG_NEWLINE_ALT + A shortcut for grep like behavior: REG_BASIC + | REG_NEWLINE_ALT

- A shortcut for egrep like behavior: REG_EXTENDED - | REG_NEWLINE_ALT + A shortcut for egrep like behavior: REG_EXTENDED + | REG_NEWLINE_ALT

-
- +

+ regerror -

+

regerror takes the following parameters, it maps an error code to a human readable string: @@ -469,10 +469,10 @@

-
- +

+ regexec -

+

regexec finds the first occurrence of expression e within string buf. If len is non-zero then *m is filled in with what matched @@ -539,18 +539,21 @@

-
- +

+ regfree -

+

- regfree frees all the memory + regfree frees all the memory that was allocated by regcomp.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/regex_iterator.html b/doc/html/boost_regex/ref/regex_iterator.html index a77d0d5f..0939d550 100644 --- a/doc/html/boost_regex/ref/regex_iterator.html +++ b/doc/html/boost_regex/ref/regex_iterator.html @@ -1,13 +1,13 @@ -regex_iterator + regex_iterator - + - - - + + + @@ -24,13 +24,12 @@
+ regex_iterator

- The iterator type regex_iterator will enumerate all + The iterator type regex_iterator will enumerate all of the regular expression matches found in some sequence: dereferencing a - regex_iterator - yields a reference to a match_results object. + regex_iterator + yields a reference to a match_results object. 

 template <class BidirectionalIterator, 
@@ -78,12 +77,12 @@
                           const basic_regex<charT, traits>& e, 
                           regex_constants::match_flag_type m = regex_constants::match_default);
-
- +

+ Description -

+

- 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.

@@ -93,8 +92,8 @@ regex_iterator();

- Effects: constructs an end of sequence - regex_iterator. + Effects: constructs an end of sequence + regex_iterator.

@@ -104,13 +103,13 @@ match_flag_typem=match_default);

- 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_type m. - The object re must exist for the lifetime of the regex_iterator. + [a,b), and found using match_flag_type m. + The object re must exist for the lifetime of the regex_iterator.

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), or if the @@ -123,10 +122,10 @@ regex_iterator(const regex_iterator& that);

- Effects: constructs a copy of that. + Effects: constructs a copy of that.

- Postconditions: *this == that. + Postconditions: *this == that.

@@ -134,10 +133,10 @@ regex_iterator&operator=(constregex_iterator&);

- Effects: sets *this equal to those in that. + Effects: sets *this equal to those in that.

- Postconditions: *this == that. + Postconditions: *this == that.

@@ -145,7 +144,7 @@ booloperator==(constregex_iterator&that)const;

- Effects: returns true if *this is equal + Effects: returns true if *this is equal to that.

@@ -154,7 +153,7 @@ bool operator!=(const regex_iterator&)const;

- Effects: returns !(*this == that). + Effects: returns !(*this == that).

@@ -162,8 +161,8 @@ 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:

@@ -187,31 +186,31 @@ @@ -320,10 +319,10 @@ match_flag_typeflags=match_default);

- Effects: Behaves "as if" by constructing - an instance of match_results<BidirectionalIterator> what, - and then returning the result of regex_match(first, last, what, e, - flags). + Effects: Behaves "as if" by constructing + an instance of match_results<BidirectionalIterator> what, + and then returning the result of regex_match(first, last, what, e, + flags). 

 template <class charT, class Allocator, class traits>
@@ -332,9 +331,9 @@
                match_flag_type flags = match_default);

- Effects: Returns the result of regex_match(str, str + Effects: Returns the result of regex_match(str, str + char_traits<charT>::length(str), - m, e, flags). + m, e, flags). 

 template <class ST, class SA, class Allocator,
@@ -345,7 +344,7 @@
                match_flag_type flags = match_default);

- Effects: Returns the result of regex_match(s.begin(), s.end(), m, e, flags). + Effects: Returns the result of regex_match(s.begin(), s.end(), m, e, flags). 

 template <class charT, class traits>
@@ -354,9 +353,9 @@
                match_flag_type flags = match_default);

- Effects: Returns the result of regex_match(str, str + Effects: Returns the result of regex_match(str, str + char_traits<charT>::length(str), - e, flags). + e, flags). 

 template <class ST, class SA, class charT, class traits>
@@ -365,12 +364,12 @@
                match_flag_type flags = match_default);

- Effects: Returns the result of regex_match(s.begin(), s.end(), e, flags). + Effects: Returns the result of regex_match(s.begin(), s.end(), e, flags).

-
- +

+ Examples -

+

The following example processes an ftp response:

@@ -409,7 +408,10 @@

- (*it).size() + (*it).size()

- re.mark_count() + re.mark_count()

- (*it).empty() + (*it).empty()

- false + false

- (*it).prefix().first + (*it).prefix().first

@@ -224,44 +223,44 @@

- (*it).prefix().last + (*it).prefix().last

- The same as the start of the match found: (*it)[0].first + The same as the start of the match found: (*it)[0].first

- (*it).prefix().matched + (*it).prefix().matched

- True if the prefix did not match an empty string: (*it).prefix().first != - (*it).prefix().second + True if the prefix did not match an empty string: (*it).prefix().first != + (*it).prefix().second

- (*it).suffix().first + (*it).suffix().first

- The same as the end of the match found: (*it)[0].second + The same as the end of the match found: (*it)[0].second

- (*it).suffix().last + (*it).suffix().last

@@ -273,20 +272,20 @@

- (*it).suffix().matched + (*it).suffix().matched

- True if the suffix did not match an empty string: (*it).suffix().first != - (*it).suffix().second + True if the suffix did not match an empty string: (*it).suffix().first != + (*it).suffix().second

- (*it)[0].first + (*it)[0].first

@@ -299,7 +298,7 @@

- (*it)[0].second + (*it)[0].second

@@ -311,7 +310,7 @@

- (*it)[0].matched + (*it)[0].matched

@@ -324,12 +323,12 @@

- (*it)[n].first + (*it)[n].first

- For all integers n < (*it).size(), + For all integers n < (*it).size(), the start of the sequence that matched sub-expression n. Alternatively, if sub-expression n did not participate in the match, then last. @@ -339,12 +338,12 @@

- (*it)[n].second + (*it)[n].second

- For all integers n < (*it).size(), + For all integers n < (*it).size(), the end of the sequence that matched sub-expression n. Alternatively, if sub-expression n did not participate in the match, then last. @@ -354,12 +353,12 @@

- (*it)[n].matched + (*it)[n].matched

- For all integers n < (*it).size(), + For all integers n < (*it).size(), true if sub-expression n participated in the match, false otherwise.

@@ -368,12 +367,12 @@

- (*it).position(n) + (*it).position(n)

- For all integers n < (*it).size(), + For all integers n < (*it).size(), then the distance from the start of the underlying sequence to the start of sub-expression match n.

@@ -387,7 +386,7 @@ const value_type* operator->()const;

- Effects: returns &(*this). + Effects: returns &(*this).

@@ -395,17 +394,17 @@ regex_iterator& operator++();

- Effects: moves the iterator to the next + 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 to the right of the last match.

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), or if the @@ -413,7 +412,7 @@ in non-recursive mode).

- Returns: *this. + Returns: *this.

@@ -421,11 +420,11 @@ regex_iterator operator++(int);

- Effects: constructs a copy result of *this, then - calls ++(*this). + Effects: constructs a copy result of *this, then + calls ++(*this).

- Returns: result. + Returns: result.

@@ -442,15 +441,15 @@ regex_constants::match_flag_type m = regex_constants::match_default);

- Effects: returns an iterator that enumerates + Effects: returns an iterator that enumerates all occurences of expression e in text p - using match_flag_type + using match_flag_type m.

-
- +

+ Examples -

+

The following example takes a C++ source file and builds up an index of class names, and the location of that class in the file. @@ -550,7 +549,10 @@ - +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/regex_match.html b/doc/html/boost_regex/ref/regex_match.html index 3cc9fb34..55bd6752 100644 --- a/doc/html/boost_regex/ref/regex_match.html +++ b/doc/html/boost_regex/ref/regex_match.html @@ -1,13 +1,13 @@ -regex_match + regex_match - + - - - + + + @@ -24,14 +24,13 @@
+ regex_match
 #include <boost/regex.hpp>

- The algorithm regex_match - determines whether a given regular expression matches all + 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 input validation. @@ -41,10 +40,10 @@

-
[Important] Important

- 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 +

+ 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 set.

@@ -81,10 +80,10 @@ const basic_regex <charT, traits>& e, match_flag_type flags = match_default); -
- +

+ Description -

+ 
 template <class BidirectionalIterator, class Allocator, class charT, class traits>
 bool regex_match(BidirectionalIterator first, BidirectionalIterator last,
@@ -93,19 +92,19 @@
                  match_flag_type flags = match_default);

- Requires: Type BidirectionalIterator meets + Requires: Type BidirectionalIterator meets the requirements of a Bidirectional Iterator (24.1.4).

- Effects: Determines whether there is an + 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.

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), or if the @@ -113,7 +112,7 @@ in non-recursive mode).

- Postconditions: If the function returns + Postconditions: If the function returns false, then the effect on parameter m is undefined, otherwise the effects on parameter m are given in the table: @@ -139,127 +138,127 @@

- m.size() + m.size()

- e.mark_count() + e.mark_count()

- m.empty() + m.empty()

- false + false

- m.prefix().first + m.prefix().first

- first + first

- m.prefix().last + m.prefix().last

- first + first

- m.prefix().matched + m.prefix().matched

- false + false

- m.suffix().first + m.suffix().first

- last + last

- m.suffix().last + m.suffix().last

- last + last

- m.suffix().matched + m.suffix().matched

- false + false

- m[0].first + m[0].first

- first + first

- m[0].second + m[0].second

- last + last

- m[0].matched + m[0].matched

@@ -272,41 +271,41 @@

- m[n].first + m[n].first

- For all integers n < m.size(), the start of the sequence that + For all integers n < m.size(), the start of the sequence that matched sub-expression n. Alternatively, if sub-expression n did not participate in the - match, then last. + match, then last.

- m[n].second + m[n].second

- For all integers n < m.size(), the end of the sequence that matched + For all integers n < m.size(), the end of the sequence that matched sub-expression n. Alternatively, if sub-expression - n did not participate in the match, then last. + n did not participate in the match, then last.

- m[n].matched + m[n].matched

- For all integers n < m.size(), true if sub-expression n + For all integers n < m.size(), true if sub-expression n participated in the match, false otherwise.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/regex_replace.html b/doc/html/boost_regex/ref/regex_replace.html index f8a9c96c..5c47aaf3 100644 --- a/doc/html/boost_regex/ref/regex_replace.html +++ b/doc/html/boost_regex/ref/regex_replace.html @@ -1,13 +1,13 @@ -regex_replace + regex_replace - + - - - + + + @@ -24,19 +24,18 @@
+ regex_replace
 #include <boost/regex.hpp>

- 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 + 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. 

@@ -54,10 +53,10 @@
                                   const basic_string<charT>& fmt,
                                   match_flag_type flags = match_default);
-
- +

+ Description -

+ 
 template <class OutputIterator, class BidirectionalIterator, class traits, class charT>
 OutputIterator regex_replace(OutputIterator out,
@@ -74,22 +73,22 @@
         and copies the resulting string to out.
       

 

-        If the flag format_no_copy
+        If the flag format_no_copy
         is set in flags then unmatched sections of text are
         not copied to output.
       

 

-        If the flag format_first_only
+        If the flag format_first_only
         is set in flags then only the first occurence of e is
         replaced.
       

 

         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.
       

 

-        Effects: Constructs an regex_iterator object:
+        Effects: Constructs an regex_iterator object:
       

 
 regex_iterator<BidirectionalIterator, charT, traits, Allocator> 
@@ -97,7 +96,7 @@
 

 

         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).
       

 

@@ -146,12 +145,12 @@
         where last_m is a copy of the last match found.
       

 

-        If flags &
-        format_first_only is non-zero then
+        If flags &
+        format_first_only is non-zero then
         only the first match found is replaced.
       

 

-        Throws: std::runtime_error
+        Throws: std::runtime_error
         if the complexity of matching the expression against an N character string
         begins to exceed O(N2), or if the program runs out of stack space while matching
         the expression (if Boost.Regex is configured in recursive mode), or if the
@@ -159,7 +158,7 @@
         in non-recursive mode).
       

 

-        Returns: out.
+        Returns: out.
       

 
 template <class traits, class charT>
@@ -169,15 +168,15 @@
                                   match_flag_type flags = match_default);
 

 

-        Effects: Constructs an object basic_string<charT> result, calls regex_replace(back_inserter(result), s.begin(), s.end(), e,
+        Effects: Constructs an object basic_string<charT> result, calls regex_replace(back_inserter(result), s.begin(), s.end(), e,
         fmt,
-        flags),
-        and then returns result.
+        flags),
+        and then returns result.
       

-

-
+

+
         Examples
-      

+      
 

         The following example takes C/C++ source code as input, and outputs syntax
         highlighted HTML code.
@@ -295,7 +294,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/regex_search.html b/doc/html/boost_regex/ref/regex_search.html index c80a4a38..196ac687 100644 --- a/doc/html/boost_regex/ref/regex_search.html +++ b/doc/html/boost_regex/ref/regex_search.html @@ -1,13 +1,13 @@ -regex_search + regex_search - + - - - + + + @@ -24,13 +24,12 @@
+ regex_search
 #include <boost/regex.hpp>

- 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 @@ -74,10 +73,10 @@ const basic_regex<charT, traits>& e, match_flag_type flags = match_default); -

- +

+ Description -

+ 
 template <class BidirectionalIterator, class Allocator, class charT, class traits>
 bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
@@ -86,18 +85,18 @@
                   match_flag_type flags = match_default);

- Requires: Type BidirectionalIterator meets + Requires: Type BidirectionalIterator meets the requirements of a Bidirectional Iterator (24.1.4).

- Effects: Determines whether there is some + Effects: Determines whether there is some sub-sequence within [first,last) that matches the regular expression e, parameter flags is used to control how the expression is matched against the character sequence. Returns true if such a sequence exists, false otherwise.

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), or if the @@ -105,7 +104,7 @@ in non-recursive mode).

- Postconditions: If the function returns + Postconditions: If the function returns false, then the effect on parameter m is undefined, otherwise the effects on parameter m are given in the table: @@ -131,105 +130,105 @@

@@ -315,9 +314,9 @@ match_flag_typeflags=match_default);

- Effects: Returns the result of regex_search(str, str + Effects: Returns the result of regex_search(str, str + char_traits<charT>::length(str), - m, e, flags). + m, e, flags). 

 template <class ST, class SA, class Allocator, class charT,
@@ -328,7 +327,7 @@
                   match_flag_type flags = match_default);

- Effects: Returns the result of regex_search(s.begin(), s.end(), m, e, flags). + Effects: Returns the result of regex_search(s.begin(), s.end(), m, e, flags). 

 template <class iterator, class charT, class traits>
@@ -337,10 +336,10 @@
                   match_flag_type flags = match_default);

- Effects: Behaves "as if" by constructing - an instance of match_results<BidirectionalIterator> what, - and then returning the result of regex_search(first, last, what, e, - flags). + Effects: Behaves "as if" by constructing + an instance of match_results<BidirectionalIterator> what, + and then returning the result of regex_search(first, last, what, e, + flags). 

 template <class charT, class traits>
@@ -349,9 +348,9 @@
                   match_flag_type flags = match_default);

- Effects: Returns the result of regex_search(str, str + Effects: Returns the result of regex_search(str, str + char_traits<charT>::length(str), - e, flags). + e, flags). 

 template <class ST, class SA, class charT, class traits>
@@ -360,16 +359,16 @@
                   match_flag_type flags = match_default);

- Effects: Returns the result of regex_search(s.begin(), s.end(), e, flags). + Effects: Returns the result of regex_search(s.begin(), s.end(), e, flags).

-
- +

+ Examples -

+

The following example, takes the contents of a file in the form of a string, and searches for all the C++ class declarations in the file. The code will - work regardless of the way that std::string + work regardless of the way that std::string is implemented, for example it could easily be modified to work with the SGI rope class, which uses a non-contiguous storage strategy.

@@ -418,7 +417,10 @@

- m.size() + m.size()

- e.mark_count() + e.mark_count()

- m.empty() + m.empty()

- false + false

- m.prefix().first + m.prefix().first

- first + first

- m.prefix().last + m.prefix().last

- m[0].first + m[0].first

- m.prefix().matched + m.prefix().matched

- m.prefix().first != - m.prefix().second + m.prefix().first != + m.prefix().second

- m.suffix().first + m.suffix().first

- m[0].second + m[0].second

- m.suffix().last + m.suffix().last

- last + last

- m.suffix().matched + m.suffix().matched

- m.suffix().first != - m.suffix().second + m.suffix().first != + m.suffix().second

- m[0].first + m[0].first

@@ -242,7 +241,7 @@

- m[0].second + m[0].second

@@ -254,7 +253,7 @@

- m[0].matched + m[0].matched

@@ -267,12 +266,12 @@

- m[n].first + m[n].first

- For all integers n < m.size(), the start of the sequence that + For all integers n < m.size(), the start of the sequence that matched sub-expression n. Alternatively, if sub-expression n did not participate in the match, then last. @@ -282,26 +281,26 @@

- m[n].second + m[n].second

- For all integers n < m.size(), the end of the sequence that matched + For all integers n < m.size(), the end of the sequence that matched sub-expression n. Alternatively, if sub-expression - n did not participate in the match, then last. + n did not participate in the match, then last.

- m[n].matched + m[n].matched

- For all integers n < m.size(), true if sub-expression n + For all integers n < m.size(), true if sub-expression n participated in the match, false otherwise.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/regex_token_iterator.html b/doc/html/boost_regex/ref/regex_token_iterator.html index ac17d494..292ff6b0 100644 --- a/doc/html/boost_regex/ref/regex_token_iterator.html +++ b/doc/html/boost_regex/ref/regex_token_iterator.html @@ -1,13 +1,13 @@ -regex_token_iterator + regex_token_iterator - + - - - + + + @@ -24,16 +24,15 @@
+ regex_token_iterator

- 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 @@ -136,17 +135,17 @@ const std::vector<int>& submatch, regex_constants::match_flag_type m = regex_constants::match_default); -

- +

+ Description -

+ 

 regex_token_iterator();

- Effects: constructs an end of sequence iterator. + Effects: constructs an end of sequence iterator.

@@ -158,21 +157,21 @@ match_flag_typem=match_default);

- Preconditions: !re.empty(). Object re shall exist + Preconditions: !re.empty(). Object re shall exist 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 (that is to performs field splitting).

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), or if the @@ -189,25 +188,25 @@ match_flag_type m = match_default);

- Preconditions: submatches.size() - && !re.empty(). Object re shall exist + Preconditions: submatches.size() + && !re.empty(). Object re shall exist for the lifetime of the iterator constructed from it.

- Effects: constructs a regex_token_iterator that will enumerate - submatches.size() + 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] + index contained within submatches vector; if submatches[0] is -1, then the first string enumerated for each match will be all of the text from end of the last match to the start of the current match, in addition there will be one extra string enumerated when no more matches can be found: from the end of the last match found, to the end of the underlying sequence.

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), or if the @@ -225,23 +224,23 @@ match_flag_type m = match_default);

- Preconditions: !re.empty(). Object re shall exist + Preconditions: !re.empty(). Object re shall exist 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] + within the submatches array; if submatches[0] is -1, then the first string enumerated for each match will be all of the text from end of the last match to the start of the current match, in addition there will be one extra string enumerated when no more matches can be found: from the end of the last match found, to the end of the underlying sequence.

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), or if the @@ -254,10 +253,10 @@ regex_token_iterator(const regex_token_iterator& that);

- Effects: constructs a copy of that. + Effects: constructs a copy of that.

- Postconditions: *this == that. + Postconditions: *this == that.

@@ -265,10 +264,10 @@ regex_token_iterator&operator=(constregex_token_iterator&that);

- Effects: sets *this to be equal to that. + Effects: sets *this to be equal to that.

- Postconditions: *this == that. + Postconditions: *this == that.

@@ -276,7 +275,7 @@ booloperator==(constregex_token_iterator&)const;

- Effects: returns true if *this is the same position as that. + Effects: returns true if *this is the same position as that.

@@ -284,7 +283,7 @@ booloperator!=(constregex_token_iterator&)const;

- Effects: returns !(*this == that). + Effects: returns !(*this == that).

@@ -292,7 +291,7 @@ constvalue_type&operator*()const;

- Effects: returns the current character sequence + Effects: returns the current character sequence being enumerated.

@@ -301,7 +300,7 @@ const value_type* operator->()const;

- Effects: returns &(*this). + Effects: returns &(*this).

@@ -309,11 +308,11 @@ regex_token_iterator&operator++();

- Effects: Moves on to the next character + Effects: Moves on to the next character sequence to be enumerated.

- Throws: std::runtime_error + Throws: std::runtime_error if the complexity of matching the expression against an N character string begins to exceed O(N2), or if the program runs out of stack space while matching the expression (if Boost.Regex is configured in recursive mode), or if the @@ -321,7 +320,7 @@ in non-recursive mode).

- Returns: *this. + Returns: *this.

@@ -329,11 +328,11 @@ regex_token_iterator&operator++(int);

- Effects: constructs a copy result of *this, then - calls ++(*this). + Effects: constructs a copy result of *this, then + calls ++(*this).

- Returns: result. + Returns: result.

@@ -389,17 +388,17 @@ regex_constants::match_flag_typem=regex_constants::match_default);

- Effects: returns a regex_token_iterator that enumerates - one sub_match + Effects: returns a regex_token_iterator that enumerates + one sub_match for each value in submatch for each occurrence of regular expression e in string p, matched - using match_flag_type + using match_flag_type m.

-
- +

+ Examples -

+

The following example takes a string and splits it into a series of tokens:

@@ -512,7 +511,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/regex_traits.html b/doc/html/boost_regex/ref/regex_traits.html index 6ba48c1c..f358fb18 100644 --- a/doc/html/boost_regex/ref/regex_traits.html +++ b/doc/html/boost_regex/ref/regex_traits.html @@ -1,13 +1,14 @@ -regex_traits + regex_traits - + - - - + + + @@ -24,8 +25,7 @@
+ regex_traits
 namespace boost{
 
@@ -46,28 +46,28 @@
 
 } // namespace boost
-
- +

+ Description -

+

- The class regex_traits is + The class regex_traits is just a thin wrapper around an actual implemention class, which may be one of:

  • -c_regex_traits: this class +c_regex_traits: this class is deprecated, it wraps the C locale, and is used as the default implementation when the platform is not Win32, and the C++ locale is not available.
  • -cpp_regex_traits: the default +cpp_regex_traits: the default traits class for non-Win32 platforms, allows the regex class to be imbued with a std::locale instance.
  • -w32_regex_traits: the default +w32_regex_traits: the default traits class implementation on Win32 platforms, allows the regex class to be imbued with an LCID.
    • @@ -78,22 +78,26 @@

    • - BOOST_REGEX_USE_C_LOCALE: makes c_regex_traits + BOOST_REGEX_USE_C_LOCALE: makes c_regex_traits the default.
    • - BOOST_REGEX_USE_CPP_LOCALE: makes cpp_regex_traits + BOOST_REGEX_USE_CPP_LOCALE: makes cpp_regex_traits the default.

    - All these traits classes fulfil the traits + All these traits classes fulfil the traits class requirements.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/sub_match.html b/doc/html/boost_regex/ref/sub_match.html index bf321f1b..25d88d03 100644 --- a/doc/html/boost_regex/ref/sub_match.html +++ b/doc/html/boost_regex/ref/sub_match.html @@ -1,13 +1,13 @@ -sub_match + sub_match - + - - - + + + @@ -24,8 +24,7 @@
+ sub_match
 #include <boost/regex.hpp>
@@ -34,29 +33,29 @@ 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 - may be compared to objects of type std::basic_string, - or const charT* or const - charT. + Objects of type sub_match + may be compared to objects of type std::basic_string, + or const charT* or const + charT.

- Objects of type sub_match - may be added to objects of type std::basic_string, - or const charT* or const - charT, to produce a new std::basic_string + Objects of type sub_match + may be added to objects of type std::basic_string, + or const charT* or const + charT, 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,18 +64,18 @@ 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 - match was obtained as a result of the flag match_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 @@ -330,14 +329,14 @@ } // namespace boost -

- +

+ Description -

-
- +
+
+ Members -
+ 

@@ -393,8 +392,8 @@
 static difference_type length();

- Effects: returns the length of this matched - sub-expression, or 0 if this sub-expression was not matched: matched ? distance(first, second) : 0). + Effects: returns the length of this matched + sub-expression, or 0 if this sub-expression was not matched: matched ? distance(first, second) : 0).

@@ -402,7 +401,7 @@ operatorbasic_string<value_type>()const;

- Effects: converts *this into a string: returns (matched ? basic_string<value_type>(first, second) : basic_string<value_type>()). + Effects: converts *this into a string: returns (matched ? basic_string<value_type>(first, second) : basic_string<value_type>()).

@@ -410,10 +409,10 @@ basic_string<value_type>str()const;

- Effects: returns a string representation - of *this: - (matched - ? basic_string<value_type>(first, second) : basic_string<value_type>()). + Effects: returns a string representation + of *this: + (matched + ? basic_string<value_type>(first, second) : basic_string<value_type>()).

@@ -421,8 +420,8 @@ intcompare(constsub_match&s)const;

- Effects: performs a lexical comparison to - s: returns str().compare(s.str()). + Effects: performs a lexical comparison to + s: returns str().compare(s.str()).

@@ -430,8 +429,8 @@ intcompare(constbasic_string<value_type>&s)const;

- Effects: compares *this to the string s: - returns str().compare(s). + Effects: compares *this to the string s: + returns str().compare(s).

@@ -439,8 +438,8 @@ intcompare(constvalue_type*s)const;

- Effects: compares *this to the null-terminated string s: - returns str().compare(s). + Effects: compares *this to the null-terminated string s: + returns str().compare(s).

@@ -450,7 +449,7 @@

Defines an implementation-specific type that satisfies the requirements of a standard library Sequence (21.1.1 including the optional Table 68 operations), - whose value_type is a sub_match<BidirectionalIterator>. This type happens to be std::vector<sub_match<BidirectionalIterator> >, + whose value_type is a sub_match<BidirectionalIterator>. This type happens to be std::vector<sub_match<BidirectionalIterator> >, but you shouldn't actually rely on that.

@@ -459,18 +458,18 @@ const capture_sequence_type& captures()const;

- Effects: returns a sequence containing all + Effects: returns a sequence containing all the captures obtained for this sub-expression.

- Preconditions: the library must be built + 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 + match_extra to the regex + 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.

- Rationale: Enabling this feature has several + Rationale: Enabling this feature has several consequences:

    @@ -488,11 +487,11 @@ to take place.
-
- +
+ sub_match non-member operators -
+ 

@@ -501,8 +500,8 @@
                   const sub_match<BidirectionalIterator>& rhs);

- Effects: returns lhs.compare(rhs) - == 0. + Effects: returns lhs.compare(rhs) + == 0.

@@ -512,8 +511,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs.compare(rhs) - != 0. + Effects: returns lhs.compare(rhs) + != 0.

@@ -523,8 +522,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs.compare(rhs) - < 0. + Effects: returns lhs.compare(rhs) + < 0.

@@ -534,8 +533,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs.compare(rhs) - <= 0. + Effects: returns lhs.compare(rhs) + <= 0.

@@ -545,8 +544,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs.compare(rhs) - >= 0. + Effects: returns lhs.compare(rhs) + >= 0.

@@ -556,8 +555,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs.compare(rhs) - > 0. + Effects: returns lhs.compare(rhs) + > 0.

@@ -569,8 +568,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - == rhs.str(). + Effects: returns lhs + == rhs.str().

@@ -582,8 +581,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - != rhs.str(). + Effects: returns lhs + != rhs.str().

@@ -595,8 +594,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - < rhs.str(). + Effects: returns lhs + < rhs.str().

@@ -608,8 +607,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - > rhs.str(). + Effects: returns lhs + > rhs.str().

@@ -621,8 +620,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - >= rhs.str(). + Effects: returns lhs + >= rhs.str().

@@ -634,8 +633,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - <= rhs.str(). + Effects: returns lhs + <= rhs.str().

@@ -647,8 +646,8 @@ Allocator>&rhs);

- Effects: returns lhs.str() - == rhs. + Effects: returns lhs.str() + == rhs.

@@ -660,8 +659,8 @@ Allocator>&rhs);

- Effects: returns lhs.str() - != rhs. + Effects: returns lhs.str() + != rhs.

@@ -673,8 +672,8 @@ Allocator>&rhs);

- Effects: returns lhs.str() - < rhs. + Effects: returns lhs.str() + < rhs.

@@ -686,8 +685,8 @@ Allocator>&rhs);

- Effects: returns lhs.str() - > rhs. + Effects: returns lhs.str() + > rhs.

@@ -699,8 +698,8 @@ Allocator>&rhs);

- Effects: returns lhs.str() - >= rhs. + Effects: returns lhs.str() + >= rhs.

@@ -712,8 +711,8 @@ Allocator>&rhs);

- Effects: returns lhs.str() - <= rhs. + Effects: returns lhs.str() + <= rhs.

@@ -723,8 +722,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - == rhs.str(). + Effects: returns lhs + == rhs.str().

@@ -734,8 +733,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - != rhs.str(). + Effects: returns lhs + != rhs.str().

@@ -745,8 +744,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - < rhs.str(). + Effects: returns lhs + < rhs.str().

@@ -756,8 +755,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - > rhs.str(). + Effects: returns lhs + > rhs.str().

@@ -767,8 +766,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - >= rhs.str(). + Effects: returns lhs + >= rhs.str().

@@ -778,8 +777,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - <= rhs.str(). + Effects: returns lhs + <= rhs.str().

@@ -789,8 +788,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst*rhs);

- Effects: returns lhs.str() - == rhs. + Effects: returns lhs.str() + == rhs.

@@ -800,8 +799,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst*rhs);

- Effects: returns lhs.str() - != rhs. + Effects: returns lhs.str() + != rhs.

@@ -811,8 +810,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst*rhs);

- Effects: returns lhs.str() - < rhs. + Effects: returns lhs.str() + < rhs.

@@ -822,8 +821,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst*rhs);

- Effects: returns lhs.str() - > rhs. + Effects: returns lhs.str() + > rhs.

@@ -833,8 +832,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst*rhs);

- Effects: returns lhs.str() - >= rhs. + Effects: returns lhs.str() + >= rhs.

@@ -844,8 +843,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst*rhs);

- Effects: returns lhs.str() - <= rhs. + Effects: returns lhs.str() + <= rhs.

@@ -855,8 +854,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - == rhs.str(). + Effects: returns lhs + == rhs.str().

@@ -866,8 +865,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - != rhs.str(). + Effects: returns lhs + != rhs.str().

@@ -877,8 +876,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - < rhs.str(). + Effects: returns lhs + < rhs.str().

@@ -888,8 +887,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - > rhs.str(). + Effects: returns lhs + > rhs.str().

@@ -899,8 +898,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - >= rhs.str(). + Effects: returns lhs + >= rhs.str().

@@ -910,8 +909,8 @@ constsub_match<BidirectionalIterator>&rhs);

- Effects: returns lhs - <= rhs.str(). + Effects: returns lhs + <= rhs.str().

@@ -921,8 +920,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst&rhs);

- Effects: returns lhs.str() - == rhs. + Effects: returns lhs.str() + == rhs.

@@ -932,8 +931,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst&rhs);

- Effects: returns lhs.str() - != rhs. + Effects: returns lhs.str() + != rhs.

@@ -943,8 +942,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst&rhs);

- Effects: returns lhs.str() - < rhs. + Effects: returns lhs.str() + < rhs.

@@ -954,8 +953,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst&rhs);

- Effects: returns lhs.str() - > rhs. + Effects: returns lhs.str() + > rhs.

@@ -965,8 +964,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst&rhs);

- Effects: returns lhs.str() - >= rhs. + Effects: returns lhs.str() + >= rhs.

@@ -976,12 +975,12 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst&rhs);

- Effects: returns lhs.str() - <= rhs. + Effects: returns lhs.str() + <= rhs.

- The addition operators for sub_match allow you to add a sub_match - to any type to which you can add a std::string + 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.

@@ -995,8 +994,8 @@ const sub_match<BidirectionalIterator>& m);

- Effects: returns s - + m.str(). + Effects: returns s + + m.str().

@@ -1009,8 +1008,8 @@ Allocator>&s);

- Effects: returns m.str() - + s. + Effects: returns m.str() + + s.

@@ -1021,8 +1020,8 @@ constsub_match<BidirectionalIterator>&m);

- Effects: returns s - + m.str(). + Effects: returns s + + m.str().

@@ -1033,8 +1032,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst*s);

- Effects: returns m.str() - + s. + Effects: returns m.str() + + s.

@@ -1045,8 +1044,8 @@ constsub_match<BidirectionalIterator>&m);

- Effects: returns s - + m.str(). + Effects: returns s + + m.str().

@@ -1057,8 +1056,8 @@ typenameiterator_traits<BidirectionalIterator>::value_typeconst&s);

- Effects: returns m.str() - + s. + Effects: returns m.str() + + s.

@@ -1069,13 +1068,13 @@ constsub_match<BidirectionalIterator>&m2);

- Effects: returns m1.str() - + m2.str(). + Effects: returns m1.str() + + m2.str().

-
- +
+ Stream inserter -
+ 

@@ -1085,12 +1084,15 @@
                const sub_match<BidirectionalIterator>& m);

- Effects: returns (os << m.str()). + Effects: returns (os << m.str()).

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/syntax_option_type.html b/doc/html/boost_regex/ref/syntax_option_type.html index 05d85304..9a4e4ab1 100644 --- a/doc/html/boost_regex/ref/syntax_option_type.html +++ b/doc/html/boost_regex/ref/syntax_option_type.html @@ -1,13 +1,14 @@ -syntax_option_type + syntax_option_type - + - - - + + + @@ -24,8 +25,7 @@
+ syntax_option_type
syntax_option_type Synopsis
@@ -43,7 +43,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_basic.html b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_basic.html index 28d5b5c4..6a93eee2 100644 --- a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_basic.html +++ b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_basic.html @@ -1,13 +1,16 @@ -Options for POSIX Basic Regular Expressions + + Options for POSIX Basic Regular Expressions - + - - - + + + @@ -24,9 +27,9 @@
+ + Options for POSIX Basic Regular Expressions

Exactly one of the following must always be set for POSIX basic regular expressions: @@ -69,7 +72,8 @@

@@ -199,7 +205,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.

@@ -237,8 +243,9 @@ @@ -258,7 +265,7 @@

Specifies that the \n character has the same effect as the alternation operator |. Allows newline separated lists to be used as a list - of alternatives. This bit is already set, if you use the grep option. + of alternatives. This bit is already set, if you use the grep option.

@@ -275,7 +282,7 @@ @@ -294,8 +301,9 @@ @@ -350,7 +358,7 @@ @@ -368,7 +376,7 @@ @@ -378,7 +386,10 @@

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). @@ -107,12 +111,13 @@

Specifies that the grammar recognized by the regular expression - engine is the same as that used by POSIX utility grep in IEEE Std 1003.1-2001, + engine is the same as that used by POSIX utility grep in IEEE Std 1003.1-2001, Portable Operating System Interface (POSIX ), Shells and Utilities, 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 +137,8 @@

- 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.

- Specifies that character ranges of the form [a-b] - should be locale sensitive. This bit is on by default for POSIX-Basic regular expressions, + Specifies that character ranges of the form [a-b] + 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.

- When set then character classes such as [[:alnum:]] + When set then character classes such as [[:alnum:]] are not allowed.

When set this makes the escape character ordinary inside lists, - so that [\b] would match either '\' or 'b'. - This bit is on by default for POSIX-basic + so that [\b] would match either '\' or 'b'. + This bit is on by default for POSIX-basic regular expressions, but can be unset to force escapes to be recognised inside lists.

@@ -331,8 +339,8 @@

- When set then \? acts - as a zero-or-one repeat operator, and \+ + When set then \? acts + as a zero-or-one repeat operator, and \+ acts as a one-or-more repeat operator.

- When set then \| acts + When set then \| acts as the alternation operator.

- Prevents basic_regex from throwing + Prevents basic_regex from throwing an exception when an invalid expression is encountered.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_extended.html b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_extended.html index f2690f5e..9c11ca00 100644 --- a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_extended.html +++ b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_extended.html @@ -1,13 +1,16 @@ -Options for POSIX Extended Regular Expressions + + Options for POSIX Extended Regular Expressions - + - - - + + + @@ -24,11 +27,12 @@
+ + Options for POSIX Extended Regular Expressions

- Exactly one of the following must always be set for POSIX + Exactly one of the following must always be set for POSIX extended regular expressions:

@@ -75,7 +79,8 @@ (FWD.1).

- Refer to the POSIX + Refer to the POSIX extended regular expression guide for more information.

@@ -106,7 +111,8 @@ grep (FWD.1).

- That is to say, the same as POSIX + That is to say, the same as POSIX extended syntax, but with the newline character acting as an alternation character in addition to "|".

@@ -131,7 +137,8 @@ and Utilities, Section 4, awk (FWD.1).

- That is to say: the same as POSIX + That is to say: the same as POSIX extended syntax, but with escape sequences in character classes permitted.

@@ -207,7 +214,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.

@@ -245,7 +252,7 @@ @@ -333,7 +340,10 @@

- Specifies that character ranges of the form [a-b] + Specifies that character ranges of the form [a-b] should be locale sensitive. This bit is on by default for POSIX-Extended regular expressions, but can be unset to force ranges to be compared by code point only. @@ -285,7 +292,7 @@

When set this makes the escape character ordinary inside lists, - so that [\b] would match either '\' or 'b'. + so that [\b] would match either '\' or 'b'. This bit is on by default for POSIX-Extended regular expressions, but can be unset to force escapes to be recognised inside lists.

@@ -323,7 +330,7 @@

- Prevents basic_regex from throwing + Prevents basic_regex from throwing an exception when an invalid expression is encountered.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_literal.html b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_literal.html index d8d50cdf..7e1ad83c 100644 --- a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_literal.html +++ b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_literal.html @@ -1,13 +1,15 @@ -Options for Literal Strings + + Options for Literal Strings - + - - - + + + @@ -24,9 +26,9 @@
+ + Options for Literal Strings

The following must always be set to interpret the expression as a string literal: @@ -143,7 +145,10 @@

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_overview.html b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_overview.html index 7a3b9eee..e8d09cca 100644 --- a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_overview.html +++ b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_overview.html @@ -1,13 +1,16 @@ -Overview of syntax_option_type + + Overview of syntax_option_type - + - - - + + + @@ -24,22 +27,22 @@
+ + Overview of syntax_option_type

- 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 - will always have exactly one of the elements normal, - basic, extended, - awk, grep, - egrep, sed, - literal or perl set. + 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, + egrep, sed, + literal or perl set.

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: 

@@ -63,7 +66,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

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 95eaac41..36fea83b 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 @@ -1,13 +1,16 @@ -Options for Perl Regular Expressions + + Options for Perl Regular Expressions - + - - - + + + @@ -24,9 +27,9 @@
+ + Options for Perl Regular Expressions

One of the following must always be set for perl regular expressions:

@@ -73,11 +76,12 @@ part 10, RegExp (Regular Expression) Objects (FWD.1).

- This is functionally identical to the Perl + This is functionally identical to the Perl regular expression syntax.

- Boost.Regex also recognizes all of the perl-compatible (?...) extensions in this mode. + Boost.Regex also recognizes all of the perl-compatible (?...) extensions in this mode.

@@ -211,7 +215,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.

@@ -249,7 +253,7 @@ @@ -286,7 +290,7 @@ @@ -325,9 +329,9 @@ @@ -346,9 +350,9 @@ @@ -376,7 +380,10 @@

- Specifies that character ranges of the form [a-b] + Specifies that character ranges of the form [a-b] should be locale sensitive.

- Prevents basic_regex from throwing + Prevents basic_regex from throwing an exception when an invalid expression is encountered.

Normally whether Boost.Regex will match "." against a - newline character is determined by the match flag match_dot_not_newline. Specifying - this flag is equivalent to prefixing the expression with (?-s) and therefore causes "." - not to match a newline character regardless of whether match_not_dot_newline is set + newline character is determined by the match flag match_dot_not_newline. Specifying + this flag is equivalent to prefixing the expression with (?-s) and therefore causes "." + not to match a newline character regardless of whether match_not_dot_newline is set in the match flags.

Normally whether Boost.Regex will match "." against a - newline character is determined by the match flag match_dot_not_newline. Specifying - this flag is equivalent to prefixing the expression with (?s) and therefore causes "." - to match a newline character regardless of whether match_not_dot_newline is set + newline character is determined by the match flag match_dot_not_newline. Specifying + this flag is equivalent to prefixing the expression with (?s) and therefore causes "." + to match a newline character regardless of whether match_not_dot_newline is set in the match flags.

- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_synopsis.html b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_synopsis.html index 9e01046a..40e6d61f 100644 --- a/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_synopsis.html +++ b/doc/html/boost_regex/ref/syntax_option_type/syntax_option_type_synopsis.html @@ -1,13 +1,15 @@ -syntax_option_type Synopsis + + syntax_option_type Synopsis - + - - - + + + @@ -24,15 +26,15 @@
+ + syntax_option_type Synopsis

- 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. 

 namespace std{ namespace regex_constants{
@@ -63,7 +65,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/syntax.html b/doc/html/boost_regex/syntax.html index 4a9c6b84..df1cc1bc 100644 --- a/doc/html/boost_regex/syntax.html +++ b/doc/html/boost_regex/syntax.html @@ -1,13 +1,14 @@ -Regular Expression Syntax + Regular Expression Syntax - + - - + + @@ -24,8 +25,7 @@
+ Regular Expression Syntax
Perl Regular Expression Syntax
@@ -63,15 +63,18 @@

@@ -94,7 +97,10 @@
- +
Copyright © 2007 John Maddock
Copyright © 2007 John Maddock

+ 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) +

diff --git a/doc/html/boost_regex/syntax/basic_extended.html b/doc/html/boost_regex/syntax/basic_extended.html index cb3b7125..ba068602 100644 --- a/doc/html/boost_regex/syntax/basic_extended.html +++ b/doc/html/boost_regex/syntax/basic_extended.html @@ -1,13 +1,16 @@ -POSIX Extended Regular Expression Syntax + POSIX Extended Regular + Expression Syntax - + - - - + + + @@ -24,18 +27,18 @@
-

- + POSIX Extended Regular + Expression Syntax

+

+ Synopsis -

+

The POSIX-Extended regular expression syntax is supported by the POSIX C - regular expression API's, and variations are used by the utilities egrep and awk. + regular expression API's, and variations are used by the utilities egrep and awk. You can construct POSIX extended regular expressions in Boost.Regex by passing - the flag extended to the + the flag extended to the regex constructor, for example: 

@@ -46,38 +49,38 @@

-

- +

+ POSIX Extended Syntax -

+

In POSIX-Extended regular expressions, all characters match themselves except for the following special characters: 

.[{()\*+?|^$
-
- +

+ Wildcard: -

+

The single character '.' when used outside of a character set will match any single character except:

  • - The NULL character when the flag match_no_dot_null + The NULL character when the flag match_no_dot_null is passed to the matching algorithms.
  • - The newline character when the flag match_not_dot_newline + The newline character when the flag match_not_dot_newline is passed to the matching algorithms.
-
- +

+ Anchors: -

+

A '^' character shall match the start of a line when used as the first character of an expression, or the first character of a sub-expression. @@ -86,39 +89,39 @@ A '$' character shall match the end of a line when used as the last character of an expression, or the last character of a sub-expression.

-
- +

+ Marked sub-expressions: -

+

- A section beginning ( and ending - ) acts as a marked sub-expression. + A section beginning ( and ending + ) acts as a marked sub-expression. Whatever matched the sub-expression is split out in a separate field by the matching algorithms. Marked sub-expressions can also repeated, or referred to by a back-reference.

-
- +

+ Repeats: -

+

Any atom (a single character, a marked sub-expression, or a character class) - can be repeated with the *, - +, ?, - and {} operators. + can be repeated with the *, + +, ?, + and {} operators.

- The * operator will match the + The * operator will match the preceding atom zero or more times, for example the expression - a*b will match any of the following: + a*b will match any of the following: 

b
 ab
 aaaaaaaab

- The + operator will match the + The + operator will match the preceding atom one or more times, for example the expression a+b will match any of the following:

@@ -131,9 +134,9 @@ aaaaaaaab 
b

- The ? operator will match the + The ? operator will match the preceding atom zero or one times, for example the expression - ca?b will match any of the following: + ca?b will match any of the following: 

cb
 cab
@@ -147,15 +150,15 @@ cab
         An atom can also be repeated with a bounded repeat:
       

 

-        a{n} Matches
+        a{n} Matches
         'a' repeated exactly n times.
       

 

-        a{n,} Matches
+        a{n,} Matches
         'a' repeated n or more times.
       

 

-        a{n, m} Matches 'a' repeated between n
+        a{n, m} Matches 'a' repeated between n
         and m times inclusive.
       

 

@@ -184,13 +187,13 @@ cab
 a(*)

- Will raise an error, as there is nothing for the * + Will raise an error, as there is nothing for the * operator to be applied to.

-
- +

+ Back references: -

+

An escape character followed by a digit n, where n is in the range 1-9, matches the same string that was matched by sub-expression @@ -214,29 +217,29 @@ cab

-
[Caution] Caution

+

The POSIX standard does not support back-references for "extended" regular expressions, this is a compatible extension to that standard.

-
- +

+ Alternation -

+

- The | operator will match either - of its arguments, so for example: abc|def will + The | operator will match either + of its arguments, so for example: abc|def will match either "abc" or "def".

- Parenthesis can be used to group alternations, for example: ab(d|ef) + Parenthesis can be used to group alternations, for example: ab(d|ef) will match either of "abd" or "abef".

-
- +

+ Character sets: -

+

A character set is a bracket-expression starting with [ and ending with ], it defines a set of characters, and matches any single character that is @@ -245,72 +248,73 @@ cab

A bracket expression may contain any combination of the following:

-
- +
+ Single characters: -
+

- For example [abc], will match any of the characters 'a', 'b', + For example [abc], will match any of the characters 'a', 'b', or 'c'.

-
- +
+ Character ranges: -
+

- For example [a-c] + For example [a-c] will match any single character in the range 'a' to 'c'. By default, for POSIX-Extended regular expressions, a character x is 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 + behavior can be turned off by unsetting the collate + option flag - in which case whether a character appears within a range is determined by comparing the code points of the characters only.

-
- +
+ Negation: -
+

If the bracket-expression begins with the ^ character, then it matches the - complement of the characters it contains, for example [^a-c] matches any character that is not in the - range a-c. + complement of the characters it contains, for example [^a-c] matches any character that is not in the + range a-c.

-
- +
+ Character classes: -
+

- An expression of the form [[:name:]] - matches the named character class "name", for example [[:lower:]] matches any lower case character. See - character class names. + An expression of the form [[:name:]] + matches the named character class "name", for example [[:lower:]] matches any lower case character. See + character class names.

-
- +
+ Collating Elements: -
+

- An expression of the form [[.col.] matches + An expression of the form [[.col.] matches the collating element col. A collating element is any single character, or any sequence of characters that collates as a single unit. Collating elements may also be used as the end point of a range, for - example: [[.ae.]-c] + example: [[.ae.]-c] matches the character sequence "ae", plus any single character in the range "ae"-c, assuming that "ae" is treated as a single collating element in the current locale.

Collating elements may be used in place of escapes (which are not normally - allowed inside character sets), for example [[.^.]abc] would + allowed inside character sets), for example [[.^.]abc] would 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: 

 [[.NUL.]]
@@ -318,35 +322,35 @@ cab
 

         matches a NUL character.
       

-

-
+

+
         Equivalence
         classes:
-      

+      
 

-        An expression of the form [[=col=]],
+        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
+        locale-specific tailorings; so for example [[=a=]] matches
         any of the characters: a, À, Á, Â, Ã, Ä, Å, A, à, á, â, ã, ä and å. Unfortunately implementation
         of this is reliant on the platform's collation and localisation support;
         this feature can not be relied upon to work portably across all platforms,
         or even all locales on one platform.
       

-

-
+

+
         Combinations:
-      

+      
 

         All of the above can be combined in one character set declaration, for example:
-        [[:digit:]a-c[.NUL.]].
+        [[:digit:]a-c[.NUL.]].
       

-

-
+

+
         Escapes
-      

+      
 

         The POSIX standard defines no escape sequences for POSIX-Extended regular
         expressions, except that:
@@ -361,7 +365,7 @@ cab
 
  • 
           An escape inside a character class declaration shall match itself: in other
           words the escape character is not "special" inside a character
-          class declaration; so [\^]
+          class declaration; so [\^]
           will match either a literal '\' or a '^'.
         
    •
    @@ -369,11 +373,11 @@ cab However, that's rather restrictive, so the following standard-compatible extensions are also supported by Boost.Regex:

    -
    - +
    + Escapes matching a specific character -
    +

    The following escape sequences are all synonyms for single characters:

    @@ -552,17 +556,17 @@ cab

    Matches the single character which has the symbolic name name. For - example \\N{newline} matches the single character \n. + example \\N{newline} matches the single character \n.

    -
    - +
    + "Single character" character classes: -
    +

    Any escaped character x, if x is the name of a character class shall match any character that is a member @@ -593,130 +597,130 @@ cab

    - \d + \d

    - [[:digit:]] + [[:digit:]]

    - \l + \l

    - [[:lower:]] + [[:lower:]]

    - \s + \s

    - [[:space:]] + [[:space:]]

    - \u + \u

    - [[:upper:]] + [[:upper:]]

    - \w + \w

    - [[:word:]] + [[:word:]]

    - \D + \D

    - [^[:digit:]] + [^[:digit:]]

    - \L + \L

    - [^[:lower:]] + [^[:lower:]]

    - \S + \S

    - [^[:space:]] + [^[:space:]]

    - \U + \U

    - [^[:upper:]] + [^[:upper:]]

    - \W + \W

    - [^[:word:]] + [^[:word:]]

    -
    - +
    + Character Properties -
    +

    The character property names in the following table are all equivalent to the names used in character classes. @@ -748,7 +752,7 @@ cab

    - \pX + \pX

    @@ -758,14 +762,14 @@ cab

    - [[:X:]] + [[:X:]]

    - \p{Name} + \p{Name}

    @@ -775,14 +779,14 @@ cab

    - [[:Name:]] + [[:Name:]]

    - \PX + \PX

    @@ -792,14 +796,14 @@ cab

    - [^[:X:]] + [^[:X:]]

    - \P{Name} + \P{Name}

    @@ -809,20 +813,20 @@ cab

    - [^[:Name:]] + [^[:Name:]]

    - For example \pd - matches any "digit" character, as does \p{digit}. + For example \pd + matches any "digit" character, as does \p{digit}.

    -
    - +
    + Word Boundaries -
    +

    The following escape sequences match the boundaries of words:

    @@ -847,7 +851,7 @@ cab

    - \< + \<

    @@ -859,7 +863,7 @@ cab

    - \> + \>

    @@ -871,7 +875,7 @@ cab

    - \b + \b

    @@ -883,7 +887,7 @@ cab

    - \B + \B

    @@ -894,11 +898,11 @@ cab
    -
    - +
    + Buffer boundaries -
    +

    The following match only at buffer boundaries: a "buffer" in this context is the whole of the input text that is being matched against (note @@ -949,7 +953,7 @@ cab

    - \A + \A

    @@ -961,7 +965,7 @@ cab

    - \z + \z

    @@ -973,50 +977,50 @@ cab

    - \Z + \Z

    Matches an optional sequence of newlines at the end of a buffer: - equivalent to the regular expression \n*\z + equivalent to the regular expression \n*\z

    -
    - +
    + Continuation Escape -
    +

    - The sequence \G + The sequence \G matches only at the end of the last match found, or at the start of the text being matched if no previous match was found. This escape useful if you're iterating over the matches contained within a text, and you want each subsequence match to start where the last one ended.

    -
    - +
    + Quoting escape -
    +

    - The escape sequence \Q + The escape sequence \Q begins a "quoted sequence": all the subsequent characters are treated - as literals, until either the end of the regular expression or \E is found. - For example the expression: \Q\*+\Ea+ would match either of: + as literals, until either the end of the regular expression or \E is found. + For example the expression: \Q\*+\Ea+ would match either of: 

     \*+a
 \*+aaa
    -
    - +
    + Unicode escapes -
    +
    @@ -1038,7 +1042,7 @@ cab

    - \C + \C

    		@@ -1051,7 +1055,7 @@ cab

    - \X + \X

    		@@ -1063,40 +1067,40 @@ cab
    -
    - +
    + Any other escape -
    +

    Any other escape sequence matches the character that is escaped, for example \@ matches a literal '@'.

    -
    - +

    + Operator precedence -

    +

    The order of precedence for of operators is as follows:

    1. - Collation-related bracket symbols [==] - [::] [..] + Collation-related bracket symbols [==] + [::] [..]
    2. - Escaped characters \ + Escaped characters \
    3. - Character set (bracket expression) [] + Character set (bracket expression) []
    4. - Grouping () + Grouping ()
    5. - Single-character-ERE duplication * - + ? {m,n} + Single-character-ERE duplication * + + ? {m,n}
    6. Concatenation @@ -1105,30 +1109,31 @@ cab Anchoring ^$
    7. - Alternation | + Alternation |
    -
    - +

    + What Gets Matched -

    +

    When there is more that one way to match a regular expression, the "best" - possible match is obtained using the leftmost-longest + possible match is obtained using the leftmost-longest rule.

    -

    - +

    + Variations -

    -
    - +
    +

    + Egrep -

    +

    - When an expression is compiled with the flag - egrep set, then the + When an expression is compiled with the flag + egrep set, then the expression is treated as a newline separated list of POSIX-Extended expressions, a match is found if any of the expressions in the list match, for example: @@ -1141,13 +1146,13 @@ cab

    As its name suggests, this behavior is consistent with the Unix utility - egrep, and with grep when + egrep, and with grep when used with the -E option.

    -
    - +

    + awk -

    +

    In addition to the POSIX-Extended features the escape character is special inside a character class @@ -1158,23 +1163,26 @@ cab specification are required to be supported - however Boost.Regex supports these by default anyway.

    -

    - +

    + Options -

    +

    - There are a variety - of flags that may be combined with the extended - and egrep options when constructing - the regular expression, in particular note that the newline_alt option alters the syntax, - while the collate, nosubs - and icase options + There are a variety + of flags that may be combined with the extended + and egrep options when constructing + the regular expression, in particular note that the newline_alt option alters the syntax, + while the collate, nosubs + and icase options modify how the case and locale sensitivity are to be applied.

    -

    - +

    + References -

    +

    IEEE Std 1003.1-2001, Portable Operating System Interface (POSIX ), Base Definitions @@ -1193,7 +1201,10 @@ cab

    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/syntax/basic_syntax.html b/doc/html/boost_regex/syntax/basic_syntax.html index 1c6da9c4..2e1fbf33 100644 --- a/doc/html/boost_regex/syntax/basic_syntax.html +++ b/doc/html/boost_regex/syntax/basic_syntax.html @@ -1,13 +1,16 @@ -POSIX Basic Regular Expression Syntax + POSIX Basic Regular + Expression Syntax - + - - - + + + @@ -24,18 +27,18 @@
    -

    - + POSIX Basic Regular + Expression Syntax

    +

    + Synopsis -

    +

    - The POSIX-Basic regular expression syntax is used by the Unix utility sed, and variations are used by grep and emacs. + 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: + the flag basic to the regex + constructor (see syntax_option_type), for example: 

     // e1 is a case sensitive POSIX-Basic expression:
@@ -45,38 +48,38 @@

    -

    - +

    + POSIX Basic Syntax -

    +

    In POSIX-Basic regular expressions, all characters are match themselves except for the following special characters: 

    .[\*^$
    -
    - +

    + Wildcard: -

    +

    The single character '.' when used outside of a character set will match any single character except:

    • - The NULL character when the flag match_no_dot_null + The NULL character when the flag match_no_dot_null is passed to the matching algorithms.
    • - The newline character when the flag match_not_dot_newline + The newline character when the flag match_not_dot_newline is passed to the matching algorithms.
    -
    - +

    + Anchors: -

    +

    A '^' character shall match the start of a line when used as the first character of an expression, or the first character of a sub-expression. @@ -85,30 +88,30 @@ A '$' character shall match the end of a line when used as the last character of an expression, or the last character of a sub-expression.

    -
    - +

    + Marked sub-expressions: -

    +

    - A section beginning \( and ending - \) acts as a marked sub-expression. + A section beginning \( and ending + \) acts as a marked sub-expression. Whatever matched the sub-expression is split out in a separate field by the matching algorithms. Marked sub-expressions can also repeated, or referred-to by a back-reference.

    -
    - +

    + Repeats: -

    +

    Any atom (a single character, a marked sub-expression, or a character class) can be repeated with the * operator.

    - For example a* + For example a* will match any number of letter a's repeated zero or more times (an atom - repeated zero times matches an empty string), so the expression a*b + repeated zero times matches an empty string), so the expression a*b will match any of the following: 

    b
@@ -119,15 +122,15 @@ aaaaaaaab
         An atom can also be repeated with a bounded repeat:
       
    
 
    
-        a\{n\} Matches
+        a\{n\} Matches
         'a' repeated exactly n times.
       
    
 
    
-        a\{n,\} Matches
+        a\{n,\} Matches
         'a' repeated n or more times.
       
    
 
    
-        a\{n, m\} Matches 'a' repeated between n and m times
+        a\{n, m\} Matches 'a' repeated between n and m times
         inclusive.
       
    
 
    
@@ -155,10 +158,10 @@ aaaa
         Will raise an error, as there is nothing for the * operator to be applied
         to.
       
    
-
    
-
+
    
+
         Back references:
-      
    
+      
 
    
         An escape character followed by a digit n, where n
         is in the range 1-9, matches the same string that was matched by sub-expression
@@ -173,11 +176,11 @@ aaaa
         But not the string:
       
    
 
    aaabba
    
-
    
-
+
    
+
         Character
         sets:
-      
    
+      
 
    
         A character set is a bracket-expression starting with [ and ending with ],
         it defines a set of characters, and matches any single character that is
@@ -186,68 +189,69 @@ aaaa
 
    
         A bracket expression may contain any combination of the following:
       
    
-
    
-
+
    
+
         Single
         characters:
-      
    
+      
 
    
-        For example [abc], will match any of the characters 'a', 'b',
+        For example [abc], will match any of the characters 'a', 'b',
         or 'c'.
       
    
-
    
-
+
    
+
         Character
         ranges:
-      
    
+      
 
    
-        For example [a-c]
+        For example [a-c]
         will match any single character in the range 'a' to 'c'. By default, for
         POSIX-Basic regular expressions, a character x is 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
+        can be turned off by unsetting the collate
         option flag when constructing the regular expression - in which case whether
         a character appears within a range is determined by comparing the code points
         of the characters only.
       
    
-
    
-
+
    
+
         Negation:
-      
    
+      
 
    
         If the bracket-expression begins with the ^ character, then it matches the
-        complement of the characters it contains, for example [^a-c] matches any character that is not in the
+        complement of the characters it contains, for example [^a-c] matches any character that is not in the
         range a-c.
       
    
-
    
-
+
    
+
         Character
         classes:
-      
    
+      
 
    
-        An expression of the form [[:name:]]
-        matches the named character class "name", for example [[:lower:]] matches any lower case character. See
-        character class names.
+        An expression of the form [[:name:]]
+        matches the named character class "name", for example [[:lower:]] matches any lower case character. See
+        character class names.
       
    
-
    
-
+
    
+
         Collating
         Elements:
-      
    
+      
 
    
-        An expression of the form [[.col.] matches
+        An expression of the form [[.col.] matches
         the collating element col. A collating element is any
         single character, or any sequence of characters that collates as a single
         unit. Collating elements may also be used as the end point of a range, for
-        example: [[.ae.]-c]
+        example: [[.ae.]-c]
         matches the character sequence "ae", plus any single character
         in the rangle "ae"-c, assuming that "ae" is treated as
         a single collating element in the current locale.
       
    
 
    
         Collating elements may be used in place of escapes (which are not normally
-        allowed inside character sets), for example [[.^.]abc] would
+        allowed inside character sets), for example [[.^.]abc] would
         match either one of the characters 'abc^'.
       
    
 
    
@@ -256,38 +260,38 @@ aaaa
       
    
 
    [[.NUL.]]
    
 
    
-        matches a 'NUL' character. See collating
+        matches a 'NUL' character. See collating
         element names.
       
    
-
    
-
+
    
+
         Equivalence
         classes:
-      
    
+      
 
    
-        An expression of theform [[=col=]],
+        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
+        or locale-specific tailorings; so for example [[=a=]] matches
         any of the characters: a, À, Á, Â, Ã, Ä, Å, A, à, á, â, ã, ä and å. Unfortunately implementation
         of this is reliant on the platform's collation and localisation support;
         this feature can not be relied upon to work portably across all platforms,
         or even all locales on one platform.
       
    
-
    
-
+
    
+
         Combinations:
-      
    
+      
 
    
         All of the above can be combined in one character set declaration, for example:
-        [[:digit:]a-c[.NUL.]].
+        [[:digit:]a-c[.NUL.]].
       
    
-
    
-
+
    
+
         Escapes
-      
    
+      
 
    
         With the exception of the escape sequences \{, \}, \(, and \), which are
         documented above, an escape followed by any character matches that character.
@@ -296,31 +300,32 @@ aaaa
 
    .[\*^$
    
 
    
         "ordinary". Note that the escape character loses its special meaning
-        inside a character set, so [\^]
+        inside a character set, so [\^]
         will match either a literal '\' or a '^'.
       
    
-
    
-
+
    
+
         What Gets
         Matched
-      
    
+      
 
    
         When there is more that one way to match a regular expression, the "best"
-        possible match is obtained using the leftmost-longest
+        possible match is obtained using the leftmost-longest
         rule.
       
    
-
    
-
+
    
+
         Variations
-      
    
+      
 
    
       
    
-
    
-
+
    
+
         Grep
-      
    
+      
 
    
-        When an expression is compiled with the flag grep
+        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
         is found if any of the expressions in the list match, for example:
       
    
@@ -334,10 +339,10 @@ aaaa
 
    
         As its name suggests, this behavior is consistent with the Unix utility grep.
       
    
-
    
-
+
    
+
         emacs
-      
    
+      
 
    
         In addition to the POSIX-Basic features
         the following characters are also special:
@@ -611,27 +616,31 @@ aaaa
         according to the Perl
         "depth first search" rules. Emacs expressions are matched
         this way because they contain Perl-like extensions, that do not interact
-        well with the POSIX-style
+        well with the POSIX-style
         leftmost-longest rule.
       
    
-
    
-
+
    
+
         Options
-      
    
+      
 
    
-        There are a variety
-        of flags that may be combined with the basic
-        and grep options when constructing
-        the regular expression, in particular note that the newline_alt, no_char_classes,
-        no-intervals, bk_plus_qm
-        and bk_plus_vbar options
-        all alter the syntax, while the collate and icase
+        There are a variety
+        of flags that may be combined with the basic
+        and grep options when constructing
+        the regular expression, in particular note that the newline_alt, no_char_classes,
+        no-intervals, bk_plus_qm
+        and bk_plus_vbar options
+        all alter the syntax, while the collate and icase
         options modify how the case and locale sensitivity are to be applied.
       
    
-
    
-
+
    
+
         References
-      
    
+      
 
    
         IEEE
         Std 1003.1-2001, Portable Operating System Interface (POSIX ), Base Definitions
@@ -648,7 +657,10 @@ aaaa
    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/syntax/character_classes.html b/doc/html/boost_regex/syntax/character_classes.html index baf9fa93..12d9356e 100644 --- a/doc/html/boost_regex/syntax/character_classes.html +++ b/doc/html/boost_regex/syntax/character_classes.html @@ -1,13 +1,16 @@ -Character Class Names + Character Class + Names - + - - - + + + @@ -24,9 +27,9 @@
    + Character Class + Names
    Character Classes that are Always Supported
    @@ -36,7 +39,10 @@
    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/syntax/character_classes/optional_char_class_names.html b/doc/html/boost_regex/syntax/character_classes/optional_char_class_names.html index d8b7c5a9..631ddf24 100644 --- a/doc/html/boost_regex/syntax/character_classes/optional_char_class_names.html +++ b/doc/html/boost_regex/syntax/character_classes/optional_char_class_names.html @@ -1,13 +1,16 @@ -Character classes that are supported by Unicode Regular Expressions + + Character classes that are supported by Unicode Regular Expressions - + - - - + + + @@ -24,12 +27,12 @@
    + + Character classes that are supported by Unicode Regular Expressions

    The following character classes are only supported by Unicode Regular Expressions: - that is those that use the u32regex + that is those that use the u32regex type. The names used are the same as those from Chapter 4 of the Unicode standard.

    @@ -533,7 +536,10 @@
    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/syntax/character_classes/std_char_clases.html b/doc/html/boost_regex/syntax/character_classes/std_char_clases.html index b3f24808..4a6bbd08 100644 --- a/doc/html/boost_regex/syntax/character_classes/std_char_clases.html +++ b/doc/html/boost_regex/syntax/character_classes/std_char_clases.html @@ -1,13 +1,17 @@ -Character Classes that are Always Supported + + Character Classes that are Always Supported - + - - - + + + @@ -24,9 +28,9 @@
    + + Character Classes that are Always Supported

    The following character class names are always supported by Boost.Regex:

    @@ -382,7 +386,10 @@
    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/syntax/collating_names.html b/doc/html/boost_regex/syntax/collating_names.html index b837a1a6..991967a1 100644 --- a/doc/html/boost_regex/syntax/collating_names.html +++ b/doc/html/boost_regex/syntax/collating_names.html @@ -1,13 +1,14 @@ -Collating Names + Collating Names - + - - - + + + @@ -24,8 +25,7 @@
    + Collating Names
    Digraphs
    @@ -36,7 +36,10 @@
    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/syntax/collating_names/digraphs.html b/doc/html/boost_regex/syntax/collating_names/digraphs.html index 90a30186..de77c8cc 100644 --- a/doc/html/boost_regex/syntax/collating_names/digraphs.html +++ b/doc/html/boost_regex/syntax/collating_names/digraphs.html @@ -1,13 +1,14 @@ -Digraphs + Digraphs - + - - - + + + @@ -24,8 +25,7 @@
    + Digraphs

    The following are treated as valid digraphs when used as a collating name:

    @@ -47,7 +47,10 @@
    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    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 ac4c46af..4d8e0ca4 100644 --- a/doc/html/boost_regex/syntax/collating_names/named_unicode.html +++ b/doc/html/boost_regex/syntax/collating_names/named_unicode.html @@ -1,13 +1,16 @@ -Named Unicode Characters + + Named Unicode Characters - + - - - + + + @@ -24,12 +27,12 @@
    + + Named Unicode Characters

    - When using Unicode aware regular expressions - (with the u32regex type), + 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:

    @@ -40,7 +43,10 @@
    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    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 91e5ce27..91f5931b 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 @@ -1,13 +1,15 @@ -POSIX Symbolic Names + + POSIX Symbolic Names - + - - - + + + @@ -24,9 +26,9 @@
    + + POSIX Symbolic Names

    The following symbolic names are recognised as valid collating element names, in addition to any single character, this allows you to write for @@ -971,7 +973,10 @@

    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/syntax/leftmost_longest_rule.html b/doc/html/boost_regex/syntax/leftmost_longest_rule.html index aa5a57b9..27d5a838 100644 --- a/doc/html/boost_regex/syntax/leftmost_longest_rule.html +++ b/doc/html/boost_regex/syntax/leftmost_longest_rule.html @@ -1,13 +1,15 @@ -The Leftmost Longest Rule + The Leftmost + Longest Rule - + - - - + + + @@ -24,9 +26,9 @@
    + The Leftmost + Longest Rule

    Often there is more than one way of matching a regular expression at a particular location, for POSIX basic and extended regular expressions, the "best" @@ -65,7 +67,10 @@

    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/syntax/perl_syntax.html b/doc/html/boost_regex/syntax/perl_syntax.html index 0750577a..dc98edba 100644 --- a/doc/html/boost_regex/syntax/perl_syntax.html +++ b/doc/html/boost_regex/syntax/perl_syntax.html @@ -1,13 +1,15 @@ -Perl Regular Expression Syntax + Perl Regular Expression + Syntax - + - - - + + + @@ -24,18 +26,18 @@
    -

    - + Perl Regular Expression + Syntax

    +

    + Synopsis -

    +

    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 + or you can pass the flag perl + to the basic_regex constructor, for example: 

    @@ -45,85 +47,85 @@
 // e2 a case insensitive Perl regular expression:
 boost::regex e2(my_expression, boost::regex::perl|boost::regex::icase);
    -

    - +

    + Perl Regular Expression Syntax -

    +

    In Perl regular expressions, all characters match themselves except for the following special characters: 

    .[{()\*+?|^$
    -
    - +

    + Wildcard -

    +

    The single character '.' when used outside of a character set will match any single character except:

    -
    - +

    + Anchors -

    +

    A '^' character shall match the start of a line.

    A '$' character shall match the end of a line.

    -
    - +

    + Marked sub-expressions -

    +

    - A section beginning ( and ending - ) acts as a marked sub-expression. + A section beginning ( and ending + ) acts as a marked sub-expression. Whatever matched the sub-expression is split out in a separate field by the matching algorithms. Marked sub-expressions can also repeated, or referred to by a back-reference.

    -
    - +

    + Non-marking grouping -

    +

    A marked sub-expression is useful to lexically group part of a regular expression, but has the side-effect of spitting out an extra field in the result. As an alternative you can lexically group part of a regular expression, without - generating a marked sub-expression by using (?: - and ) , for example (?:ab)+ - will repeat ab without splitting + generating a marked sub-expression by using (?: + and ) , for example (?:ab)+ + will repeat ab without splitting out any separate sub-expressions.

    -
    - +

    + Repeats -

    +

    Any atom (a single character, a marked sub-expression, or a character class) - can be repeated with the *, - +, ?, - and {} operators. + can be repeated with the *, + +, ?, + and {} operators.

    - The * operator will match the - preceding atom zero or more times, for example the expression a*b + The * operator will match the + preceding atom zero or more times, for example the expression a*b will match any of the following: 

    @@ -132,8 +134,8 @@
 aaaaaaaab

    - The + operator will match the - preceding atom one or more times, for example the expression a+b + The + operator will match the + preceding atom one or more times, for example the expression a+b will match any of the following: 

    @@ -147,7 +149,7 @@
 b

    - The ? operator will match the + The ? operator will match the preceding atom zero or one times, for example the expression ca?b will match any of the following:

    @@ -165,15 +167,15 @@ An atom can also be repeated with a bounded repeat:

    - a{n} Matches + a{n} Matches 'a' repeated exactly n times.

    - a{n,} Matches + a{n,} Matches 'a' repeated n or more times.

    - a{n, m} Matches 'a' repeated between n and m times + a{n, m} Matches 'a' repeated between n and m times inclusive.

    @@ -202,44 +204,44 @@ a(*)

    - Will raise an error, as there is nothing for the * + Will raise an error, as there is nothing for the * operator to be applied to.

    -
    - +

    + Non greedy repeats -

    +

    The normal repeat operators are "greedy", that is to say they will consume as much input as possible. There are non-greedy versions available that will consume as little input as possible while still producing a match.

    - *? Matches the previous atom + *? Matches the previous atom zero or more times, while consuming as little input as possible.

    - +? Matches the previous atom + +? Matches the previous atom one or more times, while consuming as little input as possible.

    - ?? Matches the previous atom + ?? Matches the previous atom zero or one times, while consuming as little input as possible.

    - {n,}? Matches the previous atom n or more times, + {n,}? Matches the previous atom n or more times, while consuming as little input as possible.

    - {n,m}? + {n,m}? Matches the previous atom between n and m times, while consuming as little input as possible.

    -
    - +

    + Back references -

    +

    An escape character followed by a digit n, where n is in the range 1-9, matches the same string that was matched by sub-expression @@ -258,154 +260,156 @@ 

     aaabba
    -
    - +

    + Alternation -

    +

    - The | operator will match either - of its arguments, so for example: abc|def will + The | operator will match either + of its arguments, so for example: abc|def will match either "abc" or "def".

    - Parenthesis can be used to group alternations, for example: ab(d|ef) + Parenthesis can be used to group alternations, for example: ab(d|ef) will match either of "abd" or "abef".

    Empty alternatives are not allowed (these are almost always a mistake), but - if you really want an empty alternative use (?:) + if you really want an empty alternative use (?:) as a placeholder, for example:

    - |abc + |abc is not a valid expression, but

    - (?:)|abc + (?:)|abc is and is equivalent, also the expression:

    - (?:abc)?? has exactly the same effect. + (?:abc)?? has exactly the same effect.

    -
    - +

    + Character sets -

    +

    - A character set is a bracket-expression starting with [ - and ending with ], it defines + A character set is a bracket-expression starting with [ + and ending with ], it defines a set of characters, and matches any single character that is a member of that set.

    A bracket expression may contain any combination of the following:

    -
    - +
    + Single characters -
    +

    - For example [abc], will match any of the characters 'a', 'b', + For example [abc], will match any of the characters 'a', 'b', or 'c'.

    -
    - +
    + Character ranges -
    +

    - For example [a-c] + For example [a-c] 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.

    -
    - +
    + Negation -
    +

    If the bracket-expression begins with the ^ character, then it matches the - complement of the characters it contains, for example [^a-c] matches any character that is not in the - range a-c. + complement of the characters it contains, for example [^a-c] matches any character that is not in the + range a-c.

    -
    - +
    + Character classes -
    +

    - An expression of the form [[:name:]] - matches the named character class "name", for example [[:lower:]] matches any lower case character. See - character class names. + An expression of the form [[:name:]] + matches the named character class "name", for example [[:lower:]] matches any lower case character. See + character class names.

    -
    - +
    + Collating Elements -
    +

    - An expression of the form [[.col.] matches + An expression of the form [[.col.] matches the collating element col. A collating element is any single character, or any sequence of characters that collates as a single unit. Collating elements may also be used as the end point of a range, for - example: [[.ae.]-c] + example: [[.ae.]-c] matches the character sequence "ae", plus any single character in the range "ae"-c, assuming that "ae" is treated as 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: 

     [[.NUL.]]

    - matches a \0 + matches a \0 character.

    -
    - +
    + Equivalence classes -
    +

    - An expression of the form [[=col=]], + 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 + locale-specific tailorings; so for example [[=a=]] matches any of the characters: a, À, Á, Â, Ã, Ä, Å, A, à, á, â, ã, ä and å. Unfortunately implementation of this is reliant on the platform's collation and localisation support; this feature can not be relied upon to work portably across all platforms, or even all locales on one platform.

    -
    - +
    + Escaped Characters -
    +

    All the escape sequences that match a single character, or a single character - class are permitted within a character class definition. For example [\[\]] would match either of [ or ] - while [\W\d] + class are permitted within a character class definition. For example [\[\]] would match either of [ or ] + while [\W\d] would match any character that is either a "digit", or is not a "word" character.

    -
    - +
    + Combinations -
    +

    All of the above can be combined in one character set declaration, for example: - [[:digit:]a-c[.NUL.]]. + [[:digit:]a-c[.NUL.]].

    -
    - +

    + Escapes -

    +

    Any special character preceded by an escape shall match itself.

    @@ -433,97 +437,97 @@ @@ -531,7 +535,7 @@

    - \a + \a

    - \a + \a

    - \e + \e

    - 0x1B + 0x1B

    - \f + \f

    - \f + \f

    - \n + \n

    - \n + \n

    - \r + \r

    - \r + \r

    - \t + \t

    - \t + \t

    - \v - + \v +

    - \v + \v

    - \b + \b

    - \b + \b (but only inside a character class declaration).

    - \cX + \cX

    		@@ -544,7 +548,7 @@

    - \xdd + \xdd

    		@@ -557,7 +561,7 @@

    - \x{dddd} + \x{dddd}

    		@@ -570,7 +574,7 @@

    - \0ddd + \0ddd

    		@@ -583,23 +587,23 @@

    - \N{name} + \N{name}

    - Matches the single character which has the symbolic - name name. For example \N{newline} matches the single character \n. + Matches the single character which has the symbolic + name name. For example \N{newline} matches the single character \n.

    -
    - +
    + "Single character" character classes: -
    +

    Any escaped character x, if x is the name of a character class shall match any character that is a member @@ -630,133 +634,134 @@

    - \d + \d

    - [[:digit:]] + [[:digit:]]

    - \l + \l

    - [[:lower:]] + [[:lower:]]

    - \s + \s

    - [[:space:]] + [[:space:]]

    - \u + \u

    - [[:upper:]] + [[:upper:]]

    - \w + \w

    - [[:word:]] + [[:word:]]

    - \D + \D

    - [^[:digit:]] + [^[:digit:]]

    - \L + \L

    - [^[:lower:]] + [^[:lower:]]

    - \S + \S

    - [^[:space:]] + [^[:space:]]

    - \U + \U

    - [^[:upper:]] + [^[:upper:]]

    - \W + \W

    - [^[:word:]] + [^[:word:]]

    -
    - +
    + Character Properties -
    +

    The character property names in the following table are all equivalent to - the names used in character + the names used in character classes.

    @@ -786,7 +791,7 @@

    - \pX + \pX

    		@@ -796,14 +801,14 @@

    - [[:X:]] + [[:X:]]

    - \p{Name} + \p{Name}

    		@@ -813,14 +818,14 @@

    - [[:Name:]] + [[:Name:]]

    - \PX + \PX

    		@@ -830,14 +835,14 @@

    - [^[:X:]] + [^[:X:]]

    - \P{Name} + \P{Name}

    		@@ -847,42 +852,42 @@

    - [^[:Name:]] + [^[:Name:]]

    - For example \pd - matches any "digit" character, as does \p{digit}. + For example \pd + matches any "digit" character, as does \p{digit}.

    -
    - +
    + Word Boundaries -
    +

    The following escape sequences match the boundaries of words:

    - \< Matches the start of a + \< Matches the start of a word.

    - \> Matches the end of a word. + \> Matches the end of a word.

    - \b + \b Matches a word boundary (the start or end of a word).

    - \B + \B Matches only when not at a word boundary.

    -
    - +
    + Buffer boundaries -
    +

    The following match only at buffer boundaries: a "buffer" in this context is the whole of the input text that is being matched against (note @@ -902,106 +907,106 @@

    \Z Matches an optional sequence of newlines at the end of a buffer: equivalent - to the regular expression \n*\z + to the regular expression \n*\z

    -
    - +
    + Continuation Escape -
    +

    - The sequence \G + The sequence \G matches only at the end of the last match found, or at the start of the text being matched if no previous match was found. This escape useful if you're iterating over the matches contained within a text, and you want each subsequence match to start where the last one ended.

    -
    - +
    + Quoting escape -
    +

    - The escape sequence \Q + The escape sequence \Q begins a "quoted sequence": all the subsequent characters are treated as literals, until either the end of the regular expression or \E is found. - For example the expression: \Q\*+\Ea+ would match either of: + For example the expression: \Q\*+\Ea+ would match either of: 

     \*+a
 \*+aaa
    -
    - +
    + Unicode escapes -
    +

    - \C + \C Matches a single code point: in Boost regex this has exactly the same effect - as a "." operator. \X Matches a combining character sequence: + as a "." operator. \X Matches a combining character sequence: that is any non-combining character followed by a sequence of zero or more combining characters.

    -
    - +
    + Any other escape -
    +

    Any other escape sequence matches the character that is escaped, for example \@ matches a literal '@'.

    -
    - +

    + Perl Extended Patterns -

    +

    Perl-specific extensions to the regular expression syntax all start with - (?. + (?.

    -
    - +
    + Comments -
    +

    - (?# ... - ) is treated as a comment, it's contents + (?# ... + ) is treated as a comment, it's contents are ignored.

    -
    - +
    + Modifiers -
    +

    - (?imsx-imsx ... ) alters + (?imsx-imsx ... ) alters which of the perl modifiers are in effect within the pattern, changes take effect from the point that the block is first seen and extend to any enclosing - ). Letters before a '-' turn + ). Letters before a '-' turn that perl modifier on, letters afterward, turn it off.

    - (?imsx-imsx:pattern) + (?imsx-imsx:pattern) applies the specified modifiers to pattern only.

    -
    - +
    + Non-marking groups -
    +

    - (?:pattern) lexically groups pattern, without generating + (?:pattern) lexically groups pattern, without generating an additional sub-expression.

    -
    - +
    + Lookahead -
    +

    - (?=pattern) consumes zero characters, only if pattern + (?=pattern) consumes zero characters, only if pattern matches.

    - (?!pattern) consumes zero characters, only if pattern + (?!pattern) consumes zero characters, only if pattern does not match.

    @@ -1016,45 +1021,45 @@

    could be used to validate the password.

    -
    - +
    + Lookbehind -
    +

    - (?<=pattern) consumes zero characters, only if pattern + (?<=pattern) consumes zero characters, only if pattern could be matched against the characters preceding the current position (pattern must be of fixed length).

    - (?<!pattern) consumes zero characters, only if pattern + (?<!pattern) consumes zero characters, only if pattern could not be matched against the characters preceding the current position (pattern must be of fixed length).

    -
    - +
    + Independent sub-expressions -
    +

    - (?>pattern) pattern is matched + (?>pattern) pattern is matched independently of the surrounding patterns, the expression will never backtrack into pattern. Independent sub-expressions are typically used to improve performance; only the best possible match for pattern will be considered, if this doesn't allow the expression as a whole to match then no match is found at all.

    -
    - +
    + Conditional Expressions -
    +

    - (?(condition)yes-pattern|no-pattern) attempts to match yes-pattern + (?(condition)yes-pattern|no-pattern) attempts to match yes-pattern if the condition is true, otherwise attempts to match no-pattern.

    - (?(condition)yes-pattern) + (?(condition)yes-pattern) attempts to match yes-pattern if the condition is true, otherwise fails.

    @@ -1063,31 +1068,31 @@ or the index of a marked sub-expression (the condition becomes true if the sub-expression has been matched).

    -
    - +

    + Operator precedence -

    +

    The order of precedence for of operators is as follows:

    1. - Collation-related bracket symbols [==] - [::] [..] + Collation-related bracket symbols [==] + [::] [..]
    2. - Escaped characters \ + Escaped characters \
    3. - Character set (bracket expression) [] + Character set (bracket expression) []
    4. - Grouping () + Grouping ()
    5. - Single-character-ERE duplication * - + ? {m,n} + Single-character-ERE duplication * + + ? {m,n}
    6. Concatenation @@ -1099,11 +1104,11 @@ Alternation |
    -

    - +

    + What gets matched -

    +

    If you view the regular expression as a directed (possibly cyclic) graph, then the best match found is the first match found by a depth-first-search @@ -1113,7 +1118,8 @@ Alternatively:

    - The best match found is the leftmost + The best match found is the leftmost match, with individual elements matched as follows;

    @@ -1137,7 +1143,7 @@ @@ -1217,16 +1223,16 @@ @@ -1234,7 +1240,7 @@

    - AtomA AtomB + AtomA AtomB

    		@@ -1150,8 +1156,8 @@

    - Expression1 | - Expression2 + Expression1 | + Expression2

    		@@ -1164,7 +1170,7 @@

    - S{N} + S{N}

    		@@ -1176,7 +1182,7 @@

    - S{N,M} + S{N,M}

    		@@ -1188,7 +1194,7 @@

    - S{N,M}? + S{N,M}?

    		@@ -1200,16 +1206,16 @@

    - S?, + S?, S*, - S+ + S+

    - The same as S{0,1}, - S{0,UINT_MAX}, - S{1,UINT_MAX} + The same as S{0,1}, + S{0,UINT_MAX}, + S{1,UINT_MAX} respectively.

    - S??, + S??, S*?, - S+? + S+?

    - The same as S{0,1}?, - S{0,UINT_MAX}?, - S{1,UINT_MAX}? + The same as S{0,1}?, + S{0,UINT_MAX}?, + S{1,UINT_MAX}? respectively.

    - (?>S) + (?>S)

    		@@ -1246,7 +1252,7 @@

    - (?=S), (?<=S) + (?=S), (?<=S)

    		@@ -1259,7 +1265,7 @@

    - (?!S), (?<!S) + (?!S), (?<!S)

    		@@ -1271,8 +1277,8 @@

    - (?(condition)yes-pattern - | no-pattern) + (?(condition)yes-pattern + | no-pattern)

    		@@ -1284,51 +1290,57 @@
    -

    - +

    + Variations -

    +

    - The options - normal, ECMAScript, - JavaScript and JScript are all synonyms for perl. + The options + normal, ECMAScript, + JavaScript and JScript are all synonyms for perl.

    -

    - +

    + Options -

    +

    - There are a variety - of flags that may be combined with the perl + 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 - the syntax, while the collate, - nosubs and icase options modify how the case and locale + the newline_alt option alters + the syntax, while the collate, + nosubs and icase options modify how the case and locale sensitivity are to be applied.

    -

    - +

    + Pattern Modifiers -

    +

    - The perl smix modifiers can - either be applied using a (?smix-smix) prefix to the regular expression, or with - one of the regex-compile - time flags no_mod_m, mod_x, mod_s, - and no_mod_s. + The perl smix modifiers can + either be applied using a (?smix-smix) prefix to the regular expression, or with + one of the regex-compile + time flags no_mod_m, mod_x, mod_s, + and no_mod_s.

    -

    - +

    + References -

    +

    Perl 5.8.

    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/boost_regex/unicode.html b/doc/html/boost_regex/unicode.html index a723e309..0c0fdc7f 100644 --- a/doc/html/boost_regex/unicode.html +++ b/doc/html/boost_regex/unicode.html @@ -1,13 +1,15 @@ -Unicode and Boost.Regex + Unicode and Boost.Regex - + - - + + @@ -24,54 +26,57 @@
    + Unicode and Boost.Regex

    There are two ways to use Boost.Regex with Unicode strings:

    -
    - +

    + Rely on wchar_t -

    +

    - If your platform's wchar_t type + If your platform's wchar_t type can hold Unicode strings, and your platform's C/C++ runtime correctly handles - wide character constants (when passed to std::iswspace - std::iswlower etc), then you can use boost::wregex + wide character constants (when passed to std::iswspace + std::iswlower etc), then you can use boost::wregex to process Unicode. However, there are several disadvantages to this approach:

    • - It's not portable: there's no guarantee on the width of wchar_t, + It's not portable: there's no guarantee on the width of wchar_t, or even whether the runtime treats wide characters as Unicode at all, most Windows compilers do so, but many Unix systems do not.
    • - There's no support for Unicode-specific character classes: [[:Nd:]], - [[:Po:]] etc. + There's no support for Unicode-specific character classes: [[:Nd:]], + [[:Po:]] etc.
    • You can only search strings that are encoded as sequences of wide characters, it is not possible to search UTF-8, or even UTF-16 on many platforms.
    -
    - +

    + Use a Unicode Aware Regular Expression Type. -

    +

    If you have the ICU library, then Boost.Regex can be configured to make use of it, and provide a distinct regular expression type (boost::u32regex), that supports both Unicode specific character properties, and the searching - of text that is encoded in either UTF-8, UTF-16, or UTF-32. See: ICU + of text that is encoded in either UTF-8, UTF-16, or UTF-32. See: ICU string class support.

    - +
    Copyright © 2007 John Maddock
    Copyright © 2007 John Maddock

    + 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) +

    diff --git a/doc/html/index.html b/doc/html/index.html index dbbf8618..cfe70342 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -3,9 +3,9 @@ Boost.Regex - + - + @@ -28,7 +28,7 @@

    Copyright © 2007 John Maddock

    -

    +

    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)

    @@ -202,8 +202,8 @@

    - - + +

    Last revised: October 06, 2007 at 17:41:11 GMT

    Last revised: November 07, 2007 at 02:57:53 GMT
    Next