directed 0.3.0

Evaluate programs based on Directed Acyclic Graphs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43

# 0.3.0
- New, more clear graph syntax
- Can now turn values directly into simple node inputs in the graph
- Can now directly specify the node to execute - so removed the concept of lazy nodes (all nodes are lazy unless specified)

# 0.2.7
- Got async working

# 0.2.5
- Various bugs fixed.

# 0.2.0
- Massive rewrite.

# 0.1.17

- Inputs to top-level nodes can now be injected.

# 0.1.16

- Graph outputs can now be accessed, but still a bit too primitive.

# 0.1.15

- True async stages now implemented.

# 0.1.14

- Made the `graph` macro more clean.
- Now can make connections between nodes with no associated data.

# 0.1.13

- Fixes for some broken parts of `cache_all`

# 0.1.9

- Very basic implmenetation of `cache_all`, still lacking comprehensive tests

# 0.1.7

- First implementation of the `tokio` optional feature. Async works!
- Fixed a few debilitating compile-time problems