0303021abd
The optimized table formatting algorithm was still O(n) because calculating aligns required traversal to the separator line on the top of a table. This heuristic algorithm calculates aligns in O(1) in the best case by looking at cells in two rows above. Say, if two above rows are | uau | uauyaya | ya | | ua | uaua | uaaua | | <cursor> | | | then the aligns can be figured out without need to find the separator line. If aligns cannot be figured out after this fast check then the algorithm falls back to O(n) with searching for the separator line. |
||
|---|---|---|
| .. | ||
| vimwiki | ||