about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* 493Kartik K. Agaram2015-01-021-0/+2
|
* 492 - make chessboard more self-containedKartik K. Agaram2015-01-022-10/+16
|
* 491Kartik K. Agaram2015-01-021-0/+5
|
* 490Kartik K. Agaram2015-01-021-2/+2
|
* 489 - first regression in chessboardKartik K. Agaram2015-01-022-3/+4
| | | | Amazing how quickly we need tests or manual QA.
* 488Kartik K. Agaram2015-01-021-1/+7
|
* 487Kartik K. Agaram2015-01-021-1/+18
|
* 486Kartik K. Agaram2015-01-022-3/+3
|
* 485Kartik K. Agaram2015-01-021-29/+0
|
* 484Kartik K. Agaram2015-01-021-0/+2
|
* 482 - cleanupKartik K. Agaram2015-01-022-102/+101
| | | | | 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. Agaram2015-01-022-106/+106
|
* 480 - trying to speed up chessboardKartik K. Agaram2015-01-023-37/+211
| | | | | | 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.
* 479Kartik K. Agaram2015-01-023-172/+64
|
* 478 - snapshot while debugging chessboardKartik K. Agaram2015-01-013-64/+226
| | | | | | | | | | | | | | | | | | | | | | 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 appKartik K. Agaram2014-12-312-4/+108
|
* 476Kartik K. Agaram2014-12-311-2/+3
|
* 475 - support symbol literals, just as a convenienceKartik K. Agaram2014-12-312-1/+10
|
* 474Kartik K. Agaram2014-12-311-0/+88
|
* 473 - print chessboardKartik K. Agaram2014-12-311-9/+32
| | | | | | | | Once we started printing we uncovered that we were storing positions by rank rather than by file as we'd planned. Amazing how slow it is. Might be interesting to try to compile it down to straightforward assembler and see how fast it gets.
* 472Kartik K. Agaram2014-12-302-10/+50
|
* 471 - experiment: chessboard appKartik K. Agaram2014-12-302-0/+65
| | | | | | No tests. Let's have some fun. As a first step, a 'list-length' function. Iterative version is 25% faster than recursive (60 vs 45 seconds).
* 470Kartik K. Agaram2014-12-301-1/+1
|
* 469 - warn on the bug of 464Kartik K. Agaram2014-12-301-0/+2
|
* 468 - slice test time by 65%Kartik K. Agaram2014-12-302-26/+27
| | | | | We achieve this by separating out the freezing of system software, which we needed to do anyway to address the duplication in 'init-fn'.
* 467 - 'convert-names' now supports space metadataKartik K. Agaram2014-12-302-19/+106
| | | | | | | | | To inform it about space metadata you have to tag environments with the function that generated them. Every function can only ever be called with environments generated by a single function. As an assembly-like language, mu requires closures to be called with an explicit environment, but it warns when the environment might not be what the function expects.
* 466Kartik K. Agaram2014-12-301-1/+0
|
* 465Kartik K. Agaram2014-12-301-5/+6
|
* 464 - reply broken in channel 'write'Kartik K. Agaram2014-12-302-1/+5
| | | | | | | | | | How did this work until now? The reply was being treated as a label, and if 'write' returned nothing it would still work fine because the output is already present, and a missing 'reply' leaves oargs as-is. Should we do something to catch this? Perhaps we should track args modified and check that there are oargs for them. But that seems quite heavyweight.. Maybe we should clear oargs when missing a 'reply'?
* 463 - mu now has closuresKartik K. Agaram2014-12-302-7/+44
|
* 462Kartik K. Agaram2014-12-291-1/+1
|
* 461 - create room for an index '0' in scopesKartik K. Agaram2014-12-292-22/+31
| | | | This wasn't working until I fixed 459.
* 460Kartik K. Agaram2014-12-291-2/+2
|
* 459 - stop recycling memory between routinesKartik K. Agaram2014-12-291-2/+7
| | | | | I forgot that we have a test with multiple calls to 'run' without intervening 'reset'.
* 458Kartik K. Agaram2014-12-281-4/+4
|
* 457 - finally, redirection worksKartik K. Agaram2014-12-282-13/+32
| | | | | No need for a separate channels array; just pass channels in globals. The global space is a superset of unix's fd array.
* 456 - routines can now have routine globalsKartik K. Agaram2014-12-282-8/+30
| | | | But we don't do nonsense like copy all state from the parent routine.
* 455Kartik K. Agaram2014-12-281-3/+2
|
* 454Kartik K. Agaram2014-12-281-2/+5
|
* 453Kartik K. Agaram2014-12-282-36/+36
|
* 452Kartik K. Agaram2014-12-281-2/+4
|
* 451 - start of support for per-routine globalsKartik K. Agaram2014-12-272-0/+33
|
* 450Kartik K. Agaram2014-12-271-8/+1
|
* 449Kartik K. Agaram2014-12-271-2/+2
|
* 448Kartik K. Agaram2014-12-262-15/+15
|
* 447 - function invocations can share localsKartik K. Agaram2014-12-261-0/+27
| | | | | This is the first step to creating closures. That requires specifying the lexical scope 'frame' to read a variable from.
* 446Kartik K. Agaram2014-12-252-2/+19
| | | | | | | | Clear up that ancient todo. We don't particularly care about what abstraction we write tests at, as long as we do so at *some* layer and document the intent. That lets us move tests up or down in the future when we know more/have better taste.
* 445Kartik K. Agaram2014-12-251-0/+2
|
* 444 - bring back dispatch based on operand/result typesKartik K. Agaram2014-12-242-6/+115
| | | | | | | | | | | Was dropped in commit 149. But we need it for more convenient overloading, especially now that the right way to build tagged-values is unclear. The original concern was that type/otype would make code harder to 'assemble' down to native. But we should be able to insert CALL instructions to the right clause inside a function's code. So keep it around in the toolbox.
* 443 - simple graphics primitivesKartik K. Agaram2014-12-232-0/+37
| | | | | | | http://docs.racket-lang.org/graphics/Mouse_Operations.html Like with the text mode primitives, we still don't have a story for writing white-box tests for code using these.
generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-07-02 06:53:08 +0000