---

element_text.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 "text.h"
#include "element_text.h"

using namespace libsvx;

ElementText::ElementText(TiXmlElement & Element, const std::string the_name)
 :ElementGeneric(Element,the_name)
{
  //elements
  m_List_Text.clear();
  TiXmlElement * txIterator = Element.FirstChildElement("text");

  while (txIterator != NULL)
  {
    Text * tmpText = new Text(*txIterator);
    m_List_Text.push_back(tmpText);
    txIterator = txIterator->NextSiblingElement("text");
  }
}

ElementText::ElementText(const ElementText & a_element)
 :ElementGeneric(a_element)
{
  for (size_t i = 0; i < a_element.m_List_Text.size();i++)
  {
    Text * tmpText = new Text(a_element.m_List_Text[i]);
    m_List_Text.push_back(tmpText);
  }
}

ElementText::~ElementText()
{
/* done automatically
  while (m_List_Text.size() != 0)
  {
    Text * tmp = m_List_Text.front();
    m_List_Text.pop_front();
    delete tmp;
  }
*/
}

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


void ElementText::XmlElement(TiXmlElement & the_element_to_fill)
{
  for (size_t i = 0; i < m_List_Text.size();i++)
  {
    the_element_to_fill.InsertEndChild(m_List_Text[i].XmlElement());
  }
}

Text * ElementText::FindText(const Text & the_item) const
{
  size_t current_version = 0;

  while (current_version < m_List_Text.size() &&
       m_List_Text[current_version] != the_item)
  {
    current_version++;
  }

  if (current_version < m_List_Text.size())
    return &m_List_Text[current_version];
  else
    return NULL;
}

ElementText & ElementText::operator+=(const ElementText & the_object_to_add)
{
  assert(IsValid());

  if (the_object_to_add.IsValid())
  {
    // hierarchy classes
    static_cast<ElementGeneric&>(*this) += the_object_to_add;

    // lists
    size_t i = 0;
    Text * tmpFoundText;
    while (i < the_object_to_add.m_List_Text.size())
    {
      tmpFoundText = FindText(the_object_to_add.m_List_Text[i]);
      if (tmpFoundText == NULL)
      {
        // add this version to the list
        Text * tmpText = new Text(the_object_to_add.m_List_Text[i]);
        m_List_Text.push_back(tmpText);
      }
      else
      {
        // merge the same versions
        *tmpFoundText += the_object_to_add.m_List_Text[i];
      }

      i++;
    }
  }

  return *this;
}
bool ElementText::operator!=(const ElementText & the_object_to_compare) const
{
  bool result = !(IsValid() && the_object_to_compare.IsValid());

  result = result || (static_cast<const ElementGeneric&>(*this) != the_object_to_compare);

  return result;
}

---