e955c94ed3
Listing the "Blender Foundation" as copyright holder implied the Blender Foundation holds copyright to files which may include work from many developers. While keeping copyright on headers makes sense for isolated libraries, Blender's own code may be refactored or moved between files in a way that makes the per file copyright holders less meaningful. Copyright references to the "Blender Foundation" have been replaced with "Blender Authors", with the exception of `./extern/` since these this contains libraries which are more isolated, any changed to license headers there can be handled on a case-by-case basis. Some directories in `./intern/` have also been excluded: - `./intern/cycles/` it's own `AUTHORS` file is planned. - `./intern/opensubdiv/`. An "AUTHORS" file has been added, using the chromium projects authors file as a template. Design task: #110784 Ref !110783.
94 lines
2.6 KiB
C++
94 lines
2.6 KiB
C++
/* SPDX-FileCopyrightText: 2023 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#pragma once
|
|
|
|
/** \file
|
|
* \ingroup bli
|
|
*
|
|
* Generic algorithms for finding the largest and smallest elements in a span.
|
|
*/
|
|
|
|
#include <optional>
|
|
|
|
#include "BLI_bounds_types.hh"
|
|
#include "BLI_math_vector.hh"
|
|
#include "BLI_task.hh"
|
|
|
|
namespace blender::bounds {
|
|
|
|
template<typename T> [[nodiscard]] inline Bounds<T> merge(const Bounds<T> &a, const Bounds<T> &b)
|
|
{
|
|
return {math::min(a.min, b.min), math::max(a.max, b.max)};
|
|
}
|
|
|
|
template<typename T>
|
|
[[nodiscard]] inline std::optional<Bounds<T>> merge(const std::optional<Bounds<T>> &a,
|
|
const std::optional<Bounds<T>> &b)
|
|
{
|
|
if (a.has_value() && b.has_value()) {
|
|
return merge(*a, *b);
|
|
}
|
|
if (a.has_value()) {
|
|
return a;
|
|
}
|
|
if (b.has_value()) {
|
|
return b;
|
|
}
|
|
return std::nullopt;
|
|
}
|
|
|
|
/**
|
|
* Find the smallest and largest values element-wise in the span.
|
|
*/
|
|
template<typename T> [[nodiscard]] inline std::optional<Bounds<T>> min_max(const Span<T> values)
|
|
{
|
|
if (values.is_empty()) {
|
|
return std::nullopt;
|
|
}
|
|
const Bounds<T> init{values.first(), values.first()};
|
|
return threading::parallel_reduce(
|
|
values.index_range(),
|
|
1024,
|
|
init,
|
|
[&](const IndexRange range, const Bounds<T> &init) {
|
|
Bounds<T> result = init;
|
|
for (const int i : range) {
|
|
math::min_max(values[i], result.min, result.max);
|
|
}
|
|
return result;
|
|
},
|
|
[](const Bounds<T> &a, const Bounds<T> &b) { return merge(a, b); });
|
|
}
|
|
|
|
/**
|
|
* Find the smallest and largest values element-wise in the span, adding the radius to each element
|
|
* first. The template type T is expected to have an addition operator implemented with RadiusT.
|
|
*/
|
|
template<typename T, typename RadiusT>
|
|
[[nodiscard]] inline std::optional<Bounds<T>> min_max_with_radii(const Span<T> values,
|
|
const Span<RadiusT> radii)
|
|
{
|
|
BLI_assert(values.size() == radii.size());
|
|
if (values.is_empty()) {
|
|
return std::nullopt;
|
|
}
|
|
const Bounds<T> init{values.first(), values.first()};
|
|
return threading::parallel_reduce(
|
|
values.index_range(),
|
|
1024,
|
|
init,
|
|
[&](const IndexRange range, const Bounds<T> &init) {
|
|
Bounds<T> result = init;
|
|
for (const int i : range) {
|
|
result.min = math::min(values[i] - radii[i], result.min);
|
|
result.max = math::max(values[i] + radii[i], result.max);
|
|
}
|
|
return result;
|
|
},
|
|
[](const Bounds<T> &a, const Bounds<T> &b) { return merge(a, b); });
|
|
}
|
|
|
|
} // namespace blender::bounds
|