build: update dist files

Author: avoidwork

dist/tiny-lru.cjs

@@ -91,21 +91,7 @@ class LRU {
 			delete this.items[key];
 			this.size--;
 
-			if (item.prev !== null) {
-				item.prev.next = item.next;
-			}
-
-			if (item.next !== null) {
-				item.next.prev = item.prev;
-			}
-
-			if (this.first === item) {
-				this.first = item.next;
-			}
-
-			if (this.last === item) {
-				this.last = item.prev;
-			}
+			this.unlink(item);
 
 			item.prev = null;
 			item.next = null;
@@ -173,8 +159,7 @@ class LRU {
 				this.first = null;
 				this.last = null;
 			} else {
-				this.first = item.next;
-				this.first.prev = null;
+				this.unlink(item);
 			}
 
 			item.next = null;
@@ -261,21 +246,17 @@ class LRU {
 	}
 
 	/**
-	 * Efficiently moves an item to the end of the LRU list (most recently used position).
-	 * This is an internal optimization method that avoids the overhead of the full set() operation
-	 * when only LRU position needs to be updated.
+	 * Unlinks an item from the doubly-linked list.
+	 * Updates first/last pointers if needed.
+	 * Does NOT clear the item's prev/next pointers or delete from items map.
 	 *
-	 * @method moveToEnd
+	 * @method unlink
 	 * @memberof LRU
-	 * @param {Object} item - The cache item with prev/next pointers to reposition.
+	 * @param {Object} item - The cache item to unlink.
 	 * @private
-	 * @since 11.3.5
+	 * @since 11.4.8
 	 */
-	moveToEnd(item) {
-		if (this.last === item) {
-			return;
-		}
-
+	unlink(item) {
 		if (item.prev !== null) {
 			item.prev.next = item.next;
 		}
@@ -288,6 +269,29 @@ class LRU {
 			this.first = item.next;
 		}
 
+		if (this.last === item) {
+			this.last = item.prev;
+		}
+	}
+
+	/**
+	 * Efficiently moves an item to the end of the LRU list (most recently used position).
+	 * This is an internal optimization method that avoids the overhead of the full set() operation
+	 * when only LRU position needs to be updated.
+	 *
+	 * @method moveToEnd
+	 * @memberof LRU
+	 * @param {Object} item - The cache item with prev/next pointers to reposition.
+	 * @private
+	 * @since 11.3.5
+	 */
+	moveToEnd(item) {
+		if (this.last === item) {
+			return;
+		}
+
+		this.unlink(item);
+
 		item.prev = this.last;
 		item.next = null;
 		this.last.next = item;

dist/tiny-lru.js

@@ -89,21 +89,7 @@ class LRU {
 			delete this.items[key];
 			this.size--;
 
-			if (item.prev !== null) {
-				item.prev.next = item.next;
-			}
-
-			if (item.next !== null) {
-				item.next.prev = item.prev;
-			}
-
-			if (this.first === item) {
-				this.first = item.next;
-			}
-
-			if (this.last === item) {
-				this.last = item.prev;
-			}
+			this.unlink(item);
 
 			item.prev = null;
 			item.next = null;
@@ -171,8 +157,7 @@ class LRU {
 				this.first = null;
 				this.last = null;
 			} else {
-				this.first = item.next;
-				this.first.prev = null;
+				this.unlink(item);
 			}
 
 			item.next = null;
@@ -259,21 +244,17 @@ class LRU {
 	}
 
 	/**
-	 * Efficiently moves an item to the end of the LRU list (most recently used position).
-	 * This is an internal optimization method that avoids the overhead of the full set() operation
-	 * when only LRU position needs to be updated.
+	 * Unlinks an item from the doubly-linked list.
+	 * Updates first/last pointers if needed.
+	 * Does NOT clear the item's prev/next pointers or delete from items map.
 	 *
-	 * @method moveToEnd
+	 * @method unlink
 	 * @memberof LRU
-	 * @param {Object} item - The cache item with prev/next pointers to reposition.
+	 * @param {Object} item - The cache item to unlink.
 	 * @private
-	 * @since 11.3.5
+	 * @since 11.4.8
 	 */
-	moveToEnd(item) {
-		if (this.last === item) {
-			return;
-		}
-
+	unlink(item) {
 		if (item.prev !== null) {
 			item.prev.next = item.next;
 		}
@@ -286,6 +267,29 @@ class LRU {
 			this.first = item.next;
 		}
 
+		if (this.last === item) {
+			this.last = item.prev;
+		}
+	}
+
+	/**
+	 * Efficiently moves an item to the end of the LRU list (most recently used position).
+	 * This is an internal optimization method that avoids the overhead of the full set() operation
+	 * when only LRU position needs to be updated.
+	 *
+	 * @method moveToEnd
+	 * @memberof LRU
+	 * @param {Object} item - The cache item with prev/next pointers to reposition.
+	 * @private
+	 * @since 11.3.5
+	 */
+	moveToEnd(item) {
+		if (this.last === item) {
+			return;
+		}
+
+		this.unlink(item);
+
 		item.prev = this.last;
 		item.next = null;
 		this.last.next = item;

dist/tiny-lru.min.js

@@ -89,21 +89,7 @@ class LRU {
 			delete this.items[key];
 			this.size--;
 
-			if (item.prev !== null) {
-				item.prev.next = item.next;
-			}
-
-			if (item.next !== null) {
-				item.next.prev = item.prev;
-			}
-
-			if (this.first === item) {
-				this.first = item.next;
-			}
-
-			if (this.last === item) {
-				this.last = item.prev;
-			}
+			this.unlink(item);
 
 			item.prev = null;
 			item.next = null;
@@ -171,8 +157,7 @@ class LRU {
 				this.first = null;
 				this.last = null;
 			} else {
-				this.first = item.next;
-				this.first.prev = null;
+				this.unlink(item);
 			}
 
 			item.next = null;
@@ -259,21 +244,17 @@ class LRU {
 	}
 
 	/**
-	 * Efficiently moves an item to the end of the LRU list (most recently used position).
-	 * This is an internal optimization method that avoids the overhead of the full set() operation
-	 * when only LRU position needs to be updated.
+	 * Unlinks an item from the doubly-linked list.
+	 * Updates first/last pointers if needed.
+	 * Does NOT clear the item's prev/next pointers or delete from items map.
 	 *
-	 * @method moveToEnd
+	 * @method unlink
 	 * @memberof LRU
-	 * @param {Object} item - The cache item with prev/next pointers to reposition.
+	 * @param {Object} item - The cache item to unlink.
 	 * @private
-	 * @since 11.3.5
+	 * @since 11.4.8
 	 */
-	moveToEnd(item) {
-		if (this.last === item) {
-			return;
-		}
-
+	unlink(item) {
 		if (item.prev !== null) {
 			item.prev.next = item.next;
 		}
@@ -286,6 +267,29 @@ class LRU {
 			this.first = item.next;
 		}
 
+		if (this.last === item) {
+			this.last = item.prev;
+		}
+	}
+
+	/**
+	 * Efficiently moves an item to the end of the LRU list (most recently used position).
+	 * This is an internal optimization method that avoids the overhead of the full set() operation
+	 * when only LRU position needs to be updated.
+	 *
+	 * @method moveToEnd
+	 * @memberof LRU
+	 * @param {Object} item - The cache item with prev/next pointers to reposition.
+	 * @private
+	 * @since 11.3.5
+	 */
+	moveToEnd(item) {
+		if (this.last === item) {
+			return;
+		}
+
+		this.unlink(item);
+
 		item.prev = this.last;
 		item.next = null;
 		this.last.next = item;