def test_next_free_int(): g = BDD() # contiguous g._succ = {1, 2, 3} n = g._next_free_int(start=1, debug=True) assert n == 4, n n = g._next_free_int(start=3, debug=True) assert n == 4, n # with blanks g._succ = {1, 3} n = g._next_free_int(start=1, debug=True) assert n == 2, n n = g._next_free_int(start=3) assert n == 4, n # full g._succ = {1, 2, 3} g.max_nodes = 3 with nt.assert_raises(Exception): g._next_free_int(start=1)