| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| | |
|
| | |
|
| |
|
|
|
| |
This doesn't work either; some children are collapsed but not others
(after the first expanded child).
|
| |
|
|
|
|
| |
Collapsing is harder than expanding. This approach doesn't work because
I end up sometimes with visible lines whose parents aren't visible
anymore.
|
| |
|
|
|
|
| |
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.
|
| | |
|
| | |
|
| |
|
|
|
| |
Persist the mapping from screen row to trace index between refreshes.
Now we have to remember to refresh the mapping anytime we change state.
|
| | |
|
| | |
|
|
|
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.)
|