about summary refs log tree commit diff stats
path: root/065duplex_list.mu
Commit message (Collapse)AuthorAgeFilesLines
* 2234 - check type of get's productKartik K. Agaram2015-10-021-10/+10
| | | | Already I'm finding type errors in the programming environment.
* 2122 - undo/redo should now be workingKartik K. Agaram2015-09-011-0/+25
|
* 2121 - undo now supports the 'delete' keyKartik K. Agaram2015-09-011-0/+79
| | | | Still to go: ctrl-k and ctrl-u.
* 2118 - start on undo deletionsKartik K. Agaram2015-08-311-0/+13
|
* 2095Kartik K. Agaram2015-08-281-1/+0
| | | | | | | | | | | | Finally terminate the experiment of keeping debug prints around. I'm also going to give up on maintaining counts. What we really need is two kinds of tracing: a) For tests, just the domain-specific facts, organized by labels. b) For debugging, just transient dumps to stdout. b) only works if stdout is clean by default. Hmm, I think this means 'stash' should be the transient kind of trace.
* 2085 - undo/redo now working for simple typingKartik K. Agaram2015-08-271-2/+5
| | | | | Not yet useable, because we never ever stop coalescing operations. That will happen when we introduce a second type of operation.
* 2084Kartik K. Agaram2015-08-271-1/+58
|
* 2082Kartik K. Agaram2015-08-261-0/+16
|
* 1909 - clean up all null pointers of that ilkKartik K. Agaram2015-07-311-36/+36
|
* 1883 - type-deducing in more .mu filesKartik K. Agaram2015-07-291-47/+47
|
* 1869 - rename the /deref property to /lookupKartik K. Agaram2015-07-281-32/+32
| | | | Should be a little bit more mnemonic.
* 1868 - start using naked literals everywhereKartik K. Agaram2015-07-281-42/+42
| | | | First step to reducing typing burden. Next step: inferring types.
* 1780 - now we always reclaim local scopesKartik K. Agaram2015-07-131-6/+6
| | | | | | But still no difference in either memory footprint or in running time. This will teach me -- for the umpteenth time -- to optimize before measuring.
* 1773 - update all mu recipes to new-default-spaceKartik K. Agaram2015-07-131-6/+6
| | | | | Turns out to not affect memory utilization or run-time. At all. But still looks nicer and requires less fudging on our part.
* 1603Kartik K. Agaram2015-06-191-6/+15
|
* 1602Kartik K. Agaram2015-06-191-21/+31
| | | | | I forgot to check for nulls before writing prev pointers in doubly linked lists. Tests were accidentally passing.
* 1594 - removing from start/end of duplex listKartik K. Agaram2015-06-181-4/+67
| | | | | | | | | | This uncovers an issue with this interface to duplex lists: the caller needs to check the result and invalidate any other pointers if it's null (i.e. the list is now empty) We *could* try to encapsulate the list in a header to help the caller manage header pointers. But heck, let's see if writing tests helps call-sites stay on the straight and narrow.
* 1593Kartik K. Agaram2015-06-181-0/+75
|
* 1592Kartik K. Agaram2015-06-181-0/+36
|
* 1591Kartik K. Agaram2015-06-181-3/+43
|
* 1590 - inserting into doubly linked listKartik K. Agaram2015-06-181-0/+62
|
* 1589 - doubly linked listKartik K. Agaram2015-06-181-0/+74