interval_tree.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 FCL_INTERVAL_TREE_H
39 #define FCL_INTERVAL_TREE_H
40 
41 #include <deque>
42 #include <limits>
43 #include <cstdlib>
44 #include <iostream>
46 
47 namespace fcl {
48 namespace detail {
49 
53 template <typename S>
54 struct FCL_EXPORT it_recursion_node
55 {
56 public:
58 
59  unsigned int parent_index;
60 
62 };
63 
66 
67 extern template
69 
71 template <typename S>
72 class FCL_EXPORT IntervalTree
73 {
74 public:
75 
76  IntervalTree();
77 
78  ~IntervalTree();
79 
81  void print() const;
82 
84  SimpleInterval<S>* deleteNode(IntervalTreeNode<S>* node);
85 
87  void deleteNode(SimpleInterval<S>* ivl);
88 
90  IntervalTreeNode<S>* insert(SimpleInterval<S>* new_interval);
91 
93  IntervalTreeNode<S>* getPredecessor(IntervalTreeNode<S>* node) const;
94 
96  IntervalTreeNode<S>* getSuccessor(IntervalTreeNode<S>* node) const;
97 
99  std::deque<SimpleInterval<S>*> query(S low, S high);
100 
101 protected:
102 
104 
106 
108  void leftRotate(IntervalTreeNode<S>* node);
109 
111  void rightRotate(IntervalTreeNode<S>* node);
112 
114  void recursiveInsert(IntervalTreeNode<S>* node);
115 
117  void recursivePrint(IntervalTreeNode<S>* node) const;
118 
120  IntervalTreeNode<S>* recursiveSearch(IntervalTreeNode<S>* node, SimpleInterval<S>* ivl) const;
121 
123  void fixupMaxHigh(IntervalTreeNode<S>* node);
124 
125  void deleteFixup(IntervalTreeNode<S>* node);
126 
127 private:
130  unsigned int current_parent;
132 };
133 
136 
137 } // namespace detail
138 } // namespace fcl
139 
141 
142 #endif
fcl::detail::SimpleInterval
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_...
Definition: simple_interval.h:52
fcl::detail::IntervalTree::recursion_node_stack
it_recursion_node< S > * recursion_node_stack
Definition: interval_tree.h:129
fcl::detail::IntervalTree::recursion_node_stack_size
unsigned int recursion_node_stack_size
Definition: interval_tree.h:128
fcl::detail::IntervalTree::current_parent
unsigned int current_parent
Definition: interval_tree.h:130
interval_tree-inl.h
fcl::detail::IntervalTree::nil
IntervalTreeNode< S > * nil
Definition: interval_tree.h:105
fcl::detail::it_recursion_node
Class describes the information needed when we take the right branch in searching for intervals but p...
Definition: interval_tree.h:54
fcl::detail::IntervalTree
class FCL_EXPORT IntervalTree
Definition: interval_tree_node.h:51
fcl::detail::it_recursion_node::parent_index
unsigned int parent_index
Definition: interval_tree.h:59
fcl::detail::it_recursion_node::try_right_branch
bool try_right_branch
Definition: interval_tree.h:61
fcl::detail::IntervalTreeNode
The node for interval tree.
Definition: interval_tree_node.h:55
fcl::detail::it_recursion_node::start_node
IntervalTreeNode< S > * start_node
Definition: interval_tree.h:57
fcl::detail::IntervalTree
Interval tree.
Definition: interval_tree.h:72
fcl::detail::IntervalTree::root
IntervalTreeNode< S > * root
Definition: interval_tree.h:103
fcl::detail::IntervalTree::recursion_node_stack_top
unsigned int recursion_node_stack_top
Definition: interval_tree.h:131
interval_tree_node.h
fcl
Main namespace.
Definition: broadphase_bruteforce-inl.h:45


fcl
Author(s):
autogenerated on Sat Sep 11 2021 02:37:41