mitchmindtree
mitchmindtree
I don't quite have the time to submit a patch for this at the moment so I thought I'd open an issue in the meantime. The field is described in...
I've noticed that some of the register field `bits` methods within `stm32f4` are safe methods, whereas in `stm32f1` the same methods are `unsafe`. E.g https://docs.rs/stm32f4/0.11.0/stm32f4/stm32f407/ethernet_mac/macfcr/struct.PT_W.html#method.bits https://docs.rs/stm32f1/0.11.0/stm32f1/stm32f107/ethernet_mac/macfcr/struct.PT_W.html#method.bits This issue is a...
This will help a lot with debugging generated Rust as projects become more sophisticated.
Currently, gantz uses a very ad-hoc approach of passing slices of `Any` trait objects into the evaluation functions in order to provide access to state for nodes and nested graphs....
Currently gantz uses the `std::any::Any` trait for feeding the state of nodes into nested graphs across dynamic library boundaries. The idea was that using `Any` would allow us to provide...
A reminder to follow up the issue previously discussed at #17.
It would be nice to have a set of benchmarks that compiled a suite of different graphs in order to track how our changes to code generation affect the compiler....
Currently gantz expects that a node's expression will always evaluate to one instance of each of its outputs. This is a bit limiting as it means we don't have any...
In some cases it may be useful for some nodes to act as evaluation "boundaries". That is, traversal for push or pull evaluation cannot pass through the node. A couple...
## Nodes Gantz allows for constructing executable directed graphs by composing together **Nodes**. **Nodes** are a way to allow users to abstract and encapsulate logic into smaller, re-usable components, similar...