summaryrefslogtreecommitdiffstats
path: root/thirdparty/embree-aarch64/common/algorithms/parallel_set.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'thirdparty/embree-aarch64/common/algorithms/parallel_set.cpp')
-rw-r--r--thirdparty/embree-aarch64/common/algorithms/parallel_set.cpp43
1 files changed, 43 insertions, 0 deletions
diff --git a/thirdparty/embree-aarch64/common/algorithms/parallel_set.cpp b/thirdparty/embree-aarch64/common/algorithms/parallel_set.cpp
new file mode 100644
index 0000000000..20b639c1c9
--- /dev/null
+++ b/thirdparty/embree-aarch64/common/algorithms/parallel_set.cpp
@@ -0,0 +1,43 @@
+// Copyright 2009-2020 Intel Corporation
+// SPDX-License-Identifier: Apache-2.0
+
+#include "parallel_set.h"
+#include "../sys/regression.h"
+
+namespace embree
+{
+ struct parallel_set_regression_test : public RegressionTest
+ {
+ parallel_set_regression_test(const char* name) : RegressionTest(name) {
+ registerRegressionTest(this);
+ }
+
+ bool run ()
+ {
+ bool passed = true;
+
+ /* create vector with random numbers */
+ const size_t N = 10000;
+ std::vector<uint32_t> unsorted(N);
+ for (size_t i=0; i<N; i++) unsorted[i] = 2*rand();
+
+ /* created set from numbers */
+ parallel_set<uint32_t> sorted;
+ sorted.init(unsorted);
+
+ /* check that all elements are in the set */
+ for (size_t i=0; i<N; i++) {
+ passed &= sorted.lookup(unsorted[i]);
+ }
+
+ /* check that these elements are not in the set */
+ for (size_t i=0; i<N; i++) {
+ passed &= !sorted.lookup(unsorted[i]+1);
+ }
+
+ return passed;
+ }
+ };
+
+ parallel_set_regression_test parallel_set_regression("parallel_set_regression_test");
+}