fable 3.0.22 → 3.0.23

package/dist/fable.js

@@ -2011,10 +2011,11 @@
          * Parse a string with the existing parse tree
          * @method parseString
          * @param {string} pString - The string to parse
+         * @param {object} pData - Data to pass in as the second argument
          * @return {string} The result from the parser
          */
-        parseString(pString) {
-          return this.StringParser.parseString(pString, this.ParseTree);
+        parseString(pString, pData) {
+          return this.StringParser.parseString(pString, this.ParseTree, pData);
         }
       }
       module.exports = Precedent;
@@ -2104,11 +2105,11 @@
          * @param {Object} pParserState - The state object for the current parsing task
          * @private
          */
-        checkPatternEnd(pParserState) {
+        checkPatternEnd(pParserState, pData) {
           if (pParserState.OutputBuffer.length >= pParserState.Pattern.PatternEnd.length + pParserState.Pattern.PatternStart.length && pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd) {
             // ... this is the end of a pattern, cut off the end tag and parse it.
             // Trim the start and end tags off the output buffer now
-            pParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length + pParserState.Pattern.PatternEnd.length)));
+            pParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length + pParserState.Pattern.PatternEnd.length)), pData);
             // Flush the output buffer.
             this.flushOutputBuffer(pParserState);
             // End pattern mode
@@ -2124,7 +2125,7 @@
          * @param {Object} pParserState - The state object for the current parsing task
          * @private
          */
-        parseCharacter(pCharacter, pParserState) {
+        parseCharacter(pCharacter, pParserState, pData) {
           // (1) If we aren't in a pattern match, and we aren't potentially matching, and this may be the start of a new pattern....
           if (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter)) {
             // ... assign the node as the matched node.
@@ -2141,7 +2142,7 @@
             this.appendOutputBuffer(pCharacter, pParserState);
             if (pParserState.Pattern) {
               // ... Check if this is the end of the pattern (if we are matching a valid pattern)...
-              this.checkPatternEnd(pParserState);
+              this.checkPatternEnd(pParserState, pData);
             }
           }
           // (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....
@@ -2155,12 +2156,13 @@
          * @method parseString
          * @param {string} pString - The string to parse.
          * @param {Object} pParseTree - The parse tree to begin parsing from (usually root)
+         * @param {Object} pData - The data to pass to the function as a second paramter
          */
-        parseString(pString, pParseTree) {
+        parseString(pString, pParseTree, pData) {
           let tmpParserState = this.newParserState(pParseTree);
           for (var i = 0; i < pString.length; i++) {
             // TODO: This is not fast.
-            this.parseCharacter(pString[i], tmpParserState);
+            this.parseCharacter(pString[i], tmpParserState, pData);
           }
           this.flushOutputBuffer(tmpParserState);
           return tmpParserState.Output;

package/dist/fable.min.js

@@ -75,7 +75,7 @@ var n=t("./Fable-UUID-Random.js");class i{constructor(t){this._UUIDModeRandom=!(
       *
       * @description Process text streams, parsing out meta-template expressions.
       */
-var n=t("./WordTree.js"),i=t("./StringParser.js");e.exports=class{constructor(){this.WordTree=new n,this.StringParser=new i,this.ParseTree=this.WordTree.ParseTree}addPattern(t,e,r){return this.WordTree.addPattern(t,e,r)}parseString(t){return this.StringParser.parseString(t,this.ParseTree)}}},{"./StringParser.js":31,"./WordTree.js":32}],31:[function(t,e,r){e.exports=
+var n=t("./WordTree.js"),i=t("./StringParser.js");e.exports=class{constructor(){this.WordTree=new n,this.StringParser=new i,this.ParseTree=this.WordTree.ParseTree}addPattern(t,e,r){return this.WordTree.addPattern(t,e,r)}parseString(t,e){return this.StringParser.parseString(t,this.ParseTree,e)}}},{"./StringParser.js":31,"./WordTree.js":32}],31:[function(t,e,r){e.exports=
 /**
       * String Parser
       *
@@ -85,7 +85,7 @@ var n=t("./WordTree.js"),i=t("./StringParser.js");e.exports=class{constructor(){
       *
       * @description Parse a string, properly processing each matched token in the word tree.
       */
-class{constructor(){}newParserState(t){return{ParseTree:t,Output:"",OutputBuffer:"",Pattern:!1,PatternMatch:!1,PatternMatchOutputBuffer:""}}assignNode(t,e){e.PatternMatch=t,e.PatternMatch.hasOwnProperty("PatternEnd")&&(e.Pattern=e.PatternMatch)}appendOutputBuffer(t,e){e.OutputBuffer+=t}flushOutputBuffer(t){t.Output+=t.OutputBuffer,t.OutputBuffer=""}checkPatternEnd(t){t.OutputBuffer.length>=t.Pattern.PatternEnd.length+t.Pattern.PatternStart.length&&t.OutputBuffer.substr(-t.Pattern.PatternEnd.length)===t.Pattern.PatternEnd&&(t.OutputBuffer=t.Pattern.Parse(t.OutputBuffer.substr(t.Pattern.PatternStart.length,t.OutputBuffer.length-(t.Pattern.PatternStart.length+t.Pattern.PatternEnd.length))),this.flushOutputBuffer(t),t.Pattern=!1,t.PatternMatch=!1)}parseCharacter(t,e){!e.PatternMatch&&e.ParseTree.hasOwnProperty(t)?(this.assignNode(e.ParseTree[t],e),this.appendOutputBuffer(t,e)):e.PatternMatch?(e.PatternMatch.hasOwnProperty(t)&&this.assignNode(e.PatternMatch[t],e),this.appendOutputBuffer(t,e),e.Pattern&&this.checkPatternEnd(e)):e.Output+=t}parseString(t,e){let r=this.newParserState(e);for(var n=0;n<t.length;n++)this.parseCharacter(t[n],r);return this.flushOutputBuffer(r),r.Output}}},{}],32:[function(t,e,r){e.exports=
+class{constructor(){}newParserState(t){return{ParseTree:t,Output:"",OutputBuffer:"",Pattern:!1,PatternMatch:!1,PatternMatchOutputBuffer:""}}assignNode(t,e){e.PatternMatch=t,e.PatternMatch.hasOwnProperty("PatternEnd")&&(e.Pattern=e.PatternMatch)}appendOutputBuffer(t,e){e.OutputBuffer+=t}flushOutputBuffer(t){t.Output+=t.OutputBuffer,t.OutputBuffer=""}checkPatternEnd(t,e){t.OutputBuffer.length>=t.Pattern.PatternEnd.length+t.Pattern.PatternStart.length&&t.OutputBuffer.substr(-t.Pattern.PatternEnd.length)===t.Pattern.PatternEnd&&(t.OutputBuffer=t.Pattern.Parse(t.OutputBuffer.substr(t.Pattern.PatternStart.length,t.OutputBuffer.length-(t.Pattern.PatternStart.length+t.Pattern.PatternEnd.length)),e),this.flushOutputBuffer(t),t.Pattern=!1,t.PatternMatch=!1)}parseCharacter(t,e,r){!e.PatternMatch&&e.ParseTree.hasOwnProperty(t)?(this.assignNode(e.ParseTree[t],e),this.appendOutputBuffer(t,e)):e.PatternMatch?(e.PatternMatch.hasOwnProperty(t)&&this.assignNode(e.PatternMatch[t],e),this.appendOutputBuffer(t,e),e.Pattern&&this.checkPatternEnd(e,r)):e.Output+=t}parseString(t,e,r){let n=this.newParserState(e);for(var i=0;i<t.length;i++)this.parseCharacter(t[i],n,r);return this.flushOutputBuffer(n),n.Output}}},{}],32:[function(t,e,r){e.exports=
 /**
       * Word Tree
       *