OLD | NEW |
| (Empty) |
1 # Copyright (C) 2011 Google Inc. All rights reserved. | |
2 # | |
3 # Redistribution and use in source and binary forms, with or without | |
4 # modification, are permitted provided that the following conditions are | |
5 # met: | |
6 # | |
7 # * Redistributions of source code must retain the above copyright | |
8 # notice, this list of conditions and the following disclaimer. | |
9 # * Redistributions in binary form must reproduce the above | |
10 # copyright notice, this list of conditions and the following disclaimer | |
11 # in the documentation and/or other materials provided with the | |
12 # distribution. | |
13 # * Neither the name of Google Inc. nor the names of its | |
14 # contributors may be used to endorse or promote products derived from | |
15 # this software without specific prior written permission. | |
16 # | |
17 # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
18 # "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
19 # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
20 # A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
21 # OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
22 # SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
23 # LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
24 # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
25 # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
26 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
27 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
28 | |
29 | |
30 class AmountChangedPattern: | |
31 def __init__(self, compile_regex, index_for_zero_value): | |
32 self._regex = compile_regex | |
33 self._index_for_zero_value = index_for_zero_value | |
34 | |
35 def match(self, path, diff_file): | |
36 examined_strings = set() | |
37 for diff_line in diff_file: | |
38 if diff_line[self._index_for_zero_value]: | |
39 continue | |
40 match = self._regex.search(diff_line[2]) | |
41 if not match: | |
42 continue | |
43 matching_string = match.group(0) | |
44 if matching_string in examined_strings: | |
45 continue | |
46 if self._instance_difference(diff_file, matching_string) > 0: | |
47 return True | |
48 # Avoid reprocessing this same string. | |
49 examined_strings.add(matching_string) | |
50 return False | |
51 | |
52 def _instance_difference(self, diff_file, matching_string): | |
53 '''Returns the difference between the number of string occurences in | |
54 the added lines and deleted lines (which one is subtracted from the | |
55 other depends on _index_for_zero_value).''' | |
56 count = 0 | |
57 for diff_line in diff_file: | |
58 # If the line is unchanged, then don't examine it. | |
59 if diff_line[self._index_for_zero_value] and diff_line[1 - self._ind
ex_for_zero_value]: | |
60 continue | |
61 location_found = -len(matching_string) | |
62 while True: | |
63 location_found = diff_line[2].find(matching_string, location_fou
nd + len(matching_string)) | |
64 if location_found == -1: | |
65 break | |
66 if not diff_line[self._index_for_zero_value]: | |
67 count += 1 | |
68 else: | |
69 count -= 1 | |
70 return count | |
OLD | NEW |