-
Notifications
You must be signed in to change notification settings - Fork 1.6k
New issue
Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? # to your account
Deflake CI #1751
Deflake CI #1751
Conversation
As it can be seen in e.g. https://github.com/google/benchmark/actions/runs/7711328637/job/21016492361 We may get `65: BM_Complexity_O1_BigO 0.00 N^2 0.00 N^2 `
92eeefa
to
cb9bc80
Compare
bc4de08
to
e9df833
Compare
We were still getting zero times there. Perhaps this is better?
e9df833
to
57313a7
Compare
@dmah42 green is good right? :) |
@@ -88,7 +88,7 @@ const char *enum_big_o_1 = "\\([0-9]+\\)"; | |||
// FIXME: Tolerate both '(1)' and 'lgN' as output when the complexity is auto | |||
// deduced. | |||
// See https://github.com/google/benchmark/issues/272 | |||
const char *auto_big_o_1 = "(\\([0-9]+\\))|(lgN)"; | |||
const char *auto_big_o_1 = "(\\([0-9]+\\))|(lgN)|(N\\^2)"; |
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.
maybe rename the variable too
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.
Hm, i believe the name is still correct.
It is only used for the function where the true/correct complexity is O(1)
,
we just fail to auto-detect it because of the noise in CI.
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.
auto_big_o_1_or_lgn_or_n2_actually_we_have_no_idea_what_this_should_be
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.
:)
@dmah42 thank you! |
same as #272
As it can be seen in e.g. https://github.com/google/benchmark/actions/runs/7711328637/job/21016492361
We may get
65: BM_Complexity_O1_BigO 0.00 N^2 0.00 N^2