Implementing a QHash-like lookup with multiple keys
问题 I'm trying to find the best way to implement a QHash-like lookup table that uses multiple keys to return one value. I have read that the Boost library has similar functionality, but I would like to avoid this if possible. An example of what I would like to do is as follows (obviously the following pseudo-code is not possible): //First key (int) - Engine cylinders //Second key (int) - Car weight //Value (int) - Top speed MyLookup<int, int, int> m_Lookup m_Lookup.insert(6, 1000, 210); m_Lookup