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/sub_array.hpp (3577B)

// 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_SUB_ARRAY_HPP
#define BOOST_HISTOGRAM_DETAIL_SUB_ARRAY_HPP

#include <algorithm>
#include <stdexcept>

namespace boost {
namespace histogram {
namespace detail {

template <class T, std::size_t N>
class sub_array {
  constexpr bool swap_element_is_noexcept() noexcept {
    using std::swap;
    return noexcept(swap(std::declval<T&>(), std::declval<T&>()));
  }

public:
  using value_type = T;
  using size_type = std::size_t;
  using reference = T&;
  using const_reference = const T&;
  using pointer = T*;
  using const_pointer = const T*;
  using iterator = pointer;
  using const_iterator = const_pointer;

sub_array() = default;

explicit sub_array(std::size_t s) noexcept : size_(s) { assert(size_ <= N); }

sub_array(std::size_t s, const T& value) noexcept(
      std::is_nothrow_assignable<T, const_reference>::value)
      : sub_array(s) {
    fill(value);
  }

reference at(size_type pos) noexcept {
    if (pos >= size()) throw std::out_of_range{"pos is out of range"};
    return data_[pos];
  }

const_reference at(size_type pos) const noexcept {
    if (pos >= size()) throw std::out_of_range{"pos is out of range"};
    return data_[pos];
  }

reference operator[](size_type pos) noexcept { return data_[pos]; }
  const_reference operator[](size_type pos) const noexcept { return data_[pos]; }

reference front() noexcept { return data_[0]; }
  const_reference front() const noexcept { return data_[0]; }

reference back() noexcept { return data_[size_ - 1]; }
  const_reference back() const noexcept { return data_[size_ - 1]; }

pointer data() noexcept { return static_cast<pointer>(data_); }
  const_pointer data() const noexcept { return static_cast<const_pointer>(data_); }

iterator begin() noexcept { return data_; }
  const_iterator begin() const noexcept { return data_; }

iterator end() noexcept { return begin() + size_; }
  const_iterator end() const noexcept { return begin() + size_; }

const_iterator cbegin() noexcept { return data_; }
  const_iterator cbegin() const noexcept { return data_; }

const_iterator cend() noexcept { return cbegin() + size_; }
  const_iterator cend() const noexcept { return cbegin() + size_; }

constexpr size_type max_size() const noexcept { return N; }
  size_type size() const noexcept { return size_; }
  bool empty() const noexcept { return size_ == 0; }

void fill(const_reference value) noexcept(
      std::is_nothrow_assignable<T, const_reference>::value) {
    std::fill(begin(), end(), value);
  }

void swap(sub_array& other) noexcept(swap_element_is_noexcept()) {
    using std::swap;
    for (auto i = begin(), j = other.begin(); i != end(); ++i, ++j) swap(*i, *j);
  }

private:
  size_type size_ = 0;
  value_type data_[N];
};

template <class T, std::size_t N>
bool operator==(const sub_array<T, N>& a, const sub_array<T, N>& b) noexcept {
  return std::equal(a.begin(), a.end(), b.begin());
}

template <class T, std::size_t N>
bool operator!=(const sub_array<T, N>& a, const sub_array<T, N>& b) noexcept {
  return !(a == b);
}

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

namespace std {
template <class T, std::size_t N>
void swap(::boost::histogram::detail::sub_array<T, N>& a,
          ::boost::histogram::detail::sub_array<T, N>& b) noexcept(noexcept(a.swap(b))) {
  a.swap(b);
}
} // namespace std

#endif

cmd: