fork download
  1. #include <map>
  2. #include <iostream>
  3.  
  4. struct Node {
  5. int a;
  6. int b;
  7. };
  8.  
  9. int main() {
  10. Node node{ 2, 3 };
  11.  
  12. auto comp = [](const Node& n1, const Node& n2) {
  13. return n1.a < n2.a || (n1.a == n2.a && n1.b < n2.b);
  14. };
  15. std::map<Node, int, decltype(comp)> bb(comp);
  16. bb[node] = 1;
  17.  
  18. for (auto const &kv : bb)
  19. std::cout << kv.first.a << ", " << kv.first.b << ": " << kv.second << std::endl;
  20.  
  21. return 0;
  22. }
Success #stdin #stdout 0s 4392KB
stdin
Standard input is empty
stdout
2, 3: 1