mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-09-19 18:45:43 +00:00
119 lines
4.6 KiB
C++
119 lines
4.6 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 2014 Sandia Corporation.
|
|
// Copyright 2014 UT-Battelle, LLC.
|
|
// Copyright 2014 Los Alamos National Security.
|
|
//
|
|
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
|
|
// 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.
|
|
//============================================================================
|
|
#ifndef vtk_m_worklet_AverageByKey_h
|
|
#define vtk_m_worklet_AverageByKey_h
|
|
|
|
#include <vtkm/cont/DeviceAdapter.h>
|
|
#include <vtkm/cont/ArrayHandle.h>
|
|
#include <vtkm/cont/ArrayHandleCounting.h>
|
|
#include <vtkm/cont/ArrayHandlePermutation.h>
|
|
#include <vtkm/cont/ArrayHandleZip.h>
|
|
|
|
#include <vtkm/cont/DynamicArrayHandle.h>
|
|
#include <vtkm/cont/Timer.h>
|
|
#include <vtkm/Pair.h>
|
|
#include <vtkm/Types.h>
|
|
#include <vtkm/worklet/DispatcherMapField.h>
|
|
#include <vtkm/worklet/WorkletMapField.h>
|
|
#include <vtkm/cont/DeviceAdapterAlgorithm.h>
|
|
#include <vtkm/cont/ArrayHandleConstant.h>
|
|
#include <vtkm/cont/ArrayHandleCompositeVector.h>
|
|
|
|
namespace vtkm {
|
|
namespace worklet {
|
|
namespace internal {
|
|
|
|
template <class ValueType>
|
|
struct DivideWorklet: public vtkm::worklet::WorkletMapField{
|
|
typedef void ControlSignature(FieldIn<>, FieldIn<>, FieldOut<>);
|
|
typedef void ExecutionSignature(_1, _2, _3);
|
|
|
|
VTKM_EXEC_EXPORT void operator()(
|
|
const ValueType &v, vtkm::Id &count, ValueType &vout) const
|
|
{ vout = v * (1./count); }
|
|
};
|
|
|
|
|
|
template <class KeyType, class ValueType, class DeviceAdapter>
|
|
void AverageByKey( const vtkm::cont::ArrayHandle<KeyType> &keyArray,
|
|
const vtkm::cont::ArrayHandle<ValueType> &valueArray,
|
|
vtkm::cont::ArrayHandle<KeyType> &outputKeyArray,
|
|
vtkm::cont::ArrayHandle<ValueType> &outputValueArray)
|
|
{
|
|
typedef vtkm::cont::ArrayHandle<ValueType> ValueArray;
|
|
typedef vtkm::cont::ArrayHandle<vtkm::Id> IdArray;
|
|
typedef vtkm::cont::DeviceAdapterAlgorithm<DeviceAdapter> Algorithm;
|
|
|
|
// sort the indexed array
|
|
vtkm::cont::ArrayHandleCounting<vtkm::Id> indexArray(0, keyArray.GetNumberOfValues());
|
|
IdArray indexArraySorted;
|
|
vtkm::cont::ArrayHandle<KeyType> keyArraySorted;
|
|
|
|
Algorithm::Copy( keyArray, keyArraySorted ); // keep the input key array unchanged
|
|
Algorithm::Copy( indexArray, indexArraySorted );
|
|
Algorithm::SortByKey( keyArraySorted, indexArraySorted, std::less<KeyType>() ) ;
|
|
|
|
// generate permultation array based on the indexes
|
|
typedef vtkm::cont::ArrayHandlePermutation<IdArray, ValueArray > PermutatedValueArray;
|
|
PermutatedValueArray valueArraySorted = vtkm::cont::make_ArrayHandlePermutation( indexArraySorted, valueArray );
|
|
|
|
// reduce by key
|
|
typedef vtkm::cont::ArrayHandleConstant<vtkm::Id> ConstIdArray;
|
|
ConstIdArray constOneArray(1, valueArray.GetNumberOfValues());
|
|
IdArray countArray;
|
|
ValueArray sumArray;
|
|
#if 0 // reduce twice
|
|
vtkm::cont::DeviceAdapterAlgorithm<DeviceAdapter>::ReduceByKey(
|
|
keyArraySorted, valueArraySorted,
|
|
outputKeyArray, sumArray,
|
|
vtkm::internal::Add() );
|
|
vtkm::cont::DeviceAdapterAlgorithm<DeviceAdapter>::ReduceByKey(
|
|
keyArraySorted, constOneArray,
|
|
outputKeyArray, countArray,
|
|
vtkm::internal::Add() );
|
|
|
|
#else // use zip
|
|
vtkm::cont::ArrayHandleZip< PermutatedValueArray, ConstIdArray > inputZipHandle(valueArraySorted, constOneArray);
|
|
vtkm::cont::ArrayHandleZip< ValueArray, IdArray > outputZipHandle(sumArray, countArray);
|
|
|
|
Algorithm::ReduceByKey( keyArraySorted, inputZipHandle,
|
|
outputKeyArray, outputZipHandle,
|
|
vtkm::internal::Add() );
|
|
#endif
|
|
|
|
// get average
|
|
DispatcherMapField<DivideWorklet<ValueType> >().Invoke(
|
|
sumArray, countArray, outputValueArray);
|
|
|
|
}
|
|
|
|
template <class KeyType, class ValueType>
|
|
void AverageByKey( const vtkm::cont::ArrayHandle<KeyType> &keyArray,
|
|
const vtkm::cont::ArrayHandle<ValueType> &valueArray,
|
|
vtkm::cont::ArrayHandle<KeyType> &outputKeyArray,
|
|
vtkm::cont::ArrayHandle<ValueType> &outputValueArray)
|
|
{
|
|
AverageByKey<KeyType, ValueType, VTKM_DEFAULT_DEVICE_ADAPTER_TAG> (keyArray, valueArray, outputKeyArray, outputValueArray);
|
|
}
|
|
|
|
}}} // vtkm::worklet:internal
|
|
|
|
#endif //vtk_m_worklet_AverageByKey_h
|