boostorg/container
1
0
Fork 1
mirror of https://github.com/boostorg/container.git synced 2026-04-08 19:01:48 +02:00
Code Issues Packages Projects Releases Wiki Activity

Make static_vector<T, N>'s destructor trivial if T is trivial.

Browse Source
This commit is contained in:
Ion Gaztañaga
2025-12-09 17:11:57 +01:00
parent 6afcdbf11a
commit ccc9efcd74
4 changed files with 47 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
doc/container.qbk
View File

@@ -1437,6 +1437,7 @@ use [*Boost.Container]? There are several reasons for that:
[section:release_notes_boost_1_91_00 Boost 1.91 Release]
* Implemented heterogeneous overloads from C++23 ([@http://wg21.link/p2077r3 P2077]) and C++26 ([@http://wg21.link/P2363 P2363]).
* In C++20 compilers, `static_vector<T>`'s destructor is now trivial if `T` is trivial.
* Fixed bugs/issues:
* [@https://github.com/boostorg/container/issues/323 GitHub #323: ['"flat_tree::try_emplace UB"]].
@@ -1447,7 +1448,7 @@ use [*Boost.Container]? There are several reasons for that:
* Reimplemented [classref boost::container::deque]. The original implementation was based on
the SGI's original data structure (similar to libstdc++). Main changes:
* `sizeof(deque)` was 10 words, now is 4 words. Probably the lightest implementation around.
* `sizeof(deque::iterator)` was 4 words, now is is 2 words (similar to libc++ and MSVC).)
* `sizeof(deque::iterator)` was 4 words, now is is 2 words (similar to libc++ and MSVC).
* Several internal algorithms were reimplemented to speed up the segmented nature of deque.
* Defaults were slightly changed, 64 bit platforms now use 1024 byte blocks by default
instead of classic SGI 512 byte blocks.