def test_insert_order_mixed_pos():
children = [SpedNode('a'), SpedNode('a')]
parent = SpedNode('', children=children)
parent.insert(SpedNode('b'))
assert parent.children == [
SpedNode('a'), SpedNode('a'), SpedNode('b')
]
def test_iter_tree_complex_nested_structure():
child = SpedNode('child', [])
parent = SpedNode('parent', [child])
uncle = SpedNode('uncle', [])
root = SpedNode('root', [parent, uncle])
assert list(root) == [root, parent, child, uncle]
def test_iter_wont_raise_recursion_error():
"this test setup used to raise a RecursiveErrror due to list.insert method"
parent = SpedNode('parent')
son = SpedNode('son', children=[SpedNode('grandchild')])
assert parent.count() == 1
assert son.count() == 2
parent.insert(son)
assert parent.count() == 3
def test_deletion():
child = SpedNode('child', [])
parent = SpedNode('parent', [])
parent.insert(child)
child.delete()
assert not parent.children
def test_deletion_with_siblings():
child_1, child_2, child_3 = (SpedNode('child', []),
SpedNode('child', []),
SpedNode('child', []))
parent = SpedNode('parent', [child_1, child_2, child_3])
child_2.delete()
assert parent.children == [child_1, child_3]
child_1.delete()
assert parent.children == [child_3]
child_3.delete()
assert not parent.children
def test_item_assignment_simple():
node = SpedNode('|A|B|C|D|E|F|')
assert node.values == list("ABCDEF")
node[0] = "Z"
node[-1] = "W"
assert node.values == list("ZBCDEW")
def test_filter_tree_simple_case():
node = SpedNode('', [
SpedNode('foo', []),
SpedNode('bar', [])
])
node.filter(lambda n: n.values[0] != 'foo')
expected = SpedNode('', [SpedNode('bar', [])])
assert node == expected
def test_get_nodes():
children = [
SpedNode('foo'),
SpedNode('bar'),
SpedNode('baz'),
SpedNode('bar'),
]
parent = SpedNode('', children)
result = list(parent.get_nodes('bar'))
assert result == [SpedNode('bar')] * 2
def test_filter_tree_complex_case():
child = SpedNode('child', [])
parent = SpedNode('', [child])
uncle = SpedNode('', [])
root = SpedNode('', [parent, uncle])
root.filter(lambda n: n.values[0] != 'child')
assert list(root) == [root, parent, uncle]
def test_get_node():
children = [
SpedNode('foo'),
SpedNode('bar'),
SpedNode('baz'),
]
parent = SpedNode('', children)
result = parent.get_node('bar')
assert result == SpedNode('bar')
def test_length_depth_one():
# this node have 3 children with zero children each
node = SpedNode('', [
SpedNode('', []),
SpedNode('', []),
SpedNode('', []),
])
assert node.count() == 4 # 1 + 3
def test_length_depth_two():
# this node has child that has two children.
node = SpedNode('', [
SpedNode('', [
SpedNode('', []),
SpedNode('', []),
])
])
assert node.count() == 4
def test_record_type():
node = SpedNode("|FOO|ABC|")
assert node.values == ["FOO", "ABC"]
assert node.record_type == "FOO"
def test_parent_iteration():
child = SpedNode('child', [])
parent = SpedNode('parent', [])
parent.insert(child)
assert child.parent is parent
assert list(child.ancestors()) == [child, parent]
# test another insertion method
child2 = SpedNode('child2', [])
parent2 = SpedNode('parent2', [child2])
assert child2.parent is parent2
assert list(child2.ancestors()) == [child2, parent2]
# yet another insertion method
parent3 = SpedNode('parent3', [])
child3 = SpedNode('child3', [], parent=parent3)
assert child3.parent is parent3
assert list(child3.ancestors()) == [child3, parent3]
def test_update():
node = SpedNode('foo|bar|baz')
node.update(2, 'qux')
assert node.values == ['foo', 'bar', 'qux']
def test_update_with_slice():
node = SpedNode('foo|bar|baz')
node.update(slice(0, 2), ['hey', 'joe'])
assert node.values == ['hey', 'joe', 'baz']
def test_iter_tree_simple_nested_structure():
child = SpedNode('', [])
parent = SpedNode('', [child])
assert list(parent) == [parent, child]
def test_iter_tree_single_structure():
node = SpedNode('', [])
assert list(node) == [node]
def test_length_flat():
node = SpedNode('', [])
assert node.count() == 1
def test_getitem():
node = SpedNode('foo|bar|baz')
assert node[0] == 'foo'
assert node[1] == 'bar'
assert node[2] == 'baz'
def test_item_assingment_slices():
node = SpedNode('|A|B|C|D|E|F|')
assert node.values == list("ABCDEF")
node[0:3] = ["1", "2", "3"]
assert node.values == list("123DEF")