summaryrefslogtreecommitdiff
path: root/thirdparty/embree-aarch64/common/algorithms/parallel_map.cpp
blob: 09dc303f81460984a3e446d529c31633d7d03458 (plain)
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-2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0

#include "parallel_map.h"
#include "../sys/regression.h"

namespace embree
{
  struct parallel_map_regression_test : public RegressionTest
  {
    parallel_map_regression_test(const char* name) : RegressionTest(name) {
      registerRegressionTest(this);
    }
    
    bool run ()
    {
      bool passed = true;

      /* create key/value vectors with random numbers */
      const size_t N = 10000;
      std::vector<uint32_t> keys(N);
      std::vector<uint32_t> vals(N);
      for (size_t i=0; i<N; i++) keys[i] = 2*unsigned(i)*647382649;
      for (size_t i=0; i<N; i++) std::swap(keys[i],keys[rand()%N]);
      for (size_t i=0; i<N; i++) vals[i] = 2*rand();
      
      /* create map */
      parallel_map<uint32_t,uint32_t> map;
      map.init(keys,vals);

      /* check that all keys are properly mapped */
      for (size_t i=0; i<N; i++) {
        const uint32_t* val = map.lookup(keys[i]);
        passed &= val && (*val == vals[i]);
      }

      /* check that these keys are not in the map */
      for (size_t i=0; i<N; i++) {
        passed &= !map.lookup(keys[i]+1);
      }

      return passed;
    }
  };

  parallel_map_regression_test parallel_map_regression("parallel_map_regression_test");
}