280 lines
9.3 KiB
C++
280 lines
9.3 KiB
C++
/*************************************************************************
|
|
*
|
|
* $RCSfile: nodevisitor.cxx,v $
|
|
*
|
|
* $Revision: 1.2 $
|
|
*
|
|
* last change: $Author: jb $ $Date: 2002-03-28 08:27:42 $
|
|
*
|
|
* 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 "nodevisitor.hxx"
|
|
|
|
#ifndef CONFIGMGR_NODEACCESS_HXX
|
|
#include "nodeaccess.hxx"
|
|
#endif
|
|
#ifndef CONFIGMGR_VALUENODEACCESS_HXX
|
|
#include "valuenodeaccess.hxx"
|
|
#endif
|
|
#ifndef CONFIGMGR_GROUPNODEACCESS_HXX
|
|
#include "groupnodeaccess.hxx"
|
|
#endif
|
|
#ifndef CONFIGMGR_SETNODEACCESS_HXX
|
|
#include "setnodeaccess.hxx"
|
|
#endif
|
|
#ifndef CONFIGMGR_TREEACCESSOR_HXX
|
|
#include "treeaccessor.hxx"
|
|
#endif
|
|
|
|
#ifndef _CONFIGMGR_TREE_VALUENODE_HXX
|
|
#include "valuenode.hxx"
|
|
#endif
|
|
|
|
#ifndef _OSL_DIAGNOSE_H_
|
|
#include <osl/diagnose.h>
|
|
#endif
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
namespace configmgr
|
|
{
|
|
// -----------------------------------------------------------------------------
|
|
namespace data
|
|
{
|
|
// -------------------------------------------------------------------------
|
|
typedef NodeVisitor::Result Result;
|
|
|
|
// -------------------------------------------------------------------------
|
|
// -------------------------------------------------------------------------
|
|
struct NodeVisitor::Dispatcher
|
|
{
|
|
NodeVisitor& m_target;
|
|
Accessor m_accessor;
|
|
Result m_result;
|
|
|
|
Dispatcher(NodeVisitor& _rTarget, Accessor const& _aAccessor)
|
|
: m_target(_rTarget)
|
|
, m_accessor(_aAccessor)
|
|
, m_result(NodeVisitor::CONTINUE)
|
|
{}
|
|
|
|
void applyToNode(sharable::Node const & _aNode);
|
|
void applyToChildren(sharable::GroupNode const & _aNode);
|
|
|
|
Result dispatch(sharable::Node const& _aNode);
|
|
};
|
|
|
|
// -------------------------------------------------------------------------
|
|
struct SetVisitor::Dispatcher
|
|
{
|
|
SetVisitor& m_target;
|
|
Accessor m_accessor;
|
|
Result m_result;
|
|
|
|
Dispatcher(SetVisitor& _rTarget, Accessor const& _aAccessor)
|
|
: m_target(_rTarget)
|
|
, m_accessor(_aAccessor)
|
|
, m_result(NodeVisitor::CONTINUE)
|
|
{}
|
|
|
|
void applyToTree(sharable::TreeFragment const & _aElement);
|
|
void applyToElements(sharable::SetNode const & _aNode);
|
|
|
|
Result dispatch(sharable::TreeFragment const& _aElement);
|
|
};
|
|
|
|
// -------------------------------------------------------------------------
|
|
|
|
inline
|
|
Result NodeVisitor::Dispatcher::dispatch(sharable::Node const& _aNode)
|
|
{
|
|
using namespace sharable::Type;
|
|
switch (_aNode.node.info.type & mask_nodetype)
|
|
{
|
|
case nodetype_value:
|
|
return m_target.handle( ValueNodeAccess(m_accessor, &_aNode.value) );
|
|
break;
|
|
|
|
case nodetype_group:
|
|
return m_target.handle( GroupNodeAccess(m_accessor, &_aNode.group) );
|
|
|
|
case nodetype_set:
|
|
return m_target.handle( SetNodeAccess(m_accessor, &_aNode.set) );
|
|
|
|
default:
|
|
OSL_ENSURE(false,"NodeVisitor: invalid node type detected"); // invalid node
|
|
return m_target.handle( NodeAccess(m_accessor, &_aNode) );
|
|
}
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
inline
|
|
Result SetVisitor::Dispatcher::dispatch(sharable::TreeFragment const& _aElement)
|
|
{
|
|
return m_target.handle( TreeAccessor(m_accessor, &_aElement) );
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
void NodeVisitor::Dispatcher::applyToNode(sharable::Node const & _aNode)
|
|
{
|
|
if (m_result != NodeVisitor::DONE)
|
|
m_result = dispatch(_aNode);
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
void SetVisitor::Dispatcher::applyToTree(sharable::TreeFragment const & _aElement)
|
|
{
|
|
if (m_result != NodeVisitor::DONE)
|
|
m_result = dispatch(_aElement);
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
void NodeVisitor::Dispatcher::applyToChildren(sharable::GroupNode const & _aNode)
|
|
{
|
|
using sharable::Node;
|
|
for (Node const * pChild = _aNode.getFirstChild();
|
|
pChild != NULL && m_result != NodeVisitor::DONE;
|
|
pChild = _aNode.getNextChild(pChild) )
|
|
m_result = dispatch(*pChild);
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
void SetVisitor::Dispatcher::applyToElements(sharable::SetNode const & _aNode)
|
|
{
|
|
using sharable::TreeFragment;
|
|
for (TreeFragment const * pElement = _aNode.getFirstElement(m_accessor);
|
|
pElement != NULL && m_result != NodeVisitor::DONE;
|
|
pElement = _aNode.getNextElement(m_accessor,pElement) )
|
|
m_result = dispatch(*pElement);
|
|
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result NodeVisitor::visitNode(NodeAccess const& _aNode)
|
|
{
|
|
Dispatcher aDispatcher(*this, _aNode.accessor());
|
|
|
|
aDispatcher.applyToNode(_aNode.data());
|
|
|
|
return aDispatcher.m_result;
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result SetVisitor::visitTree(TreeAccessor const& _aNode)
|
|
{
|
|
Dispatcher aDispatcher(*this, _aNode.accessor());
|
|
|
|
aDispatcher.applyToTree(_aNode.data());
|
|
|
|
return aDispatcher.m_result;
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result NodeVisitor::visitChildren(GroupNodeAccess const& _aNode)
|
|
{
|
|
Dispatcher aDispatcher(*this, _aNode.accessor());
|
|
|
|
aDispatcher.applyToChildren(_aNode.data());
|
|
|
|
return aDispatcher.m_result;
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result SetVisitor::visitElements(SetNodeAccess const& _aNode)
|
|
{
|
|
Dispatcher aDispatcher(*this, _aNode.accessor());
|
|
|
|
aDispatcher.applyToElements(_aNode.data());
|
|
|
|
return aDispatcher.m_result;
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result NodeVisitor::handle(NodeAccess const& _aNode)
|
|
{
|
|
return CONTINUE;
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result NodeVisitor::handle(ValueNodeAccess const& _aNode)
|
|
{
|
|
return handle(static_cast<NodeAccess>(_aNode));
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result NodeVisitor::handle(GroupNodeAccess const& _aNode)
|
|
{
|
|
return handle(static_cast<NodeAccess>(_aNode));
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result NodeVisitor::handle(SetNodeAccess const& _aNode)
|
|
{
|
|
return handle(static_cast<NodeAccess>(_aNode));
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
Result SetVisitor::handle(TreeAccessor const& _aTree)
|
|
{
|
|
return NodeVisitor::visitNode(_aTree.getRootNode());
|
|
}
|
|
// -------------------------------------------------------------------------
|
|
|
|
// -------------------------------------------------------------------------
|
|
}
|
|
// -----------------------------------------------------------------------------
|
|
} // namespace configmgr
|
|
|
|
|