MessageNode.hpp

#pragma once
#include <State/Address.hpp>
#include <State/Message.hpp>
#include <State/Value.hpp>
 
#include <score/config.hpp>
#include <score/model/Identifier.hpp>
#include <score/model/tree/TreeNode.hpp>
#include <score/tools/std/Optional.hpp>
 
#include <QString>
#include <QVector>
 
#include <score_lib_process_export.h>
 
#include <array>
 
namespace Process
{
class ProcessModel;
 
struct ProcessStateData
{
  Id<Process::ProcessModel> process;
  std::optional<ossia::value> value;
};
 
enum class PriorityPolicy
{
  User,
  Previous,
  Following
};
 
struct SCORE_LIB_PROCESS_EXPORT StateNodeValues
{
  bool empty() const;
 
  // TODO use lists or queues instead to manage the priorities
  std::vector<ProcessStateData> previousProcessValues;
  std::vector<ProcessStateData> followingProcessValues;
  std::optional<ossia::value> userValue;
 
  std::array<PriorityPolicy, 3> priorities{
      {PriorityPolicy::Previous, PriorityPolicy::Following, PriorityPolicy::User}};
 
  bool hasValue() const;
 
  static bool hasValue(const std::vector<ProcessStateData>& vec);
  static std::vector<ProcessStateData>::const_iterator
  value(const std::vector<ProcessStateData>& vec);
 
  // TODO here we have to choose a policy
  // if we have both previous and following processes ?
  std::optional<ossia::value> value() const;
 
  QString displayValue() const;
};
 
struct SCORE_LIB_PROCESS_EXPORT StateNodeData
{
  State::AddressAccessorHead name;
  StateNodeValues values;
  std::shared_ptr<const State::Anchor> anchor;
 
  QString displayName() const;
  bool hasValue() const;
  std::optional<ossia::value> value() const;
};
 
SCORE_LIB_PROCESS_EXPORT QDebug operator<<(QDebug d, const ProcessStateData& mess);
SCORE_LIB_PROCESS_EXPORT QDebug operator<<(QDebug d, const StateNodeData& mess);
 
using MessageNode = TreeNode<StateNodeData>;
 
SCORE_LIB_PROCESS_EXPORT State::AddressAccessor address(const MessageNode& treeNode);
SCORE_LIB_PROCESS_EXPORT State::Message message(const MessageNode& node);
SCORE_LIB_PROCESS_EXPORT State::Message userMessage(const MessageNode& node);
 
SCORE_LIB_PROCESS_EXPORT Process::MessageNode*
try_getNodeFromAddress(Process::MessageNode& root, const State::AddressAccessor& addr);
SCORE_LIB_PROCESS_EXPORT std::vector<Process::MessageNode*>
try_getNodesFromAddress(Process::MessageNode& root, const State::AddressAccessor& addr);
SCORE_LIB_PROCESS_EXPORT State::MessageList flatten(const MessageNode&);
SCORE_LIB_PROCESS_EXPORT State::MessageList getUserMessages(const MessageNode&);
SCORE_LIB_PROCESS_EXPORT bool hasMatchingAddress(
    const MessageNode& root, const std::vector<State::AddressAccessor>& addr,
    State::MessageList& msglist, std::vector<QString>& converted_addresses);
SCORE_LIB_PROCESS_EXPORT bool hasMatchingText(
    const MessageNode& root, const QString& text, State::MessageList& msglist,
    std::vector<QString>& converted_addresses);
}
 
#if SCORE_EXTERN_TEMPLATES_IN_SHARED_LIBRARIES
extern template class SCORE_LIB_PROCESS_EXPORT TreeNode<Process::StateNodeData>;
#endif