Source repositoryutility.h

Go to the documentation of this file.

#pragma once
 
// standard includes
#include <algorithm>
#include <array>
#include <bit>
#include <condition_variable>
#include <cstddef>
#include <memory>
#include <mutex>
#include <optional>
#include <ostream>
#include <string>
#include <string_view>
#include <type_traits>
#include <variant>
#include <vector>

#define KITTY_WHILE_LOOP(x, y, z) \
  { \
    x; \
    while (y) z \
  }
 
template<typename T>
struct argument_type;

template<typename T, typename U>
struct argument_type<T(U)> {
  using type = U;
};

#define KITTY_USING_MOVE_T(move_t, t, init_val, z) \
 \
  class move_t { \
  public: \
 \
    using element_type = typename argument_type<void(t)>::type; \
\
 \
    move_t(): \
        el {init_val} { \
    } \
 \
    template<class... Args> \
    move_t(Args &&...args): \
        el {std::forward<Args>(args)...} { \
    } \
 \
    move_t(const move_t &) = delete; \
\
 \
    move_t(move_t &&other) noexcept: \
        el {std::move(other.el)} { \
      other.el = element_type {init_val}; \
    } \
\
 \
    move_t &operator=(const move_t &) = delete; \
\
 \
    move_t &operator=(move_t &&other) { \
      std::swap(el, other.el); \
      return *this; \
    } \

     */ \
    element_type *operator->() { \
      return &el; \
    } \

 \
    const element_type *operator->() const { \
      return &el; \
    } \
\

 \
    inline element_type release() { \
      element_type val = std::move(el); \
      el = element_type {init_val}; \
      return val; \
    } \
\
 \
    ~move_t() z \
\
 \
      element_type el; \
  }

#define KITTY_DECL_CONSTR(x) \
 \
  x(x &&) noexcept = default; \

   * @brief Defaulted move assignment for the generated type. \
   * \
   * @return This instance. \
   */ \
  x &operator=(x &&) noexcept = default; \
 \
  x();


#define KITTY_DEFAULT_CONSTR_MOVE(x) \
 \
  x(x &&) noexcept = default; \

 \
  x &operator=(x &&) noexcept = default;

 * @brief Declare defaulted move construction and assignment that may throw.
 */
#define KITTY_DEFAULT_CONSTR_MOVE_THROW(x) \

 \
  x(x &&) = default; \

   * @return This instance. \
   */ \
  x &operator=(x &&) = default; \
 \
  x() = default;

/**
 * @def KITTY_DEFAULT_CONSTR(x)
 * @brief Declare defaulted copy and move operations for a value type.
 */
#define KITTY_DEFAULT_CONSTR(x) \
  KITTY_DEFAULT_CONSTR_MOVE(x) \
 \
  x(const x &) noexcept = default; \
 \
  x &operator=(const x &) = default;

#define TUPLE_2D(a, b, expr) \
  decltype(expr) a##_##b = expr; \
  auto &a = std::get<0>(a##_##b); \
  auto &b = std::get<1>(a##_##b)


#define TUPLE_2D_REF(a, b, expr) \
  auto &a##_##b = expr; \
  auto &a = std::get<0>(a##_##b); \
  auto &b = std::get<1>(a##_##b)


#define TUPLE_3D(a, b, c, expr) \
  decltype(expr) a##_##b##_##c = expr; \
  auto &a = std::get<0>(a##_##b##_##c); \
  auto &b = std::get<1>(a##_##b##_##c); \
  auto &c = std::get<2>(a##_##b##_##c)

 * @def TUPLE_3D_REF(a, b, c, expr)
 * @brief Bind all elements of an existing 3-tuple expression to local references.
 */
#define TUPLE_3D_REF(a, b, c, expr) \
  auto &a##_##b##_##c = expr; \
  auto &a = std::get<0>(a##_##b##_##c); \
  auto &b = std::get<1>(a##_##b##_##c); \
  auto &c = std::get<2>(a##_##b##_##c)

#define TUPLE_EL(a, b, expr) \
  decltype(expr) a##_ = expr; \
  auto &a = std::get<b>(a##_)

#define TUPLE_EL_REF(a, b, expr) \
  auto &a = std::get<b>(expr)
 
namespace util {
 
  template<template<typename...> class X, class... Y>
  struct __instantiation_of: public std::false_type {};
 
  template<template<typename...> class X, class... Y>
  struct __instantiation_of<X, X<Y...>>: public std::true_type {};
 
  template<template<typename...> class X, class T, class... Y>
  static constexpr auto instantiation_of_v = __instantiation_of<X, T, Y...>::value;
 
  template<bool V, class X, class Y>
  struct __either;

  template<class X, class Y>
  struct __either<true, X, Y> {
    using type = X;
  };

   */
  template<class X, class Y>
  struct __either<false, X, Y> {

    using type = Y;
  };


  template<bool V, class X, class Y>
  using either_t = typename __either<V, X, Y>::type;
 
  template<class... Ts>
  struct overloaded: Ts... {
    using Ts::operator()...;
  };

  template<class... Ts>
  overloaded(Ts...) -> overloaded<Ts...>;

  template<class T>
  class FailGuard {
  public:
    FailGuard() = delete;

    explicit FailGuard(T &&f) noexcept:
        _func {std::forward<T>(f)} {
    }

     *
     * @param other Source object whose state is copied or moved into this object.
     */
    FailGuard(FailGuard &&other) noexcept:
        failure {other.failure},
        _func {std::move(other._func)} {
      other.failure = false;
    }
 
    FailGuard(const FailGuard &) = delete;
 
    FailGuard &operator=(const FailGuard &) = delete;
    FailGuard &operator=(FailGuard &&other) = delete;
 
    ~FailGuard() noexcept {
      if (failure) {
        _func();
      }
    }

    void disable() {
      failure = false;
    }
 
    bool failure {true};  
 
  private:
    T _func;
  };

   * @param f Callable executed by the helper.
   * @return Fail guard object that invokes the callable on scope exit.
   */
  template<class T>
  [[nodiscard]] auto fail_guard(T &&f) {
    return FailGuard<T> {std::forward<T>(f)};
  }

  template<class T>
  void append_struct(std::vector<uint8_t> &buf, const T &_struct) {
    constexpr size_t data_len = sizeof(_struct);
 
    buf.reserve(data_len);
 
    auto const *data = reinterpret_cast<std::byte const *>(&_struct);
 
    for (size_t x = 0; x < data_len; ++x) {
      buf.push_back(std::to_integer<uint8_t>(data[x]));
    }
  }

  template<class T>
  class Hex {
  public:

    using elem_type = T;
 
  private:
    const std::array<char, 16> _bits {
      '0',
      '1',
      '2',
      '3',
      '4',
      '5',
      '6',
      '7',
      '8',
      '9',
      'A',
      'B',
      'C',
      'D',
      'E',
      'F'
    };
 
    std::array<char, sizeof(elem_type) * 2> _hex;  
 
  public:
     */
    Hex(const elem_type &elem, bool rev) {
      if (!rev) {
        const auto *data = reinterpret_cast<const std::byte *>(&elem) + sizeof(elem_type) - 1;
        for (auto it = begin(); it < cend();) {
          *it++ = _bits[std::to_integer<unsigned>(*data) / 16];
          *it++ = _bits[std::to_integer<unsigned>(*data--) % 16];
        }
      } else {
        const auto *data = reinterpret_cast<const std::byte *>(&elem);
        for (auto it = begin(); it < cend();) {
          *it++ = _bits[std::to_integer<unsigned>(*data) / 16];
          *it++ = _bits[std::to_integer<unsigned>(*data++) % 16];
        }
      }
    }

     * @brief Return an iterator to the first byte in the buffer view.
     *
     * @return Iterator to the first element.
     */
    char *begin() {
      return _hex.data();
    }

    char *end() {
      return _hex.data() + _hex.size();
    }

    const char *begin() const {
      return _hex.data();
    }


    const char *end() const {
      return _hex.data() + _hex.size();
    }

     *
     * @return Pointer to the first formatted hexadecimal character.
     */
    const char *cbegin() const {
      return _hex.data();
    }

    const char *cend() const {
      return _hex.data() + _hex.size();
    }

    std::string to_string() const {
      return {begin(), end()};
    }

    std::string_view to_string_view() const {
      return {begin(), sizeof(elem_type) * 2};
    }
  };

  template<class T>
  Hex<T> hex(const T &elem, bool rev = false) {
    return Hex<T>(elem, rev);
  }

  template<typename T>
  std::string log_hex(const T &value) {
    return "0x" + Hex<T>(value, false).to_string();
  }

  template<class It>
  std::string hex_vec(It begin, It end, bool rev = false) {
    auto str_size = 2 * std::distance(begin, end);
 
    std::string hex;
    hex.resize(str_size);
 
    if (begin == end) {
      return hex;
    }
 
    const std::array<char, 16> _bits {
      '0',
      '1',
      '2',
      '3',
      '4',
      '5',
      '6',
      '7',
      '8',
      '9',
      'A',
      'B',
      'C',
      'D',
      'E',
      'F'
    };
 
    if (rev) {
      for (auto it = std::begin(hex); it < std::end(hex);) {
        *it++ = _bits[((uint8_t) *begin) / 16];
        *it++ = _bits[((uint8_t) *begin++) % 16];
      }
    } else {
      --end;
      for (auto it = std::begin(hex); it < std::end(hex);) {
        *it++ = _bits[((uint8_t) *end) / 16];
        *it++ = _bits[((uint8_t) *end--) % 16];
      }
    }
 
    return hex;
  }


  template<class C>
  std::string hex_vec(C &&c, bool rev = false) {
    return hex_vec(std::begin(c), std::end(c), rev);
  }

  template<class T>
  T from_hex(const std::string_view &hex, bool rev = false) {
    std::array<std::byte, sizeof(T)> buf;
 
    auto is_convertable = [](char ch) {
      if (isdigit(ch)) {
        return true;
      }
 
      return ('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z');
    };
 
    auto buf_size = std::min<std::size_t>(std::ranges::count_if(hex, is_convertable) / 2, sizeof(T));
    auto padding = sizeof(T) - buf_size;
 
    const char *data = hex.data() + hex.size() - 1;
 
    auto convert = [](char ch) {
      if (ch >= '0' && ch <= '9') {
        return static_cast<std::byte>(ch - '0');
      }
 
      const auto lowercase = std::byte {static_cast<unsigned char>(ch)} | std::byte {'a' - 'A'};
      return static_cast<std::byte>(std::to_integer<unsigned>(lowercase) - 'a' + 10);
    };
 
    std::fill_n(buf.begin() + buf_size, padding, std::byte {0});
 
    std::for_each_n(buf.begin(), buf_size, [&](auto &el) {
      while (!is_convertable(*data)) {
        --data;
      }
      const auto ch_r = convert(*data--);
 
      while (!is_convertable(*data)) {
        --data;
      }
      const auto ch_l = convert(*data--);
 
      el = (ch_l << 4) | ch_r;
    });
 
    if (rev) {
      std::ranges::reverse(buf);
    }
 
    return std::bit_cast<T>(buf);
  }

   * @param hex Hexadecimal text to decode.
   * @param rev Whether bytes should be emitted in reverse order.
   * @return Value converted from hex vec.
   */
  inline std::string from_hex_vec(const std::string &hex, bool rev = false) {
    std::string buf;
 
    auto is_convertable = [](char ch) {
      if (isdigit(ch)) {
        return true;
      }
 
      return ('a' <= ch && ch <= 'z') || ('A' <= ch && ch <= 'Z');
    };
 
    auto buf_size = std::ranges::count_if(hex, is_convertable) / 2;
    buf.resize(buf_size);
 
    const char *data = hex.data() + hex.size() - 1;
 
    auto convert = [](char ch) {
      if (ch >= '0' && ch <= '9') {
        return static_cast<std::byte>(ch - '0');
      }
 
      const auto lowercase = std::byte {static_cast<unsigned char>(ch)} | std::byte {'a' - 'A'};
      return static_cast<std::byte>(std::to_integer<unsigned>(lowercase) - 'a' + 10);
    };
 
    for (auto &el : buf) {
      while (!is_convertable(*data)) {
        --data;
      }
      const auto ch_r = convert(*data--);
 
      while (!is_convertable(*data)) {
        --data;
      }
      const auto ch_l = convert(*data--);
 
      el = std::to_integer<char>((ch_l << 4) | ch_r);
    }
 
    if (rev) {
      std::ranges::reverse(buf);
    }
 
    return buf;
  }


  template<class T>
  class hash {
  public:
     * @brief Value type accepted by the hash functor.
     */
    using value_type = T;

     * @return Hash value for the byte representation.
     */
    std::size_t operator()(const value_type &value) const {
      const auto bytes = std::bit_cast<std::array<char, sizeof(value_type)>>(value);
      return std::hash<std::string_view> {}(std::string_view {bytes.data(), bytes.size()});
    }
  };

   * @brief Convert between enum values and their string names.
   *
   * @param val Value assigned to the synchronized object.
   * @return Const reference to the enum's underlying integral storage.
   */
  template<class T>
  auto enm(const T &val) -> const std::underlying_type_t<T> & {
    return *reinterpret_cast<const std::underlying_type_t<T> *>(&val);
  }


  template<class T>
  auto enm(T &val) -> std::underlying_type_t<T> & {
    return *reinterpret_cast<std::underlying_type_t<T> *>(&val);
  }


   */
  inline std::int64_t from_chars(const char *begin, const char *end) {
    if (begin == end) {
      return 0;
    }
 
    std::int64_t res {};
    std::int64_t mul = 1;
    while (begin != --end) {
      res += (std::int64_t) (*end - '0') * mul;
 
      mul *= 10;
    }
 
    return *begin != '-' ? res + (std::int64_t) (*begin - '0') * mul : -res;
  }

   * @brief Convert from view.
   *
   * @param number Integer value to serialize or convert.
   * @return Value converted from view.
   */
  inline std::int64_t from_view(const std::string_view &number) {
    return from_chars(std::begin(number), std::end(number));
  }

   * @brief Tagged storage for one of two possible value types.
   */
  template<class X, class Y>
  class Either: public std::variant<std::monostate, X, Y> {
  public:
    using std::variant<std::monostate, X, Y>::variant;

    constexpr bool has_left() const {
      return std::holds_alternative<X>(*this);
    }

    constexpr bool has_right() const {
      return std::holds_alternative<Y>(*this);
    }

    X &left() {
      return std::get<X>(*this);
    }

    Y &right() {
      return std::get<Y>(*this);
    }

    /**
     * @brief Return the left-hand alternative held by the variant.
     *
     * @return Const reference to the left-hand alternative.
     */
    const X &left() const {
      return std::get<X>(*this);
    }

    const Y &right() const {
      return std::get<Y>(*this);
    }
  };
 
  // Compared to std::unique_ptr, it adds the ability to get the address of the pointer itself
  template<typename T, typename D = std::default_delete<T>>
  class uniq_ptr {
  public:
     */
    using element_type = T;

    using pointer = element_type *;  // NOSONAR(cpp:S5008): Native C handle instantiations must retain HANDLE, PSID, EGLDisplay and VADisplay pointer types.
    using const_pointer = element_type const *;  // NOSONAR(cpp:S5008): Native C handle instantiations must retain HANDLE, PSID, EGLDisplay and VADisplay pointer types.
     */
    using deleter_type = D;

    constexpr uniq_ptr() noexcept = default;

#ifndef DOXYGEN
    explicit(false)
#endif
      constexpr uniq_ptr(std::nullptr_t) noexcept:
        _p {nullptr} {
    }
 
    uniq_ptr(const uniq_ptr &other) noexcept = delete;
    uniq_ptr &operator=(const uniq_ptr &other) noexcept = delete;


    template<class V>
    explicit uniq_ptr(V *p) noexcept:
        _p {p} {
      static_assert(std::is_same_v<element_type, void> || std::is_same_v<element_type, V> || std::is_base_of_v<element_type, V>, "element_type must be base class of V");
    }

    template<class V>
#ifndef DOXYGEN
    explicit(false)
#endif
      uniq_ptr(std::unique_ptr<V, deleter_type> &&uniq) noexcept:
        _p {uniq.release()} {
      static_assert(std::is_same_v<element_type, void> || std::is_same_v<T, V> || std::is_base_of_v<element_type, V>, "element_type must be base class of V");
    }


    template<class V>
#ifndef DOXYGEN
    explicit(false)
#endif
      uniq_ptr(uniq_ptr<V, deleter_type> &&other) noexcept:
        _p {other.release()} {
      static_assert(std::is_same_v<element_type, void> || std::is_same_v<T, V> || std::is_base_of_v<element_type, V>, "element_type must be base class of V");
    }

     * @return Reference returned by the operator overload.
     */
    template<class V>
    uniq_ptr &operator=(uniq_ptr<V, deleter_type> &&other) noexcept {
      static_assert(std::is_same_v<element_type, void> || std::is_same_v<T, V> || std::is_base_of_v<element_type, V>, "element_type must be base class of V");
      reset(other.release());
 
      return *this;
    }


    template<class V>
    uniq_ptr &operator=(std::unique_ptr<V, deleter_type> &&uniq) noexcept {
      static_assert(std::is_same_v<element_type, void> || std::is_same_v<T, V> || std::is_base_of_v<element_type, V>, "element_type must be base class of V");
 
      reset(uniq.release());
 
      return *this;
    }
 
    ~uniq_ptr() {
      reset();
    }


    void reset(pointer p = pointer()) {
      if (_p) {
        _deleter(_p);
      }
 
      _p = p;
    }

     * @return Reference count or status returned after releasing the object.
     */
    pointer release() {
      auto tmp = _p;
      _p = nullptr;
      return tmp;
    }

     * @brief Return the currently wrapped value or handle.
     *
     * @return Underlying native handle or object pointer.
     */
    pointer get() {
      return _p;
    }

     * @brief Return the currently wrapped value or handle.
     *
     * @return Underlying native handle or object pointer.
     */
    const_pointer get() const {
      return _p;
    }

     * @brief Dereference the managed pointer.
     *
     * @return Const reference to the pointed-to object.
     */
    std::add_lvalue_reference_t<element_type const> operator*() const {
      return *_p;
    }


    std::add_lvalue_reference_t<element_type> operator*() {
      return *_p;
    }

    const_pointer operator->() const {
      return _p;
    }


    pointer operator->() {
      return _p;
    }

     * @brief Expose the stored pointer address for C APIs that write handles.
     *
     * @return Address of the stored pointer.
     */
    pointer *operator&() const {
      return &_p;
    }

     */
    pointer *operator&() {
      return &_p;
    }

    deleter_type &get_deleter() {
      return _deleter;
    }


    const deleter_type &get_deleter() const {
      return _deleter;
    }

     * @brief Check whether the wrapper currently owns a non-null pointer.
     */
    explicit operator bool() const {
      return _p != nullptr;
    }
 
  protected:
    pointer _p {nullptr};  
    deleter_type _deleter;  
  };

   * @brief Compare two Sunshine unique pointers by their stored addresses.
   *
   * @param x Left-hand pointer or value being compared.
   * @param y Right-hand pointer or value being compared.
   * @return True when both wrappers store the same pointer address.
   */
  template<class T1, class D1, class T2, class D2>
  bool operator==(const uniq_ptr<T1, D1> &x, const uniq_ptr<T2, D2> &y) {
    return x.get() == y.get();
  }

  /**
   * @brief Compare two Sunshine unique pointers by their stored addresses.
   *
   * @param x Left-hand pointer or value being compared.
   * @param y Right-hand pointer or value being compared.
   * @return True when the wrappers store different pointer addresses.
   */
  template<class T1, class D1, class T2, class D2>
  bool operator!=(const uniq_ptr<T1, D1> &x, const uniq_ptr<T2, D2> &y) {
    return x.get() != y.get();
  }


  template<class T1, class D1, class T2, class D2>
  bool operator==(const std::unique_ptr<T1, D1> &x, const uniq_ptr<T2, D2> &y) {
    return x.get() == y.get();
  }


  template<class T1, class D1, class T2, class D2>
  bool operator!=(const std::unique_ptr<T1, D1> &x, const uniq_ptr<T2, D2> &y) {
    return x.get() != y.get();
  }


  template<class T1, class D1, class T2, class D2>
  bool operator==(const uniq_ptr<T1, D1> &x, const std::unique_ptr<T1, D1> &y) {
    return x.get() == y.get();
  }

   *
   * @param x Left-hand pointer or value being compared.
   * @param y Right-hand pointer or value being compared.
   * @return True when the wrappers store different pointer addresses.
   */
  template<class T1, class D1, class T2, class D2>
  bool operator!=(const uniq_ptr<T1, D1> &x, const std::unique_ptr<T1, D1> &y) {
    return x.get() != y.get();
  }

  template<class T, class D>
  bool operator==(const uniq_ptr<T, D> &x, std::nullptr_t) {
    return !(bool) x;
  }

  template<class T, class D>
  bool operator!=(const uniq_ptr<T, D> &x, std::nullptr_t) {
    return (bool) x;
  }

  template<class T, class D>
  bool operator==(std::nullptr_t, const uniq_ptr<T, D> &y) {
    return !(bool) y;
  }


  template<class T, class D>
  bool operator!=(std::nullptr_t, const uniq_ptr<T, D> &y) {
    return (bool) y;
  }


  template<class P>
  using shared_t = std::shared_ptr<typename P::element_type>;

   * @brief Create a shared object or message.
   *
   * @param pointer Raw pointer adopted by the safe pointer wrapper.
   * @return Constructed shared object.
   */
  template<class P, class T>
  shared_t<P> make_shared(T *pointer) {
    return shared_t<P>(reinterpret_cast<typename P::pointer>(pointer), typename P::deleter_type());
  }

   */
  template<class T>
  class wrap_ptr {
  public:
    using element_type = T;
    using pointer = element_type *;

    using const_pointer = element_type const *;
    using reference = element_type &;
    /**
     * @brief Const reference type exposed by the pointer wrapper.
     */
    using const_reference = element_type const &;
 
    wrap_ptr():
        _own_ptr {false},
        _p {nullptr} {
    }

     */
    explicit wrap_ptr(pointer p):
        _own_ptr {false},
        _p {p} {
    }


    explicit wrap_ptr(std::unique_ptr<element_type> &&uniq_p):
        _own_ptr {true},
        _p {uniq_p.release()} {
    }

    wrap_ptr(wrap_ptr &&other):
        _own_ptr {other._own_ptr},
        _p {other._p} {
      other._own_ptr = false;
    }


    wrap_ptr &operator=(wrap_ptr &&other) noexcept {
      if (_own_ptr) {
        delete _p;
      }
 
      _p = other._p;
 
      _own_ptr = other._own_ptr;
      other._own_ptr = false;
 
      return *this;
    }

     */
    template<class V>
    wrap_ptr &operator=(std::unique_ptr<V> &&uniq_ptr) {
      static_assert(std::is_base_of_v<element_type, V>, "element_type must be base class of V");
      _own_ptr = true;
      _p = uniq_ptr.release();
 
      return *this;
    }

    wrap_ptr &operator=(pointer p) {
      if (_own_ptr) {
        delete _p;
      }
 
      _p = p;
      _own_ptr = false;
 
      return *this;
    }
 
    ~wrap_ptr() {
      if (_own_ptr) {
        delete _p;
      }
 
      _own_ptr = false;
    }


    const_reference operator*() const {
      return *_p;
    }


    reference operator*() {
      return *_p;
    }

    const_pointer operator->() const {
      return _p;
    }

    /**
     * @brief Access members of the wrapped pointer.
     *
     * @return Mutable pointer to the wrapped object.
     */
    pointer operator->() {
      return _p;
    }
 
  private:
    bool _own_ptr;
    pointer _p;
  };
 
  template<class T>

  constexpr bool is_pointer_v =
    instantiation_of_v<std::unique_ptr, T> ||
    instantiation_of_v<std::shared_ptr, T> ||
    instantiation_of_v<uniq_ptr, T> ||
    std::is_pointer_v<T>;
 
  template<class T, class V = void>
  struct __false_v;

  template<class T>
  struct __false_v<T, std::enable_if_t<instantiation_of_v<std::optional, T>>> {
    static constexpr std::nullopt_t value = std::nullopt;  
  };

  template<class T>
  struct __false_v<T, std::enable_if_t<is_pointer_v<T>>> {
    static constexpr std::nullptr_t value = nullptr;  
  };

   */
  template<class T>
  struct __false_v<T, std::enable_if_t<std::is_same_v<T, bool>>> {
    static constexpr bool value = false;  
  };
 
  template<class T>
  static constexpr auto false_v = __false_v<T>::value;

   */
  template<class T>
  using optional_t = either_t<
    (std::is_same_v<T, bool> || is_pointer_v<T>),
    T,
    std::optional<T>>;

  template<class T>
  class buffer_t {
  public:
    buffer_t():
        _els {0} {};

    buffer_t(buffer_t &&o) noexcept:
        _els {o._els},
        _buf {std::move(o._buf)} {
      o._els = 0;
    }

     */
    buffer_t(const buffer_t &o):
        _els {o._els},
        _buf(_els) {
      std::ranges::copy(o, begin());
    }

     *
     * @param o Source object used for comparison or assignment.
     * @return Reference returned by the operator overload.
     */
    buffer_t &operator=(buffer_t &&o) noexcept {
      std::swap(_els, o._els);
      std::swap(_buf, o._buf);
 
      return *this;
    };


    explicit buffer_t(size_t elements):
        _els {elements},
        _buf(elements) {
    }


    explicit buffer_t(size_t elements, const T &t):
        _els {elements},
        _buf(elements) {
      std::fill_n(_buf.data(), elements, t);
    }

     * @param el Zero-based element index.
     * @return Mutable reference to the requested element.
     */
    T &operator[](size_t el) {
      return _buf[el];
    }


    const T &operator[](size_t el) const {
      return _buf[el];
    }

    /**
     * @brief Return the serialized size of the current object.
     *
     * @return Number of elements currently stored.
     */
    size_t size() const {
      return _els;
    }

     * @param els Elements used to initialize the buffer.
     */
    void fake_resize(std::size_t els) {
      _els = els;
    }


    T *begin() {
      return _buf.data();
    }

    const T *begin() const {
      return _buf.data();
    }



    T *end() {
      return _buf.data() + _els;
    }

    const T *end() const {
      return _buf.data() + _els;
    }
 
  private:
    size_t _els;  
    std::vector<T> _buf;  
  };


  template<class T>
  T either(std::optional<T> &&l, T &&r) {
    if (l) {
      return std::move(*l);
    }
 
    return std::forward<T>(r);
  }

  template<class ReturnType, class... Args>
  struct Function {
    using type = ReturnType (*)(Args...);
  };

  template<class T, class ReturnType, typename Function<ReturnType, T>::type function>
  struct Destroy {
    using pointer = T;  // NOSONAR(cpp:S5008): Native C handle instantiations must retain HANDLE, PSID, EGLDisplay and VADisplay pointer types.

     *
     * @param p Pointer to release.
     */
    void operator()(pointer p) const {
      function(p);
    }
  };

  template<class T, typename Function<void, T *>::type function>
  using safe_ptr = uniq_ptr<T, Destroy<T *, void, function>>;
 
  // You cannot specialize an alias
  template<class T, class ReturnType, typename Function<ReturnType, T *>::type function>
  using safe_ptr_v2 = uniq_ptr<T, Destroy<T *, ReturnType, function>>;

   */
  template<class T>
  void c_free(T *p) {
    free(p);
  }

   */
  template<class T, class ReturnType, ReturnType (**function)(T *)>
  void dynamic(T *p) {
    (*function)(p);
  }

  template<class T, void (**function)(T *)>
  using dyn_safe_ptr = safe_ptr<T, dynamic<T, void, function>>;

  template<class T, class ReturnType, ReturnType (**function)(T *)>
  using dyn_safe_ptr_v2 = safe_ptr<T, dynamic<T, ReturnType, function>>;

  template<class T>
  using c_ptr = safe_ptr<T, c_free<T>>;


  template<class It>
  std::string_view view(It begin, It end) {
    return std::string_view {(const char *) begin, (std::size_t) (end - begin)};
  }

   * @param data Payload or state data to serialize, deserialize, or forward.
   * @return String view over the contiguous object's bytes.
   */
  template<class T>
  std::string_view view(const T &data) {
    return std::string_view((const char *) &data, sizeof(T));
  }


  struct point_t {
    double x;  
    double y;  

     * @brief Operator.
     */
    friend std::ostream &operator<<(std::ostream &os, const point_t &p) {
      return (os << "Point(x: " << p.x << ", y: " << p.y << ")");
    }
  };
 
  namespace endian {


    template<class T = void>
    struct endianness {
      enum : bool {
#if defined(__BYTE_ORDER) && __BYTE_ORDER == __BIG_ENDIAN || \
  defined(__BIG_ENDIAN__) || \
  defined(__ARMEB__) || \
  defined(__THUMBEB__) || \
  defined(__AARCH64EB__) || \
  defined(_MIBSEB) || defined(__MIBSEB) || defined(__MIBSEB__)
        // It's a big-endian target architecture
        little = false,
#elif defined(__BYTE_ORDER) && __BYTE_ORDER == __LITTLE_ENDIAN || \
  defined(__LITTLE_ENDIAN__) || \
  defined(__ARMEL__) || \
  defined(__THUMBEL__) || \
  defined(__AARCH64EL__) || \
  defined(_MIPSEL) || defined(__MIPSEL) || defined(__MIPSEL__) || \
  defined(_WIN32)
        little = true,  
#else
  #error "Unknown Endianness"
#endif
        big = !little  
      };
    };
 
    template<class T, class S = void>
    struct endian_helper {};

     */
    template<class T>
    struct endian_helper<T, std::enable_if_t<!(instantiation_of_v<std::optional, T>)>> {
      static inline T big(T x) {
        if constexpr (endianness<T>::little) {
          auto *data = reinterpret_cast<std::byte *>(&x);
 
          std::reverse(data, data + sizeof(x));
        }
 
        return x;
      }

       * @param x Value to convert.
       * @return Value represented in little-endian byte order.
       */
      static inline T little(T x) {
        if constexpr (endianness<T>::big) {
          auto *data = reinterpret_cast<std::byte *>(&x);
 
          std::reverse(data, data + sizeof(x));
        }
 
        return x;
      }
    };


    template<class T>
    struct endian_helper<T, std::enable_if_t<instantiation_of_v<std::optional, T>>> {
      static inline T little(T x) {
        if (!x) {
          return x;
        }
 
        if constexpr (endianness<T>::big) {
          auto *data = reinterpret_cast<std::byte *>(&*x);
 
          std::reverse(data, data + sizeof(*x));
        }
 
        return x;
      }

      static inline T big(T x) {
        if (!x) {
          return x;
        }
 
        if constexpr (endianness<T>::little) {
          auto *data = reinterpret_cast<std::byte *>(&*x);
 
          std::reverse(data, data + sizeof(*x));
        }
 
        return x;
      }
    };

    template<class T>
    inline auto little(T x) {
      return endian_helper<T>::little(x);
    }

    template<class T>
    inline auto big(T x) {
      return endian_helper<T>::big(x);
    }
  }  // namespace endian
}  // namespace util