call-queue.hpp

Go to the documentation of this file.

/*
  CALL-QUEUE.hpp  -  a queue to dispatch bound function invocations into another thread

  Copyright (C)         Lumiera.org
    2017,               Hermann Vosseler <Ichthyostega@web.de>

  This program is free software; you can redistribute it and/or
  modify it under the terms of the GNU General Public License as
  published by the Free Software Foundation; either version 2 of
  the License, or (at your option) any later version.

  This program is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  GNU General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with this program; if not, write to the Free Software
  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

*/

#ifndef LIB_CALL_QUEUE_H
#define LIB_CALL_QUEUE_H


#include "lib/error.hpp"
#include "lib/sync.hpp"
#include "lib/iter-stack.hpp"
#include "lib/nocopy.hpp"

#include <functional>


namespace lib {
  namespace error = lumiera::error;
  
  
  
  /*********************************************************/
  class CallQueue
    : util::NonCopyable
    , public Sync<>
    {
    public:
      using Operation = std::function<void(void)>;
      
    private:
      lib::IterQueue<Operation> queue_;
      
    public:
      CallQueue() { }
      
      
      CallQueue&
      feed (Operation&& op)
        {
          if (not op)
            throw error::Logic( "Unbound Functor fed to dispatcher CallQueue"
                              , error::LUMIERA_ERROR_BOTTOM_VALUE);
          {
            Lock sync{this};
            queue_.feed (move(op));
          }
          return *this;
        }
      
      CallQueue&
      invoke()
        {
          if (not empty())
            {
              Operation operate;
              {
                Lock sync{this};
                operate = move (*queue_);
                ++queue_;
              }
              ASSERT (operate);
              operate();
            }
          return *this;
        }
      
      
      /* == diagnostics == */
      
      size_t
      size()  const
        {
          Lock sync{this};
          return queue_.size();
        }
      
      bool
      empty() const
        {
          return 0 == size();
        }
    };
  
  
  
} // namespace lib
#endif /*LIB_CALL_QUEUE_H*/