Version packages - #24
Merged
Merged
Conversation
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
1 participant
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.1
Patch Changes
28cd827: Return the journey the scan made. A journey could change trains at a station where another trip
happened to arrive first, with less than the station's interchange time, when the passenger had
really boarded that trip at an earlier call. The arrival times were right, the legs were not.
The scan now records the connection each trip is boarded from, and the connection index holds that
connection for each station rather than the last connection into it, so each entry is one leg. A trip
that can be boarded at more than one call is boarded where the passenger has taken the fewest legs to
reach, then at the latest call, so a passenger is not taken past a call of the trip only to ride back
through it. Reaching a station at the same time in fewer legs now replaces how it was reached, and
the footpaths from it are walked again. Where the trip before still passes a later call of the next
one in time to change there, the journey changes there.
ScanResults.setConnectionhas to followisReachablefor the same connection, as the scan does.