mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-10-05 09:59:12 +00:00
d77c5812c3
The `vtkm::worklet::Keys` object held a `SortedValuesMap` array, an `Offsets` array, a `Counts` array, and (optionally) a `UniqueKeys` array. Of these, the `Counts` array is redundant because the counts are trivially computed by subtracting adjacent entries in the offsets array. This pattern shows up a lot in VTK-m, and most places we have moved to removing the counts and just using the offsets. This change removes the `Count` array from the `Keys` object. Where the count is needed internally, adjacent offsets are subtracted. The deprecated `GetCounts` method is implemented by copying values into a new array.
95 lines
3.1 KiB
C++
95 lines
3.1 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.
|
|
//============================================================================
|
|
|
|
#include <vtkm/worklet/Keys.h>
|
|
|
|
#include <vtkm/cont/ArrayCopy.h>
|
|
|
|
#include <vtkm/cont/testing/Testing.h>
|
|
|
|
namespace
|
|
{
|
|
|
|
static constexpr vtkm::Id ARRAY_SIZE = 1033;
|
|
static constexpr vtkm::Id NUM_UNIQUE = ARRAY_SIZE / 10;
|
|
|
|
template <typename KeyPortal, typename IdPortal>
|
|
void CheckKeyReduce(const KeyPortal& originalKeys,
|
|
const KeyPortal& uniqueKeys,
|
|
const IdPortal& sortedValuesMap,
|
|
const IdPortal& offsets)
|
|
{
|
|
using KeyType = typename KeyPortal::ValueType;
|
|
vtkm::Id originalSize = originalKeys.GetNumberOfValues();
|
|
vtkm::Id uniqueSize = uniqueKeys.GetNumberOfValues();
|
|
VTKM_TEST_ASSERT(originalSize == sortedValuesMap.GetNumberOfValues(), "Inconsistent array size.");
|
|
VTKM_TEST_ASSERT(uniqueSize == offsets.GetNumberOfValues() - 1, "Inconsistent array size.");
|
|
|
|
for (vtkm::Id uniqueIndex = 0; uniqueIndex < uniqueSize; uniqueIndex++)
|
|
{
|
|
KeyType key = uniqueKeys.Get(uniqueIndex);
|
|
vtkm::Id offset = offsets.Get(uniqueIndex);
|
|
vtkm::IdComponent groupCount =
|
|
static_cast<vtkm::IdComponent>(offsets.Get(uniqueIndex + 1) - offset);
|
|
for (vtkm::IdComponent groupIndex = 0; groupIndex < groupCount; groupIndex++)
|
|
{
|
|
vtkm::Id originalIndex = sortedValuesMap.Get(offset + groupIndex);
|
|
KeyType originalKey = originalKeys.Get(originalIndex);
|
|
VTKM_TEST_ASSERT(key == originalKey, "Bad key lookup.");
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename KeyType>
|
|
void TryKeyType(KeyType)
|
|
{
|
|
KeyType keyBuffer[ARRAY_SIZE];
|
|
for (vtkm::Id index = 0; index < ARRAY_SIZE; index++)
|
|
{
|
|
keyBuffer[index] = TestValue(index % NUM_UNIQUE, KeyType());
|
|
}
|
|
|
|
vtkm::cont::ArrayHandle<KeyType> keyArray =
|
|
vtkm::cont::make_ArrayHandle(keyBuffer, ARRAY_SIZE, vtkm::CopyFlag::On);
|
|
|
|
vtkm::cont::ArrayHandle<KeyType> sortedKeys;
|
|
vtkm::cont::ArrayCopy(keyArray, sortedKeys);
|
|
|
|
vtkm::worklet::Keys<KeyType> keys(sortedKeys);
|
|
VTKM_TEST_ASSERT(keys.GetInputRange() == NUM_UNIQUE, "Keys has bad input range.");
|
|
|
|
CheckKeyReduce(keyArray.ReadPortal(),
|
|
keys.GetUniqueKeys().ReadPortal(),
|
|
keys.GetSortedValuesMap().ReadPortal(),
|
|
keys.GetOffsets().ReadPortal());
|
|
}
|
|
|
|
void TestKeys()
|
|
{
|
|
std::cout << "Testing vtkm::Id keys." << std::endl;
|
|
TryKeyType(vtkm::Id());
|
|
|
|
std::cout << "Testing vtkm::IdComponent keys." << std::endl;
|
|
TryKeyType(vtkm::IdComponent());
|
|
|
|
std::cout << "Testing vtkm::UInt8 keys." << std::endl;
|
|
TryKeyType(vtkm::UInt8());
|
|
|
|
std::cout << "Testing vtkm::Id3 keys." << std::endl;
|
|
TryKeyType(vtkm::Id3());
|
|
}
|
|
|
|
} // anonymous namespace
|
|
|
|
int UnitTestKeys(int argc, char* argv[])
|
|
{
|
|
return vtkm::cont::testing::Testing::Run(TestKeys, argc, argv);
|
|
}
|