FCL  0.6.0
Flexible Collision Library
interval_tree_node.h
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 FCL_BROADPHASE_DETAIL_INTERVALTREENODE_H
39 #define FCL_BROADPHASE_DETAIL_INTERVALTREENODE_H
40 
41 #include "fcl/broadphase/detail/simple_interval.h"
42 
43 namespace fcl
44 {
45 
46 namespace detail
47 {
48 
49 template <typename S>
50 class IntervalTree;
51 
53 template <typename S>
55 {
56 public:
57 
58  template <typename>
59  friend class IntervalTree;
60 
61  friend class IntervalTree<double>;
62 
65 
67  IntervalTreeNode(SimpleInterval<S>* new_interval);
68 
69  ~IntervalTreeNode();
70 
72  void print(IntervalTreeNode* left, IntervalTreeNode* right) const;
73 
74 protected:
77 
78  S key;
79 
80  S high;
81 
82  S max_high;
83 
85  bool red;
86 
87  IntervalTreeNode* left;
88 
89  IntervalTreeNode* right;
90 
91  IntervalTreeNode* parent;
92 };
93 
96 
97 } // namespace detail
98 } // namespace fcl
99 
100 #include "fcl/broadphase/detail/interval_tree_node-inl.h"
101 
102 #endif
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
IntervalTreeNode()
Create an empty node.
Definition: interval_tree_node-inl.h:54
bool red
red or black node: if red = false then the node is black
Definition: interval_tree_node.h:85
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_...
Definition: simple_interval.h:50
void print(IntervalTreeNode *left, IntervalTreeNode *right) const
Print the interval node information: set left = nil and right = root.
Definition: interval_tree_node-inl.h:79
The node for interval tree.
Definition: interval_tree_node.h:54
SimpleInterval< S > * stored_interval
interval stored in the node
Definition: interval_tree_node.h:76
Interval tree.
Definition: interval_tree.h:72