1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
// Copyright (c) 2007-2020 INRIA (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1.1/Orthtree/include/CGAL/Orthtree/IO.h $
// $Id: include/CGAL/Orthtree/IO.h 08b27d3db14 $
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Jackson Campolattaro, Cédric Portaneri, Tong Zhao
#ifndef CGAL_ORTHTREE_IO_H
#define CGAL_ORTHTREE_IO_H
#include <CGAL/license/Orthtree.h>
#include <iostream>
#include <ostream>
namespace CGAL
{
namespace internal
{
template<typename Node_index, typename Tree>
std::ostream& print_orthtree_node(std::ostream& os, const Node_index& node, const Tree &tree)
{
// Wrap information in brackets
os << "{ ";
// Index identifies which child this is
os << "(";
for (std::size_t i = 0; i < tree.local_coordinates(node).size(); ++ i)
os << tree.local_coordinates(node)[i];
os << ") ";
// Location
os << "( ";
for (const auto& b : tree.global_coordinates(node))
os << b << " ";
os << ") ";
// Depth
os << "("
<< +tree.depth(node) // The + forces printing as an int instead of a char
<< ") ";
os << "("
<< tree.data(node).size()
<< ") ";
// If a node is a leaf, mark it
os << (tree.is_leaf(node) ? "[leaf] " : "");
// If a node is root, mark it
os << (tree.is_root(node) ? "[root] " : "");
// Wrap information in brackets
os << "}";
return os;
}
} // internal
} // CGAL
#endif //CGAL_ORTHTREE_IO_H
|
