collect-your-stuff 1.4.0 → 2.1.0

package/dist/collections/stack/TaskStack.js

@@ -0,0 +1,107 @@
+'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)
+}

package/dist/collections/stack/TaskStack.min.js

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.TaskStack=void 0;var _Stackable=require("./Stackable"),_LinkedList=require("../linked-list/LinkedList");class TaskStack{constructor(t=null,s=_LinkedList.LinkedList,e=_Stackable.Stackable){this.listClass=s,this.stackableClass=e,null===t&&(t=new s(e)),this.stackedList=t}empty(){return this.size()<=0}top(){return this.stackedList.first}pop(){const t=this.remove();return t?t.run():{success:"No more stackable tasks in the stack",error:!1,context:this.stackedList}}push(t){this.stackedList.prepend(t)}remove(){return this.empty()?null:this.stackedList.remove(this.stackedList.first)}size(){return this.stackedList.length}}exports.TaskStack=TaskStack,TaskStack.fromArray=(t=[],s=_Stackable.Stackable,e=_LinkedList.LinkedList)=>{const i=new e(s);return i.initialize(s.fromArray(t,s).head),new TaskStack(i,e,s)};

package/dist/main.d.ts

@@ -16,8 +16,10 @@ 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';
 /**
@@ -26,13 +28,15 @@ 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, Stackable, Stack, recipes, services };
+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
@@ -49,15 +53,17 @@ declare const collectYourStuff: {
     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) => import("./main").IsTreeNode | null;
+        parseTreeNext: (treeNode: import("./main").IsTreeNode, boundaryParent?: import("./main").IsTreeNode | null) => import("./main").IsTreeNode | null;
     };
 };
 export default collectYourStuff;

package/dist/main.js

@@ -69,6 +69,18 @@ Object.defineProperty(exports, 'Stackable', {
     return _Stackable.Stackable
   }
 })
+Object.defineProperty(exports, 'TaskQueue', {
+  enumerable: true,
+  get: function () {
+    return _TaskQueue.TaskQueue
+  }
+})
+Object.defineProperty(exports, 'TaskStack', {
+  enumerable: true,
+  get: function () {
+    return _TaskStack.TaskStack
+  }
+})
 Object.defineProperty(exports, 'TreeLinker', {
   enumerable: true,
   get: function () {
@@ -99,8 +111,10 @@ var _TreeLinker = require('./collections/linked-tree-list/TreeLinker')
 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 _Stackable = require('./collections/stack/Stackable')
 var _Stack = require('./collections/stack/Stack')
+var _TaskStack = require('./collections/stack/TaskStack')
 var _recipes = require('./recipes/recipes')
 var _services = require('./services/services')
 /**
@@ -135,8 +149,10 @@ const collectYourStuff = {
   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
 }

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,"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}}),require("core-js/stable");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"),_Stackable=require("./collections/stack/Stackable"),_Stack=require("./collections/stack/Stack"),_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,Stackable:_Stackable.Stackable,Stack:_Stack.Stack,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,"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}}),require("core-js/stable");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);

package/dist/recipes/IsQueue.d.ts

@@ -0,0 +1,37 @@
+/**
+ * @file Queue recipe.
+ * @author Joshua Heagle <joshuaheagle@gmail.com>
+ * @version 1.0.0
+ * @memberOf module:collect-your-stuff
+ */
+/**
+ * Define a first-in-first-out queue: items are added to the back (enqueue) and taken from the front (dequeue).
+ * This is the shape which si-funciona's queueManager / queueTimeout expect of a queue.
+ */
+export interface IsQueue<T = any> {
+    /**
+     * Take the item from the front of the queue.
+     * @return {T|null} The item, or null when the queue is empty
+     */
+    dequeue: () => T | null;
+    /**
+     * Check whether the queue has no items.
+     * @return {boolean}
+     */
+    empty: () => boolean;
+    /**
+     * Add an item to the back of the queue.
+     * @param {T} data The item to add
+     */
+    enqueue: (data: T) => void;
+    /**
+     * Look at the item at the front of the queue, without removing it.
+     * @return {T|null} The item, or null when the queue is empty
+     */
+    peek: () => T | null;
+    /**
+     * Count the items in the queue.
+     * @return {number}
+     */
+    size: () => number;
+}

package/dist/recipes/IsQueue.js

@@ -0,0 +1,5 @@
+'use strict'
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+})

package/dist/recipes/IsQueue.min.js

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0});

package/dist/recipes/IsStack.d.ts

@@ -0,0 +1,36 @@
+/**
+ * @file Stack recipe.
+ * @author Joshua Heagle <joshuaheagle@gmail.com>
+ * @version 1.0.0
+ * @memberOf module:collect-your-stuff
+ */
+/**
+ * Define a last-in-first-out stack: items are added to the top (push) and taken from the top (pop).
+ */
+export interface IsStack<T = any> {
+    /**
+     * Check whether the stack has no items.
+     * @return {boolean}
+     */
+    empty: () => boolean;
+    /**
+     * Look at the item on the top of the stack, without removing it.
+     * @return {T|null} The item, or null when the stack is empty
+     */
+    peek: () => T | null;
+    /**
+     * Take the item from the top of the stack.
+     * @return {T|null} The item, or null when the stack is empty
+     */
+    pop: () => T | null;
+    /**
+     * Add an item to the top of the stack.
+     * @param {T} data The item to add
+     */
+    push: (data: T) => void;
+    /**
+     * Count the items in the stack.
+     * @return {number}
+     */
+    size: () => number;
+}

package/dist/recipes/IsStack.js

@@ -0,0 +1,5 @@
+'use strict'
+
+Object.defineProperty(exports, '__esModule', {
+  value: true
+})

package/dist/recipes/IsStack.min.js

@@ -0,0 +1 @@
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0});

package/dist/recipes/TreeLinkerIterator.d.ts

@@ -4,11 +4,13 @@ import { IsTreeNode } from './IsTreeNode';
  */
 export declare class TreeLinkerIterator implements Iterator<IsTreeNode> {
     private current;
+    private readonly boundaryParent;
     /**
      * Create an iterator starting at the given item.
      * @param {IsTreeNode} current The item to start from.
+     * @param {IsTreeNode|null} [boundaryParent] The parent of the nodes to stay within (null for the top of a tree), the whole tree when not given.
      */
-    constructor(current: IsTreeNode);
+    constructor(current: IsTreeNode, boundaryParent?: IsTreeNode | null);
     /**
      * Get the current item and move on to the following one (left-first, down each branch).
      * @param {*} [value] Not used, present to match the Iterator interface.

package/dist/recipes/TreeLinkerIterator.js

@@ -12,9 +12,11 @@ class TreeLinkerIterator {
   /**
    * Create an iterator starting at the given item.
    * @param {IsTreeNode} current The item to start from.
+   * @param {IsTreeNode|null} [boundaryParent] The parent of the nodes to stay within (null for the top of a tree), the whole tree when not given.
    */
-  constructor (current) {
+  constructor (current, boundaryParent) {
     this.current = current
+    this.boundaryParent = boundaryParent
   }
 
   /**
@@ -27,7 +29,7 @@ class TreeLinkerIterator {
       value: this.current,
       done: !this.current
     }
-    this.current = (0, _parseTreeNext.parseTreeNext)(this.current)
+    this.current = (0, _parseTreeNext.parseTreeNext)(this.current, this.boundaryParent)
     return result
   }
 }

package/dist/recipes/TreeLinkerIterator.min.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.TreeLinkerIterator=void 0;var _parseTreeNext=require("../services/parseTreeNext");class TreeLinkerIterator{constructor(e){this.current=e}next(e){const r={value:this.current,done:!this.current};return this.current=(0,_parseTreeNext.parseTreeNext)(this.current),r}}exports.TreeLinkerIterator=TreeLinkerIterator;
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.TreeLinkerIterator=void 0;var _parseTreeNext=require("../services/parseTreeNext");class TreeLinkerIterator{constructor(e,r){this.current=e,this.boundaryParent=r}next(e){const r={value:this.current,done:!this.current};return this.current=(0,_parseTreeNext.parseTreeNext)(this.current,this.boundaryParent),r}}exports.TreeLinkerIterator=TreeLinkerIterator;

package/dist/services/parseTreeNext.d.ts

@@ -8,7 +8,10 @@ import { IsTreeNode } from '../recipes/IsTreeNode';
  * 5. Repeat 3
  * 6. If no next child, return to parent and repeat 3
  * 7. Stop at root (next is null and parent is null
+ * A boundary can be given to parse only part of a tree: going back up to the parents stops at the boundary, so the
+ * parsing stays within the nodes whose parent is the boundary (and everything below them).
  * @param {IsTreeNode} treeNode Provide a node in a tree and get the next node (left-first approach)
+ * @param {IsTreeNode|null} [boundaryParent] The parent of the nodes to stay within, null for the nodes at the top of a tree. When it is not given the whole tree is parsed.
  * @returns {IsTreeNode|null}
  */
-export declare const parseTreeNext: (treeNode: IsTreeNode) => IsTreeNode | null;
+export declare const parseTreeNext: (treeNode: IsTreeNode, boundaryParent?: IsTreeNode | null) => IsTreeNode | null;

package/dist/services/parseTreeNext.js

@@ -13,35 +13,30 @@ exports.parseTreeNext = void 0
  * 5. Repeat 3
  * 6. If no next child, return to parent and repeat 3
  * 7. Stop at root (next is null and parent is null
+ * A boundary can be given to parse only part of a tree: going back up to the parents stops at the boundary, so the
+ * parsing stays within the nodes whose parent is the boundary (and everything below them).
  * @param {IsTreeNode} treeNode Provide a node in a tree and get the next node (left-first approach)
+ * @param {IsTreeNode|null} [boundaryParent] The parent of the nodes to stay within, null for the nodes at the top of a tree. When it is not given the whole tree is parsed.
  * @returns {IsTreeNode|null}
  */
-const parseTreeNext = treeNode => {
+const parseTreeNext = (treeNode, boundaryParent) => {
   if (!treeNode) {
     return null
   }
-  let test = null
   if (treeNode.children && treeNode.children.length) {
-    // Go down the left side of the tree
-    test = treeNode.children.first
+    return treeNode.children.first
   }
-  if (!test) {
-    // Reached the bottom, go the next node on the right
-    test = treeNode.next
+  if (treeNode.next) {
+    return treeNode.next
   }
-  if (!test && treeNode.parent) {
-    // No more child nodes, return to parent and check parent sibling on the right
-    let parentNext = treeNode.parent.next
-    let parent = treeNode.parent
-    while (parent && !parentNext) {
-      parentNext = parent.next
-      // Keep checking parent next, until there are no more parents, or we find the parent sibling
-      parent = parent.parent
+  // Nothing more below or beside this node, so go back up until there is a node which has a next (or the boundary)
+  let parent = treeNode.parent
+  while (parent && parent !== boundaryParent) {
+    if (parent.next) {
+      return parent.next
     }
-    // This may be the parent sibling, or it could be null indicating we are done
-    test = parentNext
+    parent = parent.parent
   }
-  // Finally, either use the node we found, or it may be null
-  return test
+  return null
 }
 exports.parseTreeNext = parseTreeNext

package/dist/services/parseTreeNext.min.js

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.parseTreeNext=void 0;const parseTreeNext=e=>{if(!e)return null;let r=null;if(e.children&&e.children.length&&(r=e.children.first),r||(r=e.next),!r&&e.parent){let t=e.parent.next,n=e.parent;for(;n&&!t;)t=n.next,n=n.parent;r=t}return r};exports.parseTreeNext=parseTreeNext;
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.parseTreeNext=void 0;const parseTreeNext=(e,r)=>{if(!e)return null;if(e.children&&e.children.length)return e.children.first;if(e.next)return e.next;let t=e.parent;for(;t&&t!==r;){if(t.next)return t.next;t=t.parent}return null};exports.parseTreeNext=parseTreeNext;

package/dist/services/services.d.ts

@@ -9,5 +9,5 @@
  */
 export declare const services: {
     parseTree: (tree: import("../main").IsTree, callback: import("../main").forEachCallback) => import("../main").IsTree;
-    parseTreeNext: (treeNode: import("../main").IsTreeNode) => import("../main").IsTreeNode | null;
+    parseTreeNext: (treeNode: import("../main").IsTreeNode, boundaryParent?: import("../main").IsTreeNode | null) => import("../main").IsTreeNode | null;
 };

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "collect-your-stuff",
   "description": "Use a variety of collections to collect your stuff when building code.",
-  "version": "1.4.0",
+  "version": "2.1.0",
   "main": "dist/main.js",
   "types": "dist/main.d.ts",
   "author": "Joshua Heagle",