Thomas Leitner
@gettalong.bsky.social
(Open source) Software developer, creator of kramdown and HexaPDF, Sci-Fi fan.
If you are using KDE, you should be able to just configure this system-wide for all KDE based apps.
June 10, 2025 at 2:29 PM
If you are using KDE, you should be able to just configure this system-wide for all KDE based apps.
So I have been working on something lately, lightweight markup related.
Turns out it's at least 4 times faster than kramdown when parsing the same document (n.b. a bit of an apple to banana comparison as kramdown can do much more at the moment but still 🤯)
Turns out it's at least 4 times faster than kramdown when parsing the same document (n.b. a bit of an apple to banana comparison as kramdown can do much more at the moment but still 🤯)
March 12, 2025 at 10:31 PM
So I have been working on something lately, lightweight markup related.
Turns out it's at least 4 times faster than kramdown when parsing the same document (n.b. a bit of an apple to banana comparison as kramdown can do much more at the moment but still 🤯)
Turns out it's at least 4 times faster than kramdown when parsing the same document (n.b. a bit of an apple to banana comparison as kramdown can do much more at the moment but still 🤯)
Ah, I forgot up that - thank you! You can further optimize it by using a constant empty array and doing `array[from, size] = EMPTY_ARRAY`.
I did a benchmark comparing pop, slice! and your method using benchmark-driver. Interestingly pop was faster even though it creates arrays.
I did a benchmark comparing pop, slice! and your method using benchmark-driver. Interestingly pop was faster even though it creates arrays.
![Warming up --------------------------------------
pop 5.802M i/s - 6.040M times in 1.041085s (172.36ns/i, 187clocks/i)
slice! 4.235M i/s - 4.459M times in 1.052689s (236.11ns/i, 625clocks/i)
[]= 5.158M i/s - 5.168M times in 1.001836s (193.86ns/i, 211clocks/i)
Calculating -------------------------------------
pop 5.946M i/s - 17.406M times in 2.927538s (168.19ns/i, 426clocks/i)
slice! 4.100M i/s - 12.706M times in 3.098945s (243.90ns/i, 738clocks/i)
[]= 5.415M i/s - 15.475M times in 2.857926s (184.68ns/i, 808clocks/i)
Comparison:
pop: 5945557.8 i/s
[]=: 5414702.4 i/s - 1.10x slower
slice!: 4100124.2 i/s - 1.45x slower](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:nmyvn4engnv6gptvqkwoo2bn/bafkreidqmq24qx4mi2bb72vhmh2vb6i32qmddm36masl6twu5qbguk2mfm@jpeg)
March 11, 2025 at 10:41 PM
Ah, I forgot up that - thank you! You can further optimize it by using a constant empty array and doing `array[from, size] = EMPTY_ARRAY`.
I did a benchmark comparing pop, slice! and your method using benchmark-driver. Interestingly pop was faster even though it creates arrays.
I did a benchmark comparing pop, slice! and your method using benchmark-driver. Interestingly pop was faster even though it creates arrays.
