I'm trying to make something like a hash table that can locate a value quickly given a key to match. But my problem is that the data can't just match one key to retrieve a unique value, it must match three different keys to get the correct value. Is there any sort of existing data structure that provides this sort of lookup capability?
Name:
Anonymous2008-03-07 16:59
You don't understand hash tables.
Name:
Anonymous2008-03-07 17:03
I know a hash table is not what I want. I just want to know if there's anything that offers what I need, a table that matches multiple keys to find a value quickly, so I don't have to program this from scratch.
>>6
That sucks, because you have been caught trolling.
Name:
Anonymous2008-03-07 17:28
Use three different hashtables.
Name:
Anonymous2008-03-07 19:11
Like >>8 says.
For large datasets and primitive data types, a database could also be worthwhile.
Or do you mean a composite key, rather than independent lookup for each key? Then just store and retrieve using a tuple of the individual keys as the key, or whatever other hashable list your language offers.