/* Copyright 2003-2025 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_NODE_HANDLE_HPP #define BOOST_MULTI_INDEX_DETAIL_NODE_HANDLE_HPP #if defined(_MSC_VER) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Node handle template class following [container.node] specs. */ #include template class node_handle { public: typedef typename Node::value_type value_type; typedef Allocator allocator_type; node_handle()BOOST_NOEXCEPT:node(0){} node_handle(node_handle&& x)BOOST_NOEXCEPT:node(x.node) { if(!x.empty()){ move_construct_allocator(std::move(x)); x.destroy_allocator(); x.node=0; } } ~node_handle() { if(!empty()){ delete_node(); destroy_allocator(); } } node_handle& operator=(node_handle&& x) { if(this!=&x){ if(!empty()){ delete_node(); if(!x.empty()){ BOOST_MULTI_INDEX_IF_CONSTEXPR( allocator_propagate_on_container_move_assignment_t< allocator_type>::value){ move_assign_allocator(std::move(x)); } x.destroy_allocator(); } else{ destroy_allocator(); } } else if(!x.empty()){ move_construct_allocator(std::move(x)); x.destroy_allocator(); } node=x.node; x.node=0; } return *this; } value_type& value()const{return node->value();} allocator_type get_allocator()const{return *allocator_ptr();} #if !defined(BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS) explicit #endif operator bool()const BOOST_NOEXCEPT{return (node!=0);} #if BOOST_WORKAROUND(BOOST_GCC_VERSION,>=70000)&&__cplusplus<201103L /* https://github.com/boostorg/config/issues/336 */ #else BOOST_ATTRIBUTE_NODISCARD #endif bool empty()const BOOST_NOEXCEPT{return (node==0);} void swap(node_handle& x) BOOST_NOEXCEPT_IF( allocator_propagate_on_container_swap_t::value|| allocator_is_always_equal_t::value) { if(!empty()){ if(!x.empty()){ BOOST_MULTI_INDEX_IF_CONSTEXPR( allocator_propagate_on_container_swap_t::value){ using std::swap; swap(*allocator_ptr(),*x.allocator_ptr()); } } else{ x.move_construct_allocator(std::move(*this)); destroy_allocator(); } } else if(!x.empty()){ move_construct_allocator(std::move(x)); x.destroy_allocator(); } std::swap(node,x.node); } friend void swap(node_handle& x,node_handle& y) BOOST_NOEXCEPT_IF(noexcept(x.swap(y))) { x.swap(y); } private: template friend class boost::multi_index::multi_index_container; node_handle(Node* node_,const allocator_type& al):node(node_) { ::new (static_cast(allocator_ptr())) allocator_type(al); } void release_node() { if(!empty()){ node=0; destroy_allocator(); } } #include const allocator_type* allocator_ptr()const { return reinterpret_cast(&space); } allocator_type* allocator_ptr() { return reinterpret_cast(&space); } #include void move_construct_allocator(node_handle&& x) { ::new (static_cast(allocator_ptr())) allocator_type(std::move(*x.allocator_ptr())); } void move_assign_allocator(node_handle&& x) { *allocator_ptr()=std::move(*x.allocator_ptr()); } void destroy_allocator(){allocator_ptr()->~allocator_type();} void delete_node() { typedef allocator_rebind_t node_allocator; typedef allocator_pointer_t node_pointer; allocator_destroy(*allocator_ptr(),boost::addressof(node->value())); node_allocator nal(*allocator_ptr()); allocator_deallocate(nal,static_cast(node),1); } Node* node; typename aligned_storage< sizeof(allocator_type), alignment_of::value >::type space; }; #include /* node handle insert return type template class following * [container.insert.return] specs. */ template struct insert_return_type { insert_return_type( Iterator position_,bool inserted_,NodeHandle&& node_): position(position_),inserted(inserted_),node(std::move(node_)){} insert_return_type(insert_return_type&& x): position(x.position),inserted(x.inserted),node(std::move(x.node)){} insert_return_type& operator=(insert_return_type&& x) { position=x.position; inserted=x.inserted; node=std::move(x.node); return *this; } Iterator position; bool inserted; NodeHandle node; }; /* utility for SFINAEing merge and related operations */ #define BOOST_MULTI_INDEX_ENABLE_IF_MERGEABLE(Dst,Src,T) \ typename enable_if_c< \ !is_const< Dst >::value&&!is_const< Src >::value&& \ is_same::value, \ T \ >::type } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif