🚀 Big News: Socket Acquires Coana to Bring Reachability Analysis to Every Appsec Team.Learn more →
Socket
Book a DemoInstallSign in
Socket
Book a DemoInstallSign in

precedent

Package Overview
Dependencies
Maintainers
1
Versions
15
Alerts
File Explorer

Advanced tools

License
Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

precedent - npm Package Compare versions

Comparing version

1.0.7
to
1.0.8

Dockerfile_LUXURYCode
test.js

2

.config/configstore/update-notifier-npm.json
{
"optOut": false,
"lastUpdateCheck": 1648063932373
"lastUpdateCheck": 1676937741898
}

609

dist/precedent.js

@@ -1,322 +0,317 @@

(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.Precedent = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
/**
* @license MIT
* @author <steven@velozo.com>
*/
(function (f) {
if (typeof exports === "object" && typeof module !== "undefined") {
module.exports = f();
} else if (typeof define === "function" && define.amd) {
define([], f);
} else {
var g;
if (typeof window !== "undefined") {
g = window;
} else if (typeof global !== "undefined") {
g = global;
} else if (typeof self !== "undefined") {
g = self;
} else {
g = this;
}
g.Precedent = f();
}
})(function () {
var define, module, exports;
return function () {
function r(e, n, t) {
function o(i, f) {
if (!n[i]) {
if (!e[i]) {
var c = "function" == typeof require && require;
if (!f && c) return c(i, !0);
if (u) return u(i, !0);
var a = new Error("Cannot find module '" + i + "'");
throw a.code = "MODULE_NOT_FOUND", a;
}
var p = n[i] = {
exports: {}
};
e[i][0].call(p.exports, function (r) {
var n = e[i][1][r];
return o(n || r);
}, p, p.exports, r, e, n, t);
}
return n[i].exports;
}
for (var u = "function" == typeof require && require, i = 0; i < t.length; i++) o(t[i]);
return o;
}
return r;
}()({
1: [function (require, module, exports) {
/**
* Simple browser shim loader - assign the npm module to a window global automatically
*
* @license MIT
* @author <steven@velozo.com>
*/
var libNPMModuleWrapper = require('./Precedent.js');
if (typeof window == 'object' && !window.hasOwnProperty('Precedent')) {
window.Precedent = libNPMModuleWrapper;
}
module.exports = libNPMModuleWrapper;
}, {
"./Precedent.js": 2
}],
2: [function (require, module, exports) {
/**
* Precedent Meta-Templating
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Process text streams, parsing out meta-template expressions.
*/
var libWordTree = require(`./WordTree.js`);
var libStringParser = require(`./StringParser.js`);
class Precedent {
/**
* Precedent Constructor
*/
constructor() {
this.WordTree = new libWordTree();
this.StringParser = new libStringParser();
this.ParseTree = this.WordTree.ParseTree;
}
/**
* Precedent browser shim loader
*/
/**
* Add a Pattern to the Parse Tree
* @method addPattern
* @param {Object} pTree - A node on the parse tree to push the characters into
* @param {string} pPattern - The string to add to the tree
* @param {number} pIndex - callback function
* @return {bool} True if adding the pattern was successful
*/
addPattern(pPatternStart, pPatternEnd, pParser) {
return this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);
}
// Load the precedent module into the browser global automatically.
var libPrecedent = require('./Precedent.js');
/**
* Parse a string with the existing parse tree
* @method parseString
* @param {string} pString - The string to parse
* @return {string} The result from the parser
*/
parseString(pString) {
return this.StringParser.parseString(pString, this.ParseTree);
}
}
module.exports = Precedent;
}, {
"./StringParser.js": 3,
"./WordTree.js": 4
}],
3: [function (require, module, exports) {
/**
* String Parser
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Parse a string, properly processing each matched token in the word tree.
*/
if ((typeof(window) == 'object') && (!window.hasOwnProperty('Precedent')))
{
window.Precedent = libPrecedent;
}
class StringParser {
/**
* StringParser Constructor
*/
constructor() {}
module.exports = libPrecedent;
},{"./Precedent.js":2}],2:[function(require,module,exports){
/**
* Precedent Meta-Templating
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Process text streams, parsing out meta-template expressions.
*/
var libWordTree = require(`./WordTree.js`);
var libStringParser = require(`./StringParser.js`);
/**
* Create a fresh parsing state object to work with.
* @method newParserState
* @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)
* @return {Object} A new parser state object for running a character parser on
* @private
*/
newParserState(pParseTree) {
return {
ParseTree: pParseTree,
Output: '',
OutputBuffer: '',
Pattern: false,
PatternMatch: false,
PatternMatchOutputBuffer: ''
};
}
class Precedent
{
/**
* Precedent Constructor
*/
constructor()
{
this.WordTree = new libWordTree();
this.StringParser = new libStringParser();
/**
* Assign a node of the parser tree to be the next potential match.
* If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).
* @method assignNode
* @param {Object} pNode - A node on the parse tree to assign
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
assignNode(pNode, pParserState) {
pParserState.PatternMatch = pNode;
this.ParseTree = this.WordTree.ParseTree;
}
/**
* Add a Pattern to the Parse Tree
* @method addPattern
* @param {Object} pTree - A node on the parse tree to push the characters into
* @param {string} pPattern - The string to add to the tree
* @param {number} pIndex - callback function
* @return {bool} True if adding the pattern was successful
*/
addPattern(pPatternStart, pPatternEnd, pParser)
{
return this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);
}
/**
* Parse a string with the existing parse tree
* @method parseString
* @param {string} pString - The string to parse
* @return {string} The result from the parser
*/
parseString(pString)
{
return this.StringParser.parseString(pString, this.ParseTree);
}
}
// If the pattern has a END we can assume it has a parse function...
if (pParserState.PatternMatch.hasOwnProperty('PatternEnd')) {
// ... this is the legitimate start of a pattern.
pParserState.Pattern = pParserState.PatternMatch;
}
}
module.exports = Precedent;
/**
* Append a character to the output buffer in the parser state.
* This output buffer is used when a potential match is being explored, or a match is being explored.
* @method appendOutputBuffer
* @param {string} pCharacter - The character to append
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
appendOutputBuffer(pCharacter, pParserState) {
pParserState.OutputBuffer += pCharacter;
}
},{"./StringParser.js":3,"./WordTree.js":4}],3:[function(require,module,exports){
/**
* String Parser
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Parse a string, properly processing each matched token in the word tree.
*/
/**
* Flush the output buffer to the output and clear it.
* @method flushOutputBuffer
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
flushOutputBuffer(pParserState) {
pParserState.Output += pParserState.OutputBuffer;
pParserState.OutputBuffer = '';
}
class StringParser
{
/**
* StringParser Constructor
*/
constructor()
{
}
/**
* Create a fresh parsing state object to work with.
* @method newParserState
* @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)
* @return {Object} A new parser state object for running a character parser on
* @private
*/
newParserState (pParseTree)
{
return (
{
ParseTree: pParseTree,
/**
* Check if the pattern has ended. If it has, properly flush the buffer and start looking for new patterns.
* @method checkPatternEnd
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
checkPatternEnd(pParserState) {
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)));
// Flush the output buffer.
this.flushOutputBuffer(pParserState);
// End pattern mode
pParserState.Pattern = false;
pParserState.PatternMatch = false;
}
}
Output: '',
OutputBuffer: '',
/**
* Parse a character in the buffer.
* @method parseCharacter
* @param {string} pCharacter - The character to append
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
parseCharacter(pCharacter, pParserState) {
// (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.
this.assignNode(pParserState.ParseTree[pCharacter], pParserState);
this.appendOutputBuffer(pCharacter, pParserState);
}
// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)
else if (pParserState.PatternMatch) {
// If the pattern has a subpattern with this key
if (pParserState.PatternMatch.hasOwnProperty(pCharacter)) {
// Continue matching patterns.
this.assignNode(pParserState.PatternMatch[pCharacter], pParserState);
}
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);
}
}
// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....
else {
pParserState.Output += pCharacter;
}
}
Pattern: false,
/**
* Parse a string for matches, and process any template segments that occur.
* @method parseString
* @param {string} pString - The string to parse.
* @param {Object} pParseTree - The parse tree to begin parsing from (usually root)
*/
parseString(pString, pParseTree) {
let tmpParserState = this.newParserState(pParseTree);
for (var i = 0; i < pString.length; i++) {
// TODO: This is not fast.
this.parseCharacter(pString[i], tmpParserState);
}
this.flushOutputBuffer(tmpParserState);
return tmpParserState.Output;
}
}
module.exports = StringParser;
}, {}],
4: [function (require, module, exports) {
/**
* Word Tree
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Create a tree (directed graph) of Javascript objects, one character per object.
*/
PatternMatch: false,
PatternMatchOutputBuffer: ''
});
}
/**
* Assign a node of the parser tree to be the next potential match.
* If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).
* @method assignNode
* @param {Object} pNode - A node on the parse tree to assign
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
assignNode (pNode, pParserState)
{
pParserState.PatternMatch = pNode;
class WordTree {
/**
* WordTree Constructor
*/
constructor() {
this.ParseTree = {};
}
// If the pattern has a END we can assume it has a parse function...
if (pParserState.PatternMatch.hasOwnProperty('PatternEnd'))
{
// ... this is the legitimate start of a pattern.
pParserState.Pattern = pParserState.PatternMatch;
}
}
/**
* Append a character to the output buffer in the parser state.
* This output buffer is used when a potential match is being explored, or a match is being explored.
* @method appendOutputBuffer
* @param {string} pCharacter - The character to append
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
appendOutputBuffer (pCharacter, pParserState)
{
pParserState.OutputBuffer += pCharacter;
}
/**
* Flush the output buffer to the output and clear it.
* @method flushOutputBuffer
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
flushOutputBuffer (pParserState)
{
pParserState.Output += pParserState.OutputBuffer;
pParserState.OutputBuffer = '';
}
/**
* Add a child character to a Parse Tree node
* @method addChild
* @param {Object} pTree - A parse tree to push the characters into
* @param {string} pPattern - The string to add to the tree
* @param {number} pIndex - callback function
* @returns {Object} The resulting leaf node that was added (or found)
* @private
*/
addChild(pTree, pPattern, pIndex) {
if (pIndex > pPattern.length) return pTree;
if (!pTree.hasOwnProperty(pPattern[pIndex])) pTree[pPattern[pIndex]] = {};
return pTree[pPattern[pIndex]];
}
/**
* Check if the pattern has ended. If it has, properly flush the buffer and start looking for new patterns.
* @method checkPatternEnd
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
checkPatternEnd (pParserState)
{
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)));
// Flush the output buffer.
this.flushOutputBuffer(pParserState);
// End pattern mode
pParserState.Pattern = false;
pParserState.PatternMatch = false;
}
}
/**
* Parse a character in the buffer.
* @method parseCharacter
* @param {string} pCharacter - The character to append
* @param {Object} pParserState - The state object for the current parsing task
* @private
*/
parseCharacter (pCharacter, pParserState)
{
// (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.
this.assignNode(pParserState.ParseTree[pCharacter], pParserState);
this.appendOutputBuffer(pCharacter, pParserState);
}
// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)
else if (pParserState.PatternMatch)
{
// If the pattern has a subpattern with this key
if (pParserState.PatternMatch.hasOwnProperty(pCharacter))
{
// Continue matching patterns.
this.assignNode(pParserState.PatternMatch[pCharacter], pParserState);
}
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);
}
}
// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....
else
{
pParserState.Output += pCharacter;
}
}
/**
* Parse a string for matches, and process any template segments that occur.
* @method parseString
* @param {string} pString - The string to parse.
* @param {Object} pParseTree - The parse tree to begin parsing from (usually root)
*/
parseString (pString, pParseTree)
{
let tmpParserState = this.newParserState(pParseTree);
/** Add a Pattern to the Parse Tree
* @method addPattern
* @param {Object} pTree - A node on the parse tree to push the characters into
* @param {string} pPattern - The string to add to the tree
* @param {number} pIndex - callback function
* @return {bool} True if adding the pattern was successful
*/
addPattern(pPatternStart, pPatternEnd, pParser) {
if (pPatternStart.length < 1) return false;
let tmpLeaf = this.ParseTree;
for (var i = 0; i < pString.length; i++)
{
// TODO: This is not fast.
this.parseCharacter(pString[i], tmpParserState);
}
this.flushOutputBuffer(tmpParserState);
return tmpParserState.Output;
}
}
module.exports = StringParser;
},{}],4:[function(require,module,exports){
/**
* Word Tree
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Create a tree (directed graph) of Javascript objects, one character per object.
*/
class WordTree
{
/**
* WordTree Constructor
*/
constructor()
{
this.ParseTree = {};
}
/**
* Add a child character to a Parse Tree node
* @method addChild
* @param {Object} pTree - A parse tree to push the characters into
* @param {string} pPattern - The string to add to the tree
* @param {number} pIndex - callback function
* @returns {Object} The resulting leaf node that was added (or found)
* @private
*/
addChild (pTree, pPattern, pIndex)
{
if (pIndex > pPattern.length)
return pTree;
if (!pTree.hasOwnProperty(pPattern[pIndex]))
pTree[pPattern[pIndex]] = {};
return pTree[pPattern[pIndex]];
}
/** Add a Pattern to the Parse Tree
* @method addPattern
* @param {Object} pTree - A node on the parse tree to push the characters into
* @param {string} pPattern - The string to add to the tree
* @param {number} pIndex - callback function
* @return {bool} True if adding the pattern was successful
*/
addPattern (pPatternStart, pPatternEnd, pParser)
{
if (pPatternStart.length < 1)
return false;
let tmpLeaf = this.ParseTree;
// Add the tree of leaves iteratively
for (var i = 0; i < pPatternStart.length; i++)
tmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);
tmpLeaf.PatternStart = pPatternStart;
tmpLeaf.PatternEnd = ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length > 0)) ? pPatternEnd : pPatternStart;
tmpLeaf.Parse = (typeof(pParser) === 'function') ? pParser :
(typeof(pParser) === 'string') ? () => { return pParser; } :
(pData) => { return pData; };
return true;
}
}
module.exports = WordTree;
},{}]},{},[1])(1)
});
//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"sources":["node_modules/browser-pack/_prelude.js","source/Precedent-Browser-Shim.js","source/Precedent.js","source/StringParser.js","source/WordTree.js"],"names":[],"mappings":"AAAA;ACAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACpDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5KA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"generated.js","sourceRoot":"","sourcesContent":["(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c=\"function\"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error(\"Cannot find module '\"+i+\"'\");throw a.code=\"MODULE_NOT_FOUND\",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u=\"function\"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()","/**\n* @license MIT\n* @author <steven@velozo.com>\n*/\n\n/**\n* Precedent browser shim loader\n*/\n\n// Load the precedent module into the browser global automatically.\nvar libPrecedent = require('./Precedent.js');\n\nif ((typeof(window) == 'object') && (!window.hasOwnProperty('Precedent')))\n{\n\twindow.Precedent = libPrecedent;\n}\n\nmodule.exports = libPrecedent;","/**\n* Precedent Meta-Templating\n*\n* @license     MIT\n*\n* @author      Steven Velozo <steven@velozo.com>\n*\n* @description Process text streams, parsing out meta-template expressions.\n*/\nvar libWordTree = require(`./WordTree.js`);\nvar libStringParser = require(`./StringParser.js`);\n\nclass Precedent\n{\n\t/**\n\t * Precedent Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.WordTree = new libWordTree();\n\t\t\n\t\tthis.StringParser = new libStringParser();\n\n\t\tthis.ParseTree = this.WordTree.ParseTree;\n\t}\n\t\n\t/**\n\t * Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern(pPatternStart, pPatternEnd, pParser)\n\t{\n\t\treturn this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);\n\t}\n\t\n\t/**\n\t * Parse a string with the existing parse tree\n\t * @method parseString\n\t * @param {string} pString - The string to parse\n\t * @return {string} The result from the parser\n\t */\n\tparseString(pString)\n\t{\n\t\treturn this.StringParser.parseString(pString, this.ParseTree);\n\t}\n}\n\nmodule.exports = Precedent;\n","/**\n* String Parser\n*\n* @license     MIT\n*\n* @author      Steven Velozo <steven@velozo.com>\n*\n* @description Parse a string, properly processing each matched token in the word tree.\n*/\n\nclass StringParser\n{\n\t/**\n\t * StringParser Constructor\n\t */\n\tconstructor()\n\t{\n\t}\n\t\n\t/**\n\t * Create a fresh parsing state object to work with.\n\t * @method newParserState\n\t * @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)\n\t * @return {Object} A new parser state object for running a character parser on\n\t * @private\n\t */\n\tnewParserState (pParseTree)\n\t{\n\t\treturn (\n\t\t{\n\t\t    ParseTree: pParseTree,\n\n\t\t\tOutput: '',\n\t\t\tOutputBuffer: '',\n\n\t\t\tPattern: false,\n\n\t\t\tPatternMatch: false,\n\t\t\tPatternMatchOutputBuffer: ''\n\t\t});\n\t}\n\t\t\n\t/**\n\t * Assign a node of the parser tree to be the next potential match.\n\t * If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).\n\t * @method assignNode\n\t * @param {Object} pNode - A node on the parse tree to assign\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tassignNode (pNode, pParserState)\n\t{\n\t\tpParserState.PatternMatch = pNode;\n\n\t\t// If the pattern has a END we can assume it has a parse function...\n\t\tif (pParserState.PatternMatch.hasOwnProperty('PatternEnd'))\n\t\t{\n\t\t\t// ... this is the legitimate start of a pattern.\n\t\t\tpParserState.Pattern = pParserState.PatternMatch;\n\t\t}\n\t}\n\t\n\t/**\n\t * Append a character to the output buffer in the parser state.\n\t * This output buffer is used when a potential match is being explored, or a match is being explored.\n\t * @method appendOutputBuffer\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tappendOutputBuffer (pCharacter, pParserState)\n\t{\n\t\tpParserState.OutputBuffer += pCharacter;\n\t}\n\t\n\t/**\n\t * Flush the output buffer to the output and clear it.\n\t * @method flushOutputBuffer\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tflushOutputBuffer (pParserState)\n\t{\n\t\tpParserState.Output += pParserState.OutputBuffer;\n\t\tpParserState.OutputBuffer = '';\n\t}\n\n\t\n\t/**\n\t * Check if the pattern has ended.  If it has, properly flush the buffer and start looking for new patterns.\n\t * @method checkPatternEnd\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tcheckPatternEnd (pParserState)\n\t{\n\t\tif ((pParserState.OutputBuffer.length >= pParserState.Pattern.PatternEnd.length+pParserState.Pattern.PatternStart.length) && \n\t\t\t(pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd))\n\t\t{\n\t\t\t// ... this is the end of a pattern, cut off the end tag and parse it.\n\t\t\t// Trim the start and end tags off the output buffer now\n\t\t\tpParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length+pParserState.Pattern.PatternEnd.length)));\n\t\t\t// Flush the output buffer.\n\t\t\tthis.flushOutputBuffer(pParserState);\n\t\t\t// End pattern mode\n\t\t\tpParserState.Pattern = false;\n\t\t\tpParserState.PatternMatch = false;\n\t\t}\n\t}\n\t\n\t/**\n\t * Parse a character in the buffer.\n\t * @method parseCharacter\n\t * @param {string} pCharacter - The character to append\n\t * @param {Object} pParserState - The state object for the current parsing task\n\t * @private\n\t */\n\tparseCharacter (pCharacter, pParserState)\n\t{\n\t\t// (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....\n\t\tif (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter))\n\t\t{\n\t\t\t// ... assign the node as the matched node.\n\t\t\tthis.assignNode(pParserState.ParseTree[pCharacter], pParserState);\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t}\n\t\t// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)\n\t\telse if (pParserState.PatternMatch)\n\t\t{\n\t\t\t// If the pattern has a subpattern with this key\n\t\t\tif (pParserState.PatternMatch.hasOwnProperty(pCharacter))\n\t\t\t{\n\t\t\t\t// Continue matching patterns.\n\t\t\t\tthis.assignNode(pParserState.PatternMatch[pCharacter], pParserState);\n\t\t\t}\n\t\t\tthis.appendOutputBuffer(pCharacter, pParserState);\n\t\t\tif (pParserState.Pattern)\n\t\t\t{\n\t\t\t\t// ... Check if this is the end of the pattern (if we are matching a valid pattern)...\n\t\t\t\tthis.checkPatternEnd(pParserState);\n\t\t\t}\n\t\t}\n\t\t// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....\n\t\telse\n\t\t{\n\t\t\tpParserState.Output += pCharacter;\n\t\t}\n\t}\n\t\n\t/**\n\t * Parse a string for matches, and process any template segments that occur.\n\t * @method parseString\n\t * @param {string} pString - The string to parse.\n\t * @param {Object} pParseTree - The parse tree to begin parsing from (usually root)\n\t */\n\tparseString (pString, pParseTree)\n\t{\n\t\tlet tmpParserState = this.newParserState(pParseTree);\n\n\t\tfor (var i = 0; i < pString.length; i++)\n\t\t{\n\t\t\t// TODO: This is not fast.\n\t\t\tthis.parseCharacter(pString[i], tmpParserState);\n\t\t}\n\t\t\n\t\tthis.flushOutputBuffer(tmpParserState);\n\t\t\n\t\treturn tmpParserState.Output;\n\t}\n}\n\nmodule.exports = StringParser;\n","/**\n* Word Tree\n*\n* @license     MIT\n*\n* @author      Steven Velozo <steven@velozo.com>\n*\n* @description Create a tree (directed graph) of Javascript objects, one character per object.\n*/\n\nclass WordTree\n{\n\t/**\n\t * WordTree Constructor\n\t */\n\tconstructor()\n\t{\n\t\tthis.ParseTree = {};\n\t}\n\t\n\t/** \n\t * Add a child character to a Parse Tree node\n\t * @method addChild\n\t * @param {Object} pTree - A parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @returns {Object} The resulting leaf node that was added (or found)\n\t * @private\n\t */\n\taddChild (pTree, pPattern, pIndex)\n\t{\n\t\tif (pIndex > pPattern.length)\n\t\t\treturn pTree;\n\t\t\n\t\tif (!pTree.hasOwnProperty(pPattern[pIndex]))\n\t\t\tpTree[pPattern[pIndex]] = {};\n\t\t\n\t\treturn pTree[pPattern[pIndex]];\n\t}\n\t\n\t/** Add a Pattern to the Parse Tree\n\t * @method addPattern\n\t * @param {Object} pTree - A node on the parse tree to push the characters into\n\t * @param {string} pPattern - The string to add to the tree\n\t * @param {number} pIndex - callback function\n\t * @return {bool} True if adding the pattern was successful\n\t */\n\taddPattern (pPatternStart, pPatternEnd, pParser)\n\t{\n\t\tif (pPatternStart.length < 1)\n\t\t\treturn false;\n\n\t\tlet tmpLeaf = this.ParseTree;\n\n\t\t// Add the tree of leaves iteratively\n\t\tfor (var i = 0; i < pPatternStart.length; i++)\n\t\t\ttmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);\n\n\t\ttmpLeaf.PatternStart = pPatternStart;\n\t\ttmpLeaf.PatternEnd = ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length > 0)) ? pPatternEnd : pPatternStart;\n\t\ttmpLeaf.Parse = (typeof(pParser) === 'function') ? pParser : \n\t\t\t\t\t\t(typeof(pParser) === 'string') ? () => { return pParser; } :\n\t\t\t\t\t\t(pData) => { return pData; };\n\n\t\treturn true;\n\t}\n}\n\nmodule.exports = WordTree;\n"]}
// Add the tree of leaves iteratively
for (var i = 0; i < pPatternStart.length; i++) tmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);
tmpLeaf.PatternStart = pPatternStart;
tmpLeaf.PatternEnd = typeof pPatternEnd === 'string' && pPatternEnd.length > 0 ? pPatternEnd : pPatternStart;
tmpLeaf.Parse = typeof pParser === 'function' ? pParser : typeof pParser === 'string' ? () => {
return pParser;
} : pData => {
return pData;
};
return true;
}
}
module.exports = WordTree;
}, {}]
}, {}, [1])(1);
});

56

dist/precedent.min.js
!function(t){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=t();else if("function"==typeof define&&define.amd)define([],t);else{("undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this).Precedent=t()}}((function(){return function t(e,r,n){function a(s,f){if(!r[s]){if(!e[s]){var o="function"==typeof require&&require;if(!f&&o)return o(s,!0);if(u)return u(s,!0);var i=new Error("Cannot find module '"+s+"'");throw i.code="MODULE_NOT_FOUND",i}var P=r[s]={exports:{}};e[s][0].call(P.exports,(function(t){return a(e[s][1][t]||t)}),P,P.exports,t,e,r,n)}return r[s].exports}for(var u="function"==typeof require&&require,s=0;s<n.length;s++)a(n[s]);return a}({1:[function(t,e,r){
/**
* @license MIT
* @author <steven@velozo.com>
*/
* Simple browser shim loader - assign the npm module to a window global automatically
*
* @license MIT
* @author <steven@velozo.com>
*/
var n=t("./Precedent.js");"object"!=typeof window||window.hasOwnProperty("Precedent")||(window.Precedent=n),e.exports=n},{"./Precedent.js":2}],2:[function(t,e,r){
/**
* Precedent Meta-Templating
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Process text streams, parsing out meta-template expressions.
*/
* Precedent Meta-Templating
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Process text streams, parsing out meta-template expressions.
*/
var n=t("./WordTree.js"),a=t("./StringParser.js");e.exports=class{constructor(){this.WordTree=new n,this.StringParser=new a,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":3,"./WordTree.js":4}],3:[function(t,e,r){e.exports=
/**
* String Parser
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Parse a string, properly processing each matched token in the word tree.
*/
* String Parser
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @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}}},{}],4:[function(t,e,r){e.exports=
/**
* Word Tree
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Create a tree (directed graph) of Javascript objects, one character per object.
*/
* Word Tree
*
* @license MIT
*
* @author Steven Velozo <steven@velozo.com>
*
* @description Create a tree (directed graph) of Javascript objects, one character per object.
*/
class{constructor(){this.ParseTree={}}addChild(t,e,r){return r>e.length?t:(t.hasOwnProperty(e[r])||(t[e[r]]={}),t[e[r]])}addPattern(t,e,r){if(t.length<1)return!1;let n=this.ParseTree;for(var a=0;a<t.length;a++)n=this.addChild(n,t,a);return n.PatternStart=t,n.PatternEnd="string"==typeof e&&e.length>0?e:t,n.Parse="function"==typeof r?r:"string"==typeof r?()=>r:t=>t,!0}}},{}]},{},[1])(1)}));
//# sourceMappingURL=precedent.min.js.map

51

gulpfile.js
'use strict';
// We aren't abstracting this yet but here's the ... "Config"
const _CONFIG = (
{
// The input source file that should be passed to browserify:
// (if you need to auto-instantiate an object, for instance)
EntrypointInputSourceFile: `${__dirname}/source/Precedent-Browser-Shim.js`,
// The name of the packaged object to be passed to browserify:
// (browserify sets this to global scope and window.SOMEOBJECTNAMEHERE where SOMEOBJECTNAMEHERE is the string below)
LibraryObjectName: `Precedent`,
// The folder to write the library files and maps out to:
LibraryOutputFolder: `${__dirname}/dist/`,
// The name of the unminified version of the packaged library, for easy debugging:
LibraryUniminifiedFileName: `precedent.js`,
// The name of the minified version of the packaged library, for production release:
LibraryMinifiedFileName: `precedent.min.js`
});
// ---> Boilerplate Browser Uglification and Packaging <--- \\
const libBrowserify = require('browserify');

@@ -9,10 +32,8 @@ const libGulp = require('gulp');

const libTerser = require('gulp-terser');
const libBuble = require('gulp-buble');
const libSourcemaps = require('gulp-sourcemaps');
const libGulpUtil = require('gulp-util');
const libBabel = require('gulp-babel');
const libTerser = require('gulp-terser');
// Build the module for the browser
// This gulp task is taken from the gulp recipe repository:
// https://github.com/gulpjs/gulp/blob/master/docs/recipes/browserify-uglify-sourcemap.md
libGulp.task('minified',

@@ -23,4 +44,4 @@ () => {

{
entries: './source/Precedent-Browser-Shim.js',
standalone: 'Precedent',
entries: _CONFIG.EntrypointInputSourceFile,
standalone: _CONFIG.LibraryObjectName,
debug: true

@@ -30,15 +51,14 @@ });

return tmpBrowserify.bundle()
.pipe(libVinylSourceStream('precedent.min.js'))
.pipe(libVinylSourceStream(_CONFIG.LibraryMinifiedFileName))
.pipe(libVinylBuffer())
.pipe(libSourcemaps.init({loadMaps: true}))
// Add transformation tasks to the pipeline here.
.pipe(libBabel())
.pipe(libTerser())
.on('error', libGulpUtil.log)
.pipe(libSourcemaps.write('./'))
.pipe(libGulp.dest('./dist/'));
.pipe(libGulp.dest(_CONFIG.LibraryOutputFolder));
});
// Build the module for the browser
// This gulp task is taken from the gulp recipe repository:
// https://github.com/gulpjs/gulp/blob/master/docs/recipes/browserify-uglify-sourcemap.md
libGulp.task('debug',

@@ -49,4 +69,4 @@ () => {

{
entries: './source/Precedent-Browser-Shim.js',
standalone: 'Precedent',
entries: _CONFIG.EntrypointInputSourceFile,
standalone: _CONFIG.LibraryObjectName,
debug: true

@@ -56,6 +76,7 @@ });

return tmpBrowserify.bundle()
.pipe(libVinylSourceStream('precedent.js'))
.pipe(libVinylSourceStream(_CONFIG.LibraryUniminifiedFileName))
.pipe(libVinylBuffer())
.pipe(libBabel())
.on('error', libGulpUtil.log)
.pipe(libGulp.dest('./dist/'));
.pipe(libGulp.dest(_CONFIG.LibraryOutputFolder));
});

@@ -67,2 +88,2 @@

libGulp.series('debug', 'minified')
);
);

38

package.json
{
"name": "precedent",
"version": "1.0.7",
"version": "1.0.8",
"description": "Precedent Meta-Templating",

@@ -11,4 +11,7 @@ "main": "source/Precedent.js",

"start": "node source/Precedent.js",
"coverage": "./node_modules/istanbul/lib/cli.js cover ./node_modules/mocha/bin/_mocha -- -u tdd -R spec",
"test": "./node_modules/mocha/bin/_mocha -u tdd -R spec"
"coverage": "./node_modules/.bin/nyc --reporter=lcov --reporter=text-lcov ./node_modules/mocha/bin/_mocha -- -u tdd -R spec",
"test": "./node_modules/.bin/mocha -u tdd -R spec",
"docker-dev-build-image": "docker build ./ -f Dockerfile_LUXURYCode -t retold/precedent:local",
"docker-dev-run": "docker run -it -d --name precedent-dev -p 127.0.0.1:12340:8080 -v \"$PWD/.config:/home/coder/.config\" -v \"$PWD:/home/coder/precedent\" -u \"$(id -u):$(id -g)\" -e \"DOCKER_USER=$USER\" retold/precedent:local",
"build": "./node_modules/.bin/gulp build"
},

@@ -27,18 +30,29 @@ "repository": {

},
"mocha": {
"diff": true,
"extension": [
"js"
],
"package": "./package.json",
"reporter": "spec",
"slow": "75",
"timeout": "5000",
"ui": "tdd",
"watch-files": [
"source/**/*.js",
"test/**/*.js"
],
"watch-ignore": [
"lib/vendor"
]
},
"devDependencies": {
"@babel/core": "^7.17.9",
"@babel/preset-env": "^7.16.11",
"@testing-library/dom": "^8.13.0",
"async": "^3.2.3",
"browserify": "^17.0.0",
"chai": "4.3.6",
"chai": "4.3.7",
"gulp": "^4.0.2",
"gulp-babel": "^8.0.0",
"gulp-buble": "^0.9.0",
"gulp-sourcemaps": "^3.0.0",
"gulp-terser": "^2.1.0",
"gulp-util": "^3.0.8",
"jsdom": "^19.0.0",
"mocha": "9.2.2",
"npm-check-updates": "^12.5.9",
"mocha": "10.2.0",
"nyc": "^15.1.0",

@@ -45,0 +59,0 @@ "vinyl-buffer": "^1.0.1",

14

source/Precedent-Browser-Shim.js
/**
* Simple browser shim loader - assign the npm module to a window global automatically
*
* @license MIT
* @author <steven@velozo.com>
*/
var libNPMModuleWrapper = require('./Precedent.js');
/**
* Precedent browser shim loader
*/
// Load the precedent module into the browser global automatically.
var libPrecedent = require('./Precedent.js');
if ((typeof(window) == 'object') && (!window.hasOwnProperty('Precedent')))
{
window.Precedent = libPrecedent;
window.Precedent = libNPMModuleWrapper;
}
module.exports = libPrecedent;
module.exports = libNPMModuleWrapper;

2

source/StringParser.js

@@ -31,3 +31,3 @@ /**

{
ParseTree: pParseTree,
ParseTree: pParseTree,

@@ -34,0 +34,0 @@ Output: '',

14

source/WordTree.js

@@ -26,3 +26,3 @@ /**

* @param {string} pPattern - The string to add to the tree
* @param {number} pIndex - callback function
* @param {number} pIndex - The index of the character in the pattern
* @returns {Object} The resulting leaf node that was added (or found)

@@ -33,5 +33,2 @@ * @private

{
if (pIndex > pPattern.length)
return pTree;
if (!pTree.hasOwnProperty(pPattern[pIndex]))

@@ -45,5 +42,5 @@ pTree[pPattern[pIndex]] = {};

* @method addPattern
* @param {Object} pTree - A node on the parse tree to push the characters into
* @param {string} pPattern - The string to add to the tree
* @param {number} pIndex - callback function
* @param {Object} pPatternStart - The starting string for the pattern (e.g. "${")
* @param {string} pPatternEnd - The ending string for the pattern (e.g. "}")
* @param {number} pParser - The function to parse if this is the matched pattern, once the Pattern End is met. If this is a string, a simple replacement occurs.
* @return {bool} True if adding the pattern was successful

@@ -56,2 +53,5 @@ */

if ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length < 1))
return false;
let tmpLeaf = this.ParseTree;

@@ -58,0 +58,0 @@

106

test/Precedent_tests.js

@@ -125,2 +125,24 @@ /**

(
'Bad pattern start parameter...',
(fDone) =>
{
var testPrecedent = loadPrecedentModule();
configPrecedent(testPrecedent);
Expect(testPrecedent.addPattern('', '>', 'SHORTEST_MATCH')).to.equal(false);
fDone();
}
);
test
(
'Bad pattern end parameter...',
(fDone) =>
{
var testPrecedent = loadPrecedentModule();
configPrecedent(testPrecedent);
Expect(testPrecedent.addPattern('<', '', 'SHORTEST_MATCH')).to.equal(false);
fDone();
}
);
test
(
'Identifier fallback...',

@@ -161,2 +183,86 @@ (fDone) =>

);
test
(
'Config magic example...',
(fDone) =>
{
// Use case is take a string with the following template expressions and translate them into the value from the environment variable if a default isn't passed in:
// 'Expressions like ${VariableWithDefault|DefaultValue} have a Default value after the pipe; others like ${VariableWithoutDefault} expressions do not have a Default value after the pipe. but should be processed properly.',
// 'Expressions like DefaultValue have a Default value after the pipe; others like VariableWithoutDefault expressions do not have a Default value after the pipe. but should be processed properly.',
// The usual case is just expressions in the string, but composability is fine.
var testPrecedent = new libPrecedent();
testPrecedent.addPattern('${', '}',
(pTemplateValue)=>
{
let tmpTemplateValue = pTemplateValue.trim();
let tmpSeparatorIndex = tmpTemplateValue.indexOf('|');
// If there is no pipe, the default value will end up being whatever the variable name is.
let tmpDefaultValue = tmpTemplateValue.substring(tmpSeparatorIndex+1);
let tmpEnvironmentVariableName = (tmpSeparatorIndex > -1) ? tmpTemplateValue.substring(0, tmpSeparatorIndex) : tmpTemplateValue;
if (process.env.hasOwnProperty(tmpEnvironmentVariableName))
{
return process.env[tmpEnvironmentVariableName];
}
else
{
return tmpDefaultValue;
}
});
var tmpTestStrings = [
'Expressions like ${VariableWithDefault|DefaultValue} have a Default value after the pipe; others like ${VariableWithoutDefault} expressions do not have a Default value after the pipe. but should be processed properly.',
'Expressions like DefaultValue have a Default value after the pipe; others like VariableWithoutDefault expressions do not have a Default value after the pipe. but should be processed properly.',
'${PATH}',
process.env.PATH,
'AAA ${PATH}',
'AAA '+process.env.PATH,
' ${PATH} AAA ${PATH}',
' '+process.env.PATH+' AAA '+process.env.PATH,
'AAA ${PATH} BBB',
'AAA '+process.env.PATH+' BBB',
'AAA ${PATH} } BBB',
'AAA '+process.env.PATH+' } BBB',
'AAA ${ ${PATH} BBB',
// Two start parameters isn't okay ---
// ...it passes the pattern processor the following (without quotes):
// " ${PATH"
// Which is not going to match an environment variable. With the second
'AAA ${PATH BBB',
'${PATH|Malarky Default Value} ZZZ',
process.env.PATH+' ZZZ',
'${THISISNOTANENVIRONMENTVARIABLE|Real Default Value} ZZZed',
'Real Default Value ZZZed',
'${ THISISNOTANENVIRONMENTVARIABLETRIMMED|Real Trimmed Default Value } ZZZed',
'Real Trimmed Default Value ZZZed',
'${PATH} BBB',
process.env.PATH+' BBB'
];
var tmpResult = '';
// Test every pair in TestStrings
for (var i = 0; i < tmpTestStrings.length; i+=2)
{
tmpResult = testPrecedent.parseString(tmpTestStrings[i]);
Expect(tmpResult).to.equal(tmpTestStrings[i+1]);
}
fDone();
}
);
}

@@ -163,0 +269,0 @@ );

.config/luxury-extras/.vscode/launch.json
.config/luxury-extras/Dockerfile
.config/luxury-extras/Dockerfile_LUXURYCode
.config/luxury-extras/model/ddl/BookStore.ddl
.config/luxury-extras/model/documentation/diagram/README.md
.config/luxury-extras/model/documentation/diagram/Stricture_Output.dot
.config/luxury-extras/model/documentation/diagram/Stricture_Output.png
.config/luxury-extras/model/documentation/Dictionary.md
.config/luxury-extras/model/documentation/Model-Author.md
.config/luxury-extras/model/documentation/Model-Book.md
.config/luxury-extras/model/documentation/Model-BookAuthorJoin.md
.config/luxury-extras/model/documentation/Model-BookPrice.md
.config/luxury-extras/model/documentation/Model-Review.md
.config/luxury-extras/model/documentation/ModelChangeTracking.md
.config/luxury-extras/model/documentation/README.md
.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-Author.json
.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-Book.json
.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-BookAuthorJoin.json
.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-BookPrice.json
.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-Review.json
.config/luxury-extras/model/json_schema_entities/README.md
.config/luxury-extras/model/json_schema_model/BookStore-Extended.json
.config/luxury-extras/model/json_schema_model/BookStore-PICT.json
.config/luxury-extras/model/json_schema_model/BookStore.json
.config/luxury-extras/model/json_schema_model/README.md
.config/luxury-extras/model/mysql_create/BookStore-CreateDatabase.mysql.sql
.config/luxury-extras/model/mysql_create/README.md
.config/luxury-extras/MySQL/Dockerfile
.config/luxury-extras/MySQL/Dockerfile_LUXURYCODE
.config/luxury-extras/MySQL/MySQL-Laden-Entry.sh
.config/luxury-extras/MySQL/MySQL-Security.sql
DockerfileLUXURYCode
.config/code-server/config.yaml

Sorry, the diff of this file is not supported yet

dist/precedent.min.js.map

Sorry, the diff of this file is not supported yet