annotate DEPENDENCIES/generic/include/boost/range/algorithm.hpp @ 125:34e428693f5d vext

Vext -> Repoint
author Chris Cannam
date Thu, 14 Jun 2018 11:15:39 +0100
parents c530137014c0
children
rev   line source
Chris@16 1 ///////////////////////////////////////////////////////////////////////////////
Chris@16 2 /// \file algorithm.hpp
Chris@16 3 /// Includes the range-based versions of the algorithms in the
Chris@16 4 /// C++ standard header file <algorithm>
Chris@16 5 //
Chris@16 6 /////////////////////////////////////////////////////////////////////////////
Chris@16 7
Chris@16 8 // Copyright 2009 Neil Groves.
Chris@16 9 // Distributed under the Boost Software License, Version 1.0. (See
Chris@16 10 // accompanying file LICENSE_1_0.txt or copy at
Chris@16 11 // http://www.boost.org/LICENSE_1_0.txt)
Chris@16 12 //
Chris@16 13 // Acknowledgements:
Chris@16 14 // This code uses combinations of ideas, techniques and code snippets
Chris@16 15 // from: Thorsten Ottosen, Eric Niebler, Jeremy Siek,
Chris@16 16 // and Vladimir Prus'
Chris@16 17 //
Chris@16 18 // The original mutating algorithms that served as the first version
Chris@16 19 // were originally written by Vladimir Prus'
Chris@16 20 // <ghost@cs.msu.su> code from Boost Wiki
Chris@16 21
Chris@101 22 #if defined(_MSC_VER)
Chris@16 23 #pragma once
Chris@16 24 #endif
Chris@16 25
Chris@16 26 #ifndef BOOST_RANGE_ALGORITHM_HPP_INCLUDED_01012009
Chris@16 27 #define BOOST_RANGE_ALGORITHM_HPP_INCLUDED_01012009
Chris@16 28
Chris@16 29 #include <boost/range/concepts.hpp>
Chris@16 30 #include <boost/range/iterator_range.hpp>
Chris@16 31 #include <boost/range/difference_type.hpp>
Chris@16 32 #include <boost/range/detail/range_return.hpp>
Chris@16 33 #include <boost/iterator/iterator_traits.hpp>
Chris@16 34 #include <boost/next_prior.hpp>
Chris@16 35 #include <algorithm>
Chris@16 36
Chris@16 37 // Non-mutating algorithms
Chris@16 38 #include <boost/range/algorithm/adjacent_find.hpp>
Chris@16 39 #include <boost/range/algorithm/count.hpp>
Chris@16 40 #include <boost/range/algorithm/count_if.hpp>
Chris@16 41 #include <boost/range/algorithm/equal.hpp>
Chris@16 42 #include <boost/range/algorithm/for_each.hpp>
Chris@16 43 #include <boost/range/algorithm/find.hpp>
Chris@16 44 #include <boost/range/algorithm/find_end.hpp>
Chris@16 45 #include <boost/range/algorithm/find_first_of.hpp>
Chris@16 46 #include <boost/range/algorithm/find_if.hpp>
Chris@16 47 #include <boost/range/algorithm/lexicographical_compare.hpp>
Chris@16 48 #include <boost/range/algorithm/mismatch.hpp>
Chris@16 49 #include <boost/range/algorithm/search.hpp>
Chris@16 50 #include <boost/range/algorithm/search_n.hpp>
Chris@16 51
Chris@16 52 // Mutating algorithms
Chris@16 53 #include <boost/range/algorithm/copy.hpp>
Chris@16 54 #include <boost/range/algorithm/copy_backward.hpp>
Chris@16 55 #include <boost/range/algorithm/fill.hpp>
Chris@16 56 #include <boost/range/algorithm/fill_n.hpp>
Chris@16 57 #include <boost/range/algorithm/generate.hpp>
Chris@16 58 #include <boost/range/algorithm/inplace_merge.hpp>
Chris@16 59 #include <boost/range/algorithm/merge.hpp>
Chris@16 60 #include <boost/range/algorithm/nth_element.hpp>
Chris@16 61 #include <boost/range/algorithm/partial_sort.hpp>
Chris@16 62 #include <boost/range/algorithm/partial_sort_copy.hpp>
Chris@16 63 #include <boost/range/algorithm/partition.hpp>
Chris@16 64 #include <boost/range/algorithm/random_shuffle.hpp>
Chris@16 65 #include <boost/range/algorithm/remove.hpp>
Chris@16 66 #include <boost/range/algorithm/remove_copy.hpp>
Chris@16 67 #include <boost/range/algorithm/remove_copy_if.hpp>
Chris@16 68 #include <boost/range/algorithm/remove_if.hpp>
Chris@16 69 #include <boost/range/algorithm/replace.hpp>
Chris@16 70 #include <boost/range/algorithm/replace_copy.hpp>
Chris@16 71 #include <boost/range/algorithm/replace_copy_if.hpp>
Chris@16 72 #include <boost/range/algorithm/replace_if.hpp>
Chris@16 73 #include <boost/range/algorithm/reverse.hpp>
Chris@16 74 #include <boost/range/algorithm/reverse_copy.hpp>
Chris@16 75 #include <boost/range/algorithm/rotate.hpp>
Chris@16 76 #include <boost/range/algorithm/rotate_copy.hpp>
Chris@16 77 #include <boost/range/algorithm/sort.hpp>
Chris@16 78 #include <boost/range/algorithm/stable_partition.hpp>
Chris@16 79 #include <boost/range/algorithm/stable_sort.hpp>
Chris@16 80 #include <boost/range/algorithm/transform.hpp>
Chris@16 81 #include <boost/range/algorithm/unique.hpp>
Chris@16 82 #include <boost/range/algorithm/unique_copy.hpp>
Chris@16 83
Chris@16 84 // Binary search
Chris@16 85 #include <boost/range/algorithm/binary_search.hpp>
Chris@16 86 #include <boost/range/algorithm/equal_range.hpp>
Chris@16 87 #include <boost/range/algorithm/lower_bound.hpp>
Chris@16 88 #include <boost/range/algorithm/upper_bound.hpp>
Chris@16 89
Chris@16 90 // Set operations of sorted ranges
Chris@16 91 #include <boost/range/algorithm/set_algorithm.hpp>
Chris@16 92
Chris@16 93 // Heap operations
Chris@16 94 #include <boost/range/algorithm/heap_algorithm.hpp>
Chris@16 95
Chris@16 96 // Minimum and Maximum
Chris@16 97 #include <boost/range/algorithm/max_element.hpp>
Chris@16 98 #include <boost/range/algorithm/min_element.hpp>
Chris@16 99
Chris@16 100 // Permutations
Chris@16 101 #include <boost/range/algorithm/permutation.hpp>
Chris@16 102
Chris@16 103 #endif // include guard
Chris@16 104