TOF: pre-filter hypotheses in getStartTimeInSet#15442
Merged
Merged
Conversation
combinatorial search The |starttime - refT0| < 2000 ps cut depends only on (track, hypothesis), not on other tracks' assignments. Evaluate it once per track upfront and enumerate only valid hypothesis combinations, reducing the search space from 3^N to ∏(nValid_i).
ktf
changed the title
Member
Author
|
@noferini could you have a look? |
noferini
approved these changes
May 28, 2026
Collaborator
noferini
left a comment
noferini
left a comment
There was a problem hiding this comment.
It makes sense. Approving
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
2 participants
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.
Reduces combinatorial search.
The |starttime - refT0| < 2000 ps cut depends only on (track, hypothesis), not on other tracks' assignments.
Evaluate it once per track upfront and enumerate only valid hypothesis combinations, reducing the search space from 3^N to ∏(nValid_i).