collect-your-stuff 2.1.1 → 2.2.0

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

@@ -1,65 +1,56 @@
-/**
- * @file task stack.
- * @author Joshua Heagle <joshuaheagle@gmail.com>
- * @version 1.0.0
- * @memberOf module:collect-your-stuff
- */
-import { Stackable } from './Stackable';
-import { IsArrayable } from '../../recipes/IsArrayable';
-import { IsLinker } from '../../recipes/IsLinker';
-import { completeResponse } from '../../recipes/Runnable';
-/**
- * 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.
- */
-export declare class TaskStack {
-    /** The list which stores the stackables, the first is the top of the stack. */
-    stackedList: IsArrayable<any>;
-    private listClass;
-    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.
-     */
-    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
-     */
-    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}
-     */
-    static fromArray: (values?: Array<any>, stackableClass?: typeof Stackable, listClass?: any) => TaskStack;
-}
+/**
+ * task stack.
+ */
+import { Stackable } from './Stackable';
+import { IsArrayable } from '../../recipes/IsArrayable';
+import { IsLinker } from '../../recipes/IsLinker';
+import { completeResponse } from '../../recipes/Runnable';
+/**
+ * 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.
+ */
+export declare class TaskStack {
+    /** The list which stores the stackables, the first is the top of the stack. */
+    stackedList: IsArrayable<any>;
+    private listClass;
+    private stackableClass;
+    /**
+     * 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?: IsArrayable<any>, listClass?: any, stackableClass?: typeof Stackable);
+    /**
+     * Return true if the stack is empty (there are no tasks in the stacked list)
+     */
+    empty(): boolean;
+    /**
+     * Take a look at the next stacked task
+     */
+    top(): IsLinker;
+    /**
+     * Remove the next stacked task and return it.
+     */
+    pop(): Stackable | completeResponse | null;
+    /**
+     * Push a stackable task 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.
+     */
+    remove(): Stackable | null;
+    /**
+     * Get the size of the current stack.
+     */
+    size(): number;
+    /**
+     * 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
+     */
+    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
-var _Stackable = require('./Stackable')
-var _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,9 +1,5 @@
 /**
  * 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';
@@ -16,6 +12,7 @@ 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';
@@ -27,7 +24,7 @@ import { services } from './services/services';
  * 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 { 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';
@@ -35,6 +32,7 @@ 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';
 /**
@@ -53,6 +51,7 @@ declare const collectYourStuff: {
     Queueable: typeof Queueable;
     Queue: typeof Queue;
     TaskQueue: typeof TaskQueue;
+    ScopedCollection: typeof ScopedCollection;
     Stackable: typeof Stackable;
     Stack: typeof Stack;
     TaskStack: typeof TaskStack;

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,13 +152,14 @@ const collectYourStuff = {
   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
+const _default = exports.default = collectYourStuff
 if (void 0) {
   // @ts-ignore
   (void 0).collectYourStuff = collectYourStuff

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);

package/dist/recipes/ArrayIterator.d.ts

@@ -1,20 +1,20 @@
-import { IsElement } from './IsElement';
-/**
- * Class ArrayIterator returns the next value when using elements of array type list.
- */
-export declare class ArrayIterator implements Iterator<IsElement> {
-    private readonly innerList;
-    private index;
-    /**
-     * Create an iterator over the given array.
-     * @param {Array<IsElement>} innerList The elements to iterate over.
-     * @param {number} [index=0] The position to start from.
-     */
-    constructor(innerList: Array<IsElement>, index?: number);
-    /**
-     * Get the next element, moving the iterator forward.
-     * @param {*} [value] Not used, present to match the Iterator interface.
-     * @return {IteratorResult<IsElement>} The next element, or done when there are no more.
-     */
-    next(value?: any): IteratorResult<IsElement>;
-}
+import { IsElement } from './IsElement';
+/**
+ * Class ArrayIterator returns the next value when using elements of array type list.
+ */
+export declare class ArrayIterator implements Iterator<IsElement> {
+    private readonly innerList;
+    private index;
+    /**
+     * Create an iterator over the given array.
+     * @param innerList The elements to iterate over.
+     * @param index The position to start from.
+     */
+    constructor(innerList: Array<IsElement>, index?: number);
+    /**
+     * Get the next element, moving the iterator forward.
+     * @param value Not used, present to match the Iterator interface.
+     * @returns The next element, or done when there are no more.
+     */
+    next(value?: any): IteratorResult<IsElement>;
+}

package/dist/recipes/ArrayIterator.js

@@ -1,39 +1,39 @@
-'use strict'
-
-Object.defineProperty(exports, '__esModule', {
-  value: true
-})
-exports.ArrayIterator = void 0
-/**
- * Class ArrayIterator returns the next value when using elements of array type list.
- */
-class ArrayIterator {
-  /**
-   * Create an iterator over the given array.
-   * @param {Array<IsElement>} innerList The elements to iterate over.
-   * @param {number} [index=0] The position to start from.
-   */
-  constructor (innerList, index = 0) {
-    this.innerList = innerList
-    this.index = index
-  }
-
-  /**
-   * Get the next element, moving the iterator forward.
-   * @param {*} [value] Not used, present to match the Iterator interface.
-   * @return {IteratorResult<IsElement>} The next element, or done when there are no more.
-   */
-  next (value) {
-    if (this.index < this.innerList.length) {
-      return {
-        value: this.innerList[this.index++],
-        done: false
-      }
-    }
-    return {
-      value: undefined,
-      done: true
-    }
-  }
-}
-exports.ArrayIterator = ArrayIterator
+'use strict'
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+})
+exports.ArrayIterator = void 0
+/**
+ * Class ArrayIterator returns the next value when using elements of array type list.
+ */
+class ArrayIterator {
+  /**
+   * Create an iterator over the given array.
+   * @param innerList The elements to iterate over.
+   * @param index The position to start from.
+   */
+  constructor (innerList, index = 0) {
+    this.innerList = innerList
+    this.index = index
+  }
+
+  /**
+   * Get the next element, moving the iterator forward.
+   * @param value Not used, present to match the Iterator interface.
+   * @returns The next element, or done when there are no more.
+   */
+  next (value) {
+    if (this.index < this.innerList.length) {
+      return {
+        value: this.innerList[this.index++],
+        done: false
+      }
+    }
+    return {
+      value: undefined,
+      done: true
+    }
+  }
+}
+exports.ArrayIterator = ArrayIterator

package/dist/recipes/DoubleLinkerIterator.d.ts

@@ -1,18 +1,18 @@
-import { IsDoubleLinker } from './IsDoubleLinker';
-/**
- * Class DoubleLinkerIterator returns the next value when using linkers of linked type lists.
- */
-export declare class DoubleLinkerIterator implements Iterator<IsDoubleLinker> {
-    private current;
-    /**
-     * Create an iterator starting at the given item.
-     * @param {IsDoubleLinker} current The item to start from.
-     */
-    constructor(current: IsDoubleLinker);
-    /**
-     * Get the current item and move on to the following one.
-     * @param {*} [value] Not used, present to match the Iterator interface.
-     * @return {IteratorResult<IsDoubleLinker>} The current item, or done when there are no more.
-     */
-    next(value?: any): IteratorResult<IsDoubleLinker>;
-}
+import { IsDoubleLinker } from './IsDoubleLinker';
+/**
+ * Class DoubleLinkerIterator returns the next value when using linkers of linked type lists.
+ */
+export declare class DoubleLinkerIterator implements Iterator<IsDoubleLinker> {
+    private current;
+    /**
+     * Create an iterator starting at the given item.
+     * @param current The item to start from.
+     */
+    constructor(current: IsDoubleLinker);
+    /**
+     * Get the current item and move on to the following one.
+     * @param value Not used, present to match the Iterator interface.
+     * @returns The current item, or done when there are no more.
+     */
+    next(value?: any): IteratorResult<IsDoubleLinker>;
+}