Imported Upstream version 1.59.0

Change-Id: I2dde00f4eca71df3eea9d251dcaecde18a6c90a5 Signed-off-by: DongHun Kwak <dh0128.kwak@samsung.com>
author: DongHun Kwak <dh0128.kwak@samsung.com> 2016-10-06 10:30:07 +0900
committer: DongHun Kwak <dh0128.kwak@samsung.com> 2016-10-06 10:32:57 +0900
commit: 71d216b90256936a9638f325af9bc69d720e75de (patch)
tree: 9c5f682d341c7c88ad0c8e3d4b262e00b6fb691a /doc/html/string_algo/usage.html
parent: 733b5d5ae2c5d625211e2985ac25728ac3f54883 (diff)
download: boost-71d216b90256936a9638f325af9bc69d720e75de.tar.gz
boost-71d216b90256936a9638f325af9bc69d720e75de.tar.bz2
boost-71d216b90256936a9638f325af9bc69d720e75de.zip
1 files changed, 19 insertions, 18 deletions
diff --git a/doc/html/string_algo/usage.html b/doc/html/string_algo/usage.html
index 400c89ffff..42a8e06c1e 100644
--- a/doc/html/string_algo/usage.html
+++ b/doc/html/string_algo/usage.html
@@ -1,3 +1,4 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
 <html>
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
@@ -26,18 +27,18 @@
 <div class="titlepage"><div><div><h2 class="title" style="clear: both">
 <a name="string_algo.usage"></a>Usage</h2></div></div></div>
 <div class="toc"><dl class="toc">
-<dt><span class="section"><a href="usage.html#idp424671488">First Example</a></span></dt>
-<dt><span class="section"><a href="usage.html#idp424694160">Case conversion</a></span></dt>
-<dt><span class="section"><a href="usage.html#idp424701520">Predicates and Classification</a></span></dt>
-<dt><span class="section"><a href="usage.html#idp424711840">Trimming</a></span></dt>
-<dt><span class="section"><a href="usage.html#idp424718864">Find algorithms</a></span></dt>
-<dt><span class="section"><a href="usage.html#idp424731952">Replace Algorithms</a></span></dt>
-<dt><span class="section"><a href="usage.html#idp424745488">Find Iterator</a></span></dt>
-<dt><span class="section"><a href="usage.html#idp424756880">Split</a></span></dt>
+<dt><span class="section"><a href="usage.html#idp430990320">First Example</a></span></dt>
+<dt><span class="section"><a href="usage.html#idp431012928">Case conversion</a></span></dt>
+<dt><span class="section"><a href="usage.html#idp431020288">Predicates and Classification</a></span></dt>
+<dt><span class="section"><a href="usage.html#idp431030608">Trimming</a></span></dt>
+<dt><span class="section"><a href="usage.html#idp431037696">Find algorithms</a></span></dt>
+<dt><span class="section"><a href="usage.html#idp431050912">Replace Algorithms</a></span></dt>
+<dt><span class="section"><a href="usage.html#idp431064448">Find Iterator</a></span></dt>
+<dt><span class="section"><a href="usage.html#idp431075840">Split</a></span></dt>
 </dl></div>
 <div class="section">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="idp424671488"></a>First Example</h3></div></div></div>
+<a name="idp430990320"></a>First Example</h3></div></div></div>
 <p>
             Using the algorithms is straightforward. Let us have a look at the first example:
         </p>
@@ -109,7 +110,7 @@
 </div>
 <div class="section">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="idp424694160"></a>Case conversion</h3></div></div></div>
+<a name="idp431012928"></a>Case conversion</h3></div></div></div>
 <p>
             STL has a nice way of converting character case. Unfortunately, it works only
             for a single character and we want to convert a string, 
@@ -128,7 +129,7 @@
 </div>
 <div class="section">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="idp424701520"></a>Predicates and Classification</h3></div></div></div>
+<a name="idp431020288"></a>Predicates and Classification</h3></div></div></div>
 <p>
             A part of the library deals with string related predicates. Consider this example:
         </p>
@@ -180,7 +181,7 @@
 </div>
 <div class="section">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="idp424711840"></a>Trimming</h3></div></div></div>
+<a name="idp431030608"></a>Trimming</h3></div></div></div>
 <p>
             When parsing the input from a user, strings often have unwanted leading or trailing 
             characters. To get rid of them, we need trim functions:
@@ -206,7 +207,7 @@
 </div>
 <div class="section">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="idp424718864"></a>Find algorithms</h3></div></div></div>
+<a name="idp431037696"></a>Find algorithms</h3></div></div></div>
 <p>
             The library contains a set of find algorithms. Here is an example:
         </p>
@@ -246,7 +247,7 @@
 </div>
 <div class="section">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="idp424731952"></a>Replace Algorithms</h3></div></div></div>
+<a name="idp431050912"></a>Replace Algorithms</h3></div></div></div>
 <p>
             Find algorithms can be used for searching for a specific part of string. Replace goes one step
             further. After a matching part is found, it is substituted with something else. The substitution is computed
@@ -278,7 +279,7 @@
 </div>
 <div class="section">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="idp424745488"></a>Find Iterator</h3></div></div></div>
+<a name="idp431064448"></a>Find Iterator</h3></div></div></div>
 <p>
             An extension to find algorithms it the Find Iterator. Instead of searching for just a one part of a string, 
             the find iterator allows us to iterate over the substrings matching the specified criteria.
@@ -336,7 +337,7 @@
 </div>
 <div class="section">
 <div class="titlepage"><div><div><h3 class="title">
-<a name="idp424756880"></a>Split</h3></div></div></div>
+<a name="idp431075840"></a>Split</h3></div></div></div>
 <p>
             Split algorithms are an extension to the find iterator for one common usage scenario.
             These algorithms use a find iterator and store all matches into the provided
@@ -345,7 +346,7 @@
         </p>
 <p>
             Two algorithms are provided. <code class="computeroutput"><a class="link" href="../boost/algorithm/find_all.html" title="Function template find_all">find_all()</a></code> finds all copies
-            of a string in the input. <code class="computeroutput"><a class="link" href="../boost/algorithm/split_idp192413584.html" title="Function template split">split()</a></code> splits the input into parts.
+            of a string in the input. <code class="computeroutput"><a class="link" href="../boost/algorithm/split_idp159921872.html" title="Function template split">split()</a></code> splits the input into parts.
         </p>
 <pre class="programlisting">
     string str1("hello abc-*-ABC-*-aBc goodbye");
@@ -369,7 +370,7 @@
             to all substrings that are in case-insensitive manner equal to "abc".
         </p>
 <p>
-            Second example uses <code class="computeroutput"><a class="link" href="../boost/algorithm/split_idp192413584.html" title="Function template split">split()</a></code> to split string str1 into parts
+            Second example uses <code class="computeroutput"><a class="link" href="../boost/algorithm/split_idp159921872.html" title="Function template split">split()</a></code> to split string str1 into parts
             separated by characters '-' or '*'. These parts are then put into the SplitVec.
             It is possible to specify if adjacent separators are concatenated or not.
         </p>
author	DongHun Kwak <dh0128.kwak@samsung.com>	2016-10-06 10:30:07 +0900
committer	DongHun Kwak <dh0128.kwak@samsung.com>	2016-10-06 10:32:57 +0900
commit	71d216b90256936a9638f325af9bc69d720e75de (patch)
tree	9c5f682d341c7c88ad0c8e3d4b262e00b6fb691a /doc/html/string_algo/usage.html
parent	733b5d5ae2c5d625211e2985ac25728ac3f54883 (diff)
download	boost-71d216b90256936a9638f325af9bc69d720e75de.tar.gz boost-71d216b90256936a9638f325af9bc69d720e75de.tar.bz2 boost-71d216b90256936a9638f325af9bc69d720e75de.zip