- From: Poul-Henning Kamp <phk@phk.freebsd.dk>
- Date: Mon, 11 Jul 2016 10:54:52 +0000
- To: duerst@it.aoyama.ac.jp
- cc: Andy Green <andy@warmcat.com>, Julian Reschke <julian.reschke@gmx.de>, Yanick Rochon <yanick.rochon@gmail.com>, Phil Hunt <phil.hunt@oracle.com>, HTTP Working Group <ietf-http-wg@w3.org>
-------- >> You also avoid the O(N^2) search operation to see if split headers >> happened in the first place. > >There are many well-known data structures that avoid O(n^2). Yes, and they're probably all overkill in the typical N<20 case of HTTP headers... -- Poul-Henning Kamp | UNIX since Zilog Zeus 3.20 phk@FreeBSD.ORG | TCP/IP since RFC 956 FreeBSD committer | BSD since 4.3-tahoe Never attribute to malice what can adequately be explained by incompetence.
Received on Monday, 11 July 2016 10:55:48 UTC