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/relaxed_equal.hpp (1217B)

// Copyright 2015-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_RELAXED_EQUAL_HPP
#define BOOST_HISTOGRAM_DETAIL_RELAXED_EQUAL_HPP

#include <boost/histogram/detail/priority.hpp>
#include <type_traits>

namespace boost {
namespace histogram {
namespace detail {

struct relaxed_equal {
  template <class T, class U>
  constexpr auto impl(const T& t, const U& u, priority<1>) const noexcept
      -> decltype(t == u) const {
    return t == u;
  }

// consider T and U not equal, if there is no operator== defined for them
  template <class T, class U>
  constexpr bool impl(const T&, const U&, priority<0>) const noexcept {
    return false;
  }

// consider two T equal if they are stateless
  template <class T>
  constexpr bool impl(const T&, const T&, priority<0>) const noexcept {
    return std::is_empty<T>::value;
  }

template <class T, class U>
  constexpr bool operator()(const T& t, const U& u) const noexcept {
    return impl(t, u, priority<1>{});
  }
};

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

#endif

// Copyright 2015-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_RELAXED_EQUAL_HPP #define BOOST_HISTOGRAM_DETAIL_RELAXED_EQUAL_HPP #include #include namespace boost { namespace histogram { namespace detail { struct relaxed_equal { template constexpr auto impl(const T& t, const U& u, priority<1>) const noexcept -> decltype(t == u) const { return t == u; } // consider T and U not equal, if there is no operator== defined for them template constexpr bool impl(const T&, const U&, priority<0>) const noexcept { return false; } // consider two T equal if they are stateless template constexpr bool impl(const T&, const T&, priority<0>) const noexcept { return std::is_empty::value; } template constexpr bool operator()(const T& t, const U& u) const noexcept { return impl(t, u, priority<1>{}); } }; } // namespace detail } // namespace histogram } // namespace boost #endif