query_facade_mixin.hpp

Go to the documentation of this file.

#pragma once
 
#include "thread_control_block.hpp"
 
#include <cstddef>
#include <optional>
#include <type_traits>
#include <utility>
#include <vector>
 
namespace threadschedule::detail
{
 
template <typename Derived>
class query_facade_mixin
{
  auto
  self() const -> Derived const&
  {
    return static_cast<Derived const&>(*this);
  }
 
public:
  template <typename Predicate>
  [[nodiscard]] auto
  filter(Predicate&& pred) const
  {
    return self().query().filter(std::forward<Predicate>(pred));
  }
 
  [[nodiscard]] auto
  count() const -> size_t
  {
    return self().query().count();
  }
 
  [[nodiscard]] auto
  empty() const -> bool
  {
    return self().query().empty();
  }
 
  template <typename Fn>
  void
  for_each(Fn&& fn) const
  {
    self().query().for_each(std::forward<Fn>(fn));
  }
 
  template <typename Predicate, typename Fn>
  void
  apply(Predicate&& pred, Fn&& fn) const
  {
    self().query().filter(std::forward<Predicate>(pred)).for_each(std::forward<Fn>(fn));
  }
 
  template <typename Fn>
  [[nodiscard]] auto
  map(Fn&& fn) const -> std::vector<std::invoke_result_t<Fn, registered_thread_info_backend const&>>
  {
    return self().query().map(std::forward<Fn>(fn));
  }
 
  template <typename Predicate>
  [[nodiscard]] auto
  find_if(Predicate&& pred) const -> std::optional<registered_thread_info_backend>
  {
    return self().query().find_if(std::forward<Predicate>(pred));
  }
 
  template <typename Predicate>
  [[nodiscard]] auto
  any(Predicate&& pred) const -> bool
  {
    return self().query().any(std::forward<Predicate>(pred));
  }
 
  template <typename Predicate>
  [[nodiscard]] auto
  all(Predicate&& pred) const -> bool
  {
    return self().query().all(std::forward<Predicate>(pred));
  }
 
  template <typename Predicate>
  [[nodiscard]] auto
  none(Predicate&& pred) const -> bool
  {
    return self().query().none(std::forward<Predicate>(pred));
  }
 
  [[nodiscard]] auto
  take(size_t n) const
  {
    return self().query().take(n);
  }
 
  [[nodiscard]] auto
  skip(size_t n) const
  {
    return self().query().skip(n);
  }
};
 
} // namespace threadschedule::detail