I'm trying to use Google SparseHash map. I would like to do an
intersection between to sparsehash map. How can I do easily? Can I use
STL intersection algorithm? I tried but it crashed...
Thanks in advance,
--
Guillaume
Can you clarify exactly what intersection algorithm you're using? The
only one I have on my system is set_intersection(), which assumes the
input is sorted. Obviously, that's not going to work for any
hashtable data structure. You may have to just implement this by
hand, iterating through one of the sparse_hash_maps, and checking each
key against the other.
craig
i;m having expertise to solve it but first plsss send me the details
right from the start.