OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:m_node_array
(Results
1 - 6
of
6
) sorted by null
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/
gim_box_set.cpp
127
m_node_array
[current_index].m_left = 0;
128
m_node_array
[current_index].m_right = 0;
129
m_node_array
[current_index].m_escapeIndex = 0;
131
m_node_array
[current_index].m_bound = primitive_boxes[startIndex].m_bound;
132
m_node_array
[current_index].m_data = primitive_boxes[startIndex].m_data;
141
m_node_array
[current_index].m_bound.invalidate();
144
m_node_array
[current_index].m_bound.merge(primitive_boxes[splitIndex].m_bound);
156
m_node_array
[current_index].m_left = m_num_nodes;
161
m_node_array
[current_index].m_right = m_num_nodes;
167
m_node_array
[current_index].m_escapeIndex = m_num_nodes - current_index
[
all
...]
btGImpactQuantizedBvh.h
109
GIM_QUANTIZED_BVH_NODE_ARRAY
m_node_array
;
member in class:btQuantizedBvhTree
143
return
m_node_array
[node_index].testQuantizedBoxOverlapp(quantizedMin,quantizedMax);
148
m_node_array
.clear();
161
return
m_node_array
[nodeindex].isLeafNode();
166
return
m_node_array
[nodeindex].getDataIndex();
172
m_node_array
[nodeindex].m_quantizedAabbMin,
176
m_node_array
[nodeindex].m_quantizedAabbMax,
182
bt_quantize_clamp(
m_node_array
[nodeindex].m_quantizedAabbMin,
188
bt_quantize_clamp(
m_node_array
[nodeindex].m_quantizedAabbMax,
202
if(
m_node_array
[nodeindex+1].isLeafNode()) return nodeindex+2
[
all
...]
btGImpactBvh.h
147
GIM_BVH_TREE_NODE_ARRAY
m_node_array
;
member in class:btBvhTree
168
m_node_array
.clear();
181
return
m_node_array
[nodeindex].isLeafNode();
186
return
m_node_array
[nodeindex].getDataIndex();
191
bound =
m_node_array
[nodeindex].m_bound;
196
m_node_array
[nodeindex].m_bound = bound;
206
if(
m_node_array
[nodeindex+1].isLeafNode()) return nodeindex+2;
207
return nodeindex+1 +
m_node_array
[nodeindex+1].getEscapeIndex();
212
return
m_node_array
[nodeindex].getEscapeIndex();
217
return &
m_node_array
[index]
[
all
...]
gim_box_set.h
137
gim_array<GIM_BOX_TREE_NODE>
m_node_array
;
member in class:GIM_BOX_TREE
158
m_node_array
.clear();
171
return
m_node_array
[nodeindex].is_leaf_node();
176
return
m_node_array
[nodeindex].m_data;
181
bound =
m_node_array
[nodeindex].m_bound;
186
m_node_array
[nodeindex].m_bound = bound;
191
return
m_node_array
[nodeindex].m_left;
196
return
m_node_array
[nodeindex].m_right;
201
return
m_node_array
[nodeindex].m_escapeIndex;
btGImpactBvh.cpp
171
m_node_array
[curIndex].setDataIndex(primitive_boxes[startIndex].m_data);
206
m_node_array
[curIndex].setEscapeIndex(m_num_nodes - curIndex);
218
m_node_array
.resize(primitive_boxes.size()*2);
btGImpactQuantizedBvh.cpp
192
m_node_array
[curIndex].setDataIndex(primitive_boxes[startIndex].m_data);
227
m_node_array
[curIndex].setEscapeIndex(m_num_nodes - curIndex);
240
m_node_array
.resize(primitive_boxes.size()*2);
Completed in 97 milliseconds