diff options
| author | François Dumont <fdumont@gcc.gnu.org> | 2023-05-03 06:38:16 +0200 |
|---|---|---|
| committer | François Dumont <fdumont@gcc.gnu.org> | 2023-12-31 17:53:27 +0100 |
| commit | 91b334d02772d0864c168353ccf92287b6bfefe7 (patch) | |
| tree | f2a384c3d6ec1eb6df63b78ec07b42c2b3b7bce6 /gcc | |
| parent | 03fb8f274c29bfeb9a457e79c19be72e2e24e2d3 (diff) | |
| download | gcc-91b334d02772d0864c168353ccf92287b6bfefe7.zip gcc-91b334d02772d0864c168353ccf92287b6bfefe7.tar.gz gcc-91b334d02772d0864c168353ccf92287b6bfefe7.tar.bz2 | |
libstdc++: [_Hashtable] Enhance performance benches
Add benches on insert with hint and before begin cache.
libstdc++-v3/ChangeLog:
* testsuite/performance/23_containers/insert/54075.cc: Add lookup on unknown entries
w/o copy to see potential impact of memory fragmentation enhancements.
* testsuite/performance/23_containers/insert/unordered_multiset_hint.cc: Enhance hash
functor to make it perfect, exactly 1 entry per bucket. Also use hash functor tagged as
slow or not to bench w/o hash code cache.
* testsuite/performance/23_containers/insert/unordered_set_hint.cc: New test case. Like
previous one but using std::unordered_set.
* testsuite/performance/23_containers/insert/unordered_set_range_insert.cc: New test case.
Check performance of range-insertion compared to individual insertions.
* testsuite/performance/23_containers/insert_erase/unordered_small_size.cc: Add same bench
but after a copy to demonstrate impact of enhancements regarding memory fragmentation.
Diffstat (limited to 'gcc')
0 files changed, 0 insertions, 0 deletions