Version packages - #22
Merged
Merged
Conversation
github-actions
Bot
force-pushed
the
changeset-release/master
branch
from
September 13, 2026 19:24
d09f0c0 to
773fb4a
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR was opened by the Changesets release GitHub action. When you're ready to do a release, you can merge this and the packages will be published to npm automatically. If you're not ready to do a release yet, that's fine, whenever you add more changesets to master, this PR will be updated.
Releases
connection-scan-algorithm@3.0.0
Major Changes
c03d451: Scan connections held as arrays of numbers, 30 to 90 times faster.
The algorithm and its classes are as they were:
toGtfsData,ConnectionScanAlgorithmaskingScanResultswhether each connection is reachable and better, andJourneyFactorybuilding legsfrom the connection index. What they read changes. Stations are numbered, connections are parallel
typed arrays sorted by arrival rather than an object each,
ScanResultsholds arrays indexed bystation, and a connection or footpath is its index. A scan starts at the first connection arriving
after the departure time rather than at midnight, stops once every destination has been reached,
and whether each trip runs is worked out once per date by a
TripCalendar.Over the GB rail feed, planning Tuesday 15 September, across repeated runs: 32 standard queries (the
24 of
npm run perfand eight more) take 3.1-3.5ms each on average rather than 115-117ms, 268journeys through couplings 1.7ms rather than 130ms, and 400 random station pairs 4.4-5.3ms rather
than 170-174ms. Building takes 305-360ms rather than 570-630ms, and holds 83MB rather than 195MB. All
1,100 answers are the same journeys 2.0.0 returns, trip for trip.
DepartAfterQuery,loadGtfsandtoGtfsDataare called as before. What changes:new ConnectionScanAlgorithm(gtfs, new ScanResultsFactory(gtfs))andnew JourneyFactory(gtfs)GtfsDataholdsConnectionsandTransfersas arrays, anInt32Arrayof interchange times, aTripCalendar, thetripsand astopTablenumbering the stationsscanreturns aConnectionIndexofInt32Array, and aConnectionis a number:TimetableConnectionand
TransfersByOriginare gone, andisTransferchecks a leg whileisTransferConnectionchecksa connection