1 // Copyright 2015-2018 Hans Dembinski
3 // Distributed under the Boost Software License, Version 1.0.
4 // (See accompanying file LICENSE_1_0.txt
5 // or copy at http://www.boost.org/LICENSE_1_0.txt)
7 #ifndef BOOST_HISTOGRAM_AXIS_REGULAR_HPP
8 #define BOOST_HISTOGRAM_AXIS_REGULAR_HPP
10 #include <boost/assert.hpp>
11 #include <boost/core/nvp.hpp>
12 #include <boost/histogram/axis/interval_view.hpp>
13 #include <boost/histogram/axis/iterator.hpp>
14 #include <boost/histogram/axis/metadata_base.hpp>
15 #include <boost/histogram/axis/option.hpp>
16 #include <boost/histogram/detail/convert_integer.hpp>
17 #include <boost/histogram/detail/relaxed_equal.hpp>
18 #include <boost/histogram/detail/replace_type.hpp>
19 #include <boost/histogram/fwd.hpp>
20 #include <boost/mp11/utility.hpp>
21 #include <boost/throw_exception.hpp>
26 #include <type_traits>
34 using get_scale_type_helper = typename T::value_type;
37 using get_scale_type = mp11::mp_eval_or<T, detail::get_scale_type_helper, T>;
42 T operator*(T&& t, const one_unit&) {
43 return std::forward<T>(t);
47 T operator/(T&& t, const one_unit&) {
48 return std::forward<T>(t);
52 using get_unit_type_helper = typename T::unit_type;
55 using get_unit_type = mp11::mp_eval_or<one_unit, detail::get_unit_type_helper, T>;
57 template <class T, class R = get_scale_type<T>>
58 R get_scale(const T& t) {
59 return t / get_unit_type<T>();
68 /// Identity transform for equidistant bins.
72 static T forward(T&& x) noexcept {
73 return std::forward<T>(x);
78 static T inverse(T&& x) noexcept {
79 return std::forward<T>(x);
82 template <class Archive>
83 void serialize(Archive&, unsigned /* version */) {}
86 /// Log transform for equidistant bins in log-space.
88 /// Returns log(x) of external value x.
90 static T forward(T x) {
94 /// Returns exp(x) for internal value x.
96 static T inverse(T x) {
100 template <class Archive>
101 void serialize(Archive&, unsigned /* version */) {}
104 /// Sqrt transform for equidistant bins in sqrt-space.
106 /// Returns sqrt(x) of external value x.
108 static T forward(T x) {
112 /// Returns x^2 of internal value x.
114 static T inverse(T x) {
118 template <class Archive>
119 void serialize(Archive&, unsigned /* version */) {}
122 /// Pow transform for equidistant bins in pow-space.
124 double power = 1; /**< power index */
126 /// Make transform with index p.
127 explicit pow(double p) : power(p) {}
130 /// Returns pow(x, power) of external value x.
132 auto forward(T x) const {
133 return std::pow(x, power);
136 /// Returns pow(x, 1/power) of external value x.
138 auto inverse(T x) const {
139 return std::pow(x, 1.0 / power);
142 bool operator==(const pow& o) const noexcept { return power == o.power; }
144 template <class Archive>
145 void serialize(Archive& ar, unsigned /* version */) {
146 ar& make_nvp("power", power);
150 } // namespace transform
152 #ifndef BOOST_HISTOGRAM_DOXYGEN_INVOKED
153 // Type envelope to mark value as step size
161 Helper function to mark argument as step size.
164 step_type<T> step(T t) {
165 return step_type<T>{t};
169 Axis for equidistant intervals on the real line.
171 The most common binning strategy. Very fast. Binning is a O(1) operation.
173 @tparam Value input value type, must be floating point.
174 @tparam Transform builtin or user-defined transform type.
175 @tparam MetaData type to store meta data.
176 @tparam Options see boost::histogram::axis::option (all values allowed).
178 template <class Value, class Transform, class MetaData, class Options>
179 class regular : public iterator_mixin<regular<Value, Transform, MetaData, Options>>,
180 protected detail::replace_default<Transform, transform::id>,
181 public metadata_base<MetaData> {
182 using value_type = Value;
183 using transform_type = detail::replace_default<Transform, transform::id>;
184 using metadata_type = typename metadata_base<MetaData>::metadata_type;
186 detail::replace_default<Options, decltype(option::underflow | option::overflow)>;
188 static_assert(std::is_nothrow_move_constructible<transform_type>::value,
189 "transform must be no-throw move constructible");
190 static_assert(std::is_nothrow_move_assignable<transform_type>::value,
191 "transform must be no-throw move assignable");
193 using unit_type = detail::get_unit_type<value_type>;
194 using internal_value_type = detail::get_scale_type<value_type>;
196 static_assert(std::is_floating_point<internal_value_type>::value,
197 "regular axis requires floating point type");
200 (!options_type::test(option::circular) && !options_type::test(option::growth)) ||
201 (options_type::test(option::circular) ^ options_type::test(option::growth)),
202 "circular and growth options are mutually exclusive");
205 constexpr regular() = default;
207 /** Construct n bins over real transformed range [start, stop).
209 * @param trans transform instance to use.
210 * @param n number of bins.
211 * @param start low edge of first bin.
212 * @param stop high edge of last bin.
213 * @param meta description of the axis (optional).
215 regular(transform_type trans, unsigned n, value_type start, value_type stop,
216 metadata_type meta = {})
217 : transform_type(std::move(trans))
218 , metadata_base<MetaData>(std::move(meta))
219 , size_(static_cast<index_type>(n))
220 , min_(this->forward(detail::get_scale(start)))
221 , delta_(this->forward(detail::get_scale(stop)) - min_) {
222 if (size() == 0) BOOST_THROW_EXCEPTION(std::invalid_argument("bins > 0 required"));
223 if (!std::isfinite(min_) || !std::isfinite(delta_))
224 BOOST_THROW_EXCEPTION(
225 std::invalid_argument("forward transform of start or stop invalid"));
227 BOOST_THROW_EXCEPTION(std::invalid_argument("range of axis is zero"));
230 /** Construct n bins over real range [start, stop).
232 * @param n number of bins.
233 * @param start low edge of first bin.
234 * @param stop high edge of last bin.
235 * @param meta description of the axis (optional).
237 regular(unsigned n, value_type start, value_type stop, metadata_type meta = {})
238 : regular({}, n, start, stop, std::move(meta)) {}
240 /** Construct bins with the given step size over real transformed range
243 * @param trans transform instance to use.
244 * @param step width of a single bin.
245 * @param start low edge of first bin.
246 * @param stop upper limit of high edge of last bin (see below).
247 * @param meta description of the axis (optional).
249 * The axis computes the number of bins as n = abs(stop - start) / step,
250 * rounded down. This means that stop is an upper limit to the actual value
251 * (start + n * step).
254 regular(transform_type trans, step_type<T> step, value_type start, value_type stop,
255 metadata_type meta = {})
256 : regular(trans, static_cast<index_type>(std::abs(stop - start) / step.value),
258 start + static_cast<index_type>(std::abs(stop - start) / step.value) *
262 /** Construct bins with the given step size over real range [start, stop).
264 * @param step width of a single bin.
265 * @param start low edge of first bin.
266 * @param stop upper limit of high edge of last bin (see below).
267 * @param meta description of the axis (optional).
269 * The axis computes the number of bins as n = abs(stop - start) / step,
270 * rounded down. This means that stop is an upper limit to the actual value
271 * (start + n * step).
274 regular(step_type<T> step, value_type start, value_type stop, metadata_type meta = {})
275 : regular({}, step, start, stop, std::move(meta)) {}
277 /// Constructor used by algorithm::reduce to shrink and rebin (not for users).
278 regular(const regular& src, index_type begin, index_type end, unsigned merge)
279 : regular(src.transform(), (end - begin) / merge, src.value(begin), src.value(end),
281 BOOST_ASSERT((end - begin) % merge == 0);
282 if (options_type::test(option::circular) && !(begin == 0 && end == src.size()))
283 BOOST_THROW_EXCEPTION(std::invalid_argument("cannot shrink circular axis"));
286 /// Return instance of the transform type.
287 const transform_type& transform() const noexcept { return *this; }
289 /// Return index for value argument.
290 index_type index(value_type x) const noexcept {
291 // Runs in hot loop, please measure impact of changes
292 auto z = (this->forward(x / unit_type{}) - min_) / delta_;
293 if (options_type::test(option::circular)) {
294 if (std::isfinite(z)) {
296 return static_cast<index_type>(z * size());
301 return static_cast<index_type>(z * size());
306 return size(); // also returned if x is NaN
309 /// Returns index and shift (if axis has grown) for the passed argument.
310 auto update(value_type x) noexcept {
311 BOOST_ASSERT(options_type::test(option::growth));
312 const auto z = (this->forward(x / unit_type{}) - min_) / delta_;
313 if (z < 1) { // don't use i here!
315 const auto i = static_cast<axis::index_type>(z * size());
316 return std::make_pair(i, 0);
318 if (z != -std::numeric_limits<internal_value_type>::infinity()) {
319 const auto stop = min_ + delta_;
320 const auto i = static_cast<axis::index_type>(std::floor(z * size()));
321 min_ += i * (delta_ / size());
322 delta_ = stop - min_;
324 return std::make_pair(0, -i);
327 return std::make_pair(-1, 0);
329 // z either beyond range, infinite, or NaN
330 if (z < std::numeric_limits<internal_value_type>::infinity()) {
331 const auto i = static_cast<axis::index_type>(z * size());
332 const auto n = i - size() + 1;
334 delta_ *= size() + n;
336 return std::make_pair(i, -n);
338 // z either infinite or NaN
339 return std::make_pair(size(), 0);
342 /// Return value for fractional index argument.
343 value_type value(real_index_type i) const noexcept {
345 if (!options_type::test(option::circular) && z < 0.0)
346 z = -std::numeric_limits<internal_value_type>::infinity() * delta_;
347 else if (options_type::test(option::circular) || z <= 1.0)
348 z = (1.0 - z) * min_ + z * (min_ + delta_);
350 z = std::numeric_limits<internal_value_type>::infinity() * delta_;
352 return static_cast<value_type>(this->inverse(z) * unit_type());
355 /// Return bin for index argument.
356 decltype(auto) bin(index_type idx) const noexcept {
357 return interval_view<regular>(*this, idx);
360 /// Returns the number of bins, without over- or underflow.
361 index_type size() const noexcept { return size_; }
363 /// Returns the options.
364 static constexpr unsigned options() noexcept { return options_type::value; }
366 template <class V, class T, class M, class O>
367 bool operator==(const regular<V, T, M, O>& o) const noexcept {
368 return detail::relaxed_equal(transform(), o.transform()) && size() == o.size() &&
369 min_ == o.min_ && delta_ == o.delta_ && metadata_base<MetaData>::operator==(o);
371 template <class V, class T, class M, class O>
372 bool operator!=(const regular<V, T, M, O>& o) const noexcept {
373 return !operator==(o);
376 template <class Archive>
377 void serialize(Archive& ar, unsigned /* version */) {
378 ar& make_nvp("transform", static_cast<transform_type&>(*this));
379 ar& make_nvp("size", size_);
380 ar& make_nvp("meta", this->metadata());
381 ar& make_nvp("min", min_);
382 ar& make_nvp("delta", delta_);
387 internal_value_type min_{0}, delta_{1};
389 template <class V, class T, class M, class O>
390 friend class regular;
393 #if __cpp_deduction_guides >= 201606
396 regular(unsigned, T, T)
397 ->regular<detail::convert_integer<T, double>, transform::id, null_type>;
399 template <class T, class M>
400 regular(unsigned, T, T, M)
401 ->regular<detail::convert_integer<T, double>, transform::id,
402 detail::replace_cstring<std::decay_t<M>>>;
404 template <class Tr, class T, class = detail::requires_transform<Tr, T>>
405 regular(Tr, unsigned, T, T)->regular<detail::convert_integer<T, double>, Tr, null_type>;
407 template <class Tr, class T, class M>
408 regular(Tr, unsigned, T, T, M)
409 ->regular<detail::convert_integer<T, double>, Tr,
410 detail::replace_cstring<std::decay_t<M>>>;
414 /// Regular axis with circular option already set.
415 template <class Value = double, class MetaData = use_default, class Options = use_default>
416 #ifndef BOOST_HISTOGRAM_DOXYGEN_INVOKED
417 using circular = regular<Value, transform::id, MetaData,
418 decltype(detail::replace_default<Options, option::overflow_t>{} |
425 } // namespace histogram