Mark internal container functions with lifetimebound attribute

Author: Morwenn

include/cpp-sort/detail/config.h

@@ -142,4 +142,19 @@
 #   endif
 #endif
 
+////////////////////////////////////////////////////////////
+// CPPSORT_LIFETIME_BOUND
+
+#ifdef __has_cpp_attribute
+#   if __has_cpp_attribute(clang::lifetimebound)
+#       define CPPSORT_LIFETIME_BOUND [[clang::lifetimebound]]
+#   elif __has_cpp_attribute(msvc::lifetimebound)
+#       define CPPSORT_LIFETIME_BOUND [[msvc::lifetimebound]]
+#   else
+#       define CPPSORT_LIFETIME_BOUND
+#   endif
+#else
+#   define CPPSORT_LIFETIME_BOUND
+#endif
+
 #endif // CPPSORT_DETAIL_CONFIG_H_

include/cpp-sort/detail/fixed_size_list.h

@@ -175,6 +175,7 @@ namespace cppsort::detail
 
             [[nodiscard]]
             auto next_free_node() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> node_type*
             {
                 // Retrieve next free node
@@ -487,13 +488,15 @@ namespace cppsort::detail
 
             [[nodiscard]]
             auto front() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> reference
             {
                 return static_cast<node_type*>(sentinel_node_.next)->value;
             }
 
             [[nodiscard]]
             auto back() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> reference
             {
                 return static_cast<node_type*>(sentinel_node_.prev)->value;
@@ -511,13 +514,15 @@ namespace cppsort::detail
 
             [[nodiscard]]
             auto begin() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> iterator
             {
                 return iterator(sentinel_node_.next);
             }
 
             [[nodiscard]]
             auto end() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> iterator
             {
                 return iterator(&sentinel_node_);
@@ -537,12 +542,14 @@ namespace cppsort::detail
             // Modifiers
 
             auto insert(iterator pos, const value_type& value)
+                CPPSORT_LIFETIME_BOUND
                 -> iterator
             {
                 return iterator(insert_node_(pos.base(), value));
             }
 
             auto insert(iterator pos, value_type&& value)
+                CPPSORT_LIFETIME_BOUND
                 -> iterator
             {
                 return iterator(insert_node_(pos.base(), std::move(value)));
@@ -781,6 +788,7 @@ namespace cppsort::detail
             // Helper functions
 
             auto insert_node_(list_node_base* pos, const value_type& value)
+                CPPSORT_LIFETIME_BOUND
                 -> node_type*
             {
                 node_type* new_node = node_pool_->next_free_node();
@@ -790,6 +798,7 @@ namespace cppsort::detail
             }
 
             auto insert_node_(list_node_base* pos, value_type&& value)
+                CPPSORT_LIFETIME_BOUND
                 -> node_type*
             {
                 node_type* new_node = node_pool_->next_free_node();
@@ -800,6 +809,7 @@ namespace cppsort::detail
 
             template<typename Callable>
             auto insert_node_(list_node_base* pos, Callable setter)
+                CPPSORT_LIFETIME_BOUND
                 -> node_type*
             {
                 node_type* new_node = node_pool_->next_free_node();

include/cpp-sort/detail/immovable_vector.h

@@ -71,20 +71,23 @@ namespace cppsort::detail
             // Element access
 
             auto operator[](std::ptrdiff_t pos) noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> T&
             {
                 CPPSORT_ASSERT(pos <= end_ - memory_);
                 return memory_[pos];
             }
 
             auto front() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> T&
             {
                 CPPSORT_ASSERT(memory_ != end_);
                 return *memory_;
             }
 
             auto back() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> T&
             {
                 CPPSORT_ASSERT(end_ - memory_ > 0);
@@ -95,12 +98,14 @@ namespace cppsort::detail
             // Iterators
 
             auto begin() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> T*
             {
                 return memory_;
             }
 
             auto end() noexcept
+                CPPSORT_LIFETIME_BOUND
                 -> T*
             {
                 return end_;
@@ -121,6 +126,7 @@ namespace cppsort::detail
 
             template<typename... Args>
             auto emplace_back(Args&&... args)
+                CPPSORT_LIFETIME_BOUND
                 -> T*
             {
                 CPPSORT_ASSERT(end_ - memory_ < capacity_);