Update of /cvsroot/boost/boost/libs/regex/doc
In directory sc8-pr-cvs3.sourceforge.net:/tmp/cvs-serv6666/libs/regex/doc
Modified Files:
regex_iterator.qbk regex_match.qbk regex_replace.qbk
regex_search.qbk regex_split.qbk regex_token_iterator.qbk
Log Message:
Changed "it's" to the grammatically correct "its".
Index: regex_iterator.qbk
===================================================================
RCS file: /cvsroot/boost/boost/libs/regex/doc/regex_iterator.qbk,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -d -r1.1 -r1.2
--- regex_iterator.qbk 8 Jun 2007 09:13:34 -0000 1.1
+++ regex_iterator.qbk 30 Jun 2007 11:07:06 -0000 1.2
@@ -75,7 +75,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+configured in recursive mode), or if the matcher exhausts its permitted
memory allocation (if Boost.Regex is configured in non-recursive mode).
[#boost_regex.regex_iterator.construct3]
@@ -169,7 +169,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+configured in recursive mode), or if the matcher exhausts its permitted
memory allocation (if Boost.Regex is configured in non-recursive mode).
[*Returns]: *this.
Index: regex_match.qbk
===================================================================
RCS file: /cvsroot/boost/boost/libs/regex/doc/regex_match.qbk,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -d -r1.1 -r1.2
--- regex_match.qbk 8 Jun 2007 09:13:34 -0000 1.1
+++ regex_match.qbk 30 Jun 2007 11:07:06 -0000 1.2
@@ -66,7 +66,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+configured in recursive mode), or if the matcher exhausts its permitted
memory allocation (if Boost.Regex is configured in non-recursive mode).
[*Postconditions]: If the function returns false, then the effect on
Index: regex_replace.qbk
===================================================================
RCS file: /cvsroot/boost/boost/libs/regex/doc/regex_replace.qbk,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -d -r1.1 -r1.2
--- regex_replace.qbk 8 Jun 2007 09:13:34 -0000 1.1
+++ regex_replace.qbk 30 Jun 2007 11:07:06 -0000 1.2
@@ -95,7 +95,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+configured in recursive mode), or if the matcher exhausts its permitted
memory allocation (if Boost.Regex is configured in non-recursive mode).
[*Returns]: out.
Index: regex_search.qbk
===================================================================
RCS file: /cvsroot/boost/boost/libs/regex/doc/regex_search.qbk,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -d -r1.1 -r1.2
--- regex_search.qbk 8 Jun 2007 09:13:34 -0000 1.1
+++ regex_search.qbk 30 Jun 2007 11:07:06 -0000 1.2
@@ -64,7 +64,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+configured in recursive mode), or if the matcher exhausts its permitted
memory allocation (if Boost.Regex is configured in non-recursive mode).
[*Postconditions]: If the function returns false, then the effect on
Index: regex_split.qbk
===================================================================
RCS file: /cvsroot/boost/boost/libs/regex/doc/regex_split.qbk,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -d -r1.1 -r1.2
--- regex_split.qbk 8 Jun 2007 09:13:34 -0000 1.1
+++ regex_split.qbk 30 Jun 2007 11:07:06 -0000 1.2
@@ -48,7 +48,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+configured in recursive mode), or if the matcher exhausts its permitted
memory allocation (if Boost.Regex is configured in non-recursive mode).
[*Example]: the following function will split the input string into a
Index: regex_token_iterator.qbk
===================================================================
RCS file: /cvsroot/boost/boost/libs/regex/doc/regex_token_iterator.qbk,v
retrieving revision 1.1
retrieving revision 1.2
diff -u -d -r1.1 -r1.2
--- regex_token_iterator.qbk 8 Jun 2007 09:13:34 -0000 1.1
+++ regex_token_iterator.qbk 30 Jun 2007 11:07:06 -0000 1.2
@@ -137,7 +137,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against
an N character string begins to exceed O(N[super 2]), 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
+in recursive mode), or if the matcher exhausts its permitted memory
allocation (if Boost.Regex is configured in non-recursive mode).
[#boost_regex.regex_token_iterator.construct3]
@@ -164,7 +164,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+configured in recursive mode), or if the matcher exhausts its permitted memory
allocation (if Boost.Regex is configured in non-recursive mode).
[#boost_regex.regex_token_iterator.construct4]
@@ -191,7 +191,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+is configured in recursive mode), or if the matcher exhausts its
permitted memory allocation (if Boost.Regex is configured in non-recursive
mode).
[#boost_regex.regex_token_iterator.construct5]
@@ -243,7 +243,7 @@
[*Throws]: `std::runtime_error` if the complexity of matching the expression
against an N character string begins to exceed O(N[super 2]), 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
+configured in recursive mode), or if the matcher exhausts its permitted
memory allocation (if Boost.Regex is configured in non-recursive mode).
[*Returns]: `*this`.
-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/
_______________________________________________
Boost-cvs mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/boost-cvs
