Sprout/sprout/algorithm/non_modifying.hpp

/*=============================================================================
  Copyright (c) 2011-2016 Bolero MURAKAMI
  https://github.com/bolero-MURAKAMI/Sprout

  Distributed under the Boost Software License, Version 1.0. (See accompanying
  file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
#ifndef SPROUT_ALGORITHM_NON_MODIFYIING_HPP
#define SPROUT_ALGORITHM_NON_MODIFYIING_HPP

#include <sprout/config.hpp>
#include <sprout/algorithm/all_of.hpp>
#include <sprout/algorithm/all_of_equal.hpp>
#include <sprout/algorithm/any_of.hpp>
#include <sprout/algorithm/any_of_equal.hpp>
#include <sprout/algorithm/none_of.hpp>
#include <sprout/algorithm/none_of_equal.hpp>
#include <sprout/algorithm/one_of.hpp>
#include <sprout/algorithm/one_of_equal.hpp>
#include <sprout/algorithm/find.hpp>
#include <sprout/algorithm/find_if.hpp>
#include <sprout/algorithm/find_if_not.hpp>
#include <sprout/algorithm/find_end.hpp>
#include <sprout/algorithm/find_first_of.hpp>
#include <sprout/algorithm/adjacent_find.hpp>
#include <sprout/algorithm/count.hpp>
#include <sprout/algorithm/count_if.hpp>
#include <sprout/algorithm/mismatch.hpp>
#include <sprout/algorithm/equal.hpp>
#include <sprout/algorithm/is_permutation.hpp>
#include <sprout/algorithm/search.hpp>
#include <sprout/algorithm/search_n.hpp>
#include <sprout/algorithm/is_partitioned.hpp>
#include <sprout/algorithm/partition_point.hpp>
#include <sprout/algorithm/is_sorted.hpp>
#include <sprout/algorithm/is_sorted_until.hpp>
#include <sprout/algorithm/is_increasing.hpp>
#include <sprout/algorithm/is_decreasing.hpp>
#include <sprout/algorithm/is_strictly_increasing.hpp>
#include <sprout/algorithm/is_strictly_decreasing.hpp>
#include <sprout/algorithm/lower_bound.hpp>
#include <sprout/algorithm/upper_bound.hpp>
#include <sprout/algorithm/equal_range.hpp>
#include <sprout/algorithm/binary_search.hpp>
#include <sprout/algorithm/includes.hpp>
#include <sprout/algorithm/is_heap.hpp>
#include <sprout/algorithm/is_heap_until.hpp>
#include <sprout/algorithm/min.hpp>
#include <sprout/algorithm/max.hpp>
#include <sprout/algorithm/minmax.hpp>
#include <sprout/algorithm/min_element.hpp>
#include <sprout/algorithm/max_element.hpp>
#include <sprout/algorithm/minmax_element.hpp>
#include <sprout/algorithm/lexicographical_compare.hpp>
#include <sprout/algorithm/tristate_lexicographical_compare.hpp>
#include <sprout/algorithm/find_intersection.hpp>
#include <sprout/algorithm/find_difference.hpp>
#include <sprout/algorithm/find_symmetric_difference.hpp>
#include <sprout/algorithm/next_union.hpp>
#include <sprout/algorithm/next_intersection.hpp>
#include <sprout/algorithm/next_difference.hpp>
#include <sprout/algorithm/next_symmetric_difference.hpp>
#include <sprout/algorithm/clamp.hpp>
#include <sprout/algorithm/fold_while.hpp>
#include <sprout/algorithm/fold_until.hpp>
#include <sprout/algorithm/abs_diff.hpp>

#endif	// #ifndef SPROUT_ALGORITHM_NON_MODIFYIING_HPP