Be lazy with invisible summaries

davidgilbertson · Jul 23, 2018 · f652c3c · f652c3c
1 parent f14afd7
commit f652c3c
Showing 1 changed file with 15 additions and 3 deletions.
diff --git a/app/data/store.js b/app/data/store.js
@@ -257,14 +257,26 @@ const store = {
     }
 
     if (updateDom) {
-      updatedItems.forEach((updatedItem) => {
+      // TODO (davidg): this is pretty CPU intensive - web worker?
+      const updateItem = (updatedItem) => {
         this.triggerListener(`PIE-${updatedItem.id}`);
-      });
+      };
+
+      const visibleItems = updatedItems.filter((item) => item.visible);
+      visibleItems.forEach(updateItem);
+
+      const invisibleItems = updatedItems.filter((item) => !item.visible);
+      const batch = 50;
+
+      for (let i = 0; i < invisibleItems.length / batch; i++) {
+        requestIdleCallback(() => {
+          invisibleItems.slice(i*batch, (i+1)*batch).forEach(updateItem);
+        }, { timeout: 1000 });
+      }
     }
   },
 
   updateScoreSummary(item, newScoreKey, oldScoreKey) {
-    // TODO (davidg): this is pretty CPU intensive - web worker?
     const newItem = !newScoreKey && !oldScoreKey;
     // the score summary holds the aggregate scores for non-leaf nodes
     newScoreKey = newScoreKey || SCORES.LEVEL_0.key;