RetroSearch Browse

Thu Jun 29 16:25:03 CEST 2006 · https://mail.python.org/pipermail/python-dev/2006-June/066770.html

On 6/29/06, Nick Coghlan <ncoghlan at gmail.com> wrote:
> You mean something like this?:
>
>    switch x in colours:
>      case RED:
>          # whatever
>      case GREEN:
>          # whatever
>      case BLUE:
>          # whatever
>
> I think Guido's right. It doesn't solve the underlying problem because the
> compiler still has to figure out how to build a dispatch table from the
> possible values in colours to the actual bytecode offsets of the cases.

To implement this, you actually need two lookup tables: one particular
to the switch that maps labels to bytecode offsets, and one in the
dispatch table to map values to labels.  The former is built when the
switch is compiled, and the latter is built wherever the dispatch
table is defined.  Each lookup is still O(1), so the whole operation
remains O(1).

It is O(n) or worse to check that all of the cases in the switch are
defined in the dispatch table, but that only has to be done once per
dispatch table/switch statement pair, and can then be stred in one or
the other (probably the dispatch table, as that will be a proper
object).

  -- Eric Sumner

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://mail.python.org/pipermail/python-dev/2006-June/066770.html below:

[Python-Dev] PEP 3103: A Switch/Case Statement