mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-09-20 02:55:47 +00:00
c3a3184d51
Sandia National Laboratories recently changed management from the Sandia Corporation to the National Technology & Engineering Solutions of Sandia, LLC (NTESS). The copyright statements need to be updated accordingly.
88 lines
2.7 KiB
C++
88 lines
2.7 KiB
C++
//============================================================================
|
|
// Copyright (c) Kitware, Inc.
|
|
// All rights reserved.
|
|
// See LICENSE.txt for details.
|
|
// This software is distributed WITHOUT ANY WARRANTY; without even
|
|
// the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
|
|
// PURPOSE. See the above copyright notice for more information.
|
|
//
|
|
// Copyright 2017 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
|
|
// Copyright 2017 UT-Battelle, LLC.
|
|
// Copyright 2017 Los Alamos National Security.
|
|
//
|
|
// Under the terms of Contract DE-NA0003525 with NTESS,
|
|
// the U.S. Government retains certain rights in this software.
|
|
//
|
|
// Under the terms of Contract DE-AC52-06NA25396 with Los Alamos National
|
|
// Laboratory (LANL), the U.S. Government retains certain rights in
|
|
// this software.
|
|
//============================================================================
|
|
|
|
#include <vtkm/Hash.h>
|
|
|
|
#include <vtkm/testing/Testing.h>
|
|
|
|
#include <algorithm>
|
|
#include <vector>
|
|
|
|
namespace
|
|
{
|
|
|
|
VTKM_CONT
|
|
static void CheckUnique(std::vector<vtkm::HashType> hashes)
|
|
{
|
|
std::sort(hashes.begin(), hashes.end());
|
|
|
|
for (std::size_t index = 1; index < hashes.size(); ++index)
|
|
{
|
|
VTKM_TEST_ASSERT(hashes[index - 1] != hashes[index], "Found duplicate hashes.");
|
|
}
|
|
}
|
|
|
|
template <typename VecType>
|
|
VTKM_CONT static void DoHashTest(VecType&&)
|
|
{
|
|
std::cout << "Test hash for " << vtkm::testing::TypeName<VecType>::Name() << std::endl;
|
|
|
|
const vtkm::Id NUM_HASHES = 100;
|
|
std::cout << " Make sure the first " << NUM_HASHES << " values are unique." << std::endl;
|
|
// There is a small probability that two values of these 100 could be the same. If this test
|
|
// fails we could just be unlucky (and have to use a different set of 100 hashes), but it is
|
|
// suspicious and you should double check the hashes.
|
|
std::vector<vtkm::HashType> hashes;
|
|
hashes.reserve(NUM_HASHES);
|
|
for (vtkm::Id index = 0; index < NUM_HASHES; ++index)
|
|
{
|
|
hashes.push_back(vtkm::Hash(TestValue(index, VecType())));
|
|
}
|
|
CheckUnique(hashes);
|
|
|
|
std::cout << " Try close values that should have different hashes." << std::endl;
|
|
hashes.clear();
|
|
VecType vec = TestValue(5, VecType());
|
|
hashes.push_back(vtkm::Hash(vec));
|
|
vec[0] = vec[0] + 1;
|
|
hashes.push_back(vtkm::Hash(vec));
|
|
vec[1] = vec[1] - 1;
|
|
hashes.push_back(vtkm::Hash(vec));
|
|
CheckUnique(hashes);
|
|
}
|
|
|
|
VTKM_CONT
|
|
static void TestHash()
|
|
{
|
|
DoHashTest(vtkm::Id2());
|
|
DoHashTest(vtkm::Id3());
|
|
DoHashTest(vtkm::Vec<vtkm::Id, 10>());
|
|
DoHashTest(vtkm::Vec<vtkm::IdComponent, 2>());
|
|
DoHashTest(vtkm::Vec<vtkm::IdComponent, 3>());
|
|
DoHashTest(vtkm::Vec<vtkm::IdComponent, 10>());
|
|
}
|
|
|
|
} // anonymous namespace
|
|
|
|
int UnitTestHash(int, char* [])
|
|
{
|
|
return vtkm::testing::Testing::Run(TestHash);
|
|
}
|