//  Copyright (c) 2015-2020 Hartmut Kaiser
//  Copyright (c)      2017 Taeguk Kwon
//
//  SPDX-License-Identifier: BSL-1.0
//  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)

#pragma once

#include <hpx/parallel/algorithm.hpp>

#include <hpx/parallel/container_algorithms/adjacent_find.hpp>
#include <hpx/parallel/container_algorithms/all_any_none.hpp>
#include <hpx/parallel/container_algorithms/copy.hpp>
#include <hpx/parallel/container_algorithms/count.hpp>
#include <hpx/parallel/container_algorithms/ends_with.hpp>
#include <hpx/parallel/container_algorithms/equal.hpp>
#include <hpx/parallel/container_algorithms/fill.hpp>
#include <hpx/parallel/container_algorithms/find.hpp>
#include <hpx/parallel/container_algorithms/for_each.hpp>
#include <hpx/parallel/container_algorithms/for_loop.hpp>
#include <hpx/parallel/container_algorithms/generate.hpp>
#include <hpx/parallel/container_algorithms/includes.hpp>
#include <hpx/parallel/container_algorithms/is_heap.hpp>
#include <hpx/parallel/container_algorithms/is_partitioned.hpp>
#include <hpx/parallel/container_algorithms/is_sorted.hpp>
#include <hpx/parallel/container_algorithms/lexicographical_compare.hpp>
#include <hpx/parallel/container_algorithms/make_heap.hpp>
#include <hpx/parallel/container_algorithms/merge.hpp>
#include <hpx/parallel/container_algorithms/minmax.hpp>
#include <hpx/parallel/container_algorithms/mismatch.hpp>
#include <hpx/parallel/container_algorithms/move.hpp>
#include <hpx/parallel/container_algorithms/nth_element.hpp>
#include <hpx/parallel/container_algorithms/partial_sort.hpp>
#include <hpx/parallel/container_algorithms/partial_sort_copy.hpp>
#include <hpx/parallel/container_algorithms/partition.hpp>
#include <hpx/parallel/container_algorithms/reduce.hpp>
#include <hpx/parallel/container_algorithms/remove.hpp>
#include <hpx/parallel/container_algorithms/remove_copy.hpp>
#include <hpx/parallel/container_algorithms/replace.hpp>
#include <hpx/parallel/container_algorithms/reverse.hpp>
#include <hpx/parallel/container_algorithms/rotate.hpp>
#include <hpx/parallel/container_algorithms/search.hpp>
#include <hpx/parallel/container_algorithms/set_difference.hpp>
#include <hpx/parallel/container_algorithms/set_intersection.hpp>
#include <hpx/parallel/container_algorithms/set_symmetric_difference.hpp>
#include <hpx/parallel/container_algorithms/set_union.hpp>
#include <hpx/parallel/container_algorithms/shift_left.hpp>
#include <hpx/parallel/container_algorithms/shift_right.hpp>
#include <hpx/parallel/container_algorithms/sort.hpp>
#include <hpx/parallel/container_algorithms/stable_sort.hpp>
#include <hpx/parallel/container_algorithms/starts_with.hpp>
#include <hpx/parallel/container_algorithms/swap_ranges.hpp>
#include <hpx/parallel/container_algorithms/transform.hpp>
#include <hpx/parallel/container_algorithms/unique.hpp>
