aboutsummaryrefslogtreecommitdiff
path: root/runtime/syntax/python.vim
diff options
context:
space:
mode:
authorbfredl <bjorn.linse@gmail.com>2026-02-26 11:06:37 +0100
committerbfredl <bjorn.linse@gmail.com>2026-03-03 11:23:20 +0100
commit00e51d2d1c2c33c5d18c055d300cd412e8af50ad (patch)
tree1d86ab23f6507783f697a6234aa0798799135b12 /runtime/syntax/python.vim
parentb23d00ce99092a47ec188d5a3afd231b9c86d5b5 (diff)
downloadrneovim-00e51d2d1c2c33c5d18c055d300cd412e8af50ad.tar.gz
rneovim-00e51d2d1c2c33c5d18c055d300cd412e8af50ad.tar.bz2
rneovim-00e51d2d1c2c33c5d18c055d300cd412e8af50ad.zip
refactor(marktree): use better structure for damaged pairs after splice
Previous implementation used a full sort but this is unnecessary. Pairs do not need to be processed in id-order, all that we did was make "start" and "end" marks find each other. This can be done with a hash table instead. The "grow only" khash_t mentioned in the TODO is the since long merged #24985 5970157e refactor with dense value array, to not regress on memory locality.
Diffstat (limited to 'runtime/syntax/python.vim')
0 files changed, 0 insertions, 0 deletions