mirror of
https://github.com/boostorg/algorithm.git
synced 2025-06-26 12:31:44 +02:00
Compare commits
25 Commits
svn-branch
...
boost-1.39
Author | SHA1 | Date | |
---|---|---|---|
bcd24426ff | |||
2f2935f07e | |||
3cbaafc27f | |||
c067b348bf | |||
c33935fa1f | |||
98a8b08afb | |||
fc0f3dcffc | |||
822636418b | |||
352e16aade | |||
89c76ea1bb | |||
50b5726a6f | |||
d4b95734dd | |||
05af96f84c | |||
5bdbb2b308 | |||
1a02969303 | |||
6309379618 | |||
37581bac55 | |||
a71a4ed5b1 | |||
c509c3fbad | |||
d8683f2498 | |||
7c0101aa51 | |||
6f3e85528f | |||
8af639b7cf | |||
d9bc7e800b | |||
b4ed9beb90 |
20
CMakeLists.txt
Normal file
20
CMakeLists.txt
Normal file
@ -0,0 +1,20 @@
|
||||
#----------------------------------------------------------------------------
|
||||
# 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
|
||||
)
|
@ -158,9 +158,9 @@ identical to
|
||||
that they return the last instance of the largest element (and not the
|
||||
first, as <tt>first_min_element</tt> and <tt>last_max_element</tt> would).
|
||||
<p>The family of algorithms comprising <tt>first_min_first_max_element</tt>,
|
||||
<tt>first_min_first_max_element</tt>,
|
||||
<tt>first_min_first_max_element</tt>,
|
||||
and <tt>first_min_first_max_element</tt> can be described generically as
|
||||
<tt>first_min_last_max_element</tt>,
|
||||
<tt>last_min_first_max_element</tt>,
|
||||
and <tt>last_min_last_max_element</tt> can be described generically as
|
||||
follows (using <i><tt>which</tt></i> and
|
||||
<i><tt>what</tt></i> for <tt>first</tt>
|
||||
or <tt>last</tt>): <tt><i>which</i>_min_<i>what</i>_max_element</tt> finds
|
||||
|
4
minmax/test/CMakeLists.txt
Normal file
4
minmax/test/CMakeLists.txt
Normal file
@ -0,0 +1,4 @@
|
||||
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)
|
||||
|
||||
|
||||
|
@ -10,7 +10,10 @@
|
||||
import toolset ;
|
||||
toolset.using doxygen ;
|
||||
|
||||
boostbook string_algo : string_algo.xml autodoc ;
|
||||
boostbook string_algo : string_algo.xml autodoc
|
||||
:
|
||||
<format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
|
||||
;
|
||||
|
||||
doxygen autodoc
|
||||
:
|
||||
|
12
string/test/CMakeLists.txt
Normal file
12
string/test/CMakeLists.txt
Normal file
@ -0,0 +1,12 @@
|
||||
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