| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | 492 - make chessboard more self-contained | Kartik K. Agaram | 2015-01-02 | 1 | -2/+11 |
| | | |||||
| * | 489 - first regression in chessboard | Kartik K. Agaram | 2015-01-02 | 1 | -1/+2 |
| | | | | | Amazing how quickly we need tests or manual QA. | ||||
| * | 488 | Kartik K. Agaram | 2015-01-02 | 1 | -1/+7 |
| | | |||||
| * | 487 | Kartik K. Agaram | 2015-01-02 | 1 | -1/+18 |
| | | |||||
| * | 486 | Kartik K. Agaram | 2015-01-02 | 1 | -3/+1 |
| | | |||||
| * | 485 | Kartik K. Agaram | 2015-01-02 | 1 | -29/+0 |
| | | |||||
| * | 482 - cleanup | Kartik K. Agaram | 2015-01-02 | 1 | -29/+29 |
| | | | | | | Now chessboard is faster than in my super-late-bound language (https://gist.github.com/akkartik/1291243). Reassuring. | ||||
| * | 481 - oh of course: 'int-canon.memory*' | Kartik K. Agaram | 2015-01-02 | 1 | -5/+5 |
| | | |||||
| * | 480 - trying to speed up chessboard | Kartik K. Agaram | 2015-01-02 | 1 | -33/+34 |
| | | | | | | | Computing length of a 32-long list takes 2x a 16-long list. But 64-long takes 3x 32-long. Why? No idea yet. No insights from counting calls. | ||||
| * | 479 | Kartik K. Agaram | 2015-01-02 | 1 | -46/+44 |
| | | |||||
| * | 478 - snapshot while debugging chessboard | Kartik K. Agaram | 2015-01-01 | 1 | -41/+82 |
| | | | | | | | | | | | | | | | | | | | | | | | This took a couple of hours to track down. I had to shrink down to a 2x2 chessboard, isolate a half-move (just a square to clear) that triggered an error, then hard-code the half-move to make it non-interactive, then copy my changes over to the non-cursor version in chessboard.mu, then start debugging trace. And then I found I was using an 'index-address' rather than 'index' to go from a board to a file-address inside 'make-move'. And that was corrupting the array of file pointers. Things I wish I had to help me here: a) a type checker. b) more speed. Are lists slowing down super-linearly? need an arc profiler. c) a side channel for traces even when the program is in cursor mode. I do have that (hence the 'new-trace' before calling main), but for some reason it wasn't convenient. Just had to buckle down, I think. d) the right '#ifdef's to switch between hard-coded move and interactive move, text vs cursor mode, etc. e) just in general better curation of traces to easily see what's going on. But that's just a pipe dream. | ||||
| * | 477 - reading moves in the chessboard app | Kartik K. Agaram | 2014-12-31 | 1 | -2/+82 |
| | | |||||
| * | 474 | Kartik K. Agaram | 2014-12-31 | 1 | -0/+88 |