mirror of
https://github.com/ParadiseSS13/Paradise.git
synced 2026-01-01 13:12:23 +00:00
ca93f6bc77
* Retrofit TG pathfinder with upstream improvements * i know how things work * don't use HAS_TRAIT for things that aren't traits * unique filenames * i'm just a goofy lil moron * use new block syntax * apparently values don't need clamping with new block syntax? * silence invalid JPS dest runtime * fix runtime passing ID instead of access list
26 lines
1.3 KiB
Plaintext
26 lines
1.3 KiB
Plaintext
// Define set that decides how an atom will be scanned for astar things
|
|
/// If set, we make the assumption that CanPathfindPass() will NEVER return FALSE unless density is true
|
|
#define CANPATHFINDPASS_DENSITY 0
|
|
/// If this is set, we bypass density checks and always call the proc
|
|
#define CANPATHFINDPASS_ALWAYS_PROC 1
|
|
|
|
/**
|
|
* A helper macro to see if it's possible to step from the first turf into the second one, minding things like door access and directional windows.
|
|
* If you really want to optimize things, optimize this, cuz this gets called a lot.
|
|
* We do early next.density check despite it being already checked in LinkBlockedWithAccess for short-circuit performance
|
|
*/
|
|
#define CAN_STEP(cur_turf, next, simulated_only, pass_info, avoid) (next && !next.density && !(simulated_only && SSpathfinder.space_type_cache[next.type]) && !cur_turf.LinkBlockedWithAccess(next, pass_info) && (next != avoid))
|
|
|
|
#define DIAGONAL_DO_NOTHING NONE
|
|
#define DIAGONAL_REMOVE_ALL 1
|
|
#define DIAGONAL_REMOVE_CLUNKY 2
|
|
|
|
// Set of delays for path_map reuse
|
|
// The longer you go, the higher the risk of invalid paths
|
|
#define MAP_REUSE_INSTANT (0)
|
|
#define MAP_REUSE_SNAPPY (0.5 SECONDS)
|
|
#define MAP_REUSE_FAST (2 SECONDS)
|
|
#define MAP_REUSE_SLOW (20 SECONDS)
|
|
// Longest delay, so any maps older then this will be discarded from the subsystem cache
|
|
#define MAP_REUSE_SLOWEST (60 SECONDS)
|