fable 3.0.22 → 3.0.23

package/dist/fable.compatible.js

@@ -2192,12 +2192,13 @@ function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" =
            * 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
            */
         }, {
           key: "parseString",
-          value: function parseString(pString) {
-            return this.StringParser.parseString(pString, this.ParseTree);
+          value: function parseString(pString, pData) {
+            return this.StringParser.parseString(pString, this.ParseTree, pData);
           }
         }]);
         return Precedent;
@@ -2300,11 +2301,11 @@ function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" =
            */
         }, {
           key: "checkPatternEnd",
-          value: function checkPatternEnd(pParserState) {
+          value: function 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
@@ -2322,7 +2323,7 @@ function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" =
            */
         }, {
           key: "parseCharacter",
-          value: function parseCharacter(pCharacter, pParserState) {
+          value: function 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.
@@ -2339,7 +2340,7 @@ function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" =
               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)....
@@ -2353,14 +2354,15 @@ function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" =
            * @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
            */
         }, {
           key: "parseString",
-          value: function parseString(pString, pParseTree) {
+          value: function parseString(pString, pParseTree, pData) {
             var 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.compatible.min.js

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