mirror of
https://git.suyu.dev/suyu/dynarmic.git
synced 2026-02-12 05:02:57 +00:00
`map` is an ordinal structure with log(n) time searches. `unordered_map` uses O(1) average-time searches and O(n) in the worst case where a bucket has a to a colliding hash and has to start chaining. The unordered version should speed up our general-case when looking up constants. I've added a trivial order-dependent(_(0,1) and (1,0) will return a different hash_) hash to combine a 128-bit constant into a 64-bit hash that generally will not collide, using a bit-rotate to preserve entropy. |
||
|---|---|---|
| .. | ||
| dynarmic | ||