No longer any allocations, we use sorted vectors for lookup.
Init sorted vectors lazy, but no longer as lazy that mutable members are needed.
Details
Details
make && make test works
perf looks nicer afterwards
Diff Detail
Diff Detail
- Lint
Lint Skipped - Unit
Unit Tests Skipped
Comment Actions
And yes, the skip offset lookup is still deadly ;=)
8.27% 8.27% highlighter_ben libKF5SyntaxHighlighting.so.5.50.0 [.] QHash<KSyntaxHighlighting::Rule*, int>::findNode
Comment Actions
Avoid saving the implicit capture group 0 on each regex match.
That avoids allocating the match string each time (and the non-empty list).
One anyways shall only access capture group >= 1