collect-your-stuff 1.2.6 → 1.2.8

package/dist/collections/linked-tree-list/LinkedTreeList.js

@@ -1,261 +1,252 @@
-'use strict'
-
-Object.defineProperty(exports, '__esModule', {
-  value: true
-})
-exports.LinkedTreeList = void 0
-require('core-js/modules/web.dom-collections.iterator.js')
-var _TreeLinker = require('./TreeLinker')
-var _TreeLinkerIterator = require('../../recipes/TreeLinkerIterator')
-var _DoublyLinkedList = require('../doubly-linked-list/DoublyLinkedList')
-/**
- * @file doubly linked tree list.
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.1.0
- * @memberOf module:collect-your-stuff
- */
-
-/**
- * LinkedTreeList represents a collection stored with a root and spreading in branching (tree) formation.
- * @extends DoublyLinkedList
- */
-class LinkedTreeList {
-  /**
-   * Create the new LinkedTreeList instance, configure the list class.
-   */
-  constructor () {
-    const linkerClass = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : _TreeLinker.TreeLinker
-    this.classType = LinkedTreeList
-    this.innerList = null
-    this.initialized = false
-    this.linkerClass = linkerClass
-  }
-
-  /**
-   * Initialize the inner list, should only run once.
-   * @param {TreeLinker} initialList Give the list of tree-linkers to start in this linked-tree-list.
-   * @return {LinkedTreeList}
-   */
-  initialize (initialList) {
-    if (this.initialized) {
-      console.warn('Attempt to initialize LinkedTreeList which is not empty.')
-      return this
-    }
-    this.initialized = true
-    this.innerList = initialList
-    return this
-  }
-
-  /**
-   * Retrieve a copy of the innerList used.
-   * @returns {TreeLinker}
-   */
-  get list () {
-    return this.innerList
-  }
-
-  /**
-   * Retrieve the first TreeLinker in the list.
-   * @returns {TreeLinker}
-   */
-  get first () {
-    return this.reset()
-  }
-
-  /**
-   * Retrieve the last TreeLinker in the list.
-   * @returns {TreeLinker}
-   */
-  get last () {
-    let tail = this.innerList
-    if (tail === null) {
-      return null
-    }
-    let next = tail.next
-    while (next !== null) {
-      tail = next
-      next = tail.next
-    }
-    return tail
-  }
-
-  /**
-   * Return the length of the list.
-   * @returns {number}
-   */
-  get length () {
-    let current = this.first
-    let length = 0
-    while (current !== null) {
-      ++length
-      current = current.next
-    }
-    return length
-  }
-
-  /**
-   * Get the parent of this tree list.
-   * @return {TreeLinker}
-   */
-  get parent () {
-    const first = this.first
-    if (first === null) {
-      return null
-    }
-    return this.first.parent
-  }
-
-  /**
-   * Set the parent of this tree list
-   * @param {TreeLinker} parent The new node to use as the parent for this group of children
-   */
-  set parent (parent) {
-    let current = this.first
-    while (current !== null) {
-      current.parent = parent
-      current = current.next
-    }
-    if (parent) {
-      parent.children = this
-    }
-  }
-
-  /**
-   * Return the root parent of the entire tree.
-   * @return {TreeLinker}
-   */
-  get rootParent () {
-    let current = this.first
-    if (!current) {
-      return null
-    }
-    let parent = this.first.parent
-    while (parent !== null) {
-      current = parent
-      parent = current.parent
-    }
-    return current
-  }
-
-  /**
-   * Set the children on a parent item.
-   * @param {TreeLinker} item The TreeLinker node that will be the parent of the children
-   * @param {LinkedTreeList} children The LinkedTreeList which has the child nodes to use
-   */
-  setChildren (item) {
-    const children = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null
-    if (Array.from(this).indexOf(item) < 0) {
-      console.error('item is not a child of this')
-    }
-    children.parent = item
-  }
-
-  /**
-   * Insert a new node (or data) after a node.
-   * @param {TreeLinker|*} node The existing node as reference
-   * @param {TreeLinker|*} newNode The new node to go after the existing node
-   * @returns {LinkedTreeList}
-   */
-  insertAfter (node, newNode) {
-    return _DoublyLinkedList.DoublyLinkedList.prototype.insertAfter.call(this, node, newNode)
-  }
-
-  /**
-   * Insert a new node (or data) before a node.
-   * @param {TreeLinker|*} node The existing node as reference
-   * @param {TreeLinker|*} newNode The new node to go before the existing node
-   * @returns {LinkedTreeList}
-   */
-  insertBefore (node, newNode) {
-    return _DoublyLinkedList.DoublyLinkedList.prototype.insertBefore.call(this, node, newNode)
-  }
-
-  /**
-   * Add a node (or data) after the given (or last) node in the list.
-   * @param {TreeLinker|*} node The new node to add to the end of the list
-   * @param {TreeLinker} after The existing last node
-   * @returns {TreeLinker}
-   */
-  append (node) {
-    const after = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : this.last
-    return _DoublyLinkedList.DoublyLinkedList.prototype.append.call(this, node, after)
-  }
-
-  /**
-   * Add a node (or data) before the given (or first) node in the list.
-   * @param {TreeLinker|*} node The new node to add to the start of the list
-   * @param {TreeLinker} before The existing first node
-   * @returns {TreeLinker}
-   */
-  prepend (node) {
-    const before = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : this.first
-    return _DoublyLinkedList.DoublyLinkedList.prototype.prepend.call(this, node, before)
-  }
-
-  /**
-   * Remove a linker from this linked list.
-   * @param {TreeLinker} node The node we wish to remove (and it will be returned after removal)
-   * @return {TreeLinker}
-   */
-  remove (node) {
-    return _DoublyLinkedList.DoublyLinkedList.prototype.remove.call(this, node)
-  }
-
-  /**
-   * Refresh all references and return head reference.
-   * @return {TreeLinker}
-   */
-  reset () {
-    return _DoublyLinkedList.DoublyLinkedList.prototype.reset.call(this)
-  }
-
-  /**
-   * Retrieve a TreeLinker item from this list by numeric index, otherwise return null.
-   * @param {number} index The integer number for retrieving a node by position.
-   * @returns {TreeLinker|null}
-   */
-  item (index) {
-    return _DoublyLinkedList.DoublyLinkedList.prototype.item.call(this, index)
-  }
-
-  /**
-   * Be able to run forEach on this LinkedTreeList to iterate over the TreeLinker Items.
-   * @param {forEachCallback} callback The function to call for-each tree node
-   * @param {LinkedTreeList} thisArg Optional, 'this' reference
-   */
-  forEach (callback) {
-    const thisArg = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : this
-    let index = 0
-    let current = thisArg.first
-    while (current !== null) {
-      callback(current, index, thisArg)
-      current = current.next
-      ++index
-    }
-    return thisArg
-  }
-
-  /**
-   * Be able to iterate over this class.
-   * @returns {Iterator}
-   */
-  [Symbol.iterator] () {
-    const root = this.rootParent
-    return new _TreeLinkerIterator.TreeLinkerIterator(root)
-  }
-}
-/**
- * Convert an array into a LinkedTreeList instance, return the new instance.
- * @param {Array} [values=[]] An array of values which will be converted to nodes in this tree-list
- * @param {TreeLinker} [linkerClass=TreeLinker] The class to use for each node
- * @param {IsArrayable<TreeLinker>} [classType=LinkedTreeList] Provide the type of IsArrayable to use.
- * @returns {LinkedTreeList}
- */
-exports.LinkedTreeList = LinkedTreeList
-LinkedTreeList.fromArray = function () {
-  const values = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : []
-  const linkerClass = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : _TreeLinker.TreeLinker
-  const classType = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : LinkedTreeList
-  const list = new classType(linkerClass)
-  return list.initialize(linkerClass.fromArray(values).head)
-}
+'use strict'
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+})
+exports.LinkedTreeList = void 0
+var _TreeLinker = require('./TreeLinker')
+var _TreeLinkerIterator = require('../../recipes/TreeLinkerIterator')
+var _DoublyLinkedList = require('../doubly-linked-list/DoublyLinkedList')
+/**
+ * @file doubly linked tree list.
+ * @author Joshua Heagle <joshuaheagle@gmail.com>
+ * @version 1.1.0
+ * @memberOf module:collect-your-stuff
+ */
+
+/**
+ * LinkedTreeList represents a collection stored with a root and spreading in branching (tree) formation.
+ * @extends DoublyLinkedList
+ */
+class LinkedTreeList {
+  /**
+   * Create the new LinkedTreeList instance, configure the list class.
+   */
+  constructor (linkerClass = _TreeLinker.TreeLinker) {
+    this.classType = LinkedTreeList
+    this.innerList = null
+    this.initialized = false
+    this.linkerClass = linkerClass
+  }
+
+  /**
+   * Initialize the inner list, should only run once.
+   * @param {TreeLinker} initialList Give the list of tree-linkers to start in this linked-tree-list.
+   * @return {LinkedTreeList}
+   */
+  initialize (initialList) {
+    if (this.initialized) {
+      console.warn('Attempt to initialize LinkedTreeList which is not empty.')
+      return this
+    }
+    this.initialized = true
+    this.innerList = initialList
+    return this
+  }
+
+  /**
+   * Retrieve a copy of the innerList used.
+   * @returns {TreeLinker}
+   */
+  get list () {
+    return this.innerList
+  }
+
+  /**
+   * Retrieve the first TreeLinker in the list.
+   * @returns {TreeLinker}
+   */
+  get first () {
+    return this.reset()
+  }
+
+  /**
+   * Retrieve the last TreeLinker in the list.
+   * @returns {TreeLinker}
+   */
+  get last () {
+    let tail = this.innerList
+    if (tail === null) {
+      return null
+    }
+    let next = tail.next
+    while (next !== null) {
+      tail = next
+      next = tail.next
+    }
+    return tail
+  }
+
+  /**
+   * Return the length of the list.
+   * @returns {number}
+   */
+  get length () {
+    let current = this.first
+    let length = 0
+    while (current !== null) {
+      ++length
+      current = current.next
+    }
+    return length
+  }
+
+  /**
+   * Get the parent of this tree list.
+   * @return {TreeLinker}
+   */
+  get parent () {
+    const first = this.first
+    if (first === null) {
+      return null
+    }
+    return this.first.parent
+  }
+
+  /**
+   * Set the parent of this tree list
+   * @param {TreeLinker} parent The new node to use as the parent for this group of children
+   */
+  set parent (parent) {
+    let current = this.first
+    while (current !== null) {
+      current.parent = parent
+      current = current.next
+    }
+    if (parent) {
+      parent.children = this
+    }
+  }
+
+  /**
+   * Return the root parent of the entire tree.
+   * @return {TreeLinker}
+   */
+  get rootParent () {
+    let current = this.first
+    if (!current) {
+      return null
+    }
+    let parent = this.first.parent
+    while (parent !== null) {
+      current = parent
+      parent = current.parent
+    }
+    return current
+  }
+
+  /**
+   * Set the children on a parent item.
+   * @param {TreeLinker} item The TreeLinker node that will be the parent of the children
+   * @param {LinkedTreeList} children The LinkedTreeList which has the child nodes to use
+   */
+  setChildren (item, children = null) {
+    if (Array.from(this).indexOf(item) < 0) {
+      console.error('item is not a child of this')
+    }
+    children.parent = item
+  }
+
+  /**
+   * Insert a new node (or data) after a node.
+   * @param {TreeLinker|*} node The existing node as reference
+   * @param {TreeLinker|*} newNode The new node to go after the existing node
+   * @returns {LinkedTreeList}
+   */
+  insertAfter (node, newNode) {
+    return _DoublyLinkedList.DoublyLinkedList.prototype.insertAfter.call(this, node, newNode)
+  }
+
+  /**
+   * Insert a new node (or data) before a node.
+   * @param {TreeLinker|*} node The existing node as reference
+   * @param {TreeLinker|*} newNode The new node to go before the existing node
+   * @returns {LinkedTreeList}
+   */
+  insertBefore (node, newNode) {
+    return _DoublyLinkedList.DoublyLinkedList.prototype.insertBefore.call(this, node, newNode)
+  }
+
+  /**
+   * Add a node (or data) after the given (or last) node in the list.
+   * @param {TreeLinker|*} node The new node to add to the end of the list
+   * @param {TreeLinker} after The existing last node
+   * @returns {TreeLinker}
+   */
+  append (node, after = this.last) {
+    return _DoublyLinkedList.DoublyLinkedList.prototype.append.call(this, node, after)
+  }
+
+  /**
+   * Add a node (or data) before the given (or first) node in the list.
+   * @param {TreeLinker|*} node The new node to add to the start of the list
+   * @param {TreeLinker} before The existing first node
+   * @returns {TreeLinker}
+   */
+  prepend (node, before = this.first) {
+    return _DoublyLinkedList.DoublyLinkedList.prototype.prepend.call(this, node, before)
+  }
+
+  /**
+   * Remove a linker from this linked list.
+   * @param {TreeLinker} node The node we wish to remove (and it will be returned after removal)
+   * @return {TreeLinker}
+   */
+  remove (node) {
+    return _DoublyLinkedList.DoublyLinkedList.prototype.remove.call(this, node)
+  }
+
+  /**
+   * Refresh all references and return head reference.
+   * @return {TreeLinker}
+   */
+  reset () {
+    return _DoublyLinkedList.DoublyLinkedList.prototype.reset.call(this)
+  }
+
+  /**
+   * Retrieve a TreeLinker item from this list by numeric index, otherwise return null.
+   * @param {number} index The integer number for retrieving a node by position.
+   * @returns {TreeLinker|null}
+   */
+  item (index) {
+    return _DoublyLinkedList.DoublyLinkedList.prototype.item.call(this, index)
+  }
+
+  /**
+   * Be able to run forEach on this LinkedTreeList to iterate over the TreeLinker Items.
+   * @param {forEachCallback} callback The function to call for-each tree node
+   * @param {LinkedTreeList} thisArg Optional, 'this' reference
+   */
+  forEach (callback, thisArg = this) {
+    let index = 0
+    let current = thisArg.first
+    while (current !== null) {
+      callback(current, index, thisArg)
+      current = current.next
+      ++index
+    }
+    return thisArg
+  }
+
+  /**
+   * Be able to iterate over this class.
+   * @returns {Iterator}
+   */
+  [Symbol.iterator] () {
+    const root = this.rootParent
+    return new _TreeLinkerIterator.TreeLinkerIterator(root)
+  }
+}
+/**
+ * Convert an array into a LinkedTreeList instance, return the new instance.
+ * @param {Array} [values=[]] An array of values which will be converted to nodes in this tree-list
+ * @param {TreeLinker} [linkerClass=TreeLinker] The class to use for each node
+ * @param {IsArrayable<TreeLinker>} [classType=LinkedTreeList] Provide the type of IsArrayable to use.
+ * @returns {LinkedTreeList}
+ */
+exports.LinkedTreeList = LinkedTreeList
+LinkedTreeList.fromArray = (values = [], linkerClass = _TreeLinker.TreeLinker, classType = LinkedTreeList) => {
+  const list = new classType(linkerClass)
+  return list.initialize(linkerClass.fromArray(values).head)
+}

package/dist/collections/linked-tree-list/LinkedTreeList.min.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.LinkedTreeList=void 0,require("core-js/modules/web.dom-collections.iterator.js");var _TreeLinker=require("./TreeLinker"),_TreeLinkerIterator=require("../../recipes/TreeLinkerIterator"),_DoublyLinkedList=require("../doubly-linked-list/DoublyLinkedList");class LinkedTreeList{constructor(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:_TreeLinker.TreeLinker;this.classType=LinkedTreeList,this.innerList=null,this.initialized=!1,this.linkerClass=e}initialize(e){return this.initialized?(console.warn("Attempt to initialize LinkedTreeList which is not empty."),this):(this.initialized=!0,this.innerList=e,this)}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}get parent(){return null===this.first?null:this.first.parent}set parent(e){let t=this.first;for(;null!==t;)t.parent=e,t=t.next;e&&(e.children=this)}get rootParent(){let e=this.first;if(!e)return null;let t=this.first.parent;for(;null!==t;)e=t,t=e.parent;return e}setChildren(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:null;Array.from(this).indexOf(e)<0&&console.error("item is not a child of this"),t.parent=e}insertAfter(e,t){return _DoublyLinkedList.DoublyLinkedList.prototype.insertAfter.call(this,e,t)}insertBefore(e,t){return _DoublyLinkedList.DoublyLinkedList.prototype.insertBefore.call(this,e,t)}append(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:this.last;return _DoublyLinkedList.DoublyLinkedList.prototype.append.call(this,e,t)}prepend(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:this.first;return _DoublyLinkedList.DoublyLinkedList.prototype.prepend.call(this,e,t)}remove(e){return _DoublyLinkedList.DoublyLinkedList.prototype.remove.call(this,e)}reset(){return _DoublyLinkedList.DoublyLinkedList.prototype.reset.call(this)}item(e){return _DoublyLinkedList.DoublyLinkedList.prototype.item.call(this,e)}forEach(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:this,i=0,r=t.first;for(;null!==r;)e(r,i,t),r=r.next,++i;return t}[Symbol.iterator](){let e=this.rootParent;return new _TreeLinkerIterator.TreeLinkerIterator(e)}}exports.LinkedTreeList=LinkedTreeList,LinkedTreeList.fromArray=function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[],t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:_TreeLinker.TreeLinker;return new(arguments.length>2&&void 0!==arguments[2]?arguments[2]:LinkedTreeList)(t).initialize(t.fromArray(e).head)};
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.LinkedTreeList=void 0;var _TreeLinker=require("./TreeLinker"),_TreeLinkerIterator=require("../../recipes/TreeLinkerIterator"),_DoublyLinkedList=require("../doubly-linked-list/DoublyLinkedList");class LinkedTreeList{constructor(e=_TreeLinker.TreeLinker){this.classType=LinkedTreeList,this.innerList=null,this.initialized=!1,this.linkerClass=e}initialize(e){return this.initialized?(console.warn("Attempt to initialize LinkedTreeList which is not empty."),this):(this.initialized=!0,this.innerList=e,this)}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}get parent(){return null===this.first?null:this.first.parent}set parent(e){let t=this.first;for(;null!==t;)t.parent=e,t=t.next;e&&(e.children=this)}get rootParent(){let e=this.first;if(!e)return null;let t=this.first.parent;for(;null!==t;)e=t,t=e.parent;return e}setChildren(e,t=null){Array.from(this).indexOf(e)<0&&console.error("item is not a child of this"),t.parent=e}insertAfter(e,t){return _DoublyLinkedList.DoublyLinkedList.prototype.insertAfter.call(this,e,t)}insertBefore(e,t){return _DoublyLinkedList.DoublyLinkedList.prototype.insertBefore.call(this,e,t)}append(e,t=this.last){return _DoublyLinkedList.DoublyLinkedList.prototype.append.call(this,e,t)}prepend(e,t=this.first){return _DoublyLinkedList.DoublyLinkedList.prototype.prepend.call(this,e,t)}remove(e){return _DoublyLinkedList.DoublyLinkedList.prototype.remove.call(this,e)}reset(){return _DoublyLinkedList.DoublyLinkedList.prototype.reset.call(this)}item(e){return _DoublyLinkedList.DoublyLinkedList.prototype.item.call(this,e)}forEach(e,t=this){let i=0,r=t.first;for(;null!==r;)e(r,i,t),r=r.next,++i;return t}[Symbol.iterator](){let e=this.rootParent;return new _TreeLinkerIterator.TreeLinkerIterator(e)}}exports.LinkedTreeList=LinkedTreeList,LinkedTreeList.fromArray=(e=[],t=_TreeLinker.TreeLinker,i=LinkedTreeList)=>new i(t).initialize(t.fromArray(e).head);