summaryrefslogtreecommitdiffstats
path: root/core/math/bsp_tree.cpp
diff options
context:
space:
mode:
authorWilson E. Alvarez <wilson.e.alvarez1@gmail.com>2018-03-25 19:36:34 -0400
committerRémi Verschelde <rverschelde@gmail.com>2018-07-24 09:51:03 +0200
commita22e746bc3478bcba8540fbf30de58ebf975b132 (patch)
treedc7f8223597b1d05c62beb521643061b2f780d75 /core/math/bsp_tree.cpp
parent4b277c2c20438c5aada0d45f1e4228b15249faee (diff)
downloadredot-engine-a22e746bc3478bcba8540fbf30de58ebf975b132.tar.gz
Removed unnecessary assignments
Diffstat (limited to 'core/math/bsp_tree.cpp')
-rw-r--r--core/math/bsp_tree.cpp10
1 files changed, 3 insertions, 7 deletions
diff --git a/core/math/bsp_tree.cpp b/core/math/bsp_tree.cpp
index b1424e1d78..2e184f7a88 100644
--- a/core/math/bsp_tree.cpp
+++ b/core/math/bsp_tree.cpp
@@ -244,10 +244,8 @@ bool BSP_Tree::point_is_inside(const Vector3 &p_point) const {
const Node *nodesptr = &nodes[0];
const Plane *planesptr = &planes[0];
- int plane_count = planes.size();
int idx = node_count - 1;
- int steps = 0;
while (true) {
@@ -259,21 +257,19 @@ bool BSP_Tree::point_is_inside(const Vector3 &p_point) const {
return true;
}
- uint16_t plane = nodesptr[idx].plane;
#ifdef DEBUG_ENABLED
-
+ int plane_count = planes.size();
+ uint16_t plane = nodesptr[idx].plane;
ERR_FAIL_INDEX_V(plane, plane_count, false);
#endif
+
bool over = planesptr[nodesptr[idx].plane].is_point_over(p_point);
idx = over ? nodes[idx].over : nodes[idx].under;
#ifdef DEBUG_ENABLED
-
ERR_FAIL_COND_V(idx < MAX_NODES && idx >= node_count, false);
#endif
-
- steps++;
}
return false;