collect-your-stuff 2.1.2 → 2.2.0

package/dist/collections/stack/Stackable.js

@@ -1,85 +1,81 @@
-'use strict'
-
-Object.defineProperty(exports, '__esModule', {
-  value: true
-})
-exports.Stackable = void 0
-const _Linker = require('../linked-list/Linker')
-/**
- * Stackable represents a runnable entry in stack.
- * @extends Linker
- */
-class Stackable {
-  /**
-   * Create a stackable item that can be used in a stack.
-   * @param {Object} [stackData={}] The settings for the new stackable.
-   * @param {*} [stackData.task=null] The data to be stored in this stackable
-   * @param {Stackable|null} [stackData.next=null] The reference to the next stackable if any
-   * @param {boolean|Function} [stackData.ready=false] Indicate if the stackable is ready to run
-   */
-  constructor ({
-    task = null,
-    next = null,
-    ready = false
-  } = {}) {
-    /** The task (or data) this stackable holds. */
-    this.data = null
-    /** The stackable below this one, or null when this is the bottom. */
-    this.next = null
-    this.classType = Stackable
-    this.data = task
-    this.next = next
-  }
-
-  /**
-   * Retrieve the data which should be formed as a task.
-   * @return {*}
-   */
-  get task () {
-    if (typeof this.data === 'function') {
-      return this.data
-    }
-    return () => this.data
-  }
-
-  /**
-   * Run the stacked task.
-   * @return {*}
-   */
-  run () {
-    return this.task()
-  }
-}
-/**
- * Make a new Stackable from the data given if it is not already a valid Stackable.
- * @param {Stackable|*} stackable Return a valid Stackable instance from given data, or even an already valid one.
- * @param {IsLinker} [classType=Stackable] Provide the type of IsLinker to use.
- * @return {Stackable}
- */
-exports.Stackable = Stackable
-Stackable.make = (stackable, classType = Stackable) => {
-  if (stackable === null || typeof stackable !== 'object') {
-    // It is not an object (or it is null), so instantiate the Stackable with stackable as the data
-    return new classType({
-      task: stackable
-    })
-  }
-  if (stackable.classType) {
-    // Already valid Stackable, return as-is
-    return stackable
-  }
-  if (!('task' in stackable)) {
-    stackable = {
-      task: stackable
-    }
-  }
-  // Create the new node as the configured stackableClass
-  return new classType(stackable)
-}
-/**
- * Convert an array into Stackable instances, return the head and tail Stackables.
- * @param {Array} [values=[]] Provide an array of data that will be converted to a chain of stackable linkers.
- * @param {IsLinker} [classType=Stackable] Provide the type of IsLinker to use.
- * @returns {{head: Stackable, tail: Stackable}}
- */
-Stackable.fromArray = (values = [], classType = Stackable) => _Linker.Linker.fromArray(values, classType)
+'use strict'
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+})
+exports.Stackable = void 0
+const _Linker = require('../linked-list/Linker')
+/**
+ * Stackable represents a runnable entry in stack.
+ * @extends Linker
+ */
+class Stackable {
+  /**
+   * Create a stackable item that can be used in a stack.
+   * @param stackData The settings for the new stackable.
+   * @param stackData.task The data to be stored in this stackable
+   * @param stackData.next The reference to the next stackable if any
+   * @param stackData.ready Indicate if the stackable is ready to run
+   */
+  constructor ({
+    task = null,
+    next = null,
+    ready = false
+  } = {}) {
+    /** The task (or data) this stackable holds. */
+    this.data = null
+    /** The stackable below this one, or null when this is the bottom. */
+    this.next = null
+    this.classType = Stackable
+    this.data = task
+    this.next = next
+  }
+
+  /**
+   * Retrieve the data which should be formed as a task.
+   */
+  get task () {
+    if (typeof this.data === 'function') {
+      return this.data
+    }
+    return () => this.data
+  }
+
+  /**
+   * Run the stacked task.
+   */
+  run () {
+    return this.task()
+  }
+}
+/**
+ * Make a new Stackable from the data given if it is not already a valid Stackable.
+ * @param stackable Return a valid Stackable instance from given data, or even an already valid one.
+ * @param classType Provide the type of IsLinker to use.
+ */
+exports.Stackable = Stackable
+Stackable.make = (stackable, classType = Stackable) => {
+  if (stackable === null || typeof stackable !== 'object') {
+    // It is not an object (or it is null), so instantiate the Stackable with stackable as the data
+    return new classType({
+      task: stackable
+    })
+  }
+  if (stackable.classType) {
+    // Already valid Stackable, return as-is
+    return stackable
+  }
+  if (!('task' in stackable)) {
+    stackable = {
+      task: stackable
+    }
+  }
+  // Create the new node as the configured stackableClass
+  return new classType(stackable)
+}
+/**
+ * Convert an array into Stackable instances, return the head and tail Stackables.
+ * @param values Provide an array of data that will be converted to a chain of stackable linkers.
+ * @param classType Provide the type of IsLinker to use.
+ */
+Stackable.fromArray = (values = [], classType = Stackable) => _Linker.Linker.fromArray(values, classType)

package/dist/collections/stack/TaskStack.d.ts

@@ -1,8 +1,5 @@
 /**
- * @file task stack.
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.0.0
- * @memberOf module:collect-your-stuff
+ * task stack.
  */
 import { Stackable } from './Stackable';
 import { IsArrayable } from '../../recipes/IsArrayable';
@@ -19,47 +16,41 @@ export declare class TaskStack {
     private stackableClass;
     /**
      * Instantiate the state with the starter stacked list.
-     * @param {Iterable|LinkedList} [stackedList=null] The list of stackables to start in this stack.
-     * @param {IsArrayable} [listClass=LinkedList] The type of list to create when no stacked list is given.
-     * @param {Stackable} [stackableClass=Stackable] The class used to wrap stacked items.
+     * @param stackedList The list of stackables to start in this stack.
+     * @param listClass The type of list to create when no stacked list is given.
+     * @param stackableClass The class used to wrap stacked items.
      */
     constructor(stackedList?: IsArrayable<any>, listClass?: any, stackableClass?: typeof Stackable);
     /**
      * Return true if the stack is empty (there are no tasks in the stacked list)
-     * @return {boolean}
      */
     empty(): boolean;
     /**
      * Take a look at the next stacked task
-     * @return {Stackable}
      */
     top(): IsLinker;
     /**
      * Remove the next stacked task and return it.
-     * @return {Stackable|null}
      */
     pop(): Stackable | completeResponse | null;
     /**
      * Push a stackable task to the top of the stack.
-     * @param {Stackable|*} stackable Add a new stackable to the top of the stack
+     * @param stackable Add a new stackable to the top of the stack
      */
     push(stackable: any): void;
     /**
      * Remove the next stacked task and return it.
-     * @return {Stackable|null}
      */
     remove(): Stackable | null;
     /**
      * Get the size of the current stack.
-     * @return {number}
      */
     size(): number;
     /**
      * Convert an array to a TaskStack.
-     * @param {Array} values An array of values which will be converted to stackables in this queue
-     * @param {Stackable} stackableClass The class to use for each stackable
-     * @param {TaskStack|Iterable} listClass The class to use to manage the stackables
-     * @returns {TaskStack}
+     * @param values An array of values which will be converted to stackables in this queue
+     * @param stackableClass The class to use for each stackable
+     * @param listClass The class to use to manage the stackables
      */
     static fromArray: (values?: Array<any>, stackableClass?: typeof Stackable, listClass?: any) => TaskStack;
 }

package/dist/collections/stack/TaskStack.js

@@ -1,107 +1,98 @@
-'use strict'
-
-Object.defineProperty(exports, '__esModule', {
-  value: true
-})
-exports.TaskStack = void 0
-const _Stackable = require('./Stackable')
-const _LinkedList = require('../linked-list/LinkedList')
-/**
- * @file task stack.
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.0.0
- * @memberOf module:collect-your-stuff
- */
-
-/**
- * Store a collection of tasks (Stackables) which can only be inserted and removed from the top: pop() takes the task from
- * the top and RUNS it. For a plain last-in-first-out collection of items use Stack.
- */
-class TaskStack {
-  /**
-   * Instantiate the state with the starter stacked list.
-   * @param {Iterable|LinkedList} [stackedList=null] The list of stackables to start in this stack.
-   * @param {IsArrayable} [listClass=LinkedList] The type of list to create when no stacked list is given.
-   * @param {Stackable} [stackableClass=Stackable] The class used to wrap stacked items.
-   */
-  constructor (stackedList = null, listClass = _LinkedList.LinkedList, stackableClass = _Stackable.Stackable) {
-    this.listClass = listClass
-    this.stackableClass = stackableClass
-    if (stackedList === null) {
-      stackedList = new listClass(stackableClass)
-    }
-    this.stackedList = stackedList
-  }
-
-  /**
-   * Return true if the stack is empty (there are no tasks in the stacked list)
-   * @return {boolean}
-   */
-  empty () {
-    return this.size() <= 0
-  }
-
-  /**
-   * Take a look at the next stacked task
-   * @return {Stackable}
-   */
-  top () {
-    return this.stackedList.first
-  }
-
-  /**
-   * Remove the next stacked task and return it.
-   * @return {Stackable|null}
-   */
-  pop () {
-    const next = this.remove()
-    if (!next) {
-      return {
-        success: 'No more stackable tasks in the stack',
-        error: false,
-        context: this.stackedList
-      }
-    }
-    return next.run()
-  }
-
-  /**
-   * Push a stackable task to the top of the stack.
-   * @param {Stackable|*} stackable Add a new stackable to the top of the stack
-   */
-  push (stackable) {
-    this.stackedList.prepend(stackable)
-  }
-
-  /**
-   * Remove the next stacked task and return it.
-   * @return {Stackable|null}
-   */
-  remove () {
-    if (this.empty()) {
-      return null
-    }
-    return this.stackedList.remove(this.stackedList.first)
-  }
-
-  /**
-   * Get the size of the current stack.
-   * @return {number}
-   */
-  size () {
-    return this.stackedList.length
-  }
-}
-/**
- * Convert an array to a TaskStack.
- * @param {Array} values An array of values which will be converted to stackables in this queue
- * @param {Stackable} stackableClass The class to use for each stackable
- * @param {TaskStack|Iterable} listClass The class to use to manage the stackables
- * @returns {TaskStack}
- */
-exports.TaskStack = TaskStack
-TaskStack.fromArray = (values = [], stackableClass = _Stackable.Stackable, listClass = _LinkedList.LinkedList) => {
-  const list = new listClass(stackableClass)
-  list.initialize(stackableClass.fromArray(values, stackableClass).head)
-  return new TaskStack(list, listClass, stackableClass)
-}
+'use strict'
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+})
+exports.TaskStack = void 0
+const _Stackable = require('./Stackable')
+const _LinkedList = require('../linked-list/LinkedList')
+/**
+ * task stack.
+ */
+
+/**
+ * Store a collection of tasks (Stackables) which can only be inserted and removed from the top: pop() takes the task from
+ * the top and RUNS it. For a plain last-in-first-out collection of items use Stack.
+ */
+class TaskStack {
+  /**
+   * Instantiate the state with the starter stacked list.
+   * @param stackedList The list of stackables to start in this stack.
+   * @param listClass The type of list to create when no stacked list is given.
+   * @param stackableClass The class used to wrap stacked items.
+   */
+  constructor (stackedList = null, listClass = _LinkedList.LinkedList, stackableClass = _Stackable.Stackable) {
+    this.listClass = listClass
+    this.stackableClass = stackableClass
+    if (stackedList === null) {
+      stackedList = new listClass(stackableClass)
+    }
+    this.stackedList = stackedList
+  }
+
+  /**
+   * Return true if the stack is empty (there are no tasks in the stacked list)
+   */
+  empty () {
+    return this.size() <= 0
+  }
+
+  /**
+   * Take a look at the next stacked task
+   */
+  top () {
+    return this.stackedList.first
+  }
+
+  /**
+   * Remove the next stacked task and return it.
+   */
+  pop () {
+    const next = this.remove()
+    if (!next) {
+      return {
+        success: 'No more stackable tasks in the stack',
+        error: false,
+        context: this.stackedList
+      }
+    }
+    return next.run()
+  }
+
+  /**
+   * Push a stackable task to the top of the stack.
+   * @param stackable Add a new stackable to the top of the stack
+   */
+  push (stackable) {
+    this.stackedList.prepend(stackable)
+  }
+
+  /**
+   * Remove the next stacked task and return it.
+   */
+  remove () {
+    if (this.empty()) {
+      return null
+    }
+    return this.stackedList.remove(this.stackedList.first)
+  }
+
+  /**
+   * Get the size of the current stack.
+   */
+  size () {
+    return this.stackedList.length
+  }
+}
+/**
+ * Convert an array to a TaskStack.
+ * @param values An array of values which will be converted to stackables in this queue
+ * @param stackableClass The class to use for each stackable
+ * @param listClass The class to use to manage the stackables
+ */
+exports.TaskStack = TaskStack
+TaskStack.fromArray = (values = [], stackableClass = _Stackable.Stackable, listClass = _LinkedList.LinkedList) => {
+  const list = new listClass(stackableClass)
+  list.initialize(stackableClass.fromArray(values, stackableClass).head)
+  return new TaskStack(list, listClass, stackableClass)
+}

package/dist/main.d.ts

@@ -1,68 +1,67 @@
-/**
- * All of the collections available.
- * @file
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.0.0
- * @module collect-your-stuff
- */
-import { ArrayElement } from './collections/arrayable/ArrayElement';
-import { Arrayable } from './collections/arrayable/Arrayable';
-import { DoubleLinker } from './collections/doubly-linked-list/DoubleLinker';
-import { DoublyLinkedList } from './collections/doubly-linked-list/DoublyLinkedList';
-import { Linker } from './collections/linked-list/Linker';
-import { LinkedList } from './collections/linked-list/LinkedList';
-import { TreeLinker } from './collections/linked-tree-list/TreeLinker';
-import { LinkedTreeList } from './collections/linked-tree-list/LinkedTreeList';
-import { Queueable } from './collections/queue/Queueable';
-import { Queue } from './collections/queue/Queue';
-import { TaskQueue } from './collections/queue/TaskQueue';
-import { Stackable } from './collections/stack/Stackable';
-import { Stack } from './collections/stack/Stack';
-import { TaskStack } from './collections/stack/TaskStack';
-import { recipes } from './recipes/recipes';
-import { services } from './services/services';
-/**
- * TODO:
- * 1. Create binary tree. Use the tree, but it has a limit of only two children per parent, and when adding / removing sort is applied. Add sort function in fromArray
- * 2. Create a heap (both min and max heap variants) which is similar to binary tree in structure, but tree having its min / max value as root. and it must insert on the left-most lowest level, and removes from root. Be able to easily swap nodes to ensure min / max ordering.
- * 3. Create a graph type which can have directional and undirectional variants for linking nodes
- */
-export { ArrayElement, Arrayable, DoubleLinker, DoublyLinkedList, Linker, LinkedList, TreeLinker, LinkedTreeList, Queueable, Queue, TaskQueue, Stackable, Stack, TaskStack, recipes, services };
-export type { IsArrayable, forEachCallback } from './recipes/IsArrayable';
-export type { IsDoubleLinker } from './recipes/IsDoubleLinker';
-export type { IsElement } from './recipes/IsElement';
-export type { IsLinker } from './recipes/IsLinker';
-export type { IsTree } from './recipes/IsTree';
-export type { IsTreeNode } from './recipes/IsTreeNode';
-export type { IsQueue } from './recipes/IsQueue';
-export type { IsStack } from './recipes/IsStack';
-export type { IsRunnable, completeResponse } from './recipes/Runnable';
-/**
- * All methods exported from this module are encapsulated within collect-your-stuff (this default export is the same
- * set of classes as the named exports).
- */
-declare const collectYourStuff: {
-    ArrayElement: typeof ArrayElement;
-    Arrayable: typeof Arrayable;
-    DoubleLinker: typeof DoubleLinker;
-    DoublyLinkedList: typeof DoublyLinkedList;
-    Linker: typeof Linker;
-    LinkedList: typeof LinkedList;
-    TreeLinker: typeof TreeLinker;
-    LinkedTreeList: typeof LinkedTreeList;
-    Queueable: typeof Queueable;
-    Queue: typeof Queue;
-    TaskQueue: typeof TaskQueue;
-    Stackable: typeof Stackable;
-    Stack: typeof Stack;
-    TaskStack: typeof TaskStack;
-    recipes: {
-        ArrayIterator: typeof import("./recipes/ArrayIterator").ArrayIterator;
-        Runnable: typeof import("./recipes/Runnable").Runnable;
-    };
-    services: {
-        parseTree: (tree: import("./main").IsTree, callback: import("./main").forEachCallback) => import("./main").IsTree;
-        parseTreeNext: (treeNode: import("./main").IsTreeNode, boundaryParent?: import("./main").IsTreeNode | null) => import("./main").IsTreeNode | null;
-    };
-};
-export default collectYourStuff;
+/**
+ * All of the collections available.
+ */
+import { ArrayElement } from './collections/arrayable/ArrayElement';
+import { Arrayable } from './collections/arrayable/Arrayable';
+import { DoubleLinker } from './collections/doubly-linked-list/DoubleLinker';
+import { DoublyLinkedList } from './collections/doubly-linked-list/DoublyLinkedList';
+import { Linker } from './collections/linked-list/Linker';
+import { LinkedList } from './collections/linked-list/LinkedList';
+import { TreeLinker } from './collections/linked-tree-list/TreeLinker';
+import { LinkedTreeList } from './collections/linked-tree-list/LinkedTreeList';
+import { Queueable } from './collections/queue/Queueable';
+import { Queue } from './collections/queue/Queue';
+import { TaskQueue } from './collections/queue/TaskQueue';
+import { ScopedCollection } from './collections/scoped-collection/ScopedCollection';
+import { Stackable } from './collections/stack/Stackable';
+import { Stack } from './collections/stack/Stack';
+import { TaskStack } from './collections/stack/TaskStack';
+import { recipes } from './recipes/recipes';
+import { services } from './services/services';
+/**
+ * TODO:
+ * 1. Create binary tree. Use the tree, but it has a limit of only two children per parent, and when adding / removing sort is applied. Add sort function in fromArray
+ * 2. Create a heap (both min and max heap variants) which is similar to binary tree in structure, but tree having its min / max value as root. and it must insert on the left-most lowest level, and removes from root. Be able to easily swap nodes to ensure min / max ordering.
+ * 3. Create a graph type which can have directional and undirectional variants for linking nodes
+ */
+export { ArrayElement, Arrayable, DoubleLinker, DoublyLinkedList, Linker, LinkedList, TreeLinker, LinkedTreeList, Queueable, Queue, TaskQueue, ScopedCollection, Stackable, Stack, TaskStack, recipes, services };
+export type { IsArrayable, forEachCallback } from './recipes/IsArrayable';
+export type { IsDoubleLinker } from './recipes/IsDoubleLinker';
+export type { IsElement } from './recipes/IsElement';
+export type { IsLinker } from './recipes/IsLinker';
+export type { IsTree } from './recipes/IsTree';
+export type { IsTreeNode } from './recipes/IsTreeNode';
+export type { IsQueue } from './recipes/IsQueue';
+export type { IsScopedCollection } from './recipes/IsScopedCollection';
+export type { IsStack } from './recipes/IsStack';
+export type { IsRunnable, completeResponse } from './recipes/Runnable';
+/**
+ * All methods exported from this module are encapsulated within collect-your-stuff (this default export is the same
+ * set of classes as the named exports).
+ */
+declare const collectYourStuff: {
+    ArrayElement: typeof ArrayElement;
+    Arrayable: typeof Arrayable;
+    DoubleLinker: typeof DoubleLinker;
+    DoublyLinkedList: typeof DoublyLinkedList;
+    Linker: typeof Linker;
+    LinkedList: typeof LinkedList;
+    TreeLinker: typeof TreeLinker;
+    LinkedTreeList: typeof LinkedTreeList;
+    Queueable: typeof Queueable;
+    Queue: typeof Queue;
+    TaskQueue: typeof TaskQueue;
+    ScopedCollection: typeof ScopedCollection;
+    Stackable: typeof Stackable;
+    Stack: typeof Stack;
+    TaskStack: typeof TaskStack;
+    recipes: {
+        ArrayIterator: typeof import("./recipes/ArrayIterator").ArrayIterator;
+        Runnable: typeof import("./recipes/Runnable").Runnable;
+    };
+    services: {
+        parseTree: (tree: import("./main").IsTree, callback: import("./main").forEachCallback) => import("./main").IsTree;
+        parseTreeNext: (treeNode: import("./main").IsTreeNode, boundaryParent?: import("./main").IsTreeNode | null) => import("./main").IsTreeNode | null;
+    };
+};
+export default collectYourStuff;

package/dist/main.js

@@ -57,6 +57,12 @@ Object.defineProperty(exports, 'Queueable', {
     return _Queueable.Queueable
   }
 })
+Object.defineProperty(exports, 'ScopedCollection', {
+  enumerable: true,
+  get: function () {
+    return _ScopedCollection.ScopedCollection
+  }
+})
 Object.defineProperty(exports, 'Stack', {
   enumerable: true,
   get: function () {
@@ -111,6 +117,7 @@ var _LinkedTreeList = require('./collections/linked-tree-list/LinkedTreeList')
 var _Queueable = require('./collections/queue/Queueable')
 var _Queue = require('./collections/queue/Queue')
 var _TaskQueue = require('./collections/queue/TaskQueue')
+var _ScopedCollection = require('./collections/scoped-collection/ScopedCollection')
 var _Stackable = require('./collections/stack/Stackable')
 var _Stack = require('./collections/stack/Stack')
 var _TaskStack = require('./collections/stack/TaskStack')
@@ -118,10 +125,6 @@ var _recipes = require('./recipes/recipes')
 var _services = require('./services/services')
 /**
  * All of the collections available.
- * @file
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.0.0
- * @module collect-your-stuff
  */
 
 /**
@@ -149,6 +152,7 @@ const collectYourStuff = {
   Queueable: _Queueable.Queueable,
   Queue: _Queue.Queue,
   TaskQueue: _TaskQueue.TaskQueue,
+  ScopedCollection: _ScopedCollection.ScopedCollection,
   Stackable: _Stackable.Stackable,
   Stack: _Stack.Stack,
   TaskStack: _TaskStack.TaskStack,

package/dist/main.min.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),Object.defineProperty(exports,"ArrayElement",{enumerable:!0,get:function(){return _ArrayElement.ArrayElement}}),Object.defineProperty(exports,"Arrayable",{enumerable:!0,get:function(){return _Arrayable.Arrayable}}),Object.defineProperty(exports,"DoubleLinker",{enumerable:!0,get:function(){return _DoubleLinker.DoubleLinker}}),Object.defineProperty(exports,"DoublyLinkedList",{enumerable:!0,get:function(){return _DoublyLinkedList.DoublyLinkedList}}),Object.defineProperty(exports,"LinkedList",{enumerable:!0,get:function(){return _LinkedList.LinkedList}}),Object.defineProperty(exports,"LinkedTreeList",{enumerable:!0,get:function(){return _LinkedTreeList.LinkedTreeList}}),Object.defineProperty(exports,"Linker",{enumerable:!0,get:function(){return _Linker.Linker}}),Object.defineProperty(exports,"Queue",{enumerable:!0,get:function(){return _Queue.Queue}}),Object.defineProperty(exports,"Queueable",{enumerable:!0,get:function(){return _Queueable.Queueable}}),Object.defineProperty(exports,"Stack",{enumerable:!0,get:function(){return _Stack.Stack}}),Object.defineProperty(exports,"Stackable",{enumerable:!0,get:function(){return _Stackable.Stackable}}),Object.defineProperty(exports,"TaskQueue",{enumerable:!0,get:function(){return _TaskQueue.TaskQueue}}),Object.defineProperty(exports,"TaskStack",{enumerable:!0,get:function(){return _TaskStack.TaskStack}}),Object.defineProperty(exports,"TreeLinker",{enumerable:!0,get:function(){return _TreeLinker.TreeLinker}}),exports.default=void 0,Object.defineProperty(exports,"recipes",{enumerable:!0,get:function(){return _recipes.recipes}}),Object.defineProperty(exports,"services",{enumerable:!0,get:function(){return _services.services}});var _ArrayElement=require("./collections/arrayable/ArrayElement"),_Arrayable=require("./collections/arrayable/Arrayable"),_DoubleLinker=require("./collections/doubly-linked-list/DoubleLinker"),_DoublyLinkedList=require("./collections/doubly-linked-list/DoublyLinkedList"),_Linker=require("./collections/linked-list/Linker"),_LinkedList=require("./collections/linked-list/LinkedList"),_TreeLinker=require("./collections/linked-tree-list/TreeLinker"),_LinkedTreeList=require("./collections/linked-tree-list/LinkedTreeList"),_Queueable=require("./collections/queue/Queueable"),_Queue=require("./collections/queue/Queue"),_TaskQueue=require("./collections/queue/TaskQueue"),_Stackable=require("./collections/stack/Stackable"),_Stack=require("./collections/stack/Stack"),_TaskStack=require("./collections/stack/TaskStack"),_recipes=require("./recipes/recipes"),_services=require("./services/services");const collectYourStuff={ArrayElement:_ArrayElement.ArrayElement,Arrayable:_Arrayable.Arrayable,DoubleLinker:_DoubleLinker.DoubleLinker,DoublyLinkedList:_DoublyLinkedList.DoublyLinkedList,Linker:_Linker.Linker,LinkedList:_LinkedList.LinkedList,TreeLinker:_TreeLinker.TreeLinker,LinkedTreeList:_LinkedTreeList.LinkedTreeList,Queueable:_Queueable.Queueable,Queue:_Queue.Queue,TaskQueue:_TaskQueue.TaskQueue,Stackable:_Stackable.Stackable,Stack:_Stack.Stack,TaskStack:_TaskStack.TaskStack,recipes:_recipes.recipes,services:_services.services};var _default=exports.default=collectYourStuff;"undefined"!=typeof window&&(window.collectYourStuff=collectYourStuff);
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),Object.defineProperty(exports,"ArrayElement",{enumerable:!0,get:function(){return _ArrayElement.ArrayElement}}),Object.defineProperty(exports,"Arrayable",{enumerable:!0,get:function(){return _Arrayable.Arrayable}}),Object.defineProperty(exports,"DoubleLinker",{enumerable:!0,get:function(){return _DoubleLinker.DoubleLinker}}),Object.defineProperty(exports,"DoublyLinkedList",{enumerable:!0,get:function(){return _DoublyLinkedList.DoublyLinkedList}}),Object.defineProperty(exports,"LinkedList",{enumerable:!0,get:function(){return _LinkedList.LinkedList}}),Object.defineProperty(exports,"LinkedTreeList",{enumerable:!0,get:function(){return _LinkedTreeList.LinkedTreeList}}),Object.defineProperty(exports,"Linker",{enumerable:!0,get:function(){return _Linker.Linker}}),Object.defineProperty(exports,"Queue",{enumerable:!0,get:function(){return _Queue.Queue}}),Object.defineProperty(exports,"Queueable",{enumerable:!0,get:function(){return _Queueable.Queueable}}),Object.defineProperty(exports,"ScopedCollection",{enumerable:!0,get:function(){return _ScopedCollection.ScopedCollection}}),Object.defineProperty(exports,"Stack",{enumerable:!0,get:function(){return _Stack.Stack}}),Object.defineProperty(exports,"Stackable",{enumerable:!0,get:function(){return _Stackable.Stackable}}),Object.defineProperty(exports,"TaskQueue",{enumerable:!0,get:function(){return _TaskQueue.TaskQueue}}),Object.defineProperty(exports,"TaskStack",{enumerable:!0,get:function(){return _TaskStack.TaskStack}}),Object.defineProperty(exports,"TreeLinker",{enumerable:!0,get:function(){return _TreeLinker.TreeLinker}}),exports.default=void 0,Object.defineProperty(exports,"recipes",{enumerable:!0,get:function(){return _recipes.recipes}}),Object.defineProperty(exports,"services",{enumerable:!0,get:function(){return _services.services}});var _ArrayElement=require("./collections/arrayable/ArrayElement"),_Arrayable=require("./collections/arrayable/Arrayable"),_DoubleLinker=require("./collections/doubly-linked-list/DoubleLinker"),_DoublyLinkedList=require("./collections/doubly-linked-list/DoublyLinkedList"),_Linker=require("./collections/linked-list/Linker"),_LinkedList=require("./collections/linked-list/LinkedList"),_TreeLinker=require("./collections/linked-tree-list/TreeLinker"),_LinkedTreeList=require("./collections/linked-tree-list/LinkedTreeList"),_Queueable=require("./collections/queue/Queueable"),_Queue=require("./collections/queue/Queue"),_TaskQueue=require("./collections/queue/TaskQueue"),_ScopedCollection=require("./collections/scoped-collection/ScopedCollection"),_Stackable=require("./collections/stack/Stackable"),_Stack=require("./collections/stack/Stack"),_TaskStack=require("./collections/stack/TaskStack"),_recipes=require("./recipes/recipes"),_services=require("./services/services");const collectYourStuff={ArrayElement:_ArrayElement.ArrayElement,Arrayable:_Arrayable.Arrayable,DoubleLinker:_DoubleLinker.DoubleLinker,DoublyLinkedList:_DoublyLinkedList.DoublyLinkedList,Linker:_Linker.Linker,LinkedList:_LinkedList.LinkedList,TreeLinker:_TreeLinker.TreeLinker,LinkedTreeList:_LinkedTreeList.LinkedTreeList,Queueable:_Queueable.Queueable,Queue:_Queue.Queue,TaskQueue:_TaskQueue.TaskQueue,ScopedCollection:_ScopedCollection.ScopedCollection,Stackable:_Stackable.Stackable,Stack:_Stack.Stack,TaskStack:_TaskStack.TaskStack,recipes:_recipes.recipes,services:_services.services};var _default=exports.default=collectYourStuff;"undefined"!=typeof window&&(window.collectYourStuff=collectYourStuff);