minotor 7.0.0 → 7.0.1

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.1](https://github.com/aubryio/minotor/compare/v7.0.0...v7.0.1) (2025-09-23)
 
 
-### Performance Improvements
+### Bug Fixes
 
-* 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.
+* address corner cases with boarding conditions ([#27](https://github.com/aubryio/minotor/issues/27)) ([cd5fe68](https://github.com/aubryio/minotor/commit/cd5fe682ca359872a6bac46dbdc30ec9d603c8ef))

package/dist/cli.mjs

@@ -17314,29 +17314,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;
+            }
+        }
+        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 earliestTripIndex;
+        return undefined;
     }
     /**
      * Retrieves the index of a stop within the route.
@@ -20801,7 +20807,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
@@ -20976,8 +20982,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 = {