collect-your-stuff 1.3.0 → 1.4.0

package/dist/collections/doubly-linked-list/DoublyLinkedList.js

@@ -23,11 +23,19 @@ var _LinkedList = require('../linked-list/LinkedList')
 class DoublyLinkedList {
   /**
    * Create the new DoublyLinkedList instance.
+   * @param {DoubleLinker} [linkerClass=DoubleLinker] The class used to wrap given data as linkers.
    */
   constructor (linkerClass = _DoubleLinker.DoubleLinker) {
+    /** The class used to create this instance, so that it can be recognized as valid without an instanceof check. */
     this.classType = DoublyLinkedList
+    /** A linker of the list (null when the list is empty); the head is found by walking back from it. */
     this.innerList = null
+    /** Whether the inner list has been initialized (it can only be initialized once). */
     this.initialized = false
+    /** The last linker, remembered so that adding to the end does not need to walk the whole list (null when not known yet). */
+    this.tailCache = null
+    /** The number of linkers, kept up to date by the list's own methods so that the length does not need to walk the whole list (null when not known yet). */
+    this.countCache = null
     this.linkerClass = linkerClass
   }
 
@@ -37,11 +45,12 @@ class DoublyLinkedList {
    * @return {DoublyLinkedList}
    */
   initialize (initialList) {
+    // Borrowed from LinkedList, which types its return as a LinkedList although it returns whatever list called it
     return _LinkedList.LinkedList.prototype.initialize.call(this, initialList)
   }
 
   /**
-   * Retrieve a copy of the innerList used.
+   * Retrieve the innerList used (the list itself, not a copy).
    * @returns {DoubleLinker}
    */
   get list () {
@@ -53,91 +62,122 @@ class DoublyLinkedList {
    * @returns {DoubleLinker}
    */
   get first () {
-    return this.reset()
+    let head = this.innerList
+    if (head === null) {
+      return null
+    }
+    // innerList is normally the head already, walking back also finds anything linked on before it outside of this list
+    while (head.prev !== null) {
+      head = head.prev
+    }
+    this.innerList = head
+    return head
   }
 
   /**
-   * Retrieve the last DoubleLinker in the list.
+   * Retrieve the last DoubleLinker in the list. The end is remembered, so this does not walk the list.
    * @returns {DoubleLinker}
    */
   get last () {
-    let tail = this.innerList
-    if (tail === null) {
+    if (this.innerList === null) {
       return null
     }
-    let next = tail.next
-    while (next !== null) {
-      tail = next
-      next = tail.next
+    let tail = this.tailCache !== null ? this.tailCache : this.innerList
+    // The remembered tail is normally the end already, walking on from it also finds anything linked on outside of this list
+    while (tail.next !== null) {
+      tail = tail.next
     }
+    this.tailCache = tail
     return tail
   }
 
   /**
-   * Return the length of the list.
+   * Return the length of the list. It is kept up to date by the list's own methods, so this does not walk the list
+   * (call reset() after linkers were changed directly).
    * @returns {number}
    */
   get length () {
-    let current = this.first
-    let length = 0
-    while (current !== null) {
-      ++length
-      current = current.next
+    if (this.countCache === null) {
+      this.reset()
     }
-    return length
+    return this.countCache
   }
 
   /**
    * Insert a new node (or data) after a node.
-   * @param {DoubleLinker|*} node The existing node as reference
+   * @param {DoubleLinker|*} node The existing node as reference (which must be in this list, this is not checked), or null to insert at the start of the list
    * @param {DoubleLinker|*} newNode The new node to go after the existing node
    * @returns {DoublyLinkedList}
    */
   insertAfter (node, newNode) {
-    newNode = this.linkerClass.make(newNode)
-    if (node !== null) {
+    newNode = this.linkerClass.make(newNode, this.linkerClass)
+    if (node === null || typeof node === 'undefined') {
+      // After nothing means at the start of the list
+      const head = this.first
+      newNode.prev = null
+      newNode.next = head
+      if (head) {
+        head.prev = newNode
+      } else {
+        this.tailCache = newNode
+      }
+      this.innerList = newNode
+    } else {
       // Ensure the next reference of this node is assigned to the new node
       newNode.next = node.next
       // Ensure this node is assigned as the prev reference of the new node
       newNode.prev = node
       // Then set this node's next reference to the new node
       node.next = newNode
+      if (newNode.next) {
+        // Update the next reference to ensure circular reference for prev points to the new node
+        newNode.next.prev = newNode
+      } else {
+        this.tailCache = newNode
+      }
     }
-    if (newNode.next) {
-      // Update the next reference to ensure circular reference for prev points to the new node
-      newNode.next.prev = newNode
+    if (this.countCache !== null) {
+      ++this.countCache
     }
-    if (!this.length) {
-      this.innerList = newNode
-    }
-    this.reset()
     return this
   }
 
   /**
    * Insert a new node (or data) before a node.
-   * @param {DoubleLinker|*} node The existing node as reference
+   * @param {DoubleLinker|*} node The existing node as reference (which must be in this list, this is not checked), or null to insert at the end of the list
    * @param {DoubleLinker|*} newNode The new node to go before the existing node
    * @returns {DoublyLinkedList}
    */
   insertBefore (node, newNode) {
-    newNode = this.linkerClass.make(newNode)
-    if (node !== null) {
+    newNode = this.linkerClass.make(newNode, this.linkerClass)
+    if (node === null || typeof node === 'undefined') {
+      // Before nothing means at the end of the list
+      const tail = this.last
+      newNode.next = null
+      newNode.prev = tail
+      if (tail === null) {
+        this.innerList = newNode
+      } else {
+        tail.next = newNode
+      }
+      this.tailCache = newNode
+    } else {
       // The new node will reference this prev node as prev
       newNode.prev = node.prev
       // The new node will reference this node as next
       newNode.next = node
       // This prev will reference the new node
       node.prev = newNode
+      if (newNode.prev) {
+        // Update the prev reference to ensure circular reference for next points to the new node
+        newNode.prev.next = newNode
+      } else {
+        this.innerList = newNode
+      }
     }
-    if (newNode.prev) {
-      // Update the prev reference to ensure circular reference for next points to the new node
-      newNode.prev.next = newNode
-    }
-    if (!this.length) {
-      this.innerList = newNode
+    if (this.countCache !== null) {
+      ++this.countCache
     }
-    this.reset()
     return this
   }
 
@@ -167,7 +207,7 @@ class DoublyLinkedList {
    * @return {DoubleLinker}
    */
   remove (node) {
-    if (node === null) {
+    if (node === null || typeof node === 'undefined') {
       return null
     }
     if (node.prev) {
@@ -183,35 +223,47 @@ class DoublyLinkedList {
     if (this.innerList === node) {
       this.innerList = node.next || node.prev || null
     }
-    // Update head reference
-    this.reset()
+    if (this.tailCache === node) {
+      this.tailCache = node.prev
+    }
+    if (this.innerList === null) {
+      this.tailCache = null
+    }
+    if (this.countCache !== null) {
+      --this.countCache
+    }
     return node
   }
 
   /**
-   * Refresh all references and return head reference.
-   * @return {DoubleLinker}
+   * Refresh all references (the head, the end and the length) by walking the list once, and return the head. The list's
+   * own methods keep these up to date, so this is only needed after linkers were changed directly.
+   * @return {DoubleLinker|null}
    */
   reset () {
     // Start at the pointer for the list
     let pointer = this.innerList
     if (pointer === null) {
+      this.countCache = 0
+      this.tailCache = null
       return null
     }
-    let next = pointer.next
-    // Follow references till the end
-    while (next !== null) {
-      pointer = next
-      next = pointer.next
-    }
-    let prev = pointer.prev
-    // From final reference, follow references back to the beginning
-    while (prev !== null) {
-      pointer = prev
-      prev = pointer.prev
+    // Follow references back to the beginning
+    while (pointer.prev !== null) {
+      pointer = pointer.prev
     }
-    // All the live references should have been found, and we are pointing to the true head
+    // We are pointing to the true head, now count along to the end to find the tail and the length
     this.innerList = pointer
+    let count = 0
+    let tail = pointer
+    let current = pointer
+    while (current !== null) {
+      ++count
+      tail = current
+      current = current.next
+    }
+    this.countCache = count
+    this.tailCache = tail
     return pointer
   }
 
@@ -247,6 +299,7 @@ class DoublyLinkedList {
    * Be able to run forEach on this DoublyLinkedList to iterate over the DoubleLinker Items.
    * @param {forEachCallback} callback The function to call for-each double linker
    * @param {DoublyLinkedList} thisArg Optional, 'this' reference
+   * @return {DoublyLinkedList} The list which was iterated.
    */
   forEach (callback, thisArg = this) {
     return _LinkedList.LinkedList.prototype.forEach.call(this, callback, thisArg)

package/dist/collections/doubly-linked-list/DoublyLinkedList.min.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.DoublyLinkedList=void 0,require("core-js/modules/esnext.iterator.constructor.js"),require("core-js/modules/esnext.iterator.for-each.js");var _DoubleLinker=require("./DoubleLinker"),_DoubleLinkerIterator=require("../../recipes/DoubleLinkerIterator"),_LinkedList=require("../linked-list/LinkedList");class DoublyLinkedList{constructor(e=_DoubleLinker.DoubleLinker){this.classType=DoublyLinkedList,this.innerList=null,this.initialized=!1,this.linkerClass=e}initialize(e){return _LinkedList.LinkedList.prototype.initialize.call(this,e)}get list(){return this.innerList}get first(){return this.reset()}get last(){let e=this.innerList;if(null===e)return null;let t=e.next;for(;null!==t;)e=t,t=e.next;return e}get length(){let e=this.first,t=0;for(;null!==e;)++t,e=e.next;return t}insertAfter(e,t){return t=this.linkerClass.make(t),null!==e&&(t.next=e.next,t.prev=e,e.next=t),t.next&&(t.next.prev=t),this.length||(this.innerList=t),this.reset(),this}insertBefore(e,t){return t=this.linkerClass.make(t),null!==e&&(t.prev=e.prev,t.next=e,e.prev=t),t.prev&&(t.prev.next=t),this.length||(this.innerList=t),this.reset(),this}append(e,t=this.last){return this.insertAfter(t,e)}prepend(e,t=this.first){return this.insertBefore(t,e)}remove(e){return null===e?null:(e.prev&&(e.prev.next=e.next),e.next&&(e.next.prev=e.prev),this.innerList===e&&(this.innerList=e.next||e.prev||null),this.reset(),e)}reset(){let e=this.innerList;if(null===e)return null;let t=e.next;for(;null!==t;)e=t,t=e.next;let r=e.prev;for(;null!==r;)e=r,r=e.prev;return this.innerList=e,e}item(e){if(e>=0){let t=this.first,r=-1;for(;++r<e&&null!==t;)t=t.next;return r===e?t:null}let t=this.last,r=this.length;const i=this.length+e;if(i<0)return null;for(;--r>i&&null!==t;)t=t.prev;return r===i?t:null}forEach(e,t=this){return _LinkedList.LinkedList.prototype.forEach.call(this,e,t)}[Symbol.iterator](){let e=this.first;return new _DoubleLinkerIterator.DoubleLinkerIterator(e)}}exports.DoublyLinkedList=DoublyLinkedList,DoublyLinkedList.fromArray=(e=[],t=_DoubleLinker.DoubleLinker,r=DoublyLinkedList)=>_LinkedList.LinkedList.fromArray(e,t,r);
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.DoublyLinkedList=void 0,require("core-js/modules/esnext.iterator.constructor.js"),require("core-js/modules/esnext.iterator.for-each.js");var _DoubleLinker=require("./DoubleLinker"),_DoubleLinkerIterator=require("../../recipes/DoubleLinkerIterator"),_LinkedList=require("../linked-list/LinkedList");class DoublyLinkedList{constructor(e=_DoubleLinker.DoubleLinker){this.classType=DoublyLinkedList,this.innerList=null,this.initialized=!1,this.tailCache=null,this.countCache=null,this.linkerClass=e}initialize(e){return _LinkedList.LinkedList.prototype.initialize.call(this,e)}get list(){return this.innerList}get first(){let e=this.innerList;if(null===e)return null;for(;null!==e.prev;)e=e.prev;return this.innerList=e,e}get last(){if(null===this.innerList)return null;let e=null!==this.tailCache?this.tailCache:this.innerList;for(;null!==e.next;)e=e.next;return this.tailCache=e,e}get length(){return null===this.countCache&&this.reset(),this.countCache}insertAfter(e,t){if(t=this.linkerClass.make(t,this.linkerClass),null==e){const e=this.first;t.prev=null,t.next=e,e?e.prev=t:this.tailCache=t,this.innerList=t}else t.next=e.next,t.prev=e,e.next=t,t.next?t.next.prev=t:this.tailCache=t;return null!==this.countCache&&++this.countCache,this}insertBefore(e,t){if(t=this.linkerClass.make(t,this.linkerClass),null==e){const e=this.last;t.next=null,t.prev=e,null===e?this.innerList=t:e.next=t,this.tailCache=t}else t.prev=e.prev,t.next=e,e.prev=t,t.prev?t.prev.next=t:this.innerList=t;return null!==this.countCache&&++this.countCache,this}append(e,t=this.last){return this.insertAfter(t,e)}prepend(e,t=this.first){return this.insertBefore(t,e)}remove(e){return null==e?null:(e.prev&&(e.prev.next=e.next),e.next&&(e.next.prev=e.prev),this.innerList===e&&(this.innerList=e.next||e.prev||null),this.tailCache===e&&(this.tailCache=e.prev),null===this.innerList&&(this.tailCache=null),null!==this.countCache&&--this.countCache,e)}reset(){let e=this.innerList;if(null===e)return this.countCache=0,this.tailCache=null,null;for(;null!==e.prev;)e=e.prev;this.innerList=e;let t=0,i=e,n=e;for(;null!==n;)++t,i=n,n=n.next;return this.countCache=t,this.tailCache=i,e}item(e){if(e>=0){let t=this.first,i=-1;for(;++i<e&&null!==t;)t=t.next;return i===e?t:null}let t=this.last,i=this.length;const n=this.length+e;if(n<0)return null;for(;--i>n&&null!==t;)t=t.prev;return i===n?t:null}forEach(e,t=this){return _LinkedList.LinkedList.prototype.forEach.call(this,e,t)}[Symbol.iterator](){let e=this.first;return new _DoubleLinkerIterator.DoubleLinkerIterator(e)}}exports.DoublyLinkedList=DoublyLinkedList,DoublyLinkedList.fromArray=(e=[],t=_DoubleLinker.DoubleLinker,i=DoublyLinkedList)=>_LinkedList.LinkedList.fromArray(e,t,i);

package/dist/collections/linked-list/LinkedList.d.ts

@@ -12,12 +12,21 @@ import { Linker } from './Linker';
  * @extends Arrayable
  */
 export declare class LinkedList implements IsArrayable<Linker>, Iterable<Linker> {
+    /** The class used to create this instance, so that it can be recognized as valid without an instanceof check. */
     readonly classType: typeof LinkedList;
+    /** The first linker of the list (null when the list is empty), from which the whole list is reached. */
     innerList: Linker;
+    /** Whether the inner list has been initialized (it can only be initialized once). */
     initialized: boolean;
+    /** The class used to wrap the data given to this list as linkers. */
     linkerClass: typeof Linker;
+    /** The last linker, remembered so that adding to the end does not need to walk the whole list (null when not known yet). */
+    private tailCache;
+    /** The number of linkers, kept up to date by the list's own methods so that the length does not need to walk the whole list (null when not known yet). */
+    private countCache;
     /**
      * Create the new LinkedList instance.
+     * @param {Linker} [linkerClass=Linker] The class used to wrap given data as linkers.
      */
     constructor(linkerClass?: typeof Linker);
     /**
@@ -27,7 +36,7 @@ export declare class LinkedList implements IsArrayable<Linker>, Iterable<Linker>
      */
     initialize(initialList: Linker): LinkedList;
     /**
-     * Retrieve a copy of the innerList used.
+     * Retrieve the innerList used (the list itself, not a copy).
      * @returns {Linker}
      */
     get list(): IsLinker;
@@ -37,29 +46,31 @@ export declare class LinkedList implements IsArrayable<Linker>, Iterable<Linker>
      */
     get first(): Linker;
     /**
-     * Retrieve the last Linker in the list.
+     * Retrieve the last Linker in the list. The end is remembered, so this does not walk the list.
      * @returns {Linker}
      */
-    get last(): Linker;
+    get last(): Linker | null;
     /**
-     * Return the length of the list.
+     * Return the length of the list. It is kept up to date by the list's own methods, so this does not walk the list
+     * (call reset() after linkers were changed directly).
      * @returns {number}
      */
     get length(): number;
     /**
      * Insert a new node (or data) after a node.
-     * @param {Linker|*} node The existing node as reference
+     * @param {Linker|*} node The existing node as reference, or null to insert at the start of the list
      * @param {Linker|*} newNode The new node to go after the existing node
      * @returns {LinkedList}
      */
-    insertAfter(node: IsLinker, newNode: Linker | any): LinkedList;
+    insertAfter(node: IsLinker | null, newNode: Linker | any): LinkedList;
     /**
      * Insert a new node (or data) before a node.
-     * @param {Linker|*} node The existing node as reference
+     * @param {Linker|*} node The existing node as reference, or null to insert at the end of the list
      * @param {Linker|*} newNode The new node to go before the existing node
      * @returns {LinkedList}
+     * @throws {Error} When the reference node is not in this list
      */
-    insertBefore(node: IsLinker, newNode: Linker | any): LinkedList;
+    insertBefore(node: IsLinker | null, newNode: Linker | any): LinkedList;
     /**
      * Add a node (or data) after the given (or last) node in the list.
      * @param {Linker|*} node The new node to add to the end of the list
@@ -77,9 +88,15 @@ export declare class LinkedList implements IsArrayable<Linker>, Iterable<Linker>
     /**
      * Remove a linker from this linked list.
      * @param {Linker} node The node we wish to remove (and it will be returned after removal)
-     * @return {Linker}
+     * @return {Linker|null} The removed node, or null when it was not in this list (nothing is removed)
      */
-    remove(node: Linker): Linker;
+    remove(node: Linker | null): Linker | null;
+    /**
+     * Refresh the remembered end and length of the list by walking it once. The list's own methods keep these up to date,
+     * so this is only needed after linkers were changed directly (for example by setting next on a linker).
+     * @return {Linker|null} The first linker of the list
+     */
+    reset(): Linker | null;
     /**
      * Retrieve a Linker item from this list by numeric index, otherwise return null.
      * @param {number} index The integer number for retrieving a node by position.

package/dist/collections/linked-list/LinkedList.js

@@ -14,11 +14,19 @@ var _Arrayable = require('../arrayable/Arrayable')
 class LinkedList {
   /**
    * Create the new LinkedList instance.
+   * @param {Linker} [linkerClass=Linker] The class used to wrap given data as linkers.
    */
   constructor (linkerClass = _Linker.Linker) {
+    /** The class used to create this instance, so that it can be recognized as valid without an instanceof check. */
     this.classType = LinkedList
+    /** The first linker of the list (null when the list is empty), from which the whole list is reached. */
     this.innerList = null
+    /** Whether the inner list has been initialized (it can only be initialized once). */
     this.initialized = false
+    /** The last linker, remembered so that adding to the end does not need to walk the whole list (null when not known yet). */
+    this.tailCache = null
+    /** The number of linkers, kept up to date by the list's own methods so that the length does not need to walk the whole list (null when not known yet). */
+    this.countCache = null
     this.linkerClass = linkerClass
   }
 
@@ -28,11 +36,12 @@ class LinkedList {
    * @return {LinkedList}
    */
   initialize (initialList) {
+    // Borrowed from Arrayable, which types its return as an Arrayable although it returns whatever list called it
     return _Arrayable.Arrayable.prototype.initialize.call(this, initialList)
   }
 
   /**
-   * Retrieve a copy of the innerList used.
+   * Retrieve the innerList used (the list itself, not a copy).
    * @returns {Linker}
    */
   get list () {
@@ -48,78 +57,100 @@ class LinkedList {
   }
 
   /**
-   * Retrieve the last Linker in the list.
+   * Retrieve the last Linker in the list. The end is remembered, so this does not walk the list.
    * @returns {Linker}
    */
   get last () {
-    let tail = this.innerList
-    if (tail === null) {
+    if (this.innerList === null) {
       return null
     }
-    let next = tail.next
-    while (next !== null) {
-      tail = next
-      next = tail.next
+    let tail = this.tailCache !== null ? this.tailCache : this.innerList
+    // The remembered tail is normally the end already, walking on from it also finds anything linked on outside of this list
+    while (tail.next !== null) {
+      tail = tail.next
     }
+    this.tailCache = tail
     return tail
   }
 
   /**
-   * Return the length of the list.
+   * Return the length of the list. It is kept up to date by the list's own methods, so this does not walk the list
+   * (call reset() after linkers were changed directly).
    * @returns {number}
    */
   get length () {
-    let current = this.first
-    let length = 0
-    while (current !== null) {
-      ++length
-      current = current.next
+    if (this.countCache === null) {
+      this.reset()
     }
-    return length
+    return this.countCache
   }
 
   /**
    * Insert a new node (or data) after a node.
-   * @param {Linker|*} node The existing node as reference
+   * @param {Linker|*} node The existing node as reference, or null to insert at the start of the list
    * @param {Linker|*} newNode The new node to go after the existing node
    * @returns {LinkedList}
    */
   insertAfter (node, newNode) {
-    newNode = this.linkerClass.make(newNode)
-    if (node !== null) {
-      // Ensure the next reference of this node is assigned to the new node
+    newNode = this.linkerClass.make(newNode, this.linkerClass)
+    if (node === null || typeof node === 'undefined') {
+      // After nothing means at the start of the list
+      newNode.next = this.innerList
+      if (this.innerList === null) {
+        this.tailCache = newNode
+      }
+      this.innerList = newNode
+    } else {
       newNode.next = node.next
-      // Then set this node's next reference to the new node
       node.next = newNode
+      if (newNode.next === null) {
+        this.tailCache = newNode
+      }
     }
-    if (!this.length) {
-      this.innerList = newNode
+    if (this.countCache !== null) {
+      ++this.countCache
     }
     return this
   }
 
   /**
    * Insert a new node (or data) before a node.
-   * @param {Linker|*} node The existing node as reference
+   * @param {Linker|*} node The existing node as reference, or null to insert at the end of the list
    * @param {Linker|*} newNode The new node to go before the existing node
    * @returns {LinkedList}
+   * @throws {Error} When the reference node is not in this list
    */
   insertBefore (node, newNode) {
-    newNode = this.linkerClass.make(newNode)
-    let prevNode = null
-    let currentNode = this.first
-    while (currentNode !== node) {
-      prevNode = currentNode
-      currentNode = currentNode.next
-    }
-    // The new node will reference this node as next
-    newNode.next = node
-    if (prevNode) {
-      // Ensure the next reference of the previous node is assigned to the new node
-      prevNode.next = newNode
+    newNode = this.linkerClass.make(newNode, this.linkerClass)
+    if (node === null || typeof node === 'undefined') {
+      // Before nothing means at the end of the list
+      const tail = this.last
+      newNode.next = null
+      if (tail === null) {
+        this.innerList = newNode
+      } else {
+        tail.next = newNode
+      }
+      this.tailCache = newNode
+    } else {
+      let prevNode = null
+      let currentNode = this.first
+      while (currentNode !== null && currentNode !== node) {
+        prevNode = currentNode
+        currentNode = currentNode.next
+      }
+      if (currentNode === null) {
+        throw new Error('The reference node is not in this list.')
+      }
+      newNode.next = node
+      if (prevNode) {
+        prevNode.next = newNode
+      } else {
+        this.innerList = newNode
+      }
     }
-    if (node === this.first || node === null) {
-      this.innerList = newNode
+    if (this.countCache !== null) {
+      ++this.countCache
     }
     return this
   }
@@ -147,26 +178,58 @@ class LinkedList {
   /**
    * Remove a linker from this linked list.
    * @param {Linker} node The node we wish to remove (and it will be returned after removal)
-   * @return {Linker}
+   * @return {Linker|null} The removed node, or null when it was not in this list (nothing is removed)
    */
   remove (node) {
+    if (node === null || typeof node === 'undefined') {
+      return null
+    }
     let prevNode = null
     let currentNode = this.first
-    while (currentNode !== node) {
+    while (currentNode !== null && currentNode !== node) {
       prevNode = currentNode
       currentNode = currentNode.next
     }
+    if (currentNode === null) {
+      // The node is not in this list, so there is nothing to remove
+      return null
+    }
     if (prevNode) {
-      // Ensure the next reference of the previous node skips over the removed node
       prevNode.next = node.next
-    }
-    if (node === this.first && node !== null) {
-      // Update list head to point to next if it was this node
+    } else {
       this.innerList = node.next
     }
+    if (this.tailCache === node) {
+      this.tailCache = prevNode
+    }
+    if (this.innerList === null) {
+      this.tailCache = null
+    }
+    if (this.countCache !== null) {
+      --this.countCache
+    }
     return node
   }
 
+  /**
+   * Refresh the remembered end and length of the list by walking it once. The list's own methods keep these up to date,
+   * so this is only needed after linkers were changed directly (for example by setting next on a linker).
+   * @return {Linker|null} The first linker of the list
+   */
+  reset () {
+    let count = 0
+    let tail = null
+    let current = this.innerList
+    while (current !== null) {
+      ++count
+      tail = current
+      current = current.next
+    }
+    this.countCache = count
+    this.tailCache = tail
+    return this.innerList
+  }
+
   /**
    * Retrieve a Linker item from this list by numeric index, otherwise return null.
    * @param {number} index The integer number for retrieving a node by position.

package/dist/collections/linked-list/LinkedList.min.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.LinkedList=void 0;var _Linker=require("./Linker"),_LinkerIterator=require("../../recipes/LinkerIterator"),_Arrayable=require("../arrayable/Arrayable");class LinkedList{constructor(t=_Linker.Linker){this.classType=LinkedList,this.innerList=null,this.initialized=!1,this.linkerClass=t}initialize(t){return _Arrayable.Arrayable.prototype.initialize.call(this,t)}get list(){return this.innerList}get first(){return this.innerList}get last(){let t=this.innerList;if(null===t)return null;let e=t.next;for(;null!==e;)t=e,e=t.next;return t}get length(){let t=this.first,e=0;for(;null!==t;)++e,t=t.next;return e}insertAfter(t,e){return e=this.linkerClass.make(e),null!==t&&(e.next=t.next,t.next=e),this.length||(this.innerList=e),this}insertBefore(t,e){e=this.linkerClass.make(e);let r=null,i=this.first;for(;i!==t;)r=i,i=i.next;return e.next=t,r&&(r.next=e),t!==this.first&&null!==t||(this.innerList=e),this}append(t,e=this.last){return this.insertAfter(e,t)}prepend(t,e=this.first){return this.insertBefore(e,t)}remove(t){let e=null,r=this.first;for(;r!==t;)e=r,r=r.next;return e&&(e.next=t.next),t===this.first&&null!==t&&(this.innerList=t.next),t}item(t){if(t>=0){let e=this.first,r=-1;for(;++r<t&&null!==e;)e=e.next;return r===t?e:null}let e=this.first,r=0;const i=this.length+t;if(i<0)return null;for(;r<i&&null!==e;)e=e.next,++r;return r===i?e:null}forEach(t,e=this){let r=0,i=e.first;for(;null!==i;)t(i,r,e),i=i.next,++r;return e}[Symbol.iterator](){return new _LinkerIterator.LinkerIterator(this.first)}}exports.LinkedList=LinkedList,LinkedList.fromArray=(t=[],e=_Linker.Linker,r=LinkedList)=>new r(e).initialize(e.fromArray(t).head);
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.LinkedList=void 0;var _Linker=require("./Linker"),_LinkerIterator=require("../../recipes/LinkerIterator"),_Arrayable=require("../arrayable/Arrayable");class LinkedList{constructor(t=_Linker.Linker){this.classType=LinkedList,this.innerList=null,this.initialized=!1,this.tailCache=null,this.countCache=null,this.linkerClass=t}initialize(t){return _Arrayable.Arrayable.prototype.initialize.call(this,t)}get list(){return this.innerList}get first(){return this.innerList}get last(){if(null===this.innerList)return null;let t=null!==this.tailCache?this.tailCache:this.innerList;for(;null!==t.next;)t=t.next;return this.tailCache=t,t}get length(){return null===this.countCache&&this.reset(),this.countCache}insertAfter(t,e){return e=this.linkerClass.make(e,this.linkerClass),null==t?(e.next=this.innerList,null===this.innerList&&(this.tailCache=e),this.innerList=e):(e.next=t.next,t.next=e,null===e.next&&(this.tailCache=e)),null!==this.countCache&&++this.countCache,this}insertBefore(t,e){if(e=this.linkerClass.make(e,this.linkerClass),null==t){const t=this.last;e.next=null,null===t?this.innerList=e:t.next=e,this.tailCache=e}else{let i=null,n=this.first;for(;null!==n&&n!==t;)i=n,n=n.next;if(null===n)throw new Error("The reference node is not in this list.");e.next=t,i?i.next=e:this.innerList=e}return null!==this.countCache&&++this.countCache,this}append(t,e=this.last){return this.insertAfter(e,t)}prepend(t,e=this.first){return this.insertBefore(e,t)}remove(t){if(null==t)return null;let e=null,i=this.first;for(;null!==i&&i!==t;)e=i,i=i.next;return null===i?null:(e?e.next=t.next:this.innerList=t.next,this.tailCache===t&&(this.tailCache=e),null===this.innerList&&(this.tailCache=null),null!==this.countCache&&--this.countCache,t)}reset(){let t=0,e=null,i=this.innerList;for(;null!==i;)++t,e=i,i=i.next;return this.countCache=t,this.tailCache=e,this.innerList}item(t){if(t>=0){let e=this.first,i=-1;for(;++i<t&&null!==e;)e=e.next;return i===t?e:null}let e=this.first,i=0;const n=this.length+t;if(n<0)return null;for(;i<n&&null!==e;)e=e.next,++i;return i===n?e:null}forEach(t,e=this){let i=0,n=e.first;for(;null!==n;)t(n,i,e),n=n.next,++i;return e}[Symbol.iterator](){return new _LinkerIterator.LinkerIterator(this.first)}}exports.LinkedList=LinkedList,LinkedList.fromArray=(t=[],e=_Linker.Linker,i=LinkedList)=>new i(e).initialize(e.fromArray(t).head);

package/dist/collections/linked-list/Linker.d.ts

@@ -10,12 +10,15 @@ import { IsLinker } from '../../recipes/IsLinker';
  * @extends ArrayElement
  */
 export declare class Linker implements IsLinker {
+    /** The class used to create this instance, so that it can be recognized as valid without an instanceof check. */
     readonly classType: typeof Linker;
+    /** The data stored in this linker. */
     data: any;
+    /** The linker after this one, or null when this is the last. */
     next: Linker | null;
     /**
      * Create the new Linker instance, provide the data and optionally give the next Linker.
-     * @param {Object} [nodeData={}]
+     * @param {Object} [nodeData={}] The settings for the new linker.
      * @param {*} [nodeData.data=null] The data to be stored in this linker
      * @param {Linker|null} [nodeData.next=null] The reference to the next linker if any
      */
@@ -36,7 +39,7 @@ export declare class Linker implements IsLinker {
      * @param {IsLinker} [classType=Linker] Provide the type of IsLinker to use.
      * @returns {{head: Linker, tail: Linker}}
      */
-    static fromArray: (values: Array<any>, classType?: any) => {
+    static fromArray: (values?: Array<any>, classType?: any) => {
         head: IsLinker;
         tail: IsLinker;
     };