-
Notifications
You must be signed in to change notification settings - Fork 45
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
Fix Ensemble Bug #1063
Fix Ensemble Bug #1063
Conversation
…x size is smaller then the number of starts, as before this resulted in no ensemble
Codecov Report
❗ Your organization is not using the GitHub App Integration. As a result you may experience degraded service beginning May 15th. Please install the Github App Integration for your organization. Read more. @@ Coverage Diff @@
## develop #1063 +/- ##
===========================================
- Coverage 88.16% 83.59% -4.57%
===========================================
Files 79 147 +68
Lines 5257 11389 +6132
===========================================
+ Hits 4635 9521 +4886
- Misses 622 1868 +1246
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
ens_ind = [np.flatnonzero(fval <= cutoff) for fval in fval_traces] | ||
|
||
# count the number of candidates per start | ||
n_per_start = np.array([len(start) for start in ens_ind]) | ||
n_theo = np.array([len(start) for start in ens_ind]) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
This and the previous line look like they could be combined into
ens_ind = [np.flatnonzero(fval <= cutoff) for fval in fval_traces] | |
# count the number of candidates per start | |
n_per_start = np.array([len(start) for start in ens_ind]) | |
n_theo = np.array([len(start) for start in ens_ind]) | |
n_theo = np.array([(fval <= cutoff).sum() for fval in fval_traces)]) |
I'm not sure if this is already the desired behaviour in When When |
Speedup in history choosing. Now also covers the case in which the max size is smaller then the number of starts, as before this resulted in no ensemble