projects / ceph.git / blame
| Commit | Line | Data |
|---|---|---|
| 7c673cae FG |
1 | //---------------------------------------------------------------------------// |
| 2 | // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com> | |
| 3 | // | |
| 4 | // Distributed under the Boost Software License, Version 1.0 | |
| 5 | // See accompanying file LICENSE_1_0.txt or copy at | |
| 6 | // http://www.boost.org/LICENSE_1_0.txt | |
| 7 | // | |
| 8 | // See http://boostorg.github.com/compute for more information. | |
| 9 | //---------------------------------------------------------------------------// | |
| 10 | ||
| 11 | #ifndef BOOST_COMPUTE_ALGORITHM_HPP | |
| 12 | #define BOOST_COMPUTE_ALGORITHM_HPP | |
| 13 | ||
| 14 | /// \file | |
| 15 | /// | |
| 16 | /// Meta-header to include all Boost.Compute algorithm headers. | |
| 17 | ||
| 18 | #include <boost/compute/algorithm/accumulate.hpp> | |
| 19 | #include <boost/compute/algorithm/adjacent_difference.hpp> | |
| 20 | #include <boost/compute/algorithm/adjacent_find.hpp> | |
| 21 | #include <boost/compute/algorithm/all_of.hpp> | |
| 22 | #include <boost/compute/algorithm/any_of.hpp> | |
| 23 | #include <boost/compute/algorithm/binary_search.hpp> | |
| 24 | #include <boost/compute/algorithm/copy.hpp> | |
| 25 | #include <boost/compute/algorithm/copy_if.hpp> | |
| 26 | #include <boost/compute/algorithm/copy_n.hpp> | |
| 27 | #include <boost/compute/algorithm/count.hpp> | |
| 28 | #include <boost/compute/algorithm/count_if.hpp> | |
| 29 | #include <boost/compute/algorithm/equal.hpp> | |
| 30 | #include <boost/compute/algorithm/equal_range.hpp> | |
| 31 | #include <boost/compute/algorithm/exclusive_scan.hpp> | |
| 32 | #include <boost/compute/algorithm/fill.hpp> | |
| 33 | #include <boost/compute/algorithm/fill_n.hpp> | |
| 34 | #include <boost/compute/algorithm/find.hpp> | |
| 35 | #include <boost/compute/algorithm/find_end.hpp> | |
| 36 | #include <boost/compute/algorithm/find_if.hpp> | |
| 37 | #include <boost/compute/algorithm/find_if_not.hpp> | |
| 38 | #include <boost/compute/algorithm/for_each.hpp> | |
| 39 | #include <boost/compute/algorithm/for_each_n.hpp> | |
| 40 | #include <boost/compute/algorithm/gather.hpp> | |
| 41 | #include <boost/compute/algorithm/generate.hpp> | |
| 42 | #include <boost/compute/algorithm/generate_n.hpp> | |
| 43 | #include <boost/compute/algorithm/inclusive_scan.hpp> | |
| 44 | #include <boost/compute/algorithm/includes.hpp> | |
| 45 | #include <boost/compute/algorithm/inner_product.hpp> | |
| 46 | #include <boost/compute/algorithm/iota.hpp> | |
| 47 | #include <boost/compute/algorithm/is_partitioned.hpp> | |
| 48 | #include <boost/compute/algorithm/is_permutation.hpp> | |
| 49 | #include <boost/compute/algorithm/is_sorted.hpp> | |
| 50 | #include <boost/compute/algorithm/lower_bound.hpp> | |
| 51 | #include <boost/compute/algorithm/lexicographical_compare.hpp> | |
| 52 | #include <boost/compute/algorithm/max_element.hpp> | |
| 53 | #include <boost/compute/algorithm/merge.hpp> | |
| 54 | #include <boost/compute/algorithm/min_element.hpp> | |
| 55 | #include <boost/compute/algorithm/minmax_element.hpp> | |
| 56 | #include <boost/compute/algorithm/mismatch.hpp> | |
| 57 | #include <boost/compute/algorithm/next_permutation.hpp> | |
| 58 | #include <boost/compute/algorithm/none_of.hpp> | |
| 59 | #include <boost/compute/algorithm/partial_sum.hpp> | |
| 60 | #include <boost/compute/algorithm/partition.hpp> | |
| 61 | #include <boost/compute/algorithm/partition_copy.hpp> | |
| 62 | #include <boost/compute/algorithm/partition_point.hpp> | |
| 63 | #include <boost/compute/algorithm/prev_permutation.hpp> | |
| 64 | #include <boost/compute/algorithm/random_shuffle.hpp> | |
| 65 | #include <boost/compute/algorithm/reduce.hpp> | |
| 66 | #include <boost/compute/algorithm/reduce_by_key.hpp> | |
| 67 | #include <boost/compute/algorithm/remove.hpp> | |
| 68 | #include <boost/compute/algorithm/remove_if.hpp> | |
| 69 | #include <boost/compute/algorithm/replace.hpp> | |
| 70 | #include <boost/compute/algorithm/replace_copy.hpp> | |
| 71 | #include <boost/compute/algorithm/reverse.hpp> | |
| 72 | #include <boost/compute/algorithm/reverse_copy.hpp> | |
| 73 | #include <boost/compute/algorithm/rotate.hpp> | |
| 74 | #include <boost/compute/algorithm/rotate_copy.hpp> | |
| 75 | #include <boost/compute/algorithm/scatter.hpp> | |
| 76 | #include <boost/compute/algorithm/search.hpp> | |
| 77 | #include <boost/compute/algorithm/search_n.hpp> | |
| 78 | #include <boost/compute/algorithm/set_difference.hpp> | |
| 79 | #include <boost/compute/algorithm/set_intersection.hpp> | |
| 80 | #include <boost/compute/algorithm/set_symmetric_difference.hpp> | |
| 81 | #include <boost/compute/algorithm/set_union.hpp> | |
| 82 | #include <boost/compute/algorithm/sort.hpp> | |
| 83 | #include <boost/compute/algorithm/sort_by_key.hpp> | |
| 84 | #include <boost/compute/algorithm/stable_partition.hpp> | |
| 85 | #include <boost/compute/algorithm/stable_sort.hpp> | |
| 86 | #include <boost/compute/algorithm/stable_sort_by_key.hpp> | |
| 87 | #include <boost/compute/algorithm/swap_ranges.hpp> | |
| 88 | #include <boost/compute/algorithm/transform.hpp> | |
| 89 | #include <boost/compute/algorithm/transform_reduce.hpp> | |
| 90 | #include <boost/compute/algorithm/unique.hpp> | |
| 91 | #include <boost/compute/algorithm/unique_copy.hpp> | |
| 92 | #include <boost/compute/algorithm/upper_bound.hpp> | |
| 93 | ||
| 94 | #endif // BOOST_COMPUTE_ALGORITHM_HPP |