// Boost.Geometry Index // // R-tree nodes based on Boost.Variant, storing dynamic-size containers // // Copyright (c) 2011-2014 Adam Wulkiewicz, Lodz, Poland. // // Use, modification and distribution is subject to 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) #ifndef BOOST_GEOMETRY_INDEX_DETAIL_RTREE_NODE_VARIANT_DYNAMIC_HPP #define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_NODE_VARIANT_DYNAMIC_HPP namespace boost { namespace geometry { namespace index { namespace detail { namespace rtree { // nodes default types template struct variant_internal_node { typedef boost::container::vector < rtree::ptr_pair, typename Allocators::node_allocator_type::template rebind < rtree::ptr_pair >::other > elements_type; template inline variant_internal_node(Al const& al) : elements(al) {} elements_type elements; }; template struct variant_leaf { typedef boost::container::vector < Value, typename Allocators::node_allocator_type::template rebind < Value >::other > elements_type; template inline variant_leaf(Al const& al) : elements(al) {} elements_type elements; }; // nodes traits template struct node { typedef boost::variant< variant_leaf, variant_internal_node > type; }; template struct internal_node { typedef variant_internal_node type; }; template struct leaf { typedef variant_leaf type; }; // visitor traits template struct visitor { typedef static_visitor<> type; }; // allocators template class allocators : public Allocator::template rebind< typename node< Value, Parameters, Box, allocators, node_variant_dynamic_tag >::type >::other { typedef typename Allocator::template rebind< Value >::other value_allocator_type; public: typedef Allocator allocator_type; typedef Value value_type; typedef typename value_allocator_type::reference reference; typedef typename value_allocator_type::const_reference const_reference; typedef typename value_allocator_type::size_type size_type; typedef typename value_allocator_type::difference_type difference_type; typedef typename value_allocator_type::pointer pointer; typedef typename value_allocator_type::const_pointer const_pointer; typedef typename Allocator::template rebind< typename node::type >::other::pointer node_pointer; typedef typename Allocator::template rebind< typename node::type >::other node_allocator_type; inline allocators() : node_allocator_type() {} template inline explicit allocators(Alloc const& alloc) : node_allocator_type(alloc) {} inline allocators(BOOST_FWD_REF(allocators) a) : node_allocator_type(boost::move(a.node_allocator())) {} inline allocators & operator=(BOOST_FWD_REF(allocators) a) { node_allocator() = boost::move(a.node_allocator()); return *this; } #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES inline allocators & operator=(allocators const& a) { node_allocator() = a.node_allocator(); return *this; } #endif void swap(allocators & a) { boost::swap(node_allocator(), a.node_allocator()); } bool operator==(allocators const& a) const { return node_allocator() == a.node_allocator(); } template bool operator==(Alloc const& a) const { return node_allocator() == node_allocator_type(a); } Allocator allocator() const { return Allocator(node_allocator()); } node_allocator_type & node_allocator() { return *this; } node_allocator_type const& node_allocator() const { return *this; } }; // create_node_variant template struct create_variant_node { template static inline VariantPtr apply(AllocNode & alloc_node) { typedef boost::container::allocator_traits Al; typedef typename Al::pointer P; P p = Al::allocate(alloc_node, 1); if ( 0 == p ) throw_runtime_error("boost::geometry::index::rtree node creation failed"); scoped_deallocator deallocator(p, alloc_node); Al::construct(alloc_node, boost::addressof(*p), Node(alloc_node)); // implicit cast to Variant deallocator.release(); return p; } }; // destroy_node_variant template struct destroy_variant_node { template static inline void apply(AllocNode & alloc_node, VariantPtr n) { typedef boost::container::allocator_traits Al; Al::destroy(alloc_node, boost::addressof(*n)); Al::deallocate(alloc_node, n, 1); } }; // create_node template struct create_node< Allocators, variant_internal_node > { static inline typename Allocators::node_pointer apply(Allocators & allocators) { return create_variant_node< typename Allocators::node_pointer, variant_internal_node >::apply(allocators.node_allocator()); } }; template struct create_node< Allocators, variant_leaf > { static inline typename Allocators::node_pointer apply(Allocators & allocators) { return create_variant_node< typename Allocators::node_pointer, variant_leaf >::apply(allocators.node_allocator()); } }; // destroy_node template struct destroy_node< Allocators, variant_internal_node > { static inline void apply(Allocators & allocators, typename Allocators::node_pointer n) { destroy_variant_node< variant_internal_node >::apply(allocators.node_allocator(), n); } }; template struct destroy_node< Allocators, variant_leaf > { static inline void apply(Allocators & allocators, typename Allocators::node_pointer n) { destroy_variant_node< variant_leaf >::apply(allocators.node_allocator(), n); } }; }} // namespace detail::rtree }}} // namespace boost::geometry::index #endif // BOOST_GEOMETRY_INDEX_DETAIL_RTREE_NODE_VARIANT_DYNAMIC_HPP