Update tests to pass the right hasnan value

Author: Raghuveer Devulapalli

tests/test-qsort.cpp

@@ -29,13 +29,14 @@ TYPED_TEST_SUITE_P(simdsort);
 TYPED_TEST_P(simdsort, test_qsort)
 {
     for (auto type : this->arrtype) {
+        bool hasnan = (type == "rand_with_nan") ? true : false;
         for (auto size : this->arrsize) {
             std::vector<TypeParam> arr = get_array<TypeParam>(type, size);
             std::vector<TypeParam> sortedarr = arr;
             std::sort(sortedarr.begin(),
                       sortedarr.end(),
                       compare<TypeParam, std::less<TypeParam>>());
-            x86simdsort::qsort(arr.data(), arr.size());
+            x86simdsort::qsort(arr.data(), arr.size(), hasnan);
             IS_SORTED(sortedarr, arr, type);
             arr.clear();
             sortedarr.clear();
@@ -46,13 +47,14 @@ TYPED_TEST_P(simdsort, test_qsort)
 TYPED_TEST_P(simdsort, test_argsort)
 {
     for (auto type : this->arrtype) {
+        bool hasnan = (type == "rand_with_nan") ? true : false;
         for (auto size : this->arrsize) {
             std::vector<TypeParam> arr = get_array<TypeParam>(type, size);
             std::vector<TypeParam> sortedarr = arr;
             std::sort(sortedarr.begin(),
                       sortedarr.end(),
                       compare<TypeParam, std::less<TypeParam>>());
-            auto arg = x86simdsort::argsort(arr.data(), arr.size());
+            auto arg = x86simdsort::argsort(arr.data(), arr.size(), hasnan);
             IS_ARG_SORTED(sortedarr, arr, arg, type);
             arr.clear();
             arg.clear();
@@ -63,6 +65,7 @@ TYPED_TEST_P(simdsort, test_argsort)
 TYPED_TEST_P(simdsort, test_qselect)
 {
     for (auto type : this->arrtype) {
+        bool hasnan = (type == "rand_with_nan") ? true : false;
         for (auto size : this->arrsize) {
             size_t k = rand() % size;
             std::vector<TypeParam> arr = get_array<TypeParam>(type, size);
@@ -71,7 +74,7 @@ TYPED_TEST_P(simdsort, test_qselect)
                              sortedarr.begin() + k,
                              sortedarr.end(),
                              compare<TypeParam, std::less<TypeParam>>());
-            x86simdsort::qselect(arr.data(), k, arr.size(), true);
+            x86simdsort::qselect(arr.data(), k, arr.size(), hasnan);
             IS_ARR_PARTITIONED(arr, k, sortedarr[k], type);
             arr.clear();
             sortedarr.clear();
@@ -82,15 +85,15 @@ TYPED_TEST_P(simdsort, test_qselect)
 TYPED_TEST_P(simdsort, test_argselect)
 {
     for (auto type : this->arrtype) {
+        bool hasnan = (type == "rand_with_nan") ? true : false;
         for (auto size : this->arrsize) {
             size_t k = rand() % size;
             std::vector<TypeParam> arr = get_array<TypeParam>(type, size);
             std::vector<TypeParam> sortedarr = arr;
             std::sort(sortedarr.begin(),
                       sortedarr.end(),
                       compare<TypeParam, std::less<TypeParam>>());
-            auto arg = x86simdsort::argselect(arr.data(), k, arr.size());
-            auto arg1 = x86simdsort::argsort(arr.data(), arr.size());
+            auto arg = x86simdsort::argselect(arr.data(), k, arr.size(), hasnan);
             IS_ARG_PARTITIONED(arr, arg, sortedarr[k], k, type);
             arr.clear();
             sortedarr.clear();
@@ -101,6 +104,7 @@ TYPED_TEST_P(simdsort, test_argselect)
 TYPED_TEST_P(simdsort, test_partial_qsort)
 {
     for (auto type : this->arrtype) {
+        bool hasnan = (type == "rand_with_nan") ? true : false;
         for (auto size : this->arrsize) {
             // k should be at least 1
             size_t k = std::max((size_t)1, rand() % size);
@@ -109,7 +113,7 @@ TYPED_TEST_P(simdsort, test_partial_qsort)
             std::sort(sortedarr.begin(),
                       sortedarr.end(),
                       compare<TypeParam, std::less<TypeParam>>());
-            x86simdsort::partial_qsort(arr.data(), k, arr.size(), true);
+            x86simdsort::partial_qsort(arr.data(), k, arr.size(), hasnan);
             IS_ARR_PARTIALSORTED(arr, k, sortedarr, type);
             arr.clear();
             sortedarr.clear();