GCC Code Coverage Report


Directory: ./
File: src/broadphase/detail/interval_tree_node.cpp
Date: 2025-04-01 09:23:31
Exec Total Coverage
Lines: 10 26 38.5%
Branches: 0 6 0.0%

Line Branch Exec Source
1 /*
2 * Software License Agreement (BSD License)
3 *
4 * Copyright (c) 2011-2014, Willow Garage, Inc.
5 * Copyright (c) 2014-2016, Open Source Robotics Foundation
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer in the documentation and/or other materials provided
17 * with the distribution.
18 * * Neither the name of Open Source Robotics Foundation nor the names of its
19 * contributors may be used to endorse or promote products derived
20 * from this software without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
30 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33 * POSSIBILITY OF SUCH DAMAGE.
34 */
35
36 /** @author Jia Pan */
37
38 #ifndef COAL_BROADPHASE_DETAIL_INTERVALTREENODE_INL_H
39 #define COAL_BROADPHASE_DETAIL_INTERVALTREENODE_INL_H
40
41 #include "coal/broadphase/detail/interval_tree_node.h"
42
43 #include <iostream>
44 #include <algorithm>
45
46 namespace coal {
47 namespace detail {
48
49 //==============================================================================
50 384 IntervalTreeNode::IntervalTreeNode() {
51 // Do nothing
52 384 }
53
54 //==============================================================================
55 42045 IntervalTreeNode::IntervalTreeNode(SimpleInterval* new_interval)
56 42045 : stored_interval(new_interval),
57 42045 key(new_interval->low),
58 42045 high(new_interval->high),
59 42045 max_high(high) {
60 // Do nothing
61 42045 }
62
63 //==============================================================================
64 41523 IntervalTreeNode::~IntervalTreeNode() {
65 // Do nothing
66 41523 }
67
68 //==============================================================================
69 void IntervalTreeNode::print(IntervalTreeNode* invalid_node,
70 IntervalTreeNode* root) const {
71 stored_interval->print();
72 std::cout << ", k = " << key << ", h = " << high << ", mH = " << max_high;
73 std::cout << " l->key = ";
74 if (left == invalid_node)
75 std::cout << "nullptr";
76 else
77 std::cout << left->key;
78 std::cout << " r->key = ";
79 if (right == invalid_node)
80 std::cout << "nullptr";
81 else
82 std::cout << right->key;
83 std::cout << " p->key = ";
84 if (parent == root)
85 std::cout << "nullptr";
86 else
87 std::cout << parent->key;
88 std::cout << " red = " << (int)red << std::endl;
89 }
90
91 } // namespace detail
92 } // namespace coal
93
94 #endif
95