FM / detail

/usr/include/boost/histogram/detail

Name	Size	Mode	Actions
accumulator_traits.hpp	2812	0644	edit dl rm
args_type.hpp	1546	0644	edit dl rm
argument_traits.hpp	2548	0644	edit dl rm
array_wrapper.hpp	2050	0644	edit dl rm
axes.hpp	13362	0644	edit dl rm
common_type.hpp	1335	0644	edit dl rm
convert_integer.hpp	566	0644	edit dl rm
counting_streambuf.hpp	1923	0644	edit dl rm
detect.hpp	8320	0644	edit dl rm
fill.hpp	12609	0644	edit dl rm
fill_n.hpp	13696	0644	edit dl rm
index_translator.hpp	3437	0644	edit dl rm
iterator_adaptor.hpp	4484	0644	edit dl rm
large_int.hpp	6543	0644	edit dl rm
limits.hpp	986	0644	edit dl rm
linearize.hpp	4482	0644	edit dl rm
make_default.hpp	710	0644	edit dl rm
mutex_base.hpp	1228	0644	edit dl rm
nonmember_container_access.hpp	1448	0644	edit dl rm
operators.hpp	4494	0644	edit dl rm
optional_index.hpp	1426	0644	edit dl rm
priority.hpp	593	0644	edit dl rm
reduce_command.hpp	2541	0644	edit dl rm
relaxed_equal.hpp	1217	0644	edit dl rm
relaxed_tuple_size.hpp	956	0644	edit dl rm
replace_type.hpp	818	0644	edit dl rm
safe_comparison.hpp	2519	0644	edit dl rm
span.hpp	9048	0644	edit dl rm
static_if.hpp	1477	0644	edit dl rm
sub_array.hpp	3577	0644	edit dl rm
try_cast.hpp	1575	0644	edit dl rm
tuple_slice.hpp	1019	0644	edit dl rm
type_name.hpp	1083	0644	edit dl rm
variant_proxy.hpp	2430	0644	edit dl rm

Edit: /usr/include/boost/histogram/detail/index_translator.hpp (3437B)

// Copyright 2019 Hans Dembinski
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt
// or copy at http://www.boost.org/LICENSE_1_0.txt)

#ifndef BOOST_HISTOGRAM_DETAIL_INDEX_TRANSLATOR_HPP
#define BOOST_HISTOGRAM_DETAIL_INDEX_TRANSLATOR_HPP

#include <algorithm>
#include <boost/histogram/axis/traits.hpp>
#include <boost/histogram/axis/variant.hpp>
#include <boost/histogram/detail/relaxed_equal.hpp>
#include <boost/histogram/detail/relaxed_tuple_size.hpp>
#include <boost/histogram/fwd.hpp>
#include <boost/histogram/multi_index.hpp>
#include <boost/mp11/algorithm.hpp>
#include <boost/mp11/integer_sequence.hpp>
#include <cassert>
#include <initializer_list>
#include <tuple>
#include <vector>

namespace boost {
namespace histogram {
namespace detail {

template <class A>
struct index_translator {
 using index_type = axis::index_type;
 using multi_index_type = multi_index<relaxed_tuple_size_t<A>::value>;
 using cref = const A&;

cref dst, src;
 bool pass_through[buffer_size<A>::value];

index_translator(cref d, cref s) : dst{d}, src{s} { init(dst, src); }

template <class T>
 void init(const T& a, const T& b) {
 std::transform(a.begin(), a.end(), b.begin(), pass_through,
 [](const auto& a, const auto& b) {
 return axis::visit(
 [&](const auto& a) {
 using U = std::decay_t<decltype(a)>;
 return relaxed_equal{}(a, axis::get(b));
 },
 a);
 });
 }

template <class... Ts>
 void init(const std::tuple<Ts...>& a, const std::tuple<Ts...>& b) {
 using Seq = mp11::mp_iota_c<sizeof...(Ts)>;
 mp11::mp_for_each<Seq>([&](auto I) {
 pass_through[I] = relaxed_equal{}(std::get(a), std::get(b));
 });
 }

template <class T>
 static index_type translate(const T& dst, const T& src, index_type i) noexcept {
 assert(axis::traits::is_continuous<T>::value == false); // LCOV_EXCL_LINE: unreachable
 return dst.index(src.value(i));
 }

template <class... Ts, class It>
 void impl(const std::tuple<Ts...>& a, const std::tuple<Ts...>& b, It i,
 index_type* j) const noexcept {
 using Seq = mp11::mp_iota_c<sizeof...(Ts)>;
 mp11::mp_for_each<Seq>([&](auto I) {
 if (pass_through[I])
 *(j + I) = *(i + I);
 else
 *(j + I) = this->translate(std::get(a), std::get(b), *(i + I));
 });
 }

template <class T, class It>
 void impl(const T& a, const T& b, It i, index_type* j) const noexcept {
 const bool* p = pass_through;
 for (unsigned k = 0; k < a.size(); ++k, ++i, ++j, ++p) {
 if (*p)
 *j = *i;
 else {
 const auto& bk = b[k];
 axis::visit(
 [&](const auto& ak) {
 using U = std::decay_t<decltype(ak)>;
 *j = this->translate(ak, axis::get(bk), *i);
 },
 a[k]);
 }
 }
 }

template <class Indices>
 auto operator()(const Indices& seq) const noexcept {
 auto mi = multi_index_type::create(seq.size());
 impl(dst, src, seq.begin(), mi.begin());
 return mi;
 }
};

template <class Axes>
auto make_index_translator(const Axes& dst, const Axes& src) noexcept {
 return index_translator<Axes>{dst, src};
}

} // namespace detail
} // namespace histogram
} // namespace boost

#endif

// Copyright 2019 Hans Dembinski // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt // or copy at http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_HISTOGRAM_DETAIL_INDEX_TRANSLATOR_HPP #define BOOST_HISTOGRAM_DETAIL_INDEX_TRANSLATOR_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace histogram { namespace detail { template struct index_translator { using index_type = axis::index_type; using multi_index_type = multi_index::value>; using cref = const A&; cref dst, src; bool pass_through[buffer_size::value]; index_translator(cref d, cref s) : dst{d}, src{s} { init(dst, src); } template void init(const T& a, const T& b) { std::transform(a.begin(), a.end(), b.begin(), pass_through, [](const auto& a, const auto& b) { return axis::visit( [&](const auto& a) { using U = std::decay_t; return relaxed_equal{}(a, axis::get(b)); }, a); }); } template void init(const std::tuple& a, const std::tuple& b) { using Seq = mp11::mp_iota_c; mp11::mp_for_each([&](auto I) { pass_through[I] = relaxed_equal{}(std::get(a), std::get(b)); }); } template static index_type translate(const T& dst, const T& src, index_type i) noexcept { assert(axis::traits::is_continuous::value == false); // LCOV_EXCL_LINE: unreachable return dst.index(src.value(i)); } template void impl(const std::tuple& a, const std::tuple& b, It i, index_type* j) const noexcept { using Seq = mp11::mp_iota_c; mp11::mp_for_each([&](auto I) { if (pass_through[I]) *(j + I) = *(i + I); else *(j + I) = this->translate(std::get(a), std::get(b), *(i + I)); }); } template void impl(const T& a, const T& b, It i, index_type* j) const noexcept { const bool* p = pass_through; for (unsigned k = 0; k < a.size(); ++k, ++i, ++j, ++p) { if (*p) *j = *i; else { const auto& bk = b[k]; axis::visit( [&](const auto& ak) { using U = std::decay_t; *j = this->translate(ak, axis::get(bk), *i); }, a[k]); } } } template auto operator()(const Indices& seq) const noexcept { auto mi = multi_index_type::create(seq.size()); impl(dst, src, seq.begin(), mi.begin()); return mi; } }; template auto make_index_translator(const Axes& dst, const Axes& src) noexcept { return index_translator{dst, src}; } } // namespace detail } // namespace histogram } // namespace boost #endif