author | simon <simon> | 2002-04-30 14:26:53 (UTC) |
---|---|---|
committer | simon <simon> | 2002-04-30 14:26:53 (UTC) |
commit | 5dae945f8ec25a811efb10eb71d606ce8da4429f (patch) (side-by-side diff) | |
tree | c12689435fbfb2abd6aedfcbd88208c1cb69407f /libopie/xmltree.cc | |
parent | 3c1b87ffa621f872c72228733a078511e56d2daf (diff) | |
download | opie-5dae945f8ec25a811efb10eb71d606ce8da4429f.zip opie-5dae945f8ec25a811efb10eb71d606ce8da4429f.tar.gz opie-5dae945f8ec25a811efb10eb71d606ce8da4429f.tar.bz2 |
- put the xml tree classes into the Opie namespace
-rw-r--r-- | libopie/xmltree.cc | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/libopie/xmltree.cc b/libopie/xmltree.cc index 408e3c6..27db5b3 100644 --- a/libopie/xmltree.cc +++ b/libopie/xmltree.cc @@ -1,58 +1,59 @@ /* This file is part of the KDE project Copyright (C) 2001 Simon Hausmann <hausmann@kde.org> This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ #include <qpe/stringutil.h> #include <opie/xmltree.h> #include <qxml.h> #include <assert.h> +using namespace Opie; XMLElement::XMLElement() : m_parent( 0 ), m_next( 0 ), m_prev( 0 ), m_first( 0 ), m_last( 0 ) { } XMLElement::~XMLElement() { XMLElement *n = m_first; while ( n ) { XMLElement *tmp = n; n = n->m_next; delete tmp; } } void XMLElement::appendChild( XMLElement *child ) { if ( child->m_parent ) child->m_parent->removeChild( child ); child->m_parent = this; if ( m_last ) m_last->m_next = child; child->m_prev = m_last; if ( !m_first ) m_first = child; |