print.hpp 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235
  1. // Boost.Geometry Index
  2. //
  3. // R-tree ostreaming visitor implementation
  4. //
  5. // Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland.
  6. //
  7. // This file was modified by Oracle on 2019-2023.
  8. // Modifications copyright (c) 2019-2023 Oracle and/or its affiliates.
  9. // Contributed and/or modified by Vissarion Fysikopoulos, on behalf of Oracle
  10. // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle
  11. //
  12. // Use, modification and distribution is subject to the Boost Software License,
  13. // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
  14. // http://www.boost.org/LICENSE_1_0.txt)
  15. #ifndef BOOST_GEOMETRY_INDEX_DETAIL_RTREE_UTILITIES_PRINT_HPP
  16. #define BOOST_GEOMETRY_INDEX_DETAIL_RTREE_UTILITIES_PRINT_HPP
  17. #include <iostream>
  18. #include <boost/geometry/core/access.hpp>
  19. #include <boost/geometry/core/coordinate_dimension.hpp>
  20. #include <boost/geometry/core/static_assert.hpp>
  21. #include <boost/geometry/core/tag.hpp>
  22. #include <boost/geometry/core/tags.hpp>
  23. #include <boost/geometry/index/detail/rtree/node/node_elements.hpp>
  24. #include <boost/geometry/index/detail/rtree/node/variant_visitor.hpp>
  25. #include <boost/geometry/index/detail/rtree/utilities/view.hpp>
  26. namespace boost { namespace geometry { namespace index { namespace detail {
  27. namespace utilities {
  28. namespace dispatch {
  29. template <typename Point, size_t Dimension>
  30. struct print_point
  31. {
  32. BOOST_STATIC_ASSERT(0 < Dimension);
  33. static inline void apply(std::ostream & os, Point const& p)
  34. {
  35. print_point<Point, Dimension - 1>::apply(os, p);
  36. os << ", " << geometry::get<Dimension - 1>(p);
  37. }
  38. };
  39. template <typename Point>
  40. struct print_point<Point, 1>
  41. {
  42. static inline void apply(std::ostream & os, Point const& p)
  43. {
  44. os << geometry::get<0>(p);
  45. }
  46. };
  47. template <typename Box, size_t Corner, size_t Dimension>
  48. struct print_corner
  49. {
  50. BOOST_STATIC_ASSERT(0 < Dimension);
  51. static inline void apply(std::ostream & os, Box const& b)
  52. {
  53. print_corner<Box, Corner, Dimension - 1>::apply(os, b);
  54. os << ", " << geometry::get<Corner, Dimension - 1>(b);
  55. }
  56. };
  57. template <typename Box, size_t Corner>
  58. struct print_corner<Box, Corner, 1>
  59. {
  60. static inline void apply(std::ostream & os, Box const& b)
  61. {
  62. os << geometry::get<Corner, 0>(b);
  63. }
  64. };
  65. template <typename Indexable, typename Tag>
  66. struct print_indexable
  67. {
  68. BOOST_GEOMETRY_STATIC_ASSERT_FALSE(
  69. "Not implemented for this Indexable type.",
  70. Indexable, Tag);
  71. };
  72. template <typename Indexable>
  73. struct print_indexable<Indexable, box_tag>
  74. {
  75. static const size_t dimension = geometry::dimension<Indexable>::value;
  76. static inline void apply(std::ostream &os, Indexable const& i)
  77. {
  78. os << '(';
  79. print_corner<Indexable, min_corner, dimension>::apply(os, i);
  80. os << ")x(";
  81. print_corner<Indexable, max_corner, dimension>::apply(os, i);
  82. os << ')';
  83. }
  84. };
  85. template <typename Indexable>
  86. struct print_indexable<Indexable, point_tag>
  87. {
  88. static const size_t dimension = geometry::dimension<Indexable>::value;
  89. static inline void apply(std::ostream &os, Indexable const& i)
  90. {
  91. os << '(';
  92. print_point<Indexable, dimension>::apply(os, i);
  93. os << ')';
  94. }
  95. };
  96. template <typename Indexable>
  97. struct print_indexable<Indexable, segment_tag>
  98. {
  99. static const size_t dimension = geometry::dimension<Indexable>::value;
  100. static inline void apply(std::ostream &os, Indexable const& i)
  101. {
  102. os << '(';
  103. print_corner<Indexable, 0, dimension>::apply(os, i);
  104. os << ")-(";
  105. print_corner<Indexable, 1, dimension>::apply(os, i);
  106. os << ')';
  107. }
  108. };
  109. } // namespace dispatch
  110. template <typename Indexable> inline
  111. void print_indexable(std::ostream & os, Indexable const& i)
  112. {
  113. dispatch::print_indexable<
  114. Indexable,
  115. typename tag<Indexable>::type
  116. >::apply(os, i);
  117. }
  118. } // namespace utilities
  119. namespace rtree { namespace utilities {
  120. namespace visitors {
  121. template <typename MembersHolder>
  122. struct print
  123. : public MembersHolder::visitor_const
  124. {
  125. typedef typename MembersHolder::translator_type translator_type;
  126. typedef typename MembersHolder::internal_node internal_node;
  127. typedef typename MembersHolder::leaf leaf;
  128. inline print(std::ostream & o, translator_type const& t)
  129. : os(o), tr(t), level(0)
  130. {}
  131. inline void operator()(internal_node const& n)
  132. {
  133. typedef typename rtree::elements_type<internal_node>::type elements_type;
  134. elements_type const& elements = rtree::elements(n);
  135. spaces(level) << "INTERNAL NODE - L:" << level << " Ch:" << elements.size() << " @:" << &n << '\n';
  136. for (typename elements_type::const_iterator it = elements.begin();
  137. it != elements.end(); ++it)
  138. {
  139. spaces(level);
  140. detail::utilities::print_indexable(os, it->first);
  141. os << " ->" << it->second << '\n';
  142. }
  143. size_t level_backup = level;
  144. ++level;
  145. for (typename elements_type::const_iterator it = elements.begin();
  146. it != elements.end(); ++it)
  147. {
  148. rtree::apply_visitor(*this, *it->second);
  149. }
  150. level = level_backup;
  151. }
  152. inline void operator()(leaf const& n)
  153. {
  154. typedef typename rtree::elements_type<leaf>::type elements_type;
  155. elements_type const& elements = rtree::elements(n);
  156. spaces(level) << "LEAF - L:" << level << " V:" << elements.size() << " @:" << &n << '\n';
  157. for (typename elements_type::const_iterator it = elements.begin();
  158. it != elements.end(); ++it)
  159. {
  160. spaces(level);
  161. detail::utilities::print_indexable(os, tr(*it));
  162. os << '\n';
  163. }
  164. }
  165. inline std::ostream & spaces(size_t level)
  166. {
  167. for ( size_t i = 0 ; i < 2 * level ; ++i )
  168. os << ' ';
  169. return os;
  170. }
  171. std::ostream & os;
  172. translator_type const& tr;
  173. size_t level;
  174. };
  175. } // namespace visitors
  176. template <typename Rtree> inline
  177. void print(std::ostream & os, Rtree const& tree)
  178. {
  179. typedef utilities::view<Rtree> RTV;
  180. RTV rtv(tree);
  181. visitors::print<
  182. typename RTV::members_holder
  183. > print_v(os, rtv.translator());
  184. rtv.apply_visitor(print_v);
  185. }
  186. }} // namespace rtree::utilities
  187. }}}} // namespace boost::geometry::index::detail
  188. #endif // BOOST_GEOMETRY_INDEX_DETAIL_RTREE_UTILITIES_PRINT_HPP