def test_eq_depth_three_two_children():
node_one = Node('s', Not(Atom('p')), [
Node('s', Atom('p'),
[Node('s', Atom('r'), []),
Node('s', Atom('f'), [])])
])
node_two = node_one
assert node_one == node_two
def test_not_eq_depth_three_dif_encaps():
node_one = Node('s', Not(Atom('p')), [
Node('s', Atom('p'),
[Node('s', Atom('r'), []),
Node('s', Atom('f'), [])])
])
node_two = Node('s', Not(Atom('p')),
[Node('s', Atom('p'), [Node('s', Atom('r'), [])])])
assert not node_one == node_two
def test_next_atom_is_derived():
node = Node('s', Atom('p'), [])
node.is_derived = True
next_node = node.__next__()
assert next_node is None
def test_eq_node_none():
node = Node('s', Atom('p'), [])
assert node is not None
def test_eq_depth_three_with_and():
node_one = Node('s', And(Atom('p'), Atom('q')),
[Node('s', Atom('p'), [Node('s', Atom('q'), [])])])
node_two = node_one
assert node_one == node_two
def test_node_is_eq_trivial_case():
node_one = Node('s', Atom('p'), [])
node_two = Node('s', Atom('p'), [])
assert node_one == node_two
def test_node_not_eq_with_cild():
node_one = Node('s', Not(Atom('p')), [Node('s', Atom('p'), [])])
node_two = Node('s', Not(Atom('p')), [Node('s', Atom('q'), [])])
assert not node_one == node_two
def test_next_and_is_derived():
node = Node('s', And(Atom('p'), Atom('q')),
[Leaf('s', 'p', [Leaf('s', 'q', [], True)], True)])
node.is_derived = True
next_node = node.__next__()
assert next_node is None
def test_next_and_not_derived():
node = Node('s', And(Atom('p'), Atom('q')), [])
next_node = node.__next__()
assert next_node is node