Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | - `Target.Noop -> Target.Test` | Li Haoyi | 2017-10-22 | 1 | -3/+14 |
| | | | | | - `Target.Test`'s output now depends on its upstream targets, and is now configurable, so you can use it to test change propagations - Move `ForgeTests`'s targets inside the `Tests` block, since they're now mutable and so shouldn't remain global | ||||
* | Add simple unit tests for `topoSortedTransitiveTargets` | Li Haoyi | 2017-10-22 | 1 | -6/+4 |
| | |||||
* | Fix `Evaluator#prepareTransitiveTargets` | Li Haoyi | 2017-10-22 | 1 | -8/+7 |
| | |||||
* | Things compile again... | Li Haoyi | 2017-10-22 | 2 | -6/+9 |
| | |||||
* | rename hbt -> forge | Li Haoyi | 2017-10-22 | 9 | -71/+85 |
| | |||||
* | - Nest `StaticContext` into `DefCtx` | Li Haoyi | 2017-10-21 | 3 | -33/+39 |
| | | | | - Implement `Target.noop`, to let us construct target graphs without needing to create dummy implementations | ||||
* | Implement `DefCtx`, to bundle together `StaticContext` and ↵ | Li Haoyi | 2017-10-21 | 4 | -26/+33 |
| | | | | `sourcecode.Enclosing` | ||||
* | Add `StaticContext` macro to let us distinguish top-level targets from ↵ | Li Haoyi | 2017-10-21 | 1 | -0/+25 |
| | | | | dynamically generated targets | ||||
* | - Convert example workflow to `javac` since `scalac` is slow | Li Haoyi | 2017-10-19 | 4 | -42/+37 |
| | | | | | - Implement `Target.Subprocess`, and use it inside `compileAll` - Move `Main` workflow into `HbtTests`, to be run using uTest | ||||
* | - Add a configurable workspace to `evaluateTargetGraph` | Li Haoyi | 2017-10-18 | 5 | -120/+136 |
| | | | | - Break up `Hbt.scala` into `Args.scala` `Target.scala` and `Evaluator.scala` | ||||
* | Basic evaluator that creates classfiles and a jar now works | Li Haoyi | 2017-10-18 | 5 | -50/+85 |
| | |||||
* | Break up `Main.scala` | Li Haoyi | 2017-10-17 | 3 | -137/+159 |
| | |||||
* | fleshed out `evaluateTargetGraph` a little | Li Haoyi | 2017-10-17 | 1 | -4/+31 |
| | |||||
* | Include Tarjan's algorithm, for doing a topological sort which elegantly ↵ | Li Haoyi | 2017-10-17 | 2 | -13/+105 |
| | | | | handles cycles | ||||
* | Create test paths and test files | Li Haoyi | 2017-10-16 | 1 | -24/+26 |
| | |||||
* | Fleshed out basic implementations | Li Haoyi | 2017-10-16 | 2 | -1/+154 |
| | |||||
* | first commit | Li Haoyi | 2017-10-16 | 1 | -0/+6 |