Re: [w3c/IndexedDB] boolean should be a valid key (#76)

It looks like we can close this issue? Binary keys are now in IDB 2.0, and there is also a definition of the sorting algorithm [here](https://w3c.github.io/IndexedDB/#compare-two-keys):

> As a result of the above rules, negative infinity is the lowest possible value for a key. Number keys are less than date keys. Date keys are less than string keys. String keys are less than binary keys. Binary keys are less than array keys. There is no highest possible key value. This is because an array of any candidate highest key followed by another key is even higher. 

-- 
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/w3c/IndexedDB/issues/76#issuecomment-340868450