copy.hh

Go to the documentation of this file.

// This file is part of Awali.
// Copyright 2016-2023 Sylvain Lombardy, Victor Marsault, Jacques Sakarovitch
//
// Awali is a 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 3 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, see <http://www.gnu.org/licenses/>.
 
#ifndef AWALI_ALGOS_COPY_HH
# define AWALI_ALGOS_COPY_HH
 
# include <unordered_map>
 
#include <awali/sttc/core/mutable_automaton.hh>
#include <awali/sttc/core/rat/copy.hh>
#include <awali/sttc/misc/attributes.hh>
#include <awali/sttc/misc/set.hh>
#include <awali/sttc/history/single_history.hh>
 
namespace awali { namespace sttc {
 
 
  /*------------------.
  | copy(automaton).  |
  `------------------*/
 
  namespace internal
  {
    template <typename AutIn, typename AutOut, typename InOutMap=std::unordered_map<state_t, state_t>>
    struct copier
    {
      copier(const AutIn& in, AutOut& out)
        : in_(in)
        , out_(out)
      {}
 
      template <typename Pred>
      void operator()(Pred keep_state, bool transpose, bool same_index)
      {
        // Copy the states.  We cannot iterate on the transitions
        // only, as we would lose the states without transitions.
        out_state[in_->pre()] = out_->pre();
        out_state[in_->post()] = out_->post();
        for (auto s: in_->states())
          if (keep_state(s)) {
      if(same_index) {
        out_->add_state(s);
        out_state[s] = s;
        if(in_->has_name(s))
    out_->set_state_name(s, in_->get_state_name(s));       
      }
      else
        out_state[s] = out_->add_state();
    }
        for (auto t : in_->all_transitions())
          {
            auto src = out_state.find(in_->src_of(t));
            auto dst = out_state.find(in_->dst_of(t));
            if (src != out_state.end() && dst != out_state.end())
              out_->new_transition_copy(src->second, dst->second,
                                        in_, t, transpose);
          }
      }
 
      template <typename Pred>
      void no_weight(Pred keep_state, bool same_index)
      {
        // Copy the states.  We cannot iterate on the transitions
        // only, as we would lose the states without transitions.
        out_state[in_->pre()] = out_->pre();
        out_state[in_->post()] = out_->post();
        for (auto s: in_->states())
          if (keep_state(s)) {
      if(same_index) {
        out_->add_state(s);
        out_state[s] = s;
        if(in_->has_name(s))
    out_->set_state_name(s, in_->get_state_name(s));       
      }
      else
        out_state[s] = out_->add_state();
    }
        for (auto t : in_->all_transitions())
          {
            auto src = out_state.find(in_->src_of(t));
            auto dst = out_state.find(in_->dst_of(t));
            if (src != out_state.end() && dst != out_state.end())
              out_->new_transition(src->second, dst->second,
                                   in_->label_of(t));
          }
      }
 
      using origins_t = std::map<state_t, state_t>;
      origins_t
      origins() const
      {
        origins_t res;
        for (const auto& p: out_state)
          res[p.second] = p.first;
        return res;
      }
 
      static
      std::ostream&
      print(const origins_t& orig, std::ostream& o)
      {
        o << "/* Origins.\n"
          << "    node [shape = box, style = rounded]\n";
        for (auto p : orig)
          if (2 <= p.first)
            o << "    " << p.first - 2
              << " [label = \"" << p.second - 2 << "\"]\n";
        o << "*/\n";
        return o;
      }
 
      void set_history() {
        auto history = std::make_shared<single_history<AutIn>>(in_);
        out_->set_history(history);
        for (auto p: in_->all_states()) {
            history->add_state(out_state[p], p);
      if(in_->has_name(p)) {
        out_->set_state_name(out_state[p], in_->get_state_name(p));
      }
  }
      }
 
      const InOutMap& in_out_map() const {
        return out_state;
      }
      
      const AutIn& in_;
      AutOut& out_;
      InOutMap out_state;
    };
  }
 
  template <typename AutIn, typename AutOut, typename Pred>
  inline
  void
  copy_into(const AutIn& in, AutOut& out, Pred keep_state, bool keep_history=true, bool transpose=false, bool same_index=false)
  {
    internal::copier<AutIn, AutOut> copy(in, out);
    copy(keep_state, transpose, same_index);
    if(keep_history)
      copy.set_history();
  }
 
  template <typename AutIn, typename AutOut>
  inline
  void
  copy_into(const AutIn& in, AutOut& out, bool keep_history=true, bool transpose=false, bool same_index=false)
  {
    copy_into(in, out, [](state_t) { return true; }, keep_history, transpose, same_index);
  }
 
  template <typename AutIn, typename AutOut, typename Pred>
  inline
  void
  copy_support(const AutIn& in, AutOut& out, Pred keep_state, bool keep_history=true, bool same_index=false)
  {
    internal::copier<AutIn, AutOut> copy(in, out);
    copy.no_weight(keep_state, same_index);
    if(keep_history)
      copy.set_history();
  }
 
  template <typename AutIn, typename AutOut>
  inline
  void
  copy_support(const AutIn& in, AutOut& out, bool keep_history=true, bool same_index=false)
  {
    internal::copier<AutIn, AutOut> copy(in, out);
    copy.no_weight([](state_t) { return true; }, same_index);
    if(keep_history)
      copy.set_history();
  }
 
  template <typename AutIn,
            typename AutOut = typename AutIn::element_type::automaton_nocv_t,
            typename Pred>
  inline
  AutOut
  copy(const AutIn& input, Pred keep_state, bool keep_history=true, bool transpose=false, bool same_index=false)
  {
    // FIXME: here, we need a means to convert the given input context
    // (e.g. letter -> B) into the destination one (e.g., letter ->
    // Q).  The automaton constructor wants the exact context type.
    auto res = make_mutable_automaton(input->context());
    sttc::copy_into(input, res, keep_state, keep_history, transpose, same_index);
    res->set_name(input->get_name());
    res->set_desc(input->get_desc());
    return res;
  }
 
  template <typename AutIn,
            typename AutOut = typename AutIn::element_type::automaton_nocv_t>
  inline
  AutOut
  copy(const AutIn& input, bool keep_history=true, bool transpose=false, bool same_index=false)
  {
    return sttc::copy<AutIn, AutOut>(input,
             [](state_t) { return true; }, keep_history, transpose, same_index);
  }
 
  template <typename AutIn,
            typename AutOut = typename AutIn::element_type::automaton_nocv_t>
  inline
  AutOut
  copy(const AutIn& input, const std::set<state_t>& keep, bool keep_history=true, bool transpose=false, bool same_index=false)
  {
    return sttc::copy<AutIn, AutOut>
      (input,
       [&keep](state_t s) { return keep.find(s)!=keep.end(); }, keep_history, transpose, same_index);
  }
 
}}//end of ns awali::stc
 
#endif // !AWALI_ALGOS_COPY_HH