- From: Eliot Graff <Eliot.Graff@microsoft.com>
- Date: Fri, 19 Aug 2011 21:57:42 +0000
- To: Jonas Sicking <jonas@sicking.cc>, Jim Jewett <jimjjewett@gmail.com>
- CC: "public-webapps@w3.org" <public-webapps@w3.org>
> > According to the text, I would expect negative infinity to be the > > lowest possible key, and the highest possible key to be undefined > > (because an array of any candidate highest key followed by another > > valid key would be even higher) > > Yes. You are correct. > > / Jonas > I rewrote the note to say the following and published to the Editor's Draft: As a result of the above rules, negative infinity is the lowest possible value for a key. There is no highest possible key value. This is because an array of any candidate highest key followed by another valid key is even higher. Thanks so much, Eliot
Received on Friday, 19 August 2011 21:58:12 UTC