---

changes.cxx

Go to the documentation of this file.

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

                           Copyright Notice.

               Licensed material - Property of Steve Lhomme

This source file is part of Steve Lhomme's libSVX.
(C) Copyright Steve Lhomme, France, 2001-2002.
All rights reserved. Modifications (C) copyrighted by their respective
contributors, all rights reserved.

The contents of this file are subject to the Bixoft Public License
Version 1.0 (the "License"); you may not use this file in any way except
in compliance with the License. You should have received a copy of the
License with this source; see <file or member name>. You may also obtain
a copy of the License at http://www.bixoft.nl/english/license.htm
or http://mukoli.free.fr/BXAPL/

ANY USE OF THE SOFTWARE CONSTITUTES ACCEPTANCE OF THE LICENSE.

Anything distributed under the License is distributed on an "AS IS" basis,
WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for
the specific language governing rights and limitations under the License.

Definitions required by the License:
Copyright Holder: Steve Lhomme, France
          e-mail: steve.lhomme@free.fr
Country: France, i.e. the laws of France apply.
Court  : ????
Programming Tool status: This source is not a Programming Tool.

Contributor(s):                      Contribution:

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

#include "../tinyxml/tinyxml.h"

#include "bugfix.h"
#include "feature.h"
#include "improvement.h"

#include "changes.h"

using namespace libsvx;

Changes::Changes(TiXmlElement & a_Element)
 :Element(a_Element,"changes")
{
  assert(a_Element.Value().compare("changes") == 0);

  TiXmlElement * txIterator;

  m_List_Bugfix.clear();
  txIterator = a_Element.FirstChildElement("bugfix");

  while (txIterator != NULL)
  {
    Bugfix * tmpBugfix = new Bugfix(*txIterator);
    m_List_Bugfix.push_back(tmpBugfix);
    txIterator = txIterator->NextSiblingElement("bugfix");
  }

  m_List_Feature.clear();
  txIterator = a_Element.FirstChildElement("feature");

  while (txIterator != NULL)
  {
    Feature * tmpFeature = new Feature(*txIterator);
    m_List_Feature.push_back(tmpFeature);
    txIterator = txIterator->NextSiblingElement("feature");
  }

  m_List_Improvement.clear();
  txIterator = a_Element.FirstChildElement("improvement");

  while (txIterator != NULL)
  {
    Improvement * tmpImprovement = new Improvement(*txIterator);
    m_List_Improvement.push_back(tmpImprovement);
    txIterator = txIterator->NextSiblingElement("improvement");
  }
}

Changes::Changes(const Changes & a_item)
 :Element(a_item)
{
  for (size_t i = 0; i < a_item.m_List_Bugfix.size(); i++)
  {
    Bugfix * tmpText = new Bugfix(a_item.m_List_Bugfix[i]);
    m_List_Bugfix.push_back(tmpText);
  }

  for (size_t j = 0; j < a_item.m_List_Feature.size();j++)
  {
    Feature * tmpText = new Feature(a_item.m_List_Feature[j]);
    m_List_Feature.push_back(tmpText);
  }

  for (size_t k = 0; k < a_item.m_List_Improvement.size();k++)
  {
    Improvement * tmpText = new Improvement(a_item.m_List_Improvement[k]);
    m_List_Improvement.push_back(tmpText);
  }
}

Changes::~Changes()
{
/* done automatically
  while (m_List_Bugfix.size() != 0)
  {
    Bugfix * tmp = m_List_Bugfix.front();
    m_List_Bugfix.pop_front();
    delete tmp;
  }

  while (m_List_Feature.size() != 0)
  {
    Feature * tmp = m_List_Feature.front();
    m_List_Feature.pop_front();
    delete tmp;
  }

  while (m_List_Improvement.size() != 0)
  {
    Improvement * tmp = m_List_Improvement.front();
    m_List_Improvement.pop_front();
    delete tmp;
  }
*/
}

bool Changes::IsValid() const
{
  return true;
}

TiXmlElement & Changes::XmlElement()
{
  for (size_t i = 0; i < m_List_Bugfix.size();i++)
  {
    m_Node->InsertEndChild(m_List_Bugfix[i].XmlElement());
  }
  
  for (size_t j = 0; j < m_List_Feature.size();j++)
  {
    m_Node->InsertEndChild(m_List_Feature[j].XmlElement());
  }
  
  for (size_t k = 0; k < m_List_Improvement.size();k++)
  {
    m_Node->InsertEndChild(m_List_Improvement[k].XmlElement());
  }
  
  return *m_Node;
}

bool Changes::operator!=(const Changes & the_object_to_compare) const
{
  bool result = !(IsValid() && the_object_to_compare.IsValid());

  result = result || (static_cast<const Element &>(*this) != the_object_to_compare);
  
  return result;
}

---