tree-diff.cpp

Go to the documentation of this file.

/*
  TreeDiff  -  implementation of diff application to opaque data

  Copyright (C)         Lumiera.org
    2016,               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.

* *****************************************************/


#include "lib/error.hpp"
#include "lib/diff/tree-diff-application.hpp"



namespace lib {
namespace diff{
  
  TreeMutator::~TreeMutator() { }  
  
  ScopeManager::~ScopeManager() { };

  
  
  
  
  /* ======= Implementation of Tree Diff Application via TreeMutator ======= */
  
  using util::unConst;
  using util::_Fmt;
  using std::move;
  using std::swap;
  
  
  template<>
  void
  Record<GenNode>::Mutator::buildMutator (BufferHandle buff)
  {
     buff.emplace (
       TreeMutator::build()
                   .attach (*this));
  }
  
  
  
  
  
  /* == Forwarding: error handling == */
  
  
  void
  TreeDiffMutatorBinding::__failMismatch (Literal oper, GenNode const& spec)
  {
    throw error::State{_Fmt("Unable to %s element %s. Current shape of target "
                            "data does not match expectations") % oper % spec
                      , LERR_(DIFF_CONFLICT)};
  }
  
  void
  TreeDiffMutatorBinding::__expect_further_elements (GenNode const& elm)
  {
    if (not treeMutator_->hasSrc())
      throw error::State{_Fmt("Premature end of target sequence, still expecting element %s; "
                              "unable to apply diff further.") % elm
                        , LERR_(DIFF_CONFLICT)};
  }
  
  void
  TreeDiffMutatorBinding::__fail_not_found (GenNode const& elm)
  {
      throw error::State{_Fmt("Premature end of sequence; unable to locate "
                              "element %s in the remainder of the target.") % elm
                        , LERR_(DIFF_CONFLICT)};
  }
  
  void
  TreeDiffMutatorBinding::__expect_end_of_scope (GenNode::ID const& idi)
  {
    if (not treeMutator_->completeScope())
      throw error::State{_Fmt("Diff application floundered in nested scope %s; "
                              "unexpected extra elements found when diff "
                              "should have settled everything.") % idi.getSym()
                        , LERR_(DIFF_STRUCTURE)};
  }
  
  void
  TreeDiffMutatorBinding::__expect_valid_parent_scope (GenNode::ID const& idi)
  {
    if (0 == scopeManger_->depth())
      throw error::Fatal{_Fmt("Diff application floundered after leaving scope %s; "
                              "unbalanced nested scopes, diff attempts to pop root.") % idi.getSym()
                        , LERR_(DIFF_STRUCTURE)};
  }
  
  
  
  
  
  /* == Implementation of the list diff application primitives == */
  
  void
  TreeDiffMutatorBinding::ins (GenNode const& n)
  {
    bool success = treeMutator_->injectNew(n);
    if (not success)
      __failMismatch ("insert", n);
  }
  
  void
  TreeDiffMutatorBinding::del (GenNode const& n)
  {
    __expect_further_elements(n);
    if (not treeMutator_->matchSrc(n))
      __failMismatch("remove", n);
    
    treeMutator_->skipSrc(n);
  }
  
  void
  TreeDiffMutatorBinding::pick (GenNode const& n)
  {
    bool success = treeMutator_->acceptSrc (n);
    if (not success)
      __failMismatch ("pick", n);
  }
  
  void
  TreeDiffMutatorBinding::skip (GenNode const& n)
  {
    __expect_further_elements (n);
    treeMutator_->skipSrc(n);
  }      // assume the actual content has been moved away by a previous find()
  
  void
  TreeDiffMutatorBinding::find (GenNode const& n)
  {
    __expect_further_elements (n);
         // consume and leave waste, expected to be cleaned-up by skip() later
    if (not treeMutator_->findSrc(n))
      __fail_not_found (n);
  }
  
  
  
  
  /* == Implementation of the tree diff application primitives == */
  
  void
  TreeDiffMutatorBinding::after (GenNode const& n)
  {
    if (not treeMutator_->accept_until(n))
      __fail_not_found (n);
  }
  
  void
  TreeDiffMutatorBinding::set (GenNode const& n)
  {
    if (not treeMutator_->assignElm(n))
      __failMismatch("assign", n);
  }
  
  void
  TreeDiffMutatorBinding::mut (GenNode const& n)
  {
    TreeMutator::Handle buffHandle = scopeManger_->openScope();      // hint: treeMutatorSize(...)
    if (not treeMutator_->mutateChild(n, buffHandle))
      __failMismatch("enter nested scope", n);
    
    TRACE (diff, "tree-diff: ENTER scope %s", cStr(n.idi));
    treeMutator_ = buffHandle.get();
  }
  
  void
  TreeDiffMutatorBinding::emu (GenNode const& n)
  {
    TRACE (diff, "tree-diff: LEAVE scope %s", cStr(n.idi));
    
    __expect_end_of_scope (n.idi);
    treeMutator_ = &scopeManger_->closeScope();
    __expect_valid_parent_scope (n.idi);
  }
  
  
  
}} // namespace lib::diff