From 2ab83e1abbf5ee6d00e16056a9e9394114026f28 Mon Sep 17 00:00:00 2001 From: Juan Linietsky Date: Sat, 7 Jan 2017 18:25:37 -0300 Subject: Memory pool vectors (DVector) have been enormously simplified in code, and renamed to PoolVector --- core/math/bsp_tree.cpp | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) (limited to 'core/math/bsp_tree.cpp') diff --git a/core/math/bsp_tree.cpp b/core/math/bsp_tree.cpp index 5242abfa3..b7194d7ff 100644 --- a/core/math/bsp_tree.cpp +++ b/core/math/bsp_tree.cpp @@ -484,7 +484,7 @@ BSP_Tree::operator Variant() const { d["planes"]=plane_values; - DVector dst_nodes; + PoolVector dst_nodes; dst_nodes.resize(nodes.size()*3); for(int i=0;i src_nodes = d["nodes"]; + PoolVector src_nodes = d["nodes"]; ERR_FAIL_COND(src_nodes.size()%3); if (d["planes"].get_type()==Variant::REAL_ARRAY) { - DVector src_planes=d["planes"]; + PoolVector src_planes=d["planes"]; int plane_count=src_planes.size(); ERR_FAIL_COND(plane_count%4); planes.resize(plane_count/4); if (plane_count) { - DVector::Read r = src_planes.read(); + PoolVector::Read r = src_planes.read(); for(int i=0;i::Read r = src_nodes.read(); + PoolVector::Read r = src_nodes.read(); for(int i=0;i& p_faces,float p_error_radius) { +BSP_Tree::BSP_Tree(const PoolVector& p_faces,float p_error_radius) { // compute aabb int face_count=p_faces.size(); - DVector::Read faces_r=p_faces.read(); + PoolVector::Read faces_r=p_faces.read(); const Face3 *facesptr = faces_r.ptr(); -- cgit v1.2.3-70-g09d2