summaryrefslogtreecommitdiff
path: root/tests/test_versioning.py
diff options
context:
space:
mode:
authorTakeshi KOMIYA <i.tkomiya@gmail.com>2022-01-03 01:05:46 +0900
committerTakeshi KOMIYA <i.tkomiya@gmail.com>2022-01-03 01:06:20 +0900
commita0e44a7300b12c6946ba13cdf6ffc917298cbf60 (patch)
tree4ec9c811d7b01a7d310277916289154432c838b6 /tests/test_versioning.py
parent08a87d945a8ca7770c589ea878e9b095ed35e6d4 (diff)
downloadsphinx-git-a0e44a7300b12c6946ba13cdf6ffc917298cbf60.tar.gz
test: Migrate to Node.findall() from Node.traverse()
Diffstat (limited to 'tests/test_versioning.py')
-rw-r--r--tests/test_versioning.py18
1 files changed, 9 insertions, 9 deletions
diff --git a/tests/test_versioning.py b/tests/test_versioning.py
index 9961fe464..4de8331aa 100644
--- a/tests/test_versioning.py
+++ b/tests/test_versioning.py
@@ -70,16 +70,16 @@ def test_picklablility():
copy.settings.warning_stream = None
copy.settings.env = None
copy.settings.record_dependencies = None
- for metanode in copy.traverse(meta):
+ for metanode in copy.findall(meta):
metanode.__class__ = addnodes.meta
loaded = pickle.loads(pickle.dumps(copy, pickle.HIGHEST_PROTOCOL))
- assert all(getattr(n, 'uid', False) for n in loaded.traverse(is_paragraph))
+ assert all(getattr(n, 'uid', False) for n in loaded.findall(is_paragraph))
def test_modified():
modified = doctrees['modified']
new_nodes = list(merge_doctrees(original, modified, is_paragraph))
- uids = [n.uid for n in modified.traverse(is_paragraph)]
+ uids = [n.uid for n in modified.findall(is_paragraph)]
assert not new_nodes
assert original_uids == uids
@@ -87,7 +87,7 @@ def test_modified():
def test_added():
added = doctrees['added']
new_nodes = list(merge_doctrees(original, added, is_paragraph))
- uids = [n.uid for n in added.traverse(is_paragraph)]
+ uids = [n.uid for n in added.findall(is_paragraph)]
assert len(new_nodes) == 1
assert original_uids == uids[:-1]
@@ -95,7 +95,7 @@ def test_added():
def test_deleted():
deleted = doctrees['deleted']
new_nodes = list(merge_doctrees(original, deleted, is_paragraph))
- uids = [n.uid for n in deleted.traverse(is_paragraph)]
+ uids = [n.uid for n in deleted.findall(is_paragraph)]
assert not new_nodes
assert original_uids[::2] == uids
@@ -103,7 +103,7 @@ def test_deleted():
def test_deleted_end():
deleted_end = doctrees['deleted_end']
new_nodes = list(merge_doctrees(original, deleted_end, is_paragraph))
- uids = [n.uid for n in deleted_end.traverse(is_paragraph)]
+ uids = [n.uid for n in deleted_end.findall(is_paragraph)]
assert not new_nodes
assert original_uids[:-1] == uids
@@ -111,7 +111,7 @@ def test_deleted_end():
def test_insert():
insert = doctrees['insert']
new_nodes = list(merge_doctrees(original, insert, is_paragraph))
- uids = [n.uid for n in insert.traverse(is_paragraph)]
+ uids = [n.uid for n in insert.findall(is_paragraph)]
assert len(new_nodes) == 1
assert original_uids[0] == uids[0]
assert original_uids[1:] == uids[2:]
@@ -120,7 +120,7 @@ def test_insert():
def test_insert_beginning():
insert_beginning = doctrees['insert_beginning']
new_nodes = list(merge_doctrees(original, insert_beginning, is_paragraph))
- uids = [n.uid for n in insert_beginning.traverse(is_paragraph)]
+ uids = [n.uid for n in insert_beginning.findall(is_paragraph)]
assert len(new_nodes) == 1
assert len(uids) == 4
assert original_uids == uids[1:]
@@ -130,7 +130,7 @@ def test_insert_beginning():
def test_insert_similar():
insert_similar = doctrees['insert_similar']
new_nodes = list(merge_doctrees(original, insert_similar, is_paragraph))
- uids = [n.uid for n in insert_similar.traverse(is_paragraph)]
+ uids = [n.uid for n in insert_similar.findall(is_paragraph)]
assert len(new_nodes) == 1
assert new_nodes[0].rawsource == 'Anyway I need more'
assert original_uids[0] == uids[0]