How to best use unordered_set or unordered_map to hold small array(s) of ints
I posted this last night, but not sure it went through to the list as I don't see it in my sent items and I never got any responses. Sorry if it is duplicate. I'm hoping someone could offer an example or advice on how to best use unordered_set or unordered_map to hold many small arrays of unsigned integers. I would like to use the built in hash function rather than have to create one. Also, since I have many of these small arrays, keeping the memory footprint small and the hash time at a minimum are important concerns. A typical int array would hold 5 unsigned ints. Maybe someone could offer example code or suggestions. The samples I see are always the trivial case of just entering a single number or string as key or value. Thanks.
On Fri, Aug 20, 2010 at 12:58 PM, B Hart
I posted this last night, but not sure it went through to the list as I don't see it in my sent items and I never got any responses. Sorry if it is duplicate.
I'm hoping someone could offer an example or advice on how to best use unordered_set or unordered_map to hold many small arrays of unsigned integers. I would like to use the built in hash function rather than have to create one. Also, since I have many of these small arrays, keeping the memory footprint small and the hash time at a minimum are important concerns.
A typical int array would hold 5 unsigned ints.
Maybe someone could offer example code or suggestions. The samples I see are always the trivial case of just entering a single number or string as key or value.
Whether using a C array, boost::array, std::vector, whatever, you will need to create your own hash function as the default one does not support those by default.
participants (2)
-
B Hart -
OvermindDL1