interval_tree_node-inl.h
Go to the documentation of this file.
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 
38 #ifndef HPP_FCL_BROADPHASE_DETAIL_INTERVALTREENODE_INL_H
39 #define HPP_FCL_BROADPHASE_DETAIL_INTERVALTREENODE_INL_H
40 
42 
43 #include <iostream>
44 #include <algorithm>
45 
46 namespace hpp {
47 namespace fcl {
48 namespace detail {
49 
50 //==============================================================================
52  // Do nothing
53 }
54 
55 //==============================================================================
57  : stored_interval(new_interval),
58  key(new_interval->low),
59  high(new_interval->high),
60  max_high(high) {
61  // Do nothing
62 }
63 
64 //==============================================================================
66  // Do nothing
67 }
68 
69 //==============================================================================
71  IntervalTreeNode* root) const {
73  std::cout << ", k = " << key << ", h = " << high << ", mH = " << max_high;
74  std::cout << " l->key = ";
75  if (left == nil)
76  std::cout << "nullptr";
77  else
78  std::cout << left->key;
79  std::cout << " r->key = ";
80  if (right == nil)
81  std::cout << "nullptr";
82  else
83  std::cout << right->key;
84  std::cout << " p->key = ";
85  if (parent == root)
86  std::cout << "nullptr";
87  else
88  std::cout << parent->key;
89  std::cout << " red = " << (int)red << std::endl;
90 }
91 
92 } // namespace detail
93 } // namespace fcl
94 } // namespace hpp
95 
96 #endif
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_...
Main namespace.
SimpleInterval * stored_interval
interval stored in the node
void print(IntervalTreeNode *left, IntervalTreeNode *right) const
Print the interval node information: set left = nil and right = root.
The node for interval tree.
bool red
red or black node: if red = false then the node is black


hpp-fcl
Author(s):
autogenerated on Fri Jun 2 2023 02:39:01