|
| 1 | +import pytest |
| 2 | + |
| 3 | +from textual.widgets import Tree |
| 4 | +from textual.widgets.tree import AddNodeError |
| 5 | + |
| 6 | + |
| 7 | +def test_tree_node_add_before_and_after_raises_exception(): |
| 8 | + tree = Tree[None]("root") |
| 9 | + with pytest.raises(AddNodeError): |
| 10 | + tree.root.add("error", before=99, after=0) |
| 11 | + |
| 12 | + |
| 13 | +def test_tree_node_add_before_or_after_with_invalid_type_raises_exception(): |
| 14 | + tree = Tree[None]("root") |
| 15 | + tree.root.add("node") |
| 16 | + with pytest.raises(TypeError): |
| 17 | + tree.root.add("before node", before="node") |
| 18 | + with pytest.raises(TypeError): |
| 19 | + tree.root.add("after node", after="node") |
| 20 | + |
| 21 | + |
| 22 | +def test_tree_node_add_before_index(): |
| 23 | + tree = Tree[None]("root") |
| 24 | + tree.root.add("node") |
| 25 | + tree.root.add("before node", before=0) |
| 26 | + tree.root.add("first", before=-99) |
| 27 | + tree.root.add("after first", before=-2) |
| 28 | + tree.root.add("last", before=99) |
| 29 | + tree.root.add("after node", before=4) |
| 30 | + tree.root.add("before last", before=-1) |
| 31 | + |
| 32 | + assert str(tree.root.children[0].label) == "first" |
| 33 | + assert str(tree.root.children[1].label) == "after first" |
| 34 | + assert str(tree.root.children[2].label) == "before node" |
| 35 | + assert str(tree.root.children[3].label) == "node" |
| 36 | + assert str(tree.root.children[4].label) == "after node" |
| 37 | + assert str(tree.root.children[5].label) == "before last" |
| 38 | + assert str(tree.root.children[6].label) == "last" |
| 39 | + |
| 40 | + |
| 41 | +def test_tree_node_add_after_index(): |
| 42 | + tree = Tree[None]("root") |
| 43 | + tree.root.add("node") |
| 44 | + tree.root.add("after node", after=0) |
| 45 | + tree.root.add("first", after=-99) |
| 46 | + tree.root.add("after first", after=-3) |
| 47 | + tree.root.add("before node", after=1) |
| 48 | + tree.root.add("before last", after=99) |
| 49 | + tree.root.add("last", after=-1) |
| 50 | + |
| 51 | + assert str(tree.root.children[0].label) == "first" |
| 52 | + assert str(tree.root.children[1].label) == "after first" |
| 53 | + assert str(tree.root.children[2].label) == "before node" |
| 54 | + assert str(tree.root.children[3].label) == "node" |
| 55 | + assert str(tree.root.children[4].label) == "after node" |
| 56 | + assert str(tree.root.children[5].label) == "before last" |
| 57 | + assert str(tree.root.children[6].label) == "last" |
| 58 | + |
| 59 | + |
| 60 | +def test_tree_node_add_relative_to_unknown_node_raises_exception(): |
| 61 | + tree = Tree[None]("root") |
| 62 | + removed_node = tree.root.add("removed node") |
| 63 | + removed_node.remove() |
| 64 | + with pytest.raises(AddNodeError): |
| 65 | + tree.root.add("node", before=removed_node) |
| 66 | + with pytest.raises(AddNodeError): |
| 67 | + tree.root.add("node", after=removed_node) |
| 68 | + |
| 69 | + |
| 70 | +def test_tree_node_add_before_node(): |
| 71 | + tree = Tree[None]("root") |
| 72 | + node = tree.root.add("node") |
| 73 | + before_node = tree.root.add("before node", before=node) |
| 74 | + tree.root.add("first", before=before_node) |
| 75 | + tree.root.add("after first", before=before_node) |
| 76 | + last = tree.root.add("last", before=4) |
| 77 | + before_last = tree.root.add("before last", before=last) |
| 78 | + tree.root.add("after node", before=before_last) |
| 79 | + |
| 80 | + assert str(tree.root.children[0].label) == "first" |
| 81 | + assert str(tree.root.children[1].label) == "after first" |
| 82 | + assert str(tree.root.children[2].label) == "before node" |
| 83 | + assert str(tree.root.children[3].label) == "node" |
| 84 | + assert str(tree.root.children[4].label) == "after node" |
| 85 | + assert str(tree.root.children[5].label) == "before last" |
| 86 | + assert str(tree.root.children[6].label) == "last" |
| 87 | + |
| 88 | + |
| 89 | +def test_tree_node_add_after_node(): |
| 90 | + tree = Tree[None]("root") |
| 91 | + node = tree.root.add("node") |
| 92 | + after_node = tree.root.add("after node", after=node) |
| 93 | + first = tree.root.add("first", after=-3) |
| 94 | + after_first = tree.root.add("after first", after=first) |
| 95 | + tree.root.add("before node", after=after_first) |
| 96 | + before_last = tree.root.add("before last", after=after_node) |
| 97 | + tree.root.add("last", after=before_last) |
| 98 | + |
| 99 | + assert str(tree.root.children[0].label) == "first" |
| 100 | + assert str(tree.root.children[1].label) == "after first" |
| 101 | + assert str(tree.root.children[2].label) == "before node" |
| 102 | + assert str(tree.root.children[3].label) == "node" |
| 103 | + assert str(tree.root.children[4].label) == "after node" |
| 104 | + assert str(tree.root.children[5].label) == "before last" |
| 105 | + assert str(tree.root.children[6].label) == "last" |
| 106 | + |
| 107 | + |
| 108 | +def test_tree_node_add_leaf_before_or_after(): |
| 109 | + tree = Tree[None]("root") |
| 110 | + leaf = tree.root.add_leaf("leaf") |
| 111 | + tree.root.add_leaf("before leaf", before=leaf) |
| 112 | + tree.root.add_leaf("after leaf", after=leaf) |
| 113 | + tree.root.add_leaf("first", before=0) |
| 114 | + tree.root.add_leaf("last", after=-1) |
| 115 | + |
| 116 | + assert str(tree.root.children[0].label) == "first" |
| 117 | + assert str(tree.root.children[1].label) == "before leaf" |
| 118 | + assert str(tree.root.children[2].label) == "leaf" |
| 119 | + assert str(tree.root.children[3].label) == "after leaf" |
| 120 | + assert str(tree.root.children[4].label) == "last" |
0 commit comments