text: //  Copyright (c) 2015-2016 Hartmut Kaiser
  //  Copyright (c)      2017 Taeguk Kwon
  //
  //  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)
  
  #if !defined(HPX_PARALLEL_CONTAINER_ALGORITHM_JUL_18_2015_0958AM)
  #define HPX_PARALLEL_CONTAINER_ALGORITHM_JUL_18_2015_0958AM
  
  #include <hpx/parallel/algorithm.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/fill.hpp>
  #include <hpx/parallel/container_algorithms/find.hpp>
  #include <hpx/parallel/container_algorithms/for_each.hpp>
  #include <hpx/parallel/container_algorithms/generate.hpp>
  #include <hpx/parallel/container_algorithms/is_heap.hpp>
  #include <hpx/parallel/container_algorithms/merge.hpp>
  #include <hpx/parallel/container_algorithms/minmax.hpp>
  #include <hpx/parallel/container_algorithms/move.hpp>
  #include <hpx/parallel/container_algorithms/partition.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/sort.hpp>
  #include <hpx/parallel/container_algorithms/transform.hpp>
  #include <hpx/parallel/container_algorithms/unique.hpp>
  
  #endif
  