// Boost.Geometry Index // // R-tree nodes based on static conversion, storing static-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_WEAK_STATIC_HPP #define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_NODE_WEAK_STATIC_HPP namespace boost { namespace geometry { namespace index { namespace detail { namespace rtree { template struct weak_internal_node : public weak_node { typedef detail::varray< rtree::ptr_pair, Parameters::max_elements + 1 > elements_type; template inline weak_internal_node(Alloc const&) {} elements_type elements; }; template struct weak_leaf : public weak_node { typedef detail::varray< Value, Parameters::max_elements + 1 > elements_type; template inline weak_leaf(Alloc const&) {} elements_type elements; }; // nodes traits template struct node { typedef weak_node type; }; template struct internal_node { typedef weak_internal_node type; }; template struct leaf { typedef weak_leaf type; }; template struct visitor { typedef weak_visitor type; }; // allocators template class allocators : public Allocator::template rebind< typename internal_node< Value, Parameters, Box, allocators, node_weak_static_tag >::type >::other , public Allocator::template rebind< typename leaf< Value, Parameters, Box, allocators, node_weak_static_tag >::type >::other { typedef typename Allocator::template rebind< Value >::other value_allocator_type; public: typedef Allocator allocator_type; typedef Value value_type; typedef value_type & reference; typedef const value_type & 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 internal_node::type >::other internal_node_allocator_type; typedef typename Allocator::template rebind< typename leaf::type >::other leaf_allocator_type; inline allocators() : internal_node_allocator_type() , leaf_allocator_type() {} template inline explicit allocators(Alloc const& alloc) : internal_node_allocator_type(alloc) , leaf_allocator_type(alloc) {} inline allocators(BOOST_FWD_REF(allocators) a) : internal_node_allocator_type(boost::move(a.internal_node_allocator())) , leaf_allocator_type(boost::move(a.leaf_allocator())) {} inline allocators & operator=(BOOST_FWD_REF(allocators) a) { internal_node_allocator() = ::boost::move(a.internal_node_allocator()); leaf_allocator() = ::boost::move(a.leaf_allocator()); return *this; } #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES inline allocators & operator=(allocators const& a) { internal_node_allocator() = a.internal_node_allocator(); leaf_allocator() = a.leaf_allocator(); return *this; } #endif void swap(allocators & a) { boost::swap(internal_node_allocator(), a.internal_node_allocator()); boost::swap(leaf_allocator(), a.leaf_allocator()); } bool operator==(allocators const& a) const { return leaf_allocator() == a.leaf_allocator(); } template bool operator==(Alloc const& a) const { return leaf_allocator() == leaf_allocator_type(a); } Allocator allocator() const { return Allocator(leaf_allocator()); } internal_node_allocator_type & internal_node_allocator() { return *this; } internal_node_allocator_type const& internal_node_allocator() const { return *this; } leaf_allocator_type & leaf_allocator() { return *this; } leaf_allocator_type const& leaf_allocator() const{ return *this; } }; }} // namespace detail::rtree }}} // namespace boost::geometry::index #endif // BOOST_GEOMETRY_INDEX_DETAIL_RTREE_NODE_WEAK_STATIC_HPP