@trenskow/parse 0.1.9 → 0.1.10

package/index.js

@@ -113,9 +113,9 @@ export default (...args) => {
 
 							if (typeof boundary !== 'undefined') {
 
-								if (maxDepth > depth) {
+								foundBoundaries.push(boundary);
 
-									foundBoundaries.push(boundary);
+								if (maxDepth > depth) {
 
 									let value;
 
@@ -132,9 +132,9 @@ export default (...args) => {
 
 							} else if (typeof nextBoundary !== 'undefined' && text.substring(idx, idx + nextBoundary[1].length) === nextBoundary[1]) {
 
-								if (ignoredDepths === 0) {
+								foundBoundaries.pop();
 
-									foundBoundaries.pop();
+								if (ignoredDepths === 0) {
 
 									if (depth > 0 && options.boundaries === 'include') {
 										if (Array.isArray(result[0])) result[0] = [nextBoundary[0]].concat(result[0]);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@trenskow/parse",
-  "version": "0.1.9",
+  "version": "0.1.10",
   "description": "A small library for parsing a string into a tree.",
   "main": "index.js",
   "type": "module",

package/test.js

@@ -73,10 +73,10 @@ describe('parser', () => {
 		]);
 	});
 	it ('should come back with parsed tree (max depth = 1).', () => {
-		expect(parse('[', ']', { maxDepth: 1 }).do('This [is [my nested string]].')).to.eql([
+		expect(parse([['${', '}'], ['$[', ']']], { boundaries: 'include', maxDepth: 1 }).do('This ${is $[a]} test')).to.eql([
 			'This ',
-			'is [my nested string]',
-			'.'
+			'${is $[a]}',
+			' test'
 		]);
 	});
 	it ('should come back with parsed tree (max depth = 0).', () => {