minotor 7.0.0 → 7.0.2

package/CHANGELOG.md

@@ -1,11 +1,6 @@
-# [7.0.0](https://github.com/aubryio/minotor/compare/v6.0.0...v7.0.0) (2025-09-19)
+## [7.0.2](https://github.com/aubryio/minotor/compare/v7.0.1...v7.0.2) (2025-09-23)
 
 
 ### Performance Improvements
 
-* optimize loops on the critical path ([#26](https://github.com/aubryio/minotor/issues/26)) ([8504930](https://github.com/aubryio/minotor/commit/85049308f7bbcf4d88f3dcfb47edd2511e9da80d))
-
-
-### BREAKING CHANGES
-
-* Timetable binary format was updated and is not compatible with the old one.
+* minor perf improvements ([#28](https://github.com/aubryio/minotor/issues/28)) ([8bd3150](https://github.com/aubryio/minotor/commit/8bd3150669c6d7abee2f2c5759fb0946f3cb509f))

package/dist/cli.mjs

@@ -30,18 +30,6 @@ PERFORMANCE OF THIS SOFTWARE.
 /* global Reflect, Promise, SuppressedError, Symbol, Iterator */
 
 
-function __rest(s, e) {
-    var t = {};
-    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
-        t[p] = s[p];
-    if (s != null && typeof Object.getOwnPropertySymbols === "function")
-        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
-            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
-                t[p[i]] = s[p[i]];
-        }
-    return t;
-}
-
 function __awaiter(thisArg, _arguments, P, generator) {
     function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
     return new (P || (P = Promise))(function (resolve, reject) {
@@ -17094,9 +17082,16 @@ class Time {
         if (times.length === 0) {
             throw new Error('At least one Time instance is required.');
         }
-        return times.reduce((maxTime, currentTime) => {
-            return currentTime.isAfter(maxTime) ? currentTime : maxTime;
-        });
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        let maxTime = times[0];
+        for (let i = 1; i < times.length; i++) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            if (times[i].minutesSinceMidnight > maxTime.minutesSinceMidnight) {
+                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                maxTime = times[i];
+            }
+        }
+        return maxTime;
     }
     /**
      * Computes the minimum Time instance among the provided Time instances.
@@ -17108,9 +17103,16 @@ class Time {
         if (times.length === 0) {
             throw new Error('At least one Time instance is required.');
         }
-        return times.reduce((minTime, currentTime) => {
-            return currentTime.isBefore(minTime) ? currentTime : minTime;
-        });
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        let minTime = times[0];
+        for (let i = 1; i < times.length; i++) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            if (times[i].minutesSinceMidnight < minTime.minutesSinceMidnight) {
+                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                minTime = times[i];
+            }
+        }
+        return minTime;
     }
     /**
      * Determines if the current Time instance is after another Time instance.
@@ -17119,7 +17121,7 @@ class Time {
      * @returns True if the current Time instance is after the other Time instance, otherwise false.
      */
     isAfter(otherTime) {
-        return this.minutesSinceMidnight > otherTime.toMinutes();
+        return this.minutesSinceMidnight > otherTime.minutesSinceMidnight;
     }
     /**
      * Determines if the current Time instance is before another Time instance.
@@ -17128,7 +17130,7 @@ class Time {
      * @returns True if the current Time instance is before the other Time instance, otherwise false.
      */
     isBefore(otherTime) {
-        return this.minutesSinceMidnight < otherTime.toMinutes();
+        return this.minutesSinceMidnight < otherTime.minutesSinceMidnight;
     }
     /**
      * Determines if the current Time instance is equal to another Time instance.
@@ -17137,7 +17139,7 @@ class Time {
      * @returns True if the current Time instance is equal to the other Time instance, otherwise false.
      */
     equals(otherTime) {
-        return this.minutesSinceMidnight === otherTime.toMinutes();
+        return this.minutesSinceMidnight === otherTime.minutesSinceMidnight;
     }
 }
 
@@ -17314,29 +17316,35 @@ let Route$1 = class Route {
      * @returns The index of the earliest trip meeting the criteria, or undefined if no such trip is found.
      */
     findEarliestTrip(stopId, after = Time.origin(), beforeTrip) {
-        const maxTripIndex = beforeTrip !== undefined
-            ? Math.min(beforeTrip - 1, this.nbTrips - 1)
-            : this.nbTrips - 1;
-        if (maxTripIndex < 0) {
+        if (this.nbTrips <= 0)
             return undefined;
-        }
-        let earliestTripIndex;
-        let lowTrip = 0;
-        let highTrip = maxTripIndex;
-        while (lowTrip <= highTrip) {
-            const midTrip = Math.floor((lowTrip + highTrip) / 2);
-            const departure = this.departureFrom(stopId, midTrip);
-            const pickUpType = this.pickUpTypeFrom(stopId, midTrip);
-            if ((departure.isAfter(after) || departure.equals(after)) &&
-                pickUpType !== 'NOT_AVAILABLE') {
-                earliestTripIndex = midTrip;
-                highTrip = midTrip - 1;
+        let hi = this.nbTrips - 1;
+        if (beforeTrip !== undefined)
+            hi = Math.min(hi, beforeTrip - 1);
+        if (hi < 0)
+            return undefined;
+        let lo = 0;
+        let lb = -1;
+        while (lo <= hi) {
+            const mid = (lo + hi) >>> 1;
+            const depMid = this.departureFrom(stopId, mid);
+            if (depMid.isBefore(after)) {
+                lo = mid + 1;
             }
             else {
-                lowTrip = midTrip + 1;
+                lb = mid;
+                hi = mid - 1;
             }
         }
-        return earliestTripIndex;
+        if (lb === -1)
+            return undefined;
+        for (let t = lb; t < (beforeTrip !== null && beforeTrip !== void 0 ? beforeTrip : this.nbTrips); t++) {
+            const pickup = this.pickUpTypeFrom(stopId, t);
+            if (pickup !== 'NOT_AVAILABLE') {
+                return t;
+            }
+        }
+        return undefined;
     }
     /**
      * Retrieves the index of a stop within the route.
@@ -17571,6 +17579,7 @@ const serializeRouteType = (type) => {
     }
 };
 
+/* eslint-disable @typescript-eslint/no-non-null-assertion */
 const ALL_TRANSPORT_MODES = new Set([
     'TRAM',
     'SUBWAY',
@@ -17675,9 +17684,7 @@ class Timetable {
         if (!serviceRoute) {
             throw new Error(`Service route not found for route ID: ${route.serviceRoute()}`);
         }
-        // eslint-disable-next-line @typescript-eslint/no-unused-vars
-        const { routes } = serviceRoute, serviceRouteInfo = __rest(serviceRoute, ["routes"]);
-        return serviceRouteInfo;
+        return { type: serviceRoute.type, name: serviceRoute.name };
     }
     /**
      * Finds all routes passing through a stop.
@@ -20801,7 +20808,7 @@ class Result {
 
 const UNREACHED = Time.infinity();
 /**
- * A public transportation network router utilizing the RAPTOR algorithm for
+ * A public transportation network router implementing the RAPTOR algorithm for
  * efficient journey planning and routing. For more information on the RAPTOR
  * algorithm, refer to its detailed explanation in the research paper:
  * https://www.microsoft.com/en-us/research/wp-content/uploads/2012/01/raptor_alenex.pdf
@@ -20933,6 +20940,7 @@ class Router {
             // together with corresponding hop on stop index (earliest marked stop)
             const reachableRoutes = this.timetable.findReachableRoutes(markedStops, options.transportModes);
             markedStops.clear();
+            const earliestArrivalAtAnyDestination = this.earliestArrivalAtAnyStop(earliestArrivals, destinations);
             // for each route that can be reached with at least round - 1 trips
             const reachableRoutesArray = Array.from(reachableRoutes.entries());
             for (let i = 0; i < reachableRoutesArray.length; i++) {
@@ -20949,7 +20957,7 @@ class Router {
                         const earliestArrivalAtCurrentStop = (_b = (_a = earliestArrivals.get(currentStop)) === null || _a === void 0 ? void 0 : _a.arrival) !== null && _b !== void 0 ? _b : UNREACHED;
                         if (currentDropOffType !== 'NOT_AVAILABLE' &&
                             currentArrivalTime.isBefore(earliestArrivalAtCurrentStop) &&
-                            currentArrivalTime.isBefore(this.earliestArrivalAtAnyStop(earliestArrivals, destinations))) {
+                            currentArrivalTime.isBefore(earliestArrivalAtAnyDestination)) {
                             const bestHopOnDepartureTime = route.departureFrom(currentTrip.bestHopOnStop, currentTrip.tripIndex);
                             arrivalsAtCurrentRound.set(currentStop, {
                                 arrival: currentArrivalTime,
@@ -20976,8 +20984,8 @@ class Router {
                     const earliestArrivalOnPreviousRound = (_c = arrivalsAtPreviousRound.get(currentStop)) === null || _c === void 0 ? void 0 : _c.arrival;
                     if (earliestArrivalOnPreviousRound !== undefined &&
                         (currentTrip === undefined ||
-                            earliestArrivalOnPreviousRound.isBefore(route.arrivalAt(currentStop, currentTrip.tripIndex)) ||
-                            earliestArrivalOnPreviousRound.equals(route.arrivalAt(currentStop, currentTrip.tripIndex)))) {
+                            earliestArrivalOnPreviousRound.isBefore(route.departureFrom(currentStop, currentTrip.tripIndex)) ||
+                            earliestArrivalOnPreviousRound.equals(route.departureFrom(currentStop, currentTrip.tripIndex)))) {
                         const earliestTrip = route.findEarliestTrip(currentStop, earliestArrivalOnPreviousRound, currentTrip === null || currentTrip === void 0 ? void 0 : currentTrip.tripIndex);
                         if (earliestTrip !== undefined) {
                             currentTrip = {