optimize readAndApplyDeleteSet performance on large deletes
When calling applyUpdate with large text and many deletes, frequent structs.splice calls become a performance bottleneck. To improve this, we replace the repeated splice operations by rebuilding the structs array from scratch — combining the existing and newly added structs — while preserving the same side effects as before.
Can you please make sure that the tests run?
Also, do you have some numbers / test-cases that confirm that this improves performance? Does this decrease performance in some cases?
Can you please make sure that the tests run?
Also, do you have some numbers / test-cases that confirm that this improves performance? Does this decrease performance in some cases?
Sure, I will make sure tests run and do some performance testing when I get some free time soon.