Lines Matching full:algorithm
1 [library The Boost Algorithm Library
3 [id algorithm]
4 [dirname algorithm]
19 Boost.Algorithm is a collection of general purpose algorithms. While Boost contains many libraries …
25 … test cases. Knuth's _The Art of Computer Programming_ is chock-full of algorithm descriptions, to…
27 My goal is to run regular algorithm reviews, similar to the Boost library review process, but with …
31 Boost.Algorithm uses Boost.Range, Boost.Assert, Boost.Array, Boost.TypeTraits, and Boost.StaticAsse…
64 [*[^[link header.boost.algorithm.cxx11.partition_copy_hpp partition_copy] ]…
69 [*[^[link header.boost.algorithm.cxx11.copy_if_hpp copy_if] ]…
74 [*[^[link header.boost.algorithm.cxx11.copy_n_hpp copy_n] ]…
79 [*[^[link header.boost.algorithm.cxx11.iota_hpp iota] ]…
105 [*[^[link boost.algorithm.for_each_n for_each_n] ]…
119 [*[^[link header.boost.algorithm.cxx11.none_of_hpp none_of_equal] ]…
124 [*[^[link header.boost.algorithm.cxx11.one_of_hpp one_of_equal] ]…
129 [*[^[link header.boost.algorithm.cxx11.is_sorted_hpp is_decreasing] ]…
134 [*[^[link header.boost.algorithm.cxx11.is_sorted_hpp is_increasing] ]…
139 [*[^[link header.boost.algorithm.cxx11.is_sorted_hpp is_strictly_decreasing] ]…
144 [*[^[link header.boost.algorithm.cxx11.is_sorted_hpp is_strictly_increasing] ]…
151 [*[^[link header.boost.algorithm.clamp_hpp clamp_range] ]…
160 [*[^[link header.boost.algorithm.find_backward_hpp find_not_backward] ]…
166 [*[^[link header.boost.algorithm.find_backward_hpp find_if_backward] ]…
172 [*[^[link header.boost.algorithm.cxx11.find_if_not_hpp find_if_not] ]…
178 [*[^[link header.boost.algorithm.find_backward_hpp find_if_not_backward] ]…
188 [*[^[link header.boost.algorithm.hex_hpp unhex] ]…
193 [*[^[link header.boost.algorithm.hex_hpp hex_lower] ]…
208 [*[^[link header.boost.algorithm.cxx11.copy_if_hpp copy_until] ]…
213 [*[^[link header.boost.algorithm.cxx11.copy_if_hpp copy_while] ]…
218 [*[^[link boost.algorithm.iota_n iota_n] ]…
223 [*[^[link header.boost.algorithm.algorithm_hpp power] ]…
234 * [*[^[link header.boost.algorithm.cxx17.exclusive_scan_hpp exclusive_scan] …
235 * [*[^[link header.boost.algorithm.cxx17.inclusive_scan_hpp inclusive_scan] …
236 * [*[^[link header.boost.algorithm.cxx17.reduce_hpp reduce] …
237 * [*[^[link header.boost.algorithm.cxx17.transform_exclusive_scan_hpp transform_exclusive_scan] …
238 * [*[^[link header.boost.algorithm.cxx17.transform_inclusive_scan_hpp transform_inclusive_scan] …
239 * [*[^[link header.boost.algorithm.cxx17.transform_reduce_hpp transform_reduce] …
246 * [*[^[link header.boost.algorithm.minmax_hpp minmax] …
247 * [*[^[link header.boost.algorithm.minmax_element_hpp first_max_element] …
248 * [*[^[link header.boost.algorithm.minmax_element_hpp first_min_element] …
249 * [*[^[link header.boost.algorithm.minmax_element_hpp first_min_first_max_element]…
250 * [*[^[link header.boost.algorithm.minmax_element_hpp first_min_last_max_element] …
251 * [*[^[link header.boost.algorithm.minmax_element_hpp last_max_element] …
252 * [*[^[link header.boost.algorithm.minmax_element_hpp last_min_element] …
253 * [*[^[link header.boost.algorithm.minmax_element_hpp last_min_first_max_element] …
254 * [*[^[link header.boost.algorithm.minmax_element_hpp last_min_last_max_element] …
255 * [*[^[link header.boost.algorithm.minmax_element_hpp minmax_element] …
256 * [*[^[link header.boost.algorithm.sort_subrange_hpp partition_subrange] …
257 * [*[^[link header.boost.algorithm.sort_subrange_hpp sort_subrange] …