Re: QPACK and the Static Table

On Thu, May 24, 2018 at 05:53:14PM +0000, Roberto Peon wrote:
> One could make the lookup (more) efficient by storing the index (a
> byte at most) with the key-value pair, where the key-value pair were
> sorted via whatever sorting you'd find most efficient.  If reordering
> allows for some increased efficiency without increasing bits-on-wire,
> I'd think it seems reasonable to change.

Lookup efficiency should be a marginal consideration.  The table has
only a few dozen entries.  There are ways to compile the static table
to make lookups faster (for example, by using a perfect hash) if one
is bothered by doing a simple scan.

  - Dmitri.