about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* 1438Kartik K. Agaram2015-05-231-0/+42
|
* 1437Kartik K. Agaram2015-05-231-1/+1
|
* 1436Kartik K. Agaram2015-05-233-3/+8
|
* 1435Kartik K. Agaram2015-05-231-3/+7
|
* 1434 - support all unicode spacesKartik K. Agaram2015-05-237-21/+128
|
* 1433 - 'trim' stringsKartik K. Agaram2015-05-231-0/+96
|
* 1432 - contrast scenarios and recipesKartik K. Agaram2015-05-231-2/+3
|
* 1431Kartik K. Agaram2015-05-231-3/+3
|
* 1430Kartik K. Agaram2015-05-221-1/+9
|
* 1429 - third, possibly successful impl of collapseKartik K. Agaram2015-05-221-10/+5
|
* 1428 - second attemptKartik K. Agaram2015-05-221-4/+1
| | | | | This doesn't work either; some children are collapsed but not others (after the first expanded child).
* 1427 - first attempt at collapsing linesKartik K. Agaram2015-05-221-0/+27
| | | | | | Collapsing is harder than expanding. This approach doesn't work because I end up sometimes with visible lines whose parents aren't visible anymore.
* 1426Kartik K. Agaram2015-05-221-4/+0
| | | | | | As often happens, the asserts I come up with fail to survive contact with reality. In this case because the current line may not have anything left to expand.
* 1425Kartik K. Agaram2015-05-221-0/+1
|
* 1424 - the right way to make autogenerated_listsKartik K. Agaram2015-05-221-1/+2
| | | | | Ever since 1403 mu depended on a phony target and so was always considered stale. This commit improves on that fix.
* 1423 - expand linesKartik K. Agaram2015-05-221-1/+34
|
* 1422 - page-based navigationKartik K. Agaram2015-05-221-3/+34
|
* 1421 - more snappy cursor movementKartik K. Agaram2015-05-221-4/+16
| | | | | Persist the mapping from screen row to trace index between refreshes. Now we have to remember to refresh the mapping anytime we change state.
* 1420 - first steps in cursor movementKartik K. Agaram2015-05-221-0/+8
|
* 1419 - trace browser displays collapsed linesKartik K. Agaram2015-05-221-2/+16
|
* 1418 - starting trace-browser implementation in C++Kartik K. Agaram2015-05-222-1/+69
| | | | | | | | | I still have no idea how it will hook up to the rest. Parsing traces will be slow. I can't test it like this. Writing the large trace data structure to mu memory will be slow. But let's at least see the new algorithm in action. (Not in this commit; so far we just render the first n lines from the chessboard trace, and wait for a 'q' or 'Q' to quit.)
* 1417 - draft zoom levels in tracesKartik K. Agaram2015-05-2113-43/+83
|
* 1416Kartik K. Agaram2015-05-213-27/+36
|
* 1415Kartik K. Agaram2015-05-211-25/+3
|
* 1414 - traces now robust to new recipes/typesKartik K. Agaram2015-05-2123-325/+137
|
* 1413Kartik K. Agaram2015-05-212-67/+15
|
* 1412 - starting to clean up trace formatKartik K. Agaram2015-05-213-193/+28
| | | | | Many features of my trace layer were just inherited blindly from wart but lying unused in this project. Throw them out while we're at it.
* 1411Kartik K. Agaram2015-05-201-2/+5
|
* 1410Kartik K. Agaram2015-05-201-1/+2
|
* 1409Kartik K. Agaram2015-05-191-1/+1
|
* 1408Kartik K. Agaram2015-05-192-9/+9
|
* 1407Kartik K. Agaram2015-05-192-5/+5
|
* 1406Kartik K. Agaram2015-05-191-0/+5
|
* 1405Kartik K. Agaram2015-05-192-3/+9
|
* 1404 - undefined-behavior checks using clangKartik K. Agaram2015-05-182-2/+10
| | | | | | | | While I'm at it I also explored turning on optimization. With optimization compile+test of the chessboard app takes 10+3s, while without optimization it takes 3+8s. So we're still better off without optimizations in a tight debug loop. (Since we stopped tracing the big chessboard test.)
* 1403Kartik K. Agaram2015-05-181-7/+6
|
* 1402Kartik K. Agaram2015-05-181-4/+6
|
* 1401 - shave 80% off chessboard test timeKartik K. Agaram2015-05-183-1/+15
| | | | It was all going to laboriously writing out 300+ MB to disk.
* 1400Kartik K. Agaram2015-05-181-5/+5
|
* 1399 - better 'unknown type' warningsKartik K. Agaram2015-05-185-14/+100
| | | | | | | | Implement warnings for types without definitions without constraining where type definitions must appear. We also eliminate the anti-pattern where a change in layer 10 had its test in layer 11 (commit 1383).
* 1398Kartik K. Agaram2015-05-181-2/+23
|
* 1397 - support unicode in screen checksKartik K. Agaram2015-05-182-31/+103
|
* 1396Kartik K. Agaram2015-05-171-16/+40
|
* 1395Kartik K. Agaram2015-05-171-3/+2
|
* 1394Kartik K. Agaram2015-05-171-2/+2
|
* 1393Kartik K. Agaram2015-05-171-0/+18
|
* 1391 - avoid unsigned integersKartik K. Agaram2015-05-1737-331/+365
|
* 1390 - support non-integer literalsKartik K. Agaram2015-05-175-24/+60
| | | | | | | | | | | | | | | | | | | | Since '3.14159:literal' looks ugly, we'll just say '3.14159'. It's not like non-integers can be confused for anything but literals. Once I tried to turn reagent values into doubles, I uncovered a bug: arithmetic using signed integers is busted; if either operand of subtraction is unsigned the result is unsigned as well. If it needs to be negative: ka-boom. It was only masked because I was eventually storing the result in a long long int, where it was out of range, and so overflowing into the correct signed value. Once I switched to doubles the unsigned value would indeed fit without overflowing. Ka-boom. Yet another reminder that unsigned integers suck. I started using them mostly to avoid warnings in loops when comparing with .size(), which is usually a size_t. Who knows what other crap lurks here. Just use signed integers everywhere. (And avoid bitwise operators.)
* 1389Kartik K. Agaram2015-05-162-3/+3
|
* 1388Kartik K. Agaram2015-05-161-0/+1
|