63050f68fc
The `MultiBlock` class has been renamed to `PartitionedDataSet`, and its API has been refactored to refer to "partitions", rather than "blocks". Additionally, the `AddBlocks` method has been changed to `AppendPartitions` to more accurately reflect the operation performed. The associated `AssignerMultiBlock` class has also been renamed to `AssignerPartitionedDataSet`. This change is motivated towards unifying VTK-m's data model with VTK. VTK has started to move away from `vtkMultiBlockDataSet`, which is a hierarchical tree of nested datasets, to `vtkPartitionedDataSet`, which is always a flat vector of datasets used to assist geometry distribution in multi-process environments. This simplifies traversal during processing and clarifies the intent of the container: The component datasets are partitions for distribution, not organizational groupings (e.g. materials). Ref #405
87 lines
2.6 KiB
C++
87 lines
2.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.
|
|
//============================================================================
|
|
#ifndef vtk_m_cont_FieldRangeCompute_hxx
|
|
#define vtk_m_cont_FieldRangeCompute_hxx
|
|
|
|
#include <vtkm/cont/ArrayHandle.h>
|
|
#include <vtkm/cont/DataSet.h>
|
|
#include <vtkm/cont/PartitionedDataSet.h>
|
|
|
|
#include <vtkm/Range.h>
|
|
|
|
#include <numeric> // for std::accumulate
|
|
|
|
namespace vtkm
|
|
{
|
|
namespace cont
|
|
{
|
|
namespace detail
|
|
{
|
|
|
|
template <typename TypeList>
|
|
VTKM_CONT vtkm::cont::ArrayHandle<vtkm::Range> FieldRangeComputeImpl(
|
|
const vtkm::cont::DataSet& dataset,
|
|
const std::string& name,
|
|
vtkm::cont::Field::Association assoc,
|
|
TypeList)
|
|
{
|
|
vtkm::cont::Field field;
|
|
try
|
|
{
|
|
field = dataset.GetField(name, assoc);
|
|
}
|
|
catch (vtkm::cont::ErrorBadValue&)
|
|
{
|
|
// field missing, return empty range.
|
|
return vtkm::cont::ArrayHandle<vtkm::Range>();
|
|
}
|
|
|
|
return field.GetRange(TypeList());
|
|
}
|
|
|
|
template <typename TypeList>
|
|
VTKM_CONT vtkm::cont::ArrayHandle<vtkm::Range> FieldRangeComputeImpl(
|
|
const vtkm::cont::PartitionedDataSet& pds,
|
|
const std::string& name,
|
|
vtkm::cont::Field::Association assoc,
|
|
TypeList)
|
|
{
|
|
std::vector<vtkm::Range> result_vector = std::accumulate(
|
|
pds.begin(),
|
|
pds.end(),
|
|
std::vector<vtkm::Range>(),
|
|
[&](const std::vector<vtkm::Range>& accumulated_value, const vtkm::cont::DataSet& dataset) {
|
|
vtkm::cont::ArrayHandle<vtkm::Range> partition_range =
|
|
vtkm::cont::detail::FieldRangeComputeImpl(dataset, name, assoc, TypeList());
|
|
|
|
std::vector<vtkm::Range> result = accumulated_value;
|
|
|
|
// if the current partition has more components than we have seen so far,
|
|
// resize the result to fit all components.
|
|
result.resize(
|
|
std::max(result.size(), static_cast<size_t>(partition_range.GetNumberOfValues())));
|
|
|
|
auto portal = partition_range.GetPortalConstControl();
|
|
std::transform(vtkm::cont::ArrayPortalToIteratorBegin(portal),
|
|
vtkm::cont::ArrayPortalToIteratorEnd(portal),
|
|
result.begin(),
|
|
result.begin(),
|
|
std::plus<vtkm::Range>());
|
|
return result;
|
|
});
|
|
|
|
return vtkm::cont::make_ArrayHandle(result_vector, vtkm::CopyFlag::On);
|
|
}
|
|
}
|
|
}
|
|
} // namespace vtkm::cont::detail
|
|
|
|
#endif
|