collect-your-stuff 2.1.0 → 2.1.2

package/dist/collections/doubly-linked-list/DoublyLinkedList.d.ts

@@ -1,125 +1,125 @@
-/**
- * @file doubly linked list.
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.1.0
- * @memberOf module:collect-your-stuff
- */
-import { DoubleLinker } from './DoubleLinker';
-import { forEachCallback, IsArrayable } from '../../recipes/IsArrayable';
-import { IsDoubleLinker } from '../../recipes/IsDoubleLinker';
-/**
- * DoublyLinkedList represents a collection stored as a LinkedList with prev and next references.
- * @extends LinkedList
- */
-export declare class DoublyLinkedList implements IsArrayable<DoubleLinker>, Iterable<DoubleLinker> {
-    /** The class used to create this instance, so that it can be recognized as valid without an instanceof check. */
-    readonly classType: typeof DoublyLinkedList;
-    /** A linker of the list (null when the list is empty); the head is found by walking back from it. */
-    innerList: DoubleLinker;
-    /** 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 DoubleLinker;
-    /** 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 DoublyLinkedList instance.
-     * @param {DoubleLinker} [linkerClass=DoubleLinker] The class used to wrap given data as linkers.
-     */
-    constructor(linkerClass?: typeof DoubleLinker);
-    /**
-     * Initialize the inner list, should only run once.
-     * @param {DoubleLinker} initialList Give the list of double-linkers to start in this doubly linked-list.
-     * @return {DoublyLinkedList}
-     */
-    initialize(initialList: DoubleLinker): DoublyLinkedList;
-    /**
-     * Retrieve the innerList used (the list itself, not a copy).
-     * @returns {DoubleLinker}
-     */
-    get list(): DoubleLinker;
-    /**
-     * Retrieve the first DoubleLinker in the list.
-     * @returns {DoubleLinker}
-     */
-    get first(): DoubleLinker | null;
-    /**
-     * Retrieve the last DoubleLinker in the list. The end is remembered, so this does not walk the list.
-     * @returns {DoubleLinker}
-     */
-    get last(): DoubleLinker | null;
-    /**
-     * 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 {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: DoubleLinker | null, newNode: DoubleLinker | any): DoublyLinkedList;
-    /**
-     * Insert a new node (or data) before a node.
-     * @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: DoubleLinker | null, newNode: DoubleLinker | any): DoublyLinkedList;
-    /**
-     * Add a node (or data) after the given (or last) node in the list.
-     * @param {DoubleLinker|*} node The new node to add to the end of the list
-     * @param {DoubleLinker} after The existing last node
-     * @returns {DoubleLinker}
-     */
-    append(node: DoubleLinker | any, after?: DoubleLinker): DoublyLinkedList;
-    /**
-     * Add a node (or data) before the given (or first) node in the list.
-     * @param {DoubleLinker|*} node The new node to add to the start of the list
-     * @param {DoubleLinker} before The existing first node
-     * @returns {DoubleLinker}
-     */
-    prepend(node: DoubleLinker | any, before?: DoubleLinker): DoublyLinkedList;
-    /**
-     * Remove a linker from this linked list.
-     * @param {DoubleLinker} node The node we wish to remove (and it will be returned after removal)
-     * @return {DoubleLinker}
-     */
-    remove(node: DoubleLinker | null): DoubleLinker | null;
-    /**
-     * 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(): DoubleLinker | null;
-    /**
-     * Retrieve a DoubleLinker item from this list by numeric index, otherwise return null.
-     * @param {number} index The integer number for retrieving a node by position.
-     * @returns {DoubleLinker|null}
-     */
-    item(index: number): DoubleLinker;
-    /**
-     * 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: forEachCallback, thisArg?: DoublyLinkedList): DoublyLinkedList;
-    /**
-     * Be able to iterate over this class.
-     * @returns {Iterator}
-     */
-    [Symbol.iterator](): Iterator<DoubleLinker>;
-    /**
-     * Convert an array into a DoublyLinkedList instance, return the new instance.
-     * @param {Array} [values=[]] An array of values which will be converted to linkers in this doubly-linked-list
-     * @param {IsDoubleLinker} [linkerClass=DoubleLinker] The class to use for each linker
-     * @param {IsArrayable<IsDoubleLinker>} [classType=LinkedList] Provide the type of IsArrayable to use.
-     * @returns {DoublyLinkedList}
-     */
-    static fromArray: (values?: Array<any>, linkerClass?: typeof DoubleLinker, classType?: any) => IsArrayable<IsDoubleLinker> | any;
-}
+/**
+ * @file doubly linked list.
+ * @author Joshua Heagle <joshuaheagle@gmail.com>
+ * @version 1.1.0
+ * @memberOf module:collect-your-stuff
+ */
+import { DoubleLinker } from './DoubleLinker';
+import { forEachCallback, IsArrayable } from '../../recipes/IsArrayable';
+import { IsDoubleLinker } from '../../recipes/IsDoubleLinker';
+/**
+ * DoublyLinkedList represents a collection stored as a LinkedList with prev and next references.
+ * @extends LinkedList
+ */
+export declare class DoublyLinkedList implements IsArrayable<DoubleLinker>, Iterable<DoubleLinker> {
+    /** The class used to create this instance, so that it can be recognized as valid without an instanceof check. */
+    readonly classType: typeof DoublyLinkedList;
+    /** A linker of the list (null when the list is empty); the head is found by walking back from it. */
+    innerList: DoubleLinker;
+    /** 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 DoubleLinker;
+    /** 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 DoublyLinkedList instance.
+     * @param {DoubleLinker} [linkerClass=DoubleLinker] The class used to wrap given data as linkers.
+     */
+    constructor(linkerClass?: typeof DoubleLinker);
+    /**
+     * Initialize the inner list, should only run once.
+     * @param {DoubleLinker} initialList Give the list of double-linkers to start in this doubly linked-list.
+     * @return {DoublyLinkedList}
+     */
+    initialize(initialList: DoubleLinker): DoublyLinkedList;
+    /**
+     * Retrieve the innerList used (the list itself, not a copy).
+     * @returns {DoubleLinker}
+     */
+    get list(): DoubleLinker;
+    /**
+     * Retrieve the first DoubleLinker in the list.
+     * @returns {DoubleLinker}
+     */
+    get first(): DoubleLinker | null;
+    /**
+     * Retrieve the last DoubleLinker in the list. The end is remembered, so this does not walk the list.
+     * @returns {DoubleLinker}
+     */
+    get last(): DoubleLinker | null;
+    /**
+     * 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 {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: DoubleLinker | null, newNode: DoubleLinker | any): DoublyLinkedList;
+    /**
+     * Insert a new node (or data) before a node.
+     * @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: DoubleLinker | null, newNode: DoubleLinker | any): DoublyLinkedList;
+    /**
+     * Add a node (or data) after the given (or last) node in the list.
+     * @param {DoubleLinker|*} node The new node to add to the end of the list
+     * @param {DoubleLinker} after The existing last node
+     * @returns {DoubleLinker}
+     */
+    append(node: DoubleLinker | any, after?: DoubleLinker): DoublyLinkedList;
+    /**
+     * Add a node (or data) before the given (or first) node in the list.
+     * @param {DoubleLinker|*} node The new node to add to the start of the list
+     * @param {DoubleLinker} before The existing first node
+     * @returns {DoubleLinker}
+     */
+    prepend(node: DoubleLinker | any, before?: DoubleLinker): DoublyLinkedList;
+    /**
+     * Remove a linker from this linked list.
+     * @param {DoubleLinker} node The node we wish to remove (and it will be returned after removal)
+     * @return {DoubleLinker}
+     */
+    remove(node: DoubleLinker | null): DoubleLinker | null;
+    /**
+     * 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(): DoubleLinker | null;
+    /**
+     * Retrieve a DoubleLinker item from this list by numeric index, otherwise return null.
+     * @param {number} index The integer number for retrieving a node by position.
+     * @returns {DoubleLinker|null}
+     */
+    item(index: number): DoubleLinker;
+    /**
+     * 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: forEachCallback, thisArg?: DoublyLinkedList): DoublyLinkedList;
+    /**
+     * Be able to iterate over this class.
+     * @returns {Iterator}
+     */
+    [Symbol.iterator](): Iterator<DoubleLinker>;
+    /**
+     * Convert an array into a DoublyLinkedList instance, return the new instance.
+     * @param {Array} [values=[]] An array of values which will be converted to linkers in this doubly-linked-list
+     * @param {IsDoubleLinker} [linkerClass=DoubleLinker] The class to use for each linker
+     * @param {IsArrayable<IsDoubleLinker>} [classType=LinkedList] Provide the type of IsArrayable to use.
+     * @returns {DoublyLinkedList}
+     */
+    static fromArray: (values?: Array<any>, linkerClass?: typeof DoubleLinker, classType?: any) => IsArrayable<IsDoubleLinker> | any;
+}

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

@@ -6,9 +6,9 @@ Object.defineProperty(exports, '__esModule', {
 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')
-var _DoubleLinkerIterator = require('../../recipes/DoubleLinkerIterator')
-var _LinkedList = require('../linked-list/LinkedList')
+const _DoubleLinker = require('./DoubleLinker')
+const _DoubleLinkerIterator = require('../../recipes/DoubleLinkerIterator')
+const _LinkedList = require('../linked-list/LinkedList')
 /**
  * @file doubly linked list.
  * @author Joshua Heagle <joshuaheagle@gmail.com>

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

@@ -1,126 +1,126 @@
-/**
- * @file linked list.
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.1.0
- * @memberOf module:collect-your-stuff
- */
-import { forEachCallback, IsArrayable } from '../../recipes/IsArrayable';
-import { IsLinker } from '../../recipes/IsLinker';
-import { Linker } from './Linker';
-/**
- * LinkedList represents a collection stored as a LinkedList with next references.
- * @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);
-    /**
-     * Initialize the inner list, should only run once.
-     * @param {Linker|Array} initialList Give the list of linkers to start in this linked-list.
-     * @return {LinkedList}
-     */
-    initialize(initialList: Linker): LinkedList;
-    /**
-     * Retrieve the innerList used (the list itself, not a copy).
-     * @returns {Linker}
-     */
-    get list(): IsLinker;
-    /**
-     * Retrieve the first Linker in the list.
-     * @returns {Linker}
-     */
-    get first(): Linker;
-    /**
-     * Retrieve the last Linker in the list. The end is remembered, so this does not walk the list.
-     * @returns {Linker}
-     */
-    get last(): Linker | null;
-    /**
-     * 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, 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 | null, newNode: Linker | any): LinkedList;
-    /**
-     * Insert a new node (or data) before a node.
-     * @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 | 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
-     * @param {Linker} after The existing last node
-     * @returns {Linker}
-     */
-    append(node: Linker | any, after?: IsLinker): LinkedList;
-    /**
-     * Add a node (or data) before the given (or first) node in the list.
-     * @param {Linker|*} node The new node to add to the start of the list
-     * @param {Linker} before The existing first node
-     * @returns {Linker}
-     */
-    prepend(node: Linker | any, before?: IsLinker): 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|null} The removed node, or null when it was not in this list (nothing is removed)
-     */
-    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.
-     * @returns {Linker|null}
-     */
-    item(index: number): Linker | null;
-    /**
-     * Be able to run forEach on this LinkedList to iterate over the linkers.
-     * @param {forEachCallback} callback The function to call for-each linker
-     * @param {LinkedList} thisArg Optional, 'this' reference
-     * @returns {LinkedList}
-     */
-    forEach(callback: forEachCallback, thisArg?: LinkedList): LinkedList;
-    /**
-     * Be able to iterate over this class.
-     * @returns {Iterator}
-     */
-    [Symbol.iterator](): Iterator<Linker>;
-    /**
-     * Convert an array to a LinkedList.
-     * @param {Array} values An array of values which will be converted to linkers in this linked-list
-     * @param {IsLinker} linkerClass The class to use for each linker
-     * @param {IsArrayable<Linker>} [classType=LinkedList] Provide the type of IsArrayable to use.
-     * @returns {LinkedList}
-     */
-    static fromArray: (values?: Array<any>, linkerClass?: typeof Linker, classType?: any) => IsArrayable<IsLinker> | any;
-}
+/**
+ * @file linked list.
+ * @author Joshua Heagle <joshuaheagle@gmail.com>
+ * @version 1.1.0
+ * @memberOf module:collect-your-stuff
+ */
+import { forEachCallback, IsArrayable } from '../../recipes/IsArrayable';
+import { IsLinker } from '../../recipes/IsLinker';
+import { Linker } from './Linker';
+/**
+ * LinkedList represents a collection stored as a LinkedList with next references.
+ * @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);
+    /**
+     * Initialize the inner list, should only run once.
+     * @param {Linker|Array} initialList Give the list of linkers to start in this linked-list.
+     * @return {LinkedList}
+     */
+    initialize(initialList: Linker): LinkedList;
+    /**
+     * Retrieve the innerList used (the list itself, not a copy).
+     * @returns {Linker}
+     */
+    get list(): IsLinker;
+    /**
+     * Retrieve the first Linker in the list.
+     * @returns {Linker}
+     */
+    get first(): Linker;
+    /**
+     * Retrieve the last Linker in the list. The end is remembered, so this does not walk the list.
+     * @returns {Linker}
+     */
+    get last(): Linker | null;
+    /**
+     * 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, 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 | null, newNode: Linker | any): LinkedList;
+    /**
+     * Insert a new node (or data) before a node.
+     * @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 | 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
+     * @param {Linker} after The existing last node
+     * @returns {Linker}
+     */
+    append(node: Linker | any, after?: IsLinker): LinkedList;
+    /**
+     * Add a node (or data) before the given (or first) node in the list.
+     * @param {Linker|*} node The new node to add to the start of the list
+     * @param {Linker} before The existing first node
+     * @returns {Linker}
+     */
+    prepend(node: Linker | any, before?: IsLinker): 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|null} The removed node, or null when it was not in this list (nothing is removed)
+     */
+    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.
+     * @returns {Linker|null}
+     */
+    item(index: number): Linker | null;
+    /**
+     * Be able to run forEach on this LinkedList to iterate over the linkers.
+     * @param {forEachCallback} callback The function to call for-each linker
+     * @param {LinkedList} thisArg Optional, 'this' reference
+     * @returns {LinkedList}
+     */
+    forEach(callback: forEachCallback, thisArg?: LinkedList): LinkedList;
+    /**
+     * Be able to iterate over this class.
+     * @returns {Iterator}
+     */
+    [Symbol.iterator](): Iterator<Linker>;
+    /**
+     * Convert an array to a LinkedList.
+     * @param {Array} values An array of values which will be converted to linkers in this linked-list
+     * @param {IsLinker} linkerClass The class to use for each linker
+     * @param {IsArrayable<Linker>} [classType=LinkedList] Provide the type of IsArrayable to use.
+     * @returns {LinkedList}
+     */
+    static fromArray: (values?: Array<any>, linkerClass?: typeof Linker, classType?: any) => IsArrayable<IsLinker> | any;
+}

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

@@ -4,9 +4,9 @@ Object.defineProperty(exports, '__esModule', {
   value: true
 })
 exports.LinkedList = void 0
-var _Linker = require('./Linker')
-var _LinkerIterator = require('../../recipes/LinkerIterator')
-var _Arrayable = require('../arrayable/Arrayable')
+const _Linker = require('./Linker')
+const _LinkerIterator = require('../../recipes/LinkerIterator')
+const _Arrayable = require('../arrayable/Arrayable')
 /**
  * LinkedList represents a collection stored as a LinkedList with next references.
  * @extends Arrayable

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

@@ -1,46 +1,46 @@
-/**
- * @file linked list item.
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.1.0
- * @memberOf module:collect-your-stuff
- */
-import { IsLinker } from '../../recipes/IsLinker';
-/**
- * Linker represents a node in a LinkedList.
- * @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={}] 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
-     */
-    constructor({ data, next }?: {
-        data?: any;
-        next?: Linker | null;
-    });
-    /**
-     * Make a new Linker from the data given if it is not already a valid Linker.
-     * @param {Linker|*} linker Return a valid Linker instance from given data, or even an already valid one.
-     * @param {IsLinker} [classType=Linker] Provide the type of IsLinker to use.
-     * @return {Linker}
-     */
-    static make: (linker: Linker | any, classType?: any) => IsLinker | any;
-    /**
-     * Convert an array into Linker instances, return the head and tail Linkers.
-     * @param {Array} [values=[]] Provide an array of data that will be converted to a chain of linkers.
-     * @param {IsLinker} [classType=Linker] Provide the type of IsLinker to use.
-     * @returns {{head: Linker, tail: Linker}}
-     */
-    static fromArray: (values?: Array<any>, classType?: any) => {
-        head: IsLinker;
-        tail: IsLinker;
-    };
-}
+/**
+ * @file linked list item.
+ * @author Joshua Heagle <joshuaheagle@gmail.com>
+ * @version 1.1.0
+ * @memberOf module:collect-your-stuff
+ */
+import { IsLinker } from '../../recipes/IsLinker';
+/**
+ * Linker represents a node in a LinkedList.
+ * @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={}] 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
+     */
+    constructor({ data, next }?: {
+        data?: any;
+        next?: Linker | null;
+    });
+    /**
+     * Make a new Linker from the data given if it is not already a valid Linker.
+     * @param {Linker|*} linker Return a valid Linker instance from given data, or even an already valid one.
+     * @param {IsLinker} [classType=Linker] Provide the type of IsLinker to use.
+     * @return {Linker}
+     */
+    static make: (linker: Linker | any, classType?: any) => IsLinker | any;
+    /**
+     * Convert an array into Linker instances, return the head and tail Linkers.
+     * @param {Array} [values=[]] Provide an array of data that will be converted to a chain of linkers.
+     * @param {IsLinker} [classType=Linker] Provide the type of IsLinker to use.
+     * @returns {{head: Linker, tail: Linker}}
+     */
+    static fromArray: (values?: Array<any>, classType?: any) => {
+        head: IsLinker;
+        tail: IsLinker;
+    };
+}

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

@@ -6,7 +6,7 @@ Object.defineProperty(exports, '__esModule', {
 exports.Linker = void 0
 require('core-js/modules/esnext.iterator.constructor.js')
 require('core-js/modules/esnext.iterator.reduce.js')
-var _ArrayElement = require('../arrayable/ArrayElement')
+const _ArrayElement = require('../arrayable/ArrayElement')
 /**
  * Linker represents a node in a LinkedList.
  * @extends ArrayElement