| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2012-11-21 | Some performance stuff for the solver | Carlo Zancanaro | |
| 2012-11-21 | Bug fixes for stupid things. | Carlo Zancanaro | |
| 2012-11-21 | Implementation stuff. | Zancanaro; Carlo | |
| 2012-11-09 | A bunch of changes to make it build nicer | Carlo Zancanaro | |
| In particular: - fix up the MCF sovler to get rid of all the warnings/errors - make the build with Wall and Werror and whatnot again | |||
| 2012-11-09 | Add an MCF operator to the separate solver | Carlo Zancanaro | |
| For the solver utility it'd be good to have MCF problems, so here they are! Format is: MCF<supplies, arcs>(cost*) Supplies is a [int,int,int,...], where each int represents a new node Arcs is [int:int, int:int, int:int, ...] where each int:int pair represents an edge from the first to the second (1 indexed from the "supplies" array). Costs is the argument to the function. There must be as many costs as arcs, and they are set from left to right, in order. | |||
| 2012-11-05 | Remove a bit of junk and fix up the logging again. | Carlo Zancanaro | |
| 2012-11-02 | Change to using "touched" sets, and some writing. | Carlo Zancanaro | |
| 2012-11-01 | Fixing up some equation system stuff. | Zancanaro; Carlo | |
| Adding function arguments to the system, as well as making it slightly easier to read. | |||
| 2012-11-01 | A bunch of fixes to the solver, and moving it in to clang. | Zancanaro; Carlo | |
| Also some contribution writing stuff. Basically: lots of work. | |||
| 2012-10-31 | Remove _var_influence and do some writeup | Carlo Zancanaro | |
| _var_influence was really just duplicating data that was available elsewhere, so I got rid of it. I also did some writing about the algorithm and stuff for the thesis. | |||
| 2012-10-30 | Merge branch 'master' of ssh://bitbucket.org/czan/honours | Carlo Zancanaro | |
| Conflicts: impl/test/run | |||
| 2012-10-27 | Output some timing information to stderr. | Carlo Zancanaro | |
| 2012-10-27 | Don't show stderr in tests. That's just annoying. | Carlo Zancanaro | |
| 2012-10-26 | Add some tests, and stuff. | Carlo Zancanaro | |
| 2012-10-26 | Try to make the correct solver into a local solver | Carlo Zancanaro | |
| As far as I can tell, it's worked! Hooray! | |||
| 2012-10-24 | Add a fix for mutually-recursive infinite things | Carlo Zancanaro | |
| So now it will solve correctly for x = y + 1 y = max(0, x + 1) I also added in tests for this (and a slightly different form with `x` going through another variable, `z`, for indirection). The tests will also stop now after five seconds of execution. If they can't be solved in five seconds then they're considered a failure. | |||
| 2012-10-23 | Another fix, with a test for what the problem was. | Carlo Zancanaro | |
| 2012-10-23 | Fix the merge. | Carlo Zancanaro | |
| 2012-10-23 | Merge branch 'master' of https://bitbucket.org/czan/honours | Carlo Zancanaro | |
| Conflicts: .gitignore impl/MaxStrategy.hpp impl/VariableAssignment.hpp impl/systems/test.eqns impl/test/7.eqns | |||
| 2012-10-23 | Make the recursive solver work properly. | Carlo Zancanaro | |
| If you ignore the intermediate results for the strategy iteration phase then you're in the clear! I think! | |||
| 2012-10-22 | Okay, the solver is now correct. | Carlo Zancanaro | |
| It runs in two separate passes: - improve strategy (for all) - evaluate fixpoint Unfortunately this loses out on locality at the moment. I really want a local solver, so I'll have to see what I can do about that. | |||
| 2012-10-16 | A quick fix to the solver. | Carlo Zancanaro | |
| 2012-10-15 | Some bug fixes for the solver. | Carlo Zancanaro | |
| Still doesn't work in clang, though. | |||
| 2012-10-15 | ... Assert needs some includes. | Carlo Zancanaro | |
| 2012-10-15 | Fix up to build with clang (and fix another bug) | Carlo Zancanaro | |
| - Remove exceptions - Remove dynamic casts The bug was relating to MaxStrategy not cleaning up the influence sets after propagating changes. I just added a call to .clear() and it seems fine. | |||
| 2012-09-20 | Remove exceptions and C++11 features for LLVM. | Carlo Zancanaro | |
| 2012-09-05 | Delete a lot of tex stuff, better debug info | Carlo Zancanaro | |
| Some other stuff, too, I think. Oh well. No biggie! | |||
| 2012-08-07 | Merge complete! Get onto the right branch. | Carlo Zancanaro | |
| 2012-08-07 | A whole bunch of clean up work around the place. | Carlo Zancanaro | |
| - Make it a bit nicer to use the command-line - Remove the strategies we won't be using - Clean up some code around the place, generally | |||
| 2012-08-06 | New variation on the equation system solver. | Carlo Zancanaro | |
| Much simpler to understand. Basically have a variable assignment which is dynamic and updates with the strategy changes. Similarly have strategy changes easily invalidate the variable assignment. This makes them strongly inter-dependent, but simplifies the implementation considerably. Proving it should be easier like this, too. | |||
| 2012-07-10 | Update TODO file. | Carlo Zancanaro | |
| 2012-07-10 | Modify MaxStrategy to print itself better. | Carlo Zancanaro | |
| 2012-07-10 | Clean up the building of the parser a bit. | Carlo Zancanaro | |
| 2012-07-10 | Fix the Makefile for partial compilation stuff | Carlo Zancanaro | |
| 2012-07-10 | A few other changes that were needed for tests | Carlo Zancanaro | |
| I must have forgotten to commit them earlier. How annoying. | |||
| 2012-07-10 | Move antlr. Add `make test` to Makefile. | Carlo Zancanaro | |
| 2012-07-10 | Simple test stuff - examples from the paper | Carlo Zancanaro | |
| 2012-07-09 | Few quick logging changes, just for fun. | Carlo Zancanaro | |
| 2012-07-09 | Add a bit of a TODO.org | Carlo Zancanaro | |
| 2012-07-09 | New example system. | Carlo Zancanaro | |
| 2012-07-09 | Simple little bug. | Carlo Zancanaro | |
| 2012-07-09 | Cleaning up a bit of code around the place. | Carlo Zancanaro | |
| - Especially making logging a bit nicer. | |||
| 2012-07-09 | Fix a few bugs and add a new example system. | Carlo Zancanaro | |
| 2012-07-09 | Fixed up the newer strategy iteration stuff | Carlo Zancanaro | |
| Trivial 100000 var case in 15s on my Uni machine. | |||
| 2012-07-09 | Better implementation: smarter strategy iteration | Carlo Zancanaro | |
| Also add the beginnings of some log stuff, mayhaps. | |||
| 2012-07-05 | Forgot a file! Whoops! | Carlo Zancanaro | |
| 2012-07-05 | Intermediate (broken) commit - smarter strategy | Carlo Zancanaro | |
| 2012-07-05 | Change the set to use a std::set for now | Carlo Zancanaro | |
| This should perform better in cases where we have smaller sets. | |||
| 2012-07-02 | Dependency-aware smart fixpoint. | Carlo Zancanaro | |
| Slows it down *heaps* for the moment. Still need to add the MaxStrategy part, which should speed it up a fair bit. At the moment it has to do a fair bit more work for no benefit. | |||
| 2012-06-29 | Speed up IdSet a bit. I think. | Carlo Zancanaro | |
 |
index : honours | |
| My honours project from 2012. | Carlo |
| summaryrefslogtreecommitdiff |