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


fcl
Author(s):
autogenerated on Fri Jun 11 2021 02:38:04