Python linting.

Author: Neil Fraser

python2/diff_match_patch.py

@@ -27,12 +27,12 @@
 
 __author__ = 'fraser@google.com (Neil Fraser)'
 
-import math
 import re
 import sys
 import time
 import urllib
 
+
 class diff_match_patch:
  """Class containing the diff, match and patch methods.
 
@@ -847,8 +847,8 @@ def diff_cleanupSemanticScore(one, two):
  pointer += 1
 
  # Define some regex patterns for matching boundaries.
- BLANKLINEEND = re.compile(r"\n\r?\n$");
- BLANKLINESTART = re.compile(r"^\r?\n\r?\n");
+ BLANKLINEEND = re.compile(r"\n\r?\n$")
+ BLANKLINESTART = re.compile(r"^\r?\n\r?\n")
 
  def diff_cleanupEfficiency(self, diffs):
  """Reduce the number of edits by eliminating operationally trivial
@@ -967,14 +967,14 @@ def diff_cleanupMerge(self, diffs):
  text_insert = text_insert[:-commonlength]
  text_delete = text_delete[:-commonlength]
  # Delete the offending records and add the merged ones.
- new_ops = [];
+ new_ops = []
  if len(text_delete) != 0:
  new_ops.append((self.DIFF_DELETE, text_delete))
  if len(text_insert) != 0:
  new_ops.append((self.DIFF_INSERT, text_insert))
  pointer -= count_delete + count_insert
  diffs[pointer : pointer + count_delete + count_insert] = new_ops
- pointer += len(new_ops) + 1;
+ pointer += len(new_ops) + 1
  elif pointer != 0 and diffs[pointer - 1][0] == self.DIFF_EQUAL:
  # Merge this equality with the previous one.
  diffs[pointer - 1] = (diffs[pointer - 1][0],

python2/tests/diff_match_patch_test.py

@@ -172,9 +172,9 @@ def testDiffCharsToLines(self):
  lineList.append(str(i) + "\n")
  chars = "".join(lineList)
  results = self.dmp.diff_linesToChars(chars, "")
- diffs = [(self.dmp.DIFF_INSERT, results[0])];
- self.dmp.diff_charsToLines(diffs, results[2]);
- self.assertEquals(chars, diffs[0][1]);
+ diffs = [(self.dmp.DIFF_INSERT, results[0])]
+ self.dmp.diff_charsToLines(diffs, results[2])
+ self.assertEquals(chars, diffs[0][1])
 
  def testDiffCleanupMerge(self):
  # Cleanup a messy diff.

python3/diff_match_patch.py

@@ -25,12 +25,12 @@
 
 __author__ = 'fraser@google.com (Neil Fraser)'
 
-import math
 import re
 import sys
 import time
 import urllib.parse
 
+
 class diff_match_patch:
  """Class containing the diff, match and patch methods.
 
@@ -845,8 +845,8 @@ def diff_cleanupSemanticScore(one, two):
  pointer += 1
 
  # Define some regex patterns for matching boundaries.
- BLANKLINEEND = re.compile(r"\n\r?\n$");
- BLANKLINESTART = re.compile(r"^\r?\n\r?\n");
+ BLANKLINEEND = re.compile(r"\n\r?\n$")
+ BLANKLINESTART = re.compile(r"^\r?\n\r?\n")
 
  def diff_cleanupEfficiency(self, diffs):
  """Reduce the number of edits by eliminating operationally trivial
@@ -965,14 +965,14 @@ def diff_cleanupMerge(self, diffs):
  text_insert = text_insert[:-commonlength]
  text_delete = text_delete[:-commonlength]
  # Delete the offending records and add the merged ones.
- new_ops = [];
+ new_ops = []
  if len(text_delete) != 0:
  new_ops.append((self.DIFF_DELETE, text_delete))
  if len(text_insert) != 0:
  new_ops.append((self.DIFF_INSERT, text_insert))
  pointer -= count_delete + count_insert
  diffs[pointer : pointer + count_delete + count_insert] = new_ops
- pointer += len(new_ops) + 1;
+ pointer += len(new_ops) + 1
  elif pointer != 0 and diffs[pointer - 1][0] == self.DIFF_EQUAL:
  # Merge this equality with the previous one.
  diffs[pointer - 1] = (diffs[pointer - 1][0],

python3/tests/diff_match_patch_test.py

@@ -174,9 +174,9 @@ def testDiffCharsToLines(self):
  lineList.append(str(i) + "\n")
  chars = "".join(lineList)
  results = self.dmp.diff_linesToChars(chars, "")
- diffs = [(self.dmp.DIFF_INSERT, results[0])];
- self.dmp.diff_charsToLines(diffs, results[2]);
- self.assertEqual(chars, diffs[0][1]);
+ diffs = [(self.dmp.DIFF_INSERT, results[0])]
+ self.dmp.diff_charsToLines(diffs, results[2])
+ self.assertEqual(chars, diffs[0][1])
 
  def testDiffCleanupMerge(self):
  # Cleanup a messy diff.