summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorRohit Goswami <rog32@hi.is>2023-05-12 17:54:05 +0000
committerRohit Goswami <rog32@hi.is>2023-05-12 17:54:05 +0000
commit60f28c52e508892482941acbe7809f015511baf0 (patch)
tree1290b96ee06f6b9fbd9b3aeccfaa77ce87d9045c
parenta44c60466ef477e120611f7a32433f8b1a34aaea (diff)
downloadnumpy-60f28c52e508892482941acbe7809f015511baf0.tar.gz
MAINT: Fix merge error
-rw-r--r--numpy/f2py/tests/test_crackfortran.py13
1 files changed, 0 insertions, 13 deletions
diff --git a/numpy/f2py/tests/test_crackfortran.py b/numpy/f2py/tests/test_crackfortran.py
index c20e2c2cf..49bfc13af 100644
--- a/numpy/f2py/tests/test_crackfortran.py
+++ b/numpy/f2py/tests/test_crackfortran.py
@@ -317,19 +317,6 @@ class TestNameArgsPatternBacktracking:
# that should still be true.
good_version_of_adversary = repeated_adversary + '@)@'
assert nameargspattern.search(good_version_of_adversary)
- if ii > start_reps:
- # the hallmark of exponentially catastrophic backtracking
- # is that runtime doubles for every added instance of
- # the problematic pattern.
- times_median_doubled += median > 2 * last_median
- # also try to rule out non-exponential but still bad cases
- # arbitrarily, we should set a hard limit of 10ms as too slow
- assert median < trials_per_count * 0.01
- last_median = median
- # we accept that maybe the median might double once, due to
- # the CPU scheduler acting weird or whatever. More than that
- # seems suspicious.
- assert times_median_doubled < 2
class TestFunctionReturn(util.F2PyTest):