summaryrefslogtreecommitdiff
path: root/thirdparty/recastnavigation/Recast/Source/RecastRegion.cpp
diff options
context:
space:
mode:
authorRémi Verschelde <rverschelde@gmail.com>2022-05-17 22:59:40 +0200
committerRémi Verschelde <rverschelde@gmail.com>2022-05-17 22:59:40 +0200
commit4635f243226776ea6b7e5050516deb5e0e909385 (patch)
treec70e468d64039238c14479e05102eb60e5367869 /thirdparty/recastnavigation/Recast/Source/RecastRegion.cpp
parentd5c1de784ccd622ce9d62613eaf604a8b163d592 (diff)
Recast: Update to upstream commit 5a870d4 (2022)
Diffstat (limited to 'thirdparty/recastnavigation/Recast/Source/RecastRegion.cpp')
-rw-r--r--thirdparty/recastnavigation/Recast/Source/RecastRegion.cpp10
1 files changed, 5 insertions, 5 deletions
diff --git a/thirdparty/recastnavigation/Recast/Source/RecastRegion.cpp b/thirdparty/recastnavigation/Recast/Source/RecastRegion.cpp
index e1fc0ee788..48318688bc 100644
--- a/thirdparty/recastnavigation/Recast/Source/RecastRegion.cpp
+++ b/thirdparty/recastnavigation/Recast/Source/RecastRegion.cpp
@@ -650,7 +650,7 @@ static bool mergeRegions(rcRegion& rega, rcRegion& regb)
return false;
// Merge neighbours.
- rega.connections.resize(0);
+ rega.connections.clear();
for (int i = 0, ni = acon.size(); i < ni-1; ++i)
rega.connections.push(acon[(insa+1+i) % ni]);
@@ -876,8 +876,8 @@ static bool mergeAndFilterRegions(rcContext* ctx, int minRegionArea, int mergeRe
// Also keep track of the regions connects to a tile border.
bool connectsToBorder = false;
int spanCount = 0;
- stack.resize(0);
- trace.resize(0);
+ stack.clear();
+ trace.clear();
reg.visited = true;
stack.push(i);
@@ -1068,7 +1068,7 @@ static bool mergeAndFilterLayerRegions(rcContext* ctx, int minRegionArea,
{
const rcCompactCell& c = chf.cells[x+y*w];
- lregs.resize(0);
+ lregs.clear();
for (int i = (int)c.index, ni = (int)(c.index+c.count); i < ni; ++i)
{
@@ -1139,7 +1139,7 @@ static bool mergeAndFilterLayerRegions(rcContext* ctx, int minRegionArea,
// Start search.
root.id = layerId;
- stack.resize(0);
+ stack.clear();
stack.push(i);
while (stack.size() > 0)