fix(NextcloudBookmarks): Partial tree loading was broken

Signed-off-by: Marcel Klehr <[email protected]>

Author: marcelklehr

src/lib/Tree.ts

@@ -78,6 +78,12 @@ export class Bookmark<L extends TItemLocation> {
     return 0
   }
 
+  setHashCacheValue(hashSettings: IHashSettings, value: string): void {
+    const cacheKey = `${hashSettings.preserveOrder}-${hashSettings.hashFn}`
+    if (!this.hashValue) this.hashValue = {}
+    this.hashValue[cacheKey] = value
+  }
+
   async hash({preserveOrder = false, hashFn = 'sha256'}):Promise<string> {
     if (!this.hashValue) {
       this.hashValue = {}
@@ -313,6 +319,12 @@ export class Folder<L extends TItemLocation> {
     return 0
   }
 
+  setHashCacheValue(hashSettings: IHashSettings, value: string): void {
+    const cacheKey = `${hashSettings.preserveOrder}-${hashSettings.hashFn}`
+    if (!this.hashValue) this.hashValue = {}
+    this.hashValue[cacheKey] = value
+  }
+
   async hash({preserveOrder = false, hashFn = 'sha256'}: IHashSettings = {preserveOrder: false, hashFn: 'sha256'}): Promise<string> {
     const cacheKey = `${preserveOrder}-${hashFn}`
     if (this.hashValue && typeof this.hashValue[cacheKey] !== 'undefined') {

src/lib/adapters/NextcloudBookmarks.ts

@@ -310,7 +310,8 @@ export default class NextcloudBookmarksAdapter implements Adapter, BulkImportRes
 
     this.list = null
     tree.loaded = false
-    tree.hashValue = { true: await this._getFolderHash(tree.id) }
+    const treeHash = await this._getFolderHash(tree.id)
+    tree.setHashCacheValue(this.hashSettings, treeHash)
     this.tree = tree.copy(true) // we clone (withHash), so we can mess with our own version
     return tree
   }
@@ -386,7 +387,7 @@ export default class NextcloudBookmarksAdapter implements Adapter, BulkImportRes
           }
           if (!child.loaded) {
             const folderHash = await this._getFolderHash(child.id)
-            child.hashValue = { true: folderHash }
+            child.setHashCacheValue(this.hashSettings, folderHash)
           }
           await recurse(child.children)
         }, 5)