edit-automaton.hh

Go to the documentation of this file.

#pragma once

#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

#include <vcsn/core/name-automaton.hh>
#include <vcsn/ctx/context.hh>
#include <vcsn/ctx/fwd.hh>
#include <vcsn/dyn/algos.hh>
#include <vcsn/dyn/automaton.hh>
#include <vcsn/dyn/context.hh>
#include <vcsn/dyn/fwd.hh>
#include <vcsn/misc/symbol.hh>
#include <vcsn/misc/raise.hh>
#include <vcsn/misc/static-if.hh>
#include <vcsn/misc/stream.hh>
#include <vcsn/weightset/polynomialset.hh>

namespace vcsn
{

  /*----------------------.
  | edit_automaton<Aut>.  |
  `----------------------*/

  class automaton_editor
  {
  public:
    using string_t = symbol;

    virtual ~automaton_editor() {}
    virtual void add_initial(string_t s, string_t w) = 0;
    virtual void add_final(string_t s, string_t w) = 0;

    virtual void add_state(string_t s) = 0;

    virtual void add_pre(string_t s) = 0;

    virtual void add_post(string_t s) = 0;

    virtual void add_entry(string_t src, string_t dst,
                           string_t entry) = 0;

    virtual void add_transition(string_t src, string_t dst,
                                string_t label,
                                string_t weight = string_t{}) = 0;

    virtual bool open(bool o) = 0;

    virtual dyn::automaton result() = 0;

    virtual void reset() = 0;

    void set_separator(char c)
    {
      sep_ = c;
    }

  protected:
    char sep_ = '+';
  };


  template <Automaton Aut>
  class edit_automaton: public automaton_editor
  {
  public:
    using super_t = automaton_editor;
    using automaton_t = name_automaton<Aut>;
    using string_t = super_t::string_t;

  private:
    using context_t = context_t_of<automaton_t>;
    using entry_t = typename polynomialset<context_t>::value_t;
    using state_t = state_t_of<automaton_t>;
    using label_t = label_t_of<automaton_t>;
    using labelset_t = labelset_t_of<automaton_t>;
    using weight_t = weight_t_of<automaton_t>;

  public:
    edit_automaton(const context_t& ctx)
      : res_(make_shared_ptr<automaton_t>(ctx))
      , ps_(ctx)
    {}

    bool
    open(bool o) override final
    {
      return const_cast<labelset_t&>(*res_->context().labelset()).open(o);
    }

    void
    add_state(string_t s) override final
    {
      state_(s);
    }

    void
    add_pre(string_t s) override final
    {
      res_->state(s, res_->pre());
    }

    void
    add_post(string_t s) override final
    {
      res_->state(s, res_->post());
    }

    void
    add_initial(string_t s, string_t weight = string_t{}) override final
    {
      res_->add_initial(state_(s), weight_(weight));
    }

    void
    add_final(string_t s, string_t weight = string_t{}) override final
    {
      res_->add_final(state_(s), weight_(weight));
    }

    void
    add_transition(string_t src, string_t dst,
                   string_t label,
                   string_t weight = string_t{}) override final
    {
      // In case of states we don't know, we'd like to register s
      // first, then d, in an attempt to keep the order in which we
      // discover states.  Which is not guaranteed by plain argument
      // evaluation.
      auto s = state_(src);
      auto d = state_(dst);
      res_->add_transition(s, d, label_(label), weight_(weight));
    }

    void
    add_entry(string_t src, string_t dst, string_t entry) override final
    {
      const auto s = state_(src);
      const auto d = state_(dst);
      require(s != res_->pre() || d != res_->post(),
              "edit_automaton: invalid transition from pre to post: ",
              src, " -> ", dst, " (", entry, ")");
      const auto& ls = *res_->labelset();
      if (s == res_->pre() || d == res_->post())
        {
          if (entry.get().empty())
            res_->add_transition(s, d, res_->prepost_label());
          else
            {
              using std::begin;
              // Adding a pre/post transition: be sure that it's only
              // a weight.
              const auto p = conv(ps_, entry, sep_);
              const auto m = *begin(p);
              VCSN_REQUIRE(p.size() == 1
                           && ls.is_special(label_of(m)),
                           "edit_automaton: invalid ",
                           s == res_->pre() ? "initial" : "final",
                           " entry: ", entry.get());
              res_->add_transition(s, d,
                                   res_->prepost_label(), weight_of(m));
            }
        }
      else
        {
          auto p = emap_.emplace(entry, entry_t{});
          if (p.second)
            p.first->second = conv(ps_, entry, sep_);
          for (auto m: p.first->second)
            {
              detail::static_if<labelset_t::has_one()>
                ([&](const auto& ls)
                 {
                   res_->add_transition
                     (s, d,
                      ls.is_special(label_of(m)) ? ls.one() : label_of(m),
                      weight_of(m));
                 },
                 [&](const auto& ls)
                 {
                   VCSN_REQUIRE(!ls.is_special(label_of(m)),
                                "edit_automaton: invalid entry: ",
                                entry.get());
                   res_->add_transition(s, d,
                                        label_of(m), weight_of(m));
                 })
                (ls);
            }
        }
    }

    dyn::automaton
    result() override final
    {
      const_cast<labelset_t&>(*res_->context().labelset()).open(false);
      return res_;
    }

    void
    reset() override final
    {
      res_ = nullptr;
    }

  private:
    label_t
    label_(string_t l)
    {
      const auto& ls = *res_->labelset();
      auto p = lmap_.emplace(l, label_t{});
      if (p.second)
        p.first->second = conv(ls, l);
      return p.first->second;
    }

    weight_t
    weight_(string_t w)
    {
      const auto& ws = *res_->weightset();
      auto p = wmap_.emplace(w, weight_t{});
      if (p.second)
        p.first->second = w.get().empty() ? ws.one() : conv(ws, w);
      return p.first->second;
    }

    state_t
    state_(string_t k)
    {
      return res_->state(k);
    }

    automaton_t res_;
    polynomialset<context_t> ps_;

    using entry_map = std::unordered_map<string_t, entry_t>;
    entry_map emap_;
    using label_map = std::unordered_map<string_t, label_t>;
    label_map lmap_;
    using weight_map = std::unordered_map<string_t, weight_t>;
    weight_map wmap_;
  };

  class lazy_automaton_editor
  {
  public:
    using string_t = automaton_editor::string_t;

    enum class labelset_type { empty, lal, lan, law };

    enum class weightset_type { logarithmic, numerical, tropical };

    void add_initial(string_t s, string_t w = string_t{});

    void add_final(string_t s, string_t w = string_t{});

    void add_transition(string_t src, string_t dst,
                        string_t lbl, string_t w = string_t{});

    void add_transition(string_t src, string_t dst,
                        string_t lbl1, string_t lbl2,
                        string_t w);

    std::string result_context() const;

    dyn::automaton result(const std::string& ctx = {});

    bool open(bool o);

    void reset();

    void weightset(weightset_type t) { weightset_type_ = t; };

  private:
    void register_weight_(string_t w);

    using transition_t = std::tuple<string_t, string_t, string_t, string_t>;
    std::vector<transition_t> transitions_;
    std::vector<std::pair<string_t, string_t>> initial_states_;
    std::vector<std::pair<string_t, string_t>> final_states_;
    labelset_type input_type_ = labelset_type::empty;
    labelset_type output_type_ = labelset_type::empty;
    bool weighted_ = false;
    bool real_ = false;
    bool open_ = false;
    weightset_type weightset_type_ = weightset_type::numerical;
  };

  namespace dyn
  {
    namespace detail
    {
      template <typename Ctx>
      automaton_editor*
      make_automaton_editor(const context& ctx)
      {
        const auto& c = ctx->as<Ctx>();
        return new edit_automaton<mutable_automaton<Ctx>>(c);
      }
    }
  }
} // vcsn::