| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
| |
Fix possibly-exponential runtime for DFS graph searches.
Improve DFA fixpoint algorithm to correctly compute worklist
of only changed nodes for each iteration.
Added test that takes > 2 minutes to compile without these
improvements.
|
|
|
|
| |
2013 must have been unlucky.
|
|
|
|
|
| |
These are are at odds with the junit-interface SBT test framework
under SBT 0.13.+, and appear to be superfluous.
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
| |
- Enable continuations plugin
- Fill in project metadata
- Enable stricter compiler options
- satisfy -Xlint with some empty parens.
|
|
- Convert tests to use JUnit
- For the 'run' tests, just use plain-old-test-cases
- Add a sample 'neg' test to use ToolBoxes to compile code snippets on the fly.
|