Bump hacking

hacking 3.0.x is too old.

Change-Id: Idbc349cbd348fb73a45c68c5f5b884c6a877ef4f
This commit is contained in:
Takashi Kajinami 2024-01-28 16:03:55 +09:00
parent 60c01f2c9a
commit 0000c79203
6 changed files with 11 additions and 11 deletions

View File

@ -32,7 +32,7 @@ repos:
- id: flake8
name: flake8
additional_dependencies:
- hacking>=3.0.1,<3.1.0
- hacking>=6.1.0,<6.2.0
language: python
entry: flake8
files: '^.*\.py$'

View File

@ -856,4 +856,4 @@ class ZookeeperJobBoard(base.NotifyingJobBoard):
"Failed to do post-connection"
" initialization", cause=exc)
finally:
del(exc_type, exc, exc_tb)
del (exc_type, exc, exc_tb)

View File

@ -271,12 +271,12 @@ class ZakeJobboardTest(test.TestCase, ZookeeperBoardTestMixin):
with base.connect_close(self.board):
self.board.register_entity(entity_instance)
# Check '.entity' node has been created
self.assertTrue(self.board.entity_path in self.client.storage.paths)
self.assertIn(self.board.entity_path, self.client.storage.paths)
conductor_entity_path = k_paths.join(self.board.entity_path,
'conductor',
conductor_name)
self.assertTrue(conductor_entity_path in self.client.storage.paths)
self.assertIn(conductor_entity_path, self.client.storage.paths)
conductor_data = (
self.client.storage.paths[conductor_entity_path]['data'])
self.assertTrue(len(conductor_data) > 0)

View File

@ -239,7 +239,7 @@ class GraphFlowTest(test.TestCase):
tasks = set([task1, task2, f1])
f = gf.Flow('test').add(task1, task2, f1)
for (n, data) in f.iter_nodes():
self.assertTrue(n in tasks)
self.assertIn(n, tasks)
self.assertDictEqual({}, data)
def test_iter_links(self):
@ -251,8 +251,8 @@ class GraphFlowTest(test.TestCase):
tasks = set([task1, task2, f1])
f = gf.Flow('test').add(task1, task2, f1)
for (u, v, data) in f.iter_links():
self.assertTrue(u in tasks)
self.assertTrue(v in tasks)
self.assertIn(u, tasks)
self.assertIn(v, tasks)
self.assertDictEqual({}, data)

View File

@ -130,7 +130,7 @@ class LinearFlowTest(test.TestCase):
f = lf.Flow('test').add(task1, task2, task3)
tasks = set([task1, task2, task3])
for (node, data) in f.iter_nodes():
self.assertTrue(node in tasks)
self.assertIn(node, tasks)
self.assertDictEqual({}, data)
def test_iter_links(self):
@ -140,6 +140,6 @@ class LinearFlowTest(test.TestCase):
f = lf.Flow('test').add(task1, task2, task3)
tasks = set([task1, task2, task3])
for (u, v, data) in f.iter_links():
self.assertTrue(u in tasks)
self.assertTrue(v in tasks)
self.assertIn(u, tasks)
self.assertIn(v, tasks)
self.assertDictEqual({'invariant': True}, data)

View File

@ -126,7 +126,7 @@ class UnorderedFlowTest(test.TestCase):
f = uf.Flow('test')
f.add(task2, task1)
for (node, data) in f.iter_nodes():
self.assertTrue(node in tasks)
self.assertIn(node, tasks)
self.assertDictEqual({}, data)
def test_iter_links(self):