Boost-Commit :

Date view	Thread view	Subject view	Author view

From: john_at_[hidden]
Date: 2007-08-02 13:06:34

Next message: jmcintyre_at_[hidden]: "[Boost-commit] svn:boost r38404 - sandbox/pinhole/boost/pinhole"
Previous message: asutton_at_[hidden]: "[Boost-commit] svn:boost r38402 - sandbox/SOC/2007/graphs/boost/graph"

Author: johnmaddock
Date: 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
New Revision: 38403
URL: http://svn.boost.org/trac/boost/changeset/38403

Log:
Removed files that were previously removed from cvs but got resurrected for some reason.
Removed:
   trunk/libs/regex/doc/bad_expression.html
   trunk/libs/regex/doc/basic_regex.html
   trunk/libs/regex/doc/captures.html
   trunk/libs/regex/doc/character_class_names.html
   trunk/libs/regex/doc/collating_names.html
   trunk/libs/regex/doc/concepts.html
   trunk/libs/regex/doc/configuration.html
   trunk/libs/regex/doc/contacts.html
   trunk/libs/regex/doc/error_type.html
   trunk/libs/regex/doc/examples.html
   trunk/libs/regex/doc/faq.html
   trunk/libs/regex/doc/format_boost_syntax.html
   trunk/libs/regex/doc/format_perl_syntax.html
   trunk/libs/regex/doc/format_sed_syntax.html
   trunk/libs/regex/doc/format_syntax.html
   trunk/libs/regex/doc/gcc-performance.html
   trunk/libs/regex/doc/headers.html
   trunk/libs/regex/doc/history.html
   trunk/libs/regex/doc/icu_strings.html
   trunk/libs/regex/doc/implementation.html
   trunk/libs/regex/doc/index.html
   trunk/libs/regex/doc/install.html
   trunk/libs/regex/doc/introduction.html
   trunk/libs/regex/doc/localisation.html
   trunk/libs/regex/doc/match_flag_type.html
   trunk/libs/regex/doc/match_results.html
   trunk/libs/regex/doc/mfc_strings.html
   trunk/libs/regex/doc/non_standard_strings.html
   trunk/libs/regex/doc/partial_matches.html
   trunk/libs/regex/doc/performance.html
   trunk/libs/regex/doc/posix_api.html
   trunk/libs/regex/doc/redistributables.html
   trunk/libs/regex/doc/reg_expression.html
   trunk/libs/regex/doc/regbase.html
   trunk/libs/regex/doc/regex.html
   trunk/libs/regex/doc/regex_format.html
   trunk/libs/regex/doc/regex_grep.html
   trunk/libs/regex/doc/regex_iterator.html
   trunk/libs/regex/doc/regex_match.html
   trunk/libs/regex/doc/regex_merge.html
   trunk/libs/regex/doc/regex_replace.html
   trunk/libs/regex/doc/regex_search.html
   trunk/libs/regex/doc/regex_split.html
   trunk/libs/regex/doc/regex_token_iterator.html
   trunk/libs/regex/doc/regex_traits.html
   trunk/libs/regex/doc/standards.html
   trunk/libs/regex/doc/sub_match.html
   trunk/libs/regex/doc/syntax.html
   trunk/libs/regex/doc/syntax_basic.html
   trunk/libs/regex/doc/syntax_extended.html
   trunk/libs/regex/doc/syntax_leftmost_longest.html
   trunk/libs/regex/doc/syntax_option_type.html
   trunk/libs/regex/doc/syntax_perl.html
   trunk/libs/regex/doc/thread_safety.html
   trunk/libs/regex/doc/uarrow.gif
   trunk/libs/regex/doc/unicode.html
   trunk/libs/regex/doc/vc71-performance.html

Deleted: trunk/libs/regex/doc/bad_expression.html
==============================================================================
--- trunk/libs/regex/doc/bad_expression.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,81 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: regex_error</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">class regex_error</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- <h3>Synopsis</h3>
- #include <boost/pattern_except.hpp>
- The class <code>regex_error</code> 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.  
- <pre>
-namespace boost{
-
-class regex_error : public std::runtime_error
-{
-public:
- explicit regex_error(const std::string& s, regex_constants::error_type err, std::ptrdiff_t pos);
- explicit regex_error(boost::regex_constants::error_type err);
- boost::regex_constants::error_type code()const;
- std::ptrdiff_t position()const;
-};
-
-typedef regex_error bad_pattern; // for backwards compatibility
-typedef regex_error bad_expression; // for backwards compatibility
-
-} // namespace boost
-</pre>
- <h3>Description</h3>
- <pre>
-regex_error(const std::string& s, regex_constants::error_type err, std::ptrdiff_t pos);
-regex_error(boost::regex_constants::error_type err);</pre>
- Effects: Constructs an object of class <code>regex_error</code>.
- <pre>
-boost::regex_constants::error_type code()const;</pre>
- Effects: returns the error code that represents parsing error that occurred.
- <pre>
-std::ptrdiff_t position()const; </pre>
- Effects: returns the location in the expression where parsing stopped.
- Footnotes: the choice of <code>std::runtime_error</code> as the base class for <code>
- regex_error</code> 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 <code>bad_pattern</code>
- and <code>bad_expression</code> for errors, these have been replaced by the
- single class <code>regex_error</code> to keep the library in synchronization
- with the standardization proposal.
- 
- <hr>
- Revised
- 
- 24 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/basic_regex.html
==============================================================================
--- trunk/libs/regex/doc/basic_regex.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,906 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: basic_regex</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">basic_regex</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- <h3>Synopsis</h3>
- <pre>
-#include <boost/regex.hpp>
-</pre>
- The template class basic_regex encapsulates regular expression parsing
- and compilation. The class takes two template parameters:
- charT: determines the character type, i.e. either char or
- wchar_t; see charT concept.
- traits: determines the behavior of the character type, for
- example which character class names are recognized. A default traits class is
- provided: regex_traits<charT>.  See
- also traits concept.
- 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, you won't need to use anything other than these:
- <pre>
-namespace boost{
-template <class charT, class traits = regex_traits<charT> >
-class basic_regex;
-typedef basic_regex<char> regex;
-typedef basic_regex<wchar_t> wregex;
-}
-</pre>
- 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.
- <pre>
-namespace boost{
-
-template <class charT, class traits = regex_traits<charT> >
-class basic_regex {
- public:
- // types:
- typedef charT value_type;
- typedef implementation-specific const_iterator;
- typedef const_iterator iterator;
- typedef charT& reference;
- 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 typename traits::locale_type locale_type;
-
- // constants:
- // main option selection:
- static const regex_constants::syntax_option_type normal = regex_constants::normal;
- static const regex_constants::syntax_option_type ECMAScript = normal;
- static const regex_constants::syntax_option_type JavaScript = normal;
- static const regex_constants::syntax_option_type JScript = normal;
- static const regex_constants::syntax_option_type basic = regex_constants::basic;
- static const regex_constants::syntax_option_type extended = regex_constants::extended;
- static const regex_constants::syntax_option_type awk = regex_constants::awk;
- static const regex_constants::syntax_option_type grep = regex_constants::grep;
- static const regex_constants::syntax_option_type egrep = regex_constants::egrep;
- static const regex_constants::syntax_option_type sed = basic = regex_constants::sed;
- static const regex_constants::syntax_option_type perl = regex_constants::perl;
- 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 = regex_constants::no_mod_m;
- static const regex_constants::syntax_option_type no_mod_s = regex_constants::no_mod_s;
- static const regex_constants::syntax_option_type mod_s = regex_constants::mod_s;
- 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 = regex_constants::bk_plus_qm;
- static const regex_constants::syntax_option_type bk_vbar = regex_constants::bk_vbar
- static const regex_constants::syntax_option_type no_char_classes = regex_constants::no_char_classes
- static const regex_constants::syntax_option_type no_intervals = regex_constants::no_intervals
- // common modifiers:
- static const regex_constants::syntax_option_type nosubs = regex_constants::nosubs;
- static const regex_constants::syntax_option_type optimize = regex_constants::optimize;
- static const regex_constants::syntax_option_type collate = regex_constants::collate;
- static const regex_constants::syntax_option_type newline_alt = regex_constants::newline_alt;
- static const regex_constants::syntax_option_type no_except = regex_constants::newline_alt;
-
- // construct/copy/destroy:
- explicit basic_regex ();
- explicit basic_regex(const charT* p, flag_type f = regex_constants::normal);
- basic_regex(const charT* p1, const charT* p2, flag_type f = regex_constants::normal);
- basic_regex(const charT* p, size_type len, flag_type f);
- basic_regex(const basic_regex&);
- template <class ST, class SA>
- explicit basic_regex(const basic_string<charT, ST, SA>& p, flag_type f = regex_constants::normal);
- template <class InputIterator>
- basic_regex(InputIterator first, InputIterator last, flag_type f = regex_constants::normal);
-
- ~basic_regex();
- basic_regex& operator=(const basic_regex&);
- basic_regex& operator= (const charT* ptr);
- template <class ST, class SA>
- basic_regex& operator= (const basic_string<charT, ST, SA>& p);
- // iterators:
- const_iterator begin() const;
- const_iterator end() const;
- // capacity:
- size_type size() const;
- size_type max_size() const;
- bool empty() const;
- unsigned mark_count()const;
- //
- // modifiers:
- basic_regex& assign(const basic_regex& that);
- basic_regex& assign(const charT* ptr, flag_type f = regex_constants::normal);
- basic_regex& assign(const charT* ptr, unsigned int len, flag_type f);
- template <class string_traits, class A>
- basic_regex& assign(const basic_string<charT, string_traits, A>& s,
- flag_type f = regex_constants::normal);
- template <class InputIterator>
- basic_regex& assign(InputIterator first, InputIterator last,
- flag_type f = regex_constants::normal);
-
- // const operations:
- flag_type flags() const;
- int status()const;
- basic_string<charT> str() const;
- int compare(basic_regex&) const;
- // locale:
- locale_type imbue(locale_type loc);
- locale_type getloc() const;
- // swap
- void swap(basic_regex&) throw();
-};
-
-template <class charT, class traits>
-bool operator == (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-template <class charT, class traits>
-bool operator != (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-template <class charT, class traits>
-bool operator < (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-template <class charT, class traits>
-bool operator <= (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-template <class charT, class traits>
-bool operator >= (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-template <class charT, class traits>
-bool operator > (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-
-template <class charT, class io_traits, class re_traits>
-basic_ostream<charT, io_traits>&
- operator << (basic_ostream<charT, io_traits>& os,
- const basic_regex<charT, re_traits>& e);
-
-template <class charT, class traits>
-void swap(basic_regex<charT, traits>& e1,
- basic_regex<charT, traits>& e2);
-
-typedef basic_regex<char> regex;
-typedef basic_regex<wchar_t> wregex;
-
-} // namespace boost
-</pre>
- <h3>Description</h3>
- Class basic_regex has the following public member functions:
- <h4>basic_regex constants</h4>
- <pre>
-// main option selection:
-static const regex_constants::syntax_option_type normal = regex_constants::normal;
-static const regex_constants::syntax_option_type ECMAScript = normal;
-static const regex_constants::syntax_option_type JavaScript = normal;
-static const regex_constants::syntax_option_type JScript = normal;
-static const regex_constants::syntax_option_type basic = regex_constants::basic;
-static const regex_constants::syntax_option_type extended = regex_constants::extended;
-static const regex_constants::syntax_option_type awk = regex_constants::awk;
-static const regex_constants::syntax_option_type grep = regex_constants::grep;
-static const regex_constants::syntax_option_type egrep = regex_constants::egrep;
-static const regex_constants::syntax_option_type sed = regex_constants::sed;
-static const regex_constants::syntax_option_type perl = regex_constants::perl;
-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 = regex_constants::no_mod_m;
-static const regex_constants::syntax_option_type no_mod_s = regex_constants::no_mod_s;
-static const regex_constants::syntax_option_type mod_s = regex_constants::mod_s;
-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 = regex_constants::bk_plus_qm;
-static const regex_constants::syntax_option_type bk_vbar = regex_constants::bk_vbar
-static const regex_constants::syntax_option_type no_char_classes = regex_constants::no_char_classes
-static const regex_constants::syntax_option_type no_intervals = regex_constants::no_intervals
-// common modifiers:
-static const regex_constants::syntax_option_type nosubs = regex_constants::nosubs;
-static const regex_constants::syntax_option_type optimize = regex_constants::optimize;
-static const regex_constants::syntax_option_type collate = regex_constants::collate;
-static const regex_constants::syntax_option_type newline_alt = regex_constants::newline_alt;
-</pre>
- The static constant members are provided as synonyms for the constants declared
- in namespace <code>boost::regex_constants</code>; for each constant of type <code><A href="syntax_option_type.html">
- syntax_option_type</A></code> declared in namespace <code>boost::regex_constants</code>
- then a constant with the same name, type and value is declared within the scope
- of <code>basic_regex</code>.
- <h4>basic_regex constructors</h4>
- <pre><A name=c1> basic_regex();
-</pre>
- Effects: Constructs an object of class <code>basic_regex</code>. The
- postconditions of this function are indicated in the table:
- <div align="center">
- <center>
- <table id="Table2" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- empty()
- </td>
- <td valign="top" width="50%">
- true
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- size()
- </td>
- <td valign="top" width="50%">
- 0
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- str()
- </td>
- <td valign="top" width="50%">
- basic_string<charT>()
- </td>
- </tr>
- </tbody>
- </table>
- </center>
- </div>
- <pre><A name=c2> basic_regex(const charT* p, flag_type f = regex_constants::normal);
-
-</pre>
- Requires: p shall not be a null pointer.
- Throws: <code>bad_expression</code> if p is not a valid regular
- expression, unless the flag no_except is set in f.
- Effects: Constructs an object of class <code>basic_regex</code>; 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 flags specified
- in f. The postconditions of this function are indicated in the table:
- <div align="center">
- <center>
- <table id="Table3" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- empty()
- </td>
- <td valign="top" width="50%">
- false
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- size()
- </td>
- <td valign="top" width="50%">
- char_traits<charT>::length(p)
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- str()
- </td>
- <td valign="top" width="50%">
- basic_string<charT>(p)
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- flags()
- </td>
- <td valign="top" width="50%">
- f
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- mark_count()
- </td>
- <td valign="top" width="50%">
- The number of marked sub-expressions within the expression.
- </td>
- </tr>
- </tbody>
- </table>
- </center>
- </div>
- <pre>
-
-</pre>
- <PRE><A name=c3></A>basic_regex(const charT* p1, const charT* p2, flag_type f = regex_constants::normal);</PRE>
- Requires: p1 and p2 are not null pointers, <code>p1 < p2</code>.
- Throws: <code>bad_expression</code> if [p1,p2) is not a valid regular
- expression, unless the flag no_except is set in f.
- Effects: Constructs an object of class <code>basic_regex</code>; 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 specified in f.
- The postconditions of this function are indicated in the table:
- <div align="center">
- <center>
- <table id="Table4" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- empty()
- </td>
- <td valign="top" width="50%">
- false
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- size()
- </td>
- <td valign="top" width="50%">
- std::distance(p1,p2)
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- str()
- </td>
- <td valign="top" width="50%">
- basic_string<charT>(p1,p2)
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- flags()
- </td>
- <td valign="top" width="50%">
- f
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- mark_count()
- </td>
- <td valign="top" width="50%">
- The number of marked sub-expressions within the expression.
- </td>
- </tr>
- </tbody>
- </table>
- </center>
- </div>
- <pre>
-
-</pre>
- <pre><A name=c4></A>basic_regex(const charT* p, size_type len, flag_type f);
-</pre>
- Requires: p shall not be a null pointer, <code>len < max_size()</code>.
- Throws: <code>bad_expression</code> if p is not a valid regular
- expression, unless the flag no_except is set in f.
- Effects: Constructs an object of class <code>basic_regex</code>; 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.
- The postconditions of this function are indicated in the table:
- <div align="center">
- <center>
- <table id="Table5" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- empty()
- </td>
- <td valign="top" width="50%">
- false
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- size()
- </td>
- <td valign="top" width="50%">
- len
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- str()
- </td>
- <td valign="top" width="50%">
- basic_string<charT>(p, len)
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- flags()
- </td>
- <td valign="top" width="50%">
- f
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- mark_count()
- </td>
- <td valign="top" width="50%">
- The number of marked sub-expressions within the expression.
- </td>
- </tr>
- </tbody>
- </table>
- </center>
- </div>
- <pre><A name=c5></A> basic_regex(const basic_regex& e);
-</pre>
- Effects: Constructs an object of class <code>basic_regex</code> as a
- copy of the object e. The postconditions of this function are indicated
- in the table:
- <div align="center">
- <center>
- <table id="Table6" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- empty()
- </td>
- <td valign="top" width="50%">
- e.empty()
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- size()
- </td>
- <td valign="top" width="50%">
- e.size()
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- str()
- </td>
- <td valign="top" width="50%">
- e.str()
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- flags()
- </td>
- <td valign="top" width="50%">
- e.flags()
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- mark_count()
- </td>
- <td valign="top" width="50%">
- e.mark_count()
- </td>
- </tr>
- </tbody>
- </table>
- </center>
- </div>
- <pre> 
-template <class ST, class SA>
-<A name=c6></A>basic_regex(const basic_string<charT, ST, SA>& s, flag_type f = regex_constants::normal);
-</pre>
- Throws: <code>bad_expression</code> if s is not a valid regular
- expression, unless the flag no_except is set in f.
- Effects: Constructs an object of class <code>basic_regex</code>; the
- object's internal finite state machine is constructed from the regular
- expression contained in the string s, and interpreted according to the <a href="syntax_option_type.html">
- option flags</a> specified in f. The postconditions of this function
- are indicated in the table:
- <div align="center">
- <center>
- <table id="Table7" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- empty()
- </td>
- <td valign="top" width="50%">
- false
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- size()
- </td>
- <td valign="top" width="50%">
- s.size()
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- str()
- </td>
- <td valign="top" width="50%">
- s
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- flags()
- </td>
- <td valign="top" width="50%">
- f
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- mark_count()
- </td>
- <td valign="top" width="50%">
- The number of marked sub-expressions within the expression.
- </td>
- </tr>
- </tbody>
- </table>
- </center>
- </div>
- <pre> 
-template <class ForwardIterator>
-<A name=c7></A>basic_regex(ForwardIterator first, ForwardIterator last, flag_type f = regex_constants::normal);
-</pre>
- Throws: <code>bad_expression</code> 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 <code>basic_regex</code>; 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 flags
- specified in f. The postconditions of this function are indicated in the
- table:
- <div align="center">
- <center>
- <table id="Table8" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- empty()
- </td>
- <td valign="top" width="50%">
- false
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- size()
- </td>
- <td valign="top" width="50%">
- distance(first,last)
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- str()
- </td>
- <td valign="top" width="50%">
- basic_string<charT>(first,last)
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- flags()
- </td>
- <td valign="top" width="50%">
- f
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- mark_count()
- </td>
- <td valign="top" width="50%">
- The number of marked sub-expressions within the expression.
- </td>
- </tr>
- </tbody>
- </table>
- </center>
- </div>
- <pre><A name=o1></A>
-basic_regex& operator=(const basic_regex& e);
-</pre>
- Effects: Returns the result of <code>assign(e.str(), e.flags())</code>.
- <pre><A name=o2></A>basic_regex& operator=(const charT* ptr);
-</pre>
- Requires: p shall not be a null pointer.
- Effects: Returns the result of <code>assign(ptr)</code>.
- <pre><A name=o3></A>
-template <class ST, class SA>
-basic_regex& operator=(const basic_string<charT, ST, SA>& p);
-</pre>
- Effects: Returns the result of <code>assign(p)</code>.
- <h4>basic_regex iterators</h4>
- <pre><A name=m1>
-const_iterator begin() const;
-</pre>
- Effects: Returns a starting iterator to a sequence of characters
- representing the regular expression.
- <pre><A name=m2>
-const_iterator end() const;
-</pre>
- Effects: Returns termination iterator to a sequence of characters
- representing the regular expression.
- <h4>basic_regex capacity</h4>
- <pre><A name=m3>
-size_type size() const;
-</pre>
- Effects: Returns the length of the sequence of characters representing
- the regular expression.
- <pre><A name=m4>
-size_type max_size() const;
-</pre>
- Effects: Returns the maximum length of the sequence of characters
- representing the regular expression.
- <pre><A name=m5></A>
-bool empty() const;
-</pre>
- Effects: Returns true if the object does not contain a valid
- regular expression, otherwise false.
- <pre><A name=m6></A>unsigned mark_count() const;
-</pre>
- Effects: Returns the number of marked sub-expressions within the regular
- expresion.
- <h4>basic_regex assign</h4>
- <pre><A name=a1>
-basic_regex& assign(const basic_regex& that);
-</pre>
- Effects: Returns <code>assign(that.str(), that.flags())</code>.
- <pre><A name=a2></A>
-basic_regex& assign(const charT* ptr, flag_type f = regex_constants::normal);
-</pre>
- Effects: Returns <code>assign(string_type(ptr), f)</code>.
- <PRE><A name=a3></A><A name=a3></A>basic_regex& assign(const charT* ptr, unsigned int len, flag_type f);</PRE>
- Effects: Returns <CODE>assign(string_type(ptr, len), f)</CODE>.
- <PRE><A name=a4></A>template <class string_traits, class A>
-<A name=a6></A>basic_regex& assign(const basic_string<charT, string_traits, A>& s,
- flag_type f = regex_constants::normal);
-</PRE>
- Throws: <code>bad_expression</code> if s is not a valid regular
- expression, unless the flag no_except is set in f.
- Returns: <code>*this</code>.
- Effects: Assigns the regular expression contained in the string s,
- interpreted according the option flags specified
- in f. The postconditions of this function are indicated in the table:
- <div align="center">
- <center>
- <table id="Table9" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- empty()
- </td>
- <td valign="top" width="50%">
- false
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- size()
- </td>
- <td valign="top" width="50%">
- s.size()
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- str()
- </td>
- <td valign="top" width="50%">
- s
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- flags()
- </td>
- <td valign="top" width="50%">
- f
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- mark_count()
- </td>
- <td valign="top" width="50%">
- The number of marked sub-expressions within the expression.
- </td>
- </tr>
- </tbody>
- </table>
- </center>
- </div>
- <pre>
-
-</pre>
- <pre><A name=a5></A>template <class InputIterator>
-basic_regex& assign(InputIterator first, InputIterator last,
- flag_type f = regex_constants::normal);
-</pre>
- Requires: The type InputIterator corresponds to the Input Iterator
- requirements (24.1.1).
- Effects: Returns <code>assign(string_type(first, last), f)</code>.
- <h4>basic_regex constant operations</h4>
- <pre><A name=m7></A><A name=m8></A>flag_type flags() const;
-</pre>
- Effects: Returns a copy of the regular expression syntax flags that were
- passed to the object's constructor, or the last call to <code>assign.</code>
- <CODE>
- <PRE><A name=m7></A><A name=m8></A><A name=m8b></A>int status() const;</PRE>
- </CODE>
- 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.
- <pre><A name=m9></A>basic_string<charT> str() const;
-</pre>
- Effects: Returns a copy of the character sequence passed to the object's
- constructor, or the last call to <code>assign.</code>
- <pre><A name=m10></A>int compare(basic_regex& e)const;
-</pre>
- Effects: If <code>flags() == e.flags()</code> then returns <code>str().compare(e.str())</code>,
- otherwise returns <code>flags() - e.flags()</code>.
- <h4>basic_regex locale</h4>
- <pre><A name=m11></A>locale_type imbue(locale_type l);
-</pre>
- Effects: Returns the result of <code>traits_inst.imbue(l)</code> where <code>
- traits_inst</code> is a (default initialized) instance of the template
- parameter <code>traits</code> stored within the object. Calls to imbue
- invalidate any currently contained regular expression.
- Postcondition: <code>empty() == true</code>.
- <pre><A name=m12></A>
-locale_type getloc() const;
-</pre>
- Effects: Returns the result of <code>traits_inst.getloc()</code> where <code>
- traits_inst</code> is a (default initialized) instance of the template
- parameter <code>traits</code> stored within the object.
- <h4>basic_regex swap</h4>
- <pre><A name=m13>
-void swap(basic_regex& e) throw();
-</pre>
- Effects: Swaps the contents of the two regular expressions.
- Postcondition: <code>*this</code> contains the characters that were in e,
- e contains the regular expression that was in <code>*this</code>.
- Complexity: constant time.
- <h4>basic_regex non-member functions</h4>
- <h5>basic_regex non-member comparison operators </h5>
- Comparisons between basic_regex objects are provided on an experimental basis:
- please note that these are likely to be removed from the standard library
- proposal, so use with care if you are writing portable code.
- <pre><A name=o4></A>
-template <class charT, class traits>
-bool operator == (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-</pre>
- Effects: Returns <code>lhs.compare(rhs) == 0</code>.
- <pre><A name=o5></A>
-template <class charT, class traits>
-bool operator != (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-</pre>
- Effects: Returns <code>lhs.compare(rhs) != 0</code>.
- <pre><A name=o7></A>
-template <class charT, class traits>
-bool operator < (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-</pre>
- Effects: Returns <code>lhs.compare(rhs) < 0</code>.
- <pre><A name=o8></A>
-template <class charT, class traits>
-bool operator <= (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-</pre>
- Effects: Returns <code>lhs.compare(rhs) <= 0</code>.
- <pre><A name=o9></A>
-template <class charT, class traits>
-bool operator >= (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-</pre>
- Effects: Returns <code>lhs.compare(rhs) >= 0</code>.
- <pre><A name=o10></A>
-template <class charT, class traits>
-bool operator > (const basic_regex<charT, traits>& lhs,
- const basic_regex<charT, traits>& rhs);
-</pre>
- Effects: Returns <code>lhs.compare(rhs) > 0</code>.
- <h5>basic_regex inserter.</h5>
- The basic_regex stream inserter is provided on an experimental basis, and
- outputs the textual representation of the expression to the stream:
- <pre><A name=o11></A>
-template <class charT, class io_traits, class re_traits>
-basic_ostream<charT, io_traits>&
- operator << (basic_ostream<charT, io_traits>& os
- const basic_regex<charT, re_traits>& e);
-</pre>
- Effects: Returns (os << e.str()).
- <h5>basic_regex non-member swap</h5>
- <pre><A name=o12></A>
-template <class charT, class traits>
-void swap(basic_regex<charT, traits>& lhs,
- basic_regex<charT, traits>& rhs);
-</pre>
- Effects: calls <code>lhs.swap(rhs)</code>.
- <hr>
- Revised 7 Aug
- 
- 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/captures.html
==============================================================================
--- trunk/libs/regex/doc/captures.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,254 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Understanding Captures</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Understanding Captures</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- Captures are the iterator ranges that are "captured" by marked sub-expressions
- as a regular expression gets matched.  Each marked sub-expression can
- result in more than one capture, if it is matched more than once.  This
- document explains how captures and marked sub-expressions in Boost.Regex are
- represented and accessed.
- <H2>Marked sub-expressions</H2>
- 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:
- <PRE>(\w+)\W+(\w+)</PRE>
- 
- 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--", then we obtain:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- 
- <TABLE id="Table2" cellSpacing="1" cellPadding="1" width="300" border="0">
- <TR>
- <TD>
- $`
- </TD>
- <TD>"@"</TD>
- </TR>
- <TR>
- <TD>$&</TD>
- <TD>"abc def"</TD>
- </TR>
- <TR>
- <TD>$1</TD>
- <TD>"abc"</TD>
- </TR>
- <TR>
- <TD>$2</TD>
- <TD>"def"</TD>
- </TR>
- <TR>
- <TD>$'</TD>
- <TD>"--"</TD>
- </TR>
- </TABLE>
- 
- </BLOCKQUOTE>
- In Boost.regex all these are accessible via the match_results
- class that gets filled in when calling one of the matching algorithms (regex_search,
- regex_match, or regex_iterator). 
- So given:
- <PRE>boost::match_results<IteratorType> m;</PRE>
- The Perl and Boost.Regex equivalents are as follows:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- 
- <TABLE id="Table3" cellSpacing="1" cellPadding="1" width="300" border="0">
- <TR>
- <TD>Perl</TD>
- <TD>Boost.Regex</TD>
- </TR>
- <TR>
- <TD>$`</TD>
- <TD>m.prefix()</TD>
- </TR>
- <TR>
- <TD>$&</TD>
- <TD>m[0]</TD>
- </TR>
- <TR>
- <TD>$n</TD>
- <TD>m[n]</TD>
- </TR>
- <TR>
- <TD>$'</TD>
- <TD>m.suffix()</TD>
- </TR>
- </TABLE>
- 
- </BLOCKQUOTE>
- 
- In Boost.Regex each sub-expression match is represented by a <A href="sub_match.html">
- sub_match</A> object, this is basically just a pair of iterators denoting
- the start and end possition 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 <A href="sub_match.html#m3">
- convertible to a basic_string</A>, they can be <A href="sub_match.html#o21">compared
- to a string</A>, added to a string, or <A href="sub_match.html#oi">
- streamed out to an output stream</A>.
- <H2>Unmatched Sub-Expressions</H2>
- 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:
- (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 <A href="sub_match.html#m1">
- sub_match::matched</A> data member.
- <H2>Repeated Captures</H2>
- 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 if
- <PRE>(?:(\w+)\W+)+</PRE>
- is matched against
- <PRE>one fine day</PRE>
- Then $1 will contain the string "day", and all the previous captures will have
- been forgotten.
- However, Boost.Regex has an experimental feature that allows all the capture
- information to be retained - this is accessed either via the <A href="match_results.html#m17">
- match_results::captures</A> 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:
- <PRE>#include <boost/regex.hpp>
-#include <iostream>
-
-
-void print_captures(const std::string& regx, const std::string& text)
-{
- boost::regex e(regx);
- boost::smatch what;
- std::cout << "Expression: \"" << regx << "\"\n";
- std::cout << "Text: \"" << text << "\"\n";
- if(boost::regex_match(text, what, e, boost::match_extra))
- {
- unsigned i, j;
- std::cout << "** Match found **\n Sub-Expressions:\n";
- for(i = 0; i < what.size(); ++i)
- std::cout << " $" << i << " = \"" << what[i] << "\"\n";
- std::cout << " Captures:\n";
- for(i = 0; i < what.size(); ++i)
- {
- std::cout << " $" << i << " = {";
- for(j = 0; j < what.captures(i).size(); ++j)
- {
- if(j)
- std::cout << ", ";
- else
- std::cout << " ";
- std::cout << "\"" << what.captures(i)[j] << "\"";
- }
- std::cout << " }\n";
- }
- }
- else
- {
- std::cout << "** No Match found **\n";
- }
-}
-
-int main(int , char* [])
-{
- print_captures("(([[:lower:]]+)|([[:upper:]]+))+", "aBBcccDDDDDeeeeeeee");
- print_captures("(.*)bar|(.*)bah", "abcbar");
- print_captures("(.*)bar|(.*)bah", "abcbah");
- print_captures("^(?:(\\w+)|(?>\\W+))*$", "now is the time for all good men to come to the aid of the party");
- return 0;
-}</PRE>
- Which produces the following output:
- <PRE>Expression: "(([[:lower:]]+)|([[:upper:]]+))+"
-Text: "aBBcccDDDDDeeeeeeee"
-** Match found **
- Sub-Expressions:
- $0 = "aBBcccDDDDDeeeeeeee"
- $1 = "eeeeeeee"
- $2 = "eeeeeeee"
- $3 = "DDDDD"
- Captures:
- $0 = { "aBBcccDDDDDeeeeeeee" }
- $1 = { "a", "BB", "ccc", "DDDDD", "eeeeeeee" }
- $2 = { "a", "ccc", "eeeeeeee" }
- $3 = { "BB", "DDDDD" }
-Expression: "(.*)bar|(.*)bah"
-Text: "abcbar"
-** Match found **
- Sub-Expressions:
- $0 = "abcbar"
- $1 = "abc"
- $2 = ""
- Captures:
- $0 = { "abcbar" }
- $1 = { "abc" }
- $2 = { }
-Expression: "(.*)bar|(.*)bah"
-Text: "abcbah"
-** Match found **
- Sub-Expressions:
- $0 = "abcbah"
- $1 = ""
- $2 = "abc"
- Captures:
- $0 = { "abcbah" }
- $1 = { }
- $2 = { "abc" }
-Expression: "^(?:(\w+)|(?>\W+))*$"
-Text: "now is the time for all good men to come to the aid of the party"
-** Match found **
- Sub-Expressions:
- $0 = "now is the time for all good men to come to the aid of the party"
- $1 = "party"
- Captures:
- $0 = { "now is the time for all good men to come to the aid of the party" }
- $1 = { "now", "is", "the", "time", "for", "all", "good", "men", "to", "come", "to", "the", "aid", "of", "the", "party" }
-</PRE>
- Unfortunately enabling this feature has an impact on performance (even if you
- don't use it), and a much bigger impact if you do use it, therefore to use this
- feature you need to:
- <UL>
- <LI>
- Define BOOST_REGEX_MATCH_EXTRA for all translation units including the library
- source (the best way to do this is to uncomment this define in <A href="../../../boost/regex/user.hpp">
- boost/regex/user.hpp</A>
- and then rebuild everything.
- <LI>
- Pass the match_extra flag to the particular
- algorithms where you actually need the captures information (regex_search,
- regex_match, or regex_iterator).
- </LI>
- </UL>
- 
- <HR>
- 
- 
- Revised 
- 
- 12 Dec 2003
- 
- © Copyright John Maddock 
-  2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/character_class_names.html
==============================================================================
--- trunk/libs/regex/doc/character_class_names.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,326 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Character Class Names</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Character Class Names.</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- <H3>Contents</H3>
- <dl class="index">
- <dt>Character Classes that are Always Supported <dt><a href="#unicode">
- Character classes that are supported by Unicode Regular Expressions</a></dt>
- </dl>
- <H3><A name="always"></A>Character Classes that are Always Supported</H3>
- The following character class names are always supported by Boost.Regex:
- 
- <TABLE id="Table2" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Name</TD>
- <TD>POSIX-standard name</TD>
- <TD>Description</TD>
- </TR>
- <TR>
- <TD>alnum</TD>
- <TD>Yes</TD>
- <TD>Any alpha-numeric character.</TD>
- </TR>
- <TR>
- <TD>alpha</TD>
- <TD>Yes</TD>
- <TD>Any alphabetic character.</TD>
- </TR>
- <TR>
- <TD>blank</TD>
- <TD>Yes</TD>
- <TD>Any whitespace character that is not a line separator.</TD>
- </TR>
- <TR>
- <TD>cntrl</TD>
- <TD>Yes</TD>
- <TD>Any control character.</TD>
- </TR>
- <TR>
- <TD>d</TD>
- <TD>No</TD>
- <TD>Any decimal digit</TD>
- </TR>
- <TR>
- <TD>digit</TD>
- <TD>Yes</TD>
- <TD>Any decimal digit.</TD>
- </TR>
- <TR>
- <TD>graph</TD>
- <TD>Yes</TD>
- <TD>Any graphical character.</TD>
- </TR>
- <TR>
- <TD>l</TD>
- <TD>No</TD>
- <TD>Any lower case character.</TD>
- </TR>
- <TR>
- <TD>lower</TD>
- <TD>Yes</TD>
- <TD>Any lower case character.</TD>
- </TR>
- <TR>
- <TD>print</TD>
- <TD>Yes</TD>
- <TD>Any printable character.</TD>
- </TR>
- <TR>
- <TD>punct</TD>
- <TD>Yes</TD>
- <TD>Any punctuation character.</TD>
- </TR>
- <TR>
- <TD>s</TD>
- <TD>No</TD>
- <TD>Any whitespace character.</TD>
- </TR>
- <TR>
- <TD>space</TD>
- <TD>Yes</TD>
- <TD>Any whitespace character.</TD>
- </TR>
- <TR>
- <TD>unicode</TD>
- <TD>No</TD>
- <TD>Any extended character whose code point is above 255 in value.</TD>
- </TR>
- <TR>
- <TD>u</TD>
- <TD>No</TD>
- <TD>Any upper case character.</TD>
- </TR>
- <TR>
- <TD>upper</TD>
- <TD>Yes</TD>
- <TD>Any upper case character.</TD>
- </TR>
- <TR>
- <TD>w</TD>
- <TD>No</TD>
- <TD>Any word character (alphanumeric characters plus the underscore).</TD>
- </TR>
- <TR>
- <TD>word</TD>
- <TD>No</TD>
- <TD>Any word character (alphanumeric characters plus the underscore).</TD>
- </TR>
- <TR>
- <TD>xdigit</TD>
- <TD>Yes</TD>
- <TD>Any hexadecimal digit character.</TD>
- </TR>
- </TABLE>
- 
- 
- <H3><A name="unicode"></A>Character classes that are supported by Unicode Regular
- Expressions</H3>
- The following character classes are only supported by <A href="icu_strings.html">Unicode
- Regular Expressions</A>: that is those that use the u32regex type.  The
- names used are the same as those from <A href="http://www.unicode.org/versions/Unicode4.0.0/ch04.pdf#G124142">
- Chapter 4 of the Unicode standard</A>.
- <table width="100%" ID="Table3">
- <tr>
- <td>Short Name</td>
- <td>Long Name</td>
- </tr>
- <tr>
- <td>
- </td>
- <td>ASCII</td>
- </tr>
- <tr>
- <td>
- </td>
- <td>Any</td>
- </tr>
- <tr>
- <td>
- </td>
- <td>Assigned</td>
- </tr>
- <tr>
- <td>C*</td>
- <td>Other</td>
- </tr>
- <tr>
- <td>Cc</td>
- <td>Control</td>
- </tr>
- <tr>
- <td>Cf</td>
- <td>Format</td>
- </tr>
- <tr>
- <td>Cn</td>
- <td>Not Assigned</td>
- </tr>
- <tr>
- <td>Co</td>
- <td>Private Use</td>
- </tr>
- <tr>
- <td>Cs</td>
- <td>Surrogate</td>
- </tr>
- <tr>
- <td>L*</td>
- <td>Letter</td>
- </tr>
- <tr>
- <td>Ll</td>
- <td>Lowercase Letter</td>
- </tr>
- <tr>
- <td>Lm</td>
- <td>Modifier Letter</td>
- </tr>
- <tr>
- <td>Lo</td>
- <td>Other Letter</td>
- </tr>
- <tr>
- <td>Lt</td>
- <td>Titlecase</td>
- </tr>
- <tr>
- <td>Lu</td>
- <td>Uppercase Letter</td>
- </tr>
- <tr>
- <td>M*</td>
- <td>Mark</td>
- </tr>
- <tr>
- <td>Mc</td>
- <td>Spacing Combining Mark</td>
- </tr>
- <tr>
- <td>Me</td>
- <td>Enclosing Mark</td>
- </tr>
- <tr>
- <td>Mn</td>
- <td>Non-Spacing Mark</td>
- </tr>
- <tr>
- <td>N*</td>
- <td>Number</td>
- </tr>
- <tr>
- <td>Nd</td>
- <td>Decimal Digit Number</td>
- </tr>
- <tr>
- <td>Nl</td>
- <td>Letter Number</td>
- </tr>
- <tr>
- <td>No</td>
- <td>Other Number</td>
- </tr>
- <tr>
- <td>P*</td>
- <td>Punctuation</td>
- </tr>
- <tr>
- <td>Pc</td>
- <td>Connector Punctuation</td>
- </tr>
- <tr>
- <td>Pd</td>
- <td>Dash Punctuation</td>
- </tr>
- <tr>
- <td>Pe</td>
- <td>Close Punctuation</td>
- </tr>
- <tr>
- <td>Pf</td>
- <td>Final Punctuation</td>
- </tr>
- <tr>
- <td>Pi</td>
- <td>Initial Punctuation</td>
- </tr>
- <tr>
- <td>Po</td>
- <td>Other Punctuation</td>
- </tr>
- <tr>
- <td>Ps</td>
- <td>Open Punctuation</td>
- </tr>
- <tr>
- <td>S*</td>
- <td>Symbol</td>
- </tr>
- <tr>
- <td>Sc</td>
- <td>Currency Symbol</td>
- </tr>
- <tr>
- <td>Sk</td>
- <td>Modifier Symbol</td>
- </tr>
- <tr>
- <td>Sm</td>
- <td>Math Symbol</td>
- </tr>
- <tr>
- <td>So</td>
- <td>Other Symbol</td>
- </tr>
- <tr>
- <td>Z*</td>
- <td>Separator</td>
- </tr>
- <tr>
- <td>Zl</td>
- <td>Line Separator</td>
- </tr>
- <tr>
- <td>Zp</td>
- <td>Paragraph Separator</td>
- </tr>
- <tr>
- <td>Zs</td>
- <td>Space Separator</td>
- </tr>
- </table>
- <HR>
- 
- 
- Revised  
- 
- 10 Jan 2005 
- 
- © Copyright John Maddock 2004-5
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/collating_names.html
==============================================================================
--- trunk/libs/regex/doc/collating_names.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,368 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Collating Element Names</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Collating Element Names</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- <H3>Contents</H3>
- <dl class="index">
- <dt>Digraphs</dt>
- <dt>POSIX Symbolic Names</dt>
- <dt>Unicode Symbolic Names</dt>
- </dl>
- <H3><A name="digraphs"></A>Digraphs</H3>
- The following are treated as valid digraphs when used as a collating name:
- "ae", "Ae", "AE", "ch", "Ch", "CH", "ll", "Ll", "LL", "ss", "Ss", "SS", "nj",
- "Nj", "NJ", "dz", "Dz", "DZ", "lj", "Lj", "LJ".
- <H3><A name="posix"></A>POSIX Symbolic Names</H3>
- The following symbolic names are recognised as valid collating element names,
- in addition to any single character:
- 
- <TABLE id="Table2" cellSpacing="1" cellPadding="1" width="50%" border="1">
- <TR>
- <TD>Name</TD>
- <TD>Character</TD>
- </TR>
- <TR>
- <TD>NUL</TD>
- <TD>\x00</TD>
- </TR>
- <TR>
- <TD>SOH</TD>
- <TD>\x01</TD>
- </TR>
- <TR>
- <TD>STX</TD>
- <TD>\x02</TD>
- </TR>
- <TR>
- <TD>ETX</TD>
- <TD>\x03</TD>
- </TR>
- <TR>
- <TD>EOT</TD>
- <TD>\x04</TD>
- </TR>
- <TR>
- <TD>ENQ</TD>
- <TD>\x05</TD>
- </TR>
- <TR>
- <TD>ACK</TD>
- <TD>\x06</TD>
- </TR>
- <TR>
- <TD>alert</TD>
- <TD>\x07</TD>
- </TR>
- <TR>
- <TD>backspace</TD>
- <TD>\x08</TD>
- </TR>
- <TR>
- <TD>tab</TD>
- <TD>\t</TD>
- </TR>
- <TR>
- <TD>newline</TD>
- <TD>\n</TD>
- </TR>
- <TR>
- <TD>vertical-tab</TD>
- <TD>\v</TD>
- </TR>
- <TR>
- <TD>form-feed</TD>
- <TD>\f</TD>
- </TR>
- <TR>
- <TD>carriage-return</TD>
- <TD>\r</TD>
- </TR>
- <TR>
- <TD>SO</TD>
- <TD>\xE</TD>
- </TR>
- <TR>
- <TD>SI</TD>
- <TD>\xF</TD>
- </TR>
- <TR>
- <TD>DLE</TD>
- <TD>\x10</TD>
- </TR>
- <TR>
- <TD>DC1</TD>
- <TD>\x11</TD>
- </TR>
- <TR>
- <TD>DC2</TD>
- <TD>\x12</TD>
- </TR>
- <TR>
- <TD>DC3</TD>
- <TD>\x13</TD>
- </TR>
- <TR>
- <TD>DC4</TD>
- <TD>\x14</TD>
- </TR>
- <TR>
- <TD>NAK</TD>
- <TD>\x15</TD>
- </TR>
- <TR>
- <TD>SYN</TD>
- <TD>\x16</TD>
- </TR>
- <TR>
- <TD>ETB</TD>
- <TD>\x17</TD>
- </TR>
- <TR>
- <TD>CAN</TD>
- <TD>\x18</TD>
- </TR>
- <TR>
- <TD>EM</TD>
- <TD>\x19</TD>
- </TR>
- <TR>
- <TD>SUB</TD>
- <TD>\x1A</TD>
- </TR>
- <TR>
- <TD>ESC</TD>
- <TD>\x1B</TD>
- </TR>
- <TR>
- <TD>IS4</TD>
- <TD>\x1C</TD>
- </TR>
- <TR>
- <TD>IS3</TD>
- <TD>\x1D</TD>
- </TR>
- <TR>
- <TD>IS2</TD>
- <TD>\x1E</TD>
- </TR>
- <TR>
- <TD>IS1</TD>
- <TD>\x1F</TD>
- </TR>
- <TR>
- <TD>space</TD>
- <TD>\x20</TD>
- </TR>
- <TR>
- <TD>exclamation-mark</TD>
- <TD>!</TD>
- </TR>
- <TR>
- <TD>quotation-mark</TD>
- <TD>"</TD>
- </TR>
- <TR>
- <TD>number-sign</TD>
- <TD>#</TD>
- </TR>
- <TR>
- <TD>dollar-sign</TD>
- <TD>$</TD>
- </TR>
- <TR>
- <TD>percent-sign</TD>
- <TD>%</TD>
- </TR>
- <TR>
- <TD>ampersand</TD>
- <TD>&</TD>
- </TR>
- <TR>
- <TD>apostrophe</TD>
- <TD>'</TD>
- </TR>
- <TR>
- <TD>left-parenthesis</TD>
- <TD>(</TD>
- </TR>
- <TR>
- <TD>right-parenthesis</TD>
- <TD>)</TD>
- </TR>
- <TR>
- <TD>asterisk</TD>
- <TD>*</TD>
- </TR>
- <TR>
- <TD>plus-sign</TD>
- <TD>+</TD>
- </TR>
- <TR>
- <TD>comma</TD>
- <TD>,</TD>
- </TR>
- <TR>
- <TD>hyphen</TD>
- <TD>-</TD>
- </TR>
- <TR>
- <TD>period</TD>
- <TD>.</TD>
- </TR>
- <TR>
- <TD>slash</TD>
- <TD>/</TD>
- </TR>
- <TR>
- <TD>zero</TD>
- <TD>0</TD>
- </TR>
- <TR>
- <TD>one</TD>
- <TD>1</TD>
- </TR>
- <TR>
- <TD>two</TD>
- <TD>2</TD>
- </TR>
- <TR>
- <TD>three</TD>
- <TD>3</TD>
- </TR>
- <TR>
- <TD>four</TD>
- <TD>4</TD>
- </TR>
- <TR>
- <TD>five</TD>
- <TD>5</TD>
- </TR>
- <TR>
- <TD>six</TD>
- <TD>6</TD>
- </TR>
- <TR>
- <TD>seven</TD>
- <TD>7</TD>
- </TR>
- <TR>
- <TD>eight</TD>
- <TD>8</TD>
- </TR>
- <TR>
- <TD>nine</TD>
- <TD>9</TD>
- </TR>
- <TR>
- <TD>colon</TD>
- <TD>:</TD>
- </TR>
- <TR>
- <TD>semicolon</TD>
- <TD>;</TD>
- </TR>
- <TR>
- <TD>less-than-sign</TD>
- <TD><</TD>
- </TR>
- <TR>
- <TD>equals-sign</TD>
- <TD>=</TD>
- </TR>
- <TR>
- <TD>greater-than-sign</TD>
- <TD>></TD>
- </TR>
- <TR>
- <TD>question-mark</TD>
- <TD>?</TD>
- </TR>
- <TR>
- <TD>commercial-at</TD>
- <TD>@</TD>
- </TR>
- <TR>
- <TD>left-square-bracket</TD>
- <TD>[</TD>
- </TR>
- <TR>
- <TD>backslash</TD>
- <TD>\</TD>
- </TR>
- <TR>
- <TD>right-square-bracket</TD>
- <TD>]</TD>
- </TR>
- <TR>
- <TD>circumflex</TD>
- <TD>~</TD>
- </TR>
- <TR>
- <TD>underscore</TD>
- <TD>_</TD>
- </TR>
- <TR>
- <TD>grave-accent</TD>
- <TD>`</TD>
- </TR>
- <TR>
- <TD>left-curly-bracket</TD>
- <TD>{</TD>
- </TR>
- <TR>
- <TD>vertical-line</TD>
- <TD>|</TD>
- </TR>
- <TR>
- <TD>right-curly-bracket</TD>
- <TD>}</TD>
- </TR>
- <TR>
- <TD>tilde</TD>
- <TD>~</TD>
- </TR>
- <TR>
- <TD>DEL</TD>
- <TD>\x7F</TD>
- </TR>
- </TABLE>
- 
- 
- <H3><A name="unicode"></A>Named Unicode Characters</H3>
- 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.
- 
- <HR>
- 
- 
- Revised 12 Jan 2005
- 
- © Copyright John Maddock 2004-2005
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/concepts.html
==============================================================================
--- trunk/libs/regex/doc/concepts.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,453 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Index</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Concepts</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- <H3><A name="charT"></A>charT requirements</H3>
- Type charT used a template argument to <A href="basic_regex.html">class template
- basic_regex</A>, 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:
- 
- <TABLE id="Table2" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Expression</TD>
- <TD>Return type</TD>
- <TD>Assertion / Note / Pre- / Post-condition</TD>
- </TR>
- <TR>
- <TD>charT c</TD>
- <TD>charT</TD>
- <TD>Default constructor (must be trivial).</TD>
- </TR>
- <TR>
- <TD>charT c(c1)</TD>
- <TD>charT</TD>
- <TD>Copy constructor (must be trivial).</TD>
- </TR>
- <TR>
- <TD>c1 = c2</TD>
- <TD>charT</TD>
- <TD>Assignment operator (must be trivial).</TD>
- </TR>
- <TR>
- <TD>c1 == c2</TD>
- <TD>bool</TD>
- <TD>true if c1 has the same value as c2.</TD>
- </TR>
- <TR>
- <TD>c1 != c2</TD>
- <TD>bool</TD>
- <TD>true if c1 and c2 are not equal.</TD>
- </TR>
- <TR>
- <TD>c1 < c2</TD>
- <TD>bool</TD>
- <TD>true if the value of c1 is less than c2.</TD>
- </TR>
- <TR>
- <TD>c1 > c2</TD>
- <TD>bool</TD>
- <TD>true if the value of c1 is greater than c2.</TD>
- </TR>
- <TR>
- <TD>c1 <= c2</TD>
- <TD>bool</TD>
- <TD>true if c1 is less than or equal to c2.</TD>
- </TR>
- <TR>
- <TD>c1 >= c2</TD>
- <TD>bool</TD>
- <TD>true if c1 is greater than or equal to c2.</TD>
- </TR>
- <TR>
- <TD>intmax_t i = c1</TD>
- <TD>int</TD>
- <TD>
- charT must be convertible to an integral type.
- Note: type charT is not required to support this operation, if the traits class
- used supports the full Boost-specific interface, rather than the minimal
- standardised-interface (see traits class requirements below).
- </TD>
- </TR>
- <TR>
- <TD>charT c(i);</TD>
- <TD>charT</TD>
- <TD>charT must be constructable from an integral type.</TD>
- </TR>
- </TABLE>
- 
- <H3><A name="traits"></A>traits requirements</H3>
- 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.
- <H4>Minimal requirements.</H4>
- 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.
- 
- <TABLE id="Table3" cellSpacing="1" cellPadding="7" width="100%" border="1">
- <TR>
- <TD vAlign="top" width="28%">
- Expression
- </TD>
- <TD vAlign="top" width="28%">
- Return type
- </TD>
- <TD vAlign="top" width="45%">
- Assertion / Note
- 
- Pre / Post condition
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- X::char_type
- </TD>
- <TD vAlign="top" width="28%">
- charT
- </TD>
- <TD vAlign="top" width="45%">
- The character container type used in the implementation of class template <CODE>basic_regex</CODE>.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- X::size_type
- </TD>
- <TD vAlign="top" width="28%">
-  
- </TD>
- <TD vAlign="top" width="45%">
- An unsigned integer type, capable of holding the length of a null-terminated
- string of charT's.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- X::string_type
- </TD>
- <TD vAlign="top" width="28%">
- std::basic_string<charT> or std::vector<charT>
- </TD>
- <TD vAlign="top" width="45%">
-  
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- X::locale_type
- </TD>
- <TD vAlign="top" width="28%">
- Implementation defined
- </TD>
- <TD vAlign="top" width="45%">
- A copy constructible type that represents the locale used by the traits class.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- X::char_class_type
- </TD>
- <TD vAlign="top" width="28%">
- Implementation defined
- </TD>
- <TD vAlign="top" width="45%">
- A bitmask type representing a particular character classification. Multiple
- values of this type can be bitwise-or'ed together to obtain a new valid value.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- X::length(p)
- </TD>
- <TD vAlign="top" width="28%">
- X::size_type
- </TD>
- <TD vAlign="top" width="45%">
- Yields the smallest <CODE>i</CODE> such that <CODE>p[i] == 0</CODE>. Complexity
- is linear in <CODE>i</CODE>.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.translate(c)
- </TD>
- <TD vAlign="top" width="28%">
- X::char_type
- </TD>
- <TD vAlign="top" width="45%">
- Returns a character such that for any character d that is to be considered
- equivalent to c then v.translate(c) == v.translate(d).
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.translate_nocase(c)
- </TD>
- <TD vAlign="top" width="28%">X::char_type</TD>
- <TD vAlign="top" width="45%">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_- nocase(c) == v.translate_- nocase(C).</TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.transform(F1, F2)
- </TD>
- <TD vAlign="top" width="28%">
- X::string_type
- </TD>
- <TD vAlign="top" width="45%">
- Returns a sort key for the character sequence designated by the iterator range
- [F1, F2) such that if the character sequence [G1, G2) sorts before the
- character sequence [H1, H2) then v.transform(G1, G2) < v.transform(H1,
- H2). 
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.transform_primary(F1, F2)
- </TD>
- <TD vAlign="top" width="28%">
- X::string_type
- </TD>
- <TD vAlign="top" width="45%">
- Returns a sort key for the character sequence designated by the iterator range
- [F1, F2) such that if the character sequence [G1, G2) sorts before the
- character sequence [H1, H2) when character case is not considered then
- v.transform_primary(G1, G2) < v.transform_- primary(H1, H2).
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.lookup_classname(F1, F2)
- </TD>
- <TD vAlign="top" width="28%">
- X::char_class_type
- </TD>
- <TD vAlign="top" width="45%">
- Converts the character sequence designated by the iterator range [F1,F2) into a
- bitmask type that can subsequently be passed to isctype. Values returned from
- lookup_classname can be safely bitwise or'ed together. Returns 0 if the
- character sequence is not the name of a character class recognized by X. The
- value returned shall be independent of the case of the characters in the
- sequence.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.lookup_collatename(F1, F2)
- </TD>
- <TD vAlign="top" width="28%">
- X::string_type
- </TD>
- <TD vAlign="top" width="45%">
- Returns a sequence of characters that represents the collating element
- consisting of the character sequence designated by the iterator range [F1, F2).
- Returns an empty string if the character sequence is not a valid collating
- element.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.isctype(c, v.lookup_classname (F1, F2))
- </TD>
- <TD vAlign="top" width="28%">
- bool
- </TD>
- <TD vAlign="top" width="45%">
- Returns true if character c is a member of the character class designated by
- the iterator range [F1, F2), false otherwise.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.value(c, i)
- </TD>
- <TD vAlign="top" width="28%">
- int
- </TD>
- <TD vAlign="top" width="45%">
- Returns the value represented by the digit c in base I if the character c is a
- valid digit in base I; otherwise returns -1. [Note: the value of I will only be
- 8, 10, or 16. -end note]
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- u.imbue(loc)
- </TD>
- <TD vAlign="top" width="28%">
- X::locale_type
- </TD>
- <TD vAlign="top" width="45%">
- Imbues <CODE>u</CODE> with the locale <CODE>loc</CODE>, returns the previous
- locale used by u if any. 
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.getloc()
- </TD>
- <TD vAlign="top" width="28%">
- X::locale_type
- </TD>
- <TD vAlign="top" width="45%">
- Returns the current locale used by <CODE>v</CODE> if any. 
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="28%">
- v.error_string(i)
- </TD>
- <TD vAlign="top" width="28%">
- std::string
- </TD>
- <TD vAlign="top" width="45%">
- Returns a human readable error string for the error condition <CODE>i</CODE>,
- where <CODE>i</CODE> is one of the values enumerated by type <CODE>regex_constants::error_type</CODE>. 
- If the value <CODE>i</CODE> is not recognized then returns the string "Unknown
- error" or a localized equivalent.
- </TD>
- </TR>
- </TABLE>
- 
- <H4>Additional Optional Requirements</H4>
- The following additional requirements are strictly optional, however in 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 member boost_extensions_tag and configure itself
- appropriately.
- 
- <TABLE id="Table4" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Expression</TD>
- <TD width="231">Result</TD>
- <TD>
- Assertion / Note
- 
- Pre / Post condition
- </TD>
- </TR>
- <TR>
- <TD>X::boost_extensions_tag</TD>
- <TD width="231">An unspecified type.</TD>
- <TD>When present, all of the extensions listed in this table must be present.</TD>
- </TR>
- <TR>
- <TD>
- v.syntax_type(c)
- </TD>
- <TD width="231">regex_constants::syntax_type</TD>
- <TD>
- Returns a symbolic value of type <CODE>regex_constants::syntax_type </CODE>that
- signifies the meaning of character <CODE>c</CODE> within the regular expression
- grammar.
- </TD>
- </TR>
- <TR>
- <TD>v.escape_syntax_type(c)</TD>
- <TD width="231">regex_constants::escape_syntax_type</TD>
- <TD>
- Returns a symbolic value of type <CODE>regex_constants::escape_syntax_type</CODE>,
- that signifies the meaning of character <CODE>c</CODE> within the regular
- expression grammar, when <CODE>c</CODE> has been preceded by an escape
- character. Precondition: if <CODE>b</CODE> is the character preceding <CODE>c</CODE>
- in the expression being parsed then: <CODE>v.syntax_type(b) == syntax_escape</CODE>
- </TD>
- </TR>
- <TR>
- <TD>
- v.translate(c, b)
- </TD>
- <TD width="231">X::char_type</TD>
- <TD>
- Returns a character <CODE>d</CODE> such that: for any character <CODE>d</CODE> that
- is to be considered equivalent to <CODE>c</CODE> then <CODE>v.translate(c,false)==v.translate(d,false)</CODE>.
- Likewise for all characters <CODE>C</CODE> that are to be considered equivalent
- to <CODE>c</CODE> when comparisons are to be performed without regard to case,
- then <CODE>v.translate(c,true)==v.translate(C,true)</CODE>.
- </TD>
- </TR>
- <TR>
- <TD>
- v.toi(I1, I2, i)
- </TD>
- <TD width="231">An integer type capable of holding either a charT or an int.</TD>
- <TD>
- Behaves as follows: if <CODE>p==q</CODE> or if <CODE>*p </CODE>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 <CODE>p ==
- q</CODE> or <CODE>*p</CODE> is a non-digit character.
- </TD>
- </TR>
- <TR>
- <TD>
- v.error_string(i)
- </TD>
- <TD width="231">std::string</TD>
- <TD>
- Returns a human readable error string for the error condition <CODE>i</CODE>,
- where <CODE>i</CODE> is one of the values enumerated by type <CODE><A href="error_type.html">
- regex_constants::error_type</A></CODE>.  If the value <CODE>i</CODE>
- is not recognized then returns the string "Unknown error" or a localized
- equivalent.
- </TD>
- </TR>
- <TR>
- <TD>v.tolower(c)</TD>
- <TD width="231">X::char_type</TD>
- <TD>Converts c to lower case, used for Perl-style \l and \L formating operations.</TD>
- </TR>
- <TR>
- <TD>v.toupper(c)</TD>
- <TD width="231">X::char_type</TD>
- <TD>Converts c to upper case, used for Perl-style \u and \U formating operations.</TD>
- </TR>
- </TABLE>
- 
- <H3><A name="iterator"></A>Iterator Rrequirements</H3>
- 
- The regular expression algorithms (and iterators) take all require a
- Bidirectional-Iterator.
- 
- <HR>
- 
- 
- Revised
- 
- 24 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/configuration.html
==============================================================================
--- trunk/libs/regex/doc/configuration.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,155 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Configuration and setup</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">Configuration and setup</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- <h2>Contents</h2>
- <dl class="index">
- <dt>Compiler setup <dt><a href="#locale">Locale and traits class
- selection</a> <dt>Linkage Options <dt><a href="#algorithm">Algorithm
- Selection</a> <dt>Algorithm Tuning</dt>
- </dl>
- <h3><a name="compiler"></a>Compiler setup.</h3>
- You shouldn't need to do anything special to configure boost.regex for use with
- your compiler - the boost.config subsystem
- should already take care of it, if you do have problems (or you are using a
- particularly obscure compiler or platform) then boost.config has
- a configure script.
- <h3><a name="locale"></a>Locale and traits class selection.</h3>
- The following macros (see user.hpp)
- control how boost.regex interacts with the user's locale:
- <table id="Table2" cellspacing="1" cellpadding="1" width="100%" border="1">
- <tr>
- <td width="265">BOOST_REGEX_USE_C_LOCALE</td>
- <td>
- Forces boost.regex to use the global C locale in its traits class support: this
- is now deprecated in favour of the C++ locale.</td>
- </tr>
- <tr>
- <td width="265">BOOST_REGEX_USE_CPP_LOCALE</td>
- <td>Forces boost.regex to use std::locale in it's default traits class, regular
- expressions can then be imbued with an instance specific locale. 
- This is the default behaviour on non-Windows platforms.</td>
- </tr>
- <tr>
- <td width="265">BOOST_REGEX_NO_W32</td>
- <td>Tells boost.regex not to use any Win32 API's even when available (implies
- BOOST_REGEX_USE_CPP_LOCALE unless BOOST_REGEX_USE_C_LOCALE is set).</td>
- </tr>
- </table>
- 
- 
- <h3><a name="linkage"></a>Linkage Options</h3>
- <table id="Table3" cellspacing="1" cellpadding="1" width="100%" border="1">
- <tr>
- <td>BOOST_REGEX_DYN_LINK</td>
- <td>For Microsoft and Borland C++ builds, this tells boost.regex that it should
- link to the dll build of the boost.regex.  By default boost.regex will
- link to its static library build, even if the dynamic C runtime library is in
- use.</td>
- </tr>
- <tr>
- <td>BOOST_REGEX_NO_LIB</td>
- <td>For Microsoft and Borland C++ builds, this tells boost.regex that it should
- not automatically select the library to link to.</td>
- </tr>
- </table>
- 
- 
- <h3><a name="algorithm"></a>Algorithm Selection</h3>
- <table id="Table4" cellspacing="1" cellpadding="1" width="100%" border="1">
- <tr>
- <td width="253">BOOST_REGEX_RECURSIVE</td>
- <td>Tells boost.regex to use a stack-recursive matching algorithm.  This is
- generally the fastest option (although there is very little in it), but can
- cause stack overflow in extreme cases, on Win32 this can be handled safely, but
- this is not the case on other platforms.</td>
- </tr>
- <tr>
- <td width="253">BOOST_REGEX_NON_RECURSIVE</td>
- <td>Tells boost.regex to use a non-stack recursive matching algorithm, this can be
- slightly slower than the alternative, but is always safe no matter how
- pathological the regular expression.  This is the default on non-Win32
- platforms.</td>
- </tr>
- </table>
- 
- 
- <h3><a name="tuning"></a>Algorithm Tuning</h3>
- The following option applies only if BOOST_REGEX_RECURSIVE is set.
- <table id="Table6" cellspacing="1" cellpadding="1" width="100%" border="1">
- <tr>
- <td>BOOST_REGEX_HAS_MS_STACK_GUARD</td>
- <td>Tells boost.regex that Microsoft style __try - __except blocks are supported,
- and can be used to safely trap stack overflow.</td>
- </tr>
- </table>
- 
- 
- The following options apply only if BOOST_REGEX_NON_RECURSIVE is set.
- <table id="Table5" cellspacing="1" cellpadding="1" width="100%" border="1">
- <tr>
- <td>BOOST_REGEX_BLOCKSIZE</td>
- <td>In non-recursive mode, boost.regex uses largish blocks of memory to act as a
- stack for the state machine, the larger the block size then the fewer
- allocations that will take place.  This defaults to 4096 bytes, which is
- large enough to match the vast majority of regular expressions without
- further allocations, however, you can choose smaller or larger values depending
- upon your platforms characteristics.</td>
- </tr>
- <tr>
- <td>BOOST_REGEX_MAX_BLOCKS</td>
- <td>Tells boost.regex how many blocks of size BOOST_REGEX_BLOCKSIZE it is
- permitted to use.  If this value is exceeded then boost.regex will stop
- trying to find a match and throw a std::runtime_error.  Defaults to 1024,
- don't forget to tweek this value if you alter BOOST_REGEX_BLOCKSIZE by much.</td>
- </tr>
- <tr>
- <td>BOOST_REGEX_MAX_CACHE_BLOCKS</td>
- <td>Tells boost.regex how many memory blocks to store in it's internal cache -
- memory blocks are taken from this cache rather than by calling ::operator
- new.  Generally speeking this can be an order of magnitude faster than
- calling ::opertator new each time a memory block is required, but has the
- downside that boost.regex can end up caching a large chunk of memory (by
- default up to 16 blocks each of BOOST_REGEX_BLOCKSIZE size).  If memory is
- tight then try defining this to 0 (disables all caching), or if that is too
- slow, then a value of 1 or 2, may be sufficient.  On the other hand, on
- large multi-processor, multi-threaded systems, you may find that a higher value
- is in order.</td>
- </tr>
- </table>
- 
- 
- <hr>
- Revised 
- 
- 23 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/contacts.html
==============================================================================
--- trunk/libs/regex/doc/contacts.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,87 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Contacts</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">Contacts and Acknowledgements</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <HR>
- The author can be contacted at john_at_[hidden]; the home page for
- this library is at www.boost.org.
- I am indebted to <A href="http://www.cs.princeton.edu/~rs/">Robert Sedgewick's
- "Algorithms in C++" </A>for forcing me to think about algorithms and their
- performance, and to the folks at boost for
- forcing me to think, period.
- Eric Niebler, author of the <A href="http://research.microsoft.com/projects/greta">
- GRETA regular expression component</A>, has shared several important ideas,
- in a series of long discussions.
- Pete Becker, of Dinkumware Ltd, has
- helped enormously with the standardisation proposal language.
- The following people have all contributed useful comments or fixes: Dave
- Abrahams, Mike Allison, Edan Ayal, Jayashree Balasubramanian, Jan Bölsche,
- Beman Dawes, Paul Baxter, David Bergman, David Dennerline, Edward Diener, Peter
- Dimov, Robert Dunn, Fabio Forno, Tobias Gabrielsson, Rob Gillen, Marc Gregoire,
- Chris Hecker, Nick Hodapp, Jesse Jones, Martin Jost, Boris Krasnovskiy, Jan
- Hermelink, Max Leung, Wei-hao Lin, Jens Maurer, Richard Peters, Heiko Schmidt,
- Jason Shirk, Gerald Slacik, Scobie Smith, Mike Smyth, Alexander Sokolovsky,
- Hervé Poirier, Michael Raykh, Marc Recht, Scott VanCamp, Bruno Voigt, Alexey
- Voinov, Jerry Waldorf, Rob Ward, Lealon Watts, John Wismar, Thomas Witt and
- Yuval Yosef. I am also grateful to the manuals supplied with the Henry Spencer,
- Perl and GNU regular expression libraries - wherever possible I have tried to
- maintain compatibility with these libraries and with the POSIX standard - the
- code however is entirely my own, including any bugs! I can absolutely guarantee
- that I will not fix any bugs I don't know about, so if you have any comments or
- spot any bugs, please get in touch.
- Useful further information can be found at:
- Short tutorials on regular expressions can be <A href="http://etext.lib.virginia.edu/helpsheets/regex.html">
- found here</A> and here.
- The main book on regular expressions is <A href="http://www.oreilly.com/catalog/regex/">
- Mastering Regular Expressions, published by O'Reilly</A>.
- Information on the <A href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1429.htm">
- Boost.regex standardization proposal</A>, along with other <A href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1475.html">
- standard library extension proposals</A> can be found on the <A href="http://anubis.dkuug.dk/jtc1/sc22/wg21/">
- C++ Committees web pages</A>.
- The<a href="http://www.opengroup.org/onlinepubs/7908799/toc.htm">Open Unix
- Specification</a> contains a wealth of useful material, including the
- regular expression syntax, and specifications for <a href="http://www.opengroup.org/onlinepubs/7908799/xsh/regex.h.html">
- <regex.h></a> and <a href="http://www.opengroup.org/onlinepubs/7908799/xsh/nl_types.h.html">
- <nl_types.h></a>.
- The Pattern Matching Pointers
- site is a "must visit" resource for anyone interested in pattern matching.
- Glimpse and Agrep, use a
- simplified regular expression syntax to achieve faster search times.
- Udi Manber and <a href="http://www.dcc.uchile.cl/~rbaeza/">
- Ricardo Baeza-Yates</a> both have a selection of useful pattern matching
- papers available from their respective web sites.
- 
- <hr>
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
-  2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/error_type.html
==============================================================================
--- trunk/libs/regex/doc/error_type.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,139 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: error_type</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">error_type</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>Description</dt></dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- Type error type represents the different types of errors that can be raised by
- the library when parsing a regular expression.
- <pre>
-namespace boost{ namespace regex_constants{
-
-typedef implementation-specific-type error_type;
-
-static const error_type error_collate;
-static const error_type error_ctype;
-static const error_type error_escape;
-static const error_type error_backref;
-static const error_type error_brack;
-static const error_type error_paren;
-static const error_type error_brace;
-static const error_type error_badbrace;
-static const error_type error_range;
-static const error_type error_space;
-static const error_type error_badrepeat;
-static const error_type error_complexity;
-static const error_type error_stack;
-static const error_type error_bad_pattern;
-
-} // namespace regex_constants
-} // namespace boost
-</pre>
-  
- <H3><A name="description"></A>Description</H3>
- The type error_type is an implementation-specific enumeration type that may
- take one of the following values:
- 
- <TABLE id="Table2" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Constant</TD>
- <TD>Meaning</TD>
- </TR>
- <TR>
- <TD>error_collate</TD>
- <TD>An invalid collating element was specified in a [[.name.]] block.</TD>
- </TR>
- <TR>
- <TD>error_ctype</TD>
- <TD>An invalid character class name was specified in a [[:name:]] block.</TD>
- </TR>
- <TR>
- <TD>error_escape</TD>
- <TD>An invalid or trailing escape was encountered.</TD>
- </TR>
- <TR>
- <TD>error_backref</TD>
- <TD>A back-reference to a non-existant marked sub-expression was encountered.</TD>
- </TR>
- <TR>
- <TD>error_brack</TD>
- <TD>An invalid character set [...] was encountered.</TD>
- </TR>
- <TR>
- <TD>error_paren</TD>
- <TD>
- Mismatched '(' and ')'.
- </TD>
- </TR>
- <TR>
- <TD>error_brace</TD>
- <TD>Mismatched '{' and '}'.</TD>
- </TR>
- <TR>
- <TD>error_badbrace</TD>
- <TD>Invalid contents of a {...} block.</TD>
- </TR>
- <TR>
- <TD>error_range</TD>
- <TD>A character range was invalid, for example [d-a].</TD>
- </TR>
- <TR>
- <TD>error_space</TD>
- <TD>Out of memory.</TD>
- </TR>
- <TR>
- <TD>error_badrepeat</TD>
- <TD>An attempt to repeat something that can not be repeated - for example a*+</TD>
- </TR>
- <TR>
- <TD>error_complexity</TD>
- <TD>The expression became too complex to handle.</TD>
- </TR>
- <TR>
- <TD>error_stack</TD>
- <TD>Out of program stack space.</TD>
- </TR>
- <TR>
- <TD>error_bad_pattern</TD>
- <TD>Other unspecified errors.</TD>
- </TR>
- </TABLE>
- 
- <H3><A name="examples"></A>
- <HR>
- </H3>
- Revised 
- 
- 24 June 2004 
- 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/examples.html
==============================================================================
--- trunk/libs/regex/doc/examples.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,117 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Examples</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">Examples</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <HR>
- <H3>Test Programs</H3>
- <H4>regress:</H4>
- A regression test application that gives the matching/searching algorithms a
- full workout. The presence of this program is your guarantee that the library
- will behave as claimed - at least as far as those items tested are concerned -
- if anyone spots anything that isn't being tested I'd be glad to hear about it.
- Directory: libs/regex/test/regress.
- Files: basic_tests.cpp <A href="../test/regress/test_deprecated.cpp">
- test_deprecated.cpp</A> main.cpp.
- <H4>bad_expression_test:</H4>
- Verifies that "bad" regular expressions don't cause the matcher to go into
- infinite loops, but to throw an exception instead.
- Directory: libs/regex/test/pathology.
- Files: bad_expression_test.cpp.
- <H4>recursion_test:</H4>
- Verifies that the matcher can't overrun the stack (no matter what the
- expression).
- Directory: libs/regex/test/pathology.
- Files: recursion_test.cpp.
- <H4>concepts:</H4>
- Verifies that the library meets all documented concepts (a compile only test).
- Directory: libs/regex/test/concepts.
- Files: concept_check.cpp.
- <H4>captures_test:</H4>
- Test code for captures.
- Directory: libs/test/captures.
- Files: captures_test.cpp.
- <H3>Example programs</H3>
- <H4>grep</H4>
- A simple grep implementation, run with the -h command line option to find out
- its usage.
- Files: grep.cpp
- <H4>timer.exe</H4>
- A simple interactive expression matching application, the results of all
- matches are timed, allowing the programmer to optimize their regular
- expressions where performance is critical.
- Files: regex_timer.cpp.
- <H4>Code snippets</H4>
- The snippets examples contain the code examples used in the documentation:
- captures_example.cpp:
- Demonstrates the use of captures.
- credit_card_example.cpp:
- Credit card number formatting code.
- partial_regex_grep.cpp:
- Search example using partial matches.
- partial_regex_match.cpp:
- regex_match example using partial matches.
- regex_iterator_example.cpp:
- Iterating through a series of matches.
- regex_match_example.cpp:
- ftp based regex_match example.
- regex_merge_example.cpp:
- regex_merge example: converts a C++ file to syntax highlighted HTML.
- regex_replace_example.cpp:
- regex_replace example: converts a C++ file to syntax highlighted HTML
- regex_search_example.cpp:
- regex_search example: searches a cpp file for class definitions.
- regex_token_iterator_eg_1.cpp:
- split a string into a series of tokens.
- regex_token_iterator_eg_2.cpp:
- enumerate the linked URL's in a HTML file.
- The following are deprecated:
- regex_grep_example_1.cpp:
- regex_grep example 1: searches a cpp file for class definitions.
- regex_grep_example_2.cpp:
- regex_grep example 2: searches a cpp file for class definitions, using a global
- callback function.
- regex_grep_example_3.cpp:
- regex_grep example 2: searches a cpp file for class definitions, using a bound
- member function callback.
- regex_grep_example_4.cpp:
- regex_grep example 2: searches a cpp file for class definitions, using a C++
- Builder closure as a callback.
- regex_split_example_1.cpp:
- regex_split example: split a string into tokens.
- regex_split_example_2.cpp
- : regex_split example: spit out linked URL's.
- 
- <HR>
- Revised 
- 
- 28 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/faq.html
==============================================================================
--- trunk/libs/regex/doc/faq.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,114 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: FAQ</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">FAQ</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- 
-  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 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 your compiler supports, run
- <boost/regex.hpp> through your C++ pre-processor, and search the output
- file for the function that you are interested in.
- Q. I can't get regex++ to work with
- escape characters, what's going on?
- 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
- regex++ expression compiler, so to pass the regular expression \d+ to regex++,
- you need to embed "\\d+" in your code. Likewise to match a literal backslash
- you will need to embed "\\\\" in your code. 
- 
- Q. Why does using parenthesis in a POSIX regular expression
- change the result of a match?
- 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 leftmost longest rule for determining
- what matched. So if there is more than one possible match after considering the
- whole expression, it looks next at the first sub-expression and then the second
- sub-expression and so on. So...
- <pre>
-"(0*)([0-9]*)" against "00123" would produce
-$1 = "00"
-$2 = "123"
-</pre>
- where as
- <pre>
-"0*([0-9])*" against "00123" would produce
-$1 = "00123"
-</pre>
- If you think about it, had $1 only matched the "123", this would be "less good"
- than the match "00123" which is both further to the left and longer. If you
- want $1 to match only the "123" part, then you need to use something like:
- <pre>
-"0*([1-9][0-9]*)"
-</pre>
- as the expression.
- Q. Why don't character ranges work properly (POSIX mode
- only)? 
- 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", [A-Z] would match the single character 't' for
- example, which is not what 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 compile time flag.
- However if you set a non-default compile time flag - for 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 "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 on any of the
- functions? What exceptions can the library throw?
- 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::bad_expression 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.
- 
- <hr>
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
-  2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/format_boost_syntax.html
==============================================================================
--- trunk/libs/regex/doc/format_boost_syntax.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,163 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Boost-Extended Format String Syntax</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Boost-Extended Format String Syntax</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- Boost-Extended format strings treat all characters as literals except for
- '$', '\', '(', ')', '?', ':' and '\'.
- <H4>Grouping</H4>
- The characters '(' and ')' perform lexical grouping, use $ and $ if you want
- a to output literal parenthesis.
- <H4>Conditionals</H4>
- The character '?' begins a conditional expression, the general form is:
- <PRE>?Ntrue-expression:false-expression</PRE>
- where N is decimal digit.
- If sub-expression N was matched, then true-expression is evaluated and
- sent to output, otherwise false-expression is evaluated and sent to output.
- You will normally need to surround a conditional-expression with parenthesis in
- order to prevent ambiguities.
- <H4>Placeholder Sequences</H4>
- Placeholder sequences specify that some part of what matched the regular
- expression should be sent to output as follows:
- 
- <TABLE id="Table2" cellSpacing="4" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>Placeholder</TD>
- <TD>Meaning</TD>
- </TR>
- <TR>
- <TD>$&</TD>
- <TD>Outputs what matched the whole expression.</TD>
- </TR>
- <TR>
- <TD>$`</TD>
- <TD>Outputs the text between the end of the last match found (or the start of the
- text if no previous match was found), and the start of the current match.</TD>
- </TR>
- <TR>
- <TD>$'</TD>
- <TD>Outputs all the text following the end of the current match.</TD>
- </TR>
- <TR>
- <TD>$$</TD>
- <TD>Outputs a literal '$'</TD>
- </TR>
- <TR>
- <TD>$n</TD>
- <TD>Outputs what matched the n'th sub-expression.</TD>
- </TR>
- </TABLE>
- 
- Any $-placeholder sequence not listed above, results in '$' being treated as a
- literal.
- <H4>Escape Sequences</H4>
- An escape character followed by any character x, outputs that
- character unless x is one of the escape sequences shown below.
- 
- <TABLE id="Table3" cellSpacing="4" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>Escape</TD>
- <TD>Meaning</TD>
- </TR>
- <TR>
- <TD>\a</TD>
- <TD>Outputs the bell character: '\a'.</TD>
- </TR>
- <TR>
- <TD>\e</TD>
- <TD>Outputs the ANSI escape character (code point 27).</TD>
- </TR>
- <TR>
- <TD>\f</TD>
- <TD>Outputs a form feed character: '\f'</TD>
- </TR>
- <TR>
- <TD>\n</TD>
- <TD>Outputs a newline character: '\n'.</TD>
- </TR>
- <TR>
- <TD>\r</TD>
- <TD>Outputs a carriage return character: '\r'.</TD>
- </TR>
- <TR>
- <TD>\t</TD>
- <TD>Outputs a tab character: '\t'.</TD>
- </TR>
- <TR>
- <TD>\v</TD>
- <TD>Outputs a vertical tab character: '\v'.</TD>
- </TR>
- <TR>
- <TD>\xDD</TD>
- <TD>Outputs the character whose hexadecimal code point is 0xDD</TD>
- </TR>
- <TR>
- <TD>\x{DDDD}</TD>
- <TD>Outputs the character whose hexadecimal code point is 0xDDDDD</TD>
- </TR>
- <TR>
- <TD>\cX</TD>
- <TD>Outputs the ANSI escape sequence "escape-X".</TD>
- </TR>
- <TR>
- <TD>\D</TD>
- <TD>If D is a decimal digit in the range 1-9, then outputs the text that
- matched sub-expression D.</TD>
- </TR>
- <TR>
- <TD>\l</TD>
- <TD>Causes the next character to be outputted, to be output in lower case.</TD>
- </TR>
- <TR>
- <TD>\u</TD>
- <TD>Causes the next character to be outputted, to be output in upper case.</TD>
- </TR>
- <TR>
- <TD>\L</TD>
- <TD>Causes all subsequent characters to be output in lower case, until a \E is
- found.</TD>
- </TR>
- <TR>
- <TD>\U</TD>
- <TD>Causes all subsequent characters to be output in upper case, until a \E is
- found.</TD>
- </TR>
- <TR>
- <TD>\E</TD>
- <TD>Terminates a \L or \U sequence.</TD>
- </TR>
- </TABLE>
- 
- 
- <HR>
- 
- 
- Revised
- 
- 24 Nov 2004
- 
- © Copyright John Maddock 2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/format_perl_syntax.html
==============================================================================
--- trunk/libs/regex/doc/format_perl_syntax.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,150 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Perl-Style Format String Syntax</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Perl-Style Format String Syntax</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- Perl-style format strings treat all characters as literals except '$' and '\'
- which start placeholder and escape sequences respectively.
- Placeholder sequences specify that some part of what matched the regular
- expression should be sent to output as follows:
- 
- <TABLE id="Table2" cellSpacing="4" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>Placeholder</TD>
- <TD>Meaning</TD>
- </TR>
- <TR>
- <TD>$&</TD>
- <TD>Outputs what matched the whole expression.</TD>
- </TR>
- <TR>
- <TD>$`</TD>
- <TD>Outputs the text between the end of the last match found (or the start of the
- text if no previous match was found), and the start of the current match.</TD>
- </TR>
- <TR>
- <TD>$'</TD>
- <TD>Outputs all the text following the end of the current match.</TD>
- </TR>
- <TR>
- <TD>$$</TD>
- <TD>Outputs a literal '$'</TD>
- </TR>
- <TR>
- <TD>$n</TD>
- <TD>Outputs what matched the n'th sub-expression.</TD>
- </TR>
- </TABLE>
- 
- Any $-placeholder sequence not listed above, results in '$' being treated as a
- literal.
- An escape character followed by any character x, outputs that
- character unless x is one of the escape sequences shown below.
- 
- <TABLE id="Table3" cellSpacing="4" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>Escape</TD>
- <TD>Meaning</TD>
- </TR>
- <TR>
- <TD>\a</TD>
- <TD>Outputs the bell character: '\a'.</TD>
- </TR>
- <TR>
- <TD>\e</TD>
- <TD>Outputs the ANSI escape character (code point 27).</TD>
- </TR>
- <TR>
- <TD>\f</TD>
- <TD>Outputs a form feed character: '\f'</TD>
- </TR>
- <TR>
- <TD>\n</TD>
- <TD>Outputs a newline character: '\n'.</TD>
- </TR>
- <TR>
- <TD>\r</TD>
- <TD>Outputs a carriage return character: '\r'.</TD>
- </TR>
- <TR>
- <TD>\t</TD>
- <TD>Outputs a tab character: '\t'.</TD>
- </TR>
- <TR>
- <TD>\v</TD>
- <TD>Outputs a vertical tab character: '\v'.</TD>
- </TR>
- <TR>
- <TD>\xDD</TD>
- <TD>Outputs the character whose hexadecimal code point is 0xDD</TD>
- </TR>
- <TR>
- <TD>\x{DDDD}</TD>
- <TD>Outputs the character whose hexadecimal code point is 0xDDDDD</TD>
- </TR>
- <TR>
- <TD>\cX</TD>
- <TD>Outputs the ANSI escape sequence "escape-X".</TD>
- </TR>
- <TR>
- <TD>\D</TD>
- <TD>If D is a decimal digit in the range 1-9, then outputs the text that
- matched sub-expression D.</TD>
- </TR>
- <TR>
- <TD>\l</TD>
- <TD>Causes the next character to be outputted, to be output in lower case.</TD>
- </TR>
- <TR>
- <TD>\u</TD>
- <TD>Causes the next character to be outputted, to be output in upper case.</TD>
- </TR>
- <TR>
- <TD>\L</TD>
- <TD>Causes all subsequent characters to be output in lower case, until a \E is
- found.</TD>
- </TR>
- <TR>
- <TD>\U</TD>
- <TD>Causes all subsequent characters to be output in upper case, until a \E is
- found.</TD>
- </TR>
- <TR>
- <TD>\E</TD>
- <TD>Terminates a \L or \U sequence.</TD>
- </TR>
- </TABLE>
- 
- 
- <HR>
- 
- 
- Revised
- 
- 24 Nov 2004
- 
- © Copyright John Maddock 2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/format_sed_syntax.html
==============================================================================
--- trunk/libs/regex/doc/format_sed_syntax.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,109 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Sed-Style Format String Syntax</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Sed-Style Format String Syntax</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- Sed-style format strings treat all characters as literals except:
- 
- <TABLE id="Table2" cellSpacing="4" cellPadding="3" width="100%" border="0">
- <TR>
- <TD>&</TD>
- <TD>The ampersand character is replaced in the output stream by the the whole of
- what matched the regular expression.  Use \& to output a literal
- '&' character.</TD>
- </TR>
- <TR>
- <TD>\</TD>
- <TD>Specifies an escape sequence.</TD>
- </TR>
- </TABLE>
- 
- 
- An escape character followed by any character x, outputs that
- character unless x is one of the escape sequences shown below.
- 
- <TABLE id="Table3" cellSpacing="4" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>Escape</TD>
- <TD>Meaning</TD>
- </TR>
- <TR>
- <TD>\a</TD>
- <TD>Outputs the bell character: '\a'.</TD>
- </TR>
- <TR>
- <TD>\e</TD>
- <TD>Outputs the ANSI escape character (code point 27).</TD>
- </TR>
- <TR>
- <TD>\f</TD>
- <TD>Outputs a form feed character: '\f'</TD>
- </TR>
- <TR>
- <TD>\n</TD>
- <TD>Outputs a newline character: '\n'.</TD>
- </TR>
- <TR>
- <TD>\r</TD>
- <TD>Outputs a carriage return character: '\r'.</TD>
- </TR>
- <TR>
- <TD>\t</TD>
- <TD>Outputs a tab character: '\t'.</TD>
- </TR>
- <TR>
- <TD>\v</TD>
- <TD>Outputs a vertical tab character: '\v'.</TD>
- </TR>
- <TR>
- <TD>\xDD</TD>
- <TD>Outputs the character whose hexadecimal code point is 0xDD</TD>
- </TR>
- <TR>
- <TD>\x{DDDD}</TD>
- <TD>Outputs the character whose hexadecimal code point is 0xDDDDD</TD>
- </TR>
- <TR>
- <TD>\cX</TD>
- <TD>Outputs the ANSI escape sequence "escape-X".</TD>
- </TR>
- <TR>
- <TD>\D</TD>
- <TD>If D is a decimal digit in the range 1-9, then outputs the text that
- matched sub-expression D.</TD>
- </TR>
- </TABLE>
- 
- 
- <HR>
- 
- 
- Revised
- 
- 24 Nov 2004
- 
- © Copyright John Maddock 2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/format_syntax.html
==============================================================================
--- trunk/libs/regex/doc/format_syntax.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,52 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Format String Syntax</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">Format String Syntax</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- 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.
- Alternatively, when the flag <code>format_literal</code> is passed to one of these
- functions, then the format string is treated as a string literal, and is copied
- unchanged to the output.
- Sed Style Format Strings 
- Perl Style Format Strings 
- Boost-Extended Format Strings
- 
- <hr>
- Revised
- 
- 24 Nov 2004
- 
- © Copyright John Maddock 1998-
- 
- 2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/gcc-performance.html
==============================================================================
--- trunk/libs/regex/doc/gcc-performance.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,543 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 3.2//EN">
-<html>
- <head>
- <title>Regular Expression Performance Comparison (gcc 3.2)</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
- <META content="C:\PROGRAM FILES\MICROSOFT OFFICE\OFFICE\html.dot" name="Template">
- <meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
- </head>
- <body bgcolor="#ffffff" link="#0000ff" vlink="#800080">
- <h2>Regular Expression Performance Comparison</h2>
- The following tables provide comparisons between the following regular
- expression libraries:
- The Boost regex library.
- The GNU regular expression library.
- Philip Hazel's PCRE library.
- <h3>Details</h3>
- Machine: Intel Pentium 4 2.8GHz PC.
- Compiler: GNU C++ version 3.2 20020927 (prerelease).
- C++ Standard Library: GNU libstdc++ version 20020927.
- OS: Cygwin.
- Boost version: 1.31.0.
- PCRE version: 4.1.
- As ever care should be taken in interpreting the results, only sensible regular
- expressions (rather than pathological cases) are given, most are taken from the
- Boost regex examples, or from the <a href="http://www.regxlib.com/">Library of
- Regular Expressions</a>. In addition, some variation in the relative
- performance of these libraries can be expected on other machines - as memory
- access and processor caching effects can be quite large for most finite state
- machine algorithms. In each case the first figure given is the relative time
- taken (so a value of 1.0 is as good as it gets), while the second figure is the
- actual time taken.
- <h3>Averages</h3>
- The following are the average relative scores for all the tests: the perfect
- regular expression library would score 1, in practice anything less than 2
- is pretty good.
- <table border="1" cellspacing="1">
- <tr>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td>1.4503</td>
- <td>1.49124</td>
- <td>108.372</td>
- <td>1.56255</td>
- </tr>
- </table>
- 
- 
- <h3>Comparison 1: Long Search</h3>
- For each of the following regular expressions the time taken to find all
- occurrences of the expression within a long English language text was measured
- (mtent12.txt
- from Project Gutenberg, 19Mb). 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>Twain</code></td>
- <td>3.49 
- (0.205s)</td>
- <td>4.09 
- (0.24s)</td>
- <td>65.2 
- (3.83s)</td>
- <td>1 
- (0.0588s)</td>
- </tr>
- <tr>
- <td><code>Huck[[:alpha:]]+</code></td>
- <td>3.86 
- (0.203s)</td>
- <td>4.52 
- (0.238s)</td>
- <td>100 
- (5.26s)</td>
- <td>1 
- (0.0526s)</td>
- </tr>
- <tr>
- <td><code>[[:alpha:]]+ing</code></td>
- <td>1.01 
- (1.23s)</td>
- <td>1 
- (1.22s)</td>
- <td>4.95 
- (6.04s)</td>
- <td>4.67 
- (5.71s)</td>
- </tr>
- <tr>
- <td><code>^[^ ]*?Twain</code></td>
- <td>1 
- (0.31s)</td>
- <td>1.05 
- (0.326s)</td>
- <td>NA</td>
- <td>3.32 
- (1.03s)</td>
- </tr>
- <tr>
- <td><code>Tom|Sawyer|Huckleberry|Finn</code></td>
- <td>1.02 
- (0.125s)</td>
- <td>1 
- (0.123s)</td>
- <td>165 
- (20.3s)</td>
- <td>1.08 
- (0.133s)</td>
- </tr>
- <tr>
- <td><code> (Tom|Sawyer|Huckleberry|Finn).{0,30}river|river.{0,30}(Tom|Sawyer|Huckleberry|Finn)</code></td>
- <td>1 
- (0.345s)</td>
- <td>1.03 
- (0.355s)</td>
- <td>NA</td>
- <td>1.71 
- (0.59s)</td>
- </tr>
- </table>
- 
- 
- <h3>Comparison 2: Medium Sized Search</h3>
- For each of the following regular expressions the time taken to find all
- occurrences of the expression within a medium sized English language text was
- measured (the first 50K from mtent12.txt). 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>Twain</code></td>
- <td>1.8 
- (0.000519s)</td>
- <td>2.14 
- (0.000616s)</td>
- <td>9.08 
- (0.00262s)</td>
- <td>1 
- (0.000289s)</td>
- </tr>
- <tr>
- <td><code>Huck[[:alpha:]]+</code></td>
- <td>3.65 
- (0.000499s)</td>
- <td>4.36 
- (0.000597s)</td>
- <td>1 
- (0.000137s)</td>
- <td>1.43 
- (0.000196s)</td>
- </tr>
- <tr>
- <td><code>[[:alpha:]]+ing</code></td>
- <td>1 
- (0.00258s)</td>
- <td>1 
- (0.00258s)</td>
- <td>5.28 
- (0.0136s)</td>
- <td>5.63 
- (0.0145s)</td>
- </tr>
- <tr>
- <td><code>^[^ ]*?Twain</code></td>
- <td>1 
- (0.000929s)</td>
- <td>1.03 
- (0.000957s)</td>
- <td>NA</td>
- <td>2.82 
- (0.00262s)</td>
- </tr>
- <tr>
- <td><code>Tom|Sawyer|Huckleberry|Finn</code></td>
- <td>1 
- (0.000812s)</td>
- <td>1 
- (0.000812s)</td>
- <td>60.1 
- (0.0488s)</td>
- <td>1.28 
- (0.00104s)</td>
- </tr>
- <tr>
- <td><code> (Tom|Sawyer|Huckleberry|Finn).{0,30}river|river.{0,30}(Tom|Sawyer|Huckleberry|Finn)</code></td>
- <td>1.02 
- (0.00178s)</td>
- <td>1 
- (0.00174s)</td>
- <td>242 
- (0.421s)</td>
- <td>1.3 
- (0.00227s)</td>
- </tr>
- </table>
- 
- 
- <h3>Comparison 3: C++ Code Search</h3>
- For each of the following regular expressions the time taken to find all
- occurrences of the expression within the C++ source file <a href="../../../boost/crc.hpp">
- boost/crc.hpp</a> was measured. 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code> ^(template[[:space:]]*<[^;:{]+>[[:space:]]*)?(class|struct)[[:space:]]*(\<\w+\>([
- ]*$[^)]*$)?[[:space:]]*)*(\<\w*\>)[[:space:]]*(<[^;:{]+>[[:space:]]*)?(\{|:[^;\{()]*\{)</code></td>
- <td>1.04 
- (0.000144s)</td>
- <td>1 
- (0.000139s)</td>
- <td>862 
- (0.12s)</td>
- <td>4.56 
- (0.000636s)</td>
- </tr>
- <tr>
- <td><code>(^[
- ]*#(?:[^\\\n]|\\[^\n_[:punct:][:alnum:]]*[\n[:punct:][:word:]])*)|(//[^\n]*|/\*.*?\*/)|\<([+-]?(?:(?:0x[[:xdigit:]]+)|(?:(?:[[:digit:]]*\.)?[[:digit:]]+(?:[eE][+-]?[[:digit:]]+)?))u?(?:(?:int(?:8|16|32|64))|L)?)\>|('(?:[^\\']|\\.)*'|"(?:[^\\"]|\\.)*")|\<(__asm|__cdecl|__declspec|__export|__far16|__fastcall|__fortran|__import|__pascal|__rtti|__stdcall|_asm|_cdecl|__except|_export|_far16|_fastcall|__finally|_fortran|_import|_pascal|_stdcall|__thread|__try|asm|auto|bool|break|case|catch|cdecl|char|class|const|const_cast|continue|default|delete|do|double|dynamic_cast|else|enum|explicit|extern|false|float|for|friend|goto|if|inline|int|long|mutable|namespace|new|operator|pascal|private|protected|public|register|reinterpret_cast|return|short|signed|sizeof|static|static_cast|struct|switch|template|this|throw|true|try|typedef|typeid|typename|union|unsigned|using|virtual|void|volatile|wchar_t|while)\></code></td>
- <td>1 
- (0.0139s)</td>
- <td>1.01 
- (0.0141s)</td>
- <td>NA</td>
- <td>1.55 
- (0.0216s)</td>
- </tr>
- <tr>
- <td><code>^[ ]*#[ ]*include[ ]+("[^"]+"|<[^>]+>)</code></td>
- <td>1.04 
- (0.000332s)</td>
- <td>1 
- (0.000318s)</td>
- <td>130 
- (0.0413s)</td>
- <td>1.72 
- (0.000547s)</td>
- </tr>
- <tr>
- <td><code>^[ ]*#[ ]*include[ ]+("boost/[^"]+"|<boost/[^>]+>)</code></td>
- <td>1.02 
- (0.000323s)</td>
- <td>1 
- (0.000318s)</td>
- <td>150 
- (0.0476s)</td>
- <td>1.72 
- (0.000547s)</td>
- </tr>
- </table>
- 
- <h3></h3>
- <H3>Comparison 4: HTML Document Search
- </H3>
- For each of the following regular expressions the time taken to find all
- occurrences of the expression within the html file libs/libraries.htm
- was measured. 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>beman|john|dave</code></td>
- <td>1.03 
- (0.000367s)</td>
- <td>1 
- (0.000357s)</td>
- <td>47.4 
- (0.0169s)</td>
- <td>1.16 
- (0.000416s)</td>
- </tr>
- <tr>
- <td><code>.*?</code></td>
- <td>1.25 
- (0.000459s)</td>
- <td>1 
- (0.000367s)</td>
- <td>NA</td>
- <td>1.03 
- (0.000376s)</td>
- </tr>
- <tr>
- <td><code> <a[^>]+href=("[^"]*"|[^[:space:]]+)[^>]*></code></td>
- <td>1 
- (0.000509s)</td>
- <td>1.02 
- (0.000518s)</td>
- <td>305 
- (0.155s)</td>
- <td>1.1 
- (0.000558s)</td>
- </tr>
- <tr>
- <td><code> <h[12345678][^>]*>.*?</h[12345678]></code></td>
- <td>1.04 
- (0.00025s)</td>
- <td>1 
- (0.00024s)</td>
- <td>NA</td>
- <td>1.16 
- (0.000279s)</td>
- </tr>
- <tr>
- <td><code> <img[^>]+src=("[^"]*"|[^[:space:]]+)[^>]*></code></td>
- <td>2.22 
- (0.000489s)</td>
- <td>1.69 
- (0.000372s)</td>
- <td>148 
- (0.0326s)</td>
- <td>1 
- (0.00022s)</td>
- </tr>
- <tr>
- <td><code> <font[^>]+face=("[^"]*"|[^[:space:]]+)[^>]*>.*?</code></td>
- <td>1.71 
- (0.000371s)</td>
- <td>1.75 
- (0.000381s)</td>
- <td>NA</td>
- <td>1 
- (0.000218s)</td>
- </tr>
- </table>
- 
- 
- <h3>Comparison 3: Simple Matches</h3>
- For each of the following regular expressions the time taken to match against
- the text indicated was measured. 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>Text</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>abc</code></td>
- <td>abc</td>
- <td>1.36 
- (2.15e-07s)</td>
- <td>1.36 
- (2.15e-07s)</td>
- <td>2.76 
- (4.34e-07s)</td>
- <td>1 
- (1.58e-07s)</td>
- </tr>
- <tr>
- <td><code>^([0-9]+)(\-| |$)(.*)$</code></td>
- <td>100- this is a line of ftp response which contains a message string</td>
- <td>1.55 
- (7.26e-07s)</td>
- <td>1.51 
- (7.07e-07s)</td>
- <td>319 
- (0.000149s)</td>
- <td>1 
- (4.67e-07s)</td>
- </tr>
- <tr>
- <td><code>([[:digit:]]{4}[- ]){3}[[:digit:]]{3,4}</code></td>
- <td>1234-5678-1234-456</td>
- <td>1.96 
- (9.54e-07s)</td>
- <td>1.96 
- (9.54e-07s)</td>
- <td>44.5 
- (2.17e-05s)</td>
- <td>1 
- (4.87e-07s)</td>
- </tr>
- <tr>
- <td><code> ^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$</code></td>
- <td>john_at_[hidden]</td>
- <td>1.22 
- (1.51e-06s)</td>
- <td>1.23 
- (1.53e-06s)</td>
- <td>162 
- (0.000201s)</td>
- <td>1 
- (1.24e-06s)</td>
- </tr>
- <tr>
- <td><code> ^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$</code></td>
- <td>foo12_at_[hidden]</td>
- <td>1.28 
- (1.47e-06s)</td>
- <td>1.3 
- (1.49e-06s)</td>
- <td>104 
- (0.00012s)</td>
- <td>1 
- (1.15e-06s)</td>
- </tr>
- <tr>
- <td><code> ^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$</code></td>
- <td>bob.smith_at_[hidden]</td>
- <td>1.28 
- (1.47e-06s)</td>
- <td>1.3 
- (1.49e-06s)</td>
- <td>113 
- (0.00013s)</td>
- <td>1 
- (1.15e-06s)</td>
- </tr>
- <tr>
- <td><code>^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code></td>
- <td>EH10 2QQ</td>
- <td>1.38 
- (4.68e-07s)</td>
- <td>1.41 
- (4.77e-07s)</td>
- <td>13.5 
- (4.59e-06s)</td>
- <td>1 
- (3.39e-07s)</td>
- </tr>
- <tr>
- <td><code>^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code></td>
- <td>G1 1AA</td>
- <td>1.28 
- (4.35e-07s)</td>
- <td>1.25 
- (4.25e-07s)</td>
- <td>11.7 
- (3.97e-06s)</td>
- <td>1 
- (3.39e-07s)</td>
- </tr>
- <tr>
- <td><code>^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code></td>
- <td>SW1 1ZZ</td>
- <td>1.32 
- (4.53e-07s)</td>
- <td>1.31 
- (4.49e-07s)</td>
- <td>12.2 
- (4.2e-06s)</td>
- <td>1 
- (3.44e-07s)</td>
- </tr>
- <tr>
- <td><code> ^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code></td>
- <td>4/1/2001</td>
- <td>1.16 
- (3.82e-07s)</td>
- <td>1.2 
- (3.96e-07s)</td>
- <td>13.9 
- (4.59e-06s)</td>
- <td>1 
- (3.29e-07s)</td>
- </tr>
- <tr>
- <td><code> ^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code></td>
- <td>12/12/2001</td>
- <td>1.38 
- (4.49e-07s)</td>
- <td>1.38 
- (4.49e-07s)</td>
- <td>16 
- (5.2e-06s)</td>
- <td>1 
- (3.25e-07s)</td>
- </tr>
- <tr>
- <td><code>^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code></td>
- <td>123</td>
- <td>1.19 
- (7.64e-07s)</td>
- <td>1.16 
- (7.45e-07s)</td>
- <td>7.51 
- (4.81e-06s)</td>
- <td>1 
- (6.4e-07s)</td>
- </tr>
- <tr>
- <td><code>^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code></td>
- <td>+3.14159</td>
- <td>1.32 
- (8.97e-07s)</td>
- <td>1.31 
- (8.88e-07s)</td>
- <td>14 
- (9.48e-06s)</td>
- <td>1 
- (6.78e-07s)</td>
- </tr>
- <tr>
- <td><code>^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code></td>
- <td>-3.14159</td>
- <td>1.32 
- (8.97e-07s)</td>
- <td>1.31 
- (8.88e-07s)</td>
- <td>14 
- (9.48e-06s)</td>
- <td>1 
- (6.78e-07s)</td>
- </tr>
- </table>
- 
- 
- <hr>
- © Copyright John Maddock 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/headers.html
==============================================================================
--- trunk/libs/regex/doc/headers.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,48 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Headers</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Headers</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- 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
- boost::basic_regex, but otherwise does not need the full definitions.
- 
- <HR>
- 
- Revised 
- 
- 28 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/history.html
==============================================================================
--- trunk/libs/regex/doc/history.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,177 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: History</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">History</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- Boost 1.34
- <UL>
- <LI>
- Fix for non-greedy repeats and partial matches not working correctly in some
- cases.
- <LI>
- Fix for non-greedy repeats on VC++ not working in some cases (bug report
- 1515830).
- <LI>
- Changed match_results::position() to return a valid result when *this
- represents a partial match.</LI>
- </UL>
- Boost 1.33.1
- <UL>
- <LI>
- Fixed broken makefiles.
- <LI>
- Fixed configuration setup to allow building with VC7.1 - STLport-4.6.2 when
- using /Zc:wchar_t.
- <LI>
- Moved declarations class-inline in static_mutex.hpp so that SGI Irix compiler
- can cope.
- <LI>
- Added needed standard library #includes to fileiter.hpp, regex_workaround.hpp
- and cpp_regex_traits.hpp.
- <LI>
- Fixed a bug where non-greedy repeats could in certain strange curcumstances
- repeat more times than their maximum value.
- <LI>
- Fixed the value returned by basic_regex<>::empty() from a default
- constructed object.
- <LI>
- Changed the deffinition of regex_error to make it backwards compatible with
- Boost-1.32.0.
- <LI>
- Disabled external templates for Intel C++ 8.0 and earlier - otherwise
- unresolved references can occur.
- <LI>
- Rewritten extern template code for gcc so that only specific member functions
- are exported: otherwise strange unresolved references can occur when linking
- and mixing debug and non-debug code.
- <LI>
- Initialise all the data members of the unicode_iterators: this keeps gcc from
- issuing needless warnings.
- <LI>
- Ported the ICU integration code to VC6 and VC7.
- <LI>
- Ensured code is STLport debug mode clean.
- <LI>
- Fixed lookbehind assertions so that fixed length repeats are permitted, and so
- that regex iteration allows lookbehind to look back before the current search
- range (into the last match).
- <LI>
- Fixed strange bug with non-greedy repeats inside forward lookahead assertions.
- <LI>
- Enabled negated character classes inside character sets.
- <LI>
- Fixed regression so that [a-z-] is a valid expression again.
- <LI>
- Fixed bug that allowed some invalid expressions to be accepted.</LI></UL>
- Boost 1.33.0.
- <UL>
- <LI>
- Completely rewritten expression parsing code, and traits class support; now
- conforms to the standardization proposal.
- <LI>
- Breaking Change: The <A href="syntax_option_type.html">syntax
- options</A> that can be passed to <A href="basic_regex.html">basic_regex
- constructors</A> have been rationalized.  The default option (perl) now
- has a value of zero, and it is now clearly documented which options apply to
- which <A href="syntax.html">regular expression syntax styles (perl,
- POSIX-extended, POSIX-basic etc)</A>.  Some of the more esoteric
- options have now been removed, so there is the possibility that existing code
- may fail to compile: however equivalent functionality should still be
- available.
- <LI>
- Breaking Change: 
- POSIX-extended and POSIX-basic regular expressions now enforce the letter of
- the POSIX standard much more closely than before.
- <LI>
- Added support for (?imsx-imsx) constructs.
- <LI>
- Added <A href="syntax_perl.html#Perl">support for lookbehind expressions
- (?<=positive-lookbehind) and (?<!negative-lookbehind)</A>.
- <LI>
- Added <A href="syntax_perl.html#Perl">support for conditional expressions
- (?(assertion)true-expresion|false-expression)</A>.
- <LI>
- Added MFC/ATL string wrappers.
- <LI>
- Added Unicode support; based on ICU.
- <LI>
- Changed newline support to recognise \f as a line separator (all character
- types), and \x85 as a line separator for wide characters / Unicode only.
- <LI>
- Added a new format flag format_literal
- that treats the replace string as a literal, rather than a Perl or Sed style <A href="format_syntax.html">
- format string</A>.
- <LI>
- Errors are now reported by throwing exceptions of type <A href="bad_expression.html">
- <code>regex_error</code></A>. The types used previously - <code>bad_expression</code>
- and <code>bad_pattern</code> - are now just typedefs for <code>regex_error</code>.
- Type <code>regex_error</code> has a couple of new members: <code>code()</code> to
- report an error code rather than a string, and <code>position()</code> to
- report where in the expression the error occured.</LI></UL>
- Boost 1.32.1.
- <UL>
- <LI>
- Fixed bug in partial matches of bounded repeats of '.'.</LI></UL>
- Boost 1.31.0.
- <UL>
- <LI>
- Completely rewritten pattern matching code - it is now up to 10 times faster
- than before.
- <LI>
- Reorganized documentation.
- <LI>
- Deprecated all interfaces that are not part of the <A href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1429.htm">
- regular expression standardization proposal</A>.
- <LI>
- Added regex_iterator and <A href="regex_token_iterator.html">
- regex_token_iterator</A>
- .
- <LI>
- Added support for Perl style independent sub-expressions.
- <LI>
- Added non-member operators to the sub_match class,
- so that you can compare sub_match's with strings, or add them to a string to
- produce a new string.
- <LI>
- Added experimental support for <A href="captures.html">extended capture
- information</A>.
- <LI>
- Changed the match flags so that they are a distinct type (not an integer), if
- you try to pass the match flags as an integer rather than<A href="match_flag_type.html">
- match_flag_type</A> to the regex algorithms then you will now get a compiler
- error.</LI></UL>
- 
- <HR>
- 
- Revised 
- 
- 28 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/icu_strings.html
==============================================================================
--- trunk/libs/regex/doc/icu_strings.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,468 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Working With Unicode and ICU String Types</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Working With Unicode and ICU String Types.</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- <H3>Contents</H3>
- <dl class="index">
- <dt>Introduction</dt>
- <dt>Unicode regular expression types</dt>
- <dt>Regular Expression Algorithms
- <dd>
- <dl class="index">
- <dt>u32regex_match</dt>
- <dt>u32regex_search</dt>
- <dt>u32regex_replace</dt>
- </dl>
- </dd>
- </dt>
- <dt>Iterators
- <dd>
- <dl class="index">
- <dt>u32regex_iterator</dt>
- <dt>u32regex_token_iterator</dt>
- </dl>
- </dd>
- </dt>
- </dl>
- <H3><A name="introduction"></A>Introduction</H3>
- The header:
- <PRE><boost/regex/icu.hpp></PRE>
- contains the data types and algorithms necessary for working with regular
- expressions in a Unicode aware environment. 
- 
- In order to use this header you will need <A href="http://www.ibm.com/software/globalization/icu/">
- the ICU library</A>, and you will need to have built the Boost.Regex library
- with ICU support enabled.
- The header will enable you to:
- <UL>
- <LI>
- Create regular expressions that treat Unicode strings as sequences of UTF-32
- code points.
- <LI>
- Create regular expressions that support various Unicode data properties,
- including character classification.
- <LI>
- Transparently search Unicode strings that are encoded as either UTF-8, UTF-16
- or UTF-32.</LI></UL>
- <H3><A name="types"></A>Unicode regular expression types</H3>
- Header <boost/regex/icu.hpp> provides a regular expression traits
- class that handles UTF-32 characters:
- <PRE>class icu_regex_traits;</PRE>
- and a regular expression type based upon that:
- <PRE>typedef basic_regex<UChar32,icu_regex_traits> u32regex;</PRE>
- 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 <A href="basic_regex.html#a1">
- assign</A> member functions of u32regex, require UTF-32 encoded strings, but
- there are a series of overloaded algorithms called make_u32regex which allow
- regular expressions to be created from UTF-8, UTF-16, or UTF-32 encoded
- strings:
- <PRE>template <class InputIterator>
-u32regex make_u32regex(InputIterator i, InputIterator j, boost::regex_constants::syntax_option_type opt);
-</PRE>
- Effects: Creates a regular expression object from the iterator
- sequence [i,j). The character encoding of the sequence is determined based upon <code>
- sizeof(*i)</code>: 1 implies UTF-8, 2 implies UTF-16, and 4 implies UTF-32.
- <PRE>u32regex make_u32regex(const char* p, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl);
-</PRE>
- Effects: Creates a regular expression object from the
- Null-terminated UTF-8 characater sequence p.
- <PRE>u32regex make_u32regex(const unsigned char* p, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl);</PRE>
- Effects: Creates a regular expression object from the
- Null-terminated UTF-8 characater sequence p.u32regex
- make_u32regex(const wchar_t* p, boost::regex_constants::syntax_option_type opt
- = boost::regex_constants::perl);
- Effects: Creates a regular expression object from the
- Null-terminated characater sequence p.  The character encoding of
- the sequence is determined based upon <CODE>sizeof(wchar_t)</CODE>: 1 implies
- UTF-8, 2 implies UTF-16, and 4 implies UTF-32.
- <PRE>u32regex make_u32regex(const UChar* p, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl);</PRE>
- Effects: Creates a regular expression object from the
- Null-terminated UTF-16 characater sequence p.
- <PRE>template<class C, class T, class A>
-u32regex make_u32regex(const std::basic_string<C, T, A>& s, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl);</PRE>
- Effects: Creates a regular expression object from the string s. 
- The character encoding of the string is determined based upon <CODE>sizeof(C)</CODE>:
- 1 implies UTF-8, 2 implies UTF-16, and 4 implies UTF-32.
- <PRE>u32regex make_u32regex(const UnicodeString& s, boost::regex_constants::syntax_option_type opt = boost::regex_constants::perl);</PRE>
- Effects: Creates a regular expression object from the UTF-16
- encoding string s.
- <H3><A name="algo"></A>Regular Expression Algorithms</H3>
- The regular expression algorithms regex_match, <A href="regex_search.html">
- regex_search</A> 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 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.
- <H4><A name="u32regex_match"></A>u32regex_match</H4>
- 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.
- Example: match a password, encoded in a UTF-16 UnicodeString:
- <PRE>//
-// Find out if *password* meets our password requirements,
-// as defined by the regular expression *requirements*.
-//
-bool is_valid_password(const UnicodeString& password, const UnicodeString& requirements)
-{
- return boost::u32regex_match(password, boost::make_u32regex(requirements));
-}
-</PRE>
- 
- Example: match a UTF-8 encoded filename:
- <PRE>//
-// Extract filename part of a path from a UTF-8 encoded std::string and return the result
-// as another std::string:
-//
-std::string get_filename(const std::string& path)
-{
- boost::u32regex r = boost::make_u32regex("(?:\\A|.*\\\\)([^\\\\]+)");
- boost::smatch what;
- if(boost::u32regex_match(path, what, r))
- {
- // extract $1 as a CString:
- return what.str(1);
- }
- else
- {
- throw std::runtime_error("Invalid pathname");
- }
-}
-</PRE>
- <H4><A name="u32regex_search"></A>u32regex_search</H4>
- 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.
- Example: search for a character sequence in a specific
- language block:
- 
- <PRE>UnicodeString extract_greek(const UnicodeString& text)
-{
- // searches through some UTF-16 encoded text for a block encoded in Greek,
- // this expression is imperfect, but the best we can do for now - searching
- // for specific scripts is actually pretty hard to do right.
- //
- // Here we search for a character sequence that begins with a Greek letter,
- // and continues with characters that are either not-letters ( [^[:L*:]] )
- // or are characters in the Greek character block ( [\\x{370}-\\x{3FF}] ).
- //
- boost::u32regex r = boost::make_u32regex(L"[\\x{370}-\\x{3FF}](?:[^[:L*:]]|[\\x{370}-\\x{3FF}])*");
- boost::u16match what;
- if(boost::u32regex_search(text, what, r))
- {
- // extract $0 as a CString:
- return UnicodeString(what[0].first, what.length(0));
- }
- else
- {
- throw std::runtime_error("No Greek found!");
- }
-}</PRE>
- <H4><A name="u32regex_replace"></A>u32regex_replace</H4>
- 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,
- 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 example
- one can be UTF-8, the other in UTF-16), but the result string / output iterator
- argument must use the same character encoding as the text being searched.
- Example: Credit card number reformatting:
- <PRE>//
-// Take a credit card number as a string of digits,
-// and reformat it as a human readable string with "-"
-// separating each group of four digit;,
-// note that we're mixing a UTF-32 regex, with a UTF-16
-// string and a UTF-8 format specifier, and it still all
-// just works:
-//
-const boost::u32regex e = boost::make_u32regex("\\A(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})\\z");
-const char* human_format = "$1-$2-$3-$4";
-
-UnicodeString human_readable_card_number(const UnicodeString& s)
-{
- return boost::u32regex_replace(s, e, human_format);
-}</PRE>
- 
- <H2><A name="iterators"></A>Iterators</H2>
- <H3><A name="u32regex_iterator"></A>u32regex_iterator</H3>
- Type u32regex_iterator is in all respects the same as <A href="regex_iterator.html">
- regex_iterator</A> except that since the regular expression type is always
- u32regex it only takes one template parameter (the iterator type). It also
- calls u32regex_search internally, allowing it to interface correctly with
- UTF-8, UTF-16, and UTF-32 data:
- <PRE>
-template <class BidirectionalIterator>
-class u32regex_iterator
-{
- // for members see regex_iterator
-};
-
-typedef u32regex_iterator<const char*> utf8regex_iterator;
-typedef u32regex_iterator<const UChar*> utf16regex_iterator;
-typedef u32regex_iterator<const UChar32*> utf32regex_iterator;
-</PRE>
- 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:
- <PRE>
-u32regex_iterator<const char*>
- make_u32regex_iterator(const char* s,
- const u32regex& e,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_iterator<const wchar_t*>
- make_u32regex_iterator(const wchar_t* s,
- const u32regex& e,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_iterator<const UChar*>
- make_u32regex_iterator(const UChar* s,
- const u32regex& e,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class Traits, class Alloc>
-u32regex_iterator<typename std::basic_string<charT, Traits, Alloc>::const_iterator>
- make_u32regex_iterator(const std::basic_string<charT, Traits, Alloc>& s,
- const u32regex& e,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_iterator<const UChar*>
- make_u32regex_iterator(const UnicodeString& s,
- const u32regex& e,
- regex_constants::match_flag_type m = regex_constants::match_default);</PRE>
- 
- Each of these overloads returns an iterator that enumerates all occurrences of
- expression e, in text s, using match_flags m.
- Example: search for international currency symbols, along with
- their associated numeric value:
- <PRE>
-void enumerate_currencies(const std::string& text)
-{
- // enumerate and print all the currency symbols, along
- // with any associated numeric values:
- const char* re =
- "([[:Sc:]][[:Cf:][:Cc:][:Z*:]]*)?"
- "([[:Nd:]]+(?:[[:Po:]][[:Nd:]]+)?)?"
- "(?(1)"
- "|(?(2)"
- "[[:Cf:][:Cc:][:Z*:]]*"
- ")"
- "[[:Sc:]]"
- ")";
- boost::u32regex r = boost::make_u32regex(re);
- boost::u32regex_iterator<std::string::const_iterator> i(boost::make_u32regex_iterator(text, r)), j;
- while(i != j)
- {
- std::cout << (*i)[0] << std::endl;
- ++i;
- }
-}</PRE>
- 
- Calling
- 
- <PRE>enumerate_currencies(" $100.23 or £198.12 ");</PRE>
- Yields the output:
- <PRE>$100.23 £198.12</PRE>
- Provided of course that the input is encoded as UTF-8.
- <H3><A name="u32regex_token_iterator"></A>u32regex_token_iterator</H3>
- Type u32regex_token_iterator is in all respects the same as <A href="regex_token_iterator.html">
- regex_token_iterator</A> except that since the regular expression type is
- always u32regex it only takes one template parameter (the iterator type). 
- It also calls u32regex_search internally, allowing it to interface correctly
- with UTF-8, UTF-16, and UTF-32 data:
- <PRE>template <class BidirectionalIterator>
-class u32regex_token_iterator
-{
- // for members see regex_token_iterator
-};
-
-typedef u32regex_token_iterator<const char*> utf8regex_token_iterator;
-typedef u32regex_token_iterator<const UChar*> utf16regex_token_iterator;
-typedef u32regex_token_iterator<const UChar32*> utf32regex_token_iterator;
-</PRE>
- 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:
- <PRE>
-u32regex_token_iterator<const char*>
- make_u32regex_token_iterator(const char* s,
- const u32regex& e,
- int sub,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_token_iterator<const wchar_t*>
- make_u32regex_token_iterator(const wchar_t* s,
- const u32regex& e,
- int sub,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_token_iterator<const UChar*>
- make_u32regex_token_iterator(const UChar* s,
- const u32regex& e,
- int sub,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class Traits, class Alloc>
-u32regex_token_iterator<typename std::basic_string<charT, Traits, Alloc>::const_iterator>
- make_u32regex_token_iterator(const std::basic_string<charT, Traits, Alloc>& s,
- const u32regex& e,
- int sub,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_token_iterator<const UChar*>
- make_u32regex_token_iterator(const UnicodeString& s,
- const u32regex& e,
- int sub,
- regex_constants::match_flag_type m = regex_constants::match_default);</PRE>
- 
- Each of these overloads returns an iterator that enumerates all occurrences of
- marked sub-expression sub in regular expression e, found
- in text s, using match_flags m.
- <PRE>
-template <std::size_t N>
-u32regex_token_iterator<const char*>
- make_u32regex_token_iterator(const char* p,
- const u32regex& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <std::size_t N>
-u32regex_token_iterator<const wchar_t*>
- make_u32regex_token_iterator(const wchar_t* p,
- const u32regex& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <std::size_t N>
-u32regex_token_iterator<const UChar*>
- make_u32regex_token_iterator(const UChar* p,
- const u32regex& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class Traits, class Alloc, std::size_t N>
-u32regex_token_iterator<typename std::basic_string<charT, Traits, Alloc>::const_iterator>
- make_u32regex_token_iterator(const std::basic_string<charT, Traits, Alloc>& p,
- const u32regex& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <std::size_t N>
-u32regex_token_iterator<const UChar*>
- make_u32regex_token_iterator(const UnicodeString& s,
- const u32regex& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-</PRE>
- Each of these overloads returns an iterator that enumerates one sub-expression
- for each submatch in regular expression e, found in
- text s, using match_flags m.
- <PRE>
-u32regex_token_iterator<const char*>
- make_u32regex_token_iterator(const char* p,
- const u32regex& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_token_iterator<const wchar_t*>
- make_u32regex_token_iterator(const wchar_t* p,
- const u32regex& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_token_iterator<const UChar*>
- make_u32regex_token_iterator(const UChar* p,
- const u32regex& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class Traits, class Alloc>
-u32regex_token_iterator<typename std::basic_string<charT, Traits, Alloc>::const_iterator>
- make_u32regex_token_iterator(const std::basic_string<charT, Traits, Alloc>& p,
- const u32regex& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-u32regex_token_iterator<const UChar*>
- make_u32regex_token_iterator(const UnicodeString& s,
- const u32regex& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-</PRE>
- Each of these overloads returns an iterator that enumerates one sub-expression
- for each submatch in regular expression e, found in
- text s, using match_flags m.
- Example: search for international currency symbols, along with
- their associated numeric value:
- <PRE>
-void enumerate_currencies2(const std::string& text)
-{
- // enumerate and print all the currency symbols, along
- // with any associated numeric values:
- const char* re =
- "([[:Sc:]][[:Cf:][:Cc:][:Z*:]]*)?"
- "([[:Nd:]]+(?:[[:Po:]][[:Nd:]]+)?)?"
- "(?(1)"
- "|(?(2)"
- "[[:Cf:][:Cc:][:Z*:]]*"
- ")"
- "[[:Sc:]]"
- ")";
- boost::u32regex r = boost::make_u32regex(re);
- boost::u32regex_token_iterator<std::string::const_iterator>
- i(boost::make_u32regex_token_iterator(text, r, 1)), j;
- while(i != j)
- {
- std::cout << *i << std::endl;
- ++i;
- }
-}
-</PRE>
- 
- <HR>
- Revised 
- 
- 05 Jan 2005 
- 
- © Copyright John Maddock 2005
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-
-

Deleted: trunk/libs/regex/doc/implementation.html
==============================================================================
--- trunk/libs/regex/doc/implementation.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,43 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Implementation</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Implementation</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- Todo.
- 
- <HR>
- 
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/index.html
==============================================================================
--- trunk/libs/regex/doc/index.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,16 +0,0 @@
-<html>
- <head>
- <meta http-equiv="refresh" content="0; URL=html/index.html">
- </head>
- <body>
- 
- Automatic redirection failed, please go to html/index.html.
- 
- Copyright John Maddock 2001
- Distributed under the Boost Software License, Version 1.0. (See accompanying file <A href="../../LICENSE_1_0.txt">
- LICENSE_1_0.txt</A> or copy at www.boost.org/LICENSE_1_0.txt).
- </body>
-</html>
-
-
-

Deleted: trunk/libs/regex/doc/install.html
==============================================================================
--- trunk/libs/regex/doc/install.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,260 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Installation</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Installation</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 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
- you didn't do that when extracting, then you'd better stop reading this, delete
- the files you just extracted, and try again!
- 
- This library should not need configuring before use; most popular
- compilers/standard libraries/platforms are already supported "as is". If you do
- experience configuration problems, or just want to test the configuration with
- your compiler, then the process is the same as for all of boost; see the <A href="../../config/config.htm">
- configuration library documentation</A>.
- The library will encase all code inside namespace boost.
- 
- Unlike some other template libraries, this library consists of a mixture of
- template code (in the headers) and static code and data (in cpp files).
- Consequently 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:
- 
- <H3><A name="bjam"></A>Building with bjam</H3>
- This is now the preferred method for building and installing this library,
- please refer to the <A href="../../../more/getting_started.html">getting started
- guide</A> for more information.
- <H3><A name="unicode"></A>Building With Unicode and ICU Support</H3>
- A default build of this library does not enable <A href="unicode.html">Unciode
- support</A> via ICU.  There is no need to enable this support if you
- don't need it, but if you use ICU for your Unicode support already, and want to
- work with Unicode-aware regular expressions then read on.
- Most of the information you will need is in the <A href="../../../more/getting_started.html">
- getting started guide</A>, the only additional step you need to take is to
- tell bjam that you want Boost.Regex to use ICU and optionally to tell bjam
- where ICU is located.
- If you're building on a Unix-like platform, and ICU is already installed in
- you're 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:
- <PRE>bjam -sHAVE_ICU=1 --toolset=toolset-name install</PRE>
- If ICU is not already in your compilers path then you need to set the
- environment variable ICU_PATH to point to the route directory of your ICU
- installation, for example if ICU was installed to /usr/local/icu/3.3 you might
- use:
- <PRE>bjam -sICU_PATH=/usr/local/icu/3.3 --toolset=toolset-name install</PRE>
- Note that ICU is a C++ library just like Boost is, as such your copy of ICU
- must have been built with the same C++ compiler (and compiler version) that you
- are using to build Boost.  Boost.Regex will not work correctly unless
- you 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.
- <H2><A name="make"></A>Building via makefiles</H2>
- <H3><A name="bcb"></A>Borland C++ Builder:
- </H3>
- <UL>
- <LI>
- Open up a console window and change to the <boost>\libs\regex\build
- directory.
- <LI>
- Select the appropriate makefile (bcb4.mak for C++ Builder 4, bcb5.mak for C++
- Builder 5, and bcb6.mak for C++ Builder 6).
- <LI>
- Invoke the makefile (pass the full path to your version of make if you have
- more than one version installed, the makefile relies on the path to make to
- obtain your C++ Builder installation directory and tools) for example:
- </LI>
- </UL>
- <PRE>make -fbcb5.mak</PRE>
- The build process will build a variety of .lib and .dll files (the exact number
- depends upon the version of Borland's tools you are using) the .lib and dll
- files will be in a sub-directory called bcb4 or bcb5 depending upon the
- makefile used. To install the libraries into your development system use:
- <PRE>make -fbcb5.mak install</PRE>
- 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.
- 
- You may also remove temporary files created during the build process (excluding
- lib and dll files) by using:
- <PRE>make -fbcb5.mak clean</PRE>
- Finally when you use 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: the
- library can not tell the difference between VCL and non-VCL enabled builds when
- building a GUI application from the command line, if you build from the command
- line with the 5.5 command line tools then you must define the pre-processor
- symbol _NO_VCL in order to ensure that the correct link libraries are selected:
- the C++ Builder IDE normally sets this automatically. Hint, users of the 5.5
- command line tools may want to add a -D_NO_VCL to bcc32.cfg in order to set
- this option permanently.
- 
- If you would prefer to do a dynamic link to the regex libraries when using the
- dll runtime then define BOOST_REGEX_DYN_LINK (you must do this if you want to
- use boost.regex in multiple dll's), otherwise Boost.regex will be statically
- linked by default. 
- If you want to suppress automatic linking altogether (and supply your own
- custom 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 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!
- <H3><A name="vc"></A>Microsoft Visual C++ 6, 7, 7.1 and 8</H3>
- You need version 6 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 <A href="http://ourworld.compuserve.com/homepages/john_maddock/regexpp.htm">
- library</A>
- 
- 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.
- 
- Select the correct makefile - vc6.mak for "vanilla" Visual C++ 6 or
- vc6-stlport.mak if you are using STLPort.
- Invoke the makefile like this:
- <PRE>nmake -fvc6.mak</PRE>
- You will now have a collection of lib and dll files in a "vc6" subdirectory, to
- install these into your development system use:
- <PRE>nmake -fvc6.mak install</PRE>
- 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.
- You can delete all the temporary files created during the build (excluding lib
- and dll files) using:
- <PRE>nmake -fvc6.mak clean </PRE>
- If you want to build with ICU support, then you need to pass the path to your
- ICU directory to the makefile, for example with:
- 
- <PRE>nmake ICU_PATH=c:\open-source\icu -fvc71.mak install</PRE>
- Finally when you use 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.
- 
- Note that if you want to dynamically link to the regex library when using the
- dynamic C++ runtime, define BOOST_REGEX_DYN_LINK when building your project.
- If you want to add the source directly to your project then define
- BOOST_REGEX_NO_LIB to disable automatic library selection.
- There are several important caveats to remember when using boost.regex with
- Microsoft's Compiler:
- <UL>
- <LI>
- There have been some reports of compiler-optimization bugs affecting this
- library, (particularly with VC6 versions prior to service patch 5) the
- workaround is to build the library using /Oityb1 rather than /O2. That is to
- use all optimization settings except /Oa. This problem is reported to affect
- some standard library code as well (in fact I'm not sure if the problem is with
- the regex code or the underlying standard library), so it's probably worthwhile
- applying this workaround in normal practice in any case.
- <LI>
- If you have replaced the C++ standard library that comes with VC6, then when
- you build the library you must ensure that the environment variables "INCLUDE"
- and "LIB" have been updated to reflect the include and library paths for the
- new library - see vcvars32.bat (part of your Visual Studio installation) for
- more details.
- <LI>
- If you are building with the full STLPort v4.x, then use the vc6-stlport.mak
- file provided and set the environment variable STLPORT_PATH to point to the
- location of your STLPort installation (Note that the full STLPort libraries
- appear not to support single-thread static builds).
- <LI>
- If you are building your application with /Zc:wchar_t then you will need to
- modify the makefile to add /Zc:wchar_t before building the library.
- </LI>
- </UL>
- <H3><A name="gcc"></A>GCC(2.95 and 3.x)
- </H3>
- 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:
- 
- <PRE>make -fgcc.mak </PRE>
- At the end of the build process you should have a gcc sub-directory containing
- release and debug versions of the library (libboost_regex.a and
- libboost_regex_debug.a). When you build projects that use regex++, you will
- need to add the boost install directory to your list of include paths and add
- <boost>/libs/regex/build/gcc/libboost_regex.a to your list of library
- files.
- 
- There is also a makefile to build the library as a shared library:
- <PRE>make -fgcc-shared.mak</PRE>
- which will build libboost_regex.so and libboost_regex_debug.so.
- Both of the these makefiles support the following environment variables:
- ICU_PATH: tells the makefile to build with Unicode support, set to the path
- where your ICU installation is located, for example with: <code>make
- ICU_PATH=/usr/local install -fgcc.mak</code>
- CXXFLAGS: extra compiler options - note that this applies to both the debug and
- release builds.
- INCLUDES: additional include directories.
- LDFLAGS: additional linker options.
- LIBS: additional library files.
- For the more adventurous there is a configure script in
- <boost>/libs/config; see the <A href="../../config/config.htm">config
- library documentation</A>.
- <H3><A name="sun"></A>Sun Workshop 6.1</H3>
- 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 and type:
- 
- <PRE>dmake -f sunpro.mak </PRE>
- At the end of the build process you should have a sunpro sub-directory
- containing 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 regex++, you will need to add the boost install
- directory to your list of include paths and add
- <boost>/libs/regex/build/sunpro/ to your library search path.
- 
- Both of the these makefiles support the following environment variables:
- CXXFLAGS: extra compiler options - note that this applies to both the single
- and multithreaded builds.
- INCLUDES: additional include directories.
- LDFLAGS: additional linker options.
- LIBS: additional library files.
- LIBSUFFIX: a suffix to mangle the library name with (defaults to nothing).
- This makefile does not set any architecture specific options like -xarch=v9,
- you can set these by defining the appropriate macros, for example:
- <PRE>dmake CXXFLAGS="-xarch=v9" LDFLAGS="-xarch=v9" LIBSUFFIX="_v9" -f sunpro.mak</PRE>
- will build v9 variants of the regex library named libboost_regex_v9.a etc.
- <H3><A name="other"></A>Makefiles for Other compilers:
- </H3>
- 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.
- <HR>
- 
- Revised 
- 
- 09 Jan 2005 
- 
- © Copyright John Maddock 1998-
-  2005
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/introduction.html
==============================================================================
--- trunk/libs/regex/doc/introduction.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,181 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Introduction</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Introduction</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- 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 awk, and the programming language Perl, each of which make
- extensive use of regular expressions. Traditionally C++ users have been limited
- to the POSIX C API's for manipulating regular expressions, and while regex++
- does provide these API's, they do not represent the best way to use the
- library. For example regex++ can cope with wide character strings, or search
- and replace operations (in a manner analogous to either sed or Perl), something
- that traditional C libraries can not do.
- The class boost::basic_regex is the key class in
- this library; it represents a "machine readable" regular expression, and is
- very closely modeled on std::basic_string, think of it as a string plus the
- actual state-machine required by the regular expression algorithms. Like
- std::basic_string there are two typedefs that are almost always the means by
- which this class is referenced:
- <pre>namespace boost{
-
-template <class charT,
- class traits = regex_traits<charT> >
-class basic_regex;
-
-typedef basic_regex<char> regex;
-typedef basic_regex<wchar_t> wregex;
-
-}</pre>
- To see how this library can be used, imagine that we are writing a credit card
- processing application. Credit card numbers generally come as a string of
- 16-digits, separated into groups of 4-digits, and separated by either a space
- or a hyphen. Before storing a credit card number in a database (not necessarily
- something your customers will appreciate!), we may want to verify that the
- number is in the correct format. To match any digit we could use the regular
- expression [0-9], however ranges of characters like this are actually locale
- dependent. Instead we should use the POSIX standard form [[:digit:]], or the
- regex++ and Perl shorthand for this \d (note that many older libraries tended
- to be hard-coded to the C-locale, consequently this was not an issue for them).
- That leaves us with the following regular expression to validate credit card
- number formats:
- <PRE>(\d{4}[- ]){3}\d{4}</PRE>
- Here the parenthesis act to group (and mark for future reference)
- sub-expressions, and the {4} means "repeat exactly 4 times". This is an example
- of the extended regular expression syntax used by Perl, awk and egrep. Regex++
- also supports the older "basic" syntax used by sed and grep, but this is
- generally less useful, unless you already have some basic regular expressions
- that you need to reuse.
- Now let's take that expression and place it in some C++ code to validate the
- format of a credit card number:
- <PRE>bool validate_card_format(const std::string& s)
-{
- static const boost::regex e("(\\d{4}[- ]){3}\\d{4}");
- return regex_match(s, e);
-}</PRE>
- Note how we had to add some extra escapes to the expression: remember that the
- escape is seen once by the C++ compiler, before it gets to be seen by the
- 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 Koenig lookup, 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.
- Those of you who are familiar with credit card processing, will have realized
- that while the format used above is suitable for human readable card numbers,
- it does not represent the format required by online credit card systems; these
- require the number as a string of 16 (or possibly 15) digits, without any
- intervening spaces. What we need is a means to convert easily between the two
- formats, and this is where search and replace comes in. Those who are familiar
- with the utilities sed and Perl will already be ahead here; we
- need two strings - one a regular expression - the other a "<A href="format_syntax.html">format
- string</A>" that provides a description of the text to replace the match
- with. In regex++ this search 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:
- <PRE>// match any format with the regular expression:
-const boost::regex e("\\A(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})\\z");
-const std::string machine_format("\\1\\2\\3\\4");
-const std::string human_format("\\1-\\2-\\3-\\4");
-
-std::string machine_readable_card_number(const std::string s)
-{
- return regex_replace(s, e, machine_format, boost::match_default | boost::format_sed);
-}
-
-std::string human_readable_card_number(const std::string s)
-{
- return regex_replace(s, e, human_format, boost::match_default | boost::format_sed);
-}</PRE>
- Here we've used marked sub-expressions in the regular expression to split out
- the four parts of the card number as separate fields, the format string then
- uses the sed-like syntax to replace the matched text with the reformatted
- version.
- In the examples above, we haven't directly manipulated the results of a regular
- 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 <A href="match_results.html">
- match_results</A>, as before there are typedefs of this class for the most
- common cases:
- 
- <PRE>namespace boost{
-typedef match_results<const char*> cmatch;
-typedef match_results<const wchar_t*> wcmatch;
-typedef match_results<std::string::const_iterator> smatch;
-typedef match_results<std::wstring::const_iterator> wsmatch;
-}</PRE>
- 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 <A href="regex_search.html">
- regex_search</A> will search for a match anywhere within the text
- being matched.
- Note that these algorithms are not restricted to searching regular C-strings,
- any bidirectional iterator type can be searched, allowing for the possibility
- of seamlessly searching almost any kind of data.
- 
- For search and replace operations, in addition to the algorithm <A href="regex_replace.html">
- regex_replace</A> 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 a series of strings (similar to perl style split operations).
- 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. This class is now deprecated as it does not form part of the regular
- expressions C++ standard library proposal.
- 
- The POSIX API functions: regcomp, regexec, regfree
- and regerror, 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 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 expression
- libraries including GNU and BSD4 regex packages, and to a more limited extent
- Perl 5.
- 
- 
- <HR>
- 
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/localisation.html
==============================================================================
--- trunk/libs/regex/doc/localisation.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,808 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Localisation</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">Localisation</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- Boost.regex provides extensive support for run-time localization, the
- localization model used can be split into two parts: front-end and back-end.
- Front-end localization deals with everything which the user sees - error
- messages, and the regular expression syntax itself. For example a French
- application could change [[:word:]] to [[:mot:]] and \w to \m. Modifying the
- front end locale requires active support from the developer, by providing the
- library with a message catalogue to load, containing the localized strings.
- Front-end locale is affected by the LC_MESSAGES category only.
- Back-end localization deals with everything that occurs after the expression
- has been parsed - in other words everything that the user does not see or
- interact with directly. It deals with case conversion, collation, and character
- class membership. The back-end locale does not require any intervention from
- the developer - the library will acquire all the information it requires for
- the current locale from the underlying operating system / run time library.
- This means that if the program user does not interact with regular expressions
- directly - for example if the expressions are embedded in your C++ code - then
- no explicit localization is required, as the library will take care of
- everything for you. For example embedding the expression [[:word:]]+ in your
- code will always match a whole word, if the program is run on a machine with,
- for example, a Greek locale, then it will still match a whole word, but in
- Greek characters rather than Latin ones. The back-end locale is affected by the
- LC_TYPE and LC_COLLATE categories.
- There are three separate localization mechanisms supported by boost.regex:
- <h3>Win32 localization model.</h3>
- 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 LCID, by default this is the users
- default setting as returned by GetUserDefaultLCID, but you can call imbue
- on the basic_regex object to set it's locale to some other LCID if you wish.
- All the settings 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 a string table with the user-defined strings. The
- traits class exports the function:
- static std::string set_message_catalogue(const std::string& s);
- 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 instances):
- 
- boost::w32_regex_traits<char>::set_message_catalogue("mydll.dll");
- 
- The library provides full Unicode support under NT, under Windows 9x the
- library degrades gracefully - characters 0 to 255 are supported, the remainder
- are treated as "unknown" graphic characters.
- <h3>C localization model.</h3>
- This model has been deprecated in favor of the C++ localoe for all non-Windows
- compilers that support it.  This locale is encapsulated by the traits
- class 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. All
- settings are acquired from your run time library, consequently Unicode support
- is dependent upon your run time library implementation.
- Front end localization is not supported.
- Note that calling setlocale invalidates all compiled regular
- expressions, calling <tt>setlocale(LC_ALL, "C")</tt> will make this library
- behave equivalent to most traditional regular expression libraries including
- version 1 of this library.
- <h3>C++ localization model.</h3>
- 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 for the expression to be set on a per-instance basis.
- Front end localization requires a POSIX message catalogue, which will be loaded
- via the std::messages facet of the expression's locale, the traits class
- exports the symbol:
- static std::string set_message_catalogue(const std::string& s);
- which needs to be called with a string identifying the name of the message
- catalogue, before your code compiles any regular expressions (but not
- necessarily before you construct any basic_regex instances):
- 
- 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<>.
- 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>.
- <h3>Providing a message catalogue:</h3>
- 
- 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
- dll's string table (Win32 model), or a POSIX message catalogue (C++ models). In
- the latter case the messages must appear in message set zero of the catalogue.
- The messages and their id's are as follows: 
-  
- 
- <table id="Table2" cellspacing="0" cellpadding="6" width="624" border="0">
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">Message id</td>
- <td valign="top" width="32%">Meaning</td>
- <td valign="top" width="29%">Default value</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">101</td>
- <td valign="top" width="32%">The character used to start a sub-expression.</td>
- <td valign="top" width="29%">"("</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">102</td>
- <td valign="top" width="32%">The character used to end a sub-expression
- declaration.</td>
- <td valign="top" width="29%">")"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">103</td>
- <td valign="top" width="32%">The character used to denote an end of line
- assertion.</td>
- <td valign="top" width="29%">"$"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">104</td>
- <td valign="top" width="32%">The character used to denote the start of line
- assertion.</td>
- <td valign="top" width="29%">"^"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">105</td>
- <td valign="top" width="32%">The character used to denote the "match any character
- expression".</td>
- <td valign="top" width="29%">"."</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">106</td>
- <td valign="top" width="32%">The match zero or more times repetition operator.</td>
- <td valign="top" width="29%">"*"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">107</td>
- <td valign="top" width="32%">The match one or more repetition operator.</td>
- <td valign="top" width="29%">"+"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">108</td>
- <td valign="top" width="32%">The match zero or one repetition operator.</td>
- <td valign="top" width="29%">"?"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">109</td>
- <td valign="top" width="32%">The character set opening character.</td>
- <td valign="top" width="29%">"["</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">110</td>
- <td valign="top" width="32%">The character set closing character.</td>
- <td valign="top" width="29%">"]"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">111</td>
- <td valign="top" width="32%">The alternation operator.</td>
- <td valign="top" width="29%">"|"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">112</td>
- <td valign="top" width="32%">The escape character.</td>
- <td valign="top" width="29%">"\\"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">113</td>
- <td valign="top" width="32%">The hash character (not currently used).</td>
- <td valign="top" width="29%">"#"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">114</td>
- <td valign="top" width="32%">The range operator.</td>
- <td valign="top" width="29%">"-"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">115</td>
- <td valign="top" width="32%">The repetition operator opening character.</td>
- <td valign="top" width="29%">"{"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">116</td>
- <td valign="top" width="32%">The repetition operator closing character.</td>
- <td valign="top" width="29%">"}"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">117</td>
- <td valign="top" width="32%">The digit characters.</td>
- <td valign="top" width="29%">"0123456789"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">118</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the word boundary assertion.</td>
- <td valign="top" width="29%">"b"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">119</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the non-word boundary assertion.</td>
- <td valign="top" width="29%">"B"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">120</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the word-start boundary assertion.</td>
- <td valign="top" width="29%">"<"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">121</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the word-end boundary assertion.</td>
- <td valign="top" width="29%">">"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">122</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any word character.</td>
- <td valign="top" width="29%">"w"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">123</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents a non-word character.</td>
- <td valign="top" width="29%">"W"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">124</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents a start of buffer assertion.</td>
- <td valign="top" width="29%">"`A"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">125</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents an end of buffer assertion.</td>
- <td valign="top" width="29%">"'z"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">126</td>
- <td valign="top" width="32%">The newline character.</td>
- <td valign="top" width="29%">"\n"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">127</td>
- <td valign="top" width="32%">The comma separator.</td>
- <td valign="top" width="29%">","</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">128</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the bell character.</td>
- <td valign="top" width="29%">"a"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">129</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the form feed character.</td>
- <td valign="top" width="29%">"f"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">130</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the newline character.</td>
- <td valign="top" width="29%">"n"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">131</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the carriage return character.</td>
- <td valign="top" width="29%">"r"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">132</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the tab character.</td>
- <td valign="top" width="29%">"t"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">133</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the vertical tab character.</td>
- <td valign="top" width="29%">"v"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">134</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the start of a hexadecimal character constant.</td>
- <td valign="top" width="29%">"x"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">135</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the start of an ASCII escape character.</td>
- <td valign="top" width="29%">"c"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">136</td>
- <td valign="top" width="32%">The colon character.</td>
- <td valign="top" width="29%">":"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">137</td>
- <td valign="top" width="32%">The equals character.</td>
- <td valign="top" width="29%">"="</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">138</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the ASCII escape character.</td>
- <td valign="top" width="29%">"e"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">139</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any lower case character.</td>
- <td valign="top" width="29%">"l"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">140</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any non-lower case character.</td>
- <td valign="top" width="29%">"L"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">141</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any upper case character.</td>
- <td valign="top" width="29%">"u"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">142</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any non-upper case character.</td>
- <td valign="top" width="29%">"U"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">143</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any space character.</td>
- <td valign="top" width="29%">"s"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">144</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any non-space character.</td>
- <td valign="top" width="29%">"S"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">145</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any digit character.</td>
- <td valign="top" width="29%">"d"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">146</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any non-digit character.</td>
- <td valign="top" width="29%">"D"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">147</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the end quote operator.</td>
- <td valign="top" width="29%">"E"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">148</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the start quote operator.</td>
- <td valign="top" width="29%">"Q"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">149</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents a Unicode combining character sequence.</td>
- <td valign="top" width="29%">"X"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">150</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents any single character.</td>
- <td valign="top" width="29%">"C"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">151</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents end of buffer operator.</td>
- <td valign="top" width="29%">"Z"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="21%">152</td>
- <td valign="top" width="32%">The character which when preceded by an escape
- character represents the continuation assertion.</td>
- <td valign="top" width="29%">"G"</td>
- <td valign="top" width="9%"> </td>
- </tr>
- <tr>
- <td> </td>
- <td>153</td>
- <td>The character which when preceeded by (? indicates a zero width negated
- forward lookahead assert.</td>
- <td>!</td>
- <td> </td>
- </tr>
- </table>
- 
- 
- Custom error messages are loaded as follows: 
- 
- <table id="Table3" cellspacing="0" cellpadding="7" width="624" border="0">
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">Message ID</td>
- <td valign="top" width="32%">Error message ID</td>
- <td valign="top" width="31%">Default string</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">201</td>
- <td valign="top" width="32%">REG_NOMATCH</td>
- <td valign="top" width="31%">"No match"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">202</td>
- <td valign="top" width="32%">REG_BADPAT</td>
- <td valign="top" width="31%">"Invalid regular expression"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">203</td>
- <td valign="top" width="32%">REG_ECOLLATE</td>
- <td valign="top" width="31%">"Invalid collation character"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">204</td>
- <td valign="top" width="32%">REG_ECTYPE</td>
- <td valign="top" width="31%">"Invalid character class name"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">205</td>
- <td valign="top" width="32%">REG_EESCAPE</td>
- <td valign="top" width="31%">"Trailing backslash"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">206</td>
- <td valign="top" width="32%">REG_ESUBREG</td>
- <td valign="top" width="31%">"Invalid back reference"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">207</td>
- <td valign="top" width="32%">REG_EBRACK</td>
- <td valign="top" width="31%">"Unmatched [ or [^"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">208</td>
- <td valign="top" width="32%">REG_EPAREN</td>
- <td valign="top" width="31%">"Unmatched ( or \\("</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">209</td>
- <td valign="top" width="32%">REG_EBRACE</td>
- <td valign="top" width="31%">"Unmatched \\{"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">210</td>
- <td valign="top" width="32%">REG_BADBR</td>
- <td valign="top" width="31%">"Invalid content of \\{\\}"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">211</td>
- <td valign="top" width="32%">REG_ERANGE</td>
- <td valign="top" width="31%">"Invalid range end"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">212</td>
- <td valign="top" width="32%">REG_ESPACE</td>
- <td valign="top" width="31%">"Memory exhausted"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">213</td>
- <td valign="top" width="32%">REG_BADRPT</td>
- <td valign="top" width="31%">"Invalid preceding regular expression"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">214</td>
- <td valign="top" width="32%">REG_EEND</td>
- <td valign="top" width="31%">"Premature end of regular expression"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">215</td>
- <td valign="top" width="32%">REG_ESIZE</td>
- <td valign="top" width="31%">"Regular expression too big"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">216</td>
- <td valign="top" width="32%">REG_ERPAREN</td>
- <td valign="top" width="31%">"Unmatched ) or \\)"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">217</td>
- <td valign="top" width="32%">REG_EMPTY</td>
- <td valign="top" width="31%">"Empty expression"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">218</td>
- <td valign="top" width="32%">REG_E_UNKNOWN</td>
- <td valign="top" width="31%">"Unknown error"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- </table>
- 
- 
- Custom character class names are loaded as followed: 
- 
- <table id="Table4" cellspacing="0" cellpadding="7" width="624" border="0">
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">Message ID</td>
- <td valign="top" width="32%">Description</td>
- <td valign="top" width="31%">Equivalent default class name</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">300</td>
- <td valign="top" width="32%">The character class name for alphanumeric characters.</td>
- <td valign="top" width="31%">"alnum"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">301</td>
- <td valign="top" width="32%">The character class name for alphabetic characters.</td>
- <td valign="top" width="31%">"alpha"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">302</td>
- <td valign="top" width="32%">The character class name for control characters.</td>
- <td valign="top" width="31%">"cntrl"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">303</td>
- <td valign="top" width="32%">The character class name for digit characters.</td>
- <td valign="top" width="31%">"digit"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">304</td>
- <td valign="top" width="32%">The character class name for graphics characters.</td>
- <td valign="top" width="31%">"graph"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">305</td>
- <td valign="top" width="32%">The character class name for lower case characters.</td>
- <td valign="top" width="31%">"lower"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">306</td>
- <td valign="top" width="32%">The character class name for printable characters.</td>
- <td valign="top" width="31%">"print"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">307</td>
- <td valign="top" width="32%">The character class name for punctuation characters.</td>
- <td valign="top" width="31%">"punct"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">308</td>
- <td valign="top" width="32%">The character class name for space characters.</td>
- <td valign="top" width="31%">"space"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">309</td>
- <td valign="top" width="32%">The character class name for upper case characters.</td>
- <td valign="top" width="31%">"upper"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">310</td>
- <td valign="top" width="32%">The character class name for hexadecimal characters.</td>
- <td valign="top" width="31%">"xdigit"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">311</td>
- <td valign="top" width="32%">The character class name for blank characters.</td>
- <td valign="top" width="31%">"blank"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">312</td>
- <td valign="top" width="32%">The character class name for word characters.</td>
- <td valign="top" width="31%">"word"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="8%"> </td>
- <td valign="top" width="22%">313</td>
- <td valign="top" width="32%">The character class name for Unicode characters.</td>
- <td valign="top" width="31%">"unicode"</td>
- <td valign="top" width="7%"> </td>
- </tr>
- </table>
- 
- 
- Finally, custom collating element names are loaded starting from message id
- 400, and terminating when the first load thereafter fails. Each message looks
- something like: "tagname string" where tagname is the name used inside
- [[.tagname.]] and string is the actual text of the collating element.
- Note that the value of collating element [[.zero.]] is used for the conversion
- of strings to numbers - if you replace this with another value then that will
- be used for string parsing - for example use the Unicode character 0x0660 for
- [[.zero.]] if you want to use Unicode Arabic-Indic digits in your regular
- expressions in place of Latin digits.
- Note that the POSIX defined names for character classes and collating elements
- are always available - even if custom names are defined, in contrast, custom
- error messages, and custom syntax messages replace the default ones.
- 
- <hr>
- Revised 
- 
- 26 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/match_flag_type.html
==============================================================================
--- trunk/libs/regex/doc/match_flag_type.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,295 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: match_flag_type</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">match_flag_type</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- <h3>Synopsis</h3>
- The type <code>match_flag_type</code> is an implementation specific bitmask
- type (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.
- <pre>
-namespace boost{ namespace regex_constants{
-
-typedef implemenation-specific-bitmask-type match_flag_type;
-
-static const match_flag_type match_default = 0;
-static const match_flag_type match_not_bob;
-static const match_flag_type match_not_eob;
-static const match_flag_type match_not_bol;
-static const match_flag_type match_not_eol;
-static const match_flag_type match_not_bow;
-static const match_flag_type match_not_eow;
-static const match_flag_type match_any;
-static const match_flag_type match_not_null;
-static const match_flag_type match_continuous;
-static const match_flag_type match_partial;
-static const match_flag_type match_single_line;
-static const match_flag_type match_prev_avail;
-static const match_flag_type match_not_dot_newline;
-static const match_flag_type match_not_dot_null;
-
-static const match_flag_type format_default = 0;
-static const match_flag_type format_sed;
-static const match_flag_type format_perl;
-static const match_flag_type format_literal; 
-static const match_flag_type format_no_copy;
-static const match_flag_type format_first_only;
-static const match_flag_type format_all;
-
-} // namespace regex_constants
-} // namespace boost
-</pre>
- <h3>Description</h3>
- The type <code>match_flag_type</code> is an implementation specific bitmask
- type (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:
- 
- <table id="Table2" cellspacing="1" cellpadding="7" width="100%" border="0">
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Effect if set
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_default
- </td>
- <td valign="top" width="50%">
- Specifies that matching of regular expressions proceeds without any
- modification of the normal rules used in ECMA-262, ECMAScript Language
- Specification, Chapter 15 part 10, RegExp (Regular Expression) Objects (FWD.1)
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">match_not_bob</td>
- <td valign="top" width="50%">Specifies that the expressions "\A" and
- "\`" should not match against the sub-sequence [first,first).</td>
- </tr>
- <tr>
- <td valign="top" width="50%">match_not_eob</td>
- <td valign="top" width="50%">Specifies that the expressions "\'", "\z" and
- "\Z" should not match against the sub-sequence [last,last).</td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_not_bol
- </td>
- <td valign="top" width="50%">
- Specifies that the expression "^" should not be matched against the
- sub-sequence [first,first).
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_not_eol
- </td>
- <td valign="top" width="50%">
- Specifies that the expression "$" should not be matched against the
- sub-sequence [last,last).
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_not_bow
- </td>
- <td valign="top" width="50%">
- Specifies that the expressions "\<" and "\b" should not be matched
- against the sub-sequence [first,first).
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_not_eow
- </td>
- <td valign="top" width="50%">
- Specifies that the expressions "\>" and "\b" should not be matched
- against the sub-sequence [last,last).
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_any
- </td>
- <td valign="top" width="50%">
- Specifies that if more than one match is possible then any match is an
- acceptable result: this will still find the leftmost match, but may not find
- the "best" match at that position.  Use this flag if you care about the
- speed of matching, but don't care what was matched (only whether there is one
- or not).
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_not_null
- </td>
- <td valign="top" width="50%">
- Specifies that the expression can not be matched against an empty sequence.
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_continuous
- </td>
- <td valign="top" width="50%">
- Specifies that the expression must match a sub-sequence that begins at first.
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- match_partial
- </td>
- <td valign="top" width="50%">
- Specifies that if no match can be found, then it is acceptable to return a
- match [from, last) such that from!= last, if there could exist some longer
- sequence of characters [from,to) of which [from,last) is a prefix, and which
- would result in a full match.
- This flag is used when matching incomplete or very long texts, see the <A href="partial_matches.html">
- partial matches documentation</A> for more information.
- </td>
- </tr>
- <TR>
- <TD vAlign="top" width="50%">match_extra</TD>
- <TD vAlign="top" width="50%">Instructs the matching engine to retain all available <A href="captures.html">
- capture</A> information; if a capturing group is repeated then information
- about every repeat is available via match_results::captures()
- or sub_match_captures().</TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">match_single_line</TD>
- <TD vAlign="top" width="50%">Equivalent to the inverse of Perl's m/ modifier;
- prevents ^ from matching after an embedded newline character (so that it only
- matches at the start of the text being matched), and $ from matching before an
- embedded newline (so that it only matches at the end of the text being
- matched).</TD>
- </TR>
- <tr>
- <td valign="top" width="50%">
- match_prev_avail
- </td>
- <td valign="top" width="50%">
- Specifies that <code>--first</code> is a valid iterator position, when this
- flag is set then the flags <code>match_not_bol</code> and <code>match_not_bow</code>
- are ignored by the regular expression algorithms (RE.7) and iterators (RE.8).
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">match_not_dot_newline</td>
- <td valign="top" width="50%">Specifies that the expression "." does not match a
- newline character.  This is the inverse of Perl's s/ modifier.</td>
- </tr>
- <tr>
- <td valign="top" width="50%">match_not_dot_null</td>
- <td valign="top" width="50%">Specified that the expression "." does not match a
- character null '\0'.</td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- format_default
- </td>
- <td valign="top" width="50%">
- 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
- ECMAScript replace function in ECMA-262, ECMAScript Language Specification,
- Chapter 15 part 5.4.11 String.prototype.replace. (FWD.1). In addition during
- search and replace operations then all non-overlapping occurrences of the
- regular expression are located and replaced, and sections of the input that did
- not match the expression, are copied unchanged to the output string.
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- format_sed
- </td>
- <td valign="top" width="50%">
- 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..
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- format_perl
- </td>
- <td valign="top" width="50%">
- 
- Specifies that when a regular expression match is to be replaced by a new
- string, that the new string is constructed using the same rules as Perl 5.
- </td>
- </tr>
- <TR>
- <TD vAlign="top" width="50%">format_literal</TD>
- <TD vAlign="top" width="50%">Specified that when a regular expression match is to
- be replaced by a new string, that the new string is a literal copy of the
- replacement text.</TD>
- </TR>
- <tr>
- <td valign="top" width="50%" height="32">format_all</td>
- <td valign="top" width="50%" height="32">Specifies that all syntax extensions are
- enabled, including conditional (?ddexpression1:expression2) replacements: see
- the format string guide for more details.</td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- format_no_copy
- </td>
- <td valign="top" width="50%">
- When specified during a search and replace operation, then sections of the
- character container sequence being searched that do match the regular
- expression, are not copied to the output string.
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- format_first_only
- </td>
- <td valign="top" width="50%">
- When specified during a search and replace operation, then only the first
- occurrence of the regular expression is replaced.
- </td>
- </tr>
- </table>
- 
- 
- 
- <hr>
- 
- 
- Revised
- 
- 04 Feb 2004
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/match_results.html
==============================================================================
--- trunk/libs/regex/doc/match_results.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,459 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: class match_results</title>
- <meta content="HTML Tidy, see www.w3.org" name="generator">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <table id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <tr>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">class match_results</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- <h3>Contents</h3>
- <dl class="index">
- <dt>Synopsis <dt>Description </dt>
- </dl>
- <h3><a name="synopsis"></a>Synopsis</h3>
- #include <boost/regex.hpp>
- Regular expressions are different from many simple pattern-matching algorithms
- in that as well as finding an overall match they can also produce
- sub-expression matches: each sub-expression being delimited in the pattern by a
- pair of parenthesis (...). There has to be some method for reporting
- sub-expression matches back to the user: this is achieved this by defining a
- class match_results that acts as an indexed collection of sub-expression
- matches, each sub-expression match being contained in an object of type <A href="sub_match.html">
- sub_match</A> .
- 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 collection is allocated and freed as necessary by the member functions of
- 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:
- <pre>template <class BidirectionalIterator,
- class Allocator = std::allocator<sub_match<BidirectionalIterator> >
-class match_results;
-
-typedef match_results<const char*> cmatch;
-typedef match_results<const wchar_t*> wcmatch;
-typedef match_results<string::const_iterator> smatch;
-typedef match_results<wstring::const_iterator> wsmatch;
-
-template <class BidirectionalIterator,
- class Allocator = std::allocator<sub_match<BidirectionalIterator> >
-class match_results
-{
-public:
- typedef sub_match<BidirectionalIterator> value_type;
- typedef const value_type& const_reference;
- typedef const_reference reference;
- typedef implementation defined const_iterator;
- typedef const_iterator iterator;
- typedef typename iterator_traits<BidirectionalIterator>::difference_type difference_type;
- typedef typename Allocator::size_type size_type;
- typedef Allocator allocator_type;
- typedef typename iterator_traits<BidirectionalIterator>::value_type char_type;
- typedef basic_string<char_type> string_type;
-
- // construct/copy/destroy:
- explicit match_results(const Allocator& a = Allocator());
- match_results(const match_results& m);
- match_results& operator=(const match_results& m);
- ~match_results();
-
- // size:
- size_type size() const;
- size_type max_size() const;
- bool empty() const;
- // element access:
- difference_type length(int sub = 0) const;
- difference_type position(unsigned int sub = 0) const;
- string_type str(int sub = 0) const;
- const_reference operator[](int n) const;
-
- const_reference prefix() const;
-
- const_reference suffix() const;
- const_iterator begin() const;
- const_iterator end() const;
- // format:
- template <class OutputIterator>
- OutputIterator format(OutputIterator out,
- const string_type& fmt,
- match_flag_type flags = format_default) const;
- string_type format(const string_type& fmt,
- match_flag_type flags = format_default) const;
-
- allocator_type get_allocator() const;
- void swap(match_results& that);
-
-#ifdef BOOST_REGEX_MATCH_EXTRA
- typedef typename value_type::capture_sequence_type capture_sequence_type;
- const capture_sequence_type& captures(std::size_t i)const;
-#endif
-
-};
-
-template <class BidirectionalIterator, class Allocator>
-bool operator == (const match_results<BidirectionalIterator, Allocator>& m1,
- const match_results<BidirectionalIterator, Allocator>& m2);
-template <class BidirectionalIterator, class Allocator>
-bool operator != (const match_results<BidirectionalIterator, Allocator>& m1,
- const match_results<BidirectionalIterator, Allocator>& m2);
-
-template <class charT, class traits, class BidirectionalIterator, class Allocator>
-basic_ostream<charT, traits>&
- operator << (basic_ostream<charT, traits>& os,
- const match_results<BidirectionalIterator, Allocator>& m);
-
-template <class BidirectionalIterator, class Allocator>
-void swap(match_results<BidirectionalIterator, Allocator>& m1,
- match_results<BidirectionalIterator, Allocator>& m2);
-</pre>
- <h3><a name="description"></a>Description</h3>
- <h4>match_results constructors</h4>
- In all <code>match_results</code> 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.
- <pre><A name=c1></A>
-match_results(const Allocator& a = Allocator());
-</pre>
- 
- Effects: Constructs an object of class match_results. The postconditions
- of this function are indicated in the table:
- 
- <center>
- <table id="Table2" cellSpacing="1" cellPadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td vAlign="top" width="50%">
- Element
- </td>
- <td vAlign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- empty()
- </td>
- <td vAlign="top" width="50%">
- true
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- size()
- </td>
- <td vAlign="top" width="50%">
- 0
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- str()
- </td>
- <td vAlign="top" width="50%">
- basic_string<charT>()
- </td>
- </tr>
- </tbody></table>
- </center>
-  
- <pre><A name=c2></A>
-match_results(const match_results& m);
-</pre>
- 
- Effects: Constructs an object of class match_results, as a copy of m.
- <pre><A name=c3></A>
-match_results& operator=(const match_results& m);
-</pre>
- 
- Effects: Assigns m to *this. The postconditions of this function are
- indicated in the table:
- 
- <center>
- <table id="Table3" cellSpacing="1" cellPadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td vAlign="top" width="50%">
- Element
- </td>
- <td vAlign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- empty()
- </td>
- <td vAlign="top" width="50%">
- m.empty().
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- size()
- </td>
- <td vAlign="top" width="50%">
- m.size().
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- str(n)
- </td>
- <td vAlign="top" width="50%">
- m.str(n) for all integers n < m.size().
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- prefix()
- </td>
- <td vAlign="top" width="50%">
- m.prefix().
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- suffix()
- </td>
- <td vAlign="top" width="50%">
- m.suffix().
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- (*this)[n]
- </td>
- <td vAlign="top" width="50%">
- m[n] for all integers n < m.size().
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- length(n)
- </td>
- <td vAlign="top" width="50%">
- m.length(n) for all integers n < m.size().
- </td>
- </tr>
- <tr>
- <td vAlign="top" width="50%">
- position(n)
- </td>
- <td vAlign="top" width="50%">
- m.position(n) for all integers n < m.size().
- </td>
- </tr>
- </tbody></table>
- </center>
- <h4>match_results size</h4>
- <pre><A name=m1></A>
-size_type size()const;
-</pre>
- 
- 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.
- <pre><A name=m2></A>
-size_type max_size()const;
-</pre>
- 
- Effects: Returns the maximum number of sub_match elements that can be
- stored in *this.
- <pre><A name=m3></A>
-bool empty()const;
-</pre>
- 
- Effects: Returns <code>size() == 0</code>.
- <h4>match_results element access</h4>
- <pre><A name=m4></A>
-difference_type length(int sub = 0)const;
-</pre>
- 
- Effects: Returns the length of sub-expression sub, that is to
- say: <code>(*this)[sub].length()</code>.
- <pre><A name=m5></A>
-difference_type position(unsigned int sub = 0)const;
-</pre>
- 
- Effects: Returns the starting location of sub-expression sub,
- or -1 if sub was not matched.  Note that if this represents a <A href="partial_matches.html">
- partial match</A> , then <code>position()</code> will return the location of
- the partial match even though <code>(*this)[0].matched</code> is false.
- <pre><A name=m6></A>
-string_type str(int sub = 0)const;
-</pre>
- 
- Effects: Returns sub-expression sub as a string:  <code>string_type((*this)[sub]).</code>
- <pre><A name=m7></A>
-const_reference operator[](int n) const;
-</pre>
- 
- Effects: Returns a reference to the <code>sub_match</code> object
- representing the character sequence that matched marked sub-expression n.
- If <code>n == 0</code> then returns a reference to a <code>sub_match</code> 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 object whose matched
- member is false.
- <pre><A name=m8></A>
-const_reference prefix()const;
-</pre>
- 
- Effects: Returns a reference to the <code>sub_match</code> object
- representing the character sequence from the start of the string being
- matched/searched, to the start of the match found.
- <pre><A name=m9></A>
-const_reference suffix()const;
-</pre>
- 
- Effects: Returns a reference to the <code>sub_match</code> object
- representing the character sequence from the end of the match found to the end
- of the string being matched/searched.
- <pre><A name=m10></A>
-const_iterator begin()const;
-</pre>
- 
- Effects: Returns a starting iterator that enumerates over all the marked
- sub-expression matches stored in *this.
- <pre><A name=m11></A>
-const_iterator end()const;
-</pre>
- 
- Effects: Returns a terminating iterator that enumerates over all the
- marked sub-expression matches stored in *this.
- <h4><A name="format"></A>match_results reformatting</h4>
- <pre><A name=m12></A>template <class OutputIterator>
-OutputIterator format(OutputIterator out,
- const string_type& fmt,
- match_flag_type flags = format_default);
-</pre>
- 
- Requires: The type OutputIterator conforms to the Output Iterator
- requirements (24.1.2).
- 
- 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
- in flags determines what <A href="format_syntax.html">
- format specifiers or escape sequences are recognized</A>, by default this is
- the format used by ECMA-262, ECMAScript Language Specification, Chapter 15 part
- 5.4.11 String.prototype.replace.
- 
- Returns: out.
- <pre><A name=m13></A>
-string_type format(const string_type& fmt,
- match_flag_type flags = format_default);
-</pre>
- 
- 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 in flags
- determines what <A href="format_syntax.html">format specifiers or escape sequences
- are recognized</A>, by default this is the format used by ECMA-262,
- ECMAScript Language Specification, Chapter 15 part 5.4.11
- String.prototype.replace.
- <H4>Allocator access</H4>
- <pre><A name=m14>allocator_type get_allocator()const;
-</pre>
- 
- Effects: Returns a copy of the Allocator that was passed to the object's
- constructor.
- <H4><A name="m15"></A>Swap</H4>
- <PRE>void swap(match_results& that);
-</PRE>
- 
- Effects: Swaps the contents of the two sequences.
- 
- Postcondition: <code>*this</code> contains the sequence of matched
- sub-expressions that were in <code>that</code>, <code>that</code> contains the
- sequence of matched sub-expressions that were in <code>*this</code>.
- 
- Complexity: constant time.
- <H4>Captures</H4>
- <PRE><A name=m16></A>typedef typename value_type::capture_sequence_type capture_sequence_type;</PRE>
- 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> >,
- but you shouldn't actually rely on that.
- <PRE><A name=m17></A>const capture_sequence_type& captures(std::size_t i)const; </PRE>
- Effects: returns a sequence containing all the captures
- obtained for sub-expression i.
- Returns: <code>(*this)[i].captures();</code>
- Preconditions: the library must be built and used with
- BOOST_REGEX_MATCH_EXTRA defined, and you must pass the flag <A href="match_flag_type.html">
- match_extra</A> 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 consequences:
- 
- <UL>
- <LI>
- sub_match occupies more memory resulting in complex expressions running out of
- memory or stack space more quickly during matching.
- <LI>
- The matching algorithms are less efficient at handling some features
- (independent sub-expressions for example), even when match_extra is not used.
- <LI>
- The matching algorithms are much less efficient (i.e. slower), when match_extra
- is used.  Mostly this is down to the extra memory allocations that have to
- take place.</LI></UL>
- <h4>match_results non-members</h4>
- <PRE><A name=n1></A>template <class BidirectionalIterator, class Allocator>
-bool operator == (const match_results<BidirectionalIterator, Allocator>& m1,
- const match_results<BidirectionalIterator, Allocator>& m2);</PRE>
- Effects: Compares the two sequences for equality.
- <PRE><A name=n2></A>template <class BidirectionalIterator, class Allocator>
-bool operator != (const match_results<BidirectionalIterator, Allocator>& m1,
- const match_results<BidirectionalIterator, Allocator>& m2);</PRE>
- Effects: Compares the two sequences for inequality.
- <PRE><A name=n3></A>template <class charT, class traits, class BidirectionalIterator, class Allocator>
-basic_ostream<charT, traits>&
- operator << (basic_ostream<charT, traits>& os,
- const match_results<BidirectionalIterator, Allocator>& m);</PRE>
- Effects: Writes the contents of m to the stream os as
- if by calling <code>os << m.str();</code> Returns os..
- <PRE><A name=n4></A>template <class BidirectionalIterator, class Allocator>
-void swap(match_results<BidirectionalIterator, Allocator>& m1,
- match_results<BidirectionalIterator, Allocator>& m2);</PRE>
- Effects: Swaps the contents of the two sequences.
- 
- <hr>
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
-  2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/mfc_strings.html
==============================================================================
--- trunk/libs/regex/doc/mfc_strings.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,294 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Working With MFC/ATL String Types</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Working With MFC/ATL String Types.</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Introduction <dt>Types <dt><A href="#create">Regular
- Expression Creation</A> <dt>Overloaded Algorithms
- <dd>
- <dl>
- <dt>regex_match <dt>regex_search
- <dt>regex_replace </dt>
- </dl>
- <dt>Iterators
- <dd>
- <dl>
- <dt>regex_iterator creation helper <dt><A href="#regex_token_iterator">
- regex_token_iterator creation helpers</A></dt>
- </dl>
- </dd>
- </dl>
- <H3><a name="intro"></a>Introduction</H3>
- 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. 
- In the following documentation, whenever you see CSimpleStringT<charT>,
- then you can substitute any of the following MFC/ATL types (all of which
- inherit from CSimpleStringT):
- CString 
- CStringA 
- CStringW 
- CAtlString 
- CAtlStringA 
- CAtlStringW 
- CStringT<charT,traits> 
- CFixedStringT<charT,N> 
- CSimpleStringT<charT>
- <H3><A name="types"></A>Types</H3>
- The following typedefs are provided for the convenience of those working with
- TCHAR's:
- <PRE>typedef basic_regex<TCHAR> tregex;
-typedef match_results<TCHAR const*> tmatch;
-typedef regex_iterator<TCHAR const*> tregex_iterator;
-typedef regex_token_iterator<TCHAR const*> tregex_token_iterator;
-</PRE>
- If you are working with explicitly narrow or wide characters rather than TCHAR,
- then use the regular Boost.Regex types instead.
- <H3><A name="create"></A>Regular Expression Creation</H3>
- The following helper function is available to assist in the creation of a
- regular expression from an MFC/ATL string type:
- <pre>template <class charT>
-basic_regex<charT>
- make_regex(const ATL::CSimpleStringT<charT>& s,
- ::boost::regex_constants::syntax_option_type f = boost::regex_constants::normal);</pre>
- Effects: returns basic_regex<charT>(s.GetString(),
- s.GetString() + s.GetLength(), f);
- <H3><A name="algo"></A>Overloaded Algorithms</H3>
- 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:
- <H4><A name="regex_match"></A>regex_match</H4>
- 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 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 instead.
- <PRE>template <class charT, class T, class A>
-bool regex_match(
- const ATL::CSimpleStringT<charT>& s,
- match_results<const B*, A>& what,
- const basic_regex<charT, T>& e,
- boost::regex_constants::match_flag_type f = boost::regex_constants::match_default); </PRE>
- 
- Effects: returns ::boost::regex_match(s.GetString(),
- s.GetString() + s.GetLength(), what, e, f);
- Example:
- <pre>//
-// Extract filename part of a path from a CString and return the result
-// as another CString:
-//
-CString get_filename(const CString& path)
-{
- boost::tregex r(__T("(?:\\A|.*\\\\)([^\\\\]+)"));
- boost::tmatch what;
- if(boost::regex_match(path, what, r))
- {
- // extract $1 as a CString:
- return CString(what[1].first, what.length(1));
- }
- else
- {
- throw std::runtime_error("Invalid pathname");
- }
-}
- </pre>
- <hr>
- <PRE>template <class charT, class T>
-bool regex_match(
- const ATL::CSimpleStringT<charT>& s,
- const basic_regex<B, T>& e,
- boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)</PRE>
- 
- Effects: returns ::boost::regex_match(s.GetString(),
- s.GetString() + s.GetLength(), e, f);
- Example:
- <pre>//
-// Find out if *password* meets our password requirements,
-// as defined by the regular expression *requirements*.
-//
-bool is_valid_password(const CString& password, const CString& requirements)
-{
- return boost::regex_match(password, boost::make_regex(requirements));
-} </pre>
- <hr>
- <H4><A name="regex_search"></A>regex_search</H4>
- There are two additional overloads for regex_search,
- the first reports what matched the second does not:
- <PRE>template <class charT, class A, class T>
-bool regex_search(const ATL::CSimpleStringT<charT>& s,
- match_results<const charT*, A>& what,
- const basic_regex<charT, T>& e,
- boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)</PRE>
- Effects: returns ::boost::regex_search(s.GetString(),
- s.GetString() + s.GetLength(), what, e, f);
- Example:: Postcode extraction from an address string.
- <pre>CString extract_postcode(const CString& address)
-{
- // searches throw address for a UK postcode and returns the result,
- // the expression used is by Phil A. on www.regxlib.com:
- boost::tregex r(__T("^(([A-Z]{1,2}[0-9]{1,2})|([A-Z]{1,2}[0-9][A-Z]))\\s?([0-9][A-Z]{2})$"));
- boost::tmatch what;
- if(boost::regex_search(address, what, r))
- {
- // extract $0 as a CString:
- return CString(what[0].first, what.length());
- }
- else
- {
- throw std::runtime_error("No postcode found");
- }
-} </pre>
- <hr>
- <pre>template <class charT, class T>
-inline bool regex_search(const ATL::CSimpleStringT<charT>& s,
- const basic_regex<charT, T>& e,
- boost::regex_constants::match_flag_type f = boost::regex_constants::match_default)
-</pre>
- Effects: returns ::boost::regex_search(s.GetString(),
- s.GetString() + s.GetLength(), e, f);
- <hr>
- <H4><A name="regex_replace"></A>regex_replace</H4>
- There are two additional overloads for regex_replace,
- the first sends output to an output iterator, while the second creates a new
- string
- <PRE>template <class OutputIterator, class BidirectionalIterator, class traits, class
- charT>
-OutputIterator regex_replace(OutputIterator out,
- BidirectionalIterator first,
- BidirectionalIterator last,
- const basic_regex<charT, traits>& e,
- const ATL::CSimpleStringT<charT>& fmt,
- match_flag_type flags = match_default)
-</PRE>
- Effects: returns ::boost::regex_replace(out,
- first, last, e, fmt.GetString(), flags);
- <pre>template <class traits, charT>
-ATL::CSimpleStringT<charT> regex_replace(const ATL::CSimpleStringT<charT>& s,
- const basic_regex<charT, traits>& e,
- const ATL::CSimpleStringT<charT>& fmt,
- match_flag_type flags = match_default)</pre>
- Effects: returns a new string created using <A href="regex_replace.html">
- regex_replace</A>, and the same memory manager as string s.
- Example:
- <PRE>//
-// Take a credit card number as a string of digits,
-// and reformat it as a human readable string with "-"
-// separating each group of four digits:
-//
-const boost::tregex e(__T("\\A(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})\\z"));
-const CString human_format = __T("$1-$2-$3-$4");
-
-CString human_readable_card_number(const CString& s)
-{
- return boost::regex_replace(s, e, human_format);
-}
- </PRE>
- <H3><a name="iterators"></a>Iterators</H3>
- The following helper functions are provided to ease the conversion from an
- MFC/ATL string to a regex_iterator or <A href="regex_token_iterator.html">
- regex_token_iterator</A>:
- <H4><A name="regex_iterator"></A>regex_iterator creation helper</H4>
- <PRE>template <class charT>
-regex_iterator<charT const*>
- make_regex_iterator(
- const ATL::CSimpleStringT<charT>& s,
- const basic_regex<charT>& e,
- ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);
-</PRE>
- Effects:returns regex_iterator(s.GetString(),
- s.GetString() + s.GetLength(), e, f);
- Example:
- <pre>void enumerate_links(const CString& html)
-{
- // enumerate and print all the <a> links in some HTML text,
- // the expression used is by Andew Lee on www.regxlib.com:
- boost::tregex r(__T("href=[\"\']((http:\\/\\/|\\.\\/|\\/)?\\w+(\\.\\w+)*(\\/\\w+(\\.\\w+)?)*(\\/|\\?\\w*=\\w*(&\\w*=\\w*)*)?)[\"\']"));
- boost::tregex_iterator i(boost::make_regex_iterator(html, r)), j;
- while(i != j)
- {
- std::cout << (*i)[1] << std::endl;
- ++i;
- }
-}
- </pre>
- <hr>
- <H4><A name="regex_token_iterator"></A>regex_token_iterator creation helpers</H4>
- <PRE>template <class charT>
-regex_token_iterator<charT const*>
- make_regex_token_iterator(
- const ATL::CSimpleStringT<charT>& s,
- const basic_regex<charT>& e,
- int sub = 0,
- ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);
-</PRE>
- Effects:returns regex_token_iterator(s.GetString(),
- s.GetString() + s.GetLength(), e, sub, f);
- <pre>template <class charT>
-regex_token_iterator<charT const*>
- make_regex_token_iterator(
- const ATL::CSimpleStringT<charT>& s,
- const basic_regex<charT>& e,
- const std::vector<int>& subs,
- ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);
-</pre>
- Effects:returns regex_token_iterator(s.GetString(),
- s.GetString() + s.GetLength(), e, subs, f);
- <pre>template <class charT, std::size_t N>
-regex_token_iterator<charT const*>
- make_regex_token_iterator(
- const ATL::CSimpleStringT<charT>& s,
- const basic_regex<charT>& e,
- const int (& subs)[N],
- ::boost::regex_constants::match_flag_type f = boost::regex_constants::match_default);
-</pre>
- Effects: returns regex_token_iterator(s.GetString(),
- s.GetString() + s.GetLength(), e, subs, f);
- Example:
- <PRE>void enumerate_links2(const CString& html)
-{
- // enumerate and print all the <a> links in some HTML text,
- // the expression used is by Andew Lee on www.regxlib.com:
- boost::tregex r(__T("href=[\"\']((http:\\/\\/|\\.\\/|\\/)?\\w+(\\.\\w+)*(\\/\\w+(\\.\\w+)?)*(\\/|\\?\\w*=\\w*(&\\w*=\\w*)*)?)[\"\']"));
- boost::tregex_token_iterator i(boost::make_regex_token_iterator(html, r, 1)), j;
- while(i != j)
- {
- std::cout << *i << std::endl;
- ++i;
- }
-} </PRE>
- <HR>
- Revised 
- 
- 21 Dec 2004
- 
- © Copyright John Maddock 2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/non_standard_strings.html
==============================================================================
--- trunk/libs/regex/doc/non_standard_strings.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,53 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Working With Non-Standard String Types</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Working With Non-Standard String Types.</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- The Boost.Regex algorithms and iterators are all iterator-based, with
- convenience overloads of the algorithms provided that convert standard library
- string types to iterator pairs internally.  If you want to search a
- non-standard string type then the trick is to convert that string into an
- iterator pair: so far I haven't come across any string types that can't be
- handled this way, even if they're not officially iterator based. 
- Certainly any string type that provides access to it's internal buffer, along
- with it's length, can be converted into a pair of pointers (which can be used
- as iterators).
- Some non-standard string types are sufficiently common that wappers have been
- provided for them:
- MFC/ATL Strings. 
- ICU Strings.
- 
- <HR>
- 
- Revised
- 
- 24 Nov 2004
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/partial_matches.html
==============================================================================
--- trunk/libs/regex/doc/partial_matches.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,195 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Partial Matches</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Partial Matches</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- The match-flag <CODE>match_partial</CODE> 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 have
- done so had more input been available). Partial matches are typically used when
- either validating data input (checking each character as it is entered on the
- keyboard), or when searching texts that are either too long to load 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): 
- 
- 
- <TABLE id="Table2" cellSpacing="0" cellPadding="7" width="100%" border="0">
- <TR>
- <TD vAlign="top" width="20%"> </TD>
- <TD vAlign="top" width="20%">Result</TD>
- <TD vAlign="top" width="20%">M[0].matched</TD>
- <TD vAlign="top" width="20%">M[0].first</TD>
- <TD vAlign="top" width="20%">M[0].second</TD>
- </TR>
- <TR>
- <TD vAlign="top" width="20%">No match</TD>
- <TD vAlign="top" width="20%">False</TD>
- <TD vAlign="top" width="20%">Undefined</TD>
- <TD vAlign="top" width="20%">Undefined</TD>
- <TD vAlign="top" width="20%">Undefined</TD>
- </TR>
- <TR>
- <TD vAlign="top" width="20%">Partial match</TD>
- <TD vAlign="top" width="20%">True</TD>
- <TD vAlign="top" width="20%">False</TD>
- <TD vAlign="top" width="20%">Start of partial match.</TD>
- <TD vAlign="top" width="20%">End of partial match (end of text).</TD>
- </TR>
- <TR>
- <TD vAlign="top" width="20%">Full match</TD>
- <TD vAlign="top" width="20%">True</TD>
- <TD vAlign="top" width="20%">True</TD>
- <TD vAlign="top" width="20%">Start of full match.</TD>
- <TD vAlign="top" width="20%">End of full match.</TD>
- </TR>
- </TABLE>
- 
- Be aware that using partial matches can sometimes result in somewhat imperfect
- behavior:
- <UL>
- <LI>
- There are some expressions, such as ".*abc" that will always produce a partial
- match.  This problem can be reduced by careful construction of the regular
- expressions used, or by setting flags like match_not_dot_newline so that
- expressions like .* can't match past line boundaries.</LI>
- <LI>
- Boost.Regex currently prefers leftmost matches to full matches, so for example
- matching "abc|b" against "ab" produces a partial match against the "ab"
- rather than a full match against "b".  It's more efficient to work this
- way, but may not be the behavior you want in all situations.</LI></UL>
- 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 <CODE>is_possible_card_number</CODE>. 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 would disable the
- OK button. Finally, if the procedure throws an exception the input could never
- become a valid number, and the inputted character must be discarded, and a
- suitable error indication displayed to the user.
- <PRE>#include <string>
-#include <iostream>
-#include <boost/regex.hpp>
-
-boost::regex e("(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})");
-
-bool is_possible_card_number(const std::string& input)
-{
- //
- // return false for partial match, true for full match, or throw for
- // impossible match based on what we have so far...
- boost::match_results<std::string::const_iterator> what;
- if(0 == boost::regex_match(input, what, e, boost::match_default | boost::match_partial))
- {
- // the input so far could not possibly be valid so reject it:
- throw std::runtime_error("Invalid data entered - this could not possibly be a valid card number");
- }
- // OK so far so good, but have we finished?
- if(what[0].matched)
- {
- // excellent, we have a result:
- return true;
- }
- // what we have so far is only a partial match...
- return false;
-}</PRE>
- In the following example,
- text input is taken from a stream containing an unknown amount of text; this
- example simply counts the number of html tags encountered in the stream. The
- text is loaded into a buffer and searched a part at a time, if a partial match
- was encountered, then the partial match gets searched a second time as the
- start of the next batch of text:
- <PRE>#include <iostream>
-#include <fstream>
-#include <sstream>
-#include <string>
-#include <boost/regex.hpp>
-
-// match some kind of html tag:
-boost::regex e("<[^>]*>");
-// count how many:
-unsigned int tags = 0;
-// saved position of partial match:
-char* next_pos = 0;
-
-bool grep_callback(const boost::match_results<char*>& m)
-{
- if(m[0].matched == false)
- {
- // save position and return:
- next_pos = m[0].first;
- }
- else
- ++tags;
- return true;
-}
-
-void search(std::istream& is)
-{
- char buf[4096];
- next_pos = buf + sizeof(buf);
- bool have_more = true;
- while(have_more)
- {
- // how much do we copy forward from last try:
- unsigned leftover = (buf + sizeof(buf)) - next_pos;
- // and how much is left to fill:
- unsigned size = next_pos - buf;
- // copy forward whatever we have left:
- memcpy(buf, next_pos, leftover);
- // fill the rest from the stream:
- unsigned read = is.readsome(buf + leftover, size);
- // check to see if we've run out of text:
- have_more = read == size;
- // reset next_pos:
- next_pos = buf + sizeof(buf);
- // and then grep:
- boost::regex_grep(grep_callback,
- buf,
- buf + read + leftover,
- e,
- boost::match_default | boost::match_partial);
- }
-}</PRE>
- 
- <HR>
- 
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
-  2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/performance.html
==============================================================================
--- trunk/libs/regex/doc/performance.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,52 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Performance</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Performance</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- The performance of Boost.regex in both recursive and non-recursive modes should
- be broadly comparable to other regular expression libraries: recursive mode is
- slightly faster (especially where memory allocation requires thread
- synchronisation), but not by much.  The following pages compare
- Boost.regex with various other regular expression libraries for the following
- compilers:
- <A href="vc71-performance.html">Visual Studio.Net 2003 (recursive Boost.regex
- implementation)</A>.
- <A href="gcc-performance.html">Gcc 3.2 (cygwin) (non-recursive Boost.regex
- implementation).</A>
- 
- <HR>
- 
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/posix_api.html
==============================================================================
--- trunk/libs/regex/doc/posix_api.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,286 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: POSIX API Compatibility Functions</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">POSIX API Compatibility Functions</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- <PRE>#include <boost/cregex.hpp>
-or:
-#include <boost/regex.h></PRE>
- The following functions are available for users who need a POSIX compatible C
- library, they are available in both Unicode and narrow character versions, the
- standard POSIX API names are macros that expand to one version or the other
- depending upon whether UNICODE is defined or not.
- 
- 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> instead - in which case the symbols are still defined in
- namespace boost, but are made available in the global namespace as well.
- The functions are defined as:
- 
- <PRE>extern "C" {
-int regcompA(regex_tA*, const char*, int);
-unsigned int regerrorA(int, const regex_tA*, char*, unsigned int);
-int regexecA(const regex_tA*, const char*, unsigned int, regmatch_t*, int);
-void regfreeA(regex_tA*);
-
-int regcompW(regex_tW*, const wchar_t*, int);
-unsigned int regerrorW(int, const regex_tW*, wchar_t*, unsigned int);
-int regexecW(const regex_tW*, const wchar_t*, unsigned int, regmatch_t*, int);
-void regfreeW(regex_tW*);
-
-#ifdef UNICODE
-#define regcomp regcompW
-#define regerror regerrorW
-#define regexec regexecW
-#define regfree regfreeW
-#define regex_t regex_tW
-#else
-#define regcomp regcompA
-#define regerror regerrorA
-#define regexec regexecA
-#define regfree regfreeA
-#define regex_t regex_tA
-#endif
-}</PRE>
- All the functions operate on structure regex_t, which exposes two public
- members:
- 
- unsigned int re_nsub this is filled in by regcomp and indicates
- the number of sub-expressions contained in the regular expression.
- 
- const TCHAR* re_endp points to the end of the expression to compile when
- the flag REG_PEND is set.
- 
- Footnote: 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.
- 
- <H3>regcomp</H3>
- 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:
- 
-  
- 
- 
- <TABLE id="Table2" cellSpacing="0" cellPadding="7" width="100%" border="0">
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_EXTENDED</TD>
- <TD vAlign="top" width="45%">Compiles modern regular expressions. Equivalent to
- regbase::char_classes | regbase::intervals | regbase::bk_refs.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_BASIC</TD>
- <TD vAlign="top" width="45%">Compiles basic (obsolete) regular expression syntax.
- Equivalent to regbase::char_classes | regbase::intervals | regbase::limited_ops
- | regbase::bk_braces | regbase::bk_parens | regbase::bk_refs.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_NOSPEC</TD>
- <TD vAlign="top" width="45%">All characters are ordinary, the expression is a
- literal string.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_ICASE</TD>
- <TD vAlign="top" width="45%">Compiles for matching that ignores character case.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_NOSUB</TD>
- <TD vAlign="top" width="45%">Has no effect in this library.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_NEWLINE</TD>
- <TD vAlign="top" width="45%">When this flag is set a dot does not match the
- newline character.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_PEND</TD>
- <TD vAlign="top" width="45%">When this flag is set the re_endp parameter of the
- regex_t structure must point to the end of the regular expression to compile.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_NOCOLLATE</TD>
- <TD vAlign="top" width="45%">When this flag is set then locale dependent collation
- for character ranges is turned off.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_ESCAPE_IN_LISTS 
- , , ,
- </TD>
- <TD vAlign="top" width="45%">When this flag is set, then escape sequences are
- permitted in bracket expressions (character sets).</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_NEWLINE_ALT </TD>
- <TD vAlign="top" width="45%">When this flag is set then the newline character is
- equivalent to the alternation operator |.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_PERL </TD>
- <TD vAlign="top" width="45%">Compiles Perl like regular expressions.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_AWK</TD>
- <TD vAlign="top" width="45%">A shortcut for awk-like behavior: REG_EXTENDED |
- REG_ESCAPE_IN_LISTS</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_GREP</TD>
- <TD vAlign="top" width="45%">A shortcut for grep like behavior: REG_BASIC |
- REG_NEWLINE_ALT</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="45%">REG_EGREP</TD>
- <TD vAlign="top" width="45%"> A shortcut for egrep like behavior:
- REG_EXTENDED | REG_NEWLINE_ALT</TD>
- <TD width="5%"> </TD>
- </TR>
- </TABLE>
- 
- <H3>regerror</H3>
- regerror takes the following parameters, it maps an error code to a human
- readable string:
- 
- 
- 
- <TABLE id="Table3" cellSpacing="0" cellPadding="7" width="100%" border="0">
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="50%">int code</TD>
- <TD vAlign="top" width="50%">The error code.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD> </TD>
- <TD vAlign="top" width="50%">const regex_t* e</TD>
- <TD vAlign="top" width="50%">The regular expression (can be null).</TD>
- <TD> </TD>
- </TR>
- <TR>
- <TD> </TD>
- <TD vAlign="top" width="50%">char* buf</TD>
- <TD vAlign="top" width="50%">The buffer to fill in with the error message.</TD>
- <TD> </TD>
- </TR>
- <TR>
- <TD> </TD>
- <TD vAlign="top" width="50%">unsigned int buf_size</TD>
- <TD vAlign="top" width="50%">The length of buf.</TD>
- <TD> </TD>
- </TR>
- </TABLE>
- 
- If the error code is OR'ed with REG_ITOA then the message that results is the
- printable name of the code rather than a message, for example "REG_BADPAT". If
- the code is REG_ATIO then e must not be null and e->re_pend must
- point to the printable name of an error code, the return value is then the
- value of the error code. For any other value of code, the return value
- is the number of characters in the error message, if the return value is
- greater than or equal to buf_size then regerror will have to be
- called again with a larger buffer.
- <H3>regexec</H3>
- regexec finds the first occurrence of expression e within string buf.
- If len is non-zero then *m is filled in with what matched the
- regular expression, m[0] contains what matched the whole string, m[1] 
- the first sub-expression etc, see regmatch_t in the header file
- declaration for more details. The eflags parameter can be a combination
- of:
- 
-  
- 
- 
- <TABLE id="Table4" cellSpacing="0" cellPadding="7" width="100%" border="0">
- <TR>
- <TD width="5%"> </TD>
- <TD vAlign="top" width="50%">REG_NOTBOL</TD>
- <TD vAlign="top" width="50%">Parameter buf does not represent the start of
- a line.</TD>
- <TD width="5%"> </TD>
- </TR>
- <TR>
- <TD> </TD>
- <TD vAlign="top" width="50%">REG_NOTEOL</TD>
- <TD vAlign="top" width="50%">Parameter buf does not terminate at the end of
- a line.</TD>
- <TD> </TD>
- </TR>
- <TR>
- <TD> </TD>
- <TD vAlign="top" width="50%">REG_STARTEND</TD>
- <TD vAlign="top" width="50%">The string searched starts at buf + pmatch[0].rm_so
- and ends at buf + pmatch[0].rm_eo.</TD>
- <TD> </TD>
- </TR>
- </TABLE>
- 
- <H3>regfree</H3>
- Finally regfree frees all the memory that was allocated by regcomp.
- 
- Footnote: this is an abridged reference to the POSIX API functions, it is
- provided for compatibility with other libraries, rather than an API to be used
- in new code (unless you need access from a language other than C++). This
- version of these functions should also happily coexist with other versions, as
- the names used are macros that expand to the actual function names.
- 
- <HR>
- 
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/redistributables.html
==============================================================================
--- trunk/libs/regex/doc/redistributables.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,55 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Redistributables and Library Names</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Redistributables and Library Names</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- 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
- by defining the symbol BOOST_REGEX_DYN_LINK when you compile your code. While
- these dll's are redistributable, there are no "standard" versions, so when
- installing on the users PC, you should place these in a directory private to
- your application, and not in the PC's directory path. Note that if you link to
- a static version of your run time library, then you will also link to a static
- version of boost.regex and no dll's will need to be distributed. The possible
- boost.regex dll and library names are computed according to the <A href="../../../more/getting_started.html#step5">
- formula given in the getting started guide</A>.
- 
- Note: you can disable automatic library selection by defining the symbol
- BOOST_REGEX_NO_LIB when compiling, this is useful if you want to build
- Boost.Regex yourself in your IDE, or if you need to debug boost.regex.
- 
- 
- <HR>
- 
- Revised 
- 
- 28 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/reg_expression.html
==============================================================================
--- trunk/libs/regex/doc/reg_expression.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,44 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Class reg_expression (deprecated)</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Class reg_expression (deprecated)</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- The use of class template reg_expression is deprecated: use <A href="basic_regex.html">
- basic_regex</A> instead.
- 
- <HR>
- 
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/regbase.html
==============================================================================
--- trunk/libs/regex/doc/regbase.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,82 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
-<head>
-<meta name="generator" content="HTML Tidy, see www.w3.org">
-<title>Boost.Regex: regbase</title>
-<meta http-equiv="Content-Type" content=
-"text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-</head>
-<body>
-
-
-<table id="Table1" cellspacing="1" cellpadding="1" width="100%"
-border="0">
-<tr>
-<td valign="top" width="300">
-<h3><a href="../../../index.htm"><img height="86" width="277" alt=
-"C++ Boost" src="../../../boost.png" border="0"></a></h3>
-</td>
-<td width="353">
-<h1 align="center">Boost.Regex</h1>
-
-<h2 align="center">regbase</h2>
-</td>
-<td width="50">
-<h3><a href="index.html"><img height="45" width="43" alt=
-"Boost.Regex Index" src="uarrow.gif" border="0"></a></h3>
-</td>
-</tr>
-</table>
-
- 
- 
-
-
-<hr>
-Use of the type <code>boost::regbase</code> is now deprecated,
-and the type does not form a part of the <a href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1429.htm">
-regular expression standardization proposal</a>.  This type
-still exists as a base class of <code>boost::basic_regex</code>,
-and you can still refer to <code>
-boost::regbase::constant_name</code> in your code, however for
-maximum portability to other std regex implementations you should
-instead use either:
-
-<pre>
-boost::regex_constants::constant_name
-</pre>
-
-or
-
-<pre>
-boost::regex::constant_name
-</pre>
-
-or
-
-<pre>
-boost::wregex::constant_name
-</pre>
-
-
-
-<hr>
- 
- 
-
-
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
-</body>
-</html>
-
-

Deleted: trunk/libs/regex/doc/regex.html
==============================================================================
--- trunk/libs/regex/doc/regex.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,481 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: class RegEx (deprecated)</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">class RegEx (deprecated)</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- The high level wrapper class RegEx is now deprecated and does not form a part
- of the <a href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1429.htm">regular
- expression standardization proposal</a>.  This type still exists, and
- existing code will continue to compile, however the following documentation is
- unlikely to be further updated.
- <pre>
-#include <boost/cregex.hpp>
-</pre>
- The class RegEx provides a high level simplified interface to the regular
- expression library, this class only handles narrow character strings, and
- regular expressions always follow the "normal" syntax - that is the same as the
- perl / ECMAScript synatx.
- <pre>
-typedef bool (*GrepCallback)(const RegEx& expression);
-typedef bool (*GrepFileCallback)(const char* file, const RegEx& expression);
-typedef bool (*FindFilesCallback)(const char* file);
-
-class RegEx
-{
-public:
- RegEx();
- RegEx(const RegEx& o);
- ~RegEx();
- RegEx(const char* c, bool icase = false);
- explicit RegEx(const std::string& s, bool icase = false);
- RegEx& operator=(const RegEx& o);
- RegEx& operator=(const char* p);
- RegEx& operator=(const std::string& s);
- unsigned int SetExpression(const char* p, bool icase = false);
- unsigned int SetExpression(const std::string& s, bool icase = false);
- std::string Expression()const;
- //
- // now matching operators:
- //
- bool Match(const char* p, boost::match_flag_type flags = match_default);
- bool Match(const std::string& s, boost::match_flag_type flags = match_default);
- bool Search(const char* p, boost::match_flag_type flags = match_default);
- bool Search(const std::string& s, boost::match_flag_type flags = match_default);
- unsigned int Grep(GrepCallback cb, const char* p, boost::match_flag_type flags = match_default);
- unsigned int Grep(GrepCallback cb, const std::string& s, boost::match_flag_type flags = match_default);
- unsigned int Grep(std::vector<std::string>& v, const char* p, boost::match_flag_type flags = match_default);
- unsigned int Grep(std::vector<std::string>& v, const std::string& s, boost::match_flag_type flags = match_default);
- unsigned int Grep(std::vector<unsigned int>& v, const char* p, boost::match_flag_type flags = match_default);
- unsigned int Grep(std::vector<unsigned int>& v, const std::string& s, boost::match_flag_type flags = match_default);
- unsigned int GrepFiles(GrepFileCallback cb, const char* files, bool recurse = false, boost::match_flag_type flags = match_default);
- unsigned int GrepFiles(GrepFileCallback cb, const std::string& files, bool recurse = false, boost::match_flag_type flags = match_default);
- unsigned int FindFiles(FindFilesCallback cb, const char* files, bool recurse = false, boost::match_flag_type flags = match_default);
- unsigned int FindFiles(FindFilesCallback cb, const std::string& files, bool recurse = false, boost::match_flag_type flags = match_default);
- std::string Merge(const std::string& in, const std::string& fmt, bool copy = true, boost::match_flag_type flags = match_default);
- std::string Merge(const char* in, const char* fmt, bool copy = true, boost::match_flag_type flags = match_default);
- unsigned Split(std::vector<std::string>& v, std::string& s, boost::match_flag_type flags = match_default, unsigned max_count = ~0);
- //
- // now operators for returning what matched in more detail:
- //
- unsigned int Position(int i = 0)const;
- unsigned int Length(int i = 0)const;
- bool Matched(int i = 0)const;
- unsigned int Line()const;
- unsigned int Marks() const;
- std::string What(int i)const;
- std::string operator[](int i)const ;
-
- static const unsigned int npos;
-};
-</pre>
- Member functions for class RegEx are defined as follows: 
-  
- 
- <table id="Table2" cellspacing="0" cellpadding="7" width="100%" border="0">
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">RegEx();</td>
- <td valign="top" width="42%">Default constructor, constructs an instance of RegEx
- without any valid expression.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">RegEx(const RegEx& o);</td>
- <td valign="top" width="42%">Copy constructor, all the properties of parameter o
- are copied.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">RegEx(const char* c, bool icase
- = false);</td>
- <td valign="top" width="42%">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.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">RegEx(const std::string& s, bool icase
- = false);</td>
- <td valign="top" width="42%">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.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">RegEx& operator=(const RegEx&
- o);</td>
- <td valign="top" width="42%">Default assignment operator.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">RegEx& operator=(const char*
- p);</td>
- <td valign="top" width="42%">Assignment operator, equivalent to calling SetExpression(p,
- false). Throws bad_expression on failure.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">RegEx& operator=(const std::string&
- s);</td>
- <td valign="top" width="42%">Assignment operator, equivalent to calling SetExpression(s,
- false). Throws bad_expression on failure.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int SetExpression(constchar*
- p, bool icase = false);</td>
- <td valign="top" width="42%">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.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int SetExpression(const
- std::string& s, bool icase = false);</td>
- <td valign="top" width="42%">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.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">std::string Expression()const;</td>
- <td valign="top" width="42%">Returns a copy of the current regular expression.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">bool Match(const char* p,
- boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Attempts to match the current expression against the
- text p using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. Returns true if the expression matches the whole of
- the input string.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">bool Match(const std::string& s,
- boost::match_flag_type flags = match_default) ;</td>
- <td valign="top" width="42%">Attempts to match the current expression against the
- text s using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. Returns true if the expression matches the whole of
- the input string.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">bool Search(const char* p,
- boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Attempts to find a match for the current expression
- somewhere in the text p using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. Returns true if the match succeeds.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">bool Search(const std::string& s,
- boost::match_flag_type flags = match_default) ;</td>
- <td valign="top" width="42%">Attempts to find a match for the current expression
- somewhere in the text s using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. Returns true if the match succeeds.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Grep(GrepCallback cb, const
- char* p, boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Finds all matches of the current expression in the
- text p using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. 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.
- </td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Grep(GrepCallback cb, const
- std::string& s, boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Finds all matches of the current expression in the
- text s using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. 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.
- </td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Grep(std::vector<std::string>&
- v, const char* p, boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Finds all matches of the current expression in the
- text p using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. For each match pushes a copy of what matched onto v.
- Returns the number of matches found.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Grep(std::vector<std::string>&
- v, const std::string& s, boost::match_flag_type flags =
- match_default);</td>
- <td valign="top" width="42%">Finds all matches of the current expression in the
- text s using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. For each match pushes a copy of what matched onto v.
- Returns the number of matches found.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Grep(std::vector<unsigned
- int>& v, const char* p, boost::match_flag_type
- flags = match_default);</td>
- <td valign="top" width="42%">Finds all matches of the current expression in the
- text p using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. For each match pushes the starting index of what matched
- onto v. Returns the number of matches found.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Grep(std::vector<unsigned
- int>& v, const std::string& s, boost::match_flag_type
- flags = match_default);</td>
- <td valign="top" width="42%">Finds all matches of the current expression in the
- text s using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. For each match pushes the starting index of what matched
- onto v. Returns the number of matches found.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int GrepFiles(GrepFileCallback
- cb, const char* files, bool recurse = false,
- boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Finds all matches of the current expression in the
- files files using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. 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. 
- The parameter files can include wild card characters '*' and '?', if the
- parameter recurse is true then searches sub-directories for matching
- file names. 
- Returns the total number of matches found.
- May throw an exception derived from std::runtime_error if file io fails.
- </td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int GrepFiles(GrepFileCallback
- cb, const std::string& files, bool recurse = false,
- boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Finds all matches of the current expression in the
- files files using the match flags flags - see <a href="match_flag_type.html">
- match flags</a>. 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. 
- The parameter files can include wild card characters '*' and '?', if the
- parameter recurse is true then searches sub-directories for matching
- file names. 
- Returns the total number of matches found.
- May throw an exception derived from std::runtime_error if file io fails.
- </td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int FindFiles(FindFilesCallback
- cb, const char* files, bool recurse = false,
- boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Searches files to find all those which contain
- at least one match of the current expression using the match flags flags
- - see match 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. 
- The parameter files can include wild card characters '*' and '?', if the
- parameter recurse is true then searches sub-directories for matching
- file names. 
- Returns the total number of files found.
- May throw an exception derived from std::runtime_error if file io fails.
- </td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int FindFiles(FindFilesCallback
- cb, const std::string& files, bool recurse = false,
- boost::match_flag_type flags = match_default);</td>
- <td valign="top" width="42%">Searches files to find all those which contain
- at least one match of the current expression using the match flags flags
- - see match 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. 
- The parameter files can include wild card characters '*' and '?', if the
- parameter recurse is true then searches sub-directories for matching
- file names. 
- Returns the total number of files found.
- May throw an exception derived from std::runtime_error if file io fails.
- </td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">std::string Merge(const std::string& in, const
- std::string& fmt, bool copy = true, boost::match_flag_type
- flags = match_default);</td>
- <td valign="top" width="42%">Performs a search and replace operation: searches
- through the string in for all occurrences of the current expression, for
- each occurrence replaces the match with the format string fmt. Uses flags
- to determine what gets matched, and how the format string should be treated. 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 <a href="format_syntax.html">
- also format string syntax</a>, match flags
- and format flags.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">std::string Merge(const char* in, const
- char* fmt, bool copy = true, boost::match_flag_type flags =
- match_default);</td>
- <td valign="top" width="42%">Performs a search and replace operation: searches
- through the string in for all occurrences of the current expression, for
- each occurrence replaces the match with the format string fmt. Uses flags
- to determine what gets matched, and how the format string should be treated. 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 <a href="format_syntax.html">
- also format string syntax</a>, match flags
- and format flags.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td> </td>
- <td valign="top">unsigned Split(std::vector<std::string>& v,
- std::string& s, boost::match_flag_type flags = match_default, unsigned
- max_count = ~0);</td>
- <td valign="top">Splits the input string and pushes each one onto the vector. If
- the expression contains no marked sub-expressions, then one string is outputted
- for each section of the input that does not match the expression. If the
- expression does contain marked sub-expressions, then outputs one string for
- each marked sub-expression each time a match occurs. Outputs no more than max_count
- strings. Before returning, deletes from the input string s all of the
- input that has been processed (all of the string if max_count was not
- reached). Returns the number of strings pushed onto the vector.</td>
- <td> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Position(int i = 0)const;</td>
- <td valign="top" width="42%">Returns the position of what matched sub-expression i.
- 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.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Length(int i = 0)const;</td>
- <td valign="top" width="42%">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.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td> </td>
- <td>bool Matched(int i = 0)const;</td>
- <td>Returns true if sub-expression i was matched, false otherwise.</td>
- <td> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Line()const;</td>
- <td valign="top" width="42%">Returns the line on which the match occurred, indexes
- start from 1 not zero, if no match occurred then returns RegEx::npos.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">unsigned int Marks() const;</td>
- <td valign="top" width="42%">Returns the number of marked sub-expressions
- contained in the expression. Note that this includes the whole match
- (sub-expression zero), so the value returned is always >= 1.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">std::string What(int i)const;</td>
- <td valign="top" width="42%">Returns a copy of what matched sub-expression i.
- 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.</td>
- <td valign="top" width="7%"> </td>
- </tr>
- <tr>
- <td valign="top" width="7%"> </td>
- <td valign="top" width="43%">std::string operator[](int i)const
- ;</td>
- <td valign="top" width="42%">Returns what(i);
- Can be used to simplify access to sub-expression matches, and make usage more
- perl-like.
- </td>
- <td valign="top" width="7%"> </td>
- </tr>
- </table>
- 
- 
- 
- <hr>
- Revised
- 
- 04 Feb 2004
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/regex_format.html
==============================================================================
--- trunk/libs/regex/doc/regex_format.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,204 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
-<head>
-<meta name="generator" content="HTML Tidy, see www.w3.org">
-<title>Boost.Regex: Algorithm regex_format (deprecated)</title>
-<meta http-equiv="Content-Type" content=
-"text/html; charset=iso-8859-1">
-<link rel="stylesheet" type="text/css" href="../../../boost.css">
-</head>
-<body>
-
-
-<table id="Table1" cellspacing="1" cellpadding="1" width="100%"
-border="0">
-<tr>
-<td valign="top" width="300">
-<h3><a href="../../../index.htm"><img height="86" width="277" alt=
-"C++ Boost" src="../../../boost.png" border="0"></a></h3>
-</td>
-<td width="353">
-<h1 align="center">Boost.Regex</h1>
-
-<h2 align="center">Algorithm regex_format (deprecated)</h2>
-</td>
-<td width="50">
-<h3><a href="index.html"><img height="45" width="43" alt=
-"Boost.Regex Index" src="uarrow.gif" border="0"></a></h3>
-</td>
-</tr>
-</table>
-
- 
- 
-
-
-<hr>
-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:
-
-<h3>Algorithm regex_format</h3>
-
-<pre>
-#include <boost/regex.hpp>
-</pre>
-
-The algorithm regex_format takes the results of a match and
-creates a new string based upon a <a href="format_syntax.html">
-format string</a>, regex_format can be used for search and replace
-operations:
-
-<pre>
-template <class OutputIterator, class iterator, class Allocator, class charT>
-OutputIterator regex_format(OutputIterator out,
- const match_results<iterator, Allocator>& m,
- const charT* fmt,
- match_flag_type flags = 0);
-template <class OutputIterator, class iterator, class Allocator, class charT>
-OutputIterator regex_format(OutputIterator out,
- const match_results<iterator, Allocator>& m,
- const std::basic_string<charT>& fmt,
- match_flag_type flags = 0);
-</pre>
-
-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 [note - this version may not be
-available, or may be available in a more limited form, depending
-upon your compilers capabilities]:
-
-<pre>
-template <class iterator, class Allocator, class charT>
-std::basic_string<charT> regex_format
- (const match_results<iterator, Allocator>& m,
- const charT* fmt,
- match_flag_type flags = 0);
-
-template <class iterator, class Allocator, class charT>
-std::basic_string<charT> regex_format
- (const match_results<iterator, Allocator>& m,
- const std::basic_string<charT>& fmt,
- match_flag_type flags = 0);
-</pre>
-
-Parameters to the main version of the function are passed as
-follows:
-
-
-
-<table id="Table2" cellspacing="0" cellpadding="7" width="100%"
-border="0">
-<tr>
-<td valign="top" width="9%"> </td>
-<td valign="top" width="39%">OutputIterator out</td>
-<td valign="top" width="44%">An output iterator type, the output
-string is sent to this iterator. Typically this would be a
-std::ostream_iterator.</td>
-<td valign="top" width="9%"> </td>
-</tr>
-
-<tr>
-<td valign="top" width="9%"> </td>
-<td valign="top" width="39%">const
-match_results<iterator, Allocator>& m</td>
-<td valign="top" width="44%">An instance of match_results<>
-obtained from one of the matching algorithms above, and denoting
-what matched.</td>
-<td valign="top" width="9%"> </td>
-</tr>
-
-<tr>
-<td valign="top" width="9%"> </td>
-<td valign="top" width="39%">const charT* fmt</td>
-<td valign="top" width="44%">A format string that determines how
-the match is transformed into the new string.</td>
-<td valign="top" width="9%"> </td>
-</tr>
-
-<tr>
-<td valign="top" width="9%"> </td>
-<td valign="top" width="39%">unsigned flags</td>
-<td valign="top" width="44%">Optional flags which describe how the
-format string is to be interpreted.</td>
-<td valign="top" width="9%"> </td>
-</tr>
-</table>
-
- 
- 
-
-
-<a name="format_flags"></a>Format flags are defined as
-follows:
-
-
-
-<table id="Table3" cellspacing="0" cellpadding="7" width="100%"
-border="0">
-<tr>
-<td valign="top" width="9%"> </td>
-<td valign="top" width="39%">format_all</td>
-<td valign="top" width="43%">Enables all syntax options (perl-like
-plus extentions).</td>
-<td valign="top" width="9%"> </td>
-</tr>
-
-<tr>
-<td valign="top" width="9%"> </td>
-<td valign="top" width="39%">format_sed</td>
-<td valign="top" width="43%">Allows only a sed-like syntax.</td>
-<td valign="top" width="9%"> </td>
-</tr>
-
-<tr>
-<td valign="top" width="9%"> </td>
-<td valign="top" width="39%">format_perl</td>
-<td valign="top" width="43%">Allows only a perl-like syntax.</td>
-<td valign="top" width="9%"> </td>
-</tr>
-
-<tr>
-<td valign="top" width="9%"> </td>
-<td valign="top" width="39%">format_no_copy</td>
-<td valign="top" width="43%">Disables copying of unmatched sections
-to the output string during <a href="regex_merge.html">
-regex_merge</a> operations.</td>
-<td valign="top" width="9%"> </td>
-</tr>
-
-<tr>
-<td> </td>
-<td>format_first_only</td>
-<td>When this flag is set only the first occurance will be replaced
-(applies to regex_merge only).</td>
-<td> </td>
-</tr>
-</table>
-
- 
- 
-
-
-The format string syntax (and available options) is described
-more fully under format strings
-.
-
-
-
-<hr>
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
-</body>
-</html>
-
-

Deleted: trunk/libs/regex/doc/regex_grep.html
==============================================================================
--- trunk/libs/regex/doc/regex_grep.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,377 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Algorithm regex_grep (deprecated)</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">Algorithm regex_grep (deprecated)</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- The algorithm regex_grep is deprecated in favor of regex_iterator
- which provides a more convenient and standard library friendly interface.
- The following documentation is taken unchanged from the previous boost release,
- and will not be updated in future.
- <hr>
- <pre>
-#include <boost/regex.hpp>
-</pre>
- 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:
- <pre>
-template <class Predicate, class iterator, class charT, class traits>
-unsigned int regex_grep(Predicate foo,
- iterator first,
- iterator last,
- const basic_regex<charT, traits>& e,
- boost::match_flag_type flags = match_default)
-</pre>
- The library also defines the following convenience versions, which take either
- a const charT*, or a const std::basic_string<>& in place of a pair of
- iterators [note - these versions may not be available, or may be available in a
- more limited form, depending upon your compilers capabilities]:
- <pre>
-template <class Predicate, class charT, class traits>
-unsigned int regex_grep(Predicate foo,
- const charT* str,
- const basic_regex<charT, traits>& e,
- boost::match_flag_type flags = match_default);
-
-template <class Predicate, class ST, class SA, class charT, class traits>
-unsigned int regex_grep(Predicate foo,
- const std::basic_string<charT, ST, SA>& s,
- const basic_regex<charT, traits>& e,
- boost::match_flag_type flags = match_default);
-</pre>
- The parameters for the primary version of regex_grep have the following
- meanings: 
- 
- <table id="Table2" cellspacing="0" cellpadding="7" width="624" border="0">
- <tr>
- <td width="5%"> </td>
- <td valign="top" width="50%">foo</td>
- <td valign="top" width="50%">A predicate function object or function pointer, see
- below for more information.</td>
- <td width="5%"> </td>
- </tr>
- <tr>
- <td> </td>
- <td valign="top" width="50%">first</td>
- <td valign="top" width="50%">The start of the range to search.</td>
- <td> </td>
- </tr>
- <tr>
- <td> </td>
- <td valign="top" width="50%">last</td>
- <td valign="top" width="50%">The end of the range to search.</td>
- <td> </td>
- </tr>
- <tr>
- <td> </td>
- <td valign="top" width="50%">e</td>
- <td valign="top" width="50%">The regular expression to search for.</td>
- <td> </td>
- </tr>
- <tr>
- <td> </td>
- <td valign="top" width="50%">flags</td>
- <td valign="top" width="50%">The flags that determine how matching is carried out,
- one of the match_flags enumerators.</td>
- <td> </td>
- </tr>
- </table>
- 
- 
- 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 on what matched, and calls the predicate
- foo, passing 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.
- The general form of the predicate is:
- <pre>
-struct grep_predicate
-{
- bool operator()(const match_results<iterator_type>& m);
-};
-</pre>
- For example the regular expression "a*b" would find one match in the string
- "aaaaab" and two in the string "aaabb".
- Remember this algorithm can be used for a lot more than implementing a version
- of grep, the predicate can be and do anything that you want, grep 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 to create recursive parsers.
- The algorithm may throw <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- Example: convert
- the example from regex_search to use regex_grep instead:
- <pre>
-#include <string>
-#include <map>
-#include <boost/regex.hpp>
-
-// IndexClasses:
-// takes the contents of a file in the form of a string
-// and searches for all the C++ class definitions, storing
-// their locations in a map of strings/int's
-typedef std::map<std::string, int, std::less<std::string> > map_type;
-
-const char* re =
- // possibly leading whitespace:
- "^[[:space:]]*"
- // possible template declaration:
- "(template[[:space:]]*<[^;:{]+>[[:space:]]*)?"
- // class or struct:
- "(class|struct)[[:space:]]*"
- // leading declspec macros etc:
- "("
- "\\<\\w+\\>"
- "("
- "[[:blank:]]*\$[^)]*\$"
- ")?"
- "[[:space:]]*"
- ")*"
- // the class name
- "(\\<\\w*\\>)[[:space:]]*"
- // template specialisation parameters
- "(<[^;:{]+>)?[[:space:]]*"
- // terminate in { or :
- "(\\{|:[^;\\{()]*\\{)";
-
-boost::regex expression(re);
-class IndexClassesPred
-{
- map_type& m;
- std::string::const_iterator base;
-public:
- IndexClassesPred(map_type& a, std::string::const_iterator b) : m(a), base(b) {}
- bool operator()(const smatch& what)
- {
- // what[0] contains the whole string
- // what[5] contains the class name.
- // what[6] contains the template specialisation if any.
- // add class name and position to map:
- m[std::string(what[5].first, what[5].second) + std::string(what[6].first, what[6].second)] =
- what[5].first - base;
- return true;
- }
-};
-void IndexClasses(map_type& m, const std::string& file)
-{
- std::string::const_iterator start, end;
- start = file.begin();
- end = file.end();
- regex_grep(IndexClassesPred(m, start), start, end, expression);
-}
-</pre>
- Example: Use
- regex_grep to call a global callback function:
- <pre>
-#include <string>
-#include <map>
-#include <boost/regex.hpp>
-
-// purpose:
-// takes the contents of a file in the form of a string
-// and searches for all the C++ class definitions, storing
-// their locations in a map of strings/int's
-typedef std::map<std::string, int, std::less<std::string> > map_type;
-
-const char* re =
- // possibly leading whitespace:
- "^[[:space:]]*"
- // possible template declaration:
- "(template[[:space:]]*<[^;:{]+>[[:space:]]*)?"
- // class or struct:
- "(class|struct)[[:space:]]*"
- // leading declspec macros etc:
- "("
- "\\<\\w+\\>"
- "("
- "[[:blank:]]*\$[^)]*\$"
- ")?"
- "[[:space:]]*"
- ")*"
- // the class name
- "(\\<\\w*\\>)[[:space:]]*"
- // template specialisation parameters
- "(<[^;:{]+>)?[[:space:]]*"
- // terminate in { or :
- "(\\{|:[^;\\{()]*\\{)";
-
-boost::regex expression(re);
-map_type class_index;
-std::string::const_iterator base;
-
-bool grep_callback(const boost::smatch& what)
-{
- // what[0] contains the whole string
- // what[5] contains the class name.
- // what[6] contains the template specialisation if any.
- // add class name and position to map:
- class_index[std::string(what[5].first, what[5].second) + std::string(what[6].first, what[6].second)] =
- what[5].first - base;
- return true;
-}
-void IndexClasses(const std::string& file)
-{
- std::string::const_iterator start, end;
- start = file.begin();
- end = file.end();
- base = start;
- regex_grep(grep_callback, start, end, expression, match_default);
-}
-
-</pre>
- 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:
- <pre>
-#include <string>
-#include <map>
-#include <boost/regex.hpp>
-#include <functional>
-// purpose:
-// takes the contents of a file in the form of a string
-// and searches for all the C++ class definitions, storing
-// their locations in a map of strings/int's
-
-typedef std::map<std::string, int, std::less<std::string> > map_type;
-class class_index
-{
- boost::regex expression;
- map_type index;
- std::string::const_iterator base;
- bool grep_callback(boost::smatch what);
-public:
- void IndexClasses(const std::string& file);
- class_index()
- : index(),
- expression("^(template[[:space:]]*<[^;:{]+>[[:space:]]*)?"
- "(class|struct)[[:space:]]*(\\<\\w+\\>([[:blank:]]*\$[^)]*\$)?"
- "[[:space:]]*)*(\\<\\w*\\>)[[:space:]]*(<[^;:{]+>[[:space:]]*)?"
- "(\\{|:[^;\\{()]*\\{)"
- ){}
-};
-bool class_index::grep_callback(boost::smatch what)
-{
- // what[0] contains the whole string
- // what[5] contains the class name.
- // what[6] contains the template specialisation if any.
- // add class name and position to map:
- index[std::string(what[5].first, what[5].second) + std::string(what[6].first, what[6].second)] =
- what[5].first - base;
- return true;
-}
-
-void class_index::IndexClasses(const std::string& file)
-{
- std::string::const_iterator start, end;
- start = file.begin();
- end = file.end();
- base = start;
- regex_grep(std::bind1st(std::mem_fun(&class_index::grep_callback), this),
- start,
- end,
- expression);
-}
-
-</pre>
- Finally, C++
- Builder users can use C++ Builder's closure type as a callback argument:
- <pre>
-#include <string>
-#include <map>
-#include <boost/regex.hpp>
-#include <functional>
-// purpose:
-// takes the contents of a file in the form of a string
-// and searches for all the C++ class definitions, storing
-// their locations in a map of strings/int's
-
-typedef std::map<std::string, int, std::less<std::string> > map_type;
-class class_index
-{
- boost::regex expression;
- map_type index;
- std::string::const_iterator base;
- typedef boost::smatch arg_type;
- bool grep_callback(const arg_type& what);
-public:
- typedef bool (__closure* grep_callback_type)(const arg_type&);
- void IndexClasses(const std::string& file);
- class_index()
- : index(),
- expression("^(template[[:space:]]*<[^;:{]+>[[:space:]]*)?"
- "(class|struct)[[:space:]]*(\\<\\w+\\>([[:blank:]]*\$[^)]*\$)?"
- "[[:space:]]*)*(\\<\\w*\\>)[[:space:]]*(<[^;:{]+>[[:space:]]*)?"
- "(\\{|:[^;\\{()]*\\{)"
- ){}
-};
-
-bool class_index::grep_callback(const arg_type& what)
-{
- // what[0] contains the whole string
-// what[5] contains the class name.
-// what[6] contains the template specialisation if any.
-// add class name and position to map:
-index[std::string(what[5].first, what[5].second) + std::string(what[6].first, what[6].second)] =
- what[5].first - base;
- return true;
-}
-
-void class_index::IndexClasses(const std::string& file)
-{
- std::string::const_iterator start, end;
- start = file.begin();
- end = file.end();
- base = start;
- class_index::grep_callback_type cl = &(this->grep_callback);
- regex_grep(cl,
- start,
- end,
- expression);
-}
-</pre>
- 
- <hr>
- Revised
- 
- 26 June 2004
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/regex_iterator.html
==============================================================================
--- trunk/libs/regex/doc/regex_iterator.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,456 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: regex_iterator</title>
- <meta name="generator" content="HTML Tidy, see www.w3.org">
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link href="../../../boost.css" type="text/css" rel="stylesheet">
- </head>
- <body>
- 
- <table id="Table1" cellspacing="1" cellpadding="1" width="100%" border="0">
- <tr>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <td width="353">
- <h1 align="center">Boost.Regex</h1>
- <h2 align="center">regex_iterator</h2>
- </td>
- <td width="50">
- <h3></h3>
- </td>
- </tr>
- </table>
- 
- 
- <hr>
- <h3>Contents</h3>
- <dl class="index">
- <dt>Synopsis <dt>Description <dt><a href="#examples">
- Examples</a></dt>
- </dl>
- <h3><a name="synopsis"></a>Synopsis</h3>
- 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.
- <pre>
-template <class BidirectionalIterator,
- class charT = iterator_traits<BidirectionalIterator>::value_type,
- class traits = regex_traits<charT> >
-class regex_iterator
-{
-public:
- typedef basic_regex<charT, traits> regex_type;
- typedef match_results<BidirectionalIterator> value_type;
- typedef typename iterator_traits<BidirectionalIterator>::difference_type difference_type;
- typedef const value_type* pointer;
- typedef const value_type& reference;
- typedef std::forward_iterator_tag iterator_category;
-
- regex_iterator();
- regex_iterator(BidirectionalIterator a, BidirectionalIterator b,
- const regex_type& re,
- match_flag_type m = match_default);
- regex_iterator(const regex_iterator&);
- regex_iterator& operator=(const regex_iterator&);
- bool operator==(const regex_iterator&)const;
- bool operator!=(const regex_iterator&)const;
- const value_type& operator*()const;
- const value_type* operator->()const;
- regex_iterator& operator++();
- regex_iterator operator++(int);
-};
-
-typedef
-regex_iterator<const
-
-char*> cregex_iterator; typedef regex_iterator<std::string::const_iterator>
-sregex_iterator; #ifndef BOOST_NO_WREGEX
-typedef regex_iterator<const
-wchar_t*> wcregex_iterator; typedef regex_iterator<std::wstring::const_iterator>
-wsregex_iterator; #endif template
-<class
-
-charT, class traits> regex_iterator<const charT*,
-charT, traits>
- make_regex_iterator(const charT* p, const basic_regex<charT, traits>& e, regex_constants::match_flag_type m = regex_constants::match_default); template <class
-
-charT, class traits, class ST, class SA> regex_iterator<typename std::basic_string<charT,
-ST, SA>::const_iterator, charT, traits>
- make_regex_iterator(const std::basic_string<charT, ST, SA>& p, const basic_regex<charT, traits>& e, regex_constants::match_flag_type m = regex_constants::match_default);
-
-</pre>
- <h3><a name="description"></a>Description</h3>
- A regex_iterator is constructed from a pair of iterators, and enumerates all
- occurrences of a regular expression within that iterator range.
- <pre><A name=c1></A>
-regex_iterator();
-</pre>
- 
- Effects: constructs an end of sequence regex_iterator.
- <pre><A name=c2></A>regex_iterator(BidirectionalIterator a, BidirectionalIterator b,
- const regex_type& re,
- match_flag_type m = match_default);
-</pre>
- 
- Effects: constructs a regex_iterator that will enumerate all occurrences
- of the expression re, within the sequence [a,b), and found
- using match flags m.  The object re must exist for the
- lifetime of the regex_iterator.
- Throws: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- <pre><A name=c3></A>
-regex_iterator(const regex_iterator& that);
-</pre>
- 
- Effects: constructs a copy of <code>that</code>.
- 
- Postconditions: <code>*this == that</code>.
- <pre><A name=o1></A>
-regex_iterator& operator=(const regex_iterator&);
-</pre>
- 
- Effects: sets <code>*this</code> equal to those in <code>that</code>.
- 
- Postconditions: <code>*this == that</code>.
- <pre><A name=o2></A>
-bool operator==(const regex_iterator& that)const;
-</pre>
- 
- Effects: returns true if *this is equal to that.
- <pre><A name=o3></A>
-bool operator!=(const regex_iterator&)const;
-</pre>
- 
- Effects: returns <code>!(*this == that)</code>.
- <pre><A name=o4></A>
-const value_type& operator*()const;
-</pre>
- Effects: dereferencing a regex_iterator object it yields a
- const reference to a match_results object,
- whose members are set as follows:
- 
- <table id="Table2" cellspacing="1" cellpadding="7" width="624" border="1">
- <tbody>
- <tr>
- <td valign="top" width="50%">
- Element
- </td>
- <td valign="top" width="50%">
- Value
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it).size()
- </td>
- <td valign="top" width="50%">
- re.mark_count()
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it).empty()
- </td>
- <td valign="top" width="50%">
- false
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it).prefix().first
- </td>
- <td valign="top" width="50%">
- The end of the last match found, or the start of the underlying sequence if
- this is the first match enumerated
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it).prefix().last
- </td>
- <td valign="top" width="50%">
- The same as the start of the match found: 
- (*it)[0].first
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it).prefix().matched
- </td>
- <td valign="top" width="50%">
- True if the prefix did not match an empty string: 
- (*it).prefix().first != (*it).prefix().second
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it).suffix().first
- </td>
- <td valign="top" width="50%">
- The same as the end of the match found: 
- (*it)[0].second
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it).suffix().last
- </td>
- <td valign="top" width="50%">
- The end of the underlying sequence.
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it).suffix().matched
- </td>
- <td valign="top" width="50%">
- True if the suffix did not match an empty string: 
- (*it).suffix().first != (*it).suffix().second
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it)[0].first
- </td>
- <td valign="top" width="50%">
- The start of the sequence of characters that matched the regular expression
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it)[0].second
- </td>
- <td valign="top" width="50%">
- The end of the sequence of characters that matched the regular expression
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it)[0].matched
- </td>
- <td valign="top" width="50%">
- <code>true</code> if a full match was found, and <code>false</code> if it was a
- partial match (found as a result of the <code>match_partial</code> flag being
- set).
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it)[n].first
- </td>
- <td valign="top" width="50%">
- 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.
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it)[n].second
- </td>
- <td valign="top" width="50%">
- 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.
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">
- (*it)[n].matched
- </td>
- <td valign="top" width="50%">
- For all integers n < (*it).size(), true if sub-expression n participated
- in the match, false otherwise.
- </td>
- </tr>
- <tr>
- <td valign="top" width="50%">(*it).position(n)</td>
- <td valign="top" width="50%">For all integers n < (*it).size(), then the
- distance from the start of the underlying sequence to the start of
- sub-expression match n.</td>
- </tr>
- </tbody>
- </table>
- 
- 
- <pre><A name=o5></A>
-const value_type* operator->()const;
-</pre>
- 
- Effects: returns <code>&(*this)</code>.
- <pre><A name=o6></A>
-regex_iterator& operator++();
-</pre>
- 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 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: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- 
- Returns: <code>*this</code>.
- <pre><A name=o7></A>
-regex_iterator operator++(int);
-</pre>
- 
- Effects: constructs a copy <code>result</code> of <code>*this</code>,
- then calls <code>++(*this)</code>.
- 
- Returns: <code>result</code>.
- <PRE><A name=make_regex_iterator></A>template <class charT, class traits> regex_iterator<const charT*, charT, traits>
-make_regex_iterator(const charT*
- p, const basic_regex<charT,
- traits>& e, regex_constants::match_flag_type m
- = regex_constants::match_default); template <class
-
-charT, class traits, class ST, class SA> regex_iterator<typename std::basic_string<charT,
-ST, SA>::const_iterator, charT, traits>
- make_regex_iterator(const std::basic_string<charT, ST, SA>& p,
- const basic_regex<charT, traits>& e,
- regex_constants::match_flag_type m = regex_constants::match_default);
-</PRE>
- Effects: returns an iterator that enumerates all occurences of
- expression e in text p using match_flags m.
- <h3><a name=examples></a>Examples</h3>
- 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.
- <pre>
-#include <string>
-#include <map>
-#include <fstream>
-#include <iostream>
-#include <boost/regex.hpp>
-
-using namespace std;
-
-// purpose:
-// takes the contents of a file in the form of a string
-// and searches for all the C++ class definitions, storing
-// their locations in a map of strings/int's
-
-typedef std::map<std::string, std::string::difference_type, std::less<std::string> > map_type;
-
-const char* re =
- // possibly leading whitespace: 
- "^[[:space:]]*"
- // possible template declaration:
- "(template[[:space:]]*<[^;:{]+>[[:space:]]*)?"
- // class or struct:
- "(class|struct)[[:space:]]*"
- // leading declspec macros etc:
- "("
- "\\<\\w+\\>"
- "("
- "[[:blank:]]*\$[^)]*\$"
- ")?"
- "[[:space:]]*"
- ")*"
- // the class name
- "(\\<\\w*\\>)[[:space:]]*"
- // template specialisation parameters
- "(<[^;:{]+>)?[[:space:]]*"
- // terminate in { or :
- "(\\{|:[^;\\{()]*\\{)";
-
-
-boost::regex expression(re);
-map_type class_index;
-
-bool regex_callback(const boost::match_results<std::string::const_iterator>& what)
-{
- // what[0] contains the whole string
- // what[5] contains the class name.
- // what[6] contains the template specialisation if any.
- // add class name and position to map:
- class_index[what[5].str() + what[6].str()] = what.position(5);
- return true;
-}
-
-void load_file(std::string& s, std::istream& is)
-{
- s.erase();
- s.reserve(is.rdbuf()->in_avail());
- char c;
- while(is.get(c))
- {
- if(s.capacity() == s.size())
- s.reserve(s.capacity() * 3);
- s.append(1, c);
- }
-}
-
-int main(int argc, const char** argv)
-{
- std::string text;
- for(int i = 1; i < argc; ++i)
- {
- cout << "Processing file " << argv[i] << endl;
- std::ifstream fs(argv[i]);
- load_file(text, fs);
- // construct our iterators:
- boost::sregex_iterator m1(text.begin(), text.end(), expression);
- boost::sregex_iterator m2;
- std::for_each(m1, m2, &regex_callback);
- // copy results:
- cout << class_index.size() << " matches found" << endl;
- map_type::iterator c, d;
- c = class_index.begin();
- d = class_index.end();
- while(c != d)
- {
- cout << "class \"" << (*c).first << "\" found at index: " << (*c).second << endl;
- ++c;
- }
- class_index.erase(class_index.begin(), class_index.end());
- }
- return 0;
-}
-</pre>
- <hr>
- Revised  
- 
- 06 Jan 05 
- 
- © Copyright John Maddock 1998-
-  2005
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/regex_match.html
==============================================================================
--- trunk/libs/regex/doc/regex_match.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,318 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Algorithm regex_match</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Algorithm regex_match</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>Description <dt><a href="#examples">
- Examples</a></dt>
- </dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- <PRE><A name=query_match></A>#include <boost/regex.hpp> </PRE>
- 
- 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.
- 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 <A href="regex_search.html">
- regex_search</A> with the flag match_continuous
- set.
- <PRE>
-template <class BidirectionalIterator, class Allocator, class charT, class traits>
-bool regex_match(BidirectionalIterator first, BidirectionalIterator last,
- match_results<BidirectionalIterator, Allocator>& m,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);
-
-template <class BidirectionalIterator, class charT, class traits>
-bool regex_match(BidirectionalIterator first, BidirectionalIterator last,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);
-
-template <class charT, class Allocator, class traits>
-bool regex_match(const charT* str, match_results<const charT*, Allocator>& m,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);
-
-template <class ST, class SA, class Allocator, class charT, class traits>
-bool regex_match(const basic_string<charT, ST, SA>& s,
- match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);
-
-template <class charT, class traits>
-bool regex_match(const charT* str,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);
-
-template <class ST, class SA, class charT, class traits>
-bool regex_match(const basic_string<charT, ST, SA>& s,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);
-</PRE>
- <H3><A name="description"></A>Description</H3>
- <PRE><A name=f1></A>template <class BidirectionalIterator, class Allocator, class charT, class traits>
-bool regex_match(BidirectionalIterator first, BidirectionalIterator last,
- match_results<BidirectionalIterator, Allocator>& m,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Requires: Type BidirectionalIterator meets the requirements of a
- Bidirectional Iterator (24.1.4).
- Effects: Determines whether there is an exact match between the regular
- expression e, and all of the character sequence [first, last), parameter 
- flags is used to <A href="match_flag_type.html">control how the expression
- is matched</A> against the character sequence. Returns true if such a match
- exists, false otherwise.
- Throws: <code>std::runtime_error</code> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- 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:
- 
- <CENTER>
- <TABLE id="Table2" cellSpacing="1" cellPadding="7" width="624" border="1">
- <TBODY>
- <TR>
- <TD vAlign="top" width="50%">
- Element
- 
- </TD>
- <TD vAlign="top" width="50%">
- Value
- 
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.size()
- </TD>
- <TD vAlign="top" width="50%">
- e.mark_count()
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.empty()
- </TD>
- <TD vAlign="top" width="50%">
- false
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.prefix().first
- </TD>
- <TD vAlign="top" width="50%">
- first
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.prefix().last
- </TD>
- <TD vAlign="top" width="50%">
- first
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.prefix().matched
- </TD>
- <TD vAlign="top" width="50%">
- false
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.suffix().first
- </TD>
- <TD vAlign="top" width="50%">
- last
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.suffix().last
- </TD>
- <TD vAlign="top" width="50%">
- last
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.suffix().matched
- </TD>
- <TD vAlign="top" width="50%">
- false
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[0].first
- </TD>
- <TD vAlign="top" width="50%">
- first
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[0].second
- </TD>
- <TD vAlign="top" width="50%">
- last
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[0].matched
- </TD>
- <TD vAlign="top" width="50%">
- <CODE> true</CODE> if a full match was found, and <CODE>false</CODE> if it was
- a partial match (found as a result of the <CODE>match_partial</CODE> flag being
- set).
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[n].first
- </TD>
- <TD vAlign="top" width="50%">
- 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.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[n].second
- </TD>
- <TD vAlign="top" width="50%">
- 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.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[n].matched
- </TD>
- <TD vAlign="top" width="50%">
- For all integers n < m.size(), true if sub-expression n participated
- in the match, false otherwise.
- </TD>
- </TR>
- </TBODY></TD></TR></TABLE>
- </CENTER>
- 
- <DIV></DIV>
- <PRE> </PRE>
- <PRE><A name=f2></A>template <class BidirectionalIterator, class charT, class traits>
-bool regex_match(BidirectionalIterator first, BidirectionalIterator last,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Behaves "as if" by constructing an instance of <CODE><A href="match_results.html">
- match_results</A><</CODE>BidirectionalIterator<CODE>> what</CODE>,
- and then returning the result of <CODE>regex_match(first, last, what, e, flags)</CODE>.
- <PRE><A name=f3></A>template <class charT, class Allocator, class traits>
-bool regex_match(const charT* str, match_results<const charT*, Allocator>& m,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Returns the result of <CODE>regex_match(str, str +
- char_traits<charT>::length(str), m, e, flags)</CODE>.
- <PRE><A name=f4></A>template <class ST, class SA, class Allocator,
- class charT, class traits>
-bool regex_match(const basic_string<charT, ST, SA>& s,
- match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Returns the result of <CODE>regex_match(s.begin(), s.end(), m, e,
- flags)</CODE>.
- <PRE><A name=f5></A>template <class charT, class traits>
-bool regex_match(const charT* str,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Returns the result of <CODE>regex_match(str, str +
- char_traits<charT>::length(str), e, flags)</CODE>.
- <PRE><A name=f6></A>template <class ST, class SA, class charT, class traits>
-bool regex_match(const basic_string<charT, ST, SA>& s,
- const basic_regex <charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Returns the result of <CODE>regex_match(s.begin(), s.end(), e,
- flags)</CODE>.
- <H3><A name="examples"></A>Examples</H3>
- The following example
- processes an ftp response:
- 
- <PRE>#include <stdlib.h>
-#include <boost/regex.hpp>
-#include <string>
-#include <iostream>
-
-using namespace boost;
-
-regex expression("([0-9]+)(\\-| |$)(.*)");
-
-// process_ftp:
-// on success returns the ftp response code, and fills
-// msg with the ftp response message.
-int process_ftp(const char* response, std::string* msg)
-{
-   cmatch what;
-   if(regex_match(response, what, expression))
-   {
-      // what[0] contains the whole string
-      // what[1] contains the response code
-      // what[2] contains the separator character
-      // what[3] contains the text message.
-      if(msg)
-         msg->assign(what[3].first, what[3].second);
-      return std::atoi(what[1].first);
-   }
-   // failure did not match
-   if(msg)
-      msg->erase();
-   return -1;
-}
- 
- <HR></PRE>
- 
- Revised 
- 
- 26 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/regex_merge.html
==============================================================================
--- trunk/libs/regex/doc/regex_merge.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,45 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Algorithm regex_merge (deprecated)</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Algorithm regex_merge (deprecated)</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- Algorithm regex_merge has been renamed regex_replace,
- existing code will continue to compile, but new code should use <A href="regex_replace.html">
- regex_replace</A> instead.
- 
- <HR>
- 
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/regex_replace.html
==============================================================================
--- trunk/libs/regex/doc/regex_replace.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,256 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Algorithm regex_replace</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Algorithm regex_replace</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>Description <dt><A href="#examples">
- Examples</A></dt></dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- <PRE>#include <boost/regex.hpp> </PRE>
- The algorithm regex_replace searches through a string finding
- all the matches to the regular expression: for each match it then calls <A href="match_results.html#format">
- match_results::format</A> 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 <A href="match_flag_type.html">
- format_no_copy</A> set. If the flag format_first_only
- is set then only the first occurrence is replaced rather than all
- occurrences. <PRE>template <class OutputIterator, class BidirectionalIterator, class traits, class charT>
-OutputIterator regex_replace(OutputIterator out,
- BidirectionalIterator first,
- BidirectionalIterator last,
- const basic_regex<charT, traits>& e,
- const basic_string<charT>& fmt,
- match_flag_type flags = match_default);
-
-template <class traits, class charT>
-basic_string<charT> regex_replace(const basic_string<charT>& s,
- const basic_regex<charT, traits>& e,
- const basic_string<charT>& fmt,
- match_flag_type flags = match_default);
-
-</PRE>
- <H3><A name="description"></A>Description</H3>
- <PRE><A name=f1></A>template <class OutputIterator, class BidirectionalIterator, class traits, class charT>
-OutputIterator regex_replace(OutputIterator out,
- BidirectionalIterator first,
- BidirectionalIterator last,
- const basic_regex<charT, traits>& e,
- const basic_string<charT>& fmt,
- match_flag_type flags = match_default);</PRE>
- Enumerates all the occurences of expression e in the sequence [first,
- last), replacing each occurence with the string that results by merging the
- match found with the format string fmt, and copies the resulting
- string to out. 
- 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 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 <A href="match_flag_type.html">
- flags</A> set in flags
- Effects: Constructs an
- regex_iterator
- object:
- 
- <PRE>regex_iterator<BidirectionalIterator, charT, traits, Allocator> i(first, last, e, flags), </PRE>
- and uses
- 
- i
- to enumerate through all of the matches m of type
- 
- match_results
- <BidirectionalIterator> that
- occur within the sequence [first, last).
- 
- If no such matches are found
- and 
- <PRE>!(flags & format_no_copy) </PRE>
- then calls
- 
- <PRE>std::copy(first, last, out). </PRE>
- Otherwise, for each match found,
- if 
- <PRE>!(flags & format_no_copy) </PRE>
- calls
- 
- <PRE>std::copy(m.prefix().first, m.prefix().last, out), </PRE>
- and then calls
- 
- <PRE>m.format(out, fmt, flags). </PRE>
- Finally
- if 
- <PRE>!(flags & format_no_copy) </PRE>
- calls
- 
- <PRE>std::copy(last_m.suffix().first, last_m,suffix().last, out) </PRE>
- where
- 
- last_m
- 
- is a copy of the last match found.
- 
- If
- flags &
-format_first_only
- is non-zero then only the first match found is replaced.
- Throws: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- Returns: <CODE>out</CODE>.
- 
- <PRE><A name=f2></A>template <class traits, class charT>
-basic_string<charT> regex_replace(const basic_string<charT>& s,
- const basic_regex<charT, traits>& e,
- const basic_string<charT>& fmt,
- match_flag_type flags = match_default);</PRE>
- Effects: Constructs an object <CODE>basic_string<charT> result</CODE>,
- calls <CODE>regex_replace(back_inserter(result), s.begin(), s.end(), e, fmt,
- flags)</CODE>, and then returns <CODE>result</CODE>.
- <H3><A name="examples"></A>Examples</H3>
- The following example
- takes C/C++ source code as input, and outputs syntax highlighted HTML code.
- 
- <PRE>#include <fstream>
-#include <sstream>
-#include <string>
-#include <iterator>
-#include <boost/regex.hpp>
-#include <fstream>
-#include <iostream>
-
-// purpose:
-// takes the contents of a file and transform to
-// syntax highlighted code in html format
-
-boost::regex e1, e2;
-extern const char* expression_text;
-extern const char* format_string;
-extern const char* pre_expression;
-extern const char* pre_format;
-extern const char* header_text;
-extern const char* footer_text;
-
-void load_file(std::string& s, std::istream& is)
-{
- s.erase();
- s.reserve(is.rdbuf()->in_avail());
- char c;
- while(is.get(c))
- {
- if(s.capacity() == s.size())
- s.reserve(s.capacity() * 3);
- s.append(1, c);
- }
-}
-
-int main(int argc, const char** argv)
-{
- try{
- e1.assign(expression_text);
- e2.assign(pre_expression);
- for(int i = 1; i < argc; ++i)
- {
- std::cout << "Processing file " << argv[i] << std::endl;
- std::ifstream fs(argv[i]);
- std::string in;
- load_file(in, fs);
- std::string out_name(std::string(argv[i]) + std::string(".htm"));
- std::ofstream os(out_name.c_str());
- os << header_text;
- // strip '<' and '>' first by outputting to a
- // temporary string stream
- std::ostringstream t(std::ios::out | std::ios::binary);
- std::ostream_iterator<char, char> oi(t);
- boost::regex_replace(oi, in.begin(), in.end(),
- e2, pre_format, boost::match_default | boost::format_all);
- // then output to final output stream
- // adding syntax highlighting:
- std::string s(t.str());
- std::ostream_iterator<char, char> out(os);
- boost::regex_replace(out, s.begin(), s.end(),
- e1, format_string, boost::match_default | boost::format_all);
- os << footer_text;
- }
- }
- catch(...)
- { return -1; }
- return 0;
-}
-
-extern const char* pre_expression = "(<)|(>)|(&)|\\r";
-extern const char* pre_format = "(?1<)(?2>)(?3&amp;)";
-
-
-const char* expression_text = // preprocessor directives: index 1
- "(^[[:blank:]]*#(?:[^\\\\\\n]|\\\\[^\\n[:punct:][:word:]]*[\\n[:punct:][:word:]])*)|"
- // comment: index 2
- "(//[^\\n]*|/\\*.*?\\*/)|"
- // literals: index 3
- "\\<([+-]?(?:(?:0x[[:xdigit:]]+)|(?:(?:[[:digit:]]*\\.)?[[:digit:]]+(?:[eE][+-]?[[:digit:]]+)?))u?(?:(?:int(?:8|16|32|64))|L)?)\\>|"
- // string literals: index 4
- "('(?:[^\\\\']|\\\\.)*'|\"(?:[^\\\\\"]|\\\\.)*\")|"
- // keywords: index 5
- "\\<(__asm|__cdecl|__declspec|__export|__far16|__fastcall|__fortran|__import"
- "|__pascal|__rtti|__stdcall|_asm|_cdecl|__except|_export|_far16|_fastcall"
- "|__finally|_fortran|_import|_pascal|_stdcall|__thread|__try|asm|auto|bool"
- "|break|case|catch|cdecl|char|class|const|const_cast|continue|default|delete"
- "|do|double|dynamic_cast|else|enum|explicit|extern|false|float|for|friend|goto"
- "|if|inline|int|long|mutable|namespace|new|operator|pascal|private|protected"
- "|public|register|reinterpret_cast|return|short|signed|sizeof|static|static_cast"
- "|struct|switch|template|this|throw|true|try|typedef|typeid|typename|union|unsigned"
- "|using|virtual|void|volatile|wchar_t|while)\\>"
- ;
-
-const char* format_string = "(?1$&)"
- "(?2$&)"
- "(?3$&)"
- "(?4$&)"
- "(?5$&)";
-
-const char* header_text = "<HTML>\n<HEAD>\n"
- "<TITLE>Auto-generated html formated source</TITLE>\n"
- "<META HTTP-EQUIV=\"Content-Type\" CONTENT=\"text/html; charset=windows-1252\">\n"
- "</HEAD>\n"
- "<BODY LINK=\"#0000ff\" VLINK=\"#800080\" BGCOLOR=\"#ffffff\">\n"
- " \n<PRE>";
-
-const char* footer_text = "</PRE>\n</BODY>\n\n";
- </PRE>
- <HR>
- Revised 
- 
- 26 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/regex_search.html
==============================================================================
--- trunk/libs/regex/doc/regex_search.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,315 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Algorithm regex_search</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Algorithm regex_search</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>Description <dt><A href="#examples">
- Examples</A></dt></dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- <PRE>#include <boost/regex.hpp> </PRE>
- 
- The algorithm regex_search will search a range denoted by a pair of
- bidirectional-iterators for a given regular expression. The algorithm uses
- various heuristics to reduce the search time by only checking for a match if a
- match could conceivably start at that position. The algorithm is defined as
- follows:
- <PRE>template <class BidirectionalIterator,
- class Allocator, class charT, class traits>
-bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
- match_results<BidirectionalIterator, Allocator>& m,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);
-
-template <class ST, class SA,
- class Allocator, class charT, class traits>
-bool regex_search(const basic_string<charT, ST, SA>& s,
- match_results<
- typename basic_string<charT, ST,SA>::const_iterator,
- Allocator>& m,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);
-
-template<class charT, class Allocator, class traits>
-bool regex_search(const charT* str,
- match_results<const charT*, Allocator>& m,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);
-
-template <class BidirectionalIterator, class charT, class traits>
-bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);
-
-template <class charT, class traits>
-bool regex_search(const charT* str,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);
-
-template<class ST, class SA, class charT, class traits>
-bool regex_search(const basic_string<charT, ST, SA>& s,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);
-</PRE>
- <H3><A name="description"></A>Description</H3>
- <PRE><A name=f1></A>template <class BidirectionalIterator, class Allocator, class charT, class traits>
-bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
- match_results<BidirectionalIterator, Allocator>& m,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Requires: Type BidirectionalIterator meets the requirements of a
- Bidirectional Iterator (24.1.4).
- 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: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- 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:
- <DIV align="center">
- <CENTER>
- <TABLE id="Table2" cellSpacing="1" cellPadding="7" width="624" border="1">
- <TR>
- <TD vAlign="top" width="50%">
- Element
- </TD>
- <TD vAlign="top" width="50%">
- Value
- 
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.size()
- </TD>
- <TD vAlign="top" width="50%">
- e.mark_count()
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.empty()
- </TD>
- <TD vAlign="top" width="50%">
- false
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.prefix().first
- </TD>
- <TD vAlign="top" width="50%">
- first
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.prefix().last
- </TD>
- <TD vAlign="top" width="50%">
- m[0].first
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.prefix().matched
- </TD>
- <TD vAlign="top" width="50%">
- m.prefix().first != m.prefix().second
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.suffix().first
- </TD>
- <TD vAlign="top" width="50%">
- m[0].second
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.suffix().last
- </TD>
- <TD vAlign="top" width="50%">
- last
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m.suffix().matched
- </TD>
- <TD vAlign="top" width="50%">
- m.suffix().first != m.suffix().second
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[0].first
- </TD>
- <TD vAlign="top" width="50%">
- The start of the sequence of characters that matched the regular expression
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[0].second
- </TD>
- <TD vAlign="top" width="50%">
- The end of the sequence of characters that matched the regular expression
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[0].matched
- </TD>
- <TD vAlign="top" width="50%">
- <CODE> true</CODE> if a full match was found, and <CODE>false</CODE> if it was
- a partial match (found as a result of the <CODE>match_partial</CODE> flag being
- set).
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[n].first
- </TD>
- <TD vAlign="top" width="50%">
- 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.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[n].second
- </TD>
- <TD vAlign="top" width="50%">
- 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.
- </TD>
- </TR>
- <TR>
- <TD vAlign="top" width="50%">
- m[n].matched
- </TD>
- <TD vAlign="top" width="50%">
- For all integers n < m.size(), true if sub-expression n participated
- in the match, false otherwise.
- </TD>
- </TR>
- </TD></TR></TABLE>
- </CENTER>
- </DIV>
- <PRE><A name=f2></A>template <class charT, class Allocator, class traits>
-bool regex_search(const charT* str, match_results<const charT*, Allocator>& m,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Returns the result of <CODE>regex_search(str, str +
- char_traits<charT>::length(str), m, e, flags)</CODE>.
- <PRE><A name=f3></A>template <class ST, class SA, class Allocator, class charT,
- class traits>
-bool regex_search(const basic_string<charT, ST, SA>& s,
- match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Returns the result of <CODE>regex_search(s.begin(), s.end(), m,
- e, flags)</CODE>.
- <PRE><A name=f4></A>template <class iterator, class charT, class traits>
-bool regex_search(iterator first, iterator last,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Behaves "as if" by constructing an instance of <CODE><a href="match_results.html">
- match_results</a><</CODE>BidirectionalIterator<CODE>> what</CODE>,
- and then returning the result of <CODE>regex_search(first, last, what, e, flags)</CODE>.
- <PRE><A name=f5></A>template <class charT, class traits>
-bool regex_search(const charT* str
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Returns the result of <CODE>regex_search(str, str +
- char_traits<charT>::length(str), e, flags)</CODE>.
- <PRE><A name=f6></A>template <class ST, class SA, class charT, class traits>
-bool regex_search(const basic_string<charT, ST, SA>& s,
- const basic_regex<charT, traits>& e,
- match_flag_type flags = match_default);</PRE>
- Effects: Returns the result of <CODE>regex_search(s.begin(), s.end(), e,
- flags)</CODE>.
- <H3><A name="examples"></A>Examples</H3>
- 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 is implemented, for example it could easily be modified to
- work with the SGI rope class, which uses a non-contiguous storage strategy.
- 
- <PRE>#include <string>
-#include <map>
-#include <boost/regex.hpp>
-
-// purpose:
-// takes the contents of a file in the form of a string
-// and searches for all the C++ class definitions, storing
-// their locations in a map of strings/int's
-typedef std::map<std::string, int, std::less<std::string> > map_type;
-
-boost::regex expression("^(template[[:space:]]*<[^;:{]+>[[:space:]]*)?(class|struct)[[:space:]]*(\\<\\w+\\>([[:blank:]]*\$[^)]*\$)?[[:space:]]*)*(\\<\\w*\\>)[[:space:]]*(<[^;:{]+>[[:space:]]*)?(\\{|:[^;\\{()]*\\{)");
-
-void IndexClasses(map_type& m, const std::string& file)
-{
-   std::string::const_iterator start, end;
-   start = file.begin();
-   end = file.end(); 
-      boost::match_results<std::string::const_iterator> what;
-   boost::match_flag_type flags = boost::match_default;
-   while(regex_search(start, end, what, expression, flags)) 
-   {
-      // what[0] contains the whole string
-      // what[5] contains the class name.
-      // what[6] contains the template specialisation if any.
-      // add class name and position to map:
-      m[std::string(what[5].first, what[5].second) + std::string(what[6].first, what[6].second)] = 
-                what[5].first - file.begin(); 
-      // update search position:
-      start = what[0].second; 
-      // update flags:
-      flags |= boost::match_prev_avail; 
-      flags |= boost::match_not_bob; 
-   }
-}
- </PRE>
- <HR>
- Revised
- 
- 23 June 2004
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/regex_split.html
==============================================================================
--- trunk/libs/regex/doc/regex_split.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,145 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Algorithm regex_split (deprecated)</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Algorithm regex_split (deprecated)</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- The algorithm regex_split has been deprecated in favor of the iterator <A href="regex_token_iterator.html">
- regex_token_iterator</A> 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, the following
- documentation is taken from the previous boost.regex version:
- <H3><A name="regex_split"></A>Algorithm regex_split</H3>
- <PRE>#include <boost/regex.hpp> </PRE>
- Algorithm regex_split performs a similar operation to the perl split operation,
- and comes in three overloaded forms:
- 
- <PRE>template <class OutputIterator, class charT, class Traits1, class Alloc1, class Traits2>
-std::size_t regex_split(OutputIterator out, 
-                        std::basic_string<charT, Traits1, Alloc1>& s, 
-                      const basic_regex<charT, Traits2>& e,
-                      boost::match_flag_type flags,
-                        std::size_t max_split);
-
-template <class OutputIterator, class charT, class Traits1, class Alloc1, class Traits2>
-std::size_t regex_split(OutputIterator out, 
-                        std::basic_string<charT, Traits1, Alloc1>& s, 
-                      const basic_regex<charT, Traits2>& e,
-                        boost::match_flag_type flags = match_default);
-
-template <class OutputIterator, class charT, class Traits1, class Alloc1>
-std::size_t regex_split(OutputIterator out,
- std::basic_string<charT, Traits1, Alloc1>& s);</PRE>
- 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 the expression.
- If the expression does contain marked sub-expressions, then each time a match
- is found, one string for each marked sub-expression will be written to the
- output-iterator. No more than max_split strings will be written to the
- output-iterator. Before returning, all the input 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, then it defaults to "\s+", and splitting occurs
- on whitespace.
- 
- Throws: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- Example: the
- following function will split the input string into a series of tokens, and
- remove each token from the string s:
- 
- <PRE>unsigned tokenise(std::list<std::string>& l, std::string& s)
-{
-   return boost::regex_split(std::back_inserter(l), s);
-}</PRE>
- Example: the
- following short program will extract all of the URL's from a html file, and
- print them out to cout:
- 
- <PRE>#include <list>
-#include <fstream>
-#include <iostream>
-#include <boost/regex.hpp>
-
-boost::regex e("<\\s*A\\s+[^>]*href\\s*=\\s*\"([^\"]*)\"",
- boost::regbase::normal | boost::regbase::icase);
-
-void load_file(std::string& s, std::istream& is)
-{
- s.erase();
- //
- // attempt to grow string buffer to match file size,
- // this doesn't always work...
- s.reserve(is.rdbuf()-&gtin_avail());
- char c;
- while(is.get(c))
- {
- // use logarithmic growth stategy, in case
- // in_avail (above) returned zero:
- if(s.capacity() == s.size())
- s.reserve(s.capacity() * 3);
- s.append(1, c);
- }
-}
-
-
-int main(int argc, char** argv)
-{
- std::string s;
- std::list<std::string> l;
-
- for(int i = 1; i < argc; ++i)
- {
- std::cout << "Findings URL's in " << argv[i] << ":" << std::endl;
- s.erase();
- std::ifstream is(argv[i]);
- load_file(s, is);
- boost::regex_split(std::back_inserter(l), s, e);
- while(l.size())
- {
- s = *(l.begin());
- l.pop_front();
- std::cout << s << std::endl;
- }
- }
- return 0;
-}</PRE>
- <HR>
- Revised 
- 
- 26 June 2004
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/regex_token_iterator.html
==============================================================================
--- trunk/libs/regex/doc/regex_token_iterator.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,381 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: regex_token_iterator</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">regex_token_iterator</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>Description <dt><A href="#examples">
- Examples</A></dt></dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- The template class <CODE>regex_token_iterator</CODE> 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 what matched a particular sub-expression within the
- regular expression. When class <CODE>regex_token_iterator</CODE> is used to
- enumerate a single sub-expression with index -1, then the iterator performs
- field splitting: that is to say it enumerates one character sequence for each
- section of the character container sequence that does not match the regular
- expression specified.
- <PRE>
-template <class BidirectionalIterator,
- class charT = iterator_traits<BidirectionalIterator>::value_type,
- class traits = regex_traits<charT> >
-class regex_token_iterator
-{
-public:
- typedef basic_regex<charT, traits> regex_type;
- typedef sub_match<BidirectionalIterator> value_type;
- typedef typename iterator_traits<BidirectionalIterator>::difference_type difference_type;
- typedef const value_type* pointer;
- typedef const value_type& reference;
- typedef std::forward_iterator_tag iterator_category;
-
- regex_token_iterator();
- regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,
- int submatch = 0, match_flag_type m = match_default);
- regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,
- const std::vector<int>& submatches, match_flag_type m = match_default);
- template <std::size_t N>
- regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,
- const int (&submatches)[N], match_flag_type m = match_default);
- regex_token_iterator(const regex_token_iterator&);
- regex_token_iterator& operator=(const regex_token_iterator&);
- bool operator==(const regex_token_iterator&)const;
- bool operator!=(const regex_token_iterator&)const;
- const value_type& operator*()const;
- const value_type* operator->()const;
- regex_token_iterator& operator++();
- regex_token_iterator operator++(int);
-};
-
-typedef regex_token_iterator<const char*> cregex_token_iterator;
-typedef regex_token_iterator<std::string::const_iterator> sregex_token_iterator;
-#ifndef BOOST_NO_WREGEX
-typedef regex_token_iterator<const wchar_t*> wcregex_token_iterator;
-typedef regex_token_iterator<<std::wstring::const_iterator> wsregex_token_iterator;
-#endif
-
-template <class charT, class traits>
-regex_token_iterator<const charT*, charT, traits>
- make_regex_token_iterator(const charT* p,
- const basic_regex<charT, traits>& e,
- int submatch = 0,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits, class ST, class SA>
-regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>
- make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p,
- const basic_regex<charT, traits>& e,
- int submatch = 0,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits, std::size_t N>
-regex_token_iterator<const charT*, charT, traits>
- make_regex_token_iterator(const charT* p,
- const basic_regex<charT, traits>& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits, class ST, class SA, std::size_t N>
-regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>
- make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p,
- const basic_regex<charT, traits>& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits>
-regex_token_iterator<const charT*, charT, traits>
- make_regex_token_iterator(const charT* p,
- const basic_regex<charT, traits>& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits, class ST, class SA>
-regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>
- make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p,
- const basic_regex<charT, traits>& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-</PRE>
- <H3><A name="description"></A>Description</H3>
- <PRE><A name=c1></A>regex_token_iterator();</PRE>
- Effects: constructs an end of sequence iterator.
- <PRE><A name=c2></A>regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,
- int submatch = 0, match_flag_type m = match_default);</PRE>
- Preconditions: <CODE>!re.empty()</CODE>.  Object re shall exist
- for the lifetime of the iterator constructed from it.
- 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.  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: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- <PRE><A name=c3></A>regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,
- const std::vector<int>& submatches, match_flag_type m = match_default);</PRE>
- Preconditions: <CODE>submatches.size() && !re.empty()</CODE>. 
- Object re shall exist for the lifetime of the iterator constructed from it.
- 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.  For
- each match found one string will be enumerated for each sub-expression
- index contained within submatches vector; if submatches[0] 
- is -1, then the first string enumerated for each match will be all of the 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: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- <PRE><A name=c4></A>template <std::size_t N>
-regex_token_iterator(BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,
- const int (&submatches)[R], match_flag_type m = match_default);</PRE>
- Preconditions: <CODE>!re.empty()</CODE>.  Object re shall exist
- for the lifetime of the iterator constructed from it.
- 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.  For each match found one string will be
- enumerated for each sub-expression index contained within the submatches
- array; if submatches[0] is -1, then the first string enumerated
- for each match will be all of the 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: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- <PRE><A name=c5></A>regex_token_iterator(const regex_token_iterator& that);</PRE>
- Effects: constructs a copy of <CODE>that</CODE>.
- Postconditions: <CODE>*this == that</CODE>.
- <PRE><A name=o1></A>regex_token_iterator& operator=(const regex_token_iterator& that);</PRE>
- Effects: sets <CODE>*this</CODE> to be equal to <CODE>that</CODE>.
- Postconditions: <CODE>*this == that</CODE>.
- <PRE><A name=o2></A>bool operator==(const regex_token_iterator&)const;</PRE>
- 
- Effects: returns true if *this is the same position as that.
- <PRE><A name=o3></A>bool operator!=(const regex_token_iterator&)const;</PRE>
- 
- Effects: returns <CODE>!(*this == that)</CODE>.
- <PRE><A name=o4></A>const value_type& operator*()const;</PRE>
- 
- Effects: returns the current character sequence being enumerated.
- <PRE><A name=o5></A>const value_type* operator->()const;</PRE>
- 
- Effects: returns <CODE>&(*this)</CODE>.
- <PRE><A name=o6></A>regex_token_iterator& operator++();</PRE>
- 
- Effects: Moves on to the next character sequence to be enumerated.
- Throws: <CODE>std::runtime_error</CODE> 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 matcher exhausts it's permitted memory allocation (if Boost.regex is <A href="configuration.html">
- configured</A> in non-recursive mode).
- 
- 
- Returns:<CODE> *this</CODE>.<PRE><A name=o7></A>regex_token_iterator& operator++(int);</PRE>
- Effects: constructs a copy <CODE>result</CODE> of <CODE>*this</CODE>,
- then calls <CODE>++(*this)</CODE>.
- Returns: <CODE>result</CODE>.<A name="examples"></A>
- <PRE><A name=make_regex_token_iterator></A>template <class charT, class traits>
-regex_token_iterator<const charT*, charT, traits>
- make_regex_token_iterator(const charT* p,
- const basic_regex<charT, traits>& e,
- int submatch = 0,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits, class ST, class SA>
-regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>
- make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p,
- const basic_regex<charT, traits>& e,
- int submatch = 0,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits, std::size_t N>
-regex_token_iterator<const charT*, charT, traits>
- make_regex_token_iterator(const charT* p,
- const basic_regex<charT, traits>& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits, class ST, class SA, std::size_t N>
-regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>
- make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p,
- const basic_regex<charT, traits>& e,
- const int (&submatch)[N],
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits>
-regex_token_iterator<const charT*, charT, traits>
- make_regex_token_iterator(const charT* p,
- const basic_regex<charT, traits>& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-
-template <class charT, class traits, class ST, class SA>
-regex_token_iterator<typename std::basic_string<charT, ST, SA>::const_iterator, charT, traits>
- make_regex_token_iterator(const std::basic_string<charT, ST, SA>& p,
- const basic_regex<charT, traits>& e,
- const std::vector<int>& submatch,
- regex_constants::match_flag_type m = regex_constants::match_default);
-</PRE>
- 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_flags m.
- 
- <H3>Examples</H3>
- The following example
- takes a string and splits it into a series of tokens:
- <pre>
-#include <iostream>
-#include <boost/regex.hpp>
-
-using namespace std;
-
-int main(int argc)
-{
- string s;
- do{
- if(argc == 1)
- {
- cout << "Enter text to split (or \"quit\" to exit): ";
- getline(cin, s);
- if(s == "quit") break;
- }
- else
- s = "This is a string of tokens";
-
- boost::regex re("\\s+");
- boost::sregex_token_iterator i(s.begin(), s.end(), re, -1);
- boost::sregex_token_iterator j;
-
- unsigned count = 0;
- while(i != j)
- {
- cout << *i++ << endl;
- count++;
- }
- cout << "There were " << count << " tokens found." << endl;
-
- }while(argc == 1);
- return 0;
-}
-
-</pre>
- The following example
- takes a html file and outputs a list of all the linked files:
- <pre>
-#include <fstream>
-#include <iostream>
-#include <iterator>
-#include <boost/regex.hpp>
-
-boost::regex e("<\\s*A\\s+[^>]*href\\s*=\\s*\"([^\"]*)\"",
- boost::regex::normal | boost::regbase::icase);
-
-void load_file(std::string& s, std::istream& is)
-{
- s.erase();
- //
- // attempt to grow string buffer to match file size,
- // this doesn't always work...
- s.reserve(is.rdbuf()->in_avail());
- char c;
- while(is.get(c))
- {
- // use logarithmic growth stategy, in case
- // in_avail (above) returned zero:
- if(s.capacity() == s.size())
- s.reserve(s.capacity() * 3);
- s.append(1, c);
- }
-}
-
-int main(int argc, char** argv)
-{
- std::string s;
- int i;
- for(i = 1; i < argc; ++i)
- {
- std::cout << "Findings URL's in " << argv[i] << ":" << std::endl;
- s.erase();
- std::ifstream is(argv[i]);
- load_file(s, is);
- boost::sregex_token_iterator i(s.begin(), s.end(), e, 1);
- boost::sregex_token_iterator j;
- while(i != j)
- {
- std::cout << *i++ << std::endl;
- }
- }
- //
- // alternative method:
- // test the array-literal constructor, and split out the whole
- // match as well as $1....
- //
- for(i = 1; i < argc; ++i)
- {
- std::cout << "Findings URL's in " << argv[i] << ":" << std::endl;
- s.erase();
- std::ifstream is(argv[i]);
- load_file(s, is);
- const int subs[] = {1, 0,};
- boost::sregex_token_iterator i(s.begin(), s.end(), e, subs);
- boost::sregex_token_iterator j;
- while(i != j)
- {
- std::cout << *i++ << std::endl;
- }
- }
-
- return 0;
-}
-</pre>
- <HR>
- Revised 
- 
- 26 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/regex_traits.html
==============================================================================
--- trunk/libs/regex/doc/regex_traits.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,87 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: class regex_traits</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">class regex_traits</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>Description</dt>
- </dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- <pre>
-namespace boost{
-
-template <class charT, class implementationT = sensible_default_choice>
-struct regex_traits : public implementationT
-{
- regex_traits() : implementationT() {}
-};
-
-template <class charT>
-struct c_regex_traits;
-
-template <class charT>
-struct cpp_regex_traits;
-
-template <class charT>
-struct w32_regex_traits;
-
-} // namespace boost
-</pre>
- <H3><A name="description"></A>Description</H3>
- The class regex_traits is just a thin wrapper around an actual implemention
- class, which may be one of:
- <UL>
- <LI>
- 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.</LI>
- <LI>
- cpp_regex_traits: the default traits class for non-Win32 platforms, allows the
- regex class to be imbued with a std::locale instance.</LI>
- <LI>
- w32_regex_traits: the default traits class implementation on Win32 platforms,
- allows the regex class to be imbued with an LCID.</LI></UL>
- The default behavior can be altered by defining one of the following
- configuration macros in boost/regex/user.hpp:
- <UL>
- <LI>
- BOOST_REGEX_USE_C_LOCALE: makes c_regex_traits the default.</LI>
- <LI>
- BOOST_REGEX_USE_CPP_LOCALE: makes cpp_regex_traits the default.</LI></UL>
- All these traits classes fulfil the <A href="concepts.html#traits">traits class
- requirements</A>.
- <HR>
- 
- Revised
- 
- 24 June 2004 
- 
- © Copyright John Maddock 1998-
- 
- 2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/standards.html
==============================================================================
--- trunk/libs/regex/doc/standards.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,237 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Standards Conformance</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Standards Conformance</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>C++</H3>
- Boost.regex is intended to conform to the <A href="http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/papers/2003/n1429.htm">
- regular expression standardization proposal</A>, which will appear in a
- future C++ standard technical report (and hopefully in a future version of the
- standard). 
- <H3>ECMAScript / JavaScript</H3>
- All of the ECMAScript regular expression syntax features are supported, except
- that:
- Negated class escapes (\S, \D and \W) are not permitted inside character class
- definitions ( [...] ).
- 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.
- <H3>Perl</H3>
- Almost all Perl features are supported, except for:
- 
- <TABLE id="Table2" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>(?{code})</TD>
- <TD>Not implementable in a compiled strongly typed language.</TD>
- </TR>
- <TR>
- <TD>(??{code})</TD>
- <TD>Not implementable in a compiled strongly typed language.</TD>
- </TR>
- </TABLE>
- 
- <H3>POSIX</H3>
- All the POSIX basic and extended regular expression features are supported,
- except that:
- No character collating names are recognized except those specified in the POSIX
- standard for the C locale, unless they are explicitly registered with the
- traits class.
- Character equivalence classes ( [[=a=]] etc) are probably buggy except on
- Win32.  Implementing this feature requires knowledge of the format of the
- string sort keys produced by the system; if you need this, and the default
- implementation doesn't work on your platform, then you will need to supply a
- custom traits class.
- <H3>Unicode</H3>
- The following comments refer to <A href="http://www.unicode.org/reports/tr18/">Unicode
- Technical
- Standard
-#18: Unicode Regular Expressions</A> version 9.
- 
- <TABLE id="Table3" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>#</TD>
- <TD>Feature</TD>
- <TD>Support</TD>
- </TR>
- <TR>
- <TD>1.1</TD>
- <TD>Hex Notation</TD>
- <TD>Yes: use \x{DDDD} to refer to code point UDDDD.</TD>
- </TR>
- <TR>
- <TD>1.2</TD>
- <TD>Character Properties</TD>
- <TD>All the names listed under the <A href="http://www.unicode.org/reports/tr18/#Categories">General
- Category Property</A> are supported.  Script names and Other Names are
- not currently supported.</TD>
- </TR>
- <TR>
- <TD>1.3</TD>
- <TD><A name="Subtraction_and_Intersection">Subtraction</A> and Intersection</TD>
- <TD>
- Indirectly support by forward-lookahead:
- 
- (?=[[:X:]])[[:Y:]]
- Gives the intersection of character properties X and Y.
- (?![[:X:]])[[:Y:]]
- Gives everything in Y that is not in X (subtraction).
- </TD>
- </TR>
- <TR>
- <TD>1.4</TD>
- <TD><A name="Simple_Word_Boundaries">Simple Word Boundaries</A></TD>
- <TD>Conforming: non-spacing marks are included in the set of word characters.</TD>
- </TR>
- <TR>
- <TD>1.5</TD>
- <TD>Caseless Matching</TD>
- <TD>Supported, note that at this level, case transformations are 1:1, many to many
- case folding operations are not supported (for example "ß" to "SS").</TD>
- </TR>
- <TR>
- <TD>1.6</TD>
- <TD>Line Boundaries</TD>
- <TD>Supported, except that "." matches only one character of "\r\n". Other than
- that word boundaries match correctly; including not matching in the middle of a
- "\r\n" sequence.</TD>
- </TR>
- <TR>
- <TD>1.7</TD>
- <TD>Code Points</TD>
- <TD>Supported: provided you use the u32* algorithms,
- then UTF-8, UTF-16 and UTF-32 are all treated as sequences of 32-bit code
- points.</TD>
- </TR>
- <TR>
- <TD>2.1</TD>
- <TD>Canonical Equivalence</TD>
- <TD>Not supported: it is up to the user of the library to convert all text into
- the same canonical form as the regular expression.</TD>
- </TR>
- <TR>
- <TD>2.2</TD>
- <TD>Default Grapheme Clusters</TD>
- <TD>Not supported.</TD>
- </TR>
- <TR>
- <TD>2.3</TD>
- <TD>
- <A name="Default_Word_Boundaries">Default Word Boundaries</A>
- </TD>
- <TD>Not supported.</TD>
- </TR>
- <TR>
- <TD>2.4</TD>
- <TD>
- <A name="Default_Loose_Matches">Default Loose Matches</A>
- </TD>
- <TD>Not Supported.</TD>
- </TR>
- <TR>
- <TD>2.5</TD>
- <TD>Name Properties</TD>
- <TD>Supported: the expression "[[:name:]]" or \N{name} matches the named character
- "name".</TD>
- </TR>
- <TR>
- <TD>2.6</TD>
- <TD>Wildcard properties</TD>
- <TD>Not Supported.</TD>
- </TR>
- <TR>
- <TD>3.1</TD>
- <TD>Tailored Punctuation.</TD>
- <TD>Not Supported.</TD>
- </TR>
- <TR>
- <TD>3.2</TD>
- <TD>Tailored Grapheme Clusters</TD>
- <TD>Not Supported.</TD>
- </TR>
- <TR>
- <TD>3.3</TD>
- <TD>Tailored Word Boundaries.</TD>
- <TD>Not Supported.</TD>
- </TR>
- <TR>
- <TD>3.4</TD>
- <TD>Tailored Loose Matches</TD>
- <TD>Partial support: [[=c=]] matches characters with the same primary equivalence
- class as "c".</TD>
- </TR>
- <TR>
- <TD>3.5</TD>
- <TD>Tailored Ranges</TD>
- <TD>Supported: [a-b] matches any character that collates in the range a to b, when
- the expression is constructed with the collate
- flag set.</TD>
- </TR>
- <TR>
- <TD>3.6</TD>
- <TD>Context Matches</TD>
- <TD>Not Supported.</TD>
- </TR>
- <TR>
- <TD>3.7</TD>
- <TD>Incremental Matches</TD>
- <TD>Supported: pass the flag match_partial to
- the regex algorithms.</TD>
- </TR>
- <TR>
- <TD>3.8</TD>
- <TD>Unicode Set Sharing</TD>
- <TD>Not Supported.</TD>
- </TR>
- <TR>
- <TD>3.9</TD>
- <TD>Possible Match Sets</TD>
- <TD>Not supported, however this information is used internally to optimise the
- matching of regular expressions, and return quickly if no match is possible.</TD>
- </TR>
- <TR>
- <TD>3.10</TD>
- <TD>Folded Matching</TD>
- <TD>Partial Support:  It is possible to achieve a similar effect by using a
- custom regular expression traits class.</TD>
- </TR>
- <TR>
- <TD>3.11</TD>
- <TD>Custom Submatch Evaluation</TD>
- <TD>Not Supported.</TD>
- </TR>
- </TABLE>
- 
- <HR>
- Revised 
- 
- 28 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-
-

Deleted: trunk/libs/regex/doc/sub_match.html
==============================================================================
--- trunk/libs/regex/doc/sub_match.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,571 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: sub_match</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">sub_match</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Synopsis</H3>
- #include <boost/regex.hpp>
- 
- Regular expressions are different from many simple pattern-matching algorithms
- in that as well as finding an overall match they can also produce
- sub-expression matches: each sub-expression being delimited in the pattern by a
- pair of parenthesis (...). There has to be some method for reporting
- sub-expression matches back to the user: this is achieved this by defining a
- class match_results that acts as an
- indexed collection of sub-expression matches, each sub-expression match being
- contained in an object of type sub_match
- .
- Objects of type sub_match may only 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 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 expression match then member <CODE>matched</CODE> evaluates
- to true, and members <CODE>first</CODE> and <CODE>second</CODE> denote the
- range of characters <CODE>[first,second)</CODE> which formed that match.
- Otherwise <CODE>matched</CODE> is false, and members <CODE>first</CODE> and <CODE>second</CODE>
- contained undefined values.
- 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 <CODE>sub_match<></CODE> represents sub-expression 0
- - that is to say the whole match - then member <CODE>matched</CODE> is always
- true, unless a partial match was obtained as a result of the flag <CODE>match_partial</CODE>
- being passed to a regular expression algorithm, in which case member <CODE>matched</CODE>
- is false, and members <CODE>first</CODE> and <CODE>second</CODE> represent the
- character range that formed the partial match.
- <PRE>namespace boost{
-
-template <class BidirectionalIterator>
-class sub_match;
-
-typedef sub_match<const char*> csub_match;
-typedef sub_match<const wchar_t*> wcsub_match;
-typedef sub_match<std::string::const_iterator> ssub_match;
-typedef sub_match<std::wstring::const_iterator> wssub_match;
-
-template <class BidirectionalIterator>
-class sub_match : public std::pair<BidirectionalIterator, BidirectionalIterator>
-{
-public:
- typedef typename iterator_traits<BidirectionalIterator>::value_type value_type;
- typedef typename iterator_traits<BidirectionalIterator>::difference_type difference_type;
- typedef BidirectionalIterator iterator;
-
- bool matched;
-
- difference_type length()const;
- operator basic_string<value_type>()const;
- basic_string<value_type> str()const;
-
- int compare(const sub_match& s)const;
- int compare(const basic_string<value_type>& s)const;
- int compare(const value_type* s)const;
-#ifdef BOOST_REGEX_MATCH_EXTRA
- typedef implementation-private capture_sequence_type;
- const capture_sequence_type& captures()const;
-#endif
-};
-//
-// comparisons to another sub_match:
-//
-template <class BidirectionalIterator>
-bool operator == (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator != (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator < (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator <= (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator >= (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator > (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-
-
-//
-// comparisons to a basic_string:
-//
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator == (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator != (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator < (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator > (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator >= (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator <= (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator == (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator != (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator < (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator > (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator >= (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator <= (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);
-
-//
-// comparisons to a pointer to a character array:
-//
-template <class BidirectionalIterator>
-bool operator == (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator != (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator < (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator > (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator >= (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator <= (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs);
-
-template <class BidirectionalIterator>
-bool operator == (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
-template <class BidirectionalIterator>
-bool operator != (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
-template <class BidirectionalIterator>
-bool operator < (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
-template <class BidirectionalIterator>
-bool operator > (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
-template <class BidirectionalIterator>
-bool operator >= (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
-template <class BidirectionalIterator>
-bool operator <= (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs);
-
-//
-// comparisons to a single character:
-//
-template <class BidirectionalIterator>
-bool operator == (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator != (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator < (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator > (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator >= (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-template <class BidirectionalIterator>
-bool operator <= (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs);
-
-template <class BidirectionalIterator>
-bool operator == (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
-template <class BidirectionalIterator>
-bool operator != (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
-template <class BidirectionalIterator>
-bool operator < (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
-template <class BidirectionalIterator>
-bool operator > (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
-template <class BidirectionalIterator>
-bool operator >= (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
-template <class BidirectionalIterator>
-bool operator <= (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs);
-//
-// addition operators:
-//
-template <class BidirectionalIterator, class traits, class Allocator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>
- operator + (const std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& s,
- const sub_match<BidirectionalIterator>& m);
-template <class BidirectionalIterator, class traits, class Allocator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>
- operator + (const sub_match<BidirectionalIterator>& m,
- const std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& s);
-template <class BidirectionalIterator> std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (typename iterator_traits<BidirectionalIterator>::value_type const* s,
- const sub_match<BidirectionalIterator>& m);
-template <class BidirectionalIterator> std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (const sub_match<BidirectionalIterator>& m,
- typename iterator_traits<BidirectionalIterator>::value_type const * s);
-template <class BidirectionalIterator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (typename iterator_traits<BidirectionalIterator>::value_type const& s,
- const sub_match<BidirectionalIterator>& m);
-template <class BidirectionalIterator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (const sub_match<BidirectionalIterator>& m,
- typename iterator_traits<BidirectionalIterator>::value_type const& s);
-template <class BidirectionalIterator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (const sub_match<BidirectionalIterator>& m1,
- const sub_match<BidirectionalIterator>& m2);
-
-//
-// stream inserter:
-//
-template <class charT, class traits, class BidirectionalIterator>
-basic_ostream<charT, traits>&
- operator << (basic_ostream<charT, traits>& os,
- const sub_match<BidirectionalIterator>& m);
-
-} // namespace boost</PRE>
- <H3>Description</H3>
- <H4>sub_match members</H4>
- <PRE>typedef typename std::iterator_traits<iterator>::value_type value_type;</PRE>
- The type pointed to by the iterators.
- <PRE>typedef typename std::iterator_traits<iterator>::difference_type difference_type;</PRE>
- A type that represents the difference between two iterators.
- <PRE>typedef iterator iterator_type;</PRE>
- The iterator type.
- <PRE>iterator first</PRE>
- An iterator denoting the position of the start of the match.
- <PRE>iterator second</PRE>
- An iterator denoting the position of the end of the match.
- <PRE><A name=m1></A>bool matched</PRE>
- A Boolean value denoting whether this sub-expression participated in the match.
- <PRE><A name=m2></A>static difference_type length();</PRE>
- Effects: returns the length of this matched sub-expression, or 0 if this
- sub-expression was not matched: <CODE>matched ? distance(first, second) : 0)</CODE>.
- <PRE><A name=m3></A>operator basic_string<value_type>()const;</PRE>
- Effects: converts *this into a string: returns <CODE>(matched ?
- basic_string<value_type>(first, second) :
- basic_string<value_type>()).
- </CODE><PRE><A name=m4></A>basic_string<value_type> str()const;</PRE>
- Effects: returns a string representation of *this:  <CODE>(matched ?
- basic_string<value_type>(first, second) :
- basic_string<value_type>())</CODE>.
- <PRE><A name=m5></A>int compare(const sub_match& s)const;</PRE>
- Effects: performs a lexical comparison to s: returns <CODE>str().compare(s.str())</CODE>.
- <PRE><A name=m6></A>int compare(const basic_string<value_type>& s)const;</PRE>
- Effects: compares *this to the string s: returns <CODE>str().compare(s)</CODE>.
- <PRE><A name=m7></A>int compare(const value_type* s)const;</PRE>
- Effects: compares *this to the null-terminated string s: returns
- <CODE>str().compare(s)</CODE>.
- <PRE><A name=m9></A>typedef implementation-private capture_sequence_type;</PRE>
- 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> >,
- but you shouldn't actually rely on that.
- <PRE><A name=m8></A>const capture_sequence_type& captures()const; </PRE>
- Effects: returns a sequence containing all the captures
- obtained for this sub-expression.
- Preconditions: the library must be built and used with
- BOOST_REGEX_MATCH_EXTRA defined, and you must pass the flag <A href="match_flag_type.html">
- match_extra</A> 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 consequences:
- 
- <UL>
- <LI>
- sub_match occupies more memory resulting in complex expressions running out of
- memory or stack space more quickly during matching.
- <LI>
- The matching algorithms are less efficient at handling some features
- (independent sub-expressions for example), even when match_extra
- is not used.
- <LI>
- The matching algorithms are much less efficient (i.e. slower), when match_extra
- is used.  Mostly this is down to the extra memory allocations that have to
- take place.</LI></UL>
- <H4>sub_match non-member operators</H4>
- <H5>Comparisons against self</H5>
- <PRE><A name=o11></A>template <class BidirectionalIterator>
-bool operator == (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs.compare(rhs) == 0</CODE>.
- <PRE><A name=o12></A>template <class BidirectionalIterator>
-bool operator != (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs.compare(rhs) != 0</CODE>.
- <PRE><A name=o13></A>template <class BidirectionalIterator>
-bool operator < (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs.compare(rhs) < 0</CODE>.
- <PRE><A name=o14></A>template <class BidirectionalIterator>
-bool operator <= (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs.compare(rhs) <= 0</CODE>.
- <PRE><A name=o15></A>template <class BidirectionalIterator>
-bool operator >= (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs.compare(rhs) >= 0</CODE>.
- <PRE><A name=o16></A>template <class BidirectionalIterator>
-bool operator > (const sub_match<BidirectionalIterator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs.compare(rhs) > 0</CODE>.
- <H5>Comparisons with std::basic_string</H5>
- <pre><A name=o21></A>
-template <class BidirectionalIterator, class traits, class Allocator>
-bool operator == (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits,
- Allocator>& lhs, const sub_match<BidirectionalIterator>& rhs);
-</pre>
- Effects: returns <CODE>lhs == rhs.str()</CODE>.
- <PRE><A name=o22></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator != (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs != rhs.str()</CODE>.
- <PRE><A name=o23></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator < (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs < rhs.str()</CODE>.
- <PRE><A name=o24></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator > (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs > rhs.str()</CODE>.
- <PRE><A name=o25></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator >= (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs >= rhs.str()</CODE>.
- <PRE><A name=o26></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator <= (const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& lhs,
- const sub_match<BidirectionalIterator>& rhs);</PRE>
- Effects: returns <CODE>lhs <= rhs.str()</CODE>.
- <PRE><A name=o31></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator == (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);</PRE>
- Effects: returns <CODE>lhs.str() == rhs</CODE>.
- <PRE><A name=o32></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator != (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);</PRE>
- Effects: returns <CODE>lhs.str() != rhs</CODE>.
- <PRE><A name=o33></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator < (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);</PRE>
- Effects: returns <CODE>lhs.str() < rhs</CODE>.
- <PRE><A name=o34></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator > (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);</PRE>
- Effects: returns <CODE>lhs.str() > rhs</CODE>.
- <PRE><A name=o35></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator >= (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);</PRE>
- Effects: returns <CODE>lhs.str() >= rhs</CODE>.
- <PRE><A name=o36></A>template <class BidirectionalIterator, class traits, class Allocator>
-bool operator <= (const sub_match<BidirectionalIterator>& lhs,
- const std::basic_string<iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& rhs);</PRE>
- Effects: returns <CODE>lhs.str() <= rhs</CODE>.
- <H5>Comparisons with null-terminated strings</H5>
- <PRE><A name=o41></A>template <class BidirectionalIterator>
-bool operator == (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs == rhs.str()</CODE>.
- <PRE><A name=o42></A>template <class BidirectionalIterator>
-bool operator != (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs != rhs.str()</CODE>.
- <PRE></A><A name=o43></A>template <class BidirectionalIterator>
-bool operator < (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs < rhs.str()</CODE>.
- <PRE><A name=o44></A>template <class BidirectionalIterator>
-bool operator > (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs > rhs.str()</CODE>.
- <PRE><A name=o45></A>template <class BidirectionalIterator>
-bool operator >= (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs >= rhs.str()</CODE>.
- <PRE><A name=o46></A>template <class BidirectionalIterator>
-bool operator <= (typename iterator_traits<BidirectionalIterator>::value_type const* lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs <= rhs.str()</CODE>.
- <PRE><A name=o51></A>template <class BidirectionalIterator>
-bool operator == (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs); </PRE>
- Effects: returns <CODE>lhs.str() == rhs</CODE>.
- <PRE><A name=o52></A>template <class BidirectionalIterator>
-bool operator != (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs); </PRE>
- Effects: returns <CODE>lhs.str() != rhs</CODE>.
- <PRE><A name=o53></A>template <class BidirectionalIterator>
-bool operator < (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs); </PRE>
- Effects: returns <CODE>lhs.str() < rhs</CODE>.
- <PRE><A name=o54></A>template <class BidirectionalIterator>
-bool operator > (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs); </PRE>
- Effects: returns <CODE>lhs.str() > rhs</CODE>.
- <PRE><A name=o55></A>template <class BidirectionalIterator>
-bool operator >= (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs); </PRE>
- Effects: returns <CODE>lhs.str() >= rhs</CODE>.
- <PRE><A name=o56></A>template <class BidirectionalIterator>
-bool operator <= (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const* rhs); </PRE>
- Effects: returns <CODE>lhs.str() <= rhs</CODE>.
- <H5>Comparisons with a single character</H5>
- <PRE><A name=o61></A>template <class BidirectionalIterator>
-bool operator == (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs == rhs.str()</CODE>.
- <PRE><A name=o62></A>template <class BidirectionalIterator>
-bool operator != (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs != rhs.str()</CODE>.
- <PRE><A name=o63></A>template <class BidirectionalIterator>
-bool operator < (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs < rhs.str()</CODE>.
- <PRE><A name=o64></A>template <class BidirectionalIterator>
-bool operator > (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs > rhs.str()</CODE>.
- <PRE><A name=o65></A>template <class BidirectionalIterator>
-bool operator >= (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs >= rhs.str()</CODE>.
- <PRE><A name=o66></A>template <class BidirectionalIterator>
-bool operator <= (typename iterator_traits<BidirectionalIterator>::value_type const& lhs,
- const sub_match<BidirectionalIterator>& rhs); </PRE>
- Effects: returns <CODE>lhs <= rhs.str()</CODE>.
- <PRE><A name=o71></A>template <class BidirectionalIterator>
-bool operator == (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs); </PRE>
- Effects: returns <CODE>lhs.str() == rhs</CODE>.
- <PRE><A name=o72></A>template <class BidirectionalIterator>
-bool operator != (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs); </PRE>
- Effects: returns <CODE>lhs.str() != rhs</CODE>.
- <PRE><A name=o73></A>template <class BidirectionalIterator>
-bool operator < (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs); </PRE>
- Effects: returns <CODE>lhs.str() < rhs</CODE>.
- <PRE><A name=o74></A>template <class BidirectionalIterator>
-bool operator > (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs); </PRE>
- Effects: returns <CODE>lhs.str() > rhs</CODE>.
- <PRE><A name=o75></A>template <class BidirectionalIterator>
-bool operator >= (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs); </PRE>
- Effects: returns <CODE>lhs.str() >= rhs</CODE>.
- <PRE><A name=o76></A>template <class BidirectionalIterator>
-bool operator <= (const sub_match<BidirectionalIterator>& lhs,
- typename iterator_traits<BidirectionalIterator>::value_type const& rhs); </PRE>
- Effects: returns <CODE>lhs.str() <= rhs</CODE>.
- <h5>Addition operators</h5>
- 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.
- <PRE><A name=o81></A>template <class BidirectionalIterator, class traits, class Allocator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>
- operator + (const std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& s,
- const sub_match<BidirectionalIterator>& m); </PRE>
- Effects: returns <CODE>s + m.str()</CODE>.
- <PRE><A name=o82></A>template <class BidirectionalIterator, class traits, class Allocator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>
- operator + (const sub_match<BidirectionalIterator>& m,
- const std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type, traits, Allocator>& s); </PRE>
- Effects: returns <CODE>m.str() + s</CODE>.
- <PRE><A name=o83></A>template <class BidirectionalIterator> std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (typename iterator_traits<BidirectionalIterator>::value_type const* s,
- const sub_match<BidirectionalIterator>& m); </PRE>
- Effects: returns <CODE>s + m.str()</CODE>.
- <PRE><A name=o84></A>template <class BidirectionalIterator> std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (const sub_match<BidirectionalIterator>& m,
- typename iterator_traits<BidirectionalIterator>::value_type const * s);</PRE>
- Effects: returns <CODE>m.str() + s</CODE>.
- <PRE><A name=o85></A>template <class BidirectionalIterator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (typename iterator_traits<BidirectionalIterator>::value_type const& s,
- const sub_match<BidirectionalIterator>& m); </PRE>
- Effects: returns <CODE>s + m.str()</CODE>.
- <PRE><A name=o86></A>template <class BidirectionalIterator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (const sub_match<BidirectionalIterator>& m,
- typename iterator_traits<BidirectionalIterator>::value_type const& s); </PRE>
- Effects: returns <CODE>m.str() + s</CODE>.
- <PRE><A name=o87></A>template <class BidirectionalIterator>
-std::basic_string<typename iterator_traits<BidirectionalIterator>::value_type>
- operator + (const sub_match<BidirectionalIterator>& m1,
- const sub_match<BidirectionalIterator>& m2);</PRE>
- Effects: returns <CODE>m1.str() + m2.str()</CODE>.
- <h5>Stream inserter</h5>
- <PRE><A name=oi></A>template <class charT, class traits, class BidirectionalIterator>
-basic_ostream<charT, traits>&
- operator << (basic_ostream<charT, traits>& os
- const sub_match<BidirectionalIterator>& m);</PRE>
- 
- Effects: returns <CODE>(os << m.str())</CODE>.
- <HR>
- Revised
- 
- 22 Dec 2004
- 
- © Copyright John Maddock 1998-
- 
- 2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/syntax.html
==============================================================================
--- trunk/libs/regex/doc/syntax.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,55 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Regular Expression Syntax</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Regular Expression Syntax</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- This section covers the regular expression syntax used by this library, this is
- a programmers guide, the actual syntax presented to your program's users will
- depend upon the flags used during
- expression compilation.
- 
- There are three main syntax options available, depending upon how
- you construct the regular expression object:
- <UL>
- <LI>
- Perl (this is the default behavior).</LI>
- <LI>
- POSIX extended (including the <A href="syntax_extended.html#egrep">
- egrep</A> and awk variations).</LI>
- <LI>
- POSIX Basic (including the <A href="syntax_basic.html#grep">
- grep</A> and emacs variations).</LI></UL>
- You can also construct a regular expression that treats every character as a <A href="syntax_option_type.html#literals">
- literal</A>, but that's not really a "syntax"!
- <HR>
- Revised 
- 
- 10 Sept 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/syntax_basic.html
==============================================================================
--- trunk/libs/regex/doc/syntax_basic.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,238 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: POSIX-Basic Regular Expression Syntax</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">POSIX Basic Regular Expression Syntax</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>POSIX Basic Syntax <dt><A href="#variations">
- Variations</A>
- <dd>
- <dl>
- <dt>Grep <dt>Emacs</dt>
- </dl>
- <dt>Options <dt>References</dt>
- </dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- 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, for example:
- <PRE>// e1 is a case sensitive POSIX-Basic expression:
-boost::regex e1(my_expression, boost::regex::basic);
-// e2 a case insensitive POSIX-Basic expression:
-boost::regex e2(my_expression, boost::regex::basic|boost::regex::icase);</PRE>
- <H3>POSIX Basic Syntax<A name="Basic"></A></H3>
- In POSIX-Basic regular expressions, all characters are match themselves except
- for the following special characters:
- <PRE>.[\*^$</PRE>
- <H4>Wildcard:</H4>
- 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 is passed to the
- matching algorithms.
- The newline character when the flag match_not_dot_newline is passed to
- the matching algorithms.
- <H4>Anchors:</H4>
- 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.
- 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.
- <H4>Marked sub-expressions:</H4>
- 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.
- <H4>Repeats:</H4>
- Any atom (a single character, a marked sub-expression, or a character class)
- can be repeated with the * operator.
- 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
- will match any of the following:
- <PRE>b
-ab
-aaaaaaaab</PRE>
- An atom can also be repeated with a bounded repeat:
- a\{n\}  Matches 'a' repeated exactly n times.
- a\{n,\}  Matches 'a' repeated n or more times.
- a\{n, m\}  Matches 'a' repeated between n and m times
- inclusive.
- For example:
- <PRE>^a\{2,3\}$</PRE>
- Will match either of:
- <PRE>aa
-aaa</PRE>
- But neither of:
- <PRE>a
-aaaa</PRE>
- It is an error to use a repeat operator, if the preceding construct can not be
- repeated, for example:
- <PRE>a$*$</PRE>
- Will raise an error, as there is nothing for the * operator to be applied to.
- <H4>Back references:</H4>
- 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 n. 
- For example the expression:
- <PRE>^$a*$.*\1$</PRE>
- Will match the string:
- <PRE>aaabbaaa</PRE>
- But not the string:
- <PRE>aaabba</PRE>
- <H4>Character sets:</H4>
- 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:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- <H5>Single characters:</H5>
- For example [abc], will match any of the characters 'a', 'b', or 'c'.
- <H5>Character ranges:</H5>
- 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
- option flag - in which case whether a character appears within a range is
- determined by comparing the code points of the characters only
- <H5>Negation:</H5>
- 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.
- <H5>Character classes:</H5>
- An expression of the form [[:name:]] matches the named character class "name",
- for example [[:lower:]] matches any lower case character.  See <A href="character_class_names.html">
- character class names</A>.
- <H5>Collating Elements:</H5>
- 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] 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 match either one
- of the characters 'abc^'.
- As an extension, a collating element may also be specified via its <A href="collating_names.html">
- symbolic name</A>, for example:
- [[.NUL.]]
- matches a NUL character.
- <H5>Equivalence classes:</H5>
- 
- 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 <A href="collating_names.html">
- symbolic name</A>.  A primary sort key is one that ignores case,
- accentation, or locale-specific tailorings; so for example [[=a=]] matches any
- of the characters: a, à, á, â, ã, ä, å, A, À, Á, Â, Ã, Ä and Å. 
- Unfortunately implementation 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.
- </BLOCKQUOTE>
- <H5>Combinations:</H5>
- All of the above can be combined in one character set declaration, for example:
- [[:digit:]a-c[.NUL.]].
- <H4>Escapes</H4>
- With the exception of the escape sequences \{, \}, $, and $, which are
- documented above, an escape followed by any character matches that
- character.  This can be used to make the special characters .[\*^$,
- "ordinary".  Note that the escape character loses its special meaning
- inside a character set, so [\^] will match either a literal '\' or a '^'.
- <H4>What Gets Matched</H4>
- When there is more that one way to match a regular expression, the "best"
- possible match is obtained using the <A href="syntax_leftmost_longest.html">leftmost-longest
- rule</A>.
- <H3><A name="variations"></A>Variations</H3>
- <H4><A name="grep"></A>Grep</H4>
- 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:
- <PRE>boost::regex e("abc\ndef", boost::regex::grep);</PRE>
- will match either of the POSIX-Basic expressions "abc" or "def".
- As its name suggests, this behavior is consistent with the Unix utility grep.
- <H4><A name="emacs"></A>emacs</H4>
- In addition to the POSIX-Basic features the following
- characters are also special:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- + repeats the preceding atom one or more times.
- ? repeats the preceding atom zero or one times.
- *? A non-greedy version of *.
- +? A non-greedy version of +.
- ?? A non-greedy version of ?.
- </BLOCKQUOTE>
- And the following escape sequences are also recognised:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- \| specifies an alternative.
- $?:  ...  $ is a non-marking grouping construct - allows you to
- lexically group something without spitting out an extra sub-expression.
- \w  matches any word character.
- \W matches any non-word character.
- \sx matches any character in the syntax group x, the following emacs
- groupings are supported: 's', ' ', '_', 'w', '.', ')', '(', '"', '\'', '>'
- and '<'.  Refer to the emacs docs for details.
- \Sx matches any character not in the syntax grouping x.
- \c and \C are not supported.
- \` matches zero characters only at the start of a buffer (or string being
- matched).
- \' matches zero characters only at the end of a buffer (or string being
- matched).
- \b matches zero characters at a word boundary.
- \B matches zero characters, not at a word boundary.
- \< matches zero characters only at the start of a word.
- \> matches zero characters only at the end of a word.
- </BLOCKQUOTE>
- Finally, you should note that emacs style regular expressions are
- matched according to the <A href="syntax_perl.html#what">Perl "depth first search"
- rules</A>.  Emacs expressions are matched this way because they contain
- Perl-like extensions, that do not interact well with the <A href="syntax_leftmost_longest.html">
- POSIX-style leftmost-longest rule</A>.
- <H3><A name="options"></A>Options</H3>
- 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 <A href="syntax_option_type.html#basic">
- newline_alt, no_char_classes, no-intervals, bk_plus_qm and bk_plus_vbar</A> options
- all alter the syntax, while the <A href="syntax_option_type.html#basic">collate
- and icase</A> options modify how the case and locale sensitivity are to be
- applied.
- <H3><A name="refs"></A>References</H3>
- <A href="http://www.opengroup.org/onlinepubs/000095399/basedefs/xbd_chap09.html">IEEE
- Std 1003.1-2001, Portable Operating System Interface (POSIX ), Base Definitions
- and Headers, Section 9, Regular Expressions (FWD.1).</A>
- <A href="http://www.opengroup.org/onlinepubs/000095399/utilities/grep.html">IEEE
- Std 1003.1-2001, Portable Operating System Interface (POSIX ), Shells and
- Utilities, Section 4, Utilities, grep (FWD.1).</A>
- Emacs Version 21.3.
- 
- <HR>
- 
- Revised 
- 
- 21 Aug 2004 
- 
- © Copyright <a href="mailto:jm_at_[hidden]">John Maddock</a> 2004
- 
- Use, modification and distribution are subject to 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).
- 
- </body>
-</html>

Deleted: trunk/libs/regex/doc/syntax_extended.html
==============================================================================
--- trunk/libs/regex/doc/syntax_extended.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,520 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: POSIX-Extended Regular Expression Syntax</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">POSIX-Extended Regular Expression Syntax</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>POSIX Extended Syntax
- <dt>Variations
- <dd>
- <dl>
- <dt>egrep <dt>awk </dt>
- </dl>
- <dt>Options <dt>References</dt>
- </dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- 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. You can construct POSIX extended regular expressions in
- Boost.Regex by passing the flag extended to the regex constructor, for
- example:
- <PRE>// e1 is a case sensitive POSIX-Extended expression:
-boost::regex e1(my_expression, boost::regex::extended);
-// e2 a case insensitive POSIX-Extended expression:
-boost::regex e2(my_expression, boost::regex::extended|boost::regex::icase);</PRE>
- <H3>POSIX Extended Syntax<A name="extended"></A></H3>
- In POSIX-Extended regular expressions, all characters match themselves except
- for the following special characters:
- <PRE>.[{()\*+?|^$</PRE>
- <H4>Wildcard:</H4>
- 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 is passed to the
- matching algorithms.
- The newline character when the flag match_not_dot_newline is passed to
- the matching algorithms.
- <H4>Anchors:</H4>
- 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.
- 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.
- <H4>Marked sub-expressions:</H4>
- 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.
- <H4>Repeats:</H4>
- Any atom (a single character, a marked sub-expression, or a character class)
- can be repeated with the *, +, ?, and {} operators.
- The * operator will match the preceding atom zero or more times, for example
- the expression a*b will match any of the following:
- <PRE>b
-ab
-aaaaaaaab</PRE>
- The + operator will match the preceding atom one or more times, for example the
- expression a+b will match any of the following:
- <PRE>ab
-aaaaaaaab</PRE>
- But will not match:
- <PRE>b</PRE>
- The ? operator will match the preceding atom zero or one times, for
- example the expression ca?b will match any of the following:
- <PRE>cb
-cab</PRE>
- But will not match:
- <PRE>caab</PRE>
- An atom can also be repeated with a bounded repeat:
- a{n}  Matches 'a' repeated exactly n times.
- a{n,}  Matches 'a' repeated n or more times.
- a{n, m}  Matches 'a' repeated between n and m times
- inclusive.
- For example:
- <PRE>^a{2,3}$</PRE>
- Will match either of:
- <PRE>aa
-aaa</PRE>
- But neither of:
- <PRE>a
-aaaa</PRE>
- It is an error to use a repeat operator, if the preceding construct can not be
- repeated, for example:
- <PRE>a(*)</PRE>
- Will raise an error, as there is nothing for the * operator to be applied to.
- <H4>Back references:</H4>
- 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 n. 
- For example the expression:
- <PRE>^(a*).*\1$</PRE>
- Will match the string:
- <PRE>aaabbaaa</PRE>
- But not the string:
- <PRE>aaabba</PRE>
- Caution: the POSIX standard does not support back-references
- for "extended" regular expressions, this is a compatible extension to that
- standard.
- <H4>Alternation</H4>
- 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) will match
- either of "abd" or "abef".
- <H4>Character sets:</H4>
- 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:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- <H5>Single characters:</H5>
- For example [abc], will match any of the characters 'a', 'b', or 'c'.
- <H5>Character ranges:</H5>
- 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 <A href="syntax_option_type.html#extended">
- collate</A> option flag - in which case whether a character appears
- within a range is determined by comparing the code points of the characters
- only.
- <H5>Negation:</H5>
- 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.
- <H5>Character classes:</H5>
- An expression of the form [[:name:]] matches the named character class "name",
- for example [[:lower:]] matches any lower case character.  See <A href="character_class_names.html">
- character class names</A>.
- <H5>Collating Elements:</H5>
- 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] 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 match either one
- of the characters 'abc^'.
- As an extension, a collating element may also be specified via its <A href="collating_names.html">
- symbolic name</A>, for example:
- [[.NUL.]]
- matches a NUL character.
- <H5>Equivalence classes:</H5>
- 
- An expression oftheform[[=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 <A href="collating_names.html">
- symbolic name</A>.  A primary sort key is one that ignores case,
- accentation, or locale-specific tailorings; so for example [[=a=]] matches any
- of the characters: a, à, á, â, ã, ä, å, A, À, Á, Â, Ã, Ä and Å. 
- Unfortunately implementation 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.
- </BLOCKQUOTE>
- <H5>Combinations:</H5>
- All of the above can be combined in one character set declaration, for example:
- [[:digit:]a-c[.NUL.]].
- <H4>Escapes</H4>
- The POSIX standard defines no escape sequences for POSIX-Extended regular
- expressions, except that:
- <UL>
- <LI>
- Any special character preceded by an escape shall match itself.
- <LI>
- The effect of any ordinary character being preceded by an escape is undefined.
- <LI>
- 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 [\^] will match either a literal '\' or a '^'.</LI></UL>
- However, that's rather restrictive, so the following standard-compatible
- extensions are also supported by Boost.Regex:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- <H5>Escapes matching a specific character</H5>
- The following escape sequences are all synonyms for single characters:
- 
- <TABLE id="Table7" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Escape</TD>
- <TD>Character</TD>
- </TR>
- <TR>
- <TD>\a</TD>
- <TD>'\a'</TD>
- </TR>
- <TR>
- <TD>\e</TD>
- <TD>0x1B</TD>
- </TR>
- <TR>
- <TD>\f</TD>
- <TD>\f</TD>
- </TR>
- <TR>
- <TD>\n</TD>
- <TD>\n</TD>
- </TR>
- <TR>
- <TD>\r</TD>
- <TD>\r</TD>
- </TR>
- <TR>
- <TD>\t</TD>
- <TD>\t</TD>
- </TR>
- <TR>
- <TD>\v</TD>
- <TD>\v</TD>
- </TR>
- <TR>
- <TD>\b</TD>
- <TD>\b (but only inside a character class declaration).</TD>
- </TR>
- <TR>
- <TD>\cX</TD>
- <TD>An ASCII escape sequence - the character whose code point is X % 32</TD>
- </TR>
- <TR>
- <TD>\xdd</TD>
- <TD>A hexadecimal escape sequence - matches the single character whose code point
- is 0xdd.</TD>
- </TR>
- <TR>
- <TD>\x{dddd}</TD>
- <TD>A hexadecimal escape sequence - matches the single character whose code point
- is 0xdddd.</TD>
- </TR>
- <TR>
- <TD>\0ddd</TD>
- <TD>An octal escape sequence - matches the single character whose code point is
- 0ddd.</TD>
- </TR>
- <TR>
- <TD>\N{Name}</TD>
- <TD>Matches the single character which has the <A href="collating_names.html">symbolic
- name</A> name.  For example \N{newline} matches the single
- character \n.</TD>
- </TR>
- </TABLE>
- 
- <H5>"Single character" character classes:</H5>
- Any escaped character x, if x is the name of a character
- class shall match any character that is a member of that class, and any escaped
- character X, if x is the name of a character class, shall
- match any character not in that class.
- The following are supported by default:
- 
- <TABLE id="Table3" cellSpacing="1" cellPadding="1" width="300" border="1">
- <TR>
- <TD>Escape sequence</TD>
- <TD>Equivalent to</TD>
- </TR>
- <TR>
- <TD>\d</TD>
- <TD>[[:digit:]]</TD>
- </TR>
- <TR>
- <TD>\l</TD>
- <TD>[[:lower:]]</TD>
- </TR>
- <TR>
- <TD>\s</TD>
- <TD>[[:space:]]</TD>
- </TR>
- <TR>
- <TD>\u</TD>
- <TD>[[:upper:]]</TD>
- </TR>
- <TR>
- <TD>\w</TD>
- <TD>[[:word:]]</TD>
- </TR>
- <TR>
- <TD>\D</TD>
- <TD>[^[:digit:]]</TD>
- </TR>
- <TR>
- <TD>\L</TD>
- <TD>[^[:lower:]]</TD>
- </TR>
- <TR>
- <TD>\S</TD>
- <TD>[^[:space:]]</TD>
- </TR>
- <TR>
- <TD>\U</TD>
- <TD>[^[:upper:]]</TD>
- </TR>
- <TR>
- <TD>\W</TD>
- <TD>[^[:word:]]</TD>
- </TR>
- </TABLE>
- 
- <H5>
- <H5>Character Properties</H5>
- </H5>
- The character property names in the following table are all
- equivalent to the <A href="character_class_names.html">names used in character
- classes</A>.
- <H5>
- <TABLE id="Table9" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>Form</TD>
- <TD>Description</TD>
- <TD>Equivalent character set form</TD>
- </TR>
- <TR>
- <TD>\pX</TD>
- <TD>Matches any character that has the property X.</TD>
- <TD>[[:X:]]</TD>
- </TR>
- <TR>
- <TD>\p{Name}</TD>
- <TD>Matches any character that has the property Name.</TD>
- <TD>[[:Name:]]</TD>
- </TR>
- <TR>
- <TD>\PX</TD>
- <TD>Matches any character that does not have the property X.</TD>
- <TD>[^[:X:]]</TD>
- </TR>
- <TR>
- <TD>\P{Name}</TD>
- <TD>Matches any character that does not have the property Name.</TD>
- <TD>[^[:Name:]]</TD>
- </TR>
- </TABLE>
- </H5>
- <H5>Word Boundaries</H5>
- The following escape sequences match the boundaries of words:
- 
- <TABLE id="Table4" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>\<</TD>
- <TD>Matches the start of a word.</TD>
- </TR>
- <TR>
- <TD>\></TD>
- <TD>Matches the end of a word.</TD>
- </TR>
- <TR>
- <TD>\b</TD>
- <TD>Matches a word boundary (the start or end of a word).</TD>
- </TR>
- <TR>
- <TD>\B</TD>
- <TD>Matches only when not at a word boundary.</TD>
- </TR>
- </TABLE>
- 
- <H5>Buffer boundaries</H5>
- 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 that ^ and
- $ may match embedded newlines within the text).
- 
- <TABLE id="Table5" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>\`</TD>
- <TD>Matches at the start of a buffer only.</TD>
- </TR>
- <TR>
- <TD>\'</TD>
- <TD>Matches at the end of a buffer only.</TD>
- </TR>
- <TR>
- <TD>\A</TD>
- <TD>Matches at the start of a buffer only (the same as \`).</TD>
- </TR>
- <TR>
- <TD>\z</TD>
- <TD>Matches at the end of a buffer only (the same as \').</TD>
- </TR>
- <TR>
- <TD>\Z</TD>
- <TD>Matches an optional sequence of newlines at the end of a buffer: equivalent to
- the regular expression \n*\z</TD>
- </TR>
- </TABLE>
- 
- <H5>Continuation Escape</H5>
- 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.
- <H5>Quoting escape</H5>
- 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:
- <PRE>\*+a \*+aaa</PRE>
- <H5>Unicode escapes</H5>
- 
- <TABLE id="Table6" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>\C</TD>
- <TD>Matches a single code point: in Boost regex this has exactly the same effect
- as a "." operator.</TD>
- </TR>
- <TR>
- <TD>\X</TD>
- <TD>Matches a combining character sequence: that is any non-combining character
- followed by a sequence of zero or more combining characters.</TD>
- </TR>
- </TABLE>
- 
- <H5>Any other escape</H5>
- Any other escape sequence matches the character that is escaped, for example \@
- matches a literal <A href="mailto:'@'">'@'</A>.
- </BLOCKQUOTE><A name="variations">
- <H4>Operator precedence</H4>
-  The order of precedence for of operators is as shown in the following
- table:
- 
- <TABLE id="Table2" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Collation-related bracket symbols</TD>
- <TD>[==] [::] [..]</TD>
- </TR>
- <TR>
- <TD>Escaped characters
- </TD>
- <TD>\</TD>
- </TR>
- <TR>
- <TD>Character set (bracket expression)
- </TD>
- <TD>[]</TD>
- </TR>
- <TR>
- <TD>Grouping</TD>
- <TD>()</TD>
- </TR>
- <TR>
- <TD>Single-character-ERE duplication
- </TD>
- <TD>* + ? {m,n}</TD>
- </TR>
- <TR>
- <TD>Concatenation</TD>
- <TD></TD>
- </TR>
- <TR>
- <TD>Anchoring</TD>
- <TD>^$</TD>
- </TR>
- <TR>
- <TD>Alternation</TD>
- <TD>|</TD>
- </TR>
- </TABLE>
- 
- </A>
- <H4>What Gets Matched</H4>
- When there is more that one way to match a regular expression, the "best"
- possible match is obtained using the <A href="syntax_leftmost_longest.html">leftmost-longest
- rule</A>.
- <H3>Variations</H3>
- <H4>Egrep<A name="egrep"></H4>
- 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:
- <PRE>boost::regex e("abc\ndef", boost::regex::egrep);</PRE>
- will match either of the POSIX-Basic expressions "abc" or "def".
- As its name suggests, this behavior is consistent with the Unix utility egrep,
- and with grep when used with the -E option.
- <H4>awk<A name="awk"></A></H4>
- In addition to the POSIX-Extended features the
- escape character is special inside a character class declaration. 
- In addition, some escape sequences that are not defined as part of
- POSIX-Extended specification are required to be supported - however Boost.Regex
- supports these by default anyway.
- <H3><A name="options"></A>Options</H3>
- 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 <A href="syntax_option_type.html#extended">
- newline_alt</A> option alters the syntax, while the <A href="syntax_option_type.html#extended">
- collate, nosubs and icase</A> options modify how the case and locale
- sensitivity are to be applied.
- <H3><A name="refs">References</H3>
- <A href="http://www.opengroup.org/onlinepubs/000095399/basedefs/xbd_chap09.html"> IEEE
- Std 1003.1-2001, Portable Operating System Interface (POSIX ), Base Definitions
- and Headers, Section 9, Regular Expressions.</A>
- <A href="http://www.opengroup.org/onlinepubs/000095399/utilities/grep.html"> IEEE
- Std 1003.1-2001, Portable Operating System Interface (POSIX ), Shells and
- Utilities, Section 4, Utilities, egrep.</A>
- <A href="http://www.opengroup.org/onlinepubs/000095399/utilities/awk.html">IEEE
- Std 1003.1-2001, Portable Operating System Interface (POSIX ), Shells and
- Utilities, Section 4, Utilities, awk.</A>
- <HR>
- 
- Revised 
- 
- 21 Aug 2004 
- 
- © Copyright <a href="mailto:jm_at_[hidden]">John Maddock</a> 2004
- 
- Use, modification and distribution are subject to 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).
- 
- </body>
-</html>

Deleted: trunk/libs/regex/doc/syntax_leftmost_longest.html
==============================================================================
--- trunk/libs/regex/doc/syntax_leftmost_longest.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,65 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Index</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">The "Leftmost Longest" Rule</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- 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" match is determined as follows:
- <OL>
- <LI>
- Find the leftmost match, if there is only one match possible at this location
- then return it.</LI>
- <LI>
- Find the longest of the possible matches, along with any ties.  If there
- is only one such possible match then return it.</LI>
- <LI>
- If there are no marked sub-expressions, then all the remaining alternatives are
- indistinguishable; return the first of these found.</LI>
- <LI>
- Find the match which has matched the first sub-expression in the leftmost
- position, along with any ties.  If there is only on such match possible
- then return it.</LI>
- <LI>
- Find the match which has the longest match for the first sub-expression, along
- with any ties.  If there is only one such match then return it.</LI>
- <LI>
- Repeat steps 3 and 4 for each additional marked sub-expression.</LI>
- <LI>
- If there is still more than one possible match remaining, then they are
- indistinguishable; return the first one found.</LI></OL>
- 
- <HR>
- 
- Revised
- 
- 16 Dec 2004
- © Copyright John Maddock 1998-
-  2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/syntax_option_type.html
==============================================================================
--- trunk/libs/regex/doc/syntax_option_type.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,543 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: syntax_option_type</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">syntax_option_type</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>Description
- <dd>
- <dl class="index">
- <dt>Options for Perl Regular Expressions <dt><a href="#extended">Options
- for POSIX Extended Regular Expressions</a> <dt><a href="#basic">Options for POSIX
- Basic Regular Expressions</a> <dt>Options for String Literals</dt>
- </dl>
- </dd>
- </dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- 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.
- <PRE>namespace std{ namespace regex_constants{
-
-typedef implementation-specific-bitmask-type syntax_option_type; 
-// these flags are standardized:
-static const syntax_option_type normal;
-static const syntax_option_type ECMAScript = normal;
-static const syntax_option_type JavaScript = normal;
-static const syntax_option_type JScript = normal;
-static const syntax_option_type perl = normal; static const syntax_option_type basic;
-static const syntax_option_type sed = basic;
-static const syntax_option_type extended;
-static const syntax_option_type awk;
-static const syntax_option_type grep;
-static const syntax_option_type egrep;
-static const syntax_option_type icase;
-static const syntax_option_type nosubs;
-static const syntax_option_type optimize;
-static const syntax_option_type collate;
-// other boost.regex specific options are listed below 
-} // namespace regex_constants
-} // namespace std</PRE>
- <H3><A name="description"></A>Description</H3>
- The type <CODE>syntax_option_type</CODE> is an implementation specific bitmask
- type (17.3.2.1.2). Setting its elements has the effects listed in the table
- below, a valid value of type <CODE>syntax_option_type</CODE> will always have
- exactly one of the elements <CODE>normal, basic, extended, awk, grep, egrep, sed,
- literal or perl</CODE> 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 of:
- <PRE>boost::regex_constants::constant_name</PRE>
- or
- <PRE>boost::regex::constant_name</PRE>
- or
- <PRE>boost::wregex::constant_name</PRE>
- in an interchangeable manner.
- <H4><A name="perl"></A>Options for Perl Regular Expressions:</H4>
- One of the following must always be set for perl regular expressions:
- 
- <TABLE id="Table4" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Element</TD>
- <TD>Standardized</TD>
- <TD>Effect when set</TD>
- </TR>
- <TR>
- <TD>
- ECMAScript
- </TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the grammar recognized by the regular expression engine uses its
- normal semantics: that is the same as that given in the ECMA-262, ECMAScript
- Language Specification, Chapter 15 part 10, RegExp (Regular Expression) Objects
- (FWD.1).
- boost.regex also recognizes all of the perl-compatible (?...) extensions in
- this mode.
- </TD>
- </TR>
- <TR>
- <TD>perl</TD>
- <TD>No</TD>
- <TD>As above.</TD>
- </TR>
- <TR>
- <TD>normal</TD>
- <TD>No</TD>
- <TD>As above.</TD>
- </TR>
- <TR>
- <TD>JavaScript</TD>
- <TD>No</TD>
- <TD>As above.</TD>
- </TR>
- <TR>
- <TD>JScript</TD>
- <TD>No</TD>
- <TD>As above.</TD>
- </TR>
- </TABLE>
- 
- The following options may also be set when using perl-style regular
- expressions:
- 
- <TABLE id="Table5" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Element</TD>
- <TD>Standardized</TD>
- <TD>Effect when set</TD>
- </TR>
- <TR>
- <TD>icase</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that matching of regular expressions against a character container
- sequence shall be performed without regard to case.
- </TD>
- </TR>
- <TR>
- <TD>nosubs</TD>
- <TD>Yes</TD>
- <TD>
- 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.
- </TD>
- </TR>
- <TR>
- <TD>optimize</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the regular expression engine should pay more attention to the
- speed with which regular expressions are matched, and less to the speed with
- which regular expression objects are constructed. Otherwise it has no
- detectable effect on the program output.  This currently has no effect for
- Boost.Regex.
- </TD>
- </TR>
- <TR>
- <TD>collate</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that character ranges of the form "[a-b]" should be locale sensitive.
- </TD>
- </TR>
- <TR>
- <TD>newline_alt</TD>
- <TD>No</TD>
- <TD>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.</TD>
- </TR>
- <TR>
- <TD>no_except</TD>
- <TD>No</TD>
- <TD>Prevents basic_regex from throwing an exception when an invalid expression is
- encountered.</TD>
- </TR>
- <TR>
- <TD>no_mod_m</TD>
- <TD>No</TD>
- <TD>Normally Boost.Regex behaves as if the Perl m-modifier is on: so the
- assertions ^ and $ match after and before embedded newlines respectively,
- setting this flags is equivalent to prefixing the expression with (?-m).</TD>
- </TR>
- <TR>
- <TD>no_mod_s</TD>
- <TD>No</TD>
- <TD>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 in the match flags.</TD>
- </TR>
- <TR>
- <TD>mod_s</TD>
- <TD>No</TD>
- <TD>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 in the match flags.</TD>
- </TR>
- <TR>
- <TD>mod_x</TD>
- <TD>No</TD>
- <TD>Turns on the perl x-modifier: causes unescaped whitespace in the expression to
- be ignored.</TD>
- </TR>
- </TABLE>
- 
- <H4><A name="extended"></A>Options for POSIX Extended Regular Expressions:</H4>
- Exactly one of the following must always be set for POSIX extended regular
- expressions:
- 
- <TABLE id="Table6" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Element</TD>
- <TD>Standardized</TD>
- <TD>Effect when set</TD>
- </TR>
- <TR>
- <TD>extended</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the grammar recognized by the regular expression engine is the
- same as that used by POSIX extended regular expressions in IEEE Std
- 1003.1-2001, Portable Operating System Interface (POSIX ), Base Definitions and
- Headers, Section 9, Regular Expressions (FWD.1). 
- 
- In addition some perl-style escape sequences are supported (The POSIX standard
- specifies that only "special" characters may be escaped, all other escape
- sequences result in undefined behavior).
- </TD>
- </TR>
- <TR>
- <TD>egrep</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the grammar recognized by the regular expression engine is the
- same as that used by POSIX utility grep when given the -E option in IEEE Std
- 1003.1-2001, Portable Operating System Interface (POSIX ), Shells and
- Utilities, Section 4, Utilities, grep (FWD.1).
- That is to say, the same as POSIX extended syntax, but with the newline
- character acting as an alternation character in addition to "|".
- </TD>
- </TR>
- <TR>
- <TD>awk</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the grammar recognized by the regular expression engine is the
- same as that used by POSIX utility awk in IEEE Std 1003.1-2001, Portable
- Operating System Interface (POSIX ), Shells and Utilities, Section 4, awk
- (FWD.1).
- That is to say: the same as POSIX extended syntax, but with escape sequences in
- character classes permitted.
- In addition some perl-style escape sequences are supported (actually the awk
- syntax only requires \a \b \t \v \f \n and \r to be recognised, all other
- Perl-style escape sequences invoke undefined behavior according to the POSIX
- standard, but are in fact recognised by Boost.Regex).
- </TD>
- </TR>
- </TABLE>
- 
- The following options may also be set when using POSIX extended regular
- expressions:
- 
- <TABLE id="Table7" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Element</TD>
- <TD>Standardized</TD>
- <TD>Effect when set</TD>
- </TR>
- <TR>
- <TD>icase</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that matching of regular expressions against a character container
- sequence shall be performed without regard to case.
- </TD>
- </TR>
- <TR>
- <TD>nosubs</TD>
- <TD>Yes</TD>
- <TD>
- 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.
- </TD>
- </TR>
- <TR>
- <TD>optimize</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the regular expression engine should pay more attention to the
- speed with which regular expressions are matched, and less to the speed with
- which regular expression objects are constructed. Otherwise it has no
- detectable effect on the program output.  This currently has no effect for
- boost.regex.
- </TD>
- </TR>
- <TR>
- <TD>collate</TD>
- <TD>Yes</TD>
- <TD>
- 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.
- </TD>
- </TR>
- <TR>
- <TD>newline_alt</TD>
- <TD>No</TD>
- <TD>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.</TD>
- </TR>
- <TR>
- <TD>no_escape_in_lists</TD>
- <TD>No</TD>
- <TD>When set this makes the escape character ordinary inside lists, so that [\b]
- would match either '\' or 'b'. This bit is one by default for
- POSIX-Extended regular expressions, but can be unset to force escapes to be
- recognised inside lists.</TD>
- </TR>
- <TR>
- <TD>no_bk_refs</TD>
- <TD>No</TD>
- <TD>When set then backreferences are disabled.  This bit is 
- on by default for POSIX-Extended regular expressions, but can be
- unset to support for backreferences on.</TD>
- </TR>
- <TR>
- <TD>no_except</TD>
-  <TD>
- <TD></TD>
- <TD>No</TD>
- <TD>Prevents basic_regex from throwing an exception when an invalid expression is
- encountered.</TD>
- </TR>
- </TABLE>
- 
- <H4><A name="basic"></A>Options for POSIX Basic Regular Expressions:</H4>
- Exactly one of the following must always be set for POSIX basic regular
- expressions:
- 
- <TABLE id="Table8" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Element</TD>
- <TD>Standardized</TD>
- <TD>Effect When Set</TD>
- </TR>
- <TR>
- <TD>basic</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the grammar recognized by the regular expression engine is the
- same as that used by <A href="syntax_basic.html#Basic">POSIX basic regular
- expressions</A> in IEEE Std 1003.1-2001, Portable Operating System Interface
- (POSIX ), Base Definitions and Headers, Section 9, Regular Expressions (FWD.1).
- 
- </TD>
- </TR>
- <TR>
- <TD>sed</TD>
- <TD>No</TD>
- <TD>As Above.</TD>
- </TR>
- <TR>
- <TD>grep</TD>
- <TD>Yes</TD>
- <TD>
- 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, Portable Operating System Interface (POSIX ), Shells and
- Utilities, Section 4, Utilities, grep (FWD.1).
- 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.
- </TD>
- </TR>
- <TR>
- <TD>emacs</TD>
- <TD>No</TD>
- <TD>Specifies that the grammar recognised is the superset of the POSIX-Basic
- syntax used by the emacs program.</TD>
- </TR>
- </TABLE>
- 
- The following options may also be set when using POSIX basic regular
- expressions:
- 
- <TABLE id="Table9" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Element</TD>
- <TD>Standardized</TD>
- <TD>Effect when set</TD>
- </TR>
- <TR>
- <TD>icase</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that matching of regular expressions against a character container
- sequence shall be performed without regard to case.
- </TD>
- </TR>
- <TR>
- <TD>nosubs</TD>
- <TD>Yes</TD>
- <TD>
- 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.
- </TD>
- </TR>
- <TR>
- <TD>optimize</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the regular expression engine should pay more attention to the
- speed with which regular expressions are matched, and less to the speed with
- which regular expression objects are constructed. Otherwise it has no
- detectable effect on the program output.  This currently has no effect for
- boost.regex.
- </TD>
- </TR>
- <TR>
- <TD>collate</TD>
- <TD>Yes</TD>
- <TD>
- 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.
- </TD>
- </TR>
- <TR>
- <TD>newline_alt</TD>
- <TD>No</TD>
- <TD>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.</TD>
- </TR>
- <TR>
- <TD>no_char_classes</TD>
- <TD>No</TD>
- <TD>When set then character classes such as [[:alnum:]] are not allowed.</TD>
- </TR>
- <TR>
- <TD>no_escape_in_lists</TD>
- <TD>No</TD>
- <TD>When set this makes the escape character ordinary inside lists, so that [\b]
- would match either '\' or 'b'. This bit is one by default for
- POSIX-basic regular expressions, but can be unset to force escapes to be
- recognised inside lists.</TD>
- </TR>
- <TR>
- <TD>no_intervals</TD>
- <TD>No</TD>
- <TD>When set then bounded repeats such as a{2,3} are not permitted.</TD>
- </TR>
- <TR>
- <TD>bk_plus_qm</TD>
- <TD>No</TD>
- <TD>When set then \? acts as a zero-or-one repeat operator, and \+ acts as a
- one-or-more repeat operator.</TD>
- </TR>
- <TR>
- <TD>bk_vbar</TD>
- <TD>No</TD>
- <TD>When set then \| acts as the alternation operator.</TD>
- </TR>
- <TR>
- <TD>no_except</TD>
- <TD>
- <TD></TD>
- <TD>No</TD>
- <TD>Prevents basic_regex from throwing an exception when an invalid expression is
- encountered.</TD>
- </TR>
- </TABLE>
- 
- <H4><A name="literals"></A>Options for Literal Strings:</H4>
- The following must always be set to interpret the expression as a string
- literal:
- 
- <TABLE id="Table10" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Element</TD>
- <TD>Standardized</TD>
- <TD>Effect when set</TD>
- </TR>
- <TR>
- <TD>literal</TD>
- <TD>Yes</TD>
- <TD>Treat the string as a literal (no special characters).</TD>
- </TR>
- </TABLE>
- 
- The following options may also be combined with the literal flag:
- 
- <TABLE id="Table11" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Element</TD>
- <TD>Standardized</TD>
- <TD>Effect when set</TD>
- </TR>
- <TR>
- <TD>icase</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that matching of regular expressions against a character container
- sequence shall be performed without regard to case.
- </TD>
- </TR>
- <TR>
- <TD>optimize</TD>
- <TD>Yes</TD>
- <TD>
- Specifies that the regular expression engine should pay more attention to the
- speed with which regular expressions are matched, and less to the speed with
- which regular expression objects are constructed. Otherwise it has no
- detectable effect on the program output.  This currently has no effect for
- boost.regex.
- </TD>
- </TR>
- </TABLE>
- 
-  
- <HR>
- Revised 
- 
- 23 June 2004 
- 
- © Copyright John Maddock 1998-
-  2004
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/syntax_perl.html
==============================================================================
--- trunk/libs/regex/doc/syntax_perl.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,626 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Perl Regular Expression Syntax</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <LINK href="../../../boost.css" type="text/css" rel="stylesheet"></head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td vAlign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">
- Perl Regular Expression Syntax</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- <H3>Contents</H3>
- <dl class="index">
- <dt>Synopsis <dt>Perl Syntax <dt><A href="#what">
- What Gets Matched</A> <dt>Variations
- <dd>
- <dt>Options <dt>Modifiers <dt>References</dt>
- </dl>
- <H3><A name="synopsis"></A>Synopsis</H3>
- 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
- regex constructor, for example:
- <PRE>// e1 is a case sensitive Perl regular expression:
-// since Perl is the default option there's no need to explicitly specify the syntax used here:
-boost::regex e1(my_expression);
-// e2 a case insensitive Perl regular expression:
-boost::regex e2(my_expression, boost::regex::perl|boost::regex::icase);</PRE>
- <H3>Perl Regular Expression Syntax<A name="Perl"></A></H3>
- In Perl regular expressions, all characters match themselves except for
- the following special characters:
- <PRE>.[{()\*+?|^$</PRE>
- <H4>Wildcard:</H4>
- 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 is passed to the
- matching algorithms.
- The newline character when the flag match_not_dot_newline is passed to
- the matching algorithms.
- <H4>Anchors:</H4>
- A '^' character shall match the start of a line.
- A '$' character shall match the end of a line.
- <H4>Marked sub-expressions:</H4>
- 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.
- <H4>Non-marking grouping:</H4>
- 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 out any separate
- sub-expressions.
- <H4>Repeats:</H4>
- Any atom (a single character, a marked sub-expression, or a character class)
- can be repeated with the *, +, ?, and {} operators.
- The * operator will match the preceding atom zero or more times, for example
- the expression a*b will match any of the following:
- <PRE>b
-ab
-aaaaaaaab</PRE>
- The + operator will match the preceding atom one or more times, for example the
- expression a+b will match any of the following:
- <PRE>ab
-aaaaaaaab</PRE>
- But will not match:
- <PRE>b</PRE>
- The ? operator will match the preceding atom zero or one times, for
- example the expression ca?b will match any of the following:
- <PRE>cb
-cab</PRE>
- But will not match:
- <PRE>caab</PRE>
- An atom can also be repeated with a bounded repeat:
- a{n}  Matches 'a' repeated exactly n times.
- a{n,}  Matches 'a' repeated n or more times.
- a{n, m}  Matches 'a' repeated between n and m times
- inclusive.
- For example:
- <PRE>^a{2,3}$</PRE>
- Will match either of:
- <PRE>aa
-aaa</PRE>
- But neither of:
- <PRE>a
-aaaa</PRE>
- It is an error to use a repeat operator, if the preceding construct can not be
- repeated, for example:
- <PRE>a(*)</PRE>
- Will raise an error, as there is nothing for the * operator to be applied to.
- <H4>Non greedy repeats</H4>
- 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 zero or more times, while consuming as little
- input as possible.
- +? Matches the previous atom one or more times, while consuming as little input
- as possible.
- ?? Matches the previous atom zero or one times, while consuming as little input
- as possible.
- {n,}? Matches the previous atom n or more times, while consuming
- as little input as possible.
- {n,m}? Matches the previous atom between n and m times,
- while consuming as little input as possible.
- <H4>Back references:</H4>
- 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 n. 
- For example the expression:
- <PRE>^(a*).*\1$</PRE>
- Will match the string:
- <PRE>aaabbaaa</PRE>
- But not the string:
- <PRE>aaabba</PRE>
- <H4>Alternation</H4>
- 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) 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 (?:) as a placeholder, for
- example:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- "|abc" is not a valid expression, but 
- "(?:)|abc" is and is equivalent, also the expression: 
- "(?:abc)??" has exactly the same effect.
- </BLOCKQUOTE>
- <H4>Character sets:</H4>
- 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:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- <H5>Single characters:</H5>
- For example [abc], will match any of the characters 'a', 'b', or 'c'.
- <H5>Character ranges:</H5>
- For example [a-c] will match any single character in the range 'a' to
- 'c'.  By default, for POSIX-Perl 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 which case whether a character appears within a range is
- determined by comparing the code points of the characters only
- <H5>Negation:</H5>
- 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.
- <H5>Character classes:</H5>
- An expression of the form [[:name:]] matches the named character class "name",
- for example [[:lower:]] matches any lower case character.  See <A href="character_class_names.html">
- character class names</A>.
- <H5>Collating Elements:</H5>
- 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] 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 <A href="collating_names.html">
- symbolic name</A>, for example:
- [[.NUL.]]
- matches a NUL character.
- <H5>Equivalence classes:</H5>
- 
- An expression oftheform[[=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 <A href="collating_names.html">
- symbolic name</A>.  A primary sort key is one that ignores case,
- accentation, or locale-specific tailorings; so for example [[=a=]] matches any
- of the characters: a, à, á, â, ã, ä, å, A, À, Á, Â, Ã, Ä and Å. 
- Unfortunately implementation 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.
- <H5>Escapes:</H5>
- All the escape sequences that match a single character, or a single character
- class are permitted within a character class definition, except the
- negated character classes (\D \W etc).
- </BLOCKQUOTE>
- <H5>Combinations:</H5>
- All of the above can be combined in one character set declaration, for example:
- [[:digit:]a-c[.NUL.]].
- <H4>Escapes</H4>
- Any special character preceded by an escape shall match itself.
- 
- The following escape sequences are also supported:
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- <H5>Escapes matching a specific character</H5>
- The following escape sequences are all synonyms for single characters:
- 
- <TABLE id="Table7" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Escape</TD>
- <TD>Character</TD>
- </TR>
- <TR>
- <TD>\a</TD>
- <TD>'\a'</TD>
- </TR>
- <TR>
- <TD>\e</TD>
- <TD>0x1B</TD>
- </TR>
- <TR>
- <TD>\f</TD>
- <TD>\f</TD>
- </TR>
- <TR>
- <TD>\n</TD>
- <TD>\n</TD>
- </TR>
- <TR>
- <TD>\r</TD>
- <TD>\r</TD>
- </TR>
- <TR>
- <TD>\t</TD>
- <TD>\t</TD>
- </TR>
- <TR>
- <TD>\v</TD>
- <TD>\v</TD>
- </TR>
- <TR>
- <TD>\b</TD>
- <TD>\b (but only inside a character class declaration).</TD>
- </TR>
- <TR>
- <TD>\cX</TD>
- <TD>An ASCII escape sequence - the character whose code point is X % 32</TD>
- </TR>
- <TR>
- <TD>\xdd</TD>
- <TD>A hexadecimal escape sequence - matches the single character whose code point
- is 0xdd.</TD>
- </TR>
- <TR>
- <TD>\x{dddd}</TD>
- <TD>A hexadecimal escape sequence - matches the single character whose code point
- is 0xdddd.</TD>
- </TR>
- <TR>
- <TD>\0ddd</TD>
- <TD>An octal escape sequence - matches the single character whose code point is
- 0ddd.</TD>
- </TR>
- <TR>
- <TD>\N{name}</TD>
- <TD>Matches the single character which has the <A href="collating_names.html">symbolic
- name</A> name.  For example \N{newline} matches the single
- character \n.</TD>
- </TR>
- </TABLE>
- 
- <H5>"Single character" character classes:</H5>
- Any escaped character x, if x is the name of a character
- class shall match any character that is a member of that class, and any escaped
- character X, if x is the name of a character class, shall
- match any character not in that class.
- The following are supported by default:
- 
- <TABLE id="Table3" cellSpacing="1" cellPadding="1" width="300" border="1">
- <TR>
- <TD>Escape sequence</TD>
- <TD>Equivalent to</TD>
- </TR>
- <TR>
- <TD>\d</TD>
- <TD>[[:digit:]]</TD>
- </TR>
- <TR>
- <TD>\l</TD>
- <TD>[[:lower:]]</TD>
- </TR>
- <TR>
- <TD>\s</TD>
- <TD>[[:space:]]</TD>
- </TR>
- <TR>
- <TD>\u</TD>
- <TD>[[:upper:]]</TD>
- </TR>
- <TR>
- <TD>\w</TD>
- <TD>[[:word:]]</TD>
- </TR>
- <TR>
- <TD>\D</TD>
- <TD>[^[:digit:]]</TD>
- </TR>
- <TR>
- <TD>\L</TD>
- <TD>[^[:lower:]]</TD>
- </TR>
- <TR>
- <TD>\S</TD>
- <TD>[^[:space:]]</TD>
- </TR>
- <TR>
- <TD>\U</TD>
- <TD>[^[:upper:]]</TD>
- </TR>
- <TR>
- <TD>\W</TD>
- <TD>[^[:word:]]</TD>
- </TR>
- </TABLE>
- 
- <H5>Character Properties</H5>
- The character property names in the following table are all equivalent to the <A href="character_class_names.html">
- names used in character classes</A>.
- 
- <TABLE id="Table9" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>Form</TD>
- <TD>Description</TD>
- <TD>Equivalent character set form</TD>
- </TR>
- <TR>
- <TD>\pX</TD>
- <TD>Matches any character that has the property X.</TD>
- <TD>[[:X:]]</TD>
- </TR>
- <TR>
- <TD>\p{Name}</TD>
- <TD>Matches any character that has the property Name.</TD>
- <TD>[[:Name:]]</TD>
- </TR>
- <TR>
- <TD>\PX</TD>
- <TD>Matches any character that does not have the property X.</TD>
- <TD>[^[:X:]]</TD>
- </TR>
- <TR>
- <TD>\P{Name}</TD>
- <TD>Matches any character that does not have the property Name.</TD>
- <TD>[^[:Name:]]</TD>
- </TR>
- </TABLE>
- 
- <H5>Word Boundaries</H5>
- The following escape sequences match the boundaries of words:
- 
- <TABLE id="Table4" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>\<</TD>
- <TD>Matches the start of a word.</TD>
- </TR>
- <TR>
- <TD>\></TD>
- <TD>Matches the end of a word.</TD>
- </TR>
- <TR>
- <TD>\b</TD>
- <TD>Matches a word boundary (the start or end of a word).</TD>
- </TR>
- <TR>
- <TD>\B</TD>
- <TD>Matches only when not at a word boundary.</TD>
- </TR>
- </TABLE>
- 
- <H5>Buffer boundaries</H5>
- 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 that ^ and
- $ may match embedded newlines within the text).
- 
- <TABLE id="Table5" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>\`</TD>
- <TD>Matches at the start of a buffer only.</TD>
- </TR>
- <TR>
- <TD>\'</TD>
- <TD>Matches at the end of a buffer only.</TD>
- </TR>
- <TR>
- <TD>\A</TD>
- <TD>Matches at the start of a buffer only (the same as \`).</TD>
- </TR>
- <TR>
- <TD>\z</TD>
- <TD>Matches at the end of a buffer only (the same as \').</TD>
- </TR>
- <TR>
- <TD>\Z</TD>
- <TD>Matches an optional sequence of newlines at the end of a buffer: equivalent to
- the regular expression \n*\z</TD>
- </TR>
- </TABLE>
- 
- <H5>Continuation Escape</H5>
- 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.
- <H5>Quoting escape</H5>
- 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:
- <PRE>\*+a \*+aaa</PRE>
- <H5>Unicode escapes</H5>
- 
- <TABLE id="Table6" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>\C</TD>
- <TD>Matches a single code point: in Boost regex this has exactly the same effect
- as a "." operator.</TD>
- </TR>
- <TR>
- <TD>\X</TD>
- <TD>Matches a combining character sequence: that is any non-combining character
- followed by a sequence of zero or more combining characters.</TD>
- </TR>
- </TABLE>
- 
- <H5>Any other escape</H5>
- Any other escape sequence matches the character that is escaped, for example \@
- matches a literal <A href="mailto:'@'">'@'</A>.
- </BLOCKQUOTE>
- <H4 dir="ltr">Perl Extended Patterns</H4>
- Perl-specific extensions to the regular expression syntax all start
- with (?.
- <BLOCKQUOTE dir="ltr" style="MARGIN-RIGHT: 0px">
- <H5 dir="ltr">Comments</H5>
- (?# ... ) is treated as a comment, it's contents are ignored.
- <H5 dir="ltr">Modifiers</H5>
- (?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 that perl
- modifier on, letters afterward, turn it off.
- (?imsx-imsx:pattern) applies the specified modifiers to pattern
- only.
- <H5 dir="ltr">Non-marking grouping</H5>
- (?:pattern) lexically groups pattern, without generating an
- additional sub-expression.
- <H5 dir="ltr">Lookahead</H5>
- (?=pattern) consumes zero characters, only if pattern matches.
- (?!pattern) consumes zero characters, only if pattern does
- not match.
- Lookahead is typically used to create the logical AND of two regular
- expressions, for example if a password must contain a lower case letter, an
- upper case letter, a punctuation symbol, and be at least 6 characters long,
- then the expression:
- <PRE dir="ltr">(?=.*[[:lower:]])(?=.*[[:upper:]])(?=.*[[:punct:]]).{6,}</PRE>
- could be used to validate the password.
- <H5 dir="ltr">Lookbehind</H5>
- (?<=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 could
- not be matched against the characters preceding the current position (pattern
- must be of fixed length).
- <H5 dir="ltr">Independent sub-expressions</H5>
- (?>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.
- <H5 dir="ltr">Conditional Expressions</H5>
- (?(condition)yes-pattern|no-pattern) attempts to match yes-pattern
- if the condition is true, otherwise attempts to match no-pattern.
- (?(condition)yes-pattern) attempts to match yes-pattern if
- the condition is true, otherwise fails.
- Condition may be either a forward lookahead assert, or the
- index of a marked sub-expression (the condition becomes true if the
- sub-expression has been matched).
- </BLOCKQUOTE><A name="what">
- <H4>Operator precedence</H4>
-  The order of precedence for of operators is as shown in the following
- table:
- 
- <TABLE id="Table2" cellSpacing="1" cellPadding="1" width="100%" border="1">
- <TR>
- <TD>Collation-related bracket symbols</TD>
- <TD>[==] [::] [..]</TD>
- </TR>
- <TR>
- <TD>Escaped characters
- </TD>
- <TD>\</TD>
- </TR>
- <TR>
- <TD>Character set (bracket expression)
- </TD>
- <TD>[]</TD>
- </TR>
- <TR>
- <TD>Grouping</TD>
- <TD>()</TD>
- </TR>
- <TR>
- <TD>Single-character-ERE duplication
- </TD>
- <TD>* + ? {m,n}</TD>
- </TR>
- <TR>
- <TD>Concatenation</TD>
- <TD></TD>
- </TR>
- <TR>
- <TD>Anchoring</TD>
- <TD>^$</TD>
- </TR>
- <TR>
- <TD>Alternation</TD>
- <TD>|</TD>
- </TR>
- </TABLE>
- 
- </A>
- <H3>What gets matched</H3>
- 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 performed
- on that graph, while matching the input text.
- Alternatively:
- the best match found is the leftmost match, with individual elements matched as
- follows;
- 
- <TABLE id="Table8" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <TD>Construct</TD>
- <TD>What gets matches</TD>
- </TR>
- <TR>
- <TD>AtomA AtomB</TD>
- <TD>Locates the best match for AtomA that has a following match for AtomB.</TD>
- </TR>
- <TR>
- <TD>Expression1 | Expression2</TD>
- <TD>If Expresion1 can be matched then returns that match, otherwise attempts to
- match Expression2.</TD>
- </TR>
- <TR>
- <TD>S{N}</TD>
- <TD>Matches S repeated exactly N times.</TD>
- </TR>
- <TR>
- <TD>S{N,M}</TD>
- <TD>Matches S repeated between N and M times, and as many times as possible.</TD>
- </TR>
- <TR>
- <TD>S{N,M}?</TD>
- <TD>Matches S repeated between N and M times, and as few times as possible.</TD>
- </TR>
- <TR>
- <TD> S?, S*, S+</TD>
- <TD> The same as <CODE>S{0,1}</CODE>, <CODE>S{0,UINT_MAX}</CODE>,
- <CODE>S{1,UINT_MAX}</CODE> respectively.
- </TD>
- </TR>
- <TR>
- <TD>S??, S*?, S+?</TD>
- <TD>The same as <CODE>S{0,1}?</CODE>, <CODE>S{0,UINT_MAX}?</CODE>, <CODE>S{1,UINT_MAX}?</CODE>
- respectively.
- </TD>
- </TR>
- <TR>
- <TD> (?>S)
- </TD>
- <TD>Matches the best match for S, and only that.</TD>
- </TR>
- <TR>
- <TD>
- (?=S), (?<=S)
- </TD>
- <TD>Matches only the best match for S (this is only visible if there are capturing
- parenthesis within S).</TD>
- </TR>
- <TR>
- <TD> (?!S), (?<!S)</TD>
- <TD>Considers only whether a match for S exists or not.</TD>
- </TR>
- <TR>
- <TD> (?(condition)yes-pattern | no-pattern)</TD>
- <TD>If condition is true, then only yes-pattern is considered,
- otherwise only no-pattern is considered.</TD>
- </TR>
- </TABLE>
- 
- <H3><A name="variations"></A>Variations</H3>
- The options <A href="syntax_option_type.html#perl">normal, ECMAScript, JavaScript
- and JScript</A> are all synonyms for Perl.
- <H3><A name="options"></A>Options</H3>
- 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 <A href="syntax_option_type.html#Perl">collate,
- nosubs and icase</A> options modify how the case and locale sensitivity
- are to be applied.
- <H3><A name="mods"></A>Modifiers</H3>
- 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 <A href="syntax_option_type.html#Perl">
- no_mod_m, mod_x, mod_s, and no_mod_s</A>.
- 
- <H3><A name="refs">References</H3>
- Perl 5.8.
- <HR>
- 
- Revised 
- 
- 21 Aug 2004 
- 
- © Copyright <a href="mailto:jm_at_[hidden]">John Maddock</a> 2004
- 
- Use, modification and distribution are subject to 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).
- 
- </body>
-</html>

Deleted: trunk/libs/regex/doc/thread_safety.html
==============================================================================
--- trunk/libs/regex/doc/thread_safety.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,70 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Thread Safety</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Thread Safety</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- The 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 is defined: this macro
- is set automatically by the config system when threading support is turned on
- in your compiler.
- 
- 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, regex_grep,
- regex_format and regex_merge
- 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, while another thread pops them off the
- other end), otherwise use a separate instance of match_results
- per thread.
- 
- The POSIX API functions are all re-entrant and
- thread safe, regular expressions compiled with regcomp can also be
- shared between threads.
- 
- 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 from one thread while another
- uses regular expressions will produce unpredictable results.
- 
- 
- There is also a requirement that there is only one thread executing prior to
- the start of main().
- <HR>
- Revised
- 
- 24 Oct 2003
- 
- © Copyright John Maddock 1998-
- 
- 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>

Deleted: trunk/libs/regex/doc/uarrow.gif
==============================================================================
Binary file. No diff available.

Deleted: trunk/libs/regex/doc/unicode.html
==============================================================================
--- trunk/libs/regex/doc/unicode.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,66 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
-<html>
- <head>
- <title>Boost.Regex: Index</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <link rel="stylesheet" type="text/css" href="../../../boost.css">
- </head>
- <body>
- 
- <TABLE id="Table1" cellSpacing="1" cellPadding="1" width="100%" border="0">
- <TR>
- <td valign="top" width="300">
- <h3></h3>
- </td>
- <TD width="353">
- <H1 align="center">Boost.Regex</H1>
- <H2 align="center">Unicode Regular Expressions.</H2>
- </TD>
- <td width="50">
- <h3></h3>
- </td>
- </TR>
- </TABLE>
- 
- <HR>
- 
- There are two ways to use Boost.Regex with Unicode strings:
- <H3>Rely on wchar_t</H3>
- 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 to
- process Unicode.  However, there are several disadvantages to this
- approach:
- <UL>
- <LI>
- 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.</LI>
- <LI>
- There's no support for Unicode-specific character classes: [[:Nd:]], [[:Po:]]
- etc.</LI>
- <LI>
- 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.</LI></UL>
- <H3>Use a Unicode Aware Regular Expression Type.</H3>
- If you have the <A href="http://www.ibm.com/software/globalization/icu/">ICU
- library</A>, then Boost.Regex can be <A href="install.html#unicode">configured
- to make use of it</A>, 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 string class support.
- 
- <HR>
- 
- 
- Revised 
- 
- 04 Jan 2005 
- 
- © Copyright John Maddock 2005
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Deleted: trunk/libs/regex/doc/vc71-performance.html
==============================================================================
--- trunk/libs/regex/doc/vc71-performance.html 2007-08-02 13:06:26 EDT (Thu, 02 Aug 2007)
+++ (empty file)
@@ -1,703 +0,0 @@
-<html>
- <head>
- <title>Regular Expression Performance Comparison</title>
- <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
- <meta name="vs_targetSchema" content="http://schemas.microsoft.com/intellisense/ie5">
- <meta name="Template" content="C:\PROGRAM FILES\MICROSOFT OFFICE\OFFICE\html.dot">
- <meta name="GENERATOR" content="Microsoft FrontPage Express 2.0">
- </head>
- <body bgcolor="#ffffff" link="#0000ff" vlink="#800080">
- <h2>Regular Expression Performance Comparison</h2>
- 
- The following tables provide comparisons between the following regular
- expression libraries:
- GRETA.
- The Boost regex library.
- Henry Spencer's regular expression library
- - this is provided for comparison as a typical non-backtracking implementation.
- Philip Hazel's PCRE library.
- <H3>Details</H3>
- Machine: Intel Pentium 4 2.8GHz PC.
- Compiler: Microsoft Visual C++ version 7.1.
- C++ Standard Library: Dinkumware standard library version 313.
- OS: Win32.
- Boost version: 1.31.0.
- PCRE version: 3.9.
- 
- As ever care should be taken in interpreting the results, only sensible regular
- expressions (rather than pathological cases) are given, most are taken from the
- Boost regex examples, or from the <a href="http://www.regxlib.com/">Library of
- Regular Expressions</a>. In addition, some variation in the relative
- performance of these libraries can be expected on other machines - as memory
- access and processor caching effects can be quite large for most finite state
- machine algorithms.
- <H3>Averages</H3>
- The following are the average relative scores for all the tests: the perfect
- regular expression library would score 1, in practice any small number
- (say less that 4 or 5) is pretty good.
- <table border="1" cellspacing="1">
- <tr>
- <td>GRETA</td>
- <td>GRETA 
- (non-recursive mode)</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td>2.31619</td>
- <td>6.14203</td>
- <td>2.30668</td>
- <td>1.94363</td>
- <td>124.752</td>
- <td>2.09365</td>
- </tr>
- </table>
- 
- <h3>Comparison 1: Long Search</h3>
- For each of the following regular expressions the time taken to find all
- occurrences of the expression within a long English language text was measured
- (mtent12.txt
- from Project Gutenberg, 19Mb). 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>GRETA</td>
- <td>GRETA 
- (non-recursive mode)</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>Twain</code></td>
- <td>1 
- (0.0407s)</td>
- <td>1 
- (0.0407s)</td>
- <td>4.18 
- (0.17s)</td>
- <td>4.18 
- (0.17s)</td>
- <td>135 
- (5.48s)</td>
- <td>1.37 
- (0.0557s)</td>
- </tr>
- <tr>
- <td><code>Huck[[:alpha:]]+</code></td>
- <td>1.02 
- (0.0381s)</td>
- <td>1 
- (0.0375s)</td>
- <td>4.53 
- (0.17s)</td>
- <td>4.54 
- (0.17s)</td>
- <td>166 
- (6.23s)</td>
- <td>1.34 
- (0.0501s)</td>
- </tr>
- <tr>
- <td><code>[[:alpha:]]+ing</code></td>
- <td>4.3 
- (4.18s)</td>
- <td>9.93 
- (9.65s)</td>
- <td>1.15 
- (1.12s)</td>
- <td>1 
- (0.972s)</td>
- <td>8.15 
- (7.92s)</td>
- <td>5.85 
- (5.69s)</td>
- </tr>
- <tr>
- <td><code>^[^ ]*?Twain</code></td>
- <td>6.25 
- (1.84s)</td>
- <td>20.9 
- (6.16s)</td>
- <td>1.56 
- (0.461s)</td>
- <td>1 
- (0.295s)</td>
- <td>NA</td>
- <td>2.58 
- (0.761s)</td>
- </tr>
- <tr>
- <td><code>Tom|Sawyer|Huckleberry|Finn</code></td>
- <td>6.53 
- (0.711s)</td>
- <td>11.5 
- (1.25s)</td>
- <td>2.3 
- (0.251s)</td>
- <td>1 
- (0.109s)</td>
- <td>196 
- (21.4s)</td>
- <td>1.77 
- (0.193s)</td>
- </tr>
- <tr>
- <td><code>(Tom|Sawyer|Huckleberry|Finn).{0,30}river|river.{0,30}(Tom|Sawyer|Huckleberry|Finn)</code></td>
- <td>3.88 
- (0.972s)</td>
- <td>6.48 
- (1.62s)</td>
- <td>1.66 
- (0.416s)</td>
- <td>1 
- (0.251s)</td>
- <td>NA</td>
- <td>2.48 
- (0.62s)</td>
- </tr>
- </table>
- 
- <h3>Comparison 2: Medium Sized Search</h3>
- For each of the following regular expressions the time taken to find all
- occurrences of the expression within a medium sized English language text was
- measured (the first 50K from mtent12.txt). 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>GRETA</td>
- <td>GRETA 
- (non-recursive mode)</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>Twain</code></td>
- <td>1 
- (9.05e-005s)</td>
- <td>1.03 
- (9.29e-005s)</td>
- <td>4.92 
- (0.000445s)</td>
- <td>4.92 
- (0.000445s)</td>
- <td>43.2 
- (0.00391s)</td>
- <td>3.18 
- (0.000288s)</td>
- </tr>
- <tr>
- <td><code>Huck[[:alpha:]]+</code></td>
- <td>1 
- (8.56e-005s)</td>
- <td>1 
- (8.56e-005s)</td>
- <td>4.97 
- (0.000425s)</td>
- <td>4.98 
- (0.000426s)</td>
- <td>2.8 
- (0.000239s)</td>
- <td>2.2 
- (0.000188s)</td>
- </tr>
- <tr>
- <td><code>[[:alpha:]]+ing</code></td>
- <td>5.29 
- (0.011s)</td>
- <td>11.8 
- (0.0244s)</td>
- <td>1.19 
- (0.00246s)</td>
- <td>1 
- (0.00207s)</td>
- <td>8.77 
- (0.0182s)</td>
- <td>6.88 
- (0.0142s)</td>
- </tr>
- <tr>
- <td><code>^[^ ]*?Twain</code></td>
- <td>5.98 
- (0.00462s)</td>
- <td>20.2 
- (0.0156s)</td>
- <td>1.54 
- (0.00119s)</td>
- <td>1 
- (0.000772s)</td>
- <td>NA</td>
- <td>2.53 
- (0.00195s)</td>
- </tr>
- <tr>
- <td><code>Tom|Sawyer|Huckleberry|Finn</code></td>
- <td>3.42 
- (0.00207s)</td>
- <td>6.31 
- (0.00383s)</td>
- <td>1.71 
- (0.00104s)</td>
- <td>1 
- (0.000606s)</td>
- <td>81.5 
- (0.0494s)</td>
- <td>1.96 
- (0.00119s)</td>
- </tr>
- <tr>
- <td><code>(Tom|Sawyer|Huckleberry|Finn).{0,30}river|river.{0,30}(Tom|Sawyer|Huckleberry|Finn)</code></td>
- <td>1.97 
- (0.00266s)</td>
- <td>3.77 
- (0.00509s)</td>
- <td>1.38 
- (0.00186s)</td>
- <td>1 
- (0.00135s)</td>
- <td>297 
- (0.401s)</td>
- <td>1.77 
- (0.00238s)</td>
- </tr>
- </table>
- 
- <H3>Comparison 3: C++ Code Search</H3>
- For each of the following regular expressions the time taken to find all
- occurrences of the expression within the C++ source file <A href="../../../boost/crc.hpp">
- boost/crc.hpp</A> was measured. 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>GRETA</td>
- <td>GRETA 
- (non-recursive mode)</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>^(template[[:space:]]*<[^;:{]+>[[:space:]]*)?(class|struct)[[:space:]]*(\<\w+\>([
- ]*$[^)]*$)?[[:space:]]*)*(\<\w*\>)[[:space:]]*(<[^;:{]+>[[:space:]]*)?(\{|:[^;\{()]*\{)</code></td>
- <td>6.67 
- (0.00147s)</td>
- <td>36.9 
- (0.00813s)</td>
- <td>1.03 
- (0.000227s)</td>
- <td>1 
- (0.00022s)</td>
- <td>557 
- (0.123s)</td>
- <td>2.57 
- (0.000566s)</td>
- </tr>
- <tr>
- <td><code>(^[
- ]*#(?:[^\\\n]|\\[^\n_[:punct:][:alnum:]]*[\n[:punct:][:word:]])*)|(//[^\n]*|/\*.*?\*/)|\<([+-]?(?:(?:0x[[:xdigit:]]+)|(?:(?:[[:digit:]]*\.)?[[:digit:]]+(?:[eE][+-]?[[:digit:]]+)?))u?(?:(?:int(?:8|16|32|64))|L)?)\>|('(?:[^\\']|\\.)*'|"(?:[^\\"]|\\.)*")|\<(__asm|__cdecl|__declspec|__export|__far16|__fastcall|__fortran|__import|__pascal|__rtti|__stdcall|_asm|_cdecl|__except|_export|_far16|_fastcall|__finally|_fortran|_import|_pascal|_stdcall|__thread|__try|asm|auto|bool|break|case|catch|cdecl|char|class|const|const_cast|continue|default|delete|do|double|dynamic_cast|else|enum|explicit|extern|false|float|for|friend|goto|if|inline|int|long|mutable|namespace|new|operator|pascal|private|protected|public|register|reinterpret_cast|return|short|signed|sizeof|static|static_cast|struct|switch|template|this|throw|true|try|typedef|typeid|typename|union|unsigned|using|virtual|void|volatile|wchar_t|while)\></code></td>
- <td>1 
- (0.00555s)</td>
- <td>3.32 
- (0.0185s)</td>
- <td>2.53 
- (0.0141s)</td>
- <td>1.94 
- (0.0108s)</td>
- <td>NA</td>
- <td>3.38 
- (0.0188s)</td>
- </tr>
- <tr>
- <td><code>^[ ]*#[ ]*include[ ]+("[^"]+"|<[^>]+>)</code></td>
- <td>4.77 
- (0.00156s)</td>
- <td>24.8 
- (0.00814s)</td>
- <td>1.13 
- (0.000372s)</td>
- <td>1 
- (0.000328s)</td>
- <td>120 
- (0.0394s)</td>
- <td>1.58 
- (0.000518s)</td>
- </tr>
- <tr>
- <td><code>^[ ]*#[ ]*include[ ]+("boost/[^"]+"|<boost/[^>]+>)</code></td>
- <td>4.72 
- (0.00154s)</td>
- <td>24.8 
- (0.00813s)</td>
- <td>1.12 
- (0.000367s)</td>
- <td>1 
- (0.000328s)</td>
- <td>143 
- (0.0469s)</td>
- <td>1.58 
- (0.000518s)</td>
- </tr>
- </table>
- 
- <H3>
- <H3>Comparison 4: HTML Document Search</H3>
- </H3>
- For each of the following regular expressions the time taken to find all
- occurrences of the expression within the html file libs/libraries.htm
- was measured. 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>GRETA</td>
- <td>GRETA 
- (non-recursive mode)</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>beman|john|dave</code></td>
- <td>4.07 
- (0.00111s)</td>
- <td>7.14 
- (0.00195s)</td>
- <td>1.75 
- (0.000479s)</td>
- <td>1 
- (0.000273s)</td>
- <td>54.3 
- (0.0149s)</td>
- <td>1.83 
- (0.000499s)</td>
- </tr>
- <tr>
- <td><code>.*?</code></td>
- <td>1 
- (6.59e-005s)</td>
- <td>1.04 
- (6.84e-005s)</td>
- <td>4.15 
- (0.000273s)</td>
- <td>4.23 
- (0.000279s)</td>
- <td>NA</td>
- <td>4.23 
- (0.000279s)</td>
- </tr>
- <tr>
- <td><code><a[^>]+href=("[^"]*"|[^[:space:]]+)[^>]*></code></td>
- <td>1.39 
- (0.000626s)</td>
- <td>1.83 
- (0.000821s)</td>
- <td>1.41 
- (0.000636s)</td>
- <td>1 
- (0.00045s)</td>
- <td>351 
- (0.158s)</td>
- <td>1.13 
- (0.000509s)</td>
- </tr>
- <tr>
- <td><code><h[12345678][^>]*>.*?</h[12345678]></code></td>
- <td>1 
- (0.000142s)</td>
- <td>1.21 
- (0.000171s)</td>
- <td>2.62 
- (0.000372s)</td>
- <td>1.48 
- (0.00021s)</td>
- <td>NA</td>
- <td>1.73 
- (0.000245s)</td>
- </tr>
- <tr>
- <td><code><img[^>]+src=("[^"]*"|[^[:space:]]+)[^>]*></code></td>
- <td>1 
- (5.38e-005s)</td>
- <td>1.05 
- (5.63e-005s)</td>
- <td>5 
- (0.000269s)</td>
- <td>5.18 
- (0.000278s)</td>
- <td>604 
- (0.0325s)</td>
- <td>4.05 
- (0.000218s)</td>
- </tr>
- <tr>
- <td><code><font[^>]+face=("[^"]*"|[^[:space:]]+)[^>]*>.*?</code></td>
- <td>1 
- (6.05e-005s)</td>
- <td>1.09 
- (6.59e-005s)</td>
- <td>4.45 
- (0.000269s)</td>
- <td>4.69 
- (0.000284s)</td>
- <td>NA</td>
- <td>3.64 
- (0.00022s)</td>
- </tr>
- </table>
- 
- <H3>Comparison 3: Simple Matches</H3>
- 
- For each of the following regular expressions the time taken to match against
- the text indicated was measured. 
- <table border="1" cellspacing="1">
- <tr>
- <td>Expression</td>
- <td>Text</td>
- <td>GRETA</td>
- <td>GRETA 
- (non-recursive mode)</td>
- <td>Boost</td>
- <td>Boost + C++ locale</td>
- <td>POSIX</td>
- <td>PCRE</td>
- </tr>
- <tr>
- <td><code>abc</code></td>
- <td>abc</td>
- <td>1.32 
- (2.24e-007s)</td>
- <td>1.86 
- (3.15e-007s)</td>
- <td>1.25 
- (2.12e-007s)</td>
- <td>1.24 
- (2.1e-007s)</td>
- <td>2.98 
- (5.05e-007s)</td>
- <td>1 
- (1.7e-007s)</td>
- </tr>
- <tr>
- <td><code>^([0-9]+)(\-| |$)(.*)$</code></td>
- <td>100- this is a line of ftp response which contains a message string</td>
- <td>1.32 
- (5.91e-007s)</td>
- <td>1.96 
- (8.78e-007s)</td>
- <td>2.68 
- (1.2e-006s)</td>
- <td>1.53 
- (6.88e-007s)</td>
- <td>332 
- (0.000149s)</td>
- <td>1 
- (4.49e-007s)</td>
- </tr>
- <tr>
- <td><code>([[:digit:]]{4}[- ]){3}[[:digit:]]{3,4}</code></td>
- <td>1234-5678-1234-456</td>
- <td>1.44 
- (7.16e-007s)</td>
- <td>2.04 
- (1.01e-006s)</td>
- <td>3.35 
- (1.66e-006s)</td>
- <td>2.15 
- (1.07e-006s)</td>
- <td>31.4 
- (1.56e-005s)</td>
- <td>1 
- (4.96e-007s)</td>
- </tr>
- <tr>
- <td><code>^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$</code></td>
- <td>john_at_[hidden]</td>
- <td>1 
- (1.18e-006s)</td>
- <td>1.42 
- (1.68e-006s)</td>
- <td>2.06 
- (2.44e-006s)</td>
- <td>1.35 
- (1.6e-006s)</td>
- <td>165 
- (0.000196s)</td>
- <td>1.06 
- (1.26e-006s)</td>
- </tr>
- <tr>
- <td><code>^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$</code></td>
- <td>foo12_at_[hidden]</td>
- <td>1 
- (1.09e-006s)</td>
- <td>1.44 
- (1.57e-006s)</td>
- <td>2.21 
- (2.4e-006s)</td>
- <td>1.41 
- (1.53e-006s)</td>
- <td>108 
- (0.000117s)</td>
- <td>1.04 
- (1.13e-006s)</td>
- </tr>
- <tr>
- <td><code>^([a-zA-Z0-9_\-\.]+)@((\[[0-9]{1,3}\.[0-9]{1,3}\.[0-9]{1,3}\.)|(([a-zA-Z0-9\-]+\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\]?)$</code></td>
- <td>bob.smith_at_[hidden]</td>
- <td>1 
- (1.07e-006s)</td>
- <td>1.43 
- (1.53e-006s)</td>
- <td>2.21 
- (2.37e-006s)</td>
- <td>1.45 
- (1.55e-006s)</td>
- <td>123 
- (0.000132s)</td>
- <td>1.05 
- (1.13e-006s)</td>
- </tr>
- <tr>
- <td><code>^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code></td>
- <td>EH10 2QQ</td>
- <td>1 
- (3.19e-007s)</td>
- <td>1.67 
- (5.34e-007s)</td>
- <td>1.58 
- (5.05e-007s)</td>
- <td>1.4 
- (4.49e-007s)</td>
- <td>10.4 
- (3.32e-006s)</td>
- <td>1.15 
- (3.68e-007s)</td>
- </tr>
- <tr>
- <td><code>^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code></td>
- <td>G1 1AA</td>
- <td>1 
- (3.29e-007s)</td>
- <td>1.65 
- (5.44e-007s)</td>
- <td>1.51 
- (4.96e-007s)</td>
- <td>1.36 
- (4.49e-007s)</td>
- <td>8.46 
- (2.79e-006s)</td>
- <td>1.1 
- (3.63e-007s)</td>
- </tr>
- <tr>
- <td><code>^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$</code></td>
- <td>SW1 1ZZ</td>
- <td>1 
- (3.25e-007s)</td>
- <td>1.64 
- (5.34e-007s)</td>
- <td>1.56 
- (5.05e-007s)</td>
- <td>1.38 
- (4.49e-007s)</td>
- <td>9.29 
- (3.02e-006s)</td>
- <td>1.13 
- (3.68e-007s)</td>
- </tr>
- <tr>
- <td><code>^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code></td>
- <td>4/1/2001</td>
- <td>1 
- (3.44e-007s)</td>
- <td>1.55 
- (5.34e-007s)</td>
- <td>2.36 
- (8.12e-007s)</td>
- <td>2.2 
- (7.55e-007s)</td>
- <td>19.6 
- (6.72e-006s)</td>
- <td>1.81 
- (6.21e-007s)</td>
- </tr>
- <tr>
- <td><code>^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$</code></td>
- <td>12/12/2001</td>
- <td>1.05 
- (6.59e-007s)</td>
- <td>1.66 
- (1.05e-006s)</td>
- <td>1.44 
- (9.07e-007s)</td>
- <td>1.23 
- (7.73e-007s)</td>
- <td>11.6 
- (7.34e-006s)</td>
- <td>1 
- (6.3e-007s)</td>
- </tr>
- <tr>
- <td><code>^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code></td>
- <td>123</td>
- <td>1 
- (5.72e-007s)</td>
- <td>1.59 
- (9.07e-007s)</td>
- <td>1.6 
- (9.16e-007s)</td>
- <td>1.49 
- (8.5e-007s)</td>
- <td>6.14 
- (3.51e-006s)</td>
- <td>1.22 
- (6.97e-007s)</td>
- </tr>
- <tr>
- <td><code>^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code></td>
- <td>+3.14159</td>
- <td>1 
- (6.78e-007s)</td>
- <td>1.52 
- (1.03e-006s)</td>
- <td>1.47 
- (9.94e-007s)</td>
- <td>1.31 
- (8.88e-007s)</td>
- <td>10.8 
- (7.34e-006s)</td>
- <td>1.08 
- (7.35e-007s)</td>
- </tr>
- <tr>
- <td><code>^[-+]?[[:digit:]]*\.?[[:digit:]]*$</code></td>
- <td>-3.14159</td>
- <td>1 
- (6.78e-007s)</td>
- <td>1.52 
- (1.03e-006s)</td>
- <td>1.46 
- (9.92e-007s)</td>
- <td>1.32 
- (8.98e-007s)</td>
- <td>10.5 
- (7.11e-006s)</td>
- <td>1.11 
- (7.54e-007s)</td>
- </tr>
- </table>
- 
- <hr>
- © Copyright John Maddock 2003
- Use, modification and distribution are subject to 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)
- </body>
-</html>
-

Next message: jmcintyre_at_[hidden]: "[Boost-commit] svn:boost r38404 - sandbox/pinhole/boost/pinhole"
Previous message: asutton_at_[hidden]: "[Boost-commit] svn:boost r38402 - sandbox/SOC/2007/graphs/boost/graph"

Date view	Thread view	Subject view	Author view

Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk