FCL  0.6.0
Flexible Collision Library
traversal_node_base-inl.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_TRAVERSAL_TRAVERSALNODEBASE_INL_H
39 #define FCL_TRAVERSAL_TRAVERSALNODEBASE_INL_H
40 
41 #include "fcl/narrowphase/detail/traversal/traversal_node_base.h"
42 
43 namespace fcl
44 {
45 
46 namespace detail
47 {
48 
49 //==============================================================================
50 extern template
51 class TraversalNodeBase<double>;
52 
53 //==============================================================================
54 template <typename S>
55 TraversalNodeBase<S>::~TraversalNodeBase()
56 {
57  // Do nothing
58 }
59 
60 //==============================================================================
61 template <typename S>
62 void TraversalNodeBase<S>::preprocess()
63 {
64  // Do nothing
65 }
66 
67 //==============================================================================
68 template <typename S>
69 void TraversalNodeBase<S>::postprocess()
70 {
71  // Do nothing
72 }
73 
74 //==============================================================================
75 template <typename S>
77 {
78  return true;
79 }
80 
81 //==============================================================================
82 template <typename S>
84 {
85  return true;
86 }
87 
88 //==============================================================================
89 template <typename S>
90 bool TraversalNodeBase<S>::firstOverSecond(int b1, int b2) const
91 {
92  return true;
93 }
94 
95 //==============================================================================
96 template <typename S>
98 {
99  return b;
100 }
101 
102 //==============================================================================
103 template <typename S>
105 {
106  return b;
107 }
108 
109 //==============================================================================
110 template <typename S>
112 {
113  return b;
114 }
115 
116 //==============================================================================
117 template <typename S>
119 {
120  return b;
121 }
122 
123 } // namespace detail
124 } // namespace fcl
125 
126 #endif
Main namespace.
Definition: broadphase_bruteforce-inl.h:45
virtual bool isFirstNodeLeaf(int b) const
Whether b is a leaf node in the first BVH tree.
Definition: traversal_node_base-inl.h:76
virtual bool firstOverSecond(int b1, int b2) const
Traverse the subtree of the node in the first tree first.
Definition: traversal_node_base-inl.h:90
virtual int getFirstRightChild(int b) const
Get the right child of the node b in the first tree.
Definition: traversal_node_base-inl.h:104
virtual bool isSecondNodeLeaf(int b) const
Whether b is a leaf node in the second BVH tree.
Definition: traversal_node_base-inl.h:83
virtual int getSecondLeftChild(int b) const
Get the left child of the node b in the second tree.
Definition: traversal_node_base-inl.h:111
virtual int getSecondRightChild(int b) const
Get the right child of the node b in the second tree.
Definition: traversal_node_base-inl.h:118
virtual int getFirstLeftChild(int b) const
Get the left child of the node b in the first tree.
Definition: traversal_node_base-inl.h:97