Martin Leitner-Ankerl

Idea for robin-hood-hashing V2

1

* Performance is important but not everything * Use an `std::vector` (maybe customizable) for the content that is always 100% compact. iteration is perfectly fast. * Use an indexing structure...

Investigate non-throwing overflow resolution

18

For extremely bad hash, overflow can happen. Investigate how to resolve this gracefully (and without losing performance!)

Add a define that enables error checking in robin_hood map, to check for invalid uses of iteratos after map/set is modified. This is mostly for debugging. * Add a flag...

std::cout flags not resetted before doctest output

5

## Description Not sure if this counts as a bug, but it took me a while to figure out what's going on. When modifying std::cout with e.g. `std::cout

https://github.com/zserge/jsmn/blob/35086597a72d94d8393e6a90b96e553d714085bd/jsmn.c#L209 I think at this position you can use tokSuper, which should save you from iterating the array at this point: ```C for (i = parser->tokSuper; i >= 0; i--)...

it = map.erase(it) potentially passes entries twice

6

I've stumbled upon a bug in my robin_hood map which also uses backward shift deleting, and wondered how you solve this issue in `tsl::robin_map`, and it seems you have exactly...

Some notes for the big update

4

* don't split up benchmark results by hash * Maybe split up into open address hashing and chained hashing y or node based * Split up into 2 categories: open...

I'm pretty sure build will initially fail. See https://github.com/martinus/unordered_dense/blob/main/.github/workflows/main.yml how to do this.

Needs a quite different data layout

Add pool based memory resource

3

A memory resource similar to `std::pmr::unsynchronized_pool_resource`, but optimized for node-based containers. The goal is to be able to cache more coins with the same memory usage, and allocate/deallocate faster. This...