URNResolver.h

Go to the documentation of this file.

//    Copyright 2004, SenseGraphics AB
//
//    This file is part of H3D API.
//
//    H3D API 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 of the License, or
//    (at your option) any later version.
//
//    H3D API 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 H3D API; if not, write to the Free Software
//    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
//
//    A commercial license is also available. Please contact us at 
//    www.sensegraphics.com for more information.
//
//
//
#ifndef __URNRESOLVER_H__
#define __URNRESOLVER_H__

#include "H3DApi.h"
#include <map>
#include <fstream>
#include <iostream>
#include <string>

using namespace std;

namespace H3D {
  class H3DAPI_API URNResolver {
  public:

    
    URNResolver( const string &_config_file = "" ){
      config_file = _config_file;
      initialised = false;
    }

    void loadConfigFile( const string &config_file );

    void addURNResolveRule( const string &name_space,
                            const string &prefix,
                            const string &path ) {
      string key = "urn:";
      key = key + toLower( name_space ) + ":" + prefix;
      urn_prefix_map[ key ] = path;
    }


    string resolveURN( const string &urn );

  protected:

    static const unsigned int MAX_LINE_SIZE = 1024;
    bool nonCaseEquals( const string &s1, 
                        const string &s2 ) {
      if( s1.size() != s2.size() ) return false;
      
      for( unsigned int i = 0; i < s1.size(); i++ ) {
        if( toupper( s1[i]) != toupper( s2[i] ) )
          return false;
      }
      return true;
    }

    bool hasPrefix( const string &s,
                    const string &prefix ) {
      if( prefix.size() > s.size() ) return false;
      for( unsigned int i = 0; i < prefix.size(); i++ )
        if( s[i] != prefix[i] ) return false;
      return true;
    }

    string toLower( const string &s ) {
      string res = s;
      for( unsigned int i = 0; i < s.size(); i++ )
        res[i] = tolower( s[i] );
      return res;
    }

    struct lessthan_string {
      bool operator()(const string & s1, const string & s2) const {
        if( s1.size() < s2.size() ) return true;
        return s1 < s2;
      }
    };

    typedef map< string, string, lessthan_string > URNmap;
    URNmap urn_prefix_map;
    string config_file;
    bool initialised;
  };
}

#endif

---