/*
 *  Copyright 2008-2013 NVIDIA Corporation
 *  Modifications Copyright© 2019-2025 Advanced Micro Devices, Inc. All rights reserved.
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */

#include <thrust/execution_policy.h>
#include <thrust/functional.h>
#include <thrust/sort.h>

#include <unittest/unittest.h>

template <typename T>
struct less_div_10
{
  THRUST_HOST_DEVICE bool operator()(const T& lhs, const T& rhs) const
  {
    return ((int) lhs) / 10 < ((int) rhs) / 10;
  }
};

template <class Vector>
void InitializeSimpleKeySortTest(Vector& unsorted_keys, Vector& sorted_keys)
{
  unsorted_keys.resize(7);
  unsorted_keys[0] = 1;
  unsorted_keys[1] = 3;
  unsorted_keys[2] = 6;
  unsorted_keys[3] = 5;
  unsorted_keys[4] = 2;
  unsorted_keys[5] = 0;
  unsorted_keys[6] = 4;

  sorted_keys.resize(7);
  sorted_keys[0] = 0;
  sorted_keys[1] = 1;
  sorted_keys[2] = 2;
  sorted_keys[3] = 3;
  sorted_keys[4] = 4;
  sorted_keys[5] = 5;
  sorted_keys[6] = 6;
}

template <class Vector>
void InitializeSimpleKeyValueSortTest(
  Vector& unsorted_keys, Vector& unsorted_values, Vector& sorted_keys, Vector& sorted_values)
{
  unsorted_keys.resize(7);
  unsorted_values.resize(7);

  // clang-format off
  unsorted_keys[0] = 1;  unsorted_values[0] = 0;
  unsorted_keys[1] = 3;  unsorted_values[1] = 1;
  unsorted_keys[2] = 6;  unsorted_values[2] = 2;
  unsorted_keys[3] = 5;  unsorted_values[3] = 3;
  unsorted_keys[4] = 2;  unsorted_values[4] = 4;
  unsorted_keys[5] = 0;  unsorted_values[5] = 5;
  unsorted_keys[6] = 4;  unsorted_values[6] = 6;

  sorted_keys.resize(7);
  sorted_values.resize(7);
  sorted_keys[0] = 0;  sorted_values[1] = 0;
  sorted_keys[1] = 1;  sorted_values[3] = 1;
  sorted_keys[2] = 2;  sorted_values[6] = 2;
  sorted_keys[3] = 3;  sorted_values[5] = 3;
  sorted_keys[4] = 4;  sorted_values[2] = 4;
  sorted_keys[5] = 5;  sorted_values[0] = 5;
  sorted_keys[6] = 6;  sorted_values[4] = 6;
  // clang-format on
}

template <class Vector>
void InitializeSimpleStableKeySortTest(Vector& unsorted_keys, Vector& sorted_keys)
{
  unsorted_keys.resize(9);
  unsorted_keys[0] = 25;
  unsorted_keys[1] = 14;
  unsorted_keys[2] = 35;
  unsorted_keys[3] = 16;
  unsorted_keys[4] = 26;
  unsorted_keys[5] = 34;
  unsorted_keys[6] = 36;
  unsorted_keys[7] = 24;
  unsorted_keys[8] = 15;

  sorted_keys.resize(9);
  sorted_keys[0] = 14;
  sorted_keys[1] = 16;
  sorted_keys[2] = 15;
  sorted_keys[3] = 25;
  sorted_keys[4] = 26;
  sorted_keys[5] = 24;
  sorted_keys[6] = 35;
  sorted_keys[7] = 34;
  sorted_keys[8] = 36;
}

void TestMergeSortKeySimple(void)
{
#if 0
    using Vector = thrust::device_vector<int>;
    using T = Vector::value_type;

    Vector unsorted_keys;
    Vector   sorted_keys;

    InitializeSimpleKeySortTest(unsorted_keys, sorted_keys);

    thrust::cuda_bulk::tag cuda_tag;
    thrust::system::cuda_bulk::detail::detail::stable_merge_sort(cuda_tag, unsorted_keys.begin(), unsorted_keys.end(), thrust::less<T>());

    ASSERT_EQUAL(unsorted_keys, sorted_keys);
#else
  KNOWN_FAILURE;
#endif
}
DECLARE_UNITTEST(TestMergeSortKeySimple);

void TestMergeSortKeyValueSimple(void)
{
#if 0
    using Vector = thrust::device_vector<int>;
    using T = Vector::value_type;

    Vector unsorted_keys, unsorted_values;
    Vector   sorted_keys,   sorted_values;

    InitializeSimpleKeyValueSortTest(unsorted_keys, unsorted_values, sorted_keys, sorted_values);

    thrust::cuda_bulk::tag cuda_tag;
    thrust::system::cuda_bulk::detail::detail::stable_merge_sort_by_key(cuda_tag, unsorted_keys.begin(), unsorted_keys.end(), unsorted_values.begin(), thrust::less<T>());

    ASSERT_EQUAL(unsorted_keys,   sorted_keys);
    ASSERT_EQUAL(unsorted_values, sorted_values);
#else
  KNOWN_FAILURE;
#endif
}
DECLARE_UNITTEST(TestMergeSortKeyValueSimple);

void TestMergeSortStableKeySimple(void)
{
#if 0
    using Vector = thrust::device_vector<int>;
    using T = Vector::value_type;

    Vector unsorted_keys;
    Vector   sorted_keys;

    InitializeSimpleStableKeySortTest(unsorted_keys, sorted_keys);

    thrust::cuda_bulk::tag cuda_tag;
    thrust::system::cuda_bulk::detail::detail::stable_merge_sort(cuda_tag, unsorted_keys.begin(), unsorted_keys.end(), less_div_10<T>());

    ASSERT_EQUAL(unsorted_keys,   sorted_keys);
#else
  KNOWN_FAILURE;
#endif
}
DECLARE_UNITTEST(TestMergeSortStableKeySimple);

void TestMergeSortDescendingKey(void)
{
#if 0
    const size_t n = 10027;

    thrust::host_vector<int>   h_data = unittest::random_integers<int>(n);
    thrust::device_vector<int> d_data = h_data;

    thrust::sort(h_data.begin(), h_data.end(), thrust::greater<int>());

    thrust::cuda_bulk::tag cuda_tag;
    thrust::system::cuda_bulk::detail::detail::stable_merge_sort(cuda_tag, d_data.begin(), d_data.end(), thrust::greater<int>());

    ASSERT_EQUAL(h_data, d_data);
#else
  KNOWN_FAILURE;
#endif
}
DECLARE_UNITTEST(TestMergeSortDescendingKey);

template <typename T>
void TestMergeSortAscendingKeyValue(const size_t n)
{
#if 0
    thrust::host_vector<T>   h_keys = unittest::random_integers<T>(n);
    thrust::device_vector<T> d_keys = h_keys;

    thrust::host_vector<T>   h_values = unittest::random_integers<T>(n);
    thrust::device_vector<T> d_values = h_values;

    thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin(), thrust::less<T>());

    thrust::cuda_bulk::tag cuda_tag;
    thrust::system::cuda_bulk::detail::detail::stable_merge_sort_by_key(cuda_tag, d_keys.begin(), d_keys.end(), d_values.begin(), thrust::less<T>());

    ASSERT_EQUAL(h_keys,   d_keys);
    ASSERT_EQUAL(h_values, d_values);
#else
  (void) n;
  KNOWN_FAILURE;
#endif
}
DECLARE_VARIABLE_UNITTEST(TestMergeSortAscendingKeyValue);

void TestMergeSortDescendingKeyValue(void)
{
#if 0
    const size_t n = 10027;

    thrust::host_vector<int>   h_keys = unittest::random_integers<int>(n);
    thrust::device_vector<int> d_keys = h_keys;

    thrust::host_vector<int>   h_values = unittest::random_integers<int>(n);
    thrust::device_vector<int> d_values = h_values;

    thrust::sort_by_key(h_keys.begin(), h_keys.end(), h_values.begin(), thrust::greater<int>());

    thrust::cuda_bulk::tag cuda_tag;
    thrust::system::cuda_bulk::detail::detail::stable_merge_sort_by_key(cuda_tag, d_keys.begin(), d_keys.end(), d_values.begin(), thrust::greater<int>());

    ASSERT_EQUAL(h_keys,   d_keys);
    ASSERT_EQUAL(h_values, d_values);
#else
  KNOWN_FAILURE;
#endif
}
DECLARE_UNITTEST(TestMergeSortDescendingKeyValue);

template <typename U>
void TestMergeSortKeyValue(size_t n)
{
#if 0
  using T = key_value<U,U>;

  thrust::host_vector<U> h_keys   = unittest::random_integers<U>(n);
  thrust::host_vector<U> h_values = unittest::random_integers<U>(n);

  thrust::host_vector<T> h_data(n);
  for(size_t i = 0; i < n; ++i)
  {
    h_data[i] = T(h_keys[i], h_values[i]);
  }

  thrust::device_vector<T> d_data = h_data;

  thrust::stable_sort(h_data.begin(), h_data.end());
  thrust::cuda_bulk::tag cuda_tag;
  thrust::system::cuda_bulk::detail::detail::stable_merge_sort(cuda_tag, d_data.begin(), d_data.end(), thrust::less<T>());

  ASSERT_EQUAL_QUIET(h_data, d_data);
#else
  (void) n;
  KNOWN_FAILURE;
#endif
}
DECLARE_VARIABLE_UNITTEST(TestMergeSortKeyValue);
