hash_multimap

[ct]

Wow, you are right. The API of both g++ and vc++ is same; just have to insert the required headers. I have the same program working for both g++ and vc++ 2005 right now.
Here is the code:

//VC++
#include<iostream>
#include<cstdio>
#include<hash_map>
using namespace std;
using namespace stdext;
int main(int argc,char** argv)
{   
    hash_map<int,int> mapping;
    hash_map<int,int>::const_iterator miter;
 
    mapping.insert(pair<int,int>(1,100));
    mapping.insert(pair<int,int>(2,200));
    miter = mapping.find(1);
 
    if(miter == mapping.end())
        cout << "Not found";
    else
       cout << miter->first << " = " << miter->second;
 
 
    getchar();
    return 0;
}

//VC++
#include<iostream>
#include<cstdio>
#include<hash_map>
using namespace std;
using namespace stdext;
int main(int argc,char** argv)
{   
    hash_map<int,int> mapping;
    hash_map<int,int>::const_iterator miter;
    
    mapping.insert(pair<int,int>(1,100));
    mapping.insert(pair<int,int>(2,200));
    miter = mapping.find(1);
    
    if(miter == mapping.end())
        cout << "Not found";
    else
       cout << miter->first << " = " << miter->second;
   
    
    getchar();
    return 0;
}

To copy to clipboard, switch view to plain text mode 

//g++
#include<iostream>
#include<cstdio>
#include<ext/hash_map>
using namespace std;
using namespace __gnu_cxx;
int main(int argc,char** argv)
{   
    hash_map<int,int> mapping;
    hash_map<int,int>::const_iterator miter;
 
    mapping.insert(pair<int,int>(1,100));
    mapping.insert(pair<int,int>(2,200));
    miter = mapping.find(1);
 
    if(miter == mapping.end())
        cout << "Not found";
    else
       cout << miter->first << " = " << miter->second;
 
 
    getchar();
    return 0;
}

//g++
#include<iostream>
#include<cstdio>
#include<ext/hash_map>
using namespace std;
using namespace __gnu_cxx;
int main(int argc,char** argv)
{   
    hash_map<int,int> mapping;
    hash_map<int,int>::const_iterator miter;
    
    mapping.insert(pair<int,int>(1,100));
    mapping.insert(pair<int,int>(2,200));
    miter = mapping.find(1);
    
    if(miter == mapping.end())
        cout << "Not found";
    else
       cout << miter->first << " = " << miter->second;
   
    
    getchar();
    return 0;
}

To copy to clipboard, switch view to plain text mode 

However I am running into some problem with hash_map<string,string> for both the compilers. I am sure there is some compare function that needs to be defined for strings or is there something already available ?

[ct]

BTW, how can I combine both these files into one so that both the compilers can compile it. Is there some flag that needs to be checked to find out if the compiler is VC++ or g++ ?

[spud]

#ifdef Q_CC_MSVC
#include<hash_map>
using namespace stdext;
#endif
 
#ifdef Q_CC_GNU
#include<ext/hash_map>
using namespace __gnu_cxx;
#endif

#ifdef Q_CC_MSVC
#include<hash_map>
using namespace stdext;
#endif

#ifdef Q_CC_GNU
#include<ext/hash_map>
using namespace __gnu_cxx;
#endif

To copy to clipboard, switch view to plain text mode 

[ct]

#ifdef Q_CC_MSVC
#include<hash_map>
using namespace stdext;
#endif
 
#ifdef Q_CC_GNU
#include<ext/hash_map>
using namespace __gnu_cxx;
#endif

#ifdef Q_CC_MSVC
#include<hash_map>
using namespace stdext;
#endif

#ifdef Q_CC_GNU
#include<ext/hash_map>
using namespace __gnu_cxx;
#endif

To copy to clipboard, switch view to plain text mode 

That certainly didn't work. Is that some QT preprocessor that does the same thing? I opened up the glut.h file and saw how they have done it so I got upto here.

#include<iostream>
#include<cstdio>
 
#if defined(__MINGW32__)
#include<ext/hash_map>
using namespace __gnu_cxx;
#endif
 
#if defined(_MSC_VER)
#include<hash_map>
using namespace stdext;
#endif
 
#include<iostream>
#include<cstdio>
 
using namespace std;
 
int main(int argc,char** argv)
{   
    hash_map<int,int> mapping;
    hash_map<int,int>::const_iterator miter;
 
    mapping.insert(pair<int,int>(1,100));
    mapping.insert(pair<int,int>(2,200));
    miter = mapping.find(1);
 
    if(miter == mapping.end())
        cout << "Not found";
    else
       cout << miter->first << " = " << miter->second;
 
 
    getchar();
    return 0;
}

#include<iostream>
#include<cstdio>

#if defined(__MINGW32__)
#include<ext/hash_map>
using namespace __gnu_cxx;
#endif

#if defined(_MSC_VER)
#include<hash_map>
using namespace stdext;
#endif

#include<iostream>
#include<cstdio>

using namespace std;

int main(int argc,char** argv)
{   
    hash_map<int,int> mapping;
    hash_map<int,int>::const_iterator miter;
    
    mapping.insert(pair<int,int>(1,100));
    mapping.insert(pair<int,int>(2,200));
    miter = mapping.find(1);
    
    if(miter == mapping.end())
        cout << "Not found";
    else
       cout << miter->first << " = " << miter->second;
   
    
    getchar();
    return 0;
}

To copy to clipboard, switch view to plain text mode 

The preprocessors have always confused me a bit. Is there a list of all the preprocessors that can be used (at least the more common ones ). Can anyone point to some good resource about types of general preprocessors or may be list some common ones out here ?