mirror/openmw
1
0
Fork 0
mirror of https://github.com/OpenMW/openmw.git synced 2025-01-30 23:15:39 +00:00
Code Issues Releases Wiki Activity

Fix findPath returning a raw vector

Browse source
This commit is contained in:
uramer 2024-11-30 09:32:05 +01:00
parent 064e3c7c2e
commit 1675c74036
4 changed files with 18 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

14
apps/openmw/mwlua/nearbybindings.cpp
View file

@ -227,7 +227,7 @@ namespace MWLua
| DetourNavigator::Flag_swim | DetourNavigator::Flag_openDoor | DetourNavigator::Flag_usePathgrid; | DetourNavigator::Flag_swim | DetourNavigator::Flag_openDoor | DetourNavigator::Flag_usePathgrid;
api["findPath"] api["findPath"]
= [](const osg::Vec3f& source, const osg::Vec3f& destination, const sol::optional<sol::table>& options) { = [lua](const osg::Vec3f& source, const osg::Vec3f& destination, const sol::optional<sol::table>& options) {
DetourNavigator::AgentBounds agentBounds = defaultAgentBounds; DetourNavigator::AgentBounds agentBounds = defaultAgentBounds;
DetourNavigator::Flags includeFlags = defaultIncludeFlags; DetourNavigator::Flags includeFlags = defaultIncludeFlags;
DetourNavigator::AreaCosts areaCosts{}; DetourNavigator::AreaCosts areaCosts{};
@ -259,13 +259,15 @@ namespace MWLua
destinationTolerance = *v; destinationTolerance = *v;
} }
std::vector<osg::Vec3f> result; std::vector<osg::Vec3f> path;
const DetourNavigator::Status status = DetourNavigator::findPath( const DetourNavigator::Status status
*MWBase::Environment::get().getWorld()->getNavigator(), agentBounds, source, destination, = DetourNavigator::findPath(*MWBase::Environment::get().getWorld()->getNavigator(), agentBounds,
includeFlags, areaCosts, destinationTolerance, std::back_inserter(result)); source, destination, includeFlags, areaCosts, destinationTolerance, std::back_inserter(path));
return std::make_tuple(status, std::move(result)); sol::table result(lua, sol::create);
LuaUtil::copyVectorToTable(path, result);
return std::make_tuple(status, result);
}; };
api["findRandomPointAroundCircle"] = [](const osg::Vec3f& position, float maxRadius, api["findRandomPointAroundCircle"] = [](const osg::Vec3f& position, float maxRadius,

6
components/lua/luastate.hpp
View file

@ -372,6 +372,12 @@ namespace LuaUtil
} }
sol::table getMutableFromReadOnly(const sol::userdata&); sol::table getMutableFromReadOnly(const sol::userdata&);
template <class T>
void copyVectorToTable(const std::vector<T>& v, sol::table& out)
{
for (const T& t : v)
out.add(t);
}
} }
#endif // COMPONENTS_LUA_LUASTATE_H #endif // COMPONENTS_LUA_LUASTATE_H

4
scripts/data/integration_tests/test_lua_api/player.lua
View file

@ -176,8 +176,8 @@ testing.registerLocalTest('findPath',
} }
local status, path = nearby.findPath(src, dst, options) local status, path = nearby.findPath(src, dst, options)
testing.expectEqual(status, nearby.FIND_PATH_STATUS.Success, 'Status') testing.expectEqual(status, nearby.FIND_PATH_STATUS.Success, 'Status')
testing.expectLessOrEqual((path[path:size()] - dst):length(), 1, testing.expectLessOrEqual((path[#path] - dst):length(), 1,
'Last path point ' .. testing.formatActualExpected(path[path:size()], dst)) 'Last path point ' .. testing.formatActualExpected(path[#path], dst))
end) end)
testing.registerLocalTest('findRandomPointAroundCircle', testing.registerLocalTest('findRandomPointAroundCircle',

4
scripts/data/morrowind_tests/player.lua
View file

@ -42,8 +42,8 @@ testing.registerLocalTest('Guard in Imperial Prison Ship should find path (#7241
} }
local status, path = nearby.findPath(src, dst, options) local status, path = nearby.findPath(src, dst, options)
testing.expectEqual(status, nearby.FIND_PATH_STATUS.Success, 'Status') testing.expectEqual(status, nearby.FIND_PATH_STATUS.Success, 'Status')
testing.expectLessOrEqual((util.vector2(path[path:size()].x, path[path:size()].y) - util.vector2(dst.x, dst.y)):length(), 1, 'Last path point x, y') testing.expectLessOrEqual((util.vector2(path[#path].x, path[#path]) - util.vector2(dst.x, dst.y)):length(), 1, 'Last path point x, y')
testing.expectLessOrEqual(path[path:size()].z - dst.z, 20, 'Last path point z') testing.expectLessOrEqual(path[#path].z - dst.z, 20, 'Last path point z')
if agentBounds.shapeType == nearby.COLLISION_SHAPE_TYPE.Aabb then if agentBounds.shapeType == nearby.COLLISION_SHAPE_TYPE.Aabb then
testing.expectThat(path, testing.elementsAreArray({ testing.expectThat(path, testing.elementsAreArray({
testing.closeToVector(util.vector3(34.29737091064453125, 806.3817138671875, 112.76610565185546875), 1e-1), testing.closeToVector(util.vector3(34.29737091064453125, 806.3817138671875, 112.76610565185546875), 1e-1),