mir/libreoffice
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
ecd1b86a938f4f85cc38ae6fefaf15ebd0d9f97f
libreoffice/configmgr/source/misc/mergechange.cxx

954 lines
35 KiB
C++
Raw Blame History

/*************************************************************************
*
* $RCSfile: mergechange.cxx,v $
*
* $Revision: 1.9 $
*
* last change: $Author: jb $ $Date: 2001-07-06 15:28:50 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (the "License"); You may not use this file
* except in compliance with the License. You may obtain a copy of the
* License at http://www.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
#include <stdio.h>
#include "mergechange.hxx"
#ifndef CONFIGMGR_CHANGE_HXX
#include "change.hxx"
#endif
#ifndef CONFIGMGR_TREECHANGELIST_HXX
#include "treechangelist.hxx"
#endif
#ifndef _CONFIGMGR_TREEACTIONS_HXX_
#include "treeactions.hxx"
#endif
#ifndef CONFIGMGR_CONFIGEXCEPT_HXX_
#include "configexcept.hxx"
#endif
#ifndef _CONFIGMGR_TRACER_HXX_
#include "tracer.hxx"
#endif
#define ASCII(x) rtl::OUString::createFromAscii(x)
namespace configmgr
{
using namespace com::sun::star::uno;
using namespace configuration;
using namespace std;
RelativePath ONameCreator::buildPath() const
{
Path::Rep aAdded;
for(NameList::const_reverse_iterator it = m_aNameList.rbegin(),
stop = m_aNameList.rend();
it != stop;
++it)
{
aAdded.prepend(*it);
}
return RelativePath(aAdded);
}
RelativePath ONameCreator::buildPath(const FullName &aPlusName) const
{
OSL_ENSURE( !aPlusName.isEmpty(), "To create the base name use the parameterless overload" );
Path::Rep aAdded(aPlusName);
for(NameList::const_reverse_iterator it = m_aNameList.rbegin(),
stop = m_aNameList.rend();
it != stop;
++it)
{
aAdded.prepend(*it);
}
return RelativePath(aAdded);
}
Path::Component ONameCreator::createName(Change const& _rChange, SubtreeChange const* _pParent)
{
OSL_ENSURE(_pParent, "ONameCreator: Cannot create proper name without a parent");
if (_pParent && _pParent->isSetNodeChange())
{
OUString sElementName = _rChange.getNodeName();
OUString sTypeName = _pParent->getElementTemplateName();
return Path::makeCompositeName(sElementName, sTypeName);
}
else
{
OUString sElementName = _rChange.getNodeName();
// OSL_ENSURE(isSimpleName(sElementName),"Unexpected: Non-simple name in non-set node");
return Path::wrapSafeName(sElementName);
}
}
// -----------------------------------------------------------------------------
class OMergeValueChange : private ChangeTreeModification
{
SubtreeChange& m_rTargetParent;
const ValueChange& m_aValueChange;
public:
OMergeValueChange(SubtreeChange& _rTargetParent, const ValueChange& _aValueChange)
:m_rTargetParent(_rTargetParent)
,m_aValueChange(_aValueChange)
{
}
void handleChange(Change &_rNode)
{
applyToChange(_rNode);
}
private:
virtual void handle(ValueChange& _rValueChange)
{
// POST: Handle ValueChange
_rValueChange.setNewValue(m_aValueChange.getNewValue(), m_aValueChange.getMode());
}
virtual void handle(RemoveNode& _rRemoveNode)
{
OSL_ENSURE(false, "OMergeValueChange::handle(ValueChange): have a ValueChange for a removed node!");
// should never happen. How did the user change a value for a node which is obviously flagged as removed?
}
virtual void handle(AddNode& _rAddNode)
{
// POST: Handle ValueChange in AddNode
INode* pINode = _rAddNode.getAddedNode();
if (ValueNode *pValueNode = pINode->asValueNode())
pValueNode->setValue( m_aValueChange.getNewValue() );
else if (ISubtree* pValueSetNode = pINode->asISubtree() )
{
if ( isLocalizedValueSet(*pValueSetNode) )
{
std::auto_ptr<ValueNode> pNewValueNode = createNodeFromChange(m_aValueChange);
if (pNewValueNode.get())
{
OSL_ENSURE(pNewValueNode->isLocalized(), "OMergeValueChange:handle(AddNode): have a non-localized ValueChange a for a localized node!");
std::auto_ptr<INode> pNewNode(pNewValueNode.release());
std::auto_ptr<AddNode> pNewAdd( new AddNode(pNewNode,m_aValueChange.getNodeName()) );
if (_rAddNode.isReplacing())
pNewAdd->setReplacing();
std::auto_ptr<Change> pNewChange( pNewAdd.release() );
replaceExistingEntry(pNewChange);
}
else
OSL_ENSURE(false, "OMergeValueChange:handle(SubtreeChange): Creating a NULL node to replace a localized value set not yet supported");
}
else
OSL_ENSURE(sal_False, "OMergeValueChange:handle(AddNode): have a ValueChange a for non-value node!");
}
else
OSL_ENSURE(sal_False, "OMergeValueChange:handle(AddNode): Found unknown node type!");
}
virtual void handle(SubtreeChange& _rSubtree)
{
if ( isLocalizedValueSet(_rSubtree) )
{
std::auto_ptr<ValueChange> pNewValueChange( new ValueChange(m_aValueChange) );
OSL_ENSURE(pNewValueChange->isLocalized(), "OMergeValueChange:handle(SubtreeChange): have a non-localized ValueChange a for a localized node!");
std::auto_ptr<Change> pNewChange( pNewValueChange.release() );
replaceExistingEntry(pNewChange);
}
else
OSL_ENSURE(false, "OMergeValueChange:handle(SubtreeChange): have a ValueChange for a sub tree!");
}
void replaceExistingEntry(std::auto_ptr<Change> pNewChange)
{
m_rTargetParent.removeChange(pNewChange->getNodeName());
m_rTargetParent.addChange(pNewChange);
}
static std::auto_ptr<ValueNode> createNodeFromChange(ValueChange const& rChange)
{
std::auto_ptr<ValueNode> aRet;
uno::Any aNewValue = rChange.getNewValue();
// currently not supporting change modes !
if (aNewValue.hasValue())
aRet.reset( new ValueNode(rChange.getNodeName(), aNewValue, rChange.getAttributes()) );
else // NULL - try to find out the type
{
uno::Any aOldValue = rChange.getOldValue();
if (aOldValue.hasValue())
aRet.reset( new ValueNode(rChange.getNodeName(), aOldValue.getValueType(), rChange.getAttributes()) );
else
OSL_ENSURE(false, "Cannot recover type for change to NULL");
}
return aRet;
}
};
// -----------------------------------------------------------------------------
class OMergeRemoveNode : private ChangeTreeModification
{
public:
// actions to take with the remove node change
enum Action
{
RemoveCompletely,
FlagDeleted,
Undetermined
};
protected:
Action m_eAction;
public:
OMergeRemoveNode() : m_eAction(Undetermined) { }
Action getAction() const { return m_eAction; }
void handleChange(Change* _pChange)
{
if (_pChange)
applyToChange(*_pChange);
else
// no change -> flag as deleted
m_eAction = FlagDeleted;
}
private:
virtual void handle(ValueChange& aValueChange)
{
m_eAction = FlagDeleted;
}
virtual void handle(RemoveNode& _rRemoveNode)
{
OSL_ENSURE(false, "OMergeRemoveNode::handle(RemoveNode): should never happen!");
// how can a RemoveNode change exist if in the file we're merging it into
// there already is such a RemoveNode change (_rRemoveNode)?
}
virtual void handle(AddNode& _rAddNode)
{
if (_rAddNode.isReplacing())
m_eAction = FlagDeleted;
else
m_eAction = RemoveCompletely;
}
virtual void handle(SubtreeChange& _rSubtree)
{
m_eAction = FlagDeleted;
// TODO: need an extra state to distinguish between nodes which are overwritten in the user layer
// and nodes which are added to the user layer, but not existent in the share layer
// In the latter case m_eAction could be set to RemoveCompletely
}
};
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
static
inline
Change* findExistingChange(SubtreeChange* pCurrentParent, Path::Component const & _aName)
{
OSL_ASSERT(pCurrentParent);
Change *pChange = pCurrentParent->getChange(_aName.getName().toString());
if (!pChange && !_aName.isSimpleName())
{
pChange = pCurrentParent->getChange(_aName.toPathString());
OSL_ENSURE(!pChange, "Update trouble: Existing node found only by composite name while merging");
}
return pChange;
}
static
inline
Change* findExistingChange(SubtreeChange* pCurrentParent, OUString const & _aName)
{
OSL_ASSERT(pCurrentParent);
Change *pChange = pCurrentParent->getChange(_aName);
return pChange;
}
// -----------------------------------------------------------------------------
void adjustElementTemplate(SubtreeChange& _rChange, const rtl::OUString& _rName, const rtl::OUString& _rModule)
{
if (!_rChange.isSetNodeChange())
{
_rChange.setElementTemplate(_rName,_rModule);
}
OSL_POSTCOND(_rChange.getElementTemplateName() == _rName, "Adjusting: Template modules do not match");
OSL_POSTCOND(_rChange.getElementTemplateModule() == _rModule, "Adjusting: Template modules do not match");
}
// -----------------------------------------------------------------------------
inline void adjustElementTemplate(SubtreeChange& _rChange, SubtreeChange const& _rSource)
{
if (_rSource.isSetNodeChange())
adjustElementTemplate(_rChange, _rSource.getElementTemplateName(), _rSource.getElementTemplateModule());
}
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
// Main class for merging treechangelists
// CTor
OMergeTreeChangeList::OMergeTreeChangeList(TreeChangeList& _aTree)
:m_aTreeChangeList(_aTree), m_pCurrentParent(NULL)
{
}
void OMergeTreeChangeList::initRoot(TreeChangeList const& _aChanges)
{
AbsolutePath aThisRootPath = m_aTreeChangeList.getRootNodePath();
AbsolutePath aStartPath = _aChanges.getRootNodePath();
RelativePath aEnsurePath = Path::stripPrefix(aStartPath,aThisRootPath);
SubtreeChange* pCurrentParent = &m_aTreeChangeList.root;
for(RelativePath::Iterator it = aEnsurePath.begin(), stop = aEnsurePath.end();
it != stop;
++it)
{
Change *pChange = findExistingChange(pCurrentParent,*it);
if (!pChange)
{
// create a correspondens for the name, we did not find.
auto_ptr<SubtreeChange> pNewChange(new SubtreeChange(it->getName().toString(), configuration::Attributes()));
pChange = pNewChange.get();
pCurrentParent->addChange(auto_ptr<Change>(pNewChange.release()));
OSL_ENSURE(pChange == findExistingChange(pCurrentParent,*it),
"ERROR: Newly added change cannot be found in parent change");
}
if (!pChange->ISA(SubtreeChange))
throw InvalidName(aEnsurePath.toString(), "points to a non- subtree change in this changes list, but a subtree change is required as root.");
pCurrentParent = static_cast<SubtreeChange*>( pChange);
}
this->init(aStartPath);
m_pCurrentParent = pCurrentParent;
}
// ------- Helper for Path stack -------
SubtreeChange* OMergeTreeChangeList::pushTree(SubtreeChange& _rTree)
{
pushName( ONameCreator::createName(_rTree,m_pCurrentParent) );
SubtreeChange* pSave = m_pCurrentParent;
m_pCurrentParent = &_rTree;
return pSave;
}
void OMergeTreeChangeList::popTree(SubtreeChange* _pSaveTree)
{
m_pCurrentParent = _pSaveTree;
popName();
}
// start function, with the Change we want to do.
// WARNING this could be a big tree, because a change can contain subtreechanges!
void OMergeTreeChangeList::mergeChanges(TreeChangeList const&_rList)
{
initRoot(_rList ); // path location being merged must exist
this->applyToChildren(_rList.root);
}
// Algorithm: search the actual path in the out m_aTreeChangeList
// if we found something, we must merge/convert the Node with our Node
// if we found nothing, we must create a new Node with our change
// thats it.
// the merge is contructed with helper classes because, it's possible that we
// are a ValueChange but in the TreeChangeList this change is an AddNode, so
// we have something to do.
// New: For a value change we may also encounter
void OMergeTreeChangeList::handle(ValueChange const& _rValueNode)
{
// Handle a ValueChange,
OUString aNodeName = _rValueNode.getNodeName();
if (Change *pChange = findExistingChange(m_pCurrentParent,aNodeName))
{
// Value found, merge content
OMergeValueChange aMergeValue(*m_pCurrentParent,_rValueNode);
aMergeValue.handleChange(*pChange);
}
else
{
// there is no ValueChange in the List, insert new one
auto_ptr<Change> pNewChange(new ValueChange(_rValueNode));
m_pCurrentParent->addChange(pNewChange);
}
}
void OMergeTreeChangeList::handle(AddNode const& _rAddNode)
{
// Handle an AddNode
bool bReplacing = _rAddNode.isReplacing();
OUString aNodeName = _rAddNode.getNodeName();
if (Change *pChange = findExistingChange(m_pCurrentParent,aNodeName))
{
OSL_ENSURE(pChange->ISA(RemoveNode) || bReplacing, "OMergeTreeChangeList::handle(AddNode): the changes tree given already contains a change for this!");
m_pCurrentParent->removeChange(pChange->getNodeName());
bReplacing = true;
}
// insert manually
auto_ptr<INode> pNode = auto_ptr<INode>(_rAddNode.getAddedNode()->clone());
auto_ptr<AddNode> pNewAdd(new AddNode(pNode, _rAddNode.getNodeName()));
if (bReplacing)
pNewAdd->setReplacing();
auto_ptr<Change> pNewChange( pNewAdd.release() );
m_pCurrentParent->addChange(pNewChange);
}
void OMergeTreeChangeList::handle(RemoveNode const& _rRemoveNode)
{
// Handle a RemoveNode
OUString aNodeName = _rRemoveNode.getNodeName();
Change *pChange = findExistingChange(m_pCurrentParent,aNodeName);
// examine what to do with this change
OMergeRemoveNode aExaminer;
aExaminer.handleChange(pChange);
// remove the change from it's parent (may it's re-inserted in another form below)
if (pChange)
m_pCurrentParent->removeChange(pChange->getNodeName());
// insert a new change if necessary
switch (aExaminer.getAction())
{
case OMergeRemoveNode::RemoveCompletely:
// nothing to do, we already removed it
break;
default:
OSL_ENSURE(sal_False, "OMergeTreeChangeList::handle(RemoveNode): don't know what to do with this!");
// NO BREAK.
// defaulting this so that the node will be marked as deleted
case OMergeRemoveNode::FlagDeleted:
{
auto_ptr<Change> pNewChange(new RemoveNode(_rRemoveNode.getNodeName()));
m_pCurrentParent->addChange(pNewChange);
}
break;
}
}
// -----------------------------------------------------------------------------
// in localsession.cxx
void apply(TreeChangeList & _aTreeChangeList, ISubtree& _aSubtree);
// -----------------------------------------------------------------------------
void OMergeTreeChangeList::handle(SubtreeChange const& _rSubtree)
{
// Handle a SubtreeChange
// we must check if exact this SubtreeChange is in the TreeChangeList, if not,
// we must add this SubtreeChange to the TreeChangeList
// with the pointer m_pCurrentParent we remember our SubtreeChange in witch we
// add all other Changes.
OUString aNodeName = _rSubtree.getNodeName();
Change *pChange = findExistingChange(m_pCurrentParent,aNodeName);
// const sal_Char* pType = pChange ? pChange->getType() : NULL;
SubtreeChange* pSubtreeChange = NULL;
if (pChange == NULL || pChange->ISA(SubtreeChange))
{
// need to create a new Subtreechange
if (!pChange)
{
// create a new SubtreeChange
auto_ptr<SubtreeChange> pNewChange(new SubtreeChange(_rSubtree, SubtreeChange::NoChildCopy()));
pSubtreeChange = pNewChange.get();
// add the new SubtreeChange in m_aTreeChangeList
m_pCurrentParent->addChange(auto_ptr<Change>(pNewChange.release()));
// check list for this new SubtreeChange
OSL_ASSERT(pSubtreeChange == findExistingChange(m_pCurrentParent,aNodeName));
}
else // hard cast(!) to SubtreeChange because we are a SubtreeChange
{
pSubtreeChange = static_cast<SubtreeChange*>(pChange);
adjustElementTemplate(*pSubtreeChange,_rSubtree);
}
// save this SubtreeChange so we allways have the last Subtree
SubtreeChange* pSaveParent = pushTree(*pSubtreeChange);
this->applyToChildren(_rSubtree);
popTree( pSaveParent );
}
else if (pChange->ISA(AddNode))
{
// in this AddNode should be a subtree, NOT a subtreechange
AddNode* pAddNode = static_cast<AddNode*>(pChange);
INode* pNode = pAddNode->getAddedNode();
ISubtree* pSubtree = pNode ? pNode->asISubtree() : 0;
if (pSubtree)
{
// pSubtree = pSubtree + _rSubtree;
AbsolutePath aSubtreePath = this->createPath( ONameCreator::createName(_rSubtree,m_pCurrentParent) );
OSL_ASSERT( aSubtreePath.getLocalName().getName().toString() == pSubtree->getName() );
// Now apply _rSubtree to the subtree
TreeChangeList aChangeList(m_aTreeChangeList.getOptions(), aSubtreePath, Chg(), _rSubtree); // expensive!
apply(aChangeList, *pSubtree);
// This isn't correct today because _rSubtree is const and this construct require that _rSubtree isn't const
// TreeUpdate aTreeUpdate(pSubtree);
// _rSubtree.applyToChildren(aTreeUpdate);
}
else
{
OSL_ENSURE(false, "OMergeTreeChangeList: Unexpected node type found in an AddNode.");
/* wrong type of node found: b<>se ASSERTEN/WERFEN */;
}
}
else
{
OSL_ENSURE(false, "OMergeTreeChangeList: Unexpected change type found for a subtree.");
/* wrong type of node found: b<>se ASSERTEN/WERFEN */;
}
}
// -----------------------------------------------------------------------------
// CTor
OMergeChanges::OMergeChanges(SubtreeChange& _rTree)
: m_rSubtreeChange(_rTree), m_pCurrentParent(NULL)
{
}
void OMergeChanges::initRoot(const RelativePath& _aPathToChange)
{
SubtreeChange* pCurrentParent = &m_rSubtreeChange;
for(RelativePath::Iterator it = _aPathToChange.begin(), stop = _aPathToChange.end();
it != stop;
++it)
{
Change *pChange = findExistingChange(pCurrentParent,*it);
if (!pChange)
{
// create a correspondens for the name, we did not find.
auto_ptr<SubtreeChange> pNewChange(new SubtreeChange(it->getName().toString(), configuration::Attributes()));
pChange = pNewChange.get();
pCurrentParent->addChange(auto_ptr<Change>(pNewChange.release()));
OSL_ENSURE(pChange == findExistingChange(pCurrentParent,*it),
"ERROR: Newly added change cannot be found in parent change");
}
if (!pChange->ISA(SubtreeChange))
throw InvalidName(_aPathToChange.toString(), "points to a non- subtree change in this changes list, but a subtree change is required as root.");
pCurrentParent = static_cast<SubtreeChange*>( pChange);
}
this->init(_aPathToChange);
m_pCurrentParent = pCurrentParent;
}
// -----------------------------------------------------------------------------
// ------- Helper for Path stack -------
SubtreeChange* OMergeChanges::pushTree(SubtreeChange& _rTree)
{
pushName( ONameCreator::createName(_rTree,m_pCurrentParent) );
SubtreeChange* pSave = m_pCurrentParent;
m_pCurrentParent = &_rTree;
return pSave;
}
void OMergeChanges::popTree(SubtreeChange* _pSaveTree)
{
m_pCurrentParent = _pSaveTree;
popName();
}
// -----------------------------------------------------------------------------
// start function, with the Change we want to do.
// WARNING this could be a big tree, because a change can contain subtreechanges!
void OMergeChanges::mergeChanges(const SubtreeChange &_rChange)
{
initRoot( RelativePath() );
this->applyToChildren(_rChange); //- semantics ?
//this->applyToChange(_rChange);
}
// -----------------------------------------------------------------------------
// start function, with the Change we want to do.
// WARNING this could be a big tree, because a change can contain subtreechanges!
void OMergeChanges::mergeChanges(const SubtreeChange &_rChange, const RelativePath& _aPathToChange)
{
initRoot( _aPathToChange); // path location being merged must exist
this->applyToChildren(_rChange); //- semantics ?
//this->applyToChange(_rChange);
}
// -----------------------------------------------------------------------------
// Algorithm: search the actual path in the out m_aSubtreeChange
// if we found something, we must merge/convert the Node with our Node
// if we found nothing, we must create a new Node with our change
// thats it.
// the merge is contructed with helper classes because, it's possible that we
// are a ValueChange but in the TreeChangeList this change is an AddNode, so
// we have something to do.
void OMergeChanges::handle(ValueChange const& _rValueNode)
{
// Handle a ValueChange,
OUString aNodeName = _rValueNode.getNodeName();
if (Change *pChange = findExistingChange(m_pCurrentParent,aNodeName))
{
// Value found, merge content
OMergeValueChange aMergeValue(*m_pCurrentParent,_rValueNode);
aMergeValue.handleChange(*pChange);
}
else
{
// there is no ValueChange in the List, insert new one
auto_ptr<Change> pNewChange(new ValueChange(_rValueNode));
m_pCurrentParent->addChange(pNewChange);
}
}
// -----------------------------------------------------------------------------
void OMergeChanges::handle(AddNode const& _rAddNode)
{
// Handle an AddNode
bool bReplacing = _rAddNode.isReplacing();
OUString aNodeName = _rAddNode.getNodeName();
if (Change *pChange = findExistingChange(m_pCurrentParent,aNodeName))
{
OSL_ENSURE(pChange->ISA(RemoveNode) || bReplacing, "OMergeChanges::handle(AddNode): the changes tree given already contains a change for this!");
m_pCurrentParent->removeChange(pChange->getNodeName());
bReplacing = true;
}
// insert manually
auto_ptr<INode> pNode = auto_ptr<INode>(_rAddNode.getAddedNode()->clone());
auto_ptr<AddNode> pNewAdd(new AddNode(pNode, _rAddNode.getNodeName()));
if (bReplacing)
pNewAdd->setReplacing();
auto_ptr<Change> pNewChange( pNewAdd.release() );
m_pCurrentParent->addChange(pNewChange);
}
// -----------------------------------------------------------------------------
void OMergeChanges::handle(RemoveNode const& _rRemoveNode)
{
// Handle a RemoveNode
OUString aNodeName = _rRemoveNode.getNodeName();
Change *pChange = findExistingChange(m_pCurrentParent,aNodeName);
// examine what to do with this change
OMergeRemoveNode aExaminer;
aExaminer.handleChange(pChange);
// remove the change from it's parent (may it's re-inserted in another form below)
if (pChange)
m_pCurrentParent->removeChange(pChange->getNodeName());
// insert a new change if necessary
switch (aExaminer.getAction())
{
case OMergeRemoveNode::RemoveCompletely:
// nothing to do, we already removed it
break;
default:
OSL_ENSURE(sal_False, "OMergeChanges::handle(RemoveNode): don't know what to do with this!");
// NO BREAK.
// defaulting this so that the node will be marked as deleted
case OMergeRemoveNode::FlagDeleted:
{
auto_ptr<Change> pNewChange(new RemoveNode(_rRemoveNode.getNodeName()));
m_pCurrentParent->addChange(pNewChange);
}
break;
}
}
// -----------------------------------------------------------------------------
// -----------------------------------------------------------------------------
class TreeUpdater : public ChangeTreeAction
{
ISubtree* m_pCurrentSubtree;
#if DEBUG
std::vector<rtl::OString> aLog;
#endif
public:
TreeUpdater(ISubtree* pSubtree):m_pCurrentSubtree(pSubtree){}
void handle(ValueChange const& aValueNode);
void handle(AddNode const& aAddNode);
void handle(RemoveNode const& aRemoveNode);
void handle(SubtreeChange const& aSubtree);
};
// -----------------------------------------------------------------------------
void OMergeChanges::handle(SubtreeChange const& _rSubtree)
{
// Handle a SubtreeChange
// we must check if exact this SubtreeChange is in the TreeChangeList, if not,
// we must add this SubtreeChange to the TreeChangeList
// with the pointer m_pCurrentParent we remember our SubtreeChange in witch we
// add all other Changes.
OUString aNodeName = _rSubtree.getNodeName();
Change *pChange = findExistingChange(m_pCurrentParent,aNodeName);
// const sal_Char* pType = pChange ? pChange->getType() : NULL;
SubtreeChange* pSubtreeChange = NULL;
if (pChange == NULL || pChange->ISA(SubtreeChange))
{
// need to create a new Subtreechange
if (!pChange)
{
// create a new SubtreeChange
auto_ptr<SubtreeChange> pNewChange(new SubtreeChange(_rSubtree, SubtreeChange::NoChildCopy()));
pSubtreeChange = pNewChange.get();
// add the new SubtreeChange in m_aTreeChangeList
m_pCurrentParent->addChange(auto_ptr<Change>(pNewChange.release()));
// check list for this new SubtreeChange
OSL_ASSERT(pSubtreeChange == findExistingChange(m_pCurrentParent,aNodeName));
}
else // hard cast(!) to SubtreeChange because we are a SubtreeChange
{
pSubtreeChange = static_cast<SubtreeChange*>(pChange);
adjustElementTemplate(*pSubtreeChange,_rSubtree);
}
// save this SubtreeChange so we allways have the last Subtree
SubtreeChange* pSaveParent = pushTree(*pSubtreeChange);
this->applyToChildren(_rSubtree);
popTree( pSaveParent );
}
else if (pChange->ISA(AddNode))
{
AddNode* pAddNode = static_cast<AddNode*>(pChange);
INode* pNode = pAddNode->getAddedNode();
ISubtree* pSubtree = pNode ? pNode->asISubtree() : 0;
if (pSubtree)
{
// Now apply _rSubtree to the subtree
TreeUpdater aTreeUpdate(pSubtree);
aTreeUpdate.applyToChildren(_rSubtree);
}
else
{
OSL_ENSURE(false, "OMergeChanges: Unexpected node type found in an AddNode.");
/* wrong type of node found: b<>se ASSERTEN/WERFEN */;
}
}
else
{
OSL_ENSURE(false, "OMergeChanges: Unexpected change type found for a subtree.");
/* wrong type of node found: b<>se ASSERTEN/WERFEN */;
}
}
// --------------------------------- updateTree ---------------------------------
void TreeUpdater::handle(ValueChange const& aValueNode)
{
// Change a Value
OSL_ENSURE(m_pCurrentSubtree,"Cannot apply ValueChange without subtree");
INode* pBaseNode = m_pCurrentSubtree ? m_pCurrentSubtree->getChild(aValueNode.getNodeName()) : 0;
OSL_ENSURE(pBaseNode,"Cannot apply Change: No node to change");
ValueNode* pValue = pBaseNode ? pBaseNode->asValueNode() : 0;
OSL_ENSURE(pValue,"Cannot apply ValueChange: Node is not a value");
if (pValue)
aValueNode.applyChangeNoRecover(*pValue);
#ifdef DEBUG
else
{
::rtl::OString aStr("TreeUpdater: Can't find value with name:=");
aStr += rtl::OUStringToOString(aValueNode.getNodeName(),RTL_TEXTENCODING_ASCII_US);
OSL_ENSURE(pValue, aStr.getStr());
aLog.push_back(aStr);
}
#endif
}
void TreeUpdater::handle(AddNode const& aAddNode)
{
// Add a new Value
if (m_pCurrentSubtree)
{
if (aAddNode.isReplacing())
{
std::auto_ptr<INode> aOldNode = m_pCurrentSubtree->removeChild(aAddNode.getNodeName());
#ifdef DEBUG
OSL_ENSURE(aOldNode.get(), "TreeUpdater:AddNode: can't recover node being replaced");
if (aOldNode.get() == NULL)
aLog.push_back(rtl::OString("TreeUpdater: can't recover node being replaced (for AddNode)"));
#endif
}
auto_ptr<INode> pNode = auto_ptr<INode>(aAddNode.getAddedNode()->clone());
m_pCurrentSubtree->addChild(pNode);
OIdPropagator::propagateIdToChildren(*m_pCurrentSubtree);
}
#ifdef DEBUG
else
aLog.push_back(rtl::OString("TreeUpdater: no CurrentSubtree for AddNode"));
#endif
}
void TreeUpdater::handle(RemoveNode const& aRemoveNode)
{
// remove a Value
if (m_pCurrentSubtree)
{
std::auto_ptr<INode> aOldNode = m_pCurrentSubtree->removeChild(aRemoveNode.getNodeName());
#ifdef DEBUG
if (NULL == aOldNode.get())
{
::rtl::OString aStr("TreeUpdater: Can't remove child with name:=");
aStr += rtl::OUStringToOString(aRemoveNode.getNodeName(),RTL_TEXTENCODING_ASCII_US);
OSL_ENSURE(false, aStr.getStr());
aLog.push_back(aStr);
}
#endif
}
}
void TreeUpdater::handle(SubtreeChange const& _aSubtree)
{
// handle traversion
ISubtree *pOldSubtree = m_pCurrentSubtree;
rtl::OUString aNodeName = _aSubtree.getNodeName();
INode* pChild = m_pCurrentSubtree->getChild(aNodeName);
OSL_ENSURE(pChild, "TreeUpdater::handle : invalid subtree change ... no child for change !");
m_pCurrentSubtree = pChild ? pChild->asISubtree() : NULL;
#if DEBUG
if (!m_pCurrentSubtree)
{
::rtl::OString aStr("TreeUpdater: there is no Subtree for name:=");
aStr += rtl::OUStringToOString(_aSubtree.getNodeName(),RTL_TEXTENCODING_ASCII_US);
OSL_ENSURE(false, aStr.getStr());
aLog.push_back(aStr);
}
#endif
// recurse
if (m_pCurrentSubtree) _aSubtree.forEachChange(*this);
m_pCurrentSubtree = pOldSubtree;
}
} // namespace configmgr
Reference in New Issue View Git Blame Copy Permalink