testDataSemantics.cpp

Go to the documentation of this file.

/*
Copyright 2007, 2008, 2009, 2010, 2011 Instituto de Sistemas e Robotica, Instituto Superior Tecnico

This file is part of MeRMaID.

MeRMaID is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

MeRMaID 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 Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License
along with MeRMaID.  If not, see <http://www.gnu.org/licenses/>.
*/



/**
 * @Filename testDataSemantics.cpp
 * @Description Tests the DataSemantics framework implementation
 * @Status unknown
 * @Version $Id: testDataSemantics.cpp 1 2011-03-04 18:13:18Z jreis $
 * @Maintainer Marco Barbosa + Nelson Ramos
 */

#include "config.h"

#include <iostream>
#include <string>
#include <ace/Trace.h>

#include "SemanticTreeFactory.hpp"
#include "SemanticTree.hpp"
#include "SemanticNode.hpp"

#include <FilePathSearch.hpp>


#include <Exception.hpp>

using namespace mermaid::support::data;
using mermaid::support::errorhandling::Exception;
using boost::shared_ptr;
using mermaid::support::system::FilePathSearch;
using std::string;
using std::cout;
using std::endl;

void printNode (shared_ptr<SemanticNode> node, int indent)
{
  string t = "";
  for (int i = 0; i < indent; i++) {
    t = t + " ";
  }
  
  
  string name = node->getName();
  //cout << indent << t << ">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>" << endl;
  cout << indent << t << "  Name: " << name << endl;
  
  SemanticNodeVector children = node->getChildren();
  
  int numChild = children.size();
  cout << indent << t << "  Children: " << numChild << endl;
  
  SemanticNodeVector::iterator it;
  for (it = children.begin(); it != children.end(); it++) {
    shared_ptr<SemanticNode> n = *it;
    printNode (n, indent + 1);
  }
  //cout << indent << t << "<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<" << endl;
  
};


int main (int argc, char * const argv[])
{
  ACE_Trace::stop_tracing();
  
  // insert code here...
  
  
  try {
    std::cerr << "DataSemantics framework test" << endl;
    
    if (argc != 2) {
      cout << "Usage: test-DataSemantics [filename]" << endl;
      return (1);
    }
    
    FilePathSearch::addSearchPath ("./");
    FilePathSearch::addSearchPath ("/");
    
    XmlDocument doc;
    
    doc.parseFile (string (argv[1]));
    
    if (doc.isWellFormed()) {
      cout << "XML is WELL FORMED" << endl;
    }
    else {
      cout << "XML is NOT WELL FORMED" << endl;
      return (1);
    }
    
    
    if (doc.isValid()) {
      cout << "XML is VALID" << endl;
    }
    else {
      cout << "XML is NOT VALID" << endl;
      return (1);
    }
    
    shared_ptr<SemanticTree> t;
    t = SemanticTreeFactory::buildSemanticTree (&doc);
    shared_ptr<SemanticNode> rootNode = t->getRootNode();
    printNode (rootNode, 0);
    
    
    if (t->aContainsB ("Universe", "Animals") == true) {
      cout << "Universe CONTAINS Animals" << endl;
    }
    else {
      cout << "Universe DOES NOT CONTAIN Animals" << endl;
      return (1);
    }
    
    if (t->aContainsB ("Animals", "Universe") == true) {
      cout << "Animals CONTAINS Universe" << endl;
      return (1);
    }
    else {
      cout << "Animals DOES NOT CONTAIN Universe" << endl;
    }
  }
  catch (Exception &exception) {
    cout << "ERROR:" << endl;
    cout << "\t" << exception.what() << endl;
    return (1);
  }
  catch (...) {
    cout << "How the hell did I end up here?!" << endl;
    return (1);
  }
  
}; // main