feat: People go walkies

This commit is contained in:
2025-10-05 16:49:18 +01:00
parent 394366480b
commit 222575b318
7 changed files with 58 additions and 23 deletions

View File

@@ -8,7 +8,7 @@
typedef struct navSearchNodeState navSearchNodeState;
struct navSearchNodeState{
bool visited;
U64 distance;
F64 distance;
U32 shortest;
bool addedToUnvisited;
};
@@ -53,6 +53,12 @@ U32 getLowestState(U32 unfinishedIndexes[128], U32 unfinishedCount, navSearchSta
// Generate a path to follow between the start and end node.
NavPath Nav_Path(NavMesh *mesh, U32 start, U32 end) {
// This is a stupid fix, since it's easier to work backwards
// to generate a path, I'm swapping the start / end, to generate
// it backwards
U32 tmp = end;
end = start;
start = tmp;
navSearchState state = initState(start, mesh->nodeCount);
U32 unfinishedCount = 1;
U32 unfinishedIndexes[NAV_MAX_NODES] = {start};
@@ -68,9 +74,9 @@ NavPath Nav_Path(NavMesh *mesh, U32 start, U32 end) {
NavConnection *connection = &mesh->nodes[lowestNodeIndex].connections[connectionI];
navSearchNodeState *testNode = &state.nodeStates[connection->NodeIndex];
if(testNode->visited) {continue;}
U32 distance = cast(U32) (state.nodeStates[lowestNodeIndex].distance + connection->Cost);
distance += cast(U32) (mesh->nodes[end].pos.x - mesh->nodes[connection->NodeIndex].pos.x);
distance += cast(U32) (mesh->nodes[end].pos.y - mesh->nodes[connection->NodeIndex].pos.y);
F64 distance = cast(F64) (state.nodeStates[lowestNodeIndex].distance + connection->Cost);
distance += cast(F64) Abs((mesh->nodes[end].pos.x - mesh->nodes[connection->NodeIndex].pos.x));
distance += cast(F64) Abs((mesh->nodes[end].pos.y - mesh->nodes[connection->NodeIndex].pos.y));
if(testNode->distance > distance) {
testNode->distance = distance;
testNode->shortest = lowestNodeIndex;

View File

@@ -13,7 +13,7 @@ void updateNPC(F32 delta, NPC *npc, World *world) {
npc->mode = NPC_ACTION_WALKING;
// TODO change targets to poi's rather than just random nodes
npc->targetNavNode = Random_U32(&world->random, 0, world->navMesh->nodeCount);
printf("Starting to nav path\n");
printf("Starting to nav path from %d to %d\n", npc->currentNavNode, npc->targetNavNode);
npc->path = Nav_Path(world->navMesh, npc->currentNavNode, npc->targetNavNode);
printf("done\n");
npc->walkTimer = 0;
@@ -29,14 +29,15 @@ void updateNPC(F32 delta, NPC *npc, World *world) {
npc->mode = NPC_ACTION_WAITING;
npc->maxWaitTime = Random_F32(&world->random, 10, 40);
npc->waitTime = 0;
npc->currentNavNode = npc->targetNavNode;
npc->pathIndex = 0;
return;
}
npc->pathIndex+=1;
npc->currentNavNode = npc->path.indexes[npc->pathIndex];
npc->pathIndex+=1;
}
NavNode cNav = world->navMesh->nodes[npc->currentNavNode];
NavNode tNav = world->navMesh->nodes[npc->pathIndex];
NavNode tNav = world->navMesh->nodes[npc->path.indexes[npc->pathIndex]];
npc->collision.pos.x = cNav.pos.x * (1 - npc->walkTimer/NPC_SPEED) + tNav.pos.x * npc->walkTimer/NPC_SPEED;
npc->collision.pos.y = cNav.pos.y * (1 - npc->walkTimer/NPC_SPEED) + tNav.pos.y * npc->walkTimer/NPC_SPEED;
break;

View File

@@ -16,3 +16,9 @@ void UpdateNPCs(F32 delta, World *world) {
void ProcessEvents(SDL_Event *event, World *world) {
PlayerUpdate(event, &world->player);
}
void RenderWorld(World *world, D_Context *draw) {
for(int i = 0; i < world->npcCount; i++) {
D_Rect(draw, world->npcs[i].collision.pos.x, world->npcs[i].collision.pos.y, .texture = 1);
}
}

View File

@@ -5,7 +5,7 @@
#include "npc_look.h"
#include "../core/types.h"
#define NPC_SPEED 0.2f
#define NPC_SPEED 1.0f
typedef enum NPC_ACTION NPC_ACTION;
enum NPC_ACTION {

View File

@@ -35,6 +35,7 @@ struct World {
};
function void UpdateWorld(F32 delta, World *world);
function void RenderWorld(World *world, D_Context *drawContext );
function void ProcessEvents(SDL_Event *event, World *world);
function void UpdateNPCs(F32 delta, World *world);
function void updateNPC(F32 delta, NPC *npc, World *world);