2019-09-27 14:12:22 +02:00
|
|
|
/* ========================================================================= *
|
|
|
|
|
* *
|
|
|
|
|
* OpenMesh *
|
|
|
|
|
* Copyright (c) 2001-2019, RWTH-Aachen University *
|
|
|
|
|
* Department of Computer Graphics and Multimedia *
|
|
|
|
|
* All rights reserved. *
|
|
|
|
|
* www.openmesh.org *
|
|
|
|
|
* *
|
|
|
|
|
*---------------------------------------------------------------------------*
|
|
|
|
|
* This file is part of OpenMesh. *
|
|
|
|
|
*---------------------------------------------------------------------------*
|
|
|
|
|
* *
|
|
|
|
|
* Redistribution and use in source and binary forms, with or without *
|
|
|
|
|
* modification, are permitted provided that the following conditions *
|
|
|
|
|
* are met: *
|
|
|
|
|
* *
|
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice, *
|
|
|
|
|
* this list of conditions and the following disclaimer. *
|
|
|
|
|
* *
|
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright *
|
|
|
|
|
* notice, this list of conditions and the following disclaimer in the *
|
|
|
|
|
* documentation and/or other materials provided with the distribution. *
|
|
|
|
|
* *
|
|
|
|
|
* 3. Neither the name of the copyright holder nor the names of its *
|
|
|
|
|
* contributors may be used to endorse or promote products derived from *
|
|
|
|
|
* this software without specific prior written permission. *
|
|
|
|
|
* *
|
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS *
|
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *
|
|
|
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A *
|
|
|
|
|
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *
|
|
|
|
|
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, *
|
|
|
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, *
|
|
|
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR *
|
|
|
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF *
|
|
|
|
|
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING *
|
|
|
|
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS *
|
|
|
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
|
|
|
|
|
* *
|
|
|
|
|
* ========================================================================= */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
|
|
#include <utility>
|
2019-09-27 16:34:20 +02:00
|
|
|
#include <array>
|
|
|
|
|
#include <vector>
|
2019-09-27 14:12:22 +02:00
|
|
|
|
|
|
|
|
//== NAMESPACES ===============================================================
|
|
|
|
|
|
|
|
|
|
namespace OpenMesh {
|
|
|
|
|
|
|
|
|
|
//== FORWARD DECLARATION ======================================================
|
|
|
|
|
|
|
|
|
|
//== CLASS DEFINITION =========================================================
|
|
|
|
|
|
2019-09-27 16:34:20 +02:00
|
|
|
namespace {
|
|
|
|
|
|
|
|
|
|
struct Identity
|
|
|
|
|
{
|
|
|
|
|
template <typename T>
|
|
|
|
|
T operator()(const T& _t) const { return _t; }
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
2019-09-27 14:12:22 +02:00
|
|
|
/// Base class for all smart range types
|
|
|
|
|
template <typename RangeT, typename HandleT>
|
|
|
|
|
struct SmartRangeT
|
|
|
|
|
{
|
|
|
|
|
// TODO: Someone with better c++ knowledge may improve the code below.
|
|
|
|
|
|
2019-09-27 16:34:20 +02:00
|
|
|
|
|
|
|
|
|
2019-09-27 14:12:22 +02:00
|
|
|
template <typename Functor>
|
2019-09-27 14:45:20 +02:00
|
|
|
auto sum(Functor&& f) -> decltype (f(std::declval<HandleT>())+f(std::declval<HandleT>()))
|
2019-09-27 14:12:22 +02:00
|
|
|
{
|
|
|
|
|
auto range = static_cast<const RangeT*>(this);
|
|
|
|
|
auto begin = range->begin();
|
|
|
|
|
auto end = range->end();
|
|
|
|
|
assert(begin != end);
|
|
|
|
|
decltype (f(*begin) + f(*begin)) sum = f(*begin);
|
|
|
|
|
auto it = begin;
|
|
|
|
|
++it;
|
|
|
|
|
for (; it != end; ++it)
|
|
|
|
|
sum += f(*it);
|
|
|
|
|
return sum;
|
|
|
|
|
}
|
|
|
|
|
|
2019-09-27 14:45:20 +02:00
|
|
|
template <typename Functor>
|
|
|
|
|
auto avg(Functor&& f) -> decltype (1.0 * (f(std::declval<HandleT>())+f(std::declval<HandleT>())))
|
|
|
|
|
{
|
|
|
|
|
auto range = static_cast<const RangeT*>(this);
|
|
|
|
|
auto begin = range->begin();
|
|
|
|
|
auto end = range->end();
|
|
|
|
|
assert(begin != end);
|
|
|
|
|
decltype (f(*begin) + f(*begin)) sum = f(*begin);
|
|
|
|
|
auto it = begin;
|
|
|
|
|
++it;
|
|
|
|
|
int n_elements = 1;
|
|
|
|
|
for (; it != end; ++it)
|
|
|
|
|
{
|
|
|
|
|
sum += f(*it);
|
|
|
|
|
++n_elements;
|
|
|
|
|
}
|
|
|
|
|
return (1.0 / n_elements) * sum;
|
|
|
|
|
}
|
|
|
|
|
|
2019-09-27 16:34:20 +02:00
|
|
|
template <int n, typename Functor = Identity>
|
|
|
|
|
auto to_array(Functor&& f = {}) -> std::array<typename std::remove_reference<decltype (f(std::declval<HandleT>()))>::type, n>
|
|
|
|
|
{
|
|
|
|
|
auto range = static_cast<const RangeT*>(this);
|
|
|
|
|
std::array<typename std::remove_reference<decltype (f(std::declval<HandleT>()))>::type, n> res;
|
|
|
|
|
auto it = range->begin();
|
|
|
|
|
auto end = range->end();
|
|
|
|
|
int i = 0;
|
|
|
|
|
while (i < n && it != end)
|
|
|
|
|
res[i++] = f(*(it++));
|
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
template <typename Functor = Identity>
|
|
|
|
|
auto to_vector(Functor&& f = {}) -> std::vector<typename std::remove_reference<decltype (f(std::declval<HandleT>()))>::type>
|
|
|
|
|
{
|
|
|
|
|
auto range = static_cast<const RangeT*>(this);
|
|
|
|
|
std::vector<typename std::remove_reference<decltype (f(std::declval<HandleT>()))>::type> res;
|
|
|
|
|
for (auto e : *range)
|
|
|
|
|
res.push_back(f(e));
|
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
template <int n, typename Functor>
|
|
|
|
|
auto elem_wise_min(Functor&& f) -> typename std::remove_reference<decltype (f(std::declval<HandleT>()))>::type
|
|
|
|
|
{
|
|
|
|
|
auto range = static_cast<const RangeT*>(this);
|
|
|
|
|
auto it = range->begin();
|
|
|
|
|
auto end = range->end();
|
|
|
|
|
assert(it != end);
|
|
|
|
|
|
|
|
|
|
typename std::remove_reference<decltype (f(std::declval<HandleT>()))>::type min = f(*it);
|
|
|
|
|
++it;
|
|
|
|
|
|
|
|
|
|
for (; it != end; ++it)
|
|
|
|
|
{
|
|
|
|
|
const auto& tmp = f(*it);
|
|
|
|
|
for (int i = 0; i < n; ++i)
|
|
|
|
|
min[i] = std::min(min[i], tmp[i]);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return min;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
template <int n, typename Functor>
|
|
|
|
|
auto elem_wise_max(Functor&& f) -> typename std::remove_reference<decltype (f(std::declval<HandleT>()))>::type
|
|
|
|
|
{
|
|
|
|
|
auto range = static_cast<const RangeT*>(this);
|
|
|
|
|
auto it = range->begin();
|
|
|
|
|
auto end = range->end();
|
|
|
|
|
assert(it != end);
|
|
|
|
|
|
|
|
|
|
typename std::remove_reference<decltype (f(std::declval<HandleT>()))>::type max = f(*it);
|
|
|
|
|
++it;
|
|
|
|
|
|
|
|
|
|
for (; it != end; ++it)
|
|
|
|
|
{
|
|
|
|
|
const auto& tmp = f(*it);
|
|
|
|
|
for (int i = 0; i < n; ++i)
|
|
|
|
|
max[i] = std::max(max[i], tmp[i]);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return max;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2019-09-27 14:45:20 +02:00
|
|
|
|
|
|
|
|
|
2019-09-27 14:12:22 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
|
} // namespace OpenMesh
|
|
|
|
|
//=============================================================================
|
|
|
|
|
|
|
|
|
|
//=============================================================================
|