#ifndef vcl_generic_algorithm_h_
#define vcl_generic_algorithm_h_

// THIS IS A GENERATED FILE. DO NOT EDIT! -- Instead, edit vcl_algorithm.hhh and run make

// adjacent_find
#ifndef vcl_adjacent_find
#define vcl_adjacent_find vcl_generic_algorithm_STD :: adjacent_find
#endif
// and
#ifndef vcl_and
#define vcl_and vcl_generic_algorithm_STD :: and
#endif
// binary
#ifndef vcl_binary
#define vcl_binary vcl_generic_algorithm_STD :: binary
#endif
// binary_search
#ifndef vcl_binary_search
#define vcl_binary_search vcl_generic_algorithm_STD :: binary_search
#endif
// copy
#ifndef vcl_copy
#define vcl_copy vcl_generic_algorithm_STD :: copy
#endif
// copy_
#ifndef vcl_copy_
#define vcl_copy_ vcl_generic_algorithm_STD :: copy_
#endif
// count
#ifndef vcl_count
#define vcl_count vcl_generic_algorithm_STD :: count
#endif
// count_if
#ifndef vcl_count_if
#define vcl_count_if vcl_generic_algorithm_STD :: count_if
#endif
// equal
#ifndef vcl_equal
#define vcl_equal vcl_generic_algorithm_STD :: equal
#endif
// equal_range
#ifndef vcl_equal_range
#define vcl_equal_range vcl_generic_algorithm_STD :: equal_range
#endif
// fill
#ifndef vcl_fill
#define vcl_fill vcl_generic_algorithm_STD :: fill
#endif
// fill_n
#ifndef vcl_fill_n
#define vcl_fill_n vcl_generic_algorithm_STD :: fill_n
#endif
// find
#ifndef vcl_find
#define vcl_find vcl_generic_algorithm_STD :: find
#endif
// find_end
#ifndef vcl_find_end
#define vcl_find_end vcl_generic_algorithm_STD :: find_end
#endif
// find_first_of
#ifndef vcl_find_first_of
#define vcl_find_first_of vcl_generic_algorithm_STD :: find_first_of
#endif
// find_if
#ifndef vcl_find_if
#define vcl_find_if vcl_generic_algorithm_STD :: find_if
#endif
// for_each
#ifndef vcl_for_each
#define vcl_for_each vcl_generic_algorithm_STD :: for_each
#endif
// generate
#ifndef vcl_generate
#define vcl_generate vcl_generic_algorithm_STD :: generate
#endif
// generate_n
#ifndef vcl_generate_n
#define vcl_generate_n vcl_generic_algorithm_STD :: generate_n
#endif
// generators_
#ifndef vcl_generators_
#define vcl_generators_ vcl_generic_algorithm_STD :: generators_
#endif
// heap
#ifndef vcl_heap
#define vcl_heap vcl_generic_algorithm_STD :: heap
#endif
// includes
#ifndef vcl_includes
#define vcl_includes vcl_generic_algorithm_STD :: includes
#endif
// inplace_merge
#ifndef vcl_inplace_merge
#define vcl_inplace_merge vcl_generic_algorithm_STD :: inplace_merge
#endif
// iter_swap
#ifndef vcl_iter_swap
#define vcl_iter_swap vcl_generic_algorithm_STD :: iter_swap
#endif
// lexicographical_compare
#ifndef vcl_lexicographical_compare
#define vcl_lexicographical_compare vcl_generic_algorithm_STD :: lexicographical_compare
#endif
// lower_bound
#ifndef vcl_lower_bound
#define vcl_lower_bound vcl_generic_algorithm_STD :: lower_bound
#endif
// make_heap
#ifndef vcl_make_heap
#define vcl_make_heap vcl_generic_algorithm_STD :: make_heap
#endif
// max
#ifndef vcl_max
#define vcl_max vcl_generic_algorithm_STD :: max
#endif
// min
#ifndef vcl_min
#define vcl_min vcl_generic_algorithm_STD :: min
#endif
// max_element
#ifndef vcl_max_element
#define vcl_max_element vcl_generic_algorithm_STD :: max_element
#endif
// merge
#ifndef vcl_merge
#define vcl_merge vcl_generic_algorithm_STD :: merge
#endif
// merge_
#ifndef vcl_merge_
#define vcl_merge_ vcl_generic_algorithm_STD :: merge_
#endif
// min_element
#ifndef vcl_min_element
#define vcl_min_element vcl_generic_algorithm_STD :: min_element
#endif
// mismatch
#ifndef vcl_mismatch
#define vcl_mismatch vcl_generic_algorithm_STD :: mismatch
#endif
// next_permutation
#ifndef vcl_next_permutation
#define vcl_next_permutation vcl_generic_algorithm_STD :: next_permutation
#endif
// nth_element
#ifndef vcl_nth_element
#define vcl_nth_element vcl_generic_algorithm_STD :: nth_element
#endif
// partial_sort
#ifndef vcl_partial_sort
#define vcl_partial_sort vcl_generic_algorithm_STD :: partial_sort
#endif
// partial_sort_copy
#ifndef vcl_partial_sort_copy
#define vcl_partial_sort_copy vcl_generic_algorithm_STD :: partial_sort_copy
#endif
// partition
#ifndef vcl_partition
#define vcl_partition vcl_generic_algorithm_STD :: partition
#endif
// stable_partition
#ifndef vcl_stable_partition
#define vcl_stable_partition vcl_generic_algorithm_STD :: stable_partition
#endif
// partitions_
#ifndef vcl_partitions_
#define vcl_partitions_ vcl_generic_algorithm_STD :: partitions_
#endif
// pop_heap
#ifndef vcl_pop_heap
#define vcl_pop_heap vcl_generic_algorithm_STD :: pop_heap
#endif
// prev_permutation
#ifndef vcl_prev_permutation
#define vcl_prev_permutation vcl_generic_algorithm_STD :: prev_permutation
#endif
// push_heap
#ifndef vcl_push_heap
#define vcl_push_heap vcl_generic_algorithm_STD :: push_heap
#endif
// random_shuffle
#ifndef vcl_random_shuffle
#define vcl_random_shuffle vcl_generic_algorithm_STD :: random_shuffle
#endif
// remove
#ifndef vcl_remove
#define vcl_remove vcl_generic_algorithm_STD :: remove
#endif
// remove_copy
#ifndef vcl_remove_copy
#define vcl_remove_copy vcl_generic_algorithm_STD :: remove_copy
#endif
// remove_copy_if
#ifndef vcl_remove_copy_if
#define vcl_remove_copy_if vcl_generic_algorithm_STD :: remove_copy_if
#endif
// remove_if
#ifndef vcl_remove_if
#define vcl_remove_if vcl_generic_algorithm_STD :: remove_if
#endif
// replace
#ifndef vcl_replace
#define vcl_replace vcl_generic_algorithm_STD :: replace
#endif
// replace_copy
#ifndef vcl_replace_copy
#define vcl_replace_copy vcl_generic_algorithm_STD :: replace_copy
#endif
// replace_copy_if
#ifndef vcl_replace_copy_if
#define vcl_replace_copy_if vcl_generic_algorithm_STD :: replace_copy_if
#endif
// replace_if
#ifndef vcl_replace_if
#define vcl_replace_if vcl_generic_algorithm_STD :: replace_if
#endif
// reverse
#ifndef vcl_reverse
#define vcl_reverse vcl_generic_algorithm_STD :: reverse
#endif
// reverse_copy
#ifndef vcl_reverse_copy
#define vcl_reverse_copy vcl_generic_algorithm_STD :: reverse_copy
#endif
// rotate
#ifndef vcl_rotate
#define vcl_rotate vcl_generic_algorithm_STD :: rotate
#endif
// rotate_copy
#ifndef vcl_rotate_copy
#define vcl_rotate_copy vcl_generic_algorithm_STD :: rotate_copy
#endif
// search
#ifndef vcl_search
#define vcl_search vcl_generic_algorithm_STD :: search
#endif
// search_n
#ifndef vcl_search_n
#define vcl_search_n vcl_generic_algorithm_STD :: search_n
#endif
// set_difference
#ifndef vcl_set_difference
#define vcl_set_difference vcl_generic_algorithm_STD :: set_difference
#endif
// set_intersection
#ifndef vcl_set_intersection
#define vcl_set_intersection vcl_generic_algorithm_STD :: set_intersection
#endif
// set_symmetric_difference
#ifndef vcl_set_symmetric_difference
#define vcl_set_symmetric_difference vcl_generic_algorithm_STD :: set_symmetric_difference
#endif
// set_union
#ifndef vcl_set_union
#define vcl_set_union vcl_generic_algorithm_STD :: set_union
#endif
// sort
#ifndef vcl_sort
#define vcl_sort vcl_generic_algorithm_STD :: sort
#endif
// sort_
#ifndef vcl_sort_
#define vcl_sort_ vcl_generic_algorithm_STD :: sort_
#endif
// sort_heap
#ifndef vcl_sort_heap
#define vcl_sort_heap vcl_generic_algorithm_STD :: sort_heap
#endif
// stable_sort
#ifndef vcl_stable_sort
#define vcl_stable_sort vcl_generic_algorithm_STD :: stable_sort
#endif
// swap
#ifndef vcl_swap
#define vcl_swap vcl_generic_algorithm_STD :: swap
#endif
// swap_
#ifndef vcl_swap_
#define vcl_swap_ vcl_generic_algorithm_STD :: swap_
#endif
// swap_ranges
#ifndef vcl_swap_ranges
#define vcl_swap_ranges vcl_generic_algorithm_STD :: swap_ranges
#endif
// transform
#ifndef vcl_transform
#define vcl_transform vcl_generic_algorithm_STD :: transform
#endif
// unique
#ifndef vcl_unique
#define vcl_unique vcl_generic_algorithm_STD :: unique
#endif
// unique_copy
#ifndef vcl_unique_copy
#define vcl_unique_copy vcl_generic_algorithm_STD :: unique_copy
#endif
// upper_bound
#ifndef vcl_upper_bound
#define vcl_upper_bound vcl_generic_algorithm_STD :: upper_bound
#endif

#endif // vcl_generic_algorithm_h_
