| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | 1423 - expand lines | Kartik K. Agaram | 2015-05-22 | 1 | -1/+34 |
| | | |||||
| * | 1422 - page-based navigation | Kartik K. Agaram | 2015-05-22 | 1 | -3/+34 |
| | | |||||
| * | 1421 - more snappy cursor movement | Kartik K. Agaram | 2015-05-22 | 1 | -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 movement | Kartik K. Agaram | 2015-05-22 | 1 | -0/+8 |
| | | |||||
| * | 1419 - trace browser displays collapsed lines | Kartik K. Agaram | 2015-05-22 | 1 | -2/+16 |
| | | |||||
| * | 1418 - starting trace-browser implementation in C++ | Kartik K. Agaram | 2015-05-22 | 1 | -0/+66 |
| 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.) | |||||