falso
/
dethrace
mirror of https://github.com/dethrace-labs/dethrace.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Use nearest_section in FindNearestGeneralSection (#162)

This commit is contained in:
Anonymous Maarten 2022-09-16 05:09:41 +02:00 committed by GitHub
parent 25ecaf7309
commit 4c6e3a325c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/DETHRACE/common/opponent.c
View File

@ -246,7 +246,7 @@ tS16 FindNearestGeneralSection(tCar_spec* pPursuee, br_vector3* pActor_coords, b
closest_distance_squared = BR_SCALAR_MAX;
nearest_node_distance_squared = BR_SCALAR_MAX;
if (pPursuee) {
if (pPursuee != NULL) {
no_sections = pPursuee->my_trail.number_of_nodes - 1;
} else {
no_sections = gProgram_state.AI_vehicles.number_of_path_sections;
@ -297,11 +297,11 @@ tS16 FindNearestGeneralSection(tCar_spec* pPursuee, br_vector3* pActor_coords, b
if (nearest_node_distance_squared > closest_distance_squared) {
nearest_node_section_no = nearest_section;
if (pPursuee != NULL) {
start = &pPursuee->my_trail.trail_nodes[section_no];
finish = &pPursuee->my_trail.trail_nodes[section_no + 1];
start = &pPursuee->my_trail.trail_nodes[nearest_section];
finish = &pPursuee->my_trail.trail_nodes[nearest_section + 1];
} else {
start = &gProgram_state.AI_vehicles.path_nodes[gProgram_state.AI_vehicles.path_sections[section_no].node_indices[0]].p;
finish = &gProgram_state.AI_vehicles.path_nodes[gProgram_state.AI_vehicles.path_sections[section_no].node_indices[1]].p;
start = &gProgram_state.AI_vehicles.path_nodes[gProgram_state.AI_vehicles.path_sections[nearest_section].node_indices[0]].p;
finish = &gProgram_state.AI_vehicles.path_nodes[gProgram_state.AI_vehicles.path_sections[nearest_section].node_indices[1]].p;
}
BrVector3Sub(&p, finish, start);
BrVector3NormaliseQuick(pPath_direction, &p);