permutation.h

Go to the documentation of this file.

#pragma once

 
#include <pixie/sequence_options.h>
 
#include <cstddef>
#include <cstdint>
#include <limits>
#include <type_traits>
 
namespace pixie {
template <class Impl, class Index = std::uint64_t>
class PermutationBase {
  static_assert(std::is_integral_v<Index> && std::is_unsigned_v<Index> &&
                !std::is_same_v<Index, bool> &&
                std::numeric_limits<Index>::digits <= 64);
 
 public:
  using value_type = Index;
  using const_reference = Index;
  using size_type = std::size_t;

  static Impl identity(size_type n) { return Impl::identity_impl(n); }
  size_type size() const noexcept { return impl().size_impl(); }
  bool empty() const noexcept { return size() == 0; }
  const_reference operator[](size_type position) const {
    return impl().value_at_impl(position);
  }

  void insert_at(size_type position) { impl().insert_at_impl(position); }
  void rotate_left(size_type left, size_type right, size_type distance) {
    impl().rotate_left_impl(left, right, distance);
  }

  void merge(Impl& donor) { impl().merge_impl(donor); }
  size_type memory_usage_bytes() const noexcept {
    return impl().memory_usage_bytes_impl();
  }
 
 private:
  Impl& impl() noexcept { return static_cast<Impl&>(*this); }
  const Impl& impl() const noexcept { return static_cast<const Impl&>(*this); }
};
}  // namespace pixie