1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
// Copyright 2009-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0
#include "../../../external/catch.hpp"
#include "../common/algorithms/parallel_partition.h"
using namespace embree;
namespace parallel_partition_unit_test {
TEST_CASE("Test parallel_partition", "[parallel_partition")
{
bool passed = true;
for (uint64_t i=0; i<100; i++)
{
/* create random permutation */
uint64_t N = std::rand() % 1000000;
std::vector<unsigned> array(N);
for (unsigned i=0; i<N; i++) array[i] = i;
for (auto& v : array) std::swap(v,array[std::rand()%array.size()]);
uint64_t split = std::rand() % (N+1);
/* perform parallel partitioning */
uint64_t left_sum = 0, right_sum = 0;
uint64_t mid = parallel_partitioning(array.data(),0,array.size(),0,left_sum,right_sum,
[&] ( uint64_t i ) { return i < split; },
[] ( uint64_t& sum, unsigned v) { sum += v; },
[] ( uint64_t& sum, uint64_t v) { sum += v; },
128);
/*serial_partitioning(array.data(),0,array.size(),left_sum,right_sum,
[&] ( uint64_t i ) { return i < split; },
[] ( uint64_t& left_sum, int v) { left_sum += v; });*/
/* verify result */
passed &= mid == split;
passed &= left_sum == split*(split-1)/2;
passed &= right_sum == N*(N-1)/2-left_sum;
for (uint64_t i=0; i<split; i++) passed &= array[i] < split;
for (uint64_t i=split; i<N; i++) passed &= array[i] >= split;
}
REQUIRE(passed);
}
}
|
