00001 00002 #ifndef INSTIGATE_STL_ALGORITHM_HPP 00003 #define INSTIGATE_STL_ALGORITHM_HPP 00004 00054 #define _INSTIGATE_STL_INTERNAL_HEADER_IN_ALGORITHM 00055 00056 #include "concept.hpp" 00057 #include "_basis.hpp" 00058 #include "_for_each.hpp" 00059 #include "_lexicographical_compare.hpp" 00060 #include "_lexicographical_compare_3way.hpp" 00061 #include "_merge.hpp" 00062 #include "_mismatch.hpp" 00063 #include "_reverse.hpp" 00064 #include "_reverse_copy.hpp" 00065 #include "_set_difference.hpp" 00066 #include "_set_intersection.hpp" 00067 #include "_set_symmetric_difference.hpp" 00068 #include "_set_union.hpp" 00069 #include "_transform.hpp" 00070 #include "_unique.hpp" 00071 #include "_unique_copy.hpp" 00072 #include "_find_end.hpp" 00073 #include "_includes.hpp" 00074 #include "_inplace_merge.hpp" 00075 #include "_partial_sort.hpp" 00076 #include "_partial_sort_copy.hpp" 00077 #include "_find.hpp" 00078 #include "_find_if.hpp" 00079 #include "_adjacent_find.hpp" 00080 #include "_search_n.hpp" 00081 #include "_generate.hpp" 00082 #include "_generate_n.hpp" 00083 #include "_fill.hpp" 00084 #include "_fill_n.hpp" 00085 #include "_partition.hpp" 00086 #include "_stable_partition.hpp" 00087 #include "_lower_bound.hpp" 00088 #include "_upper_bound.hpp" 00089 #include "_equal_range.hpp" 00090 #include "_binary_search.hpp" 00091 #include "_next_permutation.hpp" 00092 #include "_prev_permutation.hpp" 00093 #include "_iota.hpp" 00094 #include "_accumulate.hpp" 00095 #include "_partial_sum.hpp" 00096 #include "_is_heap.hpp" 00097 #include "_make_heap.hpp" 00098 #include "_pop_heap.hpp" 00099 #include "_push_heap.hpp" 00100 #include "_sort_heap.hpp" 00101 #include "_power.hpp" 00102 #include "_rotate.hpp" 00103 #include "_rotate_copy.hpp" 00104 #include "_distance.hpp" 00105 #include "_advance.hpp" 00106 #include "_swap.hpp" 00107 #include "_iter_swap.hpp" 00108 #include "_swap_ranges.hpp" 00109 #include "_replace.hpp" 00110 #include "_replace_copy.hpp" 00111 #include "_replace_if.hpp" 00112 #include "_replace_copy_if.hpp" 00113 #include "_copy.hpp" 00114 #include "_copy_n.hpp" 00115 #include "_copy_backward.hpp" 00116 #include "_sort.hpp" 00117 #include "_find_first_of.hpp" 00118 #include "_search.hpp" 00119 #include "_remove.hpp" 00120 #include "_remove_if.hpp" 00121 #include "_remove_copy.hpp" 00122 #include "_remove_copy_if.hpp" 00123 #include "_min.hpp" 00124 #include "_max.hpp" 00125 #include "_min_element.hpp" 00126 #include "_max_element.hpp" 00127 #include "_random_number.hpp" 00128 #include "_random_shuffle.hpp" 00129 #include "_random_sample.hpp" 00130 #include "_random_sample_n.hpp" 00131 #include "_inner_product.hpp" 00132 #include "_adjacent_difference.hpp" 00133 #include "_is_sorted.hpp" 00134 #include "_stable_sort.hpp" 00135 #include "_count.hpp" 00136 #include "_count_if.hpp" 00137 #include "_equal.hpp" 00138 00139 #undef _INSTIGATE_STL_INTERNAL_HEADER_IN_ALGORITHM 00140 00141 // vim:et:tabstop=8:shiftwidth=8:cindent:fo=croq:textwidth=80: 00142 00143 #endif // INSTIGATE_STL_ALGORITHM_HPP