On Friday, May 23rd, 2025 at 2:48 PM, Zhihao Yuan via Std-Proposals <std-proposals@lists.isocpp.org> wrote:
[...] Double-array compile-time Trie and compile-
time string binary search leads to a slightly different
kind of strategies where each action to emit
after a search hit is a goto address as opposes to
a final computed goto,
Errata: DA Trie also needs to use computed goto
(because it is data structure-based). Binary
search can use static goto because the search
branches are unrolled.
--
Zhihao Yuan, ID lichray
The best way to predict the future is to invent it.
_______________________________________________