hiposfer.kamal.router.util.fastq — hiposfer/kamal 0.20.2

namespace for hand-optimized queries that are used inside the routing algorithm and need to run extremely fast (< 1 ms per query)

By convention all queries here return Entities

cache-stop-successors clj

(cache-stop-successors network)

computes the next-stops for each stop and returns a transaction that will cache those results inside the :stop entities

continue-trip clj

(continue-trip network previous ?dst-id)

given the previous(ly) found result through (find-trips ...) compute the cost of reaching ?dst-id

day-trips clj

(day-trips network date)

returns a set of stop_times entity ids that are available for date

find-trip clj

(find-trip network trips ?src-id ?dst-id now)

Returns a map with {:value :stop_times/wait :stop_times/to} and maybe {:frequency/cycle :frequency/entity} on a frequency match.

To find a matching trip, we search among repetitive trips (frequencies.txt) and exact time trips (stop_times.txt). The closest departing trip to now is chosen.

Returns nil if no trip was found

link-stops clj

(link-stops network)

takes a network, looks up the nearest node for each stop and returns a transaction that will link those

nearest-nodes clj

(nearest-nodes network point)

returns the nearest node/location to point

references clj

(references network attribute target-id)

returns all entities that reference/point to target-id through attribute