27712 2014-12-28 19:58:12 +0000 IndexedDB: Array comparison algorithm doesn't handle empty arrays 2015-01-13 23:47:03 +0000 1 1 1 Unclassified WebAppsWG Indexed Database API unspecified PC Windows NT RESOLVED FIXED P2 normal --- 1 n210241048576 jsbell jsbell mike public-webapps r.t.h1.0.9.0.h public-webapps-bugzilla oldest_to_newest 116702 0 n210241048576 2014-12-28 19:58:12 +0000 The array comparison algorithm says to compare the first element of the arrays before checking the length, which means that it doesn't work for empty arrays, despite empty arrays being valid keys. Let A be the first Array value and B be the second Array value. Let length be the lesser of A's length and B's length. Let i be 0. If the ith value of A is less than the ith value of B, then A is less than B. Skip the remaining steps. If the ith value of A is greater than the ith value of B, then A is greater than B. Skip the remaining steps. Increase i by 1. If i is not equal to length, go back to step 4. Otherwise continue to next step. If A's length is less than B's length, then A is less than B. If A's length is greater than B's length, then A is greater than B. Otherwise A and B are equal. 116894 1 jsbell 2015-01-07 18:52:06 +0000 Simplest fix: insert new step 3 and update 4->5 1. Let A be the first Array value and B be the second Array value. 2. Let length be the lesser of A's length and B's length. 3. If length is 0, go to step 9. 4. Let i be 0. 5. If the ith value of A is less than the ith value of B, then A is less than B. Skip the remaining steps. 6. If the ith value of A is greater than the ith value of B, then A is greater than B. Skip the remaining steps. 7. Increase i by 1. 8. If i is not equal to length, go back to step 5. Otherwise continue to next step. 9. If A's length is less than B's length, then A is less than B. If A's length is greater than B's length, then A is greater than B. Otherwise A and B are equal. Alternately: 1. Let A be the first Array value and B be the second Array value. 2. Let length be the lesser of A's length and B's length. 3. Let i be 0. 4. If i is equal to length, go to step 9. Otherwise continue to next step. 5. If the ith value of A is less than the ith value of B, then A is less than B. Skip the remaining steps. 6. If the ith value of A is greater than the ith value of B, then A is greater than B. Skip the remaining steps. 7. Increase i by 1. 8. Go back to step 4. 9. If A's length is less than B's length, then A is less than B. If A's length is greater than B's length, then A is greater than B. Otherwise A and B are equal. Or using a 'while' loop: 1. Let A be the first Array value and B be the second Array value. 2. Let length be the lesser of A's length and B's length. 3. Let i be 0. 4. While i is less than length: 1. If the ith value of A is less than the ith value of B, then A is less than B. Skip the remaining steps. 2. If the ith value of A is greater than the ith value of B, then A is greater than B. Skip the remaining steps. 3. Increase i by 1. 5. If A's length is less than B's length, then A is less than B. If A's length is greater than B's length, then A is greater than B. Otherwise A and B are equal. I can fix in the ED if someone wants to select and sanity-check one of the above. 117118 2 jsbell 2015-01-13 23:47:03 +0000 Addressed in https://github.com/w3c/IndexedDB/commit/377b979783857cc6b37b769119cafe5c9af58228