summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCarlo Zancanaro <carlo@pc-4w14-0.cs.usyd.edu.au>2012-07-09 18:24:23 +1000
committerCarlo Zancanaro <carlo@pc-4w14-0.cs.usyd.edu.au>2012-07-09 18:24:23 +1000
commitfcc8fc238754b6cf1bd7ac394de44ee30c50d6f7 (patch)
tree3d69e9ca9b6fa6c595ad63027758b8d3abd6fe0c
parent0adfb1ac4e3175aabca462f7113adf94e6687b7a (diff)
Add a bit of a TODO.org
-rw-r--r--impl/TODO.org57
1 files changed, 57 insertions, 0 deletions
diff --git a/impl/TODO.org b/impl/TODO.org
new file mode 100644
index 0000000..fe7acee
--- /dev/null
+++ b/impl/TODO.org
@@ -0,0 +1,57 @@
+* TODO Refactoring [1/4]
+- [X] Fix up logging
+- [ ] Separate classes into files
+- [ ] Put outer-loop in a class (out of main)
+- [ ] Give EquationSystem methods for creating assignments/strategies
+
+* TODO Verbosity [2/3]
+- [X] Wrap output streams [5/5]
+ - [X] strategies
+ - [X] fixpoint
+ - [X] debug
+ - [X] trace
+ - [X] info
+- [X] Command-line arguments [5/5]
+ - [X] strategies
+ - [X] fixpoint
+ - [X] debug
+ - [X] trace
+ - [X] info
+- [ ] Provide output [0/5]
+ - [ ] strategies
+ print the system and assignment, then the next strategy
+ print each strategy like this:
+ max(0, x, sub(y,2)) -> sub(y,2)
+ - [ ] fixpoint
+ print the system we're working with, then print the resultant assignment
+ - [ ] debug
+ print the initial system we're working with
+ print more general info in the main loop (number of loops, each assignment/strategy)
+ - [ ] trace
+ maybe we don't need this
+ would be something like "entering/exiting" everything mildly important
+ - [ ] info
+ print the initial system we're working with
+
+* TODO make test [0/4]
+- [ ] write test cases [/]
+ - [ ] best cases
+ - [ ] worst cases
+ - [ ] average cases
+- [ ] work out correct outputs for each test case
+- [ ] write a script to run over each test case and return pass/fail
+- [ ] consolidate into makefile as `make test`
+
+* TODO Parametrise EquationSystem for Variable, too [0/1]
+- [ ] Give EquationSystem a template parameter for Variable
+ I don't think this is necessary, but Thomas wants it
+
+* TODO Min-cost flow problem [0/3]
+- [ ] Research min-cost flow libraries
+ Potentially just use LEMON? It looks pretty decent.
+- [ ] Implement the min-cost flow operator MCF
+- [ ] Update test cases to include MCF
+
+* TODO Presentation [0/2]
+- [ ] Simplify "Even Faster" solver for explanation
+- [ ] Make slides