.

node_modules/next/dist/client/components/segment-cache/lru.js

@@ -0,0 +1,152 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", {
+    value: true
+});
+0 && (module.exports = {
+    cleanup: null,
+    deleteFromLru: null,
+    lruPut: null,
+    updateLruSize: null
+});
+function _export(target, all) {
+    for(var name in all)Object.defineProperty(target, name, {
+        enumerable: true,
+        get: all[name]
+    });
+}
+_export(exports, {
+    cleanup: function() {
+        return cleanup;
+    },
+    deleteFromLru: function() {
+        return deleteFromLru;
+    },
+    lruPut: function() {
+        return lruPut;
+    },
+    updateLruSize: function() {
+        return updateLruSize;
+    }
+});
+const _cachemap = require("./cache-map");
+const _scheduler = require("./scheduler");
+// We use an LRU for memory management. We must update this whenever we add or
+// remove a new cache entry, or when an entry changes size.
+let head = null;
+let lruSize = 0;
+// TODO: I chose the max size somewhat arbitrarily. Consider setting this based
+// on navigator.deviceMemory, or some other heuristic. We should make this
+// customizable via the Next.js config, too.
+const maxLruSize = 50 * 1024 * 1024 // 50 MB
+;
+function lruPut(node) {
+    if (head === node) {
+        // Already at the head
+        return;
+    }
+    const prev = node.prev;
+    const next = node.next;
+    if (next === null || prev === null) {
+        // This is an insertion
+        lruSize += node.size;
+        // Whenever we add an entry, we need to check if we've exceeded the
+        // max size. We don't evict entries immediately; they're evicted later in
+        // an asynchronous task.
+        ensureCleanupIsScheduled();
+    } else {
+        // This is a move. Remove from its current position.
+        prev.next = next;
+        next.prev = prev;
+    }
+    // Move to the front of the list
+    if (head === null) {
+        // This is the first entry
+        node.prev = node;
+        node.next = node;
+    } else {
+        // Add to the front of the list
+        const tail = head.prev;
+        node.prev = tail;
+        // In practice, this is never null, but that isn't encoded in the type
+        if (tail !== null) {
+            tail.next = node;
+        }
+        node.next = head;
+        head.prev = node;
+    }
+    head = node;
+}
+function updateLruSize(node, newNodeSize) {
+    // This is a separate function from `put` so that we can resize the entry
+    // regardless of whether it's currently being tracked by the LRU.
+    const prevNodeSize = node.size;
+    node.size = newNodeSize;
+    if (node.next === null) {
+        // This entry is not currently being tracked by the LRU.
+        return;
+    }
+    // Update the total LRU size
+    lruSize = lruSize - prevNodeSize + newNodeSize;
+    ensureCleanupIsScheduled();
+}
+function deleteFromLru(deleted) {
+    const next = deleted.next;
+    const prev = deleted.prev;
+    if (next !== null && prev !== null) {
+        lruSize -= deleted.size;
+        deleted.next = null;
+        deleted.prev = null;
+        // Remove from the list
+        if (head === deleted) {
+            // Update the head
+            if (next === head) {
+                // This was the last entry
+                head = null;
+            } else {
+                head = next;
+                prev.next = next;
+                next.prev = prev;
+            }
+        } else {
+            prev.next = next;
+            next.prev = prev;
+        }
+    } else {
+    // Already deleted
+    }
+}
+function ensureCleanupIsScheduled() {
+    if (lruSize <= maxLruSize) {
+        return;
+    }
+    // To schedule cleanup, ping the prefetch scheduler. At the end of its work
+    // loop, once there are no queued tasks and no in-progress requests, it will
+    // call cleanup().
+    (0, _scheduler.pingPrefetchScheduler)();
+}
+function cleanup() {
+    if (lruSize <= maxLruSize) {
+        return;
+    }
+    // Evict entries until we're at 90% capacity. We can assume this won't
+    // infinite loop because even if `maxLruSize` were 0, eventually
+    // `deleteFromLru` sets `head` to `null` when we run out entries.
+    const ninetyPercentMax = maxLruSize * 0.9;
+    while(lruSize > ninetyPercentMax && head !== null){
+        const tail = head.prev;
+        // In practice, this is never null, but that isn't encoded in the type
+        if (tail !== null) {
+            // Delete the entry from the map. In turn, this will remove it from
+            // the LRU.
+            (0, _cachemap.deleteMapEntry)(tail);
+        }
+    }
+}
+
+if ((typeof exports.default === 'function' || (typeof exports.default === 'object' && exports.default !== null)) && typeof exports.default.__esModule === 'undefined') {
+  Object.defineProperty(exports.default, '__esModule', { value: true });
+  Object.assign(exports.default, exports);
+  module.exports = exports.default;
+}
+
+//# sourceMappingURL=lru.js.map