EvaluationQueue.h

Go to the documentation of this file.

// -*- mode: c++; c-file-style: "linux"; c-basic-offset: 2; indent-tabs-mode: nil -*-
//
//  Copyright (C) 2009      Ziga Lenarcic <zigalenarcic@users.sourceforge.net>
//            (C) 2012      Doug Ilijev <doug.ilijev@gmail.com>
//            (C) 2015-2018 Gunter Königsmann <wxMaxima@physikbuch.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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
//
//  SPDX-License-Identifier: GPL-2.0+
 
#ifndef EVALUATIONQUEUE_H
#define EVALUATIONQUEUE_H
 
#include "precomp.h"
#include "GroupCell.h"
#include <wx/arrstr.h>
#include <vector>
 
class EvaluationQueue
{
private:
 
  class Command{
  public:
    Command(const wxString &string, int index) : m_indexStart(index), m_command(string) {}
    Command(Command &&o) : m_indexStart(o.m_indexStart), m_command(std::move(o.m_command)) {}
    Command(const Command &o) : m_indexStart(o.m_indexStart), m_command(o.m_command) {}
    Command &operator=(Command &&o)
    {
      m_indexStart = o.m_indexStart;
      m_command = std::move(o.m_command);
      return *this;
    }
    Command &operator=(const Command &o)
    {
      m_indexStart = o.m_indexStart;
      m_command = o.m_command;
      return *this;
    }
 
    const wxString &GetString() const { return m_command; }
    void AddEnding() { m_command += ";"; }
    int GetIndex() const { return m_indexStart; }
  private:
    int m_indexStart;
    wxString m_command;
  };
    
  std::vector<EvaluationQueue::Command> m_commands;
  int m_size;
  wxString m_userLabel;
  std::vector<GroupCell *> m_queue;
 
  void AddTokens(GroupCell *cell);
 
  wxArrayString m_knownAnswers;
  wxArrayString m_knownQuestions;
 
public:
  wxString GetUserLabel() const
  { return m_userLabel; }
 
  int GetIndex() const
    {
      if (!m_commands.empty())
        return  m_commands.front().GetIndex();
      else
        return -1;
    }
 
  bool m_workingGroupChanged;
 
  EvaluationQueue();
 
  void AddEnding()
    {
      if (!m_commands.empty())
        m_commands.back().AddEnding();
    }
  
  ~EvaluationQueue()
  {};
 
  bool IsLastInQueue(GroupCell const *gr)
  {
    return !m_queue.empty() && (gr == m_queue.front());
  }
 
  bool IsInQueue(GroupCell *gr) const;
 
  void AddToQueue(GroupCell *gr);
 
  void Remove(GroupCell *gr);
  
  void AddHiddenTreeToQueue(GroupCell *gr);
 
  void RemoveFirst();
 
  GroupCell *GetCell();
 
  bool Empty() const;
 
  void Clear();
 
  wxString GetCommand();
 
  int Size() const { return m_size; }
 
  int CommandsLeftInCell() const { return m_commands.size(); }
};
 
 
#endif /* EVALUATIONQUEUE_H */