diff options
| author | Daniel Eklöf <daniel@ekloef.se> | 2025-02-10 07:57:51 +0000 |
|---|---|---|
| committer | Daniel Eklöf <daniel@ekloef.se> | 2025-02-10 12:19:50 +0000 |
| commit | 3d66db63ccb1baab2d78e6d104a9c15d3f6684d1 (patch) | |
| tree | 0f29c885bb1d1fd0d54ab7276c8b8726d0fd5d12 /grid.h | |
| parent | url-mode: regex: don't try to NULL-terminate an invalid vline (diff) | |
grid: refactor reflow
We've been trying to performance optimize reflow by "chunking" cells;
try to gather as many as possible, and memcpy a chunk at once.
The problem is that a) this quickly becomes very complex, and b) is
very hard to get right for multi-column characters, especially when we
need to truncate long ones due to the window being too small.
Refactor, and once again walk and copy all cells one by one. This is
slower, but at least it's correct.
Diffstat (limited to 'grid.h')
| -rw-r--r-- | grid.h | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -16,7 +16,7 @@ void grid_resize_without_reflow( int old_screen_rows, int new_screen_rows); void grid_resize_and_reflow( - struct grid *grid, int new_rows, int new_cols, + struct grid *grid, const struct terminal *term, int new_rows, int new_cols, int old_screen_rows, int new_screen_rows, size_t tracking_points_count, struct coord *const _tracking_points[static tracking_points_count]); |
