Home/ Questions/Q 831529
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-15T04:13:07+00:00

I have two questions about Google’s dense_hash_map , which can be used instead of

  • 0

I have two questions about Google’s dense_hash_map, which can be used instead of the more standard unordered_map or hash_map:

  1. How do I use an arbitrary binary data memory segment as a key: I want a buffer+length pair, which may still contain some NUL (\0) characters. I can see how I use a NUL-terminated char * string , but that’s not what I want.

  2. How do I implement an operation where I look if a key exists, and if not – insert it and if it does return the pointer to the existing key and let me know what actually happened.

I’d appreciate it if anyone can shed any light on this subject.

Regards,

— Shlomi Fish

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I would disagree with Neil.

    I would use insert for number 2. Using find then insert causes 2 look-ups while using insert causes one look-up without overriding if the element is already present. Normally, insert returns an iterator to the key/value pair corresponding (even if not updated) + a boolean which indicates whether or not the insertion took place.

    std::pair<iterator, bool> result = map.insert(std::make_pair(key(), value());

result.first->second; // accesses the value at key: `key()`
    • 0