Add trivially_relocatable_if_eligible and replaceable_if_eligible

Author: davidstone

source/containers/bidirectional_linked_list.cpp

@@ -58,7 +58,7 @@ constexpr auto link_range(bidirectional_links * const original_first, bidirectio
 }
 
 export template<typename T>
-struct bidirectional_linked_list : private lexicographical_comparison::base {
+struct bidirectional_linked_list replaceable_if_eligible : private lexicographical_comparison::base {
 	using const_iterator = list_iterator<bidirectional_linked_list, bidirectional_links const, T>;
 	using iterator = list_iterator<bidirectional_linked_list, bidirectional_links, T>;
 

source/containers/bounded_vector.cpp

@@ -37,7 +37,7 @@ namespace containers {
 // Cannot use `array_size_type<T>` because that would not support incomplete
 // types.
 export template<typename T, array_size_type<std::byte> min_capacity, array_size_type<std::byte> max_capacity>
-struct [[clang::trivial_abi]] bounded_vector : private lexicographical_comparison::base {
+struct [[clang::trivial_abi]] bounded_vector trivially_relocatable_if_eligible replaceable_if_eligible : private lexicographical_comparison::base {
 	template<typename U, array_size_type<std::byte> other_min_capacity, array_size_type<std::byte> other_max_capacity>
 	friend struct bounded_vector;
 

source/containers/dynamic_array.cpp

@@ -37,7 +37,7 @@ namespace containers {
 using namespace bounded::literal;
 
 export template<typename T, typename Size = array_size_type<T>>
-struct [[clang::trivial_abi]] dynamic_array : private lexicographical_comparison::base {
+struct [[clang::trivial_abi]] dynamic_array trivially_relocatable_if_eligible replaceable_if_eligible : private lexicographical_comparison::base {
 	static_assert(numeric_traits::min_value<Size> >= 0_bi);
 	using size_type = Size;
 

source/containers/forward_linked_list.cpp

@@ -34,7 +34,7 @@ struct forward_link {
 };
 
 export template<typename T>
-struct [[clang::trivial_abi]] forward_linked_list : private lexicographical_comparison::base {
+struct [[clang::trivial_abi]] forward_linked_list trivially_relocatable_if_eligible replaceable_if_eligible : private lexicographical_comparison::base {
 	using const_iterator = list_iterator<forward_linked_list, forward_link const, T>;
 	using iterator = list_iterator<forward_linked_list, forward_link, T>;
 

source/containers/small_buffer_optimized_vector.cpp

@@ -164,7 +164,7 @@ struct [[gnu::packed]] large_type {
 };
 
 export template<typename T, std::size_t requested_small_capacity, std::size_t max_size = containers::maximum_array_size<T>>
-struct [[clang::trivial_abi]] small_buffer_optimized_vector : private lexicographical_comparison::base {
+struct [[clang::trivial_abi]] small_buffer_optimized_vector trivially_relocatable_if_eligible replaceable_if_eligible : private lexicographical_comparison::base {
 	using size_type = small_buffer_size_type<max_size>;
 
 	static_assert(

source/containers/stable_vector.cpp

@@ -16,7 +16,7 @@ namespace containers {
 // `capacity_` cannot be `array_size_type<T>` because that would not support
 // incomplete types.
 export template<typename T, array_size_type<std::byte> capacity_>
-struct [[clang::trivial_abi]] stable_vector : private bounded_vector<T, capacity_, capacity_> {
+struct stable_vector : private bounded_vector<T, capacity_, capacity_> {
 private:
 	using base = bounded_vector<T, capacity_, capacity_>;
 public:

source/containers/static_vector.cpp

@@ -46,7 +46,7 @@ using namespace bounded::literal;
 namespace containers {
 
 export template<typename T, array_size_type<T> capacity_>
-struct [[clang::trivial_abi]] static_vector : private lexicographical_comparison::base {
+struct [[clang::trivial_abi]] static_vector trivially_relocatable_if_eligible replaceable_if_eligible : private lexicographical_comparison::base {
 	static_vector() = default;
 
 	static_vector(static_vector &&) requires(capacity_ == 0_bi or bounded::trivially_move_constructible<T>) = default;

source/containers/uninitialized_dynamic_array.cpp

@@ -19,7 +19,7 @@ using namespace bounded::literal;
 namespace containers {
 
 export template<typename T, typename Capacity>
-struct [[clang::trivial_abi]] uninitialized_dynamic_array {
+struct [[clang::trivial_abi]] uninitialized_dynamic_array trivially_relocatable_if_eligible replaceable_if_eligible {
 	template<typename U, typename OtherCapacity>
 	friend struct uninitialized_dynamic_array;
 

source/containers/vector.cpp

@@ -21,7 +21,7 @@ namespace containers {
 // `max_size` cannot be `array_size_type<T>` because that would not support
 // incomplete types.
 export template<typename T, array_size_type<std::byte> max_size = numeric_traits::max_value<array_size_type<T>>>
-struct [[clang::trivial_abi]] vector : private bounded_vector<T, 0_bi, max_size> {
+struct vector : private bounded_vector<T, 0_bi, max_size> {
 private:
 	using base = bounded_vector<T, 0_bi, max_size>;
 public:

source/tv/single_element_storage.cpp

@@ -11,7 +11,7 @@ import std_module;
 namespace tv {
 
 export template<typename T>
-union [[clang::trivial_abi]] single_element_storage {
+union [[clang::trivial_abi]] single_element_storage trivially_relocatable_if_eligible replaceable_if_eligible {
 	~single_element_storage() requires bounded::trivially_destructible<T> = default;
 	constexpr ~single_element_storage() {}
 	T value;