🕳️ handle gaps in x #20
Merged
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.
The current implementation crashed when there are gaps in the
x
(i.e., an equidistant x-bin that does not contain any datapoints).To overcome this issue we now handle gaps
-> the output type of the Iterator is thus now
Option<(usize, usize)>
M4
andMinMax
generic code we check if the bin_size is <= 4 for M4 and 2 for minmax and then add all the indices-> the othter case is the default implementation (as was before)
Code updates:
TODO:
Benches on the
gaps
branch ⬇️Benches on the
main
branch ⬇️=> no real statistical differences :)
Some remarks 🤔
➡️ The most beautiful & flexible code update would be to alter the
get_equidistant_bins
to not return an (start, end) when the start & end are the same value (i.e., an empty bin).->
I might revert the first commit & look into smth like thatperformed this in PR #25