Files
igl/external/embree/kernels/algorithms/pmap.cpp
T

69 lines
2.3 KiB
C++
Executable File

// ======================================================================== //
// Copyright 2009-2014 Intel Corporation //
// //
// Licensed under the Apache License, Version 2.0 (the "License"); //
// you may not use this file except in compliance with the License. //
// You may obtain a copy of the License at //
// //
// http://www.apache.org/licenses/LICENSE-2.0 //
// //
// Unless required by applicable law or agreed to in writing, software //
// distributed under the License is distributed on an "AS IS" BASIS, //
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. //
// See the License for the specific language governing permissions and //
// limitations under the License. //
// ======================================================================== //
#include "pmap.h"
namespace embree
{
struct pmap_regression_test : public RegressionTest
{
pmap_regression_test(const char* name) : name(name) {
registerRegressionTest(this);
}
bool operator() ()
{
bool passed = true;
printf("%s::%s ... ",TOSTRING(isa),name);
fflush(stdout);
/* create key/value vectors with random numbers */
const size_t N = 10000;
std::vector<uint32> keys(N);
std::vector<uint32> vals(N);
for (size_t i=0; i<N; i++) {
keys[i] = 2*rand();
vals[i] = 2*rand();
}
/* create map */
pmap<uint32,uint32> map;
map.init(keys,vals);
/* check that all keys are properly mapped */
for (size_t i=0; i<N; i++) {
const uint32* 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);
}
/* output if test passed or not */
if (passed) printf("[passed]\n");
else printf("[failed]\n");
return passed;
}
const char* name;
};
pmap_regression_test pmap_regression("pmap_regression_test");
}