def test_get_item():
comp = Computation()
comp.add_node('a', lambda: 1)
comp.add_node('b', lambda a: a + 1)
comp.compute_all()
assert comp['a'] == (States.UPTODATE, 1)
assert comp['b'] == (States.UPTODATE, 2)
def test_avoid_infinite_loop_compute_all():
comp = Computation()
comp.add_node('a', lambda c: c + 1)
comp.add_node('b', lambda a: a + 1)
comp.add_node('c', lambda b: b + 1)
comp.insert('a', 1)
comp.compute_all()
def test_get_inputs_order():
comp = Computation()
input_nodes = list(('inp', i) for i in range(100))
comp.add_node(input_node for input_node in input_nodes)
random.shuffle(input_nodes)
comp.add_node('res', lambda *args: args, args=input_nodes, inspect=False)
assert comp.i.res == input_nodes
def test_repoint_missing_node():
comp = Computation()
comp.add_node('a')
comp.add_node('b', lambda a: a + 1)
comp.insert('a', 1)
comp.repoint('a', 'new_a')
assert comp.s.new_a == States.PLACEHOLDER
def test_parameter_mapping():
comp = Computation()
comp.add_node('a')
comp.add_node('b', lambda x: x + 1, kwds={'x': 'a'})
comp.insert('a', 1)
comp.compute_all()
assert comp.state('b') == States.UPTODATE
assert comp.value('b') == 2
def test_namedtuple_expansion():
comp = Computation()
Coordinate = namedtuple("Coordinate", ['x', 'y'])
comp.add_node("a")
comp.add_named_tuple_expansion("a", Coordinate)
comp.insert("a", Coordinate(1, 2))
comp.compute_all()
assert comp.value("a.x") == 1
assert comp.value("a.y") == 2
def test_compute_with_unpicklable_object():
class Unpicklable(object):
def __getstate__(self):
raise Exception("UNPICKLABLE")
comp = Computation()
comp.add_node('a', value=Unpicklable())
comp.add_node('b', lambda a: None)
comp.compute('b')
def test_insert_many_nonexistent_causes_exception():
comp = Computation()
comp.add_node('a')
comp.insert('a', 0)
with assert_raises(NonExistentNodeException):
comp.insert_many([('a', 1), ('b', 2)])
assert comp.v.a == 0
def test_error_stops_compute():
comp = Computation()
comp.add_node('a')
comp.add_node('b', lambda a: a / 0)
comp.add_node('c', lambda b: b + 1)
comp.insert('a', 1)
comp.compute('c')
assert comp['a'] == (States.UPTODATE, 1)
assert comp.state('b') == States.ERROR
assert comp.state('c') == States.STALE
def test_default_args():
comp = Computation()
comp.add_node('x', value=1)
def bar(x, some_default=0):
return x + some_default
comp.add_node('foo', bar)
assert set(comp.i.foo) == {'x'}
comp.compute('foo')
assert comp.v.foo == 1
def test_to_df():
comp = Computation()
comp.add_node('a')
comp.add_node('b', lambda a: a + 1)
comp.insert('a', 1)
comp.compute_all()
df = comp.to_df()
assert df.loc['a', 'value'] == 1
assert df.loc['a', 'state'] == States.UPTODATE
assert df.loc['b', 'value'] == 2
assert df.loc['b', 'state'] == States.UPTODATE
def test_zero_parameter_functions():
comp = Computation()
def a():
return 1
comp.add_node('a', a)
assert comp.state('a') == States.COMPUTABLE
comp.compute_all()
assert comp.state('a') == States.UPTODATE
assert comp.value('a') == 1
def test_exceptions():
def b(a):
raise Exception("Infinite sadness")
comp = Computation()
comp.add_node('a')
comp.add_node('b', b)
comp.insert('a', 1)
comp.compute_all()
assert comp.state('b') == States.ERROR
assert str(comp.value('b').exception) == "Infinite sadness"
def test_delete_successor():
comp = Computation()
comp.add_node('a')
comp.add_node('b', lambda a: a + 1)
comp.insert('a', 1)
comp.compute_all()
assert comp['a'] == (States.UPTODATE, 1)
assert comp['b'] == (States.UPTODATE, 2)
comp.delete_node('b')
assert comp['a'] == (States.UPTODATE, 1)
assert list(comp.dag.nodes()) == ['a']
comp.delete_node('a')
assert list(comp.dag.nodes()) == []
def test_no_serialize_flag():
comp = Computation()
comp.add_node('a', serialize=False)
comp.add_node('b', lambda a: a + 1)
comp.insert('a', 1)
comp.compute_all()
f = six.BytesIO()
comp.write_dill(f)
f.seek(0)
comp2 = Computation.read_dill(f)
assert comp2.state('a') == States.UNINITIALIZED
assert comp2['b'] == (States.UPTODATE, 2)
def test_insert_many():
comp = Computation()
l = list(range(100))
random.shuffle(l)
prev = None
for x in l:
if prev is None:
comp.add_node(x)
else:
comp.add_node(x, lambda n: n + 1, kwds={'n': prev})
prev = x
comp.insert_many([(x, x) for x in range(100)])
for x in range(100):
assert comp[x] == (States.UPTODATE, x)
def test_placeholder():
comp = Computation()
comp.add_node('b', lambda a: a + 1)
assert comp.state('a') == States.PLACEHOLDER
assert comp.state('b') == States.UNINITIALIZED
comp.add_node('a')
assert comp.state('a') == States.UNINITIALIZED
assert comp.state('b') == States.UNINITIALIZED
comp.insert('a', 1)
assert comp['a'] == (States.UPTODATE, 1)
assert comp.state('b') == States.COMPUTABLE
comp.compute_all()
assert comp['a'] == (States.UPTODATE, 1)
assert comp['b'] == (States.UPTODATE, 2)
def test_state_map_with_adding_existing_node():
comp = Computation()
comp.add_node('a', lambda: 1)
assert comp._state_map[States.COMPUTABLE] == {'a'}
assert comp._state_map[States.UPTODATE] == set()
comp.compute('a')
assert comp._state_map[States.COMPUTABLE] == set()
assert comp._state_map[States.UPTODATE] == {'a'}
comp.add_node('a', lambda: 1)
assert comp._state_map[States.COMPUTABLE] == {'a'}
assert comp._state_map[States.UPTODATE] == set()
comp.compute('a')
assert comp._state_map[States.COMPUTABLE] == set()
assert comp._state_map[States.UPTODATE] == {'a'}
def test_compute_with_args():
comp = Computation()
comp.add_node('a', value=1)
def f(foo):
return foo + 1
comp.add_node('b', f, args=['a'])
assert set(comp.nodes()) == {'a', 'b'}
assert set(comp.dag.edges()) == {('a', 'b')}
comp.compute_all()
assert comp['b'] == (States.UPTODATE, 2)
def test_copy_2():
comp = Computation()
comp.add_node('a')
comp.add_node('b', lambda a: a + 1)
comp.insert('a', 1)
comp2 = comp.copy()
assert comp2['a'] == (States.UPTODATE, 1)
assert comp2.state('b') == States.COMPUTABLE
comp2.compute_all()
assert comp['a'] == (States.UPTODATE, 1)
assert comp.state('b') == States.COMPUTABLE
assert comp2['a'] == (States.UPTODATE, 1)
assert comp2['b'] == (States.UPTODATE, 2)
def test_set_stale():
comp = Computation()
comp.add_node('a', lambda: 1)
comp.add_node('b', lambda a: a + 1)
comp.compute_all()
assert comp['a'] == (States.UPTODATE, 1)
assert comp['b'] == (States.UPTODATE, 2)
comp.set_stale('a')
assert comp.state('a') == States.COMPUTABLE
assert comp.state('b') == States.STALE
comp.compute_all()
assert comp['a'] == (States.UPTODATE, 1)
assert comp['b'] == (States.UPTODATE, 2)
def test_compute_fib_5():
n = 5
comp = Computation()
def add(x, y):
return x + y
comp.add_node(0, value=1)
comp.add_node(1, value=1)
for i in range(2, n + 1):
comp.add_node(i, add, kwds={'x': i - 2, 'y': i - 1}, inspect=False)
comp.compute(n)
assert comp.state(n) == States.UPTODATE
def test_thread_pool_executor():
sleep_time = 0.2
n = 10
def wait(c):
sleep(sleep_time)
return c
comp = Computation(default_executor=ThreadPoolExecutor(n))
start_dt = datetime.utcnow()
for c in range(n):
comp.add_node(c, wait, kwds={'c': C(c)})
comp.compute_all()
end_dt = datetime.utcnow()
delta = (end_dt - start_dt).total_seconds()
assert delta < (n - 1) * sleep_time
def test_node_specific_thread_pool_executor():
sleep_time = 0.2
n = 10
def wait(c):
sleep(sleep_time)
return c
executor_map = {'foo': ThreadPoolExecutor(n)}
comp = Computation(executor_map=executor_map)
start_dt = datetime.utcnow()
for c in range(n):
comp.add_node(c, wait, kwds={'c': C(c)}, executor='foo')
comp.compute_all()
end_dt = datetime.utcnow()
delta = (end_dt - start_dt).total_seconds()
assert delta < (n - 1) * sleep_time
def test_tuple_node_key():
def add(a, b):
return a + b
comp = Computation()
comp.add_node(('fib', 1))
comp.add_node(('fib', 2))
for i in range(3, 11):
comp.add_node(('fib', i),
add,
kwds={
'a': ('fib', i - 2),
'b': ('fib', i - 1)
})
comp.insert(('fib', 1), 0)
comp.insert(('fib', 2), 1)
comp.compute_all()
assert comp.value(('fib', 10)) == 34
def test_exceptions_2():
comp = Computation()
comp.add_node('a')
comp.add_node('b', lambda a: a / 0)
comp.add_node('c', lambda b: b + 1)
comp.insert('a', 1)
comp.compute_all()
assert comp.state('a') == States.UPTODATE
assert comp.state('b') == States.ERROR
assert comp.state('c') == States.STALE
assert comp.value('a') == 1
comp.add_node('b', lambda a: a + 1)
assert comp.state('a') == States.UPTODATE
assert comp.state('b') == States.COMPUTABLE
assert comp.state('c') == States.STALE
assert comp.value('a') == 1
comp.compute_all()
assert comp.state('a') == States.UPTODATE
assert comp.state('b') == States.UPTODATE
assert comp.state('c') == States.UPTODATE
assert comp.value('a') == 1
assert comp.value('b') == 2
assert comp.value('c') == 3
def test_views():
comp = Computation()
comp.add_node("a")
comp.add_node("b", lambda a: a + 1)
comp.add_node("c", lambda a: 2 * a)
comp.add_node("d", lambda b, c: b + c)
assert comp.s.a == States.UNINITIALIZED
assert comp.s.b == States.UNINITIALIZED
assert comp.s.c == States.UNINITIALIZED
assert comp.s.d == States.UNINITIALIZED
comp.insert("a", 1)
assert comp.s.a == States.UPTODATE
assert comp.s.b == States.COMPUTABLE
assert comp.s.c == States.COMPUTABLE
assert comp.s.d == States.STALE
assert comp.v.a == 1
comp.compute_all()
assert comp.s.a == States.UPTODATE
assert comp.s.b == States.UPTODATE
assert comp.s.c == States.UPTODATE
assert comp.s.d == States.UPTODATE
assert comp.v.a == 1
assert comp.v.b == 2
assert comp.v.c == 2
assert comp.v.d == 4
def test_serialization_skip_flag():
comp = Computation()
comp.add_node("a")
comp.add_node("b", lambda a: a + 1, serialize=False)
comp.add_node("c", lambda b: b + 1)
comp.insert("a", 1)
comp.compute_all()
f = six.BytesIO()
comp.write_dill(f)
assert comp.state("a") == States.UPTODATE
assert comp.state("b") == States.UPTODATE
assert comp.state("c") == States.UPTODATE
assert comp.value("a") == 1
assert comp.value("b") == 2
assert comp.value("c") == 3
f.seek(0)
comp2 = Computation.read_dill(f)
assert comp2.state("a") == States.UPTODATE
assert comp2.state("b") == States.UNINITIALIZED
assert comp2.state("c") == States.UPTODATE
assert comp2.value("a") == 1
assert comp2.value("c") == 3
def test_parameter_mapping_2():
def b(x):
return x + 1
def c(x):
return 2 * x
def d(x, y):
return x + y
comp = Computation()
comp.add_node("a")
comp.add_node("b", b, kwds={'x': 'a'})
comp.add_node("c", c, kwds={'x': 'a'})
comp.add_node("d", d, kwds={'x': 'b', 'y': 'c'})
comp.insert("a", 1)
comp.compute_all()
assert comp.state('a') == States.UPTODATE
assert comp.state('b') == States.UPTODATE
assert comp.state('c') == States.UPTODATE
assert comp.state('d') == States.UPTODATE
assert comp.value('a') == 1
assert comp.value('b') == 2
assert comp.value('c') == 2
assert comp.value('d') == 4
def test_insert_from():
comp = Computation()
comp.add_node("a")
comp.add_node("b", lambda a: a + 1, serialize=False)
comp.add_node("c", lambda b: b + 1)
comp.insert("a", 1)
comp2 = comp.copy()
comp.compute_all()
assert comp.state("a") == States.UPTODATE
assert comp.state("b") == States.UPTODATE
assert comp.state("c") == States.UPTODATE
assert comp.value("a") == 1
assert comp.value("b") == 2
assert comp.value("c") == 3
assert comp2.state("a") == States.UPTODATE
assert comp2.state("b") == States.COMPUTABLE
assert comp2.state("c") == States.STALE
assert comp2.value("a") == 1
comp2.insert_from(comp, ['a', 'c'])
assert comp.state("a") == States.UPTODATE
assert comp.state("b") == States.UPTODATE
assert comp.state("c") == States.UPTODATE
assert comp.value("a") == 1
assert comp.value("b") == 2
assert comp.value("c") == 3
assert comp2.state("a") == States.UPTODATE
assert comp2.state("b") == States.COMPUTABLE
assert comp2.state("c") == States.UPTODATE
assert comp2.value("a") == 1
assert comp2.value("c") == 3