Architecture decision records¶
An ADR records one decision: the context, what we chose, and what follows from it. They are short, numbered, and never deleted. A decision that changes gets a new ADR that supersedes the old one.
| ADR | Title | Status |
|---|---|---|
| 0001 | Record architecture decisions | Accepted |
| 0002 | One internal model, many parsers | Accepted |
| 0003 | A continuation-passing walk | Accepted |
| 0004 | Approximate, and always report it | Accepted |
| 0005 | Python, with minimal dependencies | Accepted |
| 0006 | Publish as beehave-bt |
Accepted |
| 0007 | Test-driven, with a reference interpreter | Accepted |
| 0008 | Grow formats on their own track | Accepted |
| 0009 | Read BT.CPP v4 with a third continuation for SKIPPED | Accepted |
| 0010 | Read py_trees trees live, and import user code only on request | Accepted |
| 0011 | Name nodes by a stable path, and compute runtime ids from the tree | Accepted |
| 0012 | Hash the action graph and the inlined tree separately | Accepted |
| 0013 | Let the config give a custom node a preset | Accepted |
| 0014 | Leave bookkeeping actions out of the graph, and keep their results as guards | Accepted |
| 0015 | Diff action graphs by stable path, and pair moved actions | Accepted |
To propose a decision, copy the template, take the next number, and open a pull request. Discussion happens on the pull request.