sparse-map icon indicating copy to clipboard operation
sparse-map copied to clipboard

C++ implementation of a memory efficient hash map and hash set

Results 11 sparse-map issues
Sort by recently updated
recently updated
newest added

Also allows controlling the use of exceptions on platforms with exceptions. Fixes #18

Some systems, such as the homebrew Xbox xndk, do not implement exceptions. It'd be great if `tsl::sparse_map` had an option to compile without exceptions. I'll look into it and send...

```c++ tsl::sparse_map m; for (auto &it : m) { std::string &value = it.second; } ``` This fails with `tsl` but works with `std::unordered_map`. This is documented in README.md but there...

In `tsl::sparse_map`, `iterator->first/second` result is always const regardless of the underlying constness. This is different from `std::unordered_map`, where `iterator->first/second` result is `const` only if the map is const. This is...

This pull request adds support for scoped_allocator_adaptor and allocators with fancy pointers like boost offset pointers. With these additions, it is now possible to persist the sparse_set and sparse_map via...

The code ```C++ auto fctHash=[](size_t val) -> size_t { return val; }; auto fctEqual=[](size_t val1, size_t val2) -> bool { return val1 == val2; }; tsl::sparse_map V({}, fctHash, fctEqual); ```...

There's an issue with accessing an existing value with operator[] when hashtable size reaches a certain value: iterator is sometimes being invalidated leading to broken iterators invalidation contract: > -...

with const this code will not compile tsl::sparse_map spp; const auto it=spp.emplace(1,1); it.first->second=1;

If we have precalculated hash, emplace/insert might be helpful as well?

Hi,The current sparse hash table employs bucket-level probing to handle conflicts, ensuring that the fill factor doesn't become too high. Is it possible to use internal probing within a specific...