precedent 1.0.7 → 1.0.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.config/code-server/config.yaml +1 -1
- package/.config/configstore/update-notifier-npm.json +1 -1
- package/Dockerfile_LUXURYCode +69 -0
- package/dist/precedent.js +302 -307
- package/dist/precedent.min.js +29 -27
- package/dist/precedent.min.js.map +1 -1
- package/gulpfile.js +36 -15
- package/package.json +26 -12
- package/source/Precedent-Browser-Shim.js +5 -9
- package/source/StringParser.js +1 -1
- package/source/WordTree.js +7 -7
- package/test/Precedent_tests.js +106 -0
- package/test.js +1 -0
- package/.config/luxury-extras/.vscode/launch.json +0 -46
- package/.config/luxury-extras/Dockerfile +0 -32
- package/.config/luxury-extras/Dockerfile_LUXURYCode +0 -45
- package/.config/luxury-extras/MySQL/Dockerfile +0 -51
- package/.config/luxury-extras/MySQL/Dockerfile_LUXURYCODE +0 -65
- package/.config/luxury-extras/MySQL/MySQL-Laden-Entry.sh +0 -17
- package/.config/luxury-extras/MySQL/MySQL-Security.sql +0 -5
- package/.config/luxury-extras/model/ddl/BookStore.ddl +0 -66
- package/.config/luxury-extras/model/documentation/Dictionary.md +0 -18
- package/.config/luxury-extras/model/documentation/Model-Author.md +0 -20
- package/.config/luxury-extras/model/documentation/Model-Book.md +0 -26
- package/.config/luxury-extras/model/documentation/Model-BookAuthorJoin.md +0 -14
- package/.config/luxury-extras/model/documentation/Model-BookPrice.md +0 -25
- package/.config/luxury-extras/model/documentation/Model-Review.md +0 -22
- package/.config/luxury-extras/model/documentation/ModelChangeTracking.md +0 -17
- package/.config/luxury-extras/model/documentation/README.md +0 -1
- package/.config/luxury-extras/model/documentation/diagram/README.md +0 -1
- package/.config/luxury-extras/model/documentation/diagram/Stricture_Output.dot +0 -13
- package/.config/luxury-extras/model/documentation/diagram/Stricture_Output.png +0 -0
- package/.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-Author.json +0 -220
- package/.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-Book.json +0 -268
- package/.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-BookAuthorJoin.json +0 -172
- package/.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-BookPrice.json +0 -260
- package/.config/luxury-extras/model/json_schema_entities/BookStore-MeadowSchema-Review.json +0 -236
- package/.config/luxury-extras/model/json_schema_entities/README.md +0 -1
- package/.config/luxury-extras/model/json_schema_model/BookStore-Extended.json +0 -915
- package/.config/luxury-extras/model/json_schema_model/BookStore-PICT.json +0 -1
- package/.config/luxury-extras/model/json_schema_model/BookStore.json +0 -280
- package/.config/luxury-extras/model/json_schema_model/README.md +0 -1
- package/.config/luxury-extras/model/mysql_create/BookStore-CreateDatabase.mysql.sql +0 -116
- package/.config/luxury-extras/model/mysql_create/README.md +0 -1
- package/DockerfileLUXURYCode +0 -45
package/dist/precedent.js
CHANGED
|
@@ -1,322 +1,317 @@
|
|
|
1
|
-
(function
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
1
|
+
(function (f) {
|
|
2
|
+
if (typeof exports === "object" && typeof module !== "undefined") {
|
|
3
|
+
module.exports = f();
|
|
4
|
+
} else if (typeof define === "function" && define.amd) {
|
|
5
|
+
define([], f);
|
|
6
|
+
} else {
|
|
7
|
+
var g;
|
|
8
|
+
if (typeof window !== "undefined") {
|
|
9
|
+
g = window;
|
|
10
|
+
} else if (typeof global !== "undefined") {
|
|
11
|
+
g = global;
|
|
12
|
+
} else if (typeof self !== "undefined") {
|
|
13
|
+
g = self;
|
|
14
|
+
} else {
|
|
15
|
+
g = this;
|
|
16
|
+
}
|
|
17
|
+
g.Precedent = f();
|
|
18
|
+
}
|
|
19
|
+
})(function () {
|
|
20
|
+
var define, module, exports;
|
|
21
|
+
return function () {
|
|
22
|
+
function r(e, n, t) {
|
|
23
|
+
function o(i, f) {
|
|
24
|
+
if (!n[i]) {
|
|
25
|
+
if (!e[i]) {
|
|
26
|
+
var c = "function" == typeof require && require;
|
|
27
|
+
if (!f && c) return c(i, !0);
|
|
28
|
+
if (u) return u(i, !0);
|
|
29
|
+
var a = new Error("Cannot find module '" + i + "'");
|
|
30
|
+
throw a.code = "MODULE_NOT_FOUND", a;
|
|
31
|
+
}
|
|
32
|
+
var p = n[i] = {
|
|
33
|
+
exports: {}
|
|
34
|
+
};
|
|
35
|
+
e[i][0].call(p.exports, function (r) {
|
|
36
|
+
var n = e[i][1][r];
|
|
37
|
+
return o(n || r);
|
|
38
|
+
}, p, p.exports, r, e, n, t);
|
|
39
|
+
}
|
|
40
|
+
return n[i].exports;
|
|
41
|
+
}
|
|
42
|
+
for (var u = "function" == typeof require && require, i = 0; i < t.length; i++) o(t[i]);
|
|
43
|
+
return o;
|
|
44
|
+
}
|
|
45
|
+
return r;
|
|
46
|
+
}()({
|
|
47
|
+
1: [function (require, module, exports) {
|
|
48
|
+
/**
|
|
49
|
+
* Simple browser shim loader - assign the npm module to a window global automatically
|
|
50
|
+
*
|
|
51
|
+
* @license MIT
|
|
52
|
+
* @author <steven@velozo.com>
|
|
53
|
+
*/
|
|
54
|
+
var libNPMModuleWrapper = require('./Precedent.js');
|
|
55
|
+
if (typeof window == 'object' && !window.hasOwnProperty('Precedent')) {
|
|
56
|
+
window.Precedent = libNPMModuleWrapper;
|
|
57
|
+
}
|
|
58
|
+
module.exports = libNPMModuleWrapper;
|
|
59
|
+
}, {
|
|
60
|
+
"./Precedent.js": 2
|
|
61
|
+
}],
|
|
62
|
+
2: [function (require, module, exports) {
|
|
63
|
+
/**
|
|
64
|
+
* Precedent Meta-Templating
|
|
65
|
+
*
|
|
66
|
+
* @license MIT
|
|
67
|
+
*
|
|
68
|
+
* @author Steven Velozo <steven@velozo.com>
|
|
69
|
+
*
|
|
70
|
+
* @description Process text streams, parsing out meta-template expressions.
|
|
71
|
+
*/
|
|
72
|
+
var libWordTree = require(`./WordTree.js`);
|
|
73
|
+
var libStringParser = require(`./StringParser.js`);
|
|
74
|
+
class Precedent {
|
|
75
|
+
/**
|
|
76
|
+
* Precedent Constructor
|
|
77
|
+
*/
|
|
78
|
+
constructor() {
|
|
79
|
+
this.WordTree = new libWordTree();
|
|
80
|
+
this.StringParser = new libStringParser();
|
|
81
|
+
this.ParseTree = this.WordTree.ParseTree;
|
|
82
|
+
}
|
|
6
83
|
|
|
7
|
-
/**
|
|
8
|
-
*
|
|
9
|
-
|
|
84
|
+
/**
|
|
85
|
+
* Add a Pattern to the Parse Tree
|
|
86
|
+
* @method addPattern
|
|
87
|
+
* @param {Object} pTree - A node on the parse tree to push the characters into
|
|
88
|
+
* @param {string} pPattern - The string to add to the tree
|
|
89
|
+
* @param {number} pIndex - callback function
|
|
90
|
+
* @return {bool} True if adding the pattern was successful
|
|
91
|
+
*/
|
|
92
|
+
addPattern(pPatternStart, pPatternEnd, pParser) {
|
|
93
|
+
return this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);
|
|
94
|
+
}
|
|
10
95
|
|
|
11
|
-
|
|
12
|
-
|
|
96
|
+
/**
|
|
97
|
+
* Parse a string with the existing parse tree
|
|
98
|
+
* @method parseString
|
|
99
|
+
* @param {string} pString - The string to parse
|
|
100
|
+
* @return {string} The result from the parser
|
|
101
|
+
*/
|
|
102
|
+
parseString(pString) {
|
|
103
|
+
return this.StringParser.parseString(pString, this.ParseTree);
|
|
104
|
+
}
|
|
105
|
+
}
|
|
106
|
+
module.exports = Precedent;
|
|
107
|
+
}, {
|
|
108
|
+
"./StringParser.js": 3,
|
|
109
|
+
"./WordTree.js": 4
|
|
110
|
+
}],
|
|
111
|
+
3: [function (require, module, exports) {
|
|
112
|
+
/**
|
|
113
|
+
* String Parser
|
|
114
|
+
*
|
|
115
|
+
* @license MIT
|
|
116
|
+
*
|
|
117
|
+
* @author Steven Velozo <steven@velozo.com>
|
|
118
|
+
*
|
|
119
|
+
* @description Parse a string, properly processing each matched token in the word tree.
|
|
120
|
+
*/
|
|
13
121
|
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
122
|
+
class StringParser {
|
|
123
|
+
/**
|
|
124
|
+
* StringParser Constructor
|
|
125
|
+
*/
|
|
126
|
+
constructor() {}
|
|
18
127
|
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
*
|
|
23
|
-
*
|
|
24
|
-
* @
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
128
|
+
/**
|
|
129
|
+
* Create a fresh parsing state object to work with.
|
|
130
|
+
* @method newParserState
|
|
131
|
+
* @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)
|
|
132
|
+
* @return {Object} A new parser state object for running a character parser on
|
|
133
|
+
* @private
|
|
134
|
+
*/
|
|
135
|
+
newParserState(pParseTree) {
|
|
136
|
+
return {
|
|
137
|
+
ParseTree: pParseTree,
|
|
138
|
+
Output: '',
|
|
139
|
+
OutputBuffer: '',
|
|
140
|
+
Pattern: false,
|
|
141
|
+
PatternMatch: false,
|
|
142
|
+
PatternMatchOutputBuffer: ''
|
|
143
|
+
};
|
|
144
|
+
}
|
|
32
145
|
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
146
|
+
/**
|
|
147
|
+
* Assign a node of the parser tree to be the next potential match.
|
|
148
|
+
* If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).
|
|
149
|
+
* @method assignNode
|
|
150
|
+
* @param {Object} pNode - A node on the parse tree to assign
|
|
151
|
+
* @param {Object} pParserState - The state object for the current parsing task
|
|
152
|
+
* @private
|
|
153
|
+
*/
|
|
154
|
+
assignNode(pNode, pParserState) {
|
|
155
|
+
pParserState.PatternMatch = pNode;
|
|
43
156
|
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
* @param {Object} pTree - A node on the parse tree to push the characters into
|
|
51
|
-
* @param {string} pPattern - The string to add to the tree
|
|
52
|
-
* @param {number} pIndex - callback function
|
|
53
|
-
* @return {bool} True if adding the pattern was successful
|
|
54
|
-
*/
|
|
55
|
-
addPattern(pPatternStart, pPatternEnd, pParser)
|
|
56
|
-
{
|
|
57
|
-
return this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);
|
|
58
|
-
}
|
|
59
|
-
|
|
60
|
-
/**
|
|
61
|
-
* Parse a string with the existing parse tree
|
|
62
|
-
* @method parseString
|
|
63
|
-
* @param {string} pString - The string to parse
|
|
64
|
-
* @return {string} The result from the parser
|
|
65
|
-
*/
|
|
66
|
-
parseString(pString)
|
|
67
|
-
{
|
|
68
|
-
return this.StringParser.parseString(pString, this.ParseTree);
|
|
69
|
-
}
|
|
70
|
-
}
|
|
157
|
+
// If the pattern has a END we can assume it has a parse function...
|
|
158
|
+
if (pParserState.PatternMatch.hasOwnProperty('PatternEnd')) {
|
|
159
|
+
// ... this is the legitimate start of a pattern.
|
|
160
|
+
pParserState.Pattern = pParserState.PatternMatch;
|
|
161
|
+
}
|
|
162
|
+
}
|
|
71
163
|
|
|
72
|
-
|
|
164
|
+
/**
|
|
165
|
+
* Append a character to the output buffer in the parser state.
|
|
166
|
+
* This output buffer is used when a potential match is being explored, or a match is being explored.
|
|
167
|
+
* @method appendOutputBuffer
|
|
168
|
+
* @param {string} pCharacter - The character to append
|
|
169
|
+
* @param {Object} pParserState - The state object for the current parsing task
|
|
170
|
+
* @private
|
|
171
|
+
*/
|
|
172
|
+
appendOutputBuffer(pCharacter, pParserState) {
|
|
173
|
+
pParserState.OutputBuffer += pCharacter;
|
|
174
|
+
}
|
|
73
175
|
|
|
74
|
-
|
|
75
|
-
|
|
76
|
-
*
|
|
77
|
-
*
|
|
78
|
-
* @
|
|
79
|
-
|
|
80
|
-
|
|
81
|
-
|
|
82
|
-
|
|
83
|
-
|
|
176
|
+
/**
|
|
177
|
+
* Flush the output buffer to the output and clear it.
|
|
178
|
+
* @method flushOutputBuffer
|
|
179
|
+
* @param {Object} pParserState - The state object for the current parsing task
|
|
180
|
+
* @private
|
|
181
|
+
*/
|
|
182
|
+
flushOutputBuffer(pParserState) {
|
|
183
|
+
pParserState.Output += pParserState.OutputBuffer;
|
|
184
|
+
pParserState.OutputBuffer = '';
|
|
185
|
+
}
|
|
84
186
|
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
96
|
-
|
|
97
|
-
|
|
98
|
-
|
|
99
|
-
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
return (
|
|
104
|
-
{
|
|
105
|
-
ParseTree: pParseTree,
|
|
187
|
+
/**
|
|
188
|
+
* Check if the pattern has ended. If it has, properly flush the buffer and start looking for new patterns.
|
|
189
|
+
* @method checkPatternEnd
|
|
190
|
+
* @param {Object} pParserState - The state object for the current parsing task
|
|
191
|
+
* @private
|
|
192
|
+
*/
|
|
193
|
+
checkPatternEnd(pParserState) {
|
|
194
|
+
if (pParserState.OutputBuffer.length >= pParserState.Pattern.PatternEnd.length + pParserState.Pattern.PatternStart.length && pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd) {
|
|
195
|
+
// ... this is the end of a pattern, cut off the end tag and parse it.
|
|
196
|
+
// Trim the start and end tags off the output buffer now
|
|
197
|
+
pParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length + pParserState.Pattern.PatternEnd.length)));
|
|
198
|
+
// Flush the output buffer.
|
|
199
|
+
this.flushOutputBuffer(pParserState);
|
|
200
|
+
// End pattern mode
|
|
201
|
+
pParserState.Pattern = false;
|
|
202
|
+
pParserState.PatternMatch = false;
|
|
203
|
+
}
|
|
204
|
+
}
|
|
106
205
|
|
|
107
|
-
|
|
108
|
-
|
|
206
|
+
/**
|
|
207
|
+
* Parse a character in the buffer.
|
|
208
|
+
* @method parseCharacter
|
|
209
|
+
* @param {string} pCharacter - The character to append
|
|
210
|
+
* @param {Object} pParserState - The state object for the current parsing task
|
|
211
|
+
* @private
|
|
212
|
+
*/
|
|
213
|
+
parseCharacter(pCharacter, pParserState) {
|
|
214
|
+
// (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....
|
|
215
|
+
if (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter)) {
|
|
216
|
+
// ... assign the node as the matched node.
|
|
217
|
+
this.assignNode(pParserState.ParseTree[pCharacter], pParserState);
|
|
218
|
+
this.appendOutputBuffer(pCharacter, pParserState);
|
|
219
|
+
}
|
|
220
|
+
// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)
|
|
221
|
+
else if (pParserState.PatternMatch) {
|
|
222
|
+
// If the pattern has a subpattern with this key
|
|
223
|
+
if (pParserState.PatternMatch.hasOwnProperty(pCharacter)) {
|
|
224
|
+
// Continue matching patterns.
|
|
225
|
+
this.assignNode(pParserState.PatternMatch[pCharacter], pParserState);
|
|
226
|
+
}
|
|
227
|
+
this.appendOutputBuffer(pCharacter, pParserState);
|
|
228
|
+
if (pParserState.Pattern) {
|
|
229
|
+
// ... Check if this is the end of the pattern (if we are matching a valid pattern)...
|
|
230
|
+
this.checkPatternEnd(pParserState);
|
|
231
|
+
}
|
|
232
|
+
}
|
|
233
|
+
// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....
|
|
234
|
+
else {
|
|
235
|
+
pParserState.Output += pCharacter;
|
|
236
|
+
}
|
|
237
|
+
}
|
|
109
238
|
|
|
110
|
-
|
|
239
|
+
/**
|
|
240
|
+
* Parse a string for matches, and process any template segments that occur.
|
|
241
|
+
* @method parseString
|
|
242
|
+
* @param {string} pString - The string to parse.
|
|
243
|
+
* @param {Object} pParseTree - The parse tree to begin parsing from (usually root)
|
|
244
|
+
*/
|
|
245
|
+
parseString(pString, pParseTree) {
|
|
246
|
+
let tmpParserState = this.newParserState(pParseTree);
|
|
247
|
+
for (var i = 0; i < pString.length; i++) {
|
|
248
|
+
// TODO: This is not fast.
|
|
249
|
+
this.parseCharacter(pString[i], tmpParserState);
|
|
250
|
+
}
|
|
251
|
+
this.flushOutputBuffer(tmpParserState);
|
|
252
|
+
return tmpParserState.Output;
|
|
253
|
+
}
|
|
254
|
+
}
|
|
255
|
+
module.exports = StringParser;
|
|
256
|
+
}, {}],
|
|
257
|
+
4: [function (require, module, exports) {
|
|
258
|
+
/**
|
|
259
|
+
* Word Tree
|
|
260
|
+
*
|
|
261
|
+
* @license MIT
|
|
262
|
+
*
|
|
263
|
+
* @author Steven Velozo <steven@velozo.com>
|
|
264
|
+
*
|
|
265
|
+
* @description Create a tree (directed graph) of Javascript objects, one character per object.
|
|
266
|
+
*/
|
|
111
267
|
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
* If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).
|
|
120
|
-
* @method assignNode
|
|
121
|
-
* @param {Object} pNode - A node on the parse tree to assign
|
|
122
|
-
* @param {Object} pParserState - The state object for the current parsing task
|
|
123
|
-
* @private
|
|
124
|
-
*/
|
|
125
|
-
assignNode (pNode, pParserState)
|
|
126
|
-
{
|
|
127
|
-
pParserState.PatternMatch = pNode;
|
|
268
|
+
class WordTree {
|
|
269
|
+
/**
|
|
270
|
+
* WordTree Constructor
|
|
271
|
+
*/
|
|
272
|
+
constructor() {
|
|
273
|
+
this.ParseTree = {};
|
|
274
|
+
}
|
|
128
275
|
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
* @private
|
|
144
|
-
*/
|
|
145
|
-
appendOutputBuffer (pCharacter, pParserState)
|
|
146
|
-
{
|
|
147
|
-
pParserState.OutputBuffer += pCharacter;
|
|
148
|
-
}
|
|
149
|
-
|
|
150
|
-
/**
|
|
151
|
-
* Flush the output buffer to the output and clear it.
|
|
152
|
-
* @method flushOutputBuffer
|
|
153
|
-
* @param {Object} pParserState - The state object for the current parsing task
|
|
154
|
-
* @private
|
|
155
|
-
*/
|
|
156
|
-
flushOutputBuffer (pParserState)
|
|
157
|
-
{
|
|
158
|
-
pParserState.Output += pParserState.OutputBuffer;
|
|
159
|
-
pParserState.OutputBuffer = '';
|
|
160
|
-
}
|
|
276
|
+
/**
|
|
277
|
+
* Add a child character to a Parse Tree node
|
|
278
|
+
* @method addChild
|
|
279
|
+
* @param {Object} pTree - A parse tree to push the characters into
|
|
280
|
+
* @param {string} pPattern - The string to add to the tree
|
|
281
|
+
* @param {number} pIndex - callback function
|
|
282
|
+
* @returns {Object} The resulting leaf node that was added (or found)
|
|
283
|
+
* @private
|
|
284
|
+
*/
|
|
285
|
+
addChild(pTree, pPattern, pIndex) {
|
|
286
|
+
if (pIndex > pPattern.length) return pTree;
|
|
287
|
+
if (!pTree.hasOwnProperty(pPattern[pIndex])) pTree[pPattern[pIndex]] = {};
|
|
288
|
+
return pTree[pPattern[pIndex]];
|
|
289
|
+
}
|
|
161
290
|
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
|
|
168
|
-
|
|
169
|
-
|
|
170
|
-
|
|
171
|
-
|
|
172
|
-
(pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd))
|
|
173
|
-
{
|
|
174
|
-
// ... this is the end of a pattern, cut off the end tag and parse it.
|
|
175
|
-
// Trim the start and end tags off the output buffer now
|
|
176
|
-
pParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length+pParserState.Pattern.PatternEnd.length)));
|
|
177
|
-
// Flush the output buffer.
|
|
178
|
-
this.flushOutputBuffer(pParserState);
|
|
179
|
-
// End pattern mode
|
|
180
|
-
pParserState.Pattern = false;
|
|
181
|
-
pParserState.PatternMatch = false;
|
|
182
|
-
}
|
|
183
|
-
}
|
|
184
|
-
|
|
185
|
-
/**
|
|
186
|
-
* Parse a character in the buffer.
|
|
187
|
-
* @method parseCharacter
|
|
188
|
-
* @param {string} pCharacter - The character to append
|
|
189
|
-
* @param {Object} pParserState - The state object for the current parsing task
|
|
190
|
-
* @private
|
|
191
|
-
*/
|
|
192
|
-
parseCharacter (pCharacter, pParserState)
|
|
193
|
-
{
|
|
194
|
-
// (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....
|
|
195
|
-
if (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter))
|
|
196
|
-
{
|
|
197
|
-
// ... assign the node as the matched node.
|
|
198
|
-
this.assignNode(pParserState.ParseTree[pCharacter], pParserState);
|
|
199
|
-
this.appendOutputBuffer(pCharacter, pParserState);
|
|
200
|
-
}
|
|
201
|
-
// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)
|
|
202
|
-
else if (pParserState.PatternMatch)
|
|
203
|
-
{
|
|
204
|
-
// If the pattern has a subpattern with this key
|
|
205
|
-
if (pParserState.PatternMatch.hasOwnProperty(pCharacter))
|
|
206
|
-
{
|
|
207
|
-
// Continue matching patterns.
|
|
208
|
-
this.assignNode(pParserState.PatternMatch[pCharacter], pParserState);
|
|
209
|
-
}
|
|
210
|
-
this.appendOutputBuffer(pCharacter, pParserState);
|
|
211
|
-
if (pParserState.Pattern)
|
|
212
|
-
{
|
|
213
|
-
// ... Check if this is the end of the pattern (if we are matching a valid pattern)...
|
|
214
|
-
this.checkPatternEnd(pParserState);
|
|
215
|
-
}
|
|
216
|
-
}
|
|
217
|
-
// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....
|
|
218
|
-
else
|
|
219
|
-
{
|
|
220
|
-
pParserState.Output += pCharacter;
|
|
221
|
-
}
|
|
222
|
-
}
|
|
223
|
-
|
|
224
|
-
/**
|
|
225
|
-
* Parse a string for matches, and process any template segments that occur.
|
|
226
|
-
* @method parseString
|
|
227
|
-
* @param {string} pString - The string to parse.
|
|
228
|
-
* @param {Object} pParseTree - The parse tree to begin parsing from (usually root)
|
|
229
|
-
*/
|
|
230
|
-
parseString (pString, pParseTree)
|
|
231
|
-
{
|
|
232
|
-
let tmpParserState = this.newParserState(pParseTree);
|
|
291
|
+
/** Add a Pattern to the Parse Tree
|
|
292
|
+
* @method addPattern
|
|
293
|
+
* @param {Object} pTree - A node on the parse tree to push the characters into
|
|
294
|
+
* @param {string} pPattern - The string to add to the tree
|
|
295
|
+
* @param {number} pIndex - callback function
|
|
296
|
+
* @return {bool} True if adding the pattern was successful
|
|
297
|
+
*/
|
|
298
|
+
addPattern(pPatternStart, pPatternEnd, pParser) {
|
|
299
|
+
if (pPatternStart.length < 1) return false;
|
|
300
|
+
let tmpLeaf = this.ParseTree;
|
|
233
301
|
|
|
234
|
-
|
|
235
|
-
|
|
236
|
-
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
|
|
243
|
-
|
|
244
|
-
}
|
|
245
|
-
|
|
246
|
-
module.exports =
|
|
247
|
-
|
|
248
|
-
},{}
|
|
249
|
-
|
|
250
|
-
* Word Tree
|
|
251
|
-
*
|
|
252
|
-
* @license MIT
|
|
253
|
-
*
|
|
254
|
-
* @author Steven Velozo <steven@velozo.com>
|
|
255
|
-
*
|
|
256
|
-
* @description Create a tree (directed graph) of Javascript objects, one character per object.
|
|
257
|
-
*/
|
|
258
|
-
|
|
259
|
-
class WordTree
|
|
260
|
-
{
|
|
261
|
-
/**
|
|
262
|
-
* WordTree Constructor
|
|
263
|
-
*/
|
|
264
|
-
constructor()
|
|
265
|
-
{
|
|
266
|
-
this.ParseTree = {};
|
|
267
|
-
}
|
|
268
|
-
|
|
269
|
-
/**
|
|
270
|
-
* Add a child character to a Parse Tree node
|
|
271
|
-
* @method addChild
|
|
272
|
-
* @param {Object} pTree - A parse tree to push the characters into
|
|
273
|
-
* @param {string} pPattern - The string to add to the tree
|
|
274
|
-
* @param {number} pIndex - callback function
|
|
275
|
-
* @returns {Object} The resulting leaf node that was added (or found)
|
|
276
|
-
* @private
|
|
277
|
-
*/
|
|
278
|
-
addChild (pTree, pPattern, pIndex)
|
|
279
|
-
{
|
|
280
|
-
if (pIndex > pPattern.length)
|
|
281
|
-
return pTree;
|
|
282
|
-
|
|
283
|
-
if (!pTree.hasOwnProperty(pPattern[pIndex]))
|
|
284
|
-
pTree[pPattern[pIndex]] = {};
|
|
285
|
-
|
|
286
|
-
return pTree[pPattern[pIndex]];
|
|
287
|
-
}
|
|
288
|
-
|
|
289
|
-
/** Add a Pattern to the Parse Tree
|
|
290
|
-
* @method addPattern
|
|
291
|
-
* @param {Object} pTree - A node on the parse tree to push the characters into
|
|
292
|
-
* @param {string} pPattern - The string to add to the tree
|
|
293
|
-
* @param {number} pIndex - callback function
|
|
294
|
-
* @return {bool} True if adding the pattern was successful
|
|
295
|
-
*/
|
|
296
|
-
addPattern (pPatternStart, pPatternEnd, pParser)
|
|
297
|
-
{
|
|
298
|
-
if (pPatternStart.length < 1)
|
|
299
|
-
return false;
|
|
300
|
-
|
|
301
|
-
let tmpLeaf = this.ParseTree;
|
|
302
|
-
|
|
303
|
-
// Add the tree of leaves iteratively
|
|
304
|
-
for (var i = 0; i < pPatternStart.length; i++)
|
|
305
|
-
tmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);
|
|
306
|
-
|
|
307
|
-
tmpLeaf.PatternStart = pPatternStart;
|
|
308
|
-
tmpLeaf.PatternEnd = ((typeof(pPatternEnd) === 'string') && (pPatternEnd.length > 0)) ? pPatternEnd : pPatternStart;
|
|
309
|
-
tmpLeaf.Parse = (typeof(pParser) === 'function') ? pParser :
|
|
310
|
-
(typeof(pParser) === 'string') ? () => { return pParser; } :
|
|
311
|
-
(pData) => { return pData; };
|
|
312
|
-
|
|
313
|
-
return true;
|
|
314
|
-
}
|
|
315
|
-
}
|
|
316
|
-
|
|
317
|
-
module.exports = WordTree;
|
|
318
|
-
|
|
319
|
-
},{}]},{},[1])(1)
|
|
320
|
-
});
|
|
321
|
-
|
|
322
|
-
//# 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"]}
|
|
302
|
+
// Add the tree of leaves iteratively
|
|
303
|
+
for (var i = 0; i < pPatternStart.length; i++) tmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);
|
|
304
|
+
tmpLeaf.PatternStart = pPatternStart;
|
|
305
|
+
tmpLeaf.PatternEnd = typeof pPatternEnd === 'string' && pPatternEnd.length > 0 ? pPatternEnd : pPatternStart;
|
|
306
|
+
tmpLeaf.Parse = typeof pParser === 'function' ? pParser : typeof pParser === 'string' ? () => {
|
|
307
|
+
return pParser;
|
|
308
|
+
} : pData => {
|
|
309
|
+
return pData;
|
|
310
|
+
};
|
|
311
|
+
return true;
|
|
312
|
+
}
|
|
313
|
+
}
|
|
314
|
+
module.exports = WordTree;
|
|
315
|
+
}, {}]
|
|
316
|
+
}, {}, [1])(1);
|
|
317
|
+
});
|