[STL] CustomKey를 사용하는 stl-map 사용 sample

#include <stdio.h> #include <iostream> #include <map> using namespace std; typedef struct myKey { public: bool operator<(const myKey& other) const { if ( one < other.one ) { return true; } else if ( one == other.one ) { if ( two < other.two ) return true; } return false; }; int one; int two; } myKey; int main() { std::map<myKey, int> myMap; myKey k1,k2,k3; k1.one = 11; k1.two = 12; k2.one = 21; k2.two = 22; k3.one = 31; k3.two = 32; myMap.insert(std::pair<myKey,int>(k1,111)); myMap.insert(std::pair<myKey,int>(k2,222)); myMap.insert(std::pair<myKey,int>(k3,333)); std::map<myKey, int>::iterator i; i = myMap.find(k2); if ( i == myMap.end() ) { printf("can't find\n"); exit(0); } printf("%d %d %d\n",i->first.one, i->first.two, i->second); /* double map */ std::map<int, map<myKey, int>> dmap; std::map<int, map<myKey, int>>::iterator i2 = dmap.find(1); if ( i2 == dmap.end() ) { std::map<myKey, int> imap; imap.insert(std::pair<myKey,int>(k1,111)); dmap.insert(std::pair<int, map<myKey,int>(1, imap)); printf("insert!\n"); } std::map<int, map<myKey, int>>::iterator i3 = dmap.find(1); std::map<myKey, int> m = i3->second; i = m.find(k1); if ( i == m.end() ){ } return 0; }

그냥 참고용 샘플...;