taler/wallet-core
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Activity

idb: make test pass

Browse Source
This commit is contained in:
Florian Dold 2019-06-25 14:31:48 +02:00
parent df5619236b
commit bf52d4b844
No known key found for this signature in database
GPG Key ID: D2E4F00F29D02A4B
1 changed files with 14 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
packages/idb-bridge/src/MemoryBackend.ts
View File

@ -780,16 +780,19 @@ export class MemoryBackend implements Backend {
) { ) {
let pos = forward ? 0 : indexEntry.primaryKeys.length - 1; let pos = forward ? 0 : indexEntry.primaryKeys.length - 1;
console.log("number of primary keys", indexEntry.primaryKeys.length); console.log("number of primary keys", indexEntry.primaryKeys.length);
console.log("start pos is", pos);
// Advance past the lastObjectStorePosition // Advance past the lastObjectStorePosition
do { do {
const cmpResult = compareKeys( const cmpResult = compareKeys(
req.lastObjectStorePosition, req.lastObjectStorePosition,
indexEntry.primaryKeys[pos], indexEntry.primaryKeys[pos],
); );
console.log("cmp result is", cmpResult);
if ((forward && cmpResult < 0) || (!forward && cmpResult > 0)) { if ((forward && cmpResult < 0) || (!forward && cmpResult > 0)) {
break; break;
} }
pos += forward ? 1 : -1; pos += forward ? 1 : -1;
console.log("now pos is", pos);
} while (pos >= 0 && pos < indexEntry.primaryKeys.length); } while (pos >= 0 && pos < indexEntry.primaryKeys.length);
// Make sure we're at least at advancedPrimaryPos // Make sure we're at least at advancedPrimaryPos
@ -812,7 +815,8 @@ export class MemoryBackend implements Backend {
primkeySubPos = forward ? 0 : indexEntry.primaryKeys.length - 1; primkeySubPos = forward ? 0 : indexEntry.primaryKeys.length - 1;
} }
console.log("pos=", primkeySubPos); console.log("subPos=", primkeySubPos);
console.log("indexPos=", indexPos);
while (1) { while (1) {
if (req.limit != 0 && numResults == req.limit) { if (req.limit != 0 && numResults == req.limit) {
@ -831,12 +835,13 @@ export class MemoryBackend implements Backend {
primkeySubPos < 0 || primkeySubPos < 0 ||
primkeySubPos >= indexEntry.primaryKeys.length primkeySubPos >= indexEntry.primaryKeys.length
) { ) {
console.log("moving subkey forward"); const res = forward
primkeySubPos = forward ? 0 : indexEntry.primaryKeys.length - 1; ? indexData.nextHigherPair(indexPos)
const res = indexData.nextHigherPair(indexPos); : indexData.nextLowerPair(indexPos);
if (res) { if (res) {
indexPos = res[1].indexKey; indexPos = res[1].indexKey;
indexEntry = res[1]; indexEntry = res[1];
primkeySubPos = forward ? 0 : indexEntry.primaryKeys.length - 1;
} else { } else {
break; break;
} }
@ -862,9 +867,12 @@ export class MemoryBackend implements Backend {
} }
} }
if (!skip) { if (!skip) {
console.log(`not skipping!, subPos=${primkeySubPos}`);
indexKeys.push(indexEntry.indexKey); indexKeys.push(indexEntry.indexKey);
primaryKeys.push(indexEntry.primaryKeys[primkeySubPos]); primaryKeys.push(indexEntry.primaryKeys[primkeySubPos]);
numResults++; numResults++;
} else {
console.log("skipping!");
} }
primkeySubPos += forward ? 1 : -1; primkeySubPos += forward ? 1 : -1;
} }
@ -873,6 +881,8 @@ export class MemoryBackend implements Backend {
// if requested. // if requested.
if (req.resultLevel === ResultLevel.Full) { if (req.resultLevel === ResultLevel.Full) {
for (let i = 0; i < numResults; i++) { for (let i = 0; i < numResults; i++) {
console.log("getting value for index", i);
console.log("with key", primaryKeys[i]);
const result = storeData.get(primaryKeys[i]); const result = storeData.get(primaryKeys[i]);
if (!result) { if (!result) {
throw Error("invariant violated"); throw Error("invariant violated");