minotor 6.0.0 → 7.0.1

package/CHANGELOG.md

@@ -1,11 +1,6 @@
-# [6.0.0](https://github.com/aubryio/minotor/compare/v5.0.1...v6.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
 
-* use arrays instead of maps for stops adjacency and service routes ([#25](https://github.com/aubryio/minotor/issues/25)) ([c803b4d](https://github.com/aubryio/minotor/commit/c803b4d60d7a421b889938d88fc6f316ae43de2f))
-
-
-### BREAKING CHANGES
-
-* Stops and timetable binary format was updated and is not compatible with the old ones.
+* 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

@@ -16079,20 +16079,15 @@ const serializeLocationType = (locationType) => {
  */
 class StopsIndex {
     constructor(stops) {
+        var _a;
         this.stops = stops;
         this.sourceStopsMap = new Map();
-        stops.forEach((stop, id) => {
-            this.sourceStopsMap.set(stop.sourceStopId, id);
-        });
-        this.textIndex = lt({
-            fields: ['name'],
-            storeFields: ['id'],
-            searchOptions: { prefix: true, fuzzy: 0.2 },
-            processTerm: generateAccentVariants,
-        });
         const stopsSet = new Map();
-        stops.forEach((stop, id) => {
-            var _a;
+        this.stopPoints = [];
+        for (let id = 0; id < stops.length; id++) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            const stop = stops[id];
+            this.sourceStopsMap.set(stop.sourceStopId, id);
             const effectiveStopId = (_a = stop.parent) !== null && _a !== void 0 ? _a : id;
             if (!stopsSet.has(effectiveStopId)) {
                 stopsSet.set(effectiveStopId, {
@@ -16101,22 +16096,26 @@ class StopsIndex {
                     name: stop.parent ? this.stops[stop.parent].name : stop.name,
                 });
             }
+            if (stop.lat && stop.lon) {
+                this.stopPoints.push({
+                    id: id,
+                    lat: stop.lat,
+                    lon: stop.lon,
+                });
+            }
+        }
+        this.textIndex = lt({
+            fields: ['name'],
+            storeFields: ['id'],
+            searchOptions: { prefix: true, fuzzy: 0.2 },
+            processTerm: generateAccentVariants,
         });
         const stopsArray = Array.from(stopsSet.values());
         q(this.textIndex, stopsArray);
-        this.stopPoints = this.stops
-            .filter((stop) => {
-            if (stop.lat && stop.lon)
-                return true;
-            return false;
-        })
-            .map((stop, id) => ({
-            id: id,
-            lat: stop.lat,
-            lon: stop.lon,
-        }));
         this.geoIndex = new KDBush(this.stopPoints.length);
-        for (const { lat, lon } of this.stopPoints) {
+        for (let i = 0; i < this.stopPoints.length; i++) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            const { lat, lon } = this.stopPoints[i];
             this.geoIndex.add(lon, lat);
         }
         this.geoIndex.finish();
@@ -16629,7 +16628,7 @@ const StopAdjacency = {
         }
         writer.uint32(18).fork();
         for (const v of message.routes) {
-            writer.int32(v);
+            writer.uint32(v);
         }
         writer.join();
         return writer;
@@ -16650,13 +16649,13 @@ const StopAdjacency = {
                 }
                 case 2: {
                     if (tag === 16) {
-                        message.routes.push(reader.int32());
+                        message.routes.push(reader.uint32());
                         continue;
                     }
                     if (tag === 18) {
                         const end2 = reader.uint32() + reader.pos;
                         while (reader.pos < end2) {
-                            message.routes.push(reader.int32());
+                            message.routes.push(reader.uint32());
                         }
                         continue;
                     }
@@ -16713,7 +16712,7 @@ const ServiceRoute = {
         }
         writer.uint32(26).fork();
         for (const v of message.routes) {
-            writer.int32(v);
+            writer.uint32(v);
         }
         writer.join();
         return writer;
@@ -16741,13 +16740,13 @@ const ServiceRoute = {
                 }
                 case 3: {
                     if (tag === 24) {
-                        message.routes.push(reader.int32());
+                        message.routes.push(reader.uint32());
                         continue;
                     }
                     if (tag === 26) {
                         const end2 = reader.uint32() + reader.pos;
                         while (reader.pos < end2) {
-                            message.routes.push(reader.int32());
+                            message.routes.push(reader.uint32());
                         }
                         continue;
                     }
@@ -17302,27 +17301,6 @@ let Route$1 = class Route {
             : byte & 0x03; // Lower 2 bits for first pair
         return toPickupDropOffType(dropOffValue);
     }
-    /**
-     * Iterates over the stops in the route, starting from an optional specified stop.
-     * If no start stop is provided, the iteration begins from the first stop in the route.
-     *
-     * @param [startStopId] - (Optional) The StopId of the stop to start the iteration from.
-     * @returns An IterableIterator of StopIds, starting from the specified stop or the first stop.
-     * @throws An error if the specified start stop is not found in the route.
-     */
-    stopsIterator(startStopId) {
-        const startIndex = startStopId !== undefined ? this.stopIndices.get(startStopId) : 0;
-        if (startIndex === undefined) {
-            throw new Error(`Start stop ${startStopId} not found in route ${this.serviceRouteId}`);
-        }
-        function* generator(stops, startIndex) {
-            for (let i = startIndex; i < stops.length; i++) {
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-                yield stops[i];
-            }
-        }
-        return generator(this.stops, startIndex);
-    }
     /**
      * Finds the earliest trip that can be taken from a specific stop on a given route,
      * optionally constrained by a latest trip index and a time before which the trip
@@ -17336,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;
             }
         }
-        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.
@@ -17472,31 +17456,48 @@ const serializeServiceRoutesMap = (serviceRoutes) => {
     });
 };
 const deserializeStopsAdjacency = (protoStopsAdjacency) => {
-    return protoStopsAdjacency.map((value) => {
-        return {
-            transfers: value.transfers.map((transfer) => (Object.assign({ destination: transfer.destination, type: parseTransferType(transfer.type) }, (transfer.minTransferTime !== undefined && {
+    const result = [];
+    for (let i = 0; i < protoStopsAdjacency.length; i++) {
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        const value = protoStopsAdjacency[i];
+        const transfers = [];
+        for (let j = 0; j < value.transfers.length; j++) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            const transfer = value.transfers[j];
+            const newTransfer = Object.assign({ destination: transfer.destination, type: parseTransferType(transfer.type) }, (transfer.minTransferTime !== undefined && {
                 minTransferTime: Duration.fromSeconds(transfer.minTransferTime),
-            })))),
+            }));
+            transfers.push(newTransfer);
+        }
+        result.push({
+            transfers: transfers,
             routes: value.routes,
-        };
-    });
+        });
+    }
+    return result;
 };
 const deserializeRoutesAdjacency = (protoRoutesAdjacency) => {
     const routesAdjacency = [];
-    protoRoutesAdjacency.forEach((value) => {
+    for (let i = 0; i < protoRoutesAdjacency.length; i++) {
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        const value = protoRoutesAdjacency[i];
         const stops = bytesToUint32Array(value.stops);
         routesAdjacency.push(new Route$1(bytesToUint16Array(value.stopTimes), value.pickUpDropOffTypes, stops, value.serviceRouteId));
-    });
+    }
     return routesAdjacency;
 };
 const deserializeServiceRoutesMap = (protoServiceRoutes) => {
-    return protoServiceRoutes.map((value) => {
-        return {
+    const result = [];
+    for (let i = 0; i < protoServiceRoutes.length; i++) {
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        const value = protoServiceRoutes[i];
+        result.push({
             type: parseRouteType(value.type),
             name: value.name,
             routes: value.routes,
-        };
-    });
+        });
+    }
+    return result;
 };
 const parseTransferType = (type) => {
     switch (type) {
@@ -17588,7 +17589,7 @@ const ALL_TRANSPORT_MODES = new Set([
     'TROLLEYBUS',
     'MONORAIL',
 ]);
-const CURRENT_VERSION = '0.0.6';
+const CURRENT_VERSION = '0.0.7';
 /**
  * The internal transit timetable format.
  */
@@ -17696,7 +17697,8 @@ class Timetable {
             return [];
         }
         const routes = [];
-        for (const routeId of stopData.routes) {
+        for (let i = 0; i < stopData.routes.length; i++) {
+            const routeId = stopData.routes[i];
             const route = this.routesAdjacency[routeId];
             if (route) {
                 routes.push(route);
@@ -17715,12 +17717,15 @@ class Timetable {
      */
     findReachableRoutes(fromStops, transportModes = ALL_TRANSPORT_MODES) {
         const reachableRoutes = new Map();
-        for (const originStop of fromStops) {
+        const fromStopsArray = Array.from(fromStops);
+        for (let i = 0; i < fromStopsArray.length; i++) {
+            const originStop = fromStopsArray[i];
             const validRoutes = this.routesPassingThrough(originStop).filter((route) => {
                 const serviceRoute = this.getServiceRouteInfo(route);
                 return transportModes.has(serviceRoute.type);
             });
-            for (const route of validRoutes) {
+            for (let j = 0; j < validRoutes.length; j++) {
+                const route = validRoutes[j];
                 const hopOnStop = reachableRoutes.get(route);
                 if (hopOnStop) {
                     if (route.isBefore(originStop, hopOnStop)) {
@@ -20135,8 +20140,12 @@ const buildStopsAdjacencyStructure = (serviceRoutes, routes, transfersMap, nbSto
     for (let i = 0; i < nbStops; i++) {
         stopsAdjacency[i] = { routes: [], transfers: [] };
     }
-    routes.forEach((route, index) => {
-        for (const stop of route.stopsIterator()) {
+    for (let index = 0; index < routes.length; index++) {
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        const route = routes[index];
+        for (let j = 0; j < route.getNbStops(); j++) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            const stop = route.stops[j];
             if (activeStops.has(stop)) {
                 // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
                 stopsAdjacency[stop].routes.push(index);
@@ -20147,9 +20156,11 @@ const buildStopsAdjacencyStructure = (serviceRoutes, routes, transfersMap, nbSto
             throw new Error(`Service route ${route.serviceRoute()} not found for route ${index}.`);
         }
         serviceRoute.routes.push(index);
-    });
+    }
     for (const [stop, transfers] of transfersMap) {
-        for (const transfer of transfers) {
+        for (let i = 0; i < transfers.length; i++) {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            const transfer = transfers[i];
             if (activeStops.has(stop) || activeStops.has(transfer.destination)) {
                 // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
                 stopsAdjacency[stop].transfers.push(transfer);
@@ -20796,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
@@ -20815,7 +20826,9 @@ class Router {
         var _a, _b;
         const { options } = query;
         const newlyMarkedStops = new Set();
-        for (const stop of markedStops) {
+        const markedStopsArray = Array.from(markedStops);
+        for (let i = 0; i < markedStopsArray.length; i++) {
+            const stop = markedStopsArray[i];
             const currentArrival = arrivalsAtCurrentRound.get(stop);
             if (!currentArrival)
                 continue;
@@ -20824,7 +20837,9 @@ class Router {
             if (previousLeg && !('route' in previousLeg)) {
                 continue;
             }
-            for (const transfer of this.timetable.getTransfers(stop)) {
+            const transfers = this.timetable.getTransfers(stop);
+            for (let j = 0; j < transfers.length; j++) {
+                const transfer = transfers[j];
                 let transferTime;
                 if (transfer.minTransferTime) {
                     transferTime = transfer.minTransferTime;
@@ -20859,7 +20874,9 @@ class Router {
                 }
             }
         }
-        for (const newStop of newlyMarkedStops) {
+        const newlyMarkedStopsArray = Array.from(newlyMarkedStops);
+        for (let i = 0; i < newlyMarkedStopsArray.length; i++) {
+            const newStop = newlyMarkedStopsArray[i];
             markedStops.add(newStop);
         }
     }
@@ -20873,7 +20890,8 @@ class Router {
     earliestArrivalAtAnyStop(earliestArrivals, destinations) {
         var _a, _b;
         let earliestArrivalAtAnyDestination = UNREACHED;
-        for (const destination of destinations) {
+        for (let i = 0; i < destinations.length; i++) {
+            const destination = destinations[i];
             const arrival = (_b = (_a = earliestArrivals.get(destination.id)) === null || _a === void 0 ? void 0 : _a.arrival) !== null && _b !== void 0 ? _b : UNREACHED;
             earliestArrivalAtAnyDestination = Time.min(earliestArrivalAtAnyDestination, arrival);
         }
@@ -20897,7 +20915,8 @@ class Router {
         const earliestArrivalsPerRound = [earliestArrivalsWithoutAnyLeg];
         // Stops that have been improved at round k-1
         const markedStops = new Set();
-        for (const originStop of origins) {
+        for (let i = 0; i < origins.length; i++) {
+            const originStop = origins[i];
             markedStops.add(originStop.id);
             earliestArrivals.set(originStop.id, {
                 arrival: departureTime,
@@ -20921,9 +20940,13 @@ class Router {
             const reachableRoutes = this.timetable.findReachableRoutes(markedStops, options.transportModes);
             markedStops.clear();
             // for each route that can be reached with at least round - 1 trips
-            for (const [route, hopOnStop] of reachableRoutes.entries()) {
+            const reachableRoutesArray = Array.from(reachableRoutes.entries());
+            for (let i = 0; i < reachableRoutesArray.length; i++) {
+                const [route, hopOnStop] = reachableRoutesArray[i];
                 let currentTrip = undefined;
-                for (const currentStop of route.stopsIterator(hopOnStop)) {
+                const startIndex = route.stopIndex(hopOnStop);
+                for (let j = startIndex; j < route.getNbStops(); j++) {
+                    const currentStop = route.stops[j];
                     // If we're currently on a trip,
                     // check if arrival at the stop improves the earliest arrival time
                     if (currentTrip !== undefined) {
@@ -20959,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 = {