mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 23:11:09 +00:00
* fix: Syntax Error lgtm display in matrix/matrix_operation.py.
* Testing for None should use the 'is' operator.
* fix: Too many arguments for string format.
* fix: supress lgtm alert as false positive.
* style: Unnecessary 'pass' statement.
* Revert "fix: Syntax Error lgtm display in matrix/matrix_operation.py."
This reverts commit 4c629b4ce1
.
This commit is contained in:
parent
a2b5a90c11
commit
04962c0d17
|
@ -307,7 +307,7 @@ class BinomialHeap:
|
||||||
# No right subtree corner case
|
# No right subtree corner case
|
||||||
# The structure of the tree implies that this should be the bottom root
|
# The structure of the tree implies that this should be the bottom root
|
||||||
# and there is at least one other root
|
# and there is at least one other root
|
||||||
if self.min_node.right == None:
|
if self.min_node.right is None:
|
||||||
# Update size
|
# Update size
|
||||||
self.size -= 1
|
self.size -= 1
|
||||||
|
|
||||||
|
|
|
@ -191,7 +191,7 @@ def _validate_input(points):
|
||||||
else:
|
else:
|
||||||
raise ValueError("Expecting an iterable of type Point, list or tuple. "
|
raise ValueError("Expecting an iterable of type Point, list or tuple. "
|
||||||
"Found objects of type {} instead"
|
"Found objects of type {} instead"
|
||||||
.format(["point", "list", "tuple"], type(points[0])))
|
.format(type(points[0])))
|
||||||
elif not hasattr(points, "__iter__"):
|
elif not hasattr(points, "__iter__"):
|
||||||
raise ValueError("Expecting an iterable object "
|
raise ValueError("Expecting an iterable object "
|
||||||
"but got an non-iterable type {}".format(points))
|
"but got an non-iterable type {}".format(points))
|
||||||
|
|
|
@ -297,7 +297,6 @@ class CNN():
|
||||||
|
|
||||||
|
|
||||||
if __name__ == '__main__':
|
if __name__ == '__main__':
|
||||||
pass
|
|
||||||
'''
|
'''
|
||||||
I will put the example on other file
|
I will put the example on other file
|
||||||
'''
|
'''
|
||||||
|
|
|
@ -70,7 +70,7 @@ class BoyerMooreSearch:
|
||||||
positions.append(i)
|
positions.append(i)
|
||||||
else:
|
else:
|
||||||
match_index = self.match_in_pattern(self.text[mismatch_index])
|
match_index = self.match_in_pattern(self.text[mismatch_index])
|
||||||
i = mismatch_index - match_index #shifting index
|
i = mismatch_index - match_index #shifting index lgtm [py/multiple-definition]
|
||||||
return positions
|
return positions
|
||||||
|
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user