Refine test case
This commit is contained in:
@@ -257,7 +257,7 @@ class TestApi:
|
||||
|
||||
links = get_links(p)
|
||||
|
||||
for _ in range(100):
|
||||
for _ in range(10):
|
||||
random.shuffle(nls)
|
||||
for nl in nls:
|
||||
if nl[0] == 'node':
|
||||
@@ -277,21 +277,21 @@ class TestApi:
|
||||
if is_valve(p, link):
|
||||
delete_valve(p, ChangeSet({'id': link}))
|
||||
|
||||
for node in nodes:
|
||||
assert is_node(p, node) == False
|
||||
for link in links:
|
||||
assert is_link(p, link) == False
|
||||
for node in nodes:
|
||||
assert is_node(p, node) == False
|
||||
for link in links:
|
||||
assert is_link(p, link) == False
|
||||
|
||||
assert get_nodes(p) == []
|
||||
assert get_links(p) == []
|
||||
assert get_nodes(p) == []
|
||||
assert get_links(p) == []
|
||||
|
||||
op = get_restore_operation(p)
|
||||
pick_operation(p, op)
|
||||
op = get_restore_operation(p)
|
||||
pick_operation(p, op)
|
||||
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link)
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link)
|
||||
|
||||
self.leave(p)
|
||||
|
||||
@@ -310,7 +310,7 @@ class TestApi:
|
||||
for link in links:
|
||||
nls.append(('link', link))
|
||||
|
||||
for _ in range(100):
|
||||
for _ in range(10):
|
||||
random.shuffle(nls)
|
||||
for nl in nls:
|
||||
if nl[0] == 'node':
|
||||
@@ -330,20 +330,20 @@ class TestApi:
|
||||
if is_valve(p, link):
|
||||
delete_valve(p, ChangeSet({'id': link}))
|
||||
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link) == False
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link) == False
|
||||
|
||||
assert get_links(p) == []
|
||||
assert get_links(p) == []
|
||||
|
||||
op = get_restore_operation(p)
|
||||
pick_operation(p, op)
|
||||
op = get_restore_operation(p)
|
||||
pick_operation(p, op)
|
||||
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link)
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link)
|
||||
|
||||
self.leave(p)
|
||||
|
||||
@@ -364,7 +364,7 @@ class TestApi:
|
||||
for link in links:
|
||||
nls.append(('link', link))
|
||||
|
||||
for _ in range(100):
|
||||
for _ in range(10):
|
||||
random.shuffle(nls)
|
||||
for nl in nls:
|
||||
if nl[0] == 'node':
|
||||
@@ -384,21 +384,21 @@ class TestApi:
|
||||
if is_valve(p, link):
|
||||
delete_valve(p, ChangeSet({'id': link}))
|
||||
|
||||
for node in nodes:
|
||||
assert is_node(p, node) == False
|
||||
for link in links:
|
||||
assert is_link(p, link) == False
|
||||
for node in nodes:
|
||||
assert is_node(p, node) == False
|
||||
for link in links:
|
||||
assert is_link(p, link) == False
|
||||
|
||||
assert get_nodes(p) == []
|
||||
assert get_links(p) == []
|
||||
assert get_nodes(p) == []
|
||||
assert get_links(p) == []
|
||||
|
||||
op = get_restore_operation(p)
|
||||
pick_operation(p, op)
|
||||
op = get_restore_operation(p)
|
||||
pick_operation(p, op)
|
||||
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link)
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link)
|
||||
|
||||
self.leave(p)
|
||||
|
||||
@@ -419,7 +419,7 @@ class TestApi:
|
||||
for link in links:
|
||||
nls.append(('link', link))
|
||||
|
||||
for _ in range(100):
|
||||
for _ in range(10):
|
||||
random.shuffle(nls)
|
||||
for nl in nls:
|
||||
if nl[0] == 'node':
|
||||
@@ -439,21 +439,21 @@ class TestApi:
|
||||
if is_valve(p, link):
|
||||
delete_valve(p, ChangeSet({'id': link}))
|
||||
|
||||
for node in nodes:
|
||||
assert is_node(p, node) == False
|
||||
for link in links:
|
||||
assert is_link(p, link) == False
|
||||
for node in nodes:
|
||||
assert is_node(p, node) == False
|
||||
for link in links:
|
||||
assert is_link(p, link) == False
|
||||
|
||||
assert get_nodes(p) == []
|
||||
assert get_links(p) == []
|
||||
assert get_nodes(p) == []
|
||||
assert get_links(p) == []
|
||||
|
||||
op = get_restore_operation(p)
|
||||
pick_operation(p, op)
|
||||
op = get_restore_operation(p)
|
||||
pick_operation(p, op)
|
||||
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link)
|
||||
for node in nodes:
|
||||
assert is_node(p, node)
|
||||
for link in links:
|
||||
assert is_link(p, link)
|
||||
|
||||
self.leave(p)
|
||||
|
||||
|
||||
Reference in New Issue
Block a user