- From: Kari hurtta <hurtta-ietf@elmme-mailer.org>
- Date: Tue, 28 Jun 2016 19:09:45 +0300 (EEST)
- To: HTTP working group mailing list <ietf-http-wg@w3.org>
- CC: Kari hurtta <hurtta-ietf@elmme-mailer.org>, Mike Bishop <Michael.Bishop@microsoft.com>, Mark Nottingham <mnot@mnot.net>
https://tools.ietf.org/html/draft-ietf-httpbis-http2-encryption-06#section-6 | o The root object contains a member whose name is a case-insensitive | character-for-character match for the origin in question, | serialised into Unicode as per Section 6.1 of [RFC6454], and whose | value is an object (hereafter, the "origin object"), If there is several members whose name is a case-insensitive character-for-character match for the origin in question, which one is the origin object ? First, Last ? Is this invalid ? https://tools.ietf.org/html/rfc7159#section-4 | An object whose names are all unique is interoperable in the sense | that all software implementations receiving that object will agree on | the name-value mappings. When the names within an object are not | unique, the behavior of software that receives such an object is | unpredictable. Many implementations report the last name/value pair | only. Other implementations report an error or fail to parse the | object, and some implementations report all of the name/value pairs, | including duplicates. Even when all member names are unique, there can be several members which are case-insensitive character-for-character match for the origin in question. I think thare there is perhaps 4 different possible implementatio startego for this (if this is not specified) 1) Pick first matching member 2) Pick last matching member 3) Treat "http-opportunistic" as invalid 4) Merge some way all matching members / Kari Hurtta
Received on Tuesday, 28 June 2016 16:10:25 UTC