TiagoRG
/
it2s-itss-facilities
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Remove unecessary DCM path intersect check var

This commit is contained in:
emanuel 2022-02-09 12:30:38 +00:00
parent c9819fbb4a
commit 13a3a7a943
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/dcm.c
View File

@ -10,7 +10,7 @@
#define SLEEP_TIME_MS 100
static int are_paths_intersecting(it2s_tender_st_s* tA, int tA_len, it2s_tender_st_s* tB, int tB_len, uint64_t now) {
static int are_paths_intersecting(it2s_tender_st_s* tA, int tA_len, it2s_tender_st_s* tB, int tB_len) {
// TODO check first time intersection, then the spacial trajectory
@ -32,7 +32,7 @@ static int are_paths_intersecting(it2s_tender_st_s* tA, int tA_len, it2s_tender_
if (it2s_tender_do_segments_intersect(A1, A2, B1, B2)) {
if (tA[a].timestamp < tB[b].timestamp + 2000 &&
tA[a].timestamp > tB[b].timestamp - 2000) {
syslog_info("[facilities] [dc] intersecting @ (%d, %d) in %ld ms", tA[a].latitude, tA[a].longitude, tA[a].timestamp-now);
syslog_info("[facilities] [dc] intersecting @ (%d, %d) in %ld ms", tA[a].latitude, tA[a].longitude, tA[a].timestamp-tA[0].timestamp);
return 1;
}
}
@ -81,7 +81,7 @@ int dcm_check(void* fc, DCM_t* dcm) {
}
if (trajectoryA_len > 1 && trajectoryB_len > 1) {
are_paths_intersecting(trajectoryA, trajectoryA_len, trajectoryB, trajectoryB_len, now);
are_paths_intersecting(trajectoryA, trajectoryA_len, trajectoryB, trajectoryB_len);
}
cleanup: