Changed "it's" to the grammatically correct "its".

[SVN r38115]

doc/regex_iterator.qbk

@@ -75,7 +75,7 @@ The object /re/ must exist for the lifetime of the [regex_iterator].
 [*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 @@ next (possibly zero length) match from one position to the right of the last mat
 [*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.

doc/regex_match.qbk

@@ -66,7 +66,7 @@ Returns true if such a match exists, false otherwise.
 [*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 

doc/regex_replace.qbk

@@ -95,7 +95,7 @@ is replaced.
 [*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.

doc/regex_search.qbk

@@ -64,7 +64,7 @@ true if such a sequence exists, false otherwise.
 [*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 

doc/regex_split.qbk

@@ -48,7 +48,7 @@ on whitespace.
 [*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 

doc/regex_token_iterator.qbk

@@ -137,7 +137,7 @@ splitting).
 [*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 @@ be found: from the end of the last match found, to the end of the underlying seq
 [*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 @@ the end of the underlying sequence.
 [*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 @@ permitted memory allocation (if Boost.Regex is configured in non-recursive mode)
 [*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`.