configmgr/source/treemgr/nodechangeinfo.cxx

   1 /*************************************************************************
   2  *
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * Copyright 2008 by Sun Microsystems, Inc.
   6  *
   7  * OpenOffice.org - a multi-platform office productivity suite
   8  *
   9  * $RCSfile: nodechangeinfo.cxx,v $
  10  * $Revision: 1.12 $
  11  *
  12  * This file is part of OpenOffice.org.
  13  *
  14  * OpenOffice.org is free software: you can redistribute it and/or modify
  15  * it under the terms of the GNU Lesser General Public License version 3
  16  * only, as published by the Free Software Foundation.
  17  *
  18  * OpenOffice.org is distributed in the hope that it will be useful,
  19  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  20  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  21  * GNU Lesser General Public License version 3 for more details
  22  * (a copy is included in the LICENSE file that accompanied this code).
  23  *
  24  * You should have received a copy of the GNU Lesser General Public License
  25  * version 3 along with OpenOffice.org.  If not, see
  26  * <http://www.openoffice.org/license.html>
  27  * for a copy of the LGPLv3 License.
  28  *
  29  ************************************************************************/
  30
  31 // MARKER(update_precomp.py): autogen include statement, do not remove
  32 #include "precompiled_configmgr.hxx"
  33
  34 #include "nodechangeinfo.hxx"
  35
  36 #include "noderef.hxx"
  37 #include "tree.hxx"
  38
  39 namespace configmgr
  40 {
  41     namespace configuration
  42     {
  43 //-----------------------------------------------------------------------------
  44
  45 NodeChangeData::NodeChangeData()
  46 : type(eNoChange)
  47 , unoData()
  48 , element()
  49 {
  50 }
  51 //-----------------------------------------------------------------------------
  52
  53 NodeChangeData::NodeChangeData(NodeChangeData const& aOther)
  54 : type(aOther.type)
  55 , unoData(aOther.unoData)
  56 , element(aOther.element)
  57 {
  58 }
  59 //-----------------------------------------------------------------------------
  60
  61 NodeChangeData& NodeChangeData::operator=(NodeChangeData const& aOther)
  62 {
  63     type                = aOther.type;
  64     unoData             = aOther.unoData;
  65     element             = aOther.element;
  66     return *this;
  67 }
  68 //-----------------------------------------------------------------------------
  69
  70 NodeChangeData::~NodeChangeData()
  71 {
  72 }
  73 //-----------------------------------------------------------------------------
  74
  75 bool NodeChangeData::isDataChange() const
  76 {
  77     if (isSetChange() && element.isDataChange())
  78         return true;
  79
  80     return unoData.isDataChange();
  81 }
  82 //-----------------------------------------------------------------------------
  83
  84 rtl::Reference< Tree > NodeChangeData::getNewElementTree() const
  85 {
  86     return element.newValue.get();
  87 }
  88 //-----------------------------------------------------------------------------
  89
  90 rtl::Reference< Tree > NodeChangeData::getOldElementTree() const
  91 {
  92     return element.oldValue.get();
  93 }
  94 //-----------------------------------------------------------------------------
  95
  96 NodeID NodeChangeData::getNewElementNodeID() const
  97 {
  98     rtl::Reference<ElementTree> newElement = this->element.newValue;
  99     if ( newElement.is() &&  newElement->nodeCount() > 0)
 100     {
 101         return NodeID( newElement.get(), Tree::ROOT );
 102     }
 103     else
 104         return NodeID(0,0);
 105 }
 106 //-----------------------------------------------------------------------------
 107
 108 NodeID NodeChangeData::getOldElementNodeID() const
 109 {
 110     rtl::Reference<ElementTree> oldElement = this->element.oldValue;
 111     if ( oldElement.is() &&  oldElement->nodeCount() > 0)
 112     {
 113         return NodeID( oldElement.get(), Tree::ROOT );
 114     }
 115     else
 116         return NodeID(0,0);
 117 }
 118 //-----------------------------------------------------------------------------
 119
 120 NodeChangeLocation::NodeChangeLocation()
 121 : m_path()
 122 , m_base(0,0)
 123 , m_affected(0,0)
 124 , m_bSubNodeChanging(false)
 125 {
 126 }
 127 //-----------------------------------------------------------------------------
 128 bool NodeChangeLocation::isValidLocation() const
 129 {
 130     return       m_base.isValidNode() &&
 131             (m_affected.isEmpty()
 132                 ?       ! m_bSubNodeChanging
 133                 :       ( m_affected.isValidNode() &&
 134                       (! m_bSubNodeChanging ||
 135                          (!m_path.isEmpty() &&
 136                             SubNodeID(m_affected,m_path.getLocalName().getName()).isValidNode()
 137                     ) )  ) );
 138 }
 139 #if OSL_DEBUG_LEVEL > 0
 140 //-----------------------------------------------------------------------------
 141 bool NodeChangeLocation::isValidData() const
 142 {
 143     return       m_base.isValidNode() &&
 144             (m_affected.isEmpty()
 145                 ?       ! m_bSubNodeChanging
 146                 :       ( m_affected.isValidNode() &&
 147                       (! m_bSubNodeChanging || !m_path.isEmpty() )
 148             )       );
 149 }
 150 #endif
 151 //-----------------------------------------------------------------------------
 152
 153 void NodeChangeLocation::setAccessor(RelativePath const& aAccessor)
 154 {
 155     m_path = aAccessor;
 156 }
 157 //-----------------------------------------------------------------------------
 158
 159 void NodeChangeLocation::setBase(NodeID const& aBaseNode)
 160 {
 161     m_base = aBaseNode;
 162 }
 163 //-----------------------------------------------------------------------------
 164
 165 void NodeChangeLocation::setAffected(NodeID const& aTargetNode)
 166 {
 167     m_affected = aTargetNode;
 168
 169     if (m_base.isEmpty())
 170         setBase(aTargetNode);
 171 }
 172 //-----------------------------------------------------------------------------
 173
 174 void NodeChangeLocation::setChangingSubnode( bool bSubnode )
 175 {
 176     OSL_ENSURE(!m_affected.isEmpty() || !bSubnode, "Change without target cannot affect subnode");
 177
 178     m_bSubNodeChanging = bSubnode;
 179 }
 180 //-----------------------------------------------------------------------------
 181
 182 rtl::Reference< Tree > NodeChangeLocation::getBaseTree() const
 183 {
 184     OSL_ENSURE(m_base.isValidNode(), "Invalid base location set in NodeChangeLocation");
 185     return m_base.getTree();
 186 }
 187 //-----------------------------------------------------------------------------
 188
 189 NodeRef NodeChangeLocation::getBaseNode() const
 190 {
 191     OSL_ENSURE(m_base.isValidNode(), "Invalid base location set in NodeChangeLocation");
 192     return m_base.getNode();
 193 }
 194 //-----------------------------------------------------------------------------
 195
 196 rtl::Reference< Tree > NodeChangeLocation::getAffectedTreeRef() const
 197 {
 198     NodeID aAffected = this->getAffectedNodeID();
 199     return aAffected.getTree();
 200 }
 201 //-----------------------------------------------------------------------------
 202
 203 NodeID NodeChangeLocation::getAffectedNodeID() const
 204 {
 205     OSL_ENSURE(m_affected.isEmpty() || m_affected.isValidNode(), "Invalid target location set in NodeChangeLocation");
 206     return m_affected;
 207 }
 208 //-----------------------------------------------------------------------------
 209
 210 SubNodeID NodeChangeLocation::getChangingValueID() const
 211 {
 212     if (!m_bSubNodeChanging) return SubNodeID::createEmpty();
 213
 214     OSL_ENSURE(!m_affected.isEmpty() && m_affected.isValidNode(), "Invalid target location set in NodeChangeLocation with subnode");
 215     OSL_ENSURE(!m_path.isEmpty(), "No target accessor set in NodeChangeLocation with subnode");
 216
 217     SubNodeID aResult( m_affected, m_path.getLocalName().getName() );
 218
 219     return aResult;
 220 }
 221 //-----------------------------------------------------------------------------
 222     }
 223 }
 224