From b912fb5b64299139da62a1d71c44cc7a199dbb08 Mon Sep 17 00:00:00 2001 From: John Maddock Date: Wed, 11 May 2005 14:31:10 +0000 Subject: [PATCH] Improve partial match docs. Fix license on new file. [SVN r28823] --- doc/Attic/match_flag_type.html | 8 +++++--- doc/Attic/partial_matches.html | 19 ++++++++++++++++--- doc/match_flag_type.html | 8 +++++--- doc/partial_matches.html | 19 ++++++++++++++++--- performance/time_dynamic_xpressive.cpp | 18 +++++++++--------- 5 files changed, 51 insertions(+), 21 deletions(-) diff --git a/doc/Attic/match_flag_type.html b/doc/Attic/match_flag_type.html index 29d226cb..d78d7ea6 100644 --- a/doc/Attic/match_flag_type.html +++ b/doc/Attic/match_flag_type.html @@ -166,9 +166,11 @@ static const match_flag_type format_all;

Specifies that if no match can be found, then it is acceptable to return a - match [from, last) where from!=last, if there exists some sequence of - characters [from,to) of which [from,last) is a prefix, and which would result - in a full match.

+ 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 + partial matches documentation for more information.

diff --git a/doc/Attic/partial_matches.html b/doc/Attic/partial_matches.html index a51509f9..f523fc9a 100644 --- a/doc/Attic/partial_matches.html +++ b/doc/Attic/partial_matches.html @@ -26,7 +26,8 @@

The match-flag match_partial can be passed to the following algorithms: regex_match, - regex_search, and regex_grep. + 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 @@ -71,6 +72,19 @@

+

Be aware that using partial matches can sometimes result in somewhat imperfect + behavior:

+

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 @@ -173,8 +187,7 @@ void search(std::istream& is) 24 Oct 2003

© Copyright John Maddock 1998- - - 2003

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

diff --git a/doc/match_flag_type.html b/doc/match_flag_type.html index 29d226cb..d78d7ea6 100644 --- a/doc/match_flag_type.html +++ b/doc/match_flag_type.html @@ -166,9 +166,11 @@ static const match_flag_type format_all;

Specifies that if no match can be found, then it is acceptable to return a - match [from, last) where from!=last, if there exists some sequence of - characters [from,to) of which [from,last) is a prefix, and which would result - in a full match.

+ 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 + partial matches documentation for more information.

diff --git a/doc/partial_matches.html b/doc/partial_matches.html index a51509f9..f523fc9a 100644 --- a/doc/partial_matches.html +++ b/doc/partial_matches.html @@ -26,7 +26,8 @@

The match-flag match_partial can be passed to the following algorithms: regex_match, - regex_search, and regex_grep. + 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 @@ -71,6 +72,19 @@

+

Be aware that using partial matches can sometimes result in somewhat imperfect + behavior:

+

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 @@ -173,8 +187,7 @@ void search(std::istream& is) 24 Oct 2003

© Copyright John Maddock 1998- - - 2003

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

diff --git a/performance/time_dynamic_xpressive.cpp b/performance/time_dynamic_xpressive.cpp index fbe8a749..0e624037 100644 --- a/performance/time_dynamic_xpressive.cpp +++ b/performance/time_dynamic_xpressive.cpp @@ -1,13 +1,13 @@ /* -* -* Copyright (c) 2002 -* John Maddock -* -* All rights reserved. -* May not be transfered or disclosed to a third party without -* prior consent of the author. -* -*/ + * + * Copyright (c) 2004 + * John Maddock + * + * 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) + * + */ #include "regex_comparison.hpp"