| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2020-02-21 | Move topological sorting code to graph.ml | Thomas Bauereiss | |
| 2019-05-20 | Speed up graph construction by always keeping graph in normalized form | Brian Campbell | |
| Only checks the leaves that were added in each add_edge/add_edges call. Slicing bits of the 8.5 model went (for me) from intractable to about one second. | |||
| 2019-03-06 | Add option to slice out printing and tracing functions when generating C | Alasdair Armstrong | |
| Make instruction dependency graph use graph.ml Expose incremental graph building functions for performance in graph.mli | |||
| 2019-03-01 | WIP: Start working on being able to slice single instructions out of specs | Alasdair Armstrong | |
| 2018-08-16 | Use Set rather than Hashtbl in graph.ml | Alasdair Armstrong | |
| Removes the need for the node type to have a valid Hash function | |||
| 2018-08-13 | Add graph library graph.ml, and use to correctly sort type definitions | Alasdair | |
