Re: Ideal performance of ELisp

[Stefan Monnier]

> BTW, I was being serious - if there's a way to write a simple jump to
> do case-dispatching for that trampolining while loop, I'd definitely
> look at making semantic produce such automata so the native compiler,
> in particular, could optimize the result properly.

AFAIK a (pcase x ('foo ..) ('bar ...) ...) should be compiled to
a `switch` bytecode which uses a hash-table lookup to find the
destination target to jump to.

Not sure how well it works for very large tables where we risk bumping
into the 32K limit of bytecode jumps.


        Stefan