2011-06-27 15:31:41 +10:00
|
|
|
/*
|
2018-08-04 15:14:06 +10:00
|
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
2011-06-27 15:31:41 +10:00
|
|
|
*
|
2019-03-12 15:38:42 +11:00
|
|
|
* Copyright 2011-2019 Danny Robson <danny@nerdcruft.net>
|
2011-06-27 15:31:41 +10:00
|
|
|
*/
|
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
#pragma once
|
2011-06-27 15:31:41 +10:00
|
|
|
|
2015-03-10 22:52:38 +11:00
|
|
|
#include "types/traits.hpp"
|
2018-02-28 11:49:13 +11:00
|
|
|
#include "debug.hpp"
|
|
|
|
#include "nocopy.hpp"
|
2011-08-10 21:31:24 +10:00
|
|
|
|
2018-02-28 11:49:13 +11:00
|
|
|
#include <algorithm>
|
2011-06-27 15:31:41 +10:00
|
|
|
#include <functional>
|
2015-02-18 02:34:10 +11:00
|
|
|
#include <list>
|
2011-06-27 15:31:41 +10:00
|
|
|
|
2018-08-05 14:42:02 +10:00
|
|
|
namespace cruft {
|
2019-03-12 15:38:42 +11:00
|
|
|
namespace reduce {
|
|
|
|
template <typename FunctionT>
|
2015-03-10 22:52:38 +11:00
|
|
|
struct logical_and {
|
2019-03-12 15:38:42 +11:00
|
|
|
using result = typename func_traits<FunctionT>::return_type;
|
2015-03-10 22:52:38 +11:00
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
template <typename InputT, typename ...Args>
|
|
|
|
result operator() (InputT first, InputT last, Args&&... args)
|
2015-03-10 22:52:38 +11:00
|
|
|
{
|
|
|
|
while (first != last)
|
2017-08-08 13:54:45 +10:00
|
|
|
if (!(*first++)(args...))
|
2015-03-10 22:52:38 +11:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
template <typename FunctionT>
|
2015-03-10 22:52:38 +11:00
|
|
|
struct logical_or {
|
2019-03-12 15:38:42 +11:00
|
|
|
using result = typename func_traits<FunctionT>::return_type;
|
2015-03-10 22:52:38 +11:00
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
template <typename InputT, typename ...Args>
|
|
|
|
result operator() (InputT first, InputT last, Args&&... args)
|
2015-03-10 22:52:38 +11:00
|
|
|
{
|
|
|
|
while (first != last)
|
2017-08-08 13:54:45 +10:00
|
|
|
if ((*first++)(args...))
|
2015-03-10 22:52:38 +11:00
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
template <typename FunctionT>
|
2015-03-10 22:52:38 +11:00
|
|
|
struct noop {
|
2019-03-12 15:38:42 +11:00
|
|
|
using result = void;
|
2015-03-10 22:52:38 +11:00
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
template <typename InputT, typename ...Args>
|
|
|
|
result operator() (InputT first, InputT last, Args&&... args)
|
2015-03-10 22:52:38 +11:00
|
|
|
{
|
|
|
|
while (first != last) {
|
2017-08-08 13:54:45 +10:00
|
|
|
(*first++)(args...);
|
2015-03-10 22:52:38 +11:00
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
template <
|
|
|
|
typename FunctionT,
|
|
|
|
template <typename> class ReductionT = reduce::noop
|
|
|
|
>
|
2011-07-16 14:47:56 +10:00
|
|
|
class signal {
|
|
|
|
public:
|
2019-03-12 15:38:42 +11:00
|
|
|
using result = typename ReductionT<FunctionT>::result;
|
|
|
|
using callback = std::function<FunctionT>;
|
2011-08-10 21:31:24 +10:00
|
|
|
|
2015-02-18 02:34:10 +11:00
|
|
|
struct cookie;
|
2011-06-27 15:31:41 +10:00
|
|
|
|
2011-07-16 14:47:56 +10:00
|
|
|
public:
|
2018-02-28 11:49:13 +11:00
|
|
|
signal () = default;
|
|
|
|
~signal ()
|
|
|
|
{
|
|
|
|
CHECK (empty ());
|
|
|
|
}
|
2011-06-27 15:31:41 +10:00
|
|
|
|
2011-07-16 14:47:56 +10:00
|
|
|
/// Add a callback to list.
|
2018-02-28 11:49:13 +11:00
|
|
|
cookie connect [[nodiscard]] (callback &&_cb)
|
|
|
|
{
|
|
|
|
return cookie (
|
|
|
|
m_children.insert (
|
|
|
|
m_children.end (),
|
|
|
|
std::move (_cb)
|
|
|
|
),
|
|
|
|
*this
|
|
|
|
);
|
|
|
|
}
|
2015-02-18 02:34:10 +11:00
|
|
|
|
2018-02-28 11:49:13 +11:00
|
|
|
cookie connect [[nodiscard]] (const callback &_cb)
|
|
|
|
{
|
|
|
|
{
|
|
|
|
return cookie (
|
|
|
|
m_children.insert (
|
|
|
|
m_children.end (),
|
|
|
|
std::move (_cb)
|
|
|
|
),
|
|
|
|
*this
|
|
|
|
);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void disconnect (cookie &c)
|
|
|
|
{
|
|
|
|
m_children.erase (c.m_position);
|
|
|
|
c.m_position = m_children.end ();
|
|
|
|
}
|
2011-06-27 15:31:41 +10:00
|
|
|
|
2011-07-16 14:47:56 +10:00
|
|
|
/// Disconnect all callbacks
|
2018-02-28 11:49:13 +11:00
|
|
|
void clear (void)
|
|
|
|
{
|
|
|
|
m_children.clear ();
|
|
|
|
}
|
2011-08-10 21:31:24 +10:00
|
|
|
|
2011-07-16 14:47:56 +10:00
|
|
|
/// Returns the number of callbacks connected.
|
2018-02-28 11:49:13 +11:00
|
|
|
size_t size (void) const
|
|
|
|
{
|
|
|
|
return m_children.size ();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool empty (void) const
|
|
|
|
{
|
|
|
|
return m_children.empty ();
|
|
|
|
}
|
2011-08-10 21:30:03 +10:00
|
|
|
|
2015-03-10 22:52:38 +11:00
|
|
|
/// Execute all callbacks
|
2019-03-12 15:38:42 +11:00
|
|
|
template <typename ...ArgsT>
|
|
|
|
result
|
|
|
|
operator() (ArgsT&&... tail)
|
2018-02-28 11:49:13 +11:00
|
|
|
{
|
|
|
|
if (m_children.empty ())
|
2019-03-12 15:38:42 +11:00
|
|
|
return result();
|
2018-02-28 11:49:13 +11:00
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
ReductionT<FunctionT> reducer;
|
|
|
|
return reducer (
|
2018-02-28 11:49:13 +11:00
|
|
|
m_children.begin (),
|
|
|
|
m_children.end (),
|
2019-03-12 15:38:42 +11:00
|
|
|
std::forward<ArgsT> (tail)...
|
2018-02-28 11:49:13 +11:00
|
|
|
);
|
|
|
|
}
|
2015-02-18 02:34:10 +11:00
|
|
|
|
|
|
|
private:
|
|
|
|
typedef std::list<callback> group;
|
|
|
|
group m_children;
|
2011-07-16 14:47:56 +10:00
|
|
|
};
|
2015-02-19 13:27:47 +11:00
|
|
|
|
2018-02-28 11:49:13 +11:00
|
|
|
|
|
|
|
///////////////////////////////////////////////////////////////////////////
|
2019-03-12 15:38:42 +11:00
|
|
|
template <typename FunctionT, template <typename> class ReductionT>
|
|
|
|
struct signal<FunctionT,ReductionT>::cookie : public nocopy {
|
2018-02-28 11:49:13 +11:00
|
|
|
cookie (typename group::iterator _position,
|
2019-03-12 15:38:42 +11:00
|
|
|
signal<FunctionT,ReductionT> &_parent):
|
2018-02-28 11:49:13 +11:00
|
|
|
m_position (_position),
|
|
|
|
m_parent (_parent)
|
|
|
|
{ ; }
|
|
|
|
|
|
|
|
cookie (cookie &&rhs):
|
|
|
|
m_position (rhs.m_position),
|
|
|
|
m_parent (rhs.m_parent)
|
|
|
|
{
|
|
|
|
rhs.m_position = rhs.m_parent.m_children.end ();
|
|
|
|
}
|
|
|
|
|
|
|
|
~cookie ()
|
|
|
|
{
|
|
|
|
if (m_parent.m_children.end () != m_position)
|
|
|
|
m_parent.disconnect (*this);
|
|
|
|
}
|
|
|
|
|
|
|
|
void reset (callback &&cb)
|
|
|
|
{
|
|
|
|
*m_position = std::move (cb);
|
|
|
|
}
|
|
|
|
|
|
|
|
typename group::iterator m_position;
|
2019-03-12 15:38:42 +11:00
|
|
|
signal<FunctionT,ReductionT> &m_parent;
|
2018-02-28 11:49:13 +11:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-03-10 22:52:38 +11:00
|
|
|
///////////////////////////////////////////////////////////////////////////
|
|
|
|
// wrap a value in a signal and trigger on assignment
|
2019-03-12 15:38:42 +11:00
|
|
|
//template <typename T, template <typename> class ReductionT>
|
|
|
|
template <typename ValueT>
|
|
|
|
class value_signal : public signal<void(ValueT)> {
|
2015-02-19 13:27:47 +11:00
|
|
|
public:
|
2019-03-12 15:38:42 +11:00
|
|
|
explicit value_signal (ValueT _value): m_value (_value) { ; }
|
2015-02-20 15:27:18 +11:00
|
|
|
value_signal () = default;
|
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
operator const ValueT&() const { return m_value; }
|
2015-02-19 13:27:47 +11:00
|
|
|
|
2019-03-12 15:38:42 +11:00
|
|
|
value_signal<ValueT>&
|
|
|
|
operator= (const ValueT &t)
|
2018-02-28 11:49:13 +11:00
|
|
|
{
|
|
|
|
m_value = t;
|
|
|
|
(*this) (m_value);
|
|
|
|
return *this;
|
|
|
|
}
|
2015-02-19 13:27:47 +11:00
|
|
|
|
|
|
|
private:
|
2019-03-12 15:38:42 +11:00
|
|
|
ValueT m_value;
|
2015-02-19 13:27:47 +11:00
|
|
|
};
|
2011-07-16 14:47:56 +10:00
|
|
|
}
|