| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
Sorry, something went wrong.
Co-authored-by: Adam Turner <9087854+AA-Turner@users.noreply.github.com>
Co-authored-by: Adam Turner <9087854+AA-Turner@users.noreply.github.com>
There was a problem hiding this comment.
One oddity of difflib is that re is imported at module level for IS_LINE_JUNK and again at class level in class _mdiff line 1378. It is used in line 1381 to define class name change_re = re.compile(r'(\++|\-+|\^+)'). To avoid importing re when importing difflib, the second import would have to be moved within a function. This is possible since change_re is only used within the _make_line method the immediately follows (1386).
I have not looked at how commonly this method is used.
Sorry, something went wrong.
|
A Python core developer has requested some changes be made to your pull request before we can consider merging it. If you could please address their requests along with any other requests in other reviews from core developers that would be appreciated. Once you have made the requested changes, please leave a comment on this pull request containing the phrase I have made the requested changes; please review again. I will then notify any core developers who have left a review that you're ready for them to take another look at this pull request. |
Sorry, something went wrong.
|
I checked correctness of the return expression replacement, using test_cases above, with for s in test_cases:
(pat(s) is not None) is (s.strip() in ('', '#'))
and all are True. |
Sorry, something went wrong.
Ok, thank you, but this test_cases is too small a sample and therefore I have supplemented my script with the following checks: import string
import random
from itertools import product
# First Checks:
for case in test_cases:
assert is_line_junk_regex(case) == is_line_junk_no_regex(case), f"Inconsistent behavior for {repr(case)}"
def random_string(length=10):
chars = string.printable + " " * 5 + "#" * 5
return "".join(random.choice(chars) for _ in range(length))
# Second Checks:
for _ in range(10000):
case = random_string(random.randint(0, 20))
assert is_line_junk_regex(case) == is_line_junk_no_regex(case), f"Inconsistent behavior for {repr(case)}"
# Third Checks:
chars = " #\tabc"
for length in range(6):
for case in map("".join, product(chars, repeat=length)):
assert is_line_junk_regex(case) == is_line_junk_no_regex(case), f"Inconsistent behavior for {repr(case)}"Then I checked the tests in Lib/test/test_difflib.py and everything finished well 👍 |
Sorry, something went wrong.
|
I have made the requested changes; please review again |
Sorry, something went wrong.
|
Thanks for making the requested changes! @terryjreedy, @AA-Turner: please review the changes made to this pull request. |
Sorry, something went wrong.
There was a problem hiding this comment.
Since we're improving performance, we don't want to recompute line.strip()
Sorry, something went wrong.
Co-authored-by: Bénédikt Tran <10796600+picnixz@users.noreply.github.com>
Sorry, I suspected this but hoped that there was a cache mechanism here :) |
Sorry, something went wrong.
There was a problem hiding this comment.
I am not sure that the performance of this function is worth changing the code. In any case, the relative performance depends on the input -- for a long string with a single space character at one end (e.g. 'x'*10000+' ') the non-regex version is more than 10 times slower than the regex version. For length 100000 the difference is more than 100, and for length 1000000 -- more than 1000.
Hmm, it seems, that that implementation has more than quadratic complexity. Of course, most data for which this function is used is short strings, but such behavior can be considered a security threat.
Sorry, something went wrong.
|
I checked correctness of the return expression replacement, using test_cases above, with for s in test_cases:
(pat(s) is not None) is (s.strip() in ('', '#'))and all are True. I am going to be neutral an whether the basic change should be merged. If it is, I personally think the 'pat' parameter can be considered to be private and eliminated. But I would defer the back-compatibility to others, include 'encukou'. The only documented use of the function, marked as a constant, is to be passed as an argument. The argument is always passed on to SequenceMatcher, which calls it once with 1 argument, which would be a line. |
Sorry, something went wrong.
I tested your cases but didn't get the result you expected (maybe I did something wrong?) import re
import timeit
def is_line_junk_regex(line, pat=re.compile(r"\s*(?:#\s*)?$").match):
return pat(line) is not None
def is_line_junk_no_regex(line):
return line.strip() == "" or line.lstrip().rstrip() == "#"
def benchmark(func, cases, n=1_000):
return timeit.timeit(lambda: [func(line) for line in cases], number=n)
lengths = [10_000, 100_000, 1_000_000]
for length in lengths:
test_string = "x" * length + " "
regex_time = benchmark(is_line_junk_regex, test_string)
no_regex_time = benchmark(is_line_junk_no_regex, test_string)
print(f"String length: {length}")
print(f"Regex version: {regex_time:.6f} seconds")
print(f"Non-regex version: {no_regex_time:.6f} seconds")
print(f"Speedup: {no_regex_time / regex_time:.2f}x\n")and got next results: $ ./python -B bench.py
String length: 10000
Regex version: 4.220341 seconds
Non-regex version: 1.983180 seconds
Speedup: 0.47x
String length: 100000
Regex version: 42.698992 seconds
Non-regex version: 20.897327 seconds
Speedup: 0.49x
String length: 1000000
Regex version: 516.844790 seconds
Non-regex version: 262.632697 seconds
Speedup: 0.51x |
Sorry, something went wrong.
|
Aren't you iterating over a single character instead of a full line: [func(line) for line in cases]You should pass [test_string] instead of just test_string (sorry if I'm wrong, I'm tired) |
Sorry, something went wrong.
|
I was the one who originally reqested restoring pat, but I do find Terry's argument compelling, and I wouldn't oppose removing pat. I think we should restore this PR to the simpler previous version (the differences micro-benchmarks between string comparisons are so small they will be swallowed by noise). The class-level re import should be resolved before merge, though. A |
Sorry, something went wrong.
Co-authored-by: Hugo van Kemenade <1324225+hugovk@users.noreply.github.com>
There was a problem hiding this comment.
I was wrong, the complexity is not quadratic, but linear.
Anyway, the relative performance depends on input. For some input the regexp version is faster, for other it is slower. Claiming that this improves speed for any input is bold.
Sorry, something went wrong.
|
@tim-one Do you have a reason to want to keep the regex? |
Sorry, something went wrong.
|
Can't say I much care, but I don't get it. What's the point? It's dubious on the face of it to build an entirely new string object just to do simple lexical analysis. If this is some "micro-optimizztion" thing, instead of stripped = line.strip()
return stripped == '' or stripped == '#'try return line.strip() in '#' # empty or single '#'? |
Sorry, something went wrong.
that's how it was originally :) I'll probably return it so as not to overcomplicate things |
Sorry, something went wrong.
Co-authored-by: Tim Peters <tim.peters@gmail.com>
Tim doesn't seem to mind |
Sorry, something went wrong.
|
I don't know who I can ping but it seems like there are more suggestions |
Sorry, something went wrong.
| Back | FazBrowse Home | New Git URL |
Now we don't import of re globally and there is no longer an extra (undocumented) function parameter (see documentation)
How did i benchmark a new version?
I wrote next python script difflib_bench.py:
timeit result: 1.33s -> 0.64s = x2.08 as fast