From 3a7dd24eadeb918f9990db7adcb3e63e76bd63fb Mon Sep 17 00:00:00 2001 From: GCC Administrator Date: Mon, 1 Jan 2024 00:18:40 +0000 Subject: Daily bump. --- libstdc++-v3/ChangeLog | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) (limited to 'libstdc++-v3') diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 2e0407a..f97165b 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,28 @@ +2023-12-31 Hans-Peter Nilsson + + * testsuite/20_util/hash/quality.cc: Increase timeout by a factor 3. + +2023-12-31 François Dumont + + * include/bits/hashtable.h: Move comment about all equivalent values + being next to each other in the class documentation header. + (_M_reinsert_node, _M_merge_unique): Implement small size optimization. + (_M_find_tr, _M_count_tr, _M_equal_range_tr): Likewise. + +2023-12-31 François Dumont + + * 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. + 2023-12-22 Christophe Lyon * Makefile.am: Allow overriding EXEPCT. -- cgit v1.1