update boost
This commit is contained in:
@@ -4,6 +4,10 @@
|
||||
//
|
||||
// Copyright (c) 2011-2015 Adam Wulkiewicz, Lodz, Poland.
|
||||
//
|
||||
// This file was modified by Oracle on 2019.
|
||||
// Modifications copyright (c) 2019 Oracle and/or its affiliates.
|
||||
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
||||
//
|
||||
// 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)
|
||||
@@ -18,16 +22,20 @@ namespace boost { namespace geometry { namespace index { namespace detail { name
|
||||
|
||||
namespace visitors {
|
||||
|
||||
template <typename Value, typename Options, typename Translator, typename Box, typename Allocators>
|
||||
template <typename MembersHolder>
|
||||
class are_boxes_ok
|
||||
: public rtree::visitor<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag, true>::type
|
||||
: public MembersHolder::visitor_const
|
||||
{
|
||||
typedef typename rtree::internal_node<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type internal_node;
|
||||
typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type leaf;
|
||||
typedef typename MembersHolder::box_type box_type;
|
||||
typedef typename MembersHolder::parameters_type parameters_type;
|
||||
typedef typename MembersHolder::translator_type translator_type;
|
||||
|
||||
typedef typename MembersHolder::internal_node internal_node;
|
||||
typedef typename MembersHolder::leaf leaf;
|
||||
|
||||
public:
|
||||
are_boxes_ok(Translator const& tr, bool exact_match)
|
||||
: result(false), m_tr(tr), m_is_root(true), m_exact_match(exact_match)
|
||||
are_boxes_ok(parameters_type const& parameters, translator_type const& tr, bool exact_match)
|
||||
: result(false), m_parameters(parameters), m_tr(tr), m_is_root(true), m_exact_match(exact_match)
|
||||
{}
|
||||
|
||||
void operator()(internal_node const& n)
|
||||
@@ -41,7 +49,7 @@ public:
|
||||
return;
|
||||
}
|
||||
|
||||
Box box_bckup = m_box;
|
||||
box_type box_bckup = m_box;
|
||||
bool is_root_bckup = m_is_root;
|
||||
|
||||
m_is_root = false;
|
||||
@@ -60,8 +68,9 @@ public:
|
||||
m_box = box_bckup;
|
||||
m_is_root = is_root_bckup;
|
||||
|
||||
Box box_exp = rtree::elements_box<Box>(elements.begin(), elements.end(), m_tr);
|
||||
|
||||
box_type box_exp = rtree::elements_box<box_type>(elements.begin(), elements.end(), m_tr,
|
||||
index::detail::get_strategy(m_parameters));
|
||||
|
||||
if ( m_exact_match )
|
||||
result = m_is_root || geometry::equals(box_exp, m_box);
|
||||
else
|
||||
@@ -81,8 +90,9 @@ public:
|
||||
result = false;
|
||||
return;
|
||||
}
|
||||
|
||||
Box box_exp = rtree::values_box<Box>(elements.begin(), elements.end(), m_tr);
|
||||
|
||||
box_type box_exp = rtree::values_box<box_type>(elements.begin(), elements.end(), m_tr,
|
||||
index::detail::get_strategy(m_parameters));
|
||||
|
||||
if ( m_exact_match )
|
||||
result = geometry::equals(box_exp, m_box);
|
||||
@@ -96,8 +106,9 @@ public:
|
||||
bool result;
|
||||
|
||||
private:
|
||||
Translator const& m_tr;
|
||||
Box m_box;
|
||||
parameters_type const& m_parameters;
|
||||
translator_type const& m_tr;
|
||||
box_type m_box;
|
||||
bool m_is_root;
|
||||
bool m_exact_match;
|
||||
};
|
||||
@@ -111,13 +122,9 @@ bool are_boxes_ok(Rtree const& tree, bool exact_match = true)
|
||||
RTV rtv(tree);
|
||||
|
||||
visitors::are_boxes_ok<
|
||||
typename RTV::value_type,
|
||||
typename RTV::options_type,
|
||||
typename RTV::translator_type,
|
||||
typename RTV::box_type,
|
||||
typename RTV::allocators_type
|
||||
> v(rtv.translator(), exact_match);
|
||||
|
||||
typename RTV::members_holder
|
||||
> v(tree.parameters(), rtv.translator(), exact_match);
|
||||
|
||||
rtv.apply_visitor(v);
|
||||
|
||||
return v.result;
|
||||
|
||||
@@ -4,6 +4,11 @@
|
||||
//
|
||||
// Copyright (c) 2011-2015 Adam Wulkiewicz, Lodz, Poland.
|
||||
//
|
||||
// This file was modified by Oracle on 2019-2023.
|
||||
// Modifications copyright (c) 2019-2023 Oracle and/or its affiliates.
|
||||
// Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
|
||||
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
||||
//
|
||||
// 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)
|
||||
@@ -12,22 +17,27 @@
|
||||
#define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_UTILITIES_ARE_COUNTS_OK_HPP
|
||||
|
||||
#include <boost/geometry/index/detail/rtree/node/node.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/utilities/view.hpp>
|
||||
|
||||
namespace boost { namespace geometry { namespace index { namespace detail { namespace rtree { namespace utilities {
|
||||
|
||||
namespace visitors {
|
||||
|
||||
template <typename Value, typename Options, typename Box, typename Allocators>
|
||||
template <typename MembersHolder>
|
||||
class are_counts_ok
|
||||
: public rtree::visitor<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag, true>::type
|
||||
: public MembersHolder::visitor_const
|
||||
{
|
||||
typedef typename rtree::internal_node<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type internal_node;
|
||||
typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type leaf;
|
||||
typedef typename Options::parameters_type parameters_type;
|
||||
typedef typename MembersHolder::parameters_type parameters_type;
|
||||
|
||||
typedef typename MembersHolder::internal_node internal_node;
|
||||
typedef typename MembersHolder::leaf leaf;
|
||||
|
||||
public:
|
||||
inline are_counts_ok(parameters_type const& parameters)
|
||||
: result(true), m_current_level(0), m_parameters(parameters)
|
||||
inline are_counts_ok(parameters_type const& parameters, bool check_min = true)
|
||||
: result(true)
|
||||
, m_current_level(0)
|
||||
, m_parameters(parameters)
|
||||
, m_check_min(check_min)
|
||||
{}
|
||||
|
||||
inline void operator()(internal_node const& n)
|
||||
@@ -36,7 +46,7 @@ public:
|
||||
elements_type const& elements = rtree::elements(n);
|
||||
|
||||
// root internal node shouldn't contain 0 elements
|
||||
if ( elements.empty()
|
||||
if ( (elements.empty() && m_check_min)
|
||||
|| !check_count(elements) )
|
||||
{
|
||||
result = false;
|
||||
@@ -62,7 +72,7 @@ public:
|
||||
elements_type const& elements = rtree::elements(n);
|
||||
|
||||
// empty leaf in non-root node
|
||||
if ( ( m_current_level > 0 && elements.empty() )
|
||||
if ( (m_current_level > 0 && elements.empty() && m_check_min)
|
||||
|| !check_count(elements) )
|
||||
{
|
||||
result = false;
|
||||
@@ -78,28 +88,26 @@ private:
|
||||
// root may contain count < min but should never contain count > max
|
||||
return elements.size() <= m_parameters.get_max_elements()
|
||||
&& ( elements.size() >= m_parameters.get_min_elements()
|
||||
|| m_current_level == 0 );
|
||||
|| m_current_level == 0 || !m_check_min );
|
||||
}
|
||||
|
||||
size_t m_current_level;
|
||||
parameters_type const& m_parameters;
|
||||
bool m_check_min;
|
||||
};
|
||||
|
||||
} // namespace visitors
|
||||
|
||||
template <typename Rtree> inline
|
||||
bool are_counts_ok(Rtree const& tree)
|
||||
bool are_counts_ok(Rtree const& tree, bool check_min = true)
|
||||
{
|
||||
typedef utilities::view<Rtree> RTV;
|
||||
RTV rtv(tree);
|
||||
|
||||
visitors::are_counts_ok<
|
||||
typename RTV::value_type,
|
||||
typename RTV::options_type,
|
||||
typename RTV::box_type,
|
||||
typename RTV::allocators_type
|
||||
> v(tree.parameters());
|
||||
|
||||
typename RTV::members_holder
|
||||
> v(tree.parameters(), check_min);
|
||||
|
||||
rtv.apply_visitor(v);
|
||||
|
||||
return v.result;
|
||||
|
||||
@@ -4,6 +4,11 @@
|
||||
//
|
||||
// Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
|
||||
//
|
||||
// This file was modified by Oracle on 2019-2023.
|
||||
// Modifications copyright (c) 2019-2023 Oracle and/or its affiliates.
|
||||
// Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
|
||||
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
||||
//
|
||||
// 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)
|
||||
@@ -12,17 +17,18 @@
|
||||
#define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_UTILITIES_ARE_LEVELS_OK_HPP
|
||||
|
||||
#include <boost/geometry/index/detail/rtree/node/node.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/utilities/view.hpp>
|
||||
|
||||
namespace boost { namespace geometry { namespace index { namespace detail { namespace rtree { namespace utilities {
|
||||
|
||||
namespace visitors {
|
||||
|
||||
template <typename Value, typename Options, typename Box, typename Allocators>
|
||||
template <typename MembersHolder>
|
||||
class are_levels_ok
|
||||
: public rtree::visitor<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag, true>::type
|
||||
: public MembersHolder::visitor_const
|
||||
{
|
||||
typedef typename rtree::internal_node<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type internal_node;
|
||||
typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type leaf;
|
||||
typedef typename MembersHolder::internal_node internal_node;
|
||||
typedef typename MembersHolder::leaf leaf;
|
||||
|
||||
public:
|
||||
inline are_levels_ok()
|
||||
@@ -93,12 +99,9 @@ bool are_levels_ok(Rtree const& tree)
|
||||
RTV rtv(tree);
|
||||
|
||||
visitors::are_levels_ok<
|
||||
typename RTV::value_type,
|
||||
typename RTV::options_type,
|
||||
typename RTV::box_type,
|
||||
typename RTV::allocators_type
|
||||
typename RTV::members_holder
|
||||
> v;
|
||||
|
||||
|
||||
rtv.apply_visitor(v);
|
||||
|
||||
return v.result;
|
||||
|
||||
@@ -4,6 +4,10 @@
|
||||
//
|
||||
// Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
|
||||
//
|
||||
// This file was modified by Oracle on 2019-2021.
|
||||
// Modifications copyright (c) 2019-2021 Oracle and/or its affiliates.
|
||||
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
||||
//
|
||||
// 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)
|
||||
@@ -11,7 +15,16 @@
|
||||
#ifndef BOOST_GEOMETRY_INDEX_DETAIL_RTREE_UTILITIES_GL_DRAW_HPP
|
||||
#define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_UTILITIES_GL_DRAW_HPP
|
||||
|
||||
#include <boost/mpl/assert.hpp>
|
||||
#include <limits>
|
||||
|
||||
#include <boost/geometry/core/access.hpp>
|
||||
#include <boost/geometry/core/coordinate_dimension.hpp>
|
||||
#include <boost/geometry/core/coordinate_type.hpp>
|
||||
#include <boost/geometry/core/static_assert.hpp>
|
||||
#include <boost/geometry/core/tag.hpp>
|
||||
#include <boost/geometry/core/tags.hpp>
|
||||
|
||||
#include <boost/geometry/index/detail/rtree/node/node_elements.hpp>
|
||||
|
||||
namespace boost { namespace geometry { namespace index { namespace detail {
|
||||
|
||||
@@ -79,7 +92,9 @@ struct gl_draw_segment<Segment, 2>
|
||||
template <typename Indexable, typename Tag>
|
||||
struct gl_draw_indexable
|
||||
{
|
||||
BOOST_MPL_ASSERT_MSG((false), NOT_IMPLEMENTED_FOR_THIS_TAG, (Tag));
|
||||
BOOST_GEOMETRY_STATIC_ASSERT_FALSE(
|
||||
"Not implemented for this Indexable type.",
|
||||
Indexable, Tag);
|
||||
};
|
||||
|
||||
template <typename Box>
|
||||
@@ -114,16 +129,20 @@ namespace rtree { namespace utilities {
|
||||
|
||||
namespace visitors {
|
||||
|
||||
template <typename Value, typename Options, typename Translator, typename Box, typename Allocators>
|
||||
struct gl_draw : public rtree::visitor<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag, true>::type
|
||||
template <typename MembersHolder>
|
||||
struct gl_draw
|
||||
: public MembersHolder::visitor_const
|
||||
{
|
||||
typedef typename rtree::internal_node<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type internal_node;
|
||||
typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type leaf;
|
||||
typedef typename MembersHolder::box_type box_type;
|
||||
typedef typename MembersHolder::translator_type translator_type;
|
||||
|
||||
inline gl_draw(Translator const& t,
|
||||
typedef typename MembersHolder::internal_node internal_node;
|
||||
typedef typename MembersHolder::leaf leaf;
|
||||
|
||||
inline gl_draw(translator_type const& t,
|
||||
size_t level_first = 0,
|
||||
size_t level_last = (std::numeric_limits<size_t>::max)(),
|
||||
typename coordinate_type<Box>::type z_coord_level_multiplier = 1
|
||||
typename coordinate_type<box_type>::type z_coord_level_multiplier = 1
|
||||
)
|
||||
: tr(t)
|
||||
, level_f(level_first)
|
||||
@@ -162,7 +181,7 @@ struct gl_draw : public rtree::visitor<Value, typename Options::parameters_type,
|
||||
detail::utilities::gl_draw_indexable(it->first, level_rel * z_mul);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
size_t level_backup = level;
|
||||
++level;
|
||||
|
||||
@@ -197,10 +216,10 @@ struct gl_draw : public rtree::visitor<Value, typename Options::parameters_type,
|
||||
}
|
||||
}
|
||||
|
||||
Translator const& tr;
|
||||
translator_type const& tr;
|
||||
size_t level_f;
|
||||
size_t level_l;
|
||||
typename coordinate_type<Box>::type z_mul;
|
||||
typename coordinate_type<box_type>::type z_mul;
|
||||
|
||||
size_t level;
|
||||
};
|
||||
@@ -226,11 +245,7 @@ void gl_draw(Rtree const& tree,
|
||||
}
|
||||
|
||||
visitors::gl_draw<
|
||||
typename RTV::value_type,
|
||||
typename RTV::options_type,
|
||||
typename RTV::translator_type,
|
||||
typename RTV::box_type,
|
||||
typename RTV::allocators_type
|
||||
typename RTV::members_holder
|
||||
> gl_draw_v(rtv.translator(), level_first, level_last, z_coord_level_multiplier);
|
||||
|
||||
rtv.apply_visitor(gl_draw_v);
|
||||
|
||||
@@ -4,6 +4,11 @@
|
||||
//
|
||||
// Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
|
||||
//
|
||||
// This file was modified by Oracle on 2019-2023.
|
||||
// Modifications copyright (c) 2019-2023 Oracle and/or its affiliates.
|
||||
// Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
|
||||
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
||||
//
|
||||
// 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)
|
||||
@@ -13,8 +18,18 @@
|
||||
|
||||
#include <iostream>
|
||||
|
||||
#include <boost/geometry/core/access.hpp>
|
||||
#include <boost/geometry/core/coordinate_dimension.hpp>
|
||||
#include <boost/geometry/core/static_assert.hpp>
|
||||
#include <boost/geometry/core/tag.hpp>
|
||||
#include <boost/geometry/core/tags.hpp>
|
||||
|
||||
#include <boost/geometry/index/detail/rtree/node/node_elements.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/node/variant_visitor.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/utilities/view.hpp>
|
||||
|
||||
namespace boost { namespace geometry { namespace index { namespace detail {
|
||||
|
||||
|
||||
namespace utilities {
|
||||
|
||||
namespace dispatch {
|
||||
@@ -66,7 +81,9 @@ struct print_corner<Box, Corner, 1>
|
||||
template <typename Indexable, typename Tag>
|
||||
struct print_indexable
|
||||
{
|
||||
BOOST_MPL_ASSERT_MSG((false), NOT_IMPLEMENTED_FOR_THIS_TAG, (Tag));
|
||||
BOOST_GEOMETRY_STATIC_ASSERT_FALSE(
|
||||
"Not implemented for this Indexable type.",
|
||||
Indexable, Tag);
|
||||
};
|
||||
|
||||
template <typename Indexable>
|
||||
@@ -129,13 +146,16 @@ namespace rtree { namespace utilities {
|
||||
|
||||
namespace visitors {
|
||||
|
||||
template <typename Value, typename Options, typename Translator, typename Box, typename Allocators>
|
||||
struct print : public rtree::visitor<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag, true>::type
|
||||
template <typename MembersHolder>
|
||||
struct print
|
||||
: public MembersHolder::visitor_const
|
||||
{
|
||||
typedef typename rtree::internal_node<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type internal_node;
|
||||
typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type leaf;
|
||||
typedef typename MembersHolder::translator_type translator_type;
|
||||
|
||||
inline print(std::ostream & o, Translator const& t)
|
||||
typedef typename MembersHolder::internal_node internal_node;
|
||||
typedef typename MembersHolder::leaf leaf;
|
||||
|
||||
inline print(std::ostream & o, translator_type const& t)
|
||||
: os(o), tr(t), level(0)
|
||||
{}
|
||||
|
||||
@@ -145,7 +165,7 @@ struct print : public rtree::visitor<Value, typename Options::parameters_type, B
|
||||
elements_type const& elements = rtree::elements(n);
|
||||
|
||||
spaces(level) << "INTERNAL NODE - L:" << level << " Ch:" << elements.size() << " @:" << &n << '\n';
|
||||
|
||||
|
||||
for (typename elements_type::const_iterator it = elements.begin();
|
||||
it != elements.end(); ++it)
|
||||
{
|
||||
@@ -189,7 +209,7 @@ struct print : public rtree::visitor<Value, typename Options::parameters_type, B
|
||||
}
|
||||
|
||||
std::ostream & os;
|
||||
Translator const& tr;
|
||||
translator_type const& tr;
|
||||
|
||||
size_t level;
|
||||
};
|
||||
@@ -203,11 +223,7 @@ void print(std::ostream & os, Rtree const& tree)
|
||||
RTV rtv(tree);
|
||||
|
||||
visitors::print<
|
||||
typename RTV::value_type,
|
||||
typename RTV::options_type,
|
||||
typename RTV::translator_type,
|
||||
typename RTV::box_type,
|
||||
typename RTV::allocators_type
|
||||
typename RTV::members_holder
|
||||
> print_v(os, rtv.translator());
|
||||
rtv.apply_visitor(print_v);
|
||||
}
|
||||
|
||||
@@ -5,6 +5,11 @@
|
||||
// Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
|
||||
// Copyright (c) 2013 Mateusz Loskot, London, UK.
|
||||
//
|
||||
// This file was modified by Oracle on 2019-2023.
|
||||
// Modifications copyright (c) 2019-2023 Oracle and/or its affiliates.
|
||||
// Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
|
||||
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
||||
//
|
||||
// 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)
|
||||
@@ -13,17 +18,22 @@
|
||||
#define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_UTILITIES_STATISTICS_HPP
|
||||
|
||||
#include <algorithm>
|
||||
#include <boost/tuple/tuple.hpp>
|
||||
#include <tuple>
|
||||
|
||||
#include <boost/geometry/index/detail/rtree/node/node_elements.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/node/variant_visitor.hpp>
|
||||
#include <boost/geometry/index/detail/rtree/utilities/view.hpp>
|
||||
|
||||
namespace boost { namespace geometry { namespace index { namespace detail { namespace rtree { namespace utilities {
|
||||
|
||||
namespace visitors {
|
||||
|
||||
template <typename Value, typename Options, typename Box, typename Allocators>
|
||||
struct statistics : public rtree::visitor<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag, true>::type
|
||||
template <typename MembersHolder>
|
||||
struct statistics
|
||||
: public MembersHolder::visitor_const
|
||||
{
|
||||
typedef typename rtree::internal_node<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type internal_node;
|
||||
typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename Options::node_tag>::type leaf;
|
||||
typedef typename MembersHolder::internal_node internal_node;
|
||||
typedef typename MembersHolder::leaf leaf;
|
||||
|
||||
inline statistics()
|
||||
: level(0)
|
||||
@@ -39,37 +49,37 @@ struct statistics : public rtree::visitor<Value, typename Options::parameters_ty
|
||||
{
|
||||
typedef typename rtree::elements_type<internal_node>::type elements_type;
|
||||
elements_type const& elements = rtree::elements(n);
|
||||
|
||||
|
||||
++nodes; // count node
|
||||
|
||||
size_t const level_backup = level;
|
||||
++level;
|
||||
|
||||
levels += level++ > levels ? 1 : 0; // count level (root already counted)
|
||||
|
||||
|
||||
for (typename elements_type::const_iterator it = elements.begin();
|
||||
it != elements.end(); ++it)
|
||||
{
|
||||
rtree::apply_visitor(*this, *it->second);
|
||||
}
|
||||
|
||||
|
||||
level = level_backup;
|
||||
}
|
||||
|
||||
inline void operator()(leaf const& n)
|
||||
{
|
||||
{
|
||||
typedef typename rtree::elements_type<leaf>::type elements_type;
|
||||
elements_type const& elements = rtree::elements(n);
|
||||
|
||||
++leaves; // count leaves
|
||||
|
||||
|
||||
std::size_t const v = elements.size();
|
||||
// count values spread per node and total
|
||||
values_min = (std::min)(values_min == 0 ? v : values_min, v);
|
||||
values_max = (std::max)(values_max, v);
|
||||
values += v;
|
||||
}
|
||||
|
||||
|
||||
std::size_t level;
|
||||
std::size_t levels;
|
||||
std::size_t nodes;
|
||||
@@ -82,22 +92,19 @@ struct statistics : public rtree::visitor<Value, typename Options::parameters_ty
|
||||
} // namespace visitors
|
||||
|
||||
template <typename Rtree> inline
|
||||
boost::tuple<std::size_t, std::size_t, std::size_t, std::size_t, std::size_t, std::size_t>
|
||||
std::tuple<std::size_t, std::size_t, std::size_t, std::size_t, std::size_t, std::size_t>
|
||||
statistics(Rtree const& tree)
|
||||
{
|
||||
typedef utilities::view<Rtree> RTV;
|
||||
RTV rtv(tree);
|
||||
|
||||
visitors::statistics<
|
||||
typename RTV::value_type,
|
||||
typename RTV::options_type,
|
||||
typename RTV::box_type,
|
||||
typename RTV::allocators_type
|
||||
typename RTV::members_holder
|
||||
> stats_v;
|
||||
|
||||
rtv.apply_visitor(stats_v);
|
||||
|
||||
return boost::make_tuple(stats_v.levels, stats_v.nodes, stats_v.leaves, stats_v.values, stats_v.values_min, stats_v.values_max);
|
||||
|
||||
return std::make_tuple(stats_v.levels, stats_v.nodes, stats_v.leaves, stats_v.values, stats_v.values_min, stats_v.values_max);
|
||||
}
|
||||
|
||||
}}}}}} // namespace boost::geometry::index::detail::rtree::utilities
|
||||
|
||||
@@ -4,6 +4,10 @@
|
||||
//
|
||||
// Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
|
||||
//
|
||||
// This file was modified by Oracle on 2019.
|
||||
// Modifications copyright (c) 2019 Oracle and/or its affiliates.
|
||||
// Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
|
||||
//
|
||||
// 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)
|
||||
@@ -19,13 +23,15 @@ template <typename Rtree>
|
||||
class view
|
||||
{
|
||||
public:
|
||||
typedef typename Rtree::members_holder members_holder;
|
||||
|
||||
typedef typename Rtree::size_type size_type;
|
||||
|
||||
typedef typename Rtree::translator_type translator_type;
|
||||
typedef typename Rtree::value_type value_type;
|
||||
typedef typename Rtree::options_type options_type;
|
||||
typedef typename Rtree::box_type box_type;
|
||||
typedef typename Rtree::allocators_type allocators_type;
|
||||
typedef typename Rtree::allocators_type allocators_type;
|
||||
|
||||
view(Rtree const& rt) : m_rtree(rt) {}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user