Marco Mihai Condrache 8044f484ca editor: Optimize TabMap chunks generation (#48378) ...

Currently, the next chunk is generated by traversing all characters of
the current folded chunk until a tab is found. Since we already have
bitmasks for characters and tabs, we can also propagate the newlines
bitmap from the rope and use it to make this computation O(1) in all
cases.

I haven’t run benchmarks yet.

Release Notes:

- N/A

2026-02-18 08:53:26 +01:00

..

benches

sum_tree: Make SumTree::append run in logarithmic time (#43349)

2025-11-24 14:49:00 +01:00

src

editor: Optimize TabMap chunks generation (#48378)

2026-02-18 08:53:26 +01:00

Cargo.toml

adds tracing for instrumenting non-async functions (#44147)

2025-12-05 17:23:06 +00:00

LICENSE-GPL

chore: Change AGPL-licensed crates to GPL (except for collab) (#4231)

2024-01-24 00:26:58 +01:00