forked from boostorg/algorithm
Compare commits
47 Commits
boost-1.43
...
sandbox-br
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
39a15ed95d | ||
|
|
6c0f953c01 | ||
|
|
e439792494 | ||
|
|
236b142308 | ||
|
|
9bad789175 | ||
|
|
d84f81d841 | ||
|
|
ce98e8b87e | ||
|
|
e8a2596637 | ||
|
|
7b2754b937 | ||
|
|
784402e5c0 | ||
|
|
1188575e7b | ||
|
|
bff2a1e112 | ||
|
|
6d5e7b5a04 | ||
|
|
760af1798b | ||
|
|
1f5542b44c | ||
|
|
baf3dd99e2 | ||
|
|
7299b29bf8 | ||
|
|
539c170b9d | ||
|
|
c81ee948b7 | ||
|
|
ba5e4c30c6 | ||
|
|
cd26ed816c | ||
|
|
4e15767bed | ||
|
|
9fa2f90db4 | ||
|
|
35f317aeac | ||
|
|
d0a03fdb4e | ||
|
|
346f032be2 | ||
|
|
a389d768c4 | ||
|
|
90fca39906 | ||
|
|
5b24f31486 | ||
|
|
b25d6511b3 | ||
|
|
1541a554f5 | ||
|
|
7a97b3390e | ||
|
|
6e5a7497ae | ||
|
|
f0b8b60379 | ||
|
|
66019abb2f | ||
|
|
8758222006 | ||
|
|
4eef56761a | ||
|
|
b94a3fbfba | ||
|
|
614cc2ebab | ||
|
|
869660ed14 | ||
|
|
777f30780e | ||
|
|
26aa37733b | ||
|
|
f1e60579c2 | ||
|
|
389dd3c863 | ||
|
|
f23f61ae9b | ||
|
|
608112b112 | ||
|
|
b21b54dc4e |
26
CMakeLists.txt
Normal file
26
CMakeLists.txt
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#
|
||||||
|
# Copyright Troy D. Straszheim
|
||||||
|
#
|
||||||
|
# Distributed under the Boost Software License, Version 1.0.
|
||||||
|
# See http://www.boost.org/LICENSE_1_0.txt
|
||||||
|
#
|
||||||
|
#----------------------------------------------------------------------------
|
||||||
|
# This file was automatically generated from the original CMakeLists.txt file
|
||||||
|
# Add a variable to hold the headers for the library
|
||||||
|
set (lib_headers
|
||||||
|
algorithm
|
||||||
|
)
|
||||||
|
|
||||||
|
# Add a library target to the build system
|
||||||
|
boost_library_project(
|
||||||
|
algorithm
|
||||||
|
# SRCDIRS
|
||||||
|
TESTDIRS minmax/test string/test
|
||||||
|
HEADERS ${lib_headers}
|
||||||
|
# DOCDIRS
|
||||||
|
DESCRIPTION "A library of various algorithms."
|
||||||
|
MODULARIZED
|
||||||
|
AUTHORS "Pavol Droba <droba -at- topmail.sk>"
|
||||||
|
"Herve Bronnimann <hbr -at- poly.edu>"
|
||||||
|
# MAINTAINERS
|
||||||
|
)
|
||||||
10
minmax/test/CMakeLists.txt
Normal file
10
minmax/test/CMakeLists.txt
Normal file
@@ -0,0 +1,10 @@
|
|||||||
|
#
|
||||||
|
# Copyright Troy D. Straszheim
|
||||||
|
#
|
||||||
|
# Distributed under the Boost Software License, Version 1.0.
|
||||||
|
# See http://www.boost.org/LICENSE_1_0.txt
|
||||||
|
#
|
||||||
|
boost_additional_test_dependencies(algorithm BOOST_DEPENDS test)
|
||||||
|
|
||||||
|
boost_test_run(minmax_element_test)
|
||||||
|
boost_test_run(minmax_test)
|
||||||
4
module.cmake
Normal file
4
module.cmake
Normal file
@@ -0,0 +1,4 @@
|
|||||||
|
boost_module(algorithm DEPENDS regex concept_check range)
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
@@ -25,7 +25,7 @@
|
|||||||
</para>
|
</para>
|
||||||
<para>
|
<para>
|
||||||
<emphasis role="bold">Definition:</emphasis> A string is a
|
<emphasis role="bold">Definition:</emphasis> A string is a
|
||||||
<ulink url="../../libs/range/index.html">range</ulink> of characters accessible in sequential
|
<ulink url="../../libs/range/doc/range.html">range</ulink> of characters accessible in sequential
|
||||||
ordered fashion. Character is any value type with "cheap" copying and assignment.
|
ordered fashion. Character is any value type with "cheap" copying and assignment.
|
||||||
</para>
|
</para>
|
||||||
<para>
|
<para>
|
||||||
|
|||||||
@@ -57,7 +57,7 @@
|
|||||||
The magic of <ulink url="../../libs/range/index.html">Boost.Range</ulink>
|
The magic of <ulink url="../../libs/range/index.html">Boost.Range</ulink>
|
||||||
provides a uniform way of handling different string types.
|
provides a uniform way of handling different string types.
|
||||||
If there is a need to pass a pair of iterators,
|
If there is a need to pass a pair of iterators,
|
||||||
<ulink url="../../libs/range/doc/html/range/utilities/iterator_range.html"><code>boost::iterator_range</code></ulink>
|
<ulink url="../../libs/range/doc/utility_class.html"><code>boost::iterator_range</code></ulink>
|
||||||
can be used to package iterators into a structure with a compatible interface.
|
can be used to package iterators into a structure with a compatible interface.
|
||||||
</para>
|
</para>
|
||||||
</listitem>
|
</listitem>
|
||||||
@@ -208,7 +208,7 @@
|
|||||||
</programlisting>
|
</programlisting>
|
||||||
<para>
|
<para>
|
||||||
We have used <functionname>find_last()</functionname> to search the <code>text</code> for "ll".
|
We have used <functionname>find_last()</functionname> to search the <code>text</code> for "ll".
|
||||||
The result is given in the <ulink url="../../libs/range/doc/html/range/utilities/iterator_range.html"><code>boost::iterator_range</code></ulink>.
|
The result is given in the <ulink url="../../libs/range/doc/utility_class.html"><code>boost::iterator_range</code></ulink>.
|
||||||
This range delimits the
|
This range delimits the
|
||||||
part of the input which satisfies the find criteria. In our example it is the last occurrence of "ll".
|
part of the input which satisfies the find criteria. In our example it is the last occurrence of "ll".
|
||||||
|
|
||||||
@@ -217,7 +217,7 @@
|
|||||||
<ulink url="../../libs/range/index.html">Boost.Range</ulink>.
|
<ulink url="../../libs/range/index.html">Boost.Range</ulink>.
|
||||||
|
|
||||||
The following lines transform the result. Notice that
|
The following lines transform the result. Notice that
|
||||||
<ulink url="../../libs/range/doc/html/range/utilities/iterator_range.html"><code>boost::iterator_range</code></ulink> has familiar
|
<ulink url="../../libs/range/doc/utility_class.html"><code>boost::iterator_range</code></ulink> has familiar
|
||||||
<code>begin()</code> and <code>end()</code> methods, so it can be used like any other STL container.
|
<code>begin()</code> and <code>end()</code> methods, so it can be used like any other STL container.
|
||||||
Also it is convertible to bool therefore it is easy to use find algorithms for a simple containment checking.
|
Also it is convertible to bool therefore it is easy to use find algorithms for a simple containment checking.
|
||||||
</para>
|
</para>
|
||||||
@@ -264,7 +264,7 @@
|
|||||||
the find iterator allows us to iterate over the substrings matching the specified criteria.
|
the find iterator allows us to iterate over the substrings matching the specified criteria.
|
||||||
This facility is using the <link linkend="string_algo.finder_concept">Finder</link> to incrementally
|
This facility is using the <link linkend="string_algo.finder_concept">Finder</link> to incrementally
|
||||||
search the string.
|
search the string.
|
||||||
Dereferencing a find iterator yields an <ulink url="../../libs/range/doc/html/range/utilities/iterator_range.html"><code>boost::iterator_range</code></ulink>
|
Dereferencing a find iterator yields an <ulink url="../../libs/range/doc/utility_class.html"><code>boost::iterator_range</code></ulink>
|
||||||
object, that delimits the current match.
|
object, that delimits the current match.
|
||||||
</para>
|
</para>
|
||||||
<para>
|
<para>
|
||||||
|
|||||||
18
string/test/CMakeLists.txt
Normal file
18
string/test/CMakeLists.txt
Normal file
@@ -0,0 +1,18 @@
|
|||||||
|
#
|
||||||
|
# Copyright Troy D. Straszheim
|
||||||
|
#
|
||||||
|
# Distributed under the Boost Software License, Version 1.0.
|
||||||
|
# See http://www.boost.org/LICENSE_1_0.txt
|
||||||
|
#
|
||||||
|
boost_additional_test_dependencies(algorithm BOOST_DEPENDS test)
|
||||||
|
|
||||||
|
|
||||||
|
boost_test_run(trim_test)
|
||||||
|
boost_test_run(conv_test)
|
||||||
|
boost_test_run(predicate_test)
|
||||||
|
boost_test_run(find_test)
|
||||||
|
boost_test_run(split_test)
|
||||||
|
boost_test_run(join_test)
|
||||||
|
boost_test_run(replace_test)
|
||||||
|
boost_test_run(regex_test DEPENDS boost_regex SHARED)
|
||||||
|
|
||||||
Reference in New Issue
Block a user