c++ how to make your own class a valid key type for std::map?

In Java, if you want your own class to be a valid key type of the container, you just need to make it implement the interface "Comparable", and then it'll work properly.

How about in C++? I was wondering whether C++ has offered some kind of mechanism that acts like an interface in Java to enforce some "contract" to which a type must conform, such as std::map, it's obvious its key type must be "comparable".

How to ensure that the type indeed conform to the contract, through some kind of "interface" mechanism or what? Will the compiler do the work at compile time to check whether a type conform to the contract or not?

I looked up some C++ references in cppreference.com and cplusplus.com, I just couldn't find any useful information about what contract std::map require on its key type.

By search on stackoverflow.com, I found this: http://stackoverflow.com/questions/19937260/use-user-defined-struct-as-the-key-for-map-c

So maybe i just need to define an operator< for that type ?

Try it. Notice that in main.cpp, if you remove the operator< on Box type. The compiler will complain when you use Box as a key type of std::map. So, the compiler did ensure that Box must conform to the contract defined by operator<.

But how to implement std::map so that it would offer the information to the compiler: the std::map::key_type must be a type that has an overloaded operator< definition, you must check this at compile time. (I'm asking this question on stackoverflow.com, waiting for answer, http://stackoverflow.com/questions/27078796/how-is-stdmap-implemented-so-it-can-require-its-key-type-to-be-comparable)

main.cpp

 #include <iostream>
 #include <map>

 using namespace std;

 class Box {
     friend ostream& operator<<(ostream &os, const Box &b);
     friend bool operator<(const Box &left, const Box &right);
 public:
     Box(int i, double d);
     ~Box();
 private:
     int i;
     double d;
 };

 Box::Box(int _i, double _d):i(_i), d(_d) {}

 Box::~Box() {}

 bool operator<(const Box &left, const Box &right)
 {
     return (left.i < right.i);
 }

 ostream& operator<<(ostream &os, const Box &b)
 {
     os << b.d;
     return os;
 }

 int main()
 {
     Box b1(,), b2(,), b3(, );
     map<Box, int> bmap;
     bmap.insert(pair<Box,int>(b1, ));
     bmap.insert(pair<Box,int>(b2, ));
     bmap.insert(pair<Box,int>(b3, ));
     for (map<Box,int>::iterator iter = bmap.begin(); iter != bmap.end(); ++iter)
     {
         cout << iter->first << " ";
     }
     cout << endl;
     return ;
 }