File: parallel_set.cpp

package info (click to toggle)
embree 3.13.5%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 27,924 kB
  • sloc: cpp: 180,815; xml: 3,877; ansic: 2,957; python: 1,466; sh: 502; makefile: 229; csh: 42
file content (37 lines) | stat: -rw-r--r-- 837 bytes parent folder | download | duplicates (2)
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
// Copyright 2009-2021 Intel Corporation
// SPDX-License-Identifier: Apache-2.0

#include "../../../external/catch.hpp"
#include "../common/algorithms/parallel_set.h"

using namespace embree;

namespace parallel_set_unit_test {

TEST_CASE("Test parallel_set", "[parallel_set]")
{
  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);
  }

  REQUIRE(passed);
}

}