FM / lib

/opt/canhelp/node_modules/next/dist/esm/server/lib/

/opt/canhelp/node_modules/next/dist/esm/server/lib

Name	Size	Mode	Actions
cache-handlers/	-	0755	rm
experimental/	-	0755	rm
incremental-cache/	-	0755	rm
module-loader/	-	0755	rm
router-utils/	-	0755	rm
server-ipc/	-	0755	rm
trace/	-	0755	rm
app-dir-module.js	1164	0644	edit dl rm
app-dir-module.js.map	2598	0644	edit dl rm
app-info-log.js	2723	0644	edit dl rm
app-info-log.js.map	5827	0644	edit dl rm
async-callback-set.js	519	0644	edit dl rm
async-callback-set.js.map	1097	0644	edit dl rm
cache-control.js	583	0644	edit dl rm
cache-control.js.map	1622	0644	edit dl rm
chrome-devtools-workspace.js	2297	0644	edit dl rm
chrome-devtools-workspace.js.map	4145	0644	edit dl rm
clone-response.js	2883	0644	edit dl rm
clone-response.js.map	4441	0644	edit dl rm
cpu-profile.js	1020	0644	edit dl rm
cpu-profile.js.map	2061	0644	edit dl rm
decode-query-path-parameter.js	458	0644	edit dl rm
decode-query-path-parameter.js.map	740	0644	edit dl rm
dedupe-fetch.js	5085	0644	edit dl rm
dedupe-fetch.js.map	7374	0644	edit dl rm
dev-bundler-service.js	3110	0644	edit dl rm
dev-bundler-service.js.map	5838	0644	edit dl rm
disk-lru-cache.external.js	1857	0644	edit dl rm
disk-lru-cache.external.js.map	3149	0644	edit dl rm
etag.js	1148	0644	edit dl rm
etag.js.map	2165	0644	edit dl rm
find-page-file.js	5445	0644	edit dl rm
find-page-file.js.map	9480	0644	edit dl rm
fix-mojibake.js	523	0644	edit dl rm
fix-mojibake.js.map	1026	0644	edit dl rm
format-hostname.js	332	0644	edit dl rm
format-hostname.js.map	616	0644	edit dl rm
i18n-provider.js	5531	0644	edit dl rm
i18n-provider.js.map	9041	0644	edit dl rm
implicit-tags.js	2450	0644	edit dl rm
implicit-tags.js.map	5238	0644	edit dl rm
is-ipv6.js	2090	0644	edit dl rm
is-ipv6.js.map	3388	0644	edit dl rm
lazy-result.js	939	0644	edit dl rm
lazy-result.js.map	1869	0644	edit dl rm
lru-cache.js	7148	0644	edit dl rm
lru-cache.js.map	11374	0644	edit dl rm
match-next-data-pathname.js	312	0644	edit dl rm
match-next-data-pathname.js.map	629	0644	edit dl rm
mock-request.js	13753	0644	edit dl rm
mock-request.js.map	21224	0644	edit dl rm
node-fs-methods.js	364	0644	edit dl rm
node-fs-methods.js.map	946	0644	edit dl rm
parse-stack.js	1561	0644	edit dl rm
parse-stack.js.map	2983	0644	edit dl rm
patch-fetch.js	44939	0644	edit dl rm
patch-fetch.js.map	64721	0644	edit dl rm
patch-set-header.js	1368	0644	edit dl rm
patch-set-header.js.map	2471	0644	edit dl rm
render-server.js	2988	0644	edit dl rm
render-server.js.map	6276	0644	edit dl rm
router-server.js	30029	0644	edit dl rm
router-server.js.map	46752	0644	edit dl rm
server-action-request-meta.js	1530	0644	edit dl rm
server-action-request-meta.js.map	3030	0644	edit dl rm
source-maps.js	8172	0644	edit dl rm
source-maps.js.map	14812	0644	edit dl rm
start-server.js	16797	0644	edit dl rm
start-server.js.map	27727	0644	edit dl rm
streaming-metadata.js	762	0644	edit dl rm
streaming-metadata.js.map	1582	0644	edit dl rm
to-route.js	582	0644	edit dl rm
to-route.js.map	848	0644	edit dl rm
types.js	46	0644	edit dl rm
types.js.map	451	0644	edit dl rm
utils.js	8516	0644	edit dl rm
utils.js.map	13627	0644	edit dl rm
worker-utils.js	755	0644	edit dl rm
worker-utils.js.map	1120	0644	edit dl rm

Edit: /opt/canhelp/node_modules/next/dist/esm/server/lib/lru-cache.js (7148B)

/**
 * Node in the doubly-linked list used for LRU tracking.
 * Each node represents a cache entry with bidirectional pointers.
 */ class LRUNode {
    constructor(key, data, size){
        this.prev = null;
        this.next = null;
        this.key = key;
        this.data = data;
        this.size = size;
    }
}
/**
 * Sentinel node used for head/tail boundaries.
 * These nodes don't contain actual cache data but simplify list operations.
 */ class SentinelNode {
    constructor(){
        this.prev = null;
        this.next = null;
    }
}
/**
 * LRU (Least Recently Used) Cache implementation using a doubly-linked list
 * and hash map for O(1) operations.
 *
 * Algorithm:
 * - Uses a doubly-linked list to maintain access order (most recent at head)
 * - Hash map provides O(1) key-to-node lookup
 * - Sentinel head/tail nodes simplify edge case handling
 * - Size-based eviction supports custom size calculation functions
 *
 * Data Structure Layout:
 * HEAD <-> [most recent] <-> ... <-> [least recent] <-> TAIL
 *
 * Operations:
 * - get(): Move accessed node to head (mark as most recent)
 * - set(): Add new node at head, evict from tail if over capacity
 * - Eviction: Remove least recent node (tail.prev) when size exceeds limit
 */ export class LRUCache {
    constructor(maxSize, calculateSize, onEvict){
        this.cache = new Map();
        this.totalSize = 0;
        this.maxSize = maxSize;
        this.calculateSize = calculateSize;
        this.onEvict = onEvict;
        // Create sentinel nodes to simplify doubly-linked list operations
        // HEAD <-> TAIL (empty list)
        this.head = new SentinelNode();
        this.tail = new SentinelNode();
        this.head.next = this.tail;
        this.tail.prev = this.head;
    }
    /**
   * Adds a node immediately after the head (marks as most recently used).
   * Used when inserting new items or when an item is accessed.
   * PRECONDITION: node must be disconnected (prev/next should be null)
   */ addToHead(node) {
        node.prev = this.head;
        node.next = this.head.next;
        // head.next is always non-null (points to tail or another node)
        this.head.next.prev = node;
        this.head.next = node;
    }
    /**
   * Removes a node from its current position in the doubly-linked list.
   * Updates the prev/next pointers of adjacent nodes to maintain list integrity.
   * PRECONDITION: node must be connected (prev/next are non-null)
   */ removeNode(node) {
        // Connected nodes always have non-null prev/next
        node.prev.next = node.next;
        node.next.prev = node.prev;
    }
    /**
   * Moves an existing node to the head position (marks as most recently used).
   * This is the core LRU operation - accessed items become most recent.
   */ moveToHead(node) {
        this.removeNode(node);
        this.addToHead(node);
    }
    /**
   * Removes and returns the least recently used node (the one before tail).
   * This is called during eviction when the cache exceeds capacity.
   * PRECONDITION: cache is not empty (ensured by caller)
   */ removeTail() {
        const lastNode = this.tail.prev;
        // tail.prev is always non-null and always LRUNode when cache is not empty
        this.removeNode(lastNode);
        return lastNode;
    }
    /**
   * Sets a key-value pair in the cache.
   * If the key exists, updates the value and moves to head.
   * If new, adds at head and evicts from tail if necessary.
   *
   * Time Complexity:
   * - O(1) for uniform item sizes
   * - O(k) where k is the number of items evicted (can be O(N) for variable sizes)
   */ set(key, value) {
        const size = (this.calculateSize == null ? void 0 : this.calculateSize.call(this, value)) ?? 1;
        if (size <= 0) {
            throw Object.defineProperty(new Error(`LRUCache: calculateSize returned ${size}, but size must be > 0. ` + `Items with size 0 would never be evicted, causing unbounded cache growth.`), "__NEXT_ERROR_CODE", {
                value: "E789",
                enumerable: false,
                configurable: true
            });
        }
        if (size > this.maxSize) {
            console.warn('Single item size exceeds maxSize');
            return false;
        }
        const existing = this.cache.get(key);
        if (existing) {
            // Update existing node: adjust size and move to head (most recent)
            existing.data = value;
            this.totalSize = this.totalSize - existing.size + size;
            existing.size = size;
            this.moveToHead(existing);
        } else {
            // Add new node at head (most recent position)
            const newNode = new LRUNode(key, value, size);
            this.cache.set(key, newNode);
            this.addToHead(newNode);
            this.totalSize += size;
        }
        // Evict least recently used items until under capacity
        while(this.totalSize > this.maxSize && this.cache.size > 0){
            const tail = this.removeTail();
            this.cache.delete(tail.key);
            this.totalSize -= tail.size;
            this.onEvict == null ? void 0 : this.onEvict.call(this, tail.key, tail.data);
        }
        return true;
    }
    /**
   * Checks if a key exists in the cache.
   * This is a pure query operation - does NOT update LRU order.
   *
   * Time Complexity: O(1)
   */ has(key) {
        return this.cache.has(key);
    }
    /**
   * Retrieves a value by key and marks it as most recently used.
   * Moving to head maintains the LRU property for future evictions.
   *
   * Time Complexity: O(1)
   */ get(key) {
        const node = this.cache.get(key);
        if (!node) return undefined;
        // Mark as most recently used by moving to head
        this.moveToHead(node);
        return node.data;
    }
    /**
   * Returns an iterator over the cache entries. The order is outputted in the
   * order of most recently used to least recently used.
   */ *[Symbol.iterator]() {
        let current = this.head.next;
        while(current && current !== this.tail){
            // Between head and tail, current is always LRUNode
            const node = current;
            yield [
                node.key,
                node.data
            ];
            current = current.next;
        }
    }
    /**
   * Removes a specific key from the cache.
   * Updates both the hash map and doubly-linked list.
   *
   * Note: This is an explicit removal and does NOT trigger the `onEvict`
   * callback. Use this for intentional deletions where eviction tracking
   * is not needed.
   *
   * Time Complexity: O(1)
   */ remove(key) {
        const node = this.cache.get(key);
        if (!node) return;
        this.removeNode(node);
        this.cache.delete(key);
        this.totalSize -= node.size;
    }
    /**
   * Returns the number of items in the cache.
   */ get size() {
        return this.cache.size;
    }
    /**
   * Returns the current total size of all cached items.
   * This uses the custom size calculation if provided.
   */ get currentSize() {
        return this.totalSize;
    }
}

//# sourceMappingURL=lru-cache.js.map

cmd: