Nitrito Code

/*  XMLPARSER Implementation
 *
 *  Copyright (C) 2007 Fixi Studios.
 *
 *  Authors:
 *      Marvin Stockl Garcia <durmieu@users.sourceforge.net>
 *      Jeremies Perez Morata <jeremiespm@users.sourceforge.net>
 *
 *  This program is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU General Public License as
 *  published by the Free Software Foundation; either version 2, or (at
 *  your option) any later version.
 *
 *  This program 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
 *  General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 
 */

#include <iostream>
#include <fstream>
#include "xmlparser.h"

using std::string;

XmlParser::XmlParser () 
{
    dtree = new DOMTree ();
}

XmlParser::XmlParser (string file)
{
    this->_parseFile (file.c_str ());
}

XmlParser::XmlParser (const char *file)
{
    this->_parseFile (file);
}

XmlParser::~XmlParser ()
{
}


void XmlParser::_parseFile (const char *file)
{
    ifstream f;
    char c;
    bool inittag = false;
    string tag = "";
    
    f.open (file);
    if (!f) 
        throw new XmlException ("File error open.");
    else {
        while (!f.eof ()) {
            c = char (f.get ());
             
            /*if ( c == '/' || c == '-' ) {
                inittag = false;
                cout << "TAG:" << tag << endl;
                tag = "";
            } 
            if (inittag ) {
                tag += c;
            }
            if ( c == '<' ) inittag = true;*/
        }
        f.close ();
    }
}

TreeNode::TreeNode ()
{
    this->nodename = "";
    this->value = "";
    this->property = "";
    this->valor = "";
}

TreeNode::TreeNode (string nn, string v)
{
    this->nodename = nn;
    this->value = v;
}

TreeNode::TreeNode (string nn, string v, list<TreeNode*> lt)
{
    list<TreeNode*>::iterator it;
    it = lt.begin();
    
    while (it != lt.end ()) {
        this->next.push_back (*it);
        it++;
    }
}

TreeNode::~TreeNode ()
{
    list<TreeNode*>::iterator it;
    it = this->next.begin();
    
    if (this->next.size() > 0 ) {
        while (it != this->next.end ()) {
            delete *it;
            it++;
        }
    }
}

DOMTree::DOMTree ()
{
    head = new TreeNode ();
}

DOMTree::~DOMTree ()
{
    delete head;
}