Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

core: stdcm: limit the loop where we look for possible delays #10126

Merged
merged 1 commit into from
Dec 19, 2024

Conversation

eckter
Copy link
Contributor

@eckter eckter commented Dec 18, 2024

We would keep looking for different "openings" even very far in the future. This limits both conflict detection calls and the early steps of edge building.

The speedup is actually really good (roughly dividing the computation time by 2).

In the previous version, we would do something like that: we look for "openings" infinitely far in the future, and it's only when checking for conflicts and engineering allowances that we would discard them. In this case (and in fact in most case), there's only one "opening" available without clear conflicts.

image

@eckter eckter requested a review from Erashin December 18, 2024 15:30
@eckter eckter requested a review from a team as a code owner December 18, 2024 15:30
@github-actions github-actions bot added the area:core Work on Core Service label Dec 18, 2024
@eckter eckter force-pushed the ech/limit-delays-loop branch 2 times, most recently from a1e4640 to dacfa1e Compare December 18, 2024 15:32
@codecov-commenter
Copy link

codecov-commenter commented Dec 18, 2024

⚠️ Please install the 'codecov app svg image' to ensure uploads and comments are reliably processed by Codecov.

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 79.82%. Comparing base (5d127e0) to head (4820803).
Report is 32 commits behind head on dev.

❗ Your organization needs to install the Codecov GitHub app to enable full functionality.

Additional details and impacted files
@@            Coverage Diff             @@
##              dev   #10126      +/-   ##
==========================================
+ Coverage   79.81%   79.82%   +0.01%     
==========================================
  Files        1052     1054       +2     
  Lines      105444   105547     +103     
  Branches      727      726       -1     
==========================================
+ Hits        84155    84252      +97     
- Misses      21247    21253       +6     
  Partials       42       42              
Flag Coverage Δ
editoast 73.72% <ø> (-0.02%) ⬇️
front 89.14% <ø> (+0.01%) ⬆️
gateway 2.18% <ø> (ø)
osrdyne 3.28% <ø> (ø)
railjson_generator 87.50% <ø> (ø)
tests 87.00% <ø> (ø)

Flags with carried forward coverage won't be shown. Click here to find out more.

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@eckter eckter force-pushed the ech/limit-delays-loop branch from dacfa1e to b53af39 Compare December 18, 2024 15:53
@eckter eckter marked this pull request as draft December 18, 2024 15:53
@eckter eckter force-pushed the ech/limit-delays-loop branch from b53af39 to 8a3622d Compare December 19, 2024 09:45
We would keep looking for different "openings" even very far in the
future. This limits both conflict detection calls and the early steps of
edge building.

Signed-off-by: Eloi Charpentier <eloi.charpentier.42@gmail.com>
@eckter eckter force-pushed the ech/limit-delays-loop branch from 8a3622d to 4820803 Compare December 19, 2024 13:48
@eckter eckter marked this pull request as ready for review December 19, 2024 14:03
@eckter eckter self-assigned this Dec 19, 2024
@eckter eckter added this pull request to the merge queue Dec 19, 2024
Merged via the queue into dev with commit 4c50272 Dec 19, 2024
27 checks passed
@eckter eckter deleted the ech/limit-delays-loop branch December 19, 2024 18:22
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
area:core Work on Core Service
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants