manyfest 1.0.21 → 1.0.23
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/.babelrc +3 -0
- package/.browserslistrc +1 -1
- package/gulpfile-config.json +2 -2
- package/package.json +1 -2
- package/source/Manyfest-CleanWrapCharacters.js +1 -1
- package/source/Manyfest-ObjectAddress-DeleteValue.js +2 -63
- package/source/Manyfest-ObjectAddress-GetValue.js +54 -71
- package/source/Manyfest-ObjectAddress-SetValue.js +0 -1
- package/source/Manyfest-ParseConditionals.js +91 -0
- package/source/Manyfest.js +0 -2
- package/test/Manyfest_Embedded_Solvers_tests.js +24 -0
- package/test/Manyfest_Object_Read_tests.js +29 -1
- package/.config/installation/precedent.1.0.5.js +0 -339
package/.babelrc
ADDED
package/.browserslistrc
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
|
|
1
|
+
> 0.01%
|
package/gulpfile-config.json
CHANGED
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "manyfest",
|
|
3
|
-
"version": "1.0.
|
|
3
|
+
"version": "1.0.23",
|
|
4
4
|
"description": "JSON Object Manifest for Data Description and Parsing",
|
|
5
5
|
"main": "source/Manyfest.js",
|
|
6
6
|
"scripts": {
|
|
@@ -63,7 +63,6 @@
|
|
|
63
63
|
"vinyl-source-stream": "^2.0.0"
|
|
64
64
|
},
|
|
65
65
|
"dependencies": {
|
|
66
|
-
"precedent": "^1.0.11"
|
|
67
66
|
},
|
|
68
67
|
"author": "steven velozo <steven@velozo.com>",
|
|
69
68
|
"license": "MIT",
|
|
@@ -13,7 +13,7 @@
|
|
|
13
13
|
//
|
|
14
14
|
// TODO: Should template literals be processed? If so what state do they have access to? That should happen here if so.
|
|
15
15
|
// TODO: Make a simple class include library with these
|
|
16
|
-
|
|
16
|
+
const cleanWrapCharacters = (pCharacter, pString) =>
|
|
17
17
|
{
|
|
18
18
|
if (pString.startsWith(pCharacter) && pString.endsWith(pCharacter))
|
|
19
19
|
{
|
|
@@ -2,8 +2,8 @@
|
|
|
2
2
|
* @author <steven@velozo.com>
|
|
3
3
|
*/
|
|
4
4
|
let libSimpleLog = require('./Manyfest-LogToConsole.js');
|
|
5
|
-
let libPrecedent = require('precedent');
|
|
6
5
|
let fCleanWrapCharacters = require('./Manyfest-CleanWrapCharacters.js');
|
|
6
|
+
let fParseConditionals = require(`../source/Manyfest-ParseConditionals.js`)
|
|
7
7
|
|
|
8
8
|
/**
|
|
9
9
|
* Object Address Resolver - DeleteValue
|
|
@@ -34,73 +34,12 @@ class ManyfestObjectAddressResolverDeleteValue
|
|
|
34
34
|
this.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;
|
|
35
35
|
|
|
36
36
|
this.cleanWrapCharacters = fCleanWrapCharacters;
|
|
37
|
-
this.precedent = new libPrecedent();
|
|
38
|
-
|
|
39
|
-
this.precedent.addPattern('<<~?', '?~>>',
|
|
40
|
-
(pMagicSearchExpression, pData) =>
|
|
41
|
-
{
|
|
42
|
-
if (typeof(pMagicSearchExpression) !== 'string')
|
|
43
|
-
{
|
|
44
|
-
return false;
|
|
45
|
-
}
|
|
46
|
-
// This expects a comma separated expression:
|
|
47
|
-
// Some.Address.In.The.Object,==,Search Term to Match
|
|
48
|
-
let tmpMagicComparisonPatternSet = pMagicSearchExpression.split(',');
|
|
49
|
-
|
|
50
|
-
let tmpSearchAddress = tmpMagicComparisonPatternSet[0];
|
|
51
|
-
let tmpSearchComparator = tmpMagicComparisonPatternSet[1];
|
|
52
|
-
let tmpSearchValue = tmpMagicComparisonPatternSet[2];
|
|
53
|
-
|
|
54
|
-
switch(tmpSearchComparator)
|
|
55
|
-
{
|
|
56
|
-
case '!=':
|
|
57
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) != tmpSearchValue);
|
|
58
|
-
break;
|
|
59
|
-
case '<':
|
|
60
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) < tmpSearchValue);
|
|
61
|
-
break;
|
|
62
|
-
case '>':
|
|
63
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) > tmpSearchValue);
|
|
64
|
-
break;
|
|
65
|
-
case '<=':
|
|
66
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) <= tmpSearchValue);
|
|
67
|
-
break;
|
|
68
|
-
case '>=':
|
|
69
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) >= tmpSearchValue);
|
|
70
|
-
break;
|
|
71
|
-
case '===':
|
|
72
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) == tmpSearchValue);
|
|
73
|
-
break;
|
|
74
|
-
case '==':
|
|
75
|
-
default:
|
|
76
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) == tmpSearchValue);
|
|
77
|
-
break;
|
|
78
|
-
}
|
|
79
|
-
});
|
|
80
37
|
}
|
|
81
38
|
|
|
82
39
|
// TODO: Dry me
|
|
83
40
|
checkFilters(pAddress, pRecord)
|
|
84
41
|
{
|
|
85
|
-
|
|
86
|
-
// If we don't copy the string, precedent takes it out for good.
|
|
87
|
-
// TODO: Consider adding a "don't replace" option for precedent
|
|
88
|
-
let tmpAddress = pAddress;
|
|
89
|
-
|
|
90
|
-
// This allows the magic filtration with solver configuration
|
|
91
|
-
// TODO: We could pass more state in (e.g. parent address, object, etc.)
|
|
92
|
-
// TODO: Discuss this metaprogramming AT LENGTH
|
|
93
|
-
let tmpFilterState = (
|
|
94
|
-
{
|
|
95
|
-
Record: pRecord,
|
|
96
|
-
KeepRecord: true
|
|
97
|
-
});
|
|
98
|
-
|
|
99
|
-
// This is about as complex as it gets.
|
|
100
|
-
|
|
101
|
-
this.precedent.parseString(tmpAddress, tmpFilterState);
|
|
102
|
-
|
|
103
|
-
return tmpFilterState.KeepRecord;
|
|
42
|
+
return fParseConditionals(this, pAddress, pRecord);
|
|
104
43
|
}
|
|
105
44
|
|
|
106
45
|
// Delete the value of an element at an address
|
|
@@ -2,8 +2,8 @@
|
|
|
2
2
|
* @author <steven@velozo.com>
|
|
3
3
|
*/
|
|
4
4
|
let libSimpleLog = require('./Manyfest-LogToConsole.js');
|
|
5
|
-
let libPrecedent = require('precedent');
|
|
6
5
|
let fCleanWrapCharacters = require('./Manyfest-CleanWrapCharacters.js');
|
|
6
|
+
let fParseConditionals = require(`../source/Manyfest-ParseConditionals.js`)
|
|
7
7
|
|
|
8
8
|
/**
|
|
9
9
|
* Object Address Resolver - GetValue
|
|
@@ -34,77 +34,15 @@ class ManyfestObjectAddressResolverGetValue
|
|
|
34
34
|
this.logError = (typeof(pErrorLog) == 'function') ? pErrorLog : libSimpleLog;
|
|
35
35
|
|
|
36
36
|
this.cleanWrapCharacters = fCleanWrapCharacters;
|
|
37
|
-
|
|
38
|
-
this.precedent = new libPrecedent();
|
|
39
|
-
|
|
40
|
-
this.precedent.addPattern('<<~?', '?~>>',
|
|
41
|
-
(pMagicSearchExpression, pData) =>
|
|
42
|
-
{
|
|
43
|
-
if (typeof(pMagicSearchExpression) !== 'string')
|
|
44
|
-
{
|
|
45
|
-
return false;
|
|
46
|
-
}
|
|
47
|
-
// This expects a comma separated expression:
|
|
48
|
-
// Some.Address.In.The.Object,==,Search Term to Match
|
|
49
|
-
let tmpMagicComparisonPatternSet = pMagicSearchExpression.split(',');
|
|
50
|
-
|
|
51
|
-
let tmpSearchAddress = tmpMagicComparisonPatternSet[0];
|
|
52
|
-
let tmpSearchComparator = tmpMagicComparisonPatternSet[1];
|
|
53
|
-
let tmpSearchValue = tmpMagicComparisonPatternSet[2];
|
|
54
|
-
|
|
55
|
-
switch(tmpSearchComparator)
|
|
56
|
-
{
|
|
57
|
-
case '!=':
|
|
58
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) != tmpSearchValue);
|
|
59
|
-
break;
|
|
60
|
-
case '<':
|
|
61
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) < tmpSearchValue);
|
|
62
|
-
break;
|
|
63
|
-
case '>':
|
|
64
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) > tmpSearchValue);
|
|
65
|
-
break;
|
|
66
|
-
case '<=':
|
|
67
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) <= tmpSearchValue);
|
|
68
|
-
break;
|
|
69
|
-
case '>=':
|
|
70
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) >= tmpSearchValue);
|
|
71
|
-
break;
|
|
72
|
-
case '===':
|
|
73
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) == tmpSearchValue);
|
|
74
|
-
break;
|
|
75
|
-
case '==':
|
|
76
|
-
default:
|
|
77
|
-
pData.KeepRecord = (this.getValueAtAddress(pData.Record, tmpSearchAddress) == tmpSearchValue);
|
|
78
|
-
break;
|
|
79
|
-
}
|
|
80
|
-
});
|
|
81
37
|
}
|
|
82
38
|
|
|
83
39
|
checkFilters(pAddress, pRecord)
|
|
84
40
|
{
|
|
85
|
-
|
|
86
|
-
// If we don't copy the string, precedent takes it out for good.
|
|
87
|
-
// TODO: Consider adding a "don't replace" option for precedent
|
|
88
|
-
let tmpAddress = pAddress;
|
|
89
|
-
|
|
90
|
-
// This allows the magic filtration with configuration
|
|
91
|
-
// TODO: We could pass more state in (e.g. parent address, object, etc.)
|
|
92
|
-
// TODO: Discuss this metaprogramming AT LENGTH
|
|
93
|
-
let tmpFilterState = (
|
|
94
|
-
{
|
|
95
|
-
Record: pRecord,
|
|
96
|
-
KeepRecord: true
|
|
97
|
-
});
|
|
98
|
-
|
|
99
|
-
// This is about as complex as it gets.
|
|
100
|
-
|
|
101
|
-
this.precedent.parseString(tmpAddress, tmpFilterState);
|
|
102
|
-
|
|
103
|
-
return tmpFilterState.KeepRecord;
|
|
41
|
+
return fParseConditionals(this, pAddress, pRecord);
|
|
104
42
|
}
|
|
105
43
|
|
|
106
44
|
// Get the value of an element at an address
|
|
107
|
-
getValueAtAddress (pObject, pAddress, pParentAddress)
|
|
45
|
+
getValueAtAddress (pObject, pAddress, pParentAddress, pRootObject)
|
|
108
46
|
{
|
|
109
47
|
// Make sure pObject (the object we are meant to be recursing) is an object (which could be an array or object)
|
|
110
48
|
if (typeof(pObject) != 'object') return undefined;
|
|
@@ -117,9 +55,54 @@ class ManyfestObjectAddressResolverGetValue
|
|
|
117
55
|
tmpParentAddress = pParentAddress;
|
|
118
56
|
}
|
|
119
57
|
|
|
58
|
+
// Set the root object to the passed-in object if it isn't set yet. This is expected to be the root object.
|
|
59
|
+
let tmpRootObject = (typeof(pRootObject) == 'undefined') ? pObject : pRootObject;
|
|
60
|
+
|
|
120
61
|
// TODO: Make this work for things like SomeRootObject.Metadata["Some.People.Use.Bad.Object.Property.Names"]
|
|
121
62
|
let tmpSeparatorIndex = pAddress.indexOf('.');
|
|
122
63
|
|
|
64
|
+
// Adding simple back-navigation in objects
|
|
65
|
+
if (tmpSeparatorIndex == 0)
|
|
66
|
+
{
|
|
67
|
+
// Given an address of "Bundle.Contract.IDContract...Project.IDProject" the ... would be interpreted as two back-navigations from IDContract.
|
|
68
|
+
// When the address is passed in, though, the first . is already eliminated. So we can count the dots.
|
|
69
|
+
let tmpParentAddressParts = tmpParentAddress.split('.');
|
|
70
|
+
|
|
71
|
+
let tmpBackNavigationCount = 0;
|
|
72
|
+
|
|
73
|
+
// Count the number of dots
|
|
74
|
+
for (let i = 0; i < pAddress.length; i++)
|
|
75
|
+
{
|
|
76
|
+
if (pAddress.charAt(i) != '.')
|
|
77
|
+
{
|
|
78
|
+
break;
|
|
79
|
+
}
|
|
80
|
+
tmpBackNavigationCount++;
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
let tmpParentAddressLength = tmpParentAddressParts.length - tmpBackNavigationCount;
|
|
84
|
+
|
|
85
|
+
if (tmpParentAddressLength < 0)
|
|
86
|
+
{
|
|
87
|
+
// We are trying to back navigate more than we can.
|
|
88
|
+
// TODO: Should this be undefined or should we bank out at the bottom and try to go forward?
|
|
89
|
+
// This seems safest for now.
|
|
90
|
+
return undefined;
|
|
91
|
+
}
|
|
92
|
+
else
|
|
93
|
+
{
|
|
94
|
+
// We are trying to back navigate to a parent object.
|
|
95
|
+
// Recurse with the back-propagated parent address, and, the new address without the back-navigation dots.
|
|
96
|
+
let tmpRecurseAddress = pAddress.slice(tmpBackNavigationCount);
|
|
97
|
+
if (tmpParentAddressLength > 0)
|
|
98
|
+
{
|
|
99
|
+
tmpRecurseAddress = `${tmpParentAddressParts.slice(0, tmpParentAddressLength).join('.')}.${tmpRecurseAddress}`;
|
|
100
|
+
}
|
|
101
|
+
this.logInfo(`Back-navigation detected. Recursing back to address [${tmpRecurseAddress}]`);
|
|
102
|
+
return this.getValueAtAddress(tmpRootObject, tmpRecurseAddress);
|
|
103
|
+
}
|
|
104
|
+
}
|
|
105
|
+
|
|
123
106
|
// This is the terminal address string (no more dots so the RECUSION ENDS IN HERE somehow)
|
|
124
107
|
if (tmpSeparatorIndex == -1)
|
|
125
108
|
{
|
|
@@ -307,14 +290,14 @@ class ManyfestObjectAddressResolverGetValue
|
|
|
307
290
|
// Continue to manage the parent address for recursion
|
|
308
291
|
tmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;
|
|
309
292
|
// Recurse directly into the subobject
|
|
310
|
-
return this.getValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress, tmpParentAddress);
|
|
293
|
+
return this.getValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyReference], tmpNewAddress, tmpParentAddress, tmpRootObject);
|
|
311
294
|
}
|
|
312
295
|
else
|
|
313
296
|
{
|
|
314
297
|
// Continue to manage the parent address for recursion
|
|
315
298
|
tmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;
|
|
316
299
|
// We parsed a valid number out of the boxed property name, so recurse into the array
|
|
317
|
-
return this.getValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress, tmpParentAddress);
|
|
300
|
+
return this.getValueAtAddress(pObject[tmpBoxedPropertyName][tmpBoxedPropertyNumber], tmpNewAddress, tmpParentAddress, tmpRootObject);
|
|
318
301
|
}
|
|
319
302
|
}
|
|
320
303
|
// The requirements to detect a boxed set element are:
|
|
@@ -342,7 +325,7 @@ class ManyfestObjectAddressResolverGetValue
|
|
|
342
325
|
for (let i = 0; i < tmpArrayProperty.length; i++)
|
|
343
326
|
{
|
|
344
327
|
let tmpPropertyParentAddress = `${tmpParentAddress}[${i}]`;
|
|
345
|
-
let tmpValue = this.getValueAtAddress(pObject[tmpBoxedPropertyName][i], tmpNewAddress, tmpPropertyParentAddress);
|
|
328
|
+
let tmpValue = this.getValueAtAddress(pObject[tmpBoxedPropertyName][i], tmpNewAddress, tmpPropertyParentAddress, tmpRootObject);
|
|
346
329
|
|
|
347
330
|
tmpContainerObject[`${tmpPropertyParentAddress}.${tmpNewAddress}`] = tmpValue;
|
|
348
331
|
}
|
|
@@ -373,7 +356,7 @@ class ManyfestObjectAddressResolverGetValue
|
|
|
373
356
|
for (let i = 0; i < tmpObjectPropertyKeys.length; i++)
|
|
374
357
|
{
|
|
375
358
|
let tmpPropertyParentAddress = `${tmpParentAddress}.${tmpObjectPropertyKeys[i]}`;
|
|
376
|
-
let tmpValue = this.getValueAtAddress(pObject[tmpObjectPropertyName][tmpObjectPropertyKeys[i]], tmpNewAddress, tmpPropertyParentAddress);
|
|
359
|
+
let tmpValue = this.getValueAtAddress(pObject[tmpObjectPropertyName][tmpObjectPropertyKeys[i]], tmpNewAddress, tmpPropertyParentAddress, tmpRootObject);
|
|
377
360
|
|
|
378
361
|
// The filtering is complex but allows config-based metaprogramming directly from schema
|
|
379
362
|
let tmpKeepRecord = this.checkFilters(pAddress, tmpValue);
|
|
@@ -397,7 +380,7 @@ class ManyfestObjectAddressResolverGetValue
|
|
|
397
380
|
// If there is already a subobject pass that to the recursive thingy
|
|
398
381
|
// Continue to manage the parent address for recursion
|
|
399
382
|
tmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;
|
|
400
|
-
return this.getValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress);
|
|
383
|
+
return this.getValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress, tmpRootObject);
|
|
401
384
|
}
|
|
402
385
|
else
|
|
403
386
|
{
|
|
@@ -405,7 +388,7 @@ class ManyfestObjectAddressResolverGetValue
|
|
|
405
388
|
// Continue to manage the parent address for recursion
|
|
406
389
|
tmpParentAddress = `${tmpParentAddress}${(tmpParentAddress.length > 0) ? '.' : ''}${tmpSubObjectName}`;
|
|
407
390
|
pObject[tmpSubObjectName] = {};
|
|
408
|
-
return this.getValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress);
|
|
391
|
+
return this.getValueAtAddress(pObject[tmpSubObjectName], tmpNewAddress, tmpParentAddress, tmpRootObject);
|
|
409
392
|
}
|
|
410
393
|
}
|
|
411
394
|
}
|
|
@@ -0,0 +1,91 @@
|
|
|
1
|
+
// Given a string, parse out any conditional expressions and set whether or not to keep the record.
|
|
2
|
+
//
|
|
3
|
+
// For instance:
|
|
4
|
+
// 'files[]<<~?format,==,Thumbnail?~>>'
|
|
5
|
+
// 'files[]<<~?format,==,Metadata?~>>'
|
|
6
|
+
// 'files[]<<~?size,>,4000?~>>'
|
|
7
|
+
//
|
|
8
|
+
// The wrapping parts are the <<~? and ?~>> megabrackets.
|
|
9
|
+
//
|
|
10
|
+
// The function does not need to alter the string -- just check the conditionals within.
|
|
11
|
+
|
|
12
|
+
// TODO: Consider making this an es6 class
|
|
13
|
+
|
|
14
|
+
// Let's use indexOf since it is apparently the fastest.
|
|
15
|
+
const _ConditionalStanzaStart = '<<~?';
|
|
16
|
+
const _ConditionalStanzaStartLength = _ConditionalStanzaStart.length;
|
|
17
|
+
const _ConditionalStanzaEnd = '?~>>';
|
|
18
|
+
const _ConditionalStanzaEndLength = _ConditionalStanzaEnd.length;
|
|
19
|
+
|
|
20
|
+
// Test the condition of a value in a record
|
|
21
|
+
const testCondition = (pManyfest, pRecord, pSearchAddress, pSearchComparator, pValue) =>
|
|
22
|
+
{
|
|
23
|
+
switch(pSearchComparator)
|
|
24
|
+
{
|
|
25
|
+
case '!=':
|
|
26
|
+
return (pManyfest.getValueAtAddress(pRecord, pSearchAddress) != pValue);
|
|
27
|
+
break;
|
|
28
|
+
case '<':
|
|
29
|
+
return (pManyfest.getValueAtAddress(pRecord, pSearchAddress) < pValue);
|
|
30
|
+
break;
|
|
31
|
+
case '>':
|
|
32
|
+
return (pManyfest.getValueAtAddress(pRecord, pSearchAddress) > pValue);
|
|
33
|
+
break;
|
|
34
|
+
case '<=':
|
|
35
|
+
return (pManyfest.getValueAtAddress(pRecord, pSearchAddress) <= pValue);
|
|
36
|
+
break;
|
|
37
|
+
case '>=':
|
|
38
|
+
return (pManyfest.getValueAtAddress(pRecord, pSearchAddress) >= pValue);
|
|
39
|
+
break;
|
|
40
|
+
case '===':
|
|
41
|
+
return (pManyfest.getValueAtAddress(pRecord, pSearchAddress) === pValue);
|
|
42
|
+
break;
|
|
43
|
+
case '==':
|
|
44
|
+
default:
|
|
45
|
+
return (pManyfest.getValueAtAddress(pRecord, pSearchAddress) == pValue);
|
|
46
|
+
break;
|
|
47
|
+
}
|
|
48
|
+
};
|
|
49
|
+
|
|
50
|
+
const parseConditionals = (pManyfest, pAddress, pRecord) =>
|
|
51
|
+
{
|
|
52
|
+
let tmpKeepRecord = true;
|
|
53
|
+
|
|
54
|
+
/*
|
|
55
|
+
Algorithm is simple:
|
|
56
|
+
|
|
57
|
+
1. Enuerate start points
|
|
58
|
+
|
|
59
|
+
2. Find stop points within each start point
|
|
60
|
+
3. Check the conditional
|
|
61
|
+
*/
|
|
62
|
+
|
|
63
|
+
let tmpStartIndex = pAddress.indexOf(_ConditionalStanzaStart);
|
|
64
|
+
|
|
65
|
+
while (tmpStartIndex != -1)
|
|
66
|
+
{
|
|
67
|
+
let tmpStopIndex = pAddress.indexOf(_ConditionalStanzaEnd, tmpStartIndex+_ConditionalStanzaStartLength);
|
|
68
|
+
|
|
69
|
+
if (tmpStopIndex != -1)
|
|
70
|
+
{
|
|
71
|
+
let tmpMagicComparisonPatternSet = pAddress.substring(tmpStartIndex+_ConditionalStanzaStartLength, tmpStopIndex).split(',');
|
|
72
|
+
|
|
73
|
+
let tmpSearchAddress = tmpMagicComparisonPatternSet[0];
|
|
74
|
+
let tmpSearchComparator = tmpMagicComparisonPatternSet[1];
|
|
75
|
+
let tmpSearchValue = tmpMagicComparisonPatternSet[2];
|
|
76
|
+
|
|
77
|
+
// Process the piece
|
|
78
|
+
tmpKeepRecord = tmpKeepRecord && testCondition(pManyfest, pRecord, tmpSearchAddress, tmpSearchComparator, tmpSearchValue);
|
|
79
|
+
tmpStartIndex = pAddress.indexOf(_ConditionalStanzaStart, tmpStopIndex+_ConditionalStanzaEndLength);
|
|
80
|
+
}
|
|
81
|
+
else
|
|
82
|
+
{
|
|
83
|
+
tmpStartIndex = -1;
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
}
|
|
87
|
+
|
|
88
|
+
return tmpKeepRecord;
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
module.exports = parseConditionals;
|
package/source/Manyfest.js
CHANGED
|
@@ -3,8 +3,6 @@
|
|
|
3
3
|
*/
|
|
4
4
|
let libSimpleLog = require('./Manyfest-LogToConsole.js');
|
|
5
5
|
|
|
6
|
-
let libPrecedent = require('precedent');
|
|
7
|
-
|
|
8
6
|
let libHashTranslation = require('./Manyfest-HashTranslation.js');
|
|
9
7
|
let libObjectAddressCheckAddressExists = require('./Manyfest-ObjectAddress-CheckAddressExists.js');
|
|
10
8
|
let libObjectAddressGetValue = require('./Manyfest-ObjectAddress-GetValue.js');
|
|
@@ -25,6 +25,30 @@ suite
|
|
|
25
25
|
'Set Filtration',
|
|
26
26
|
()=>
|
|
27
27
|
{
|
|
28
|
+
test
|
|
29
|
+
(
|
|
30
|
+
'Underlying template processor should be able to filter records and be fast.',
|
|
31
|
+
(fTestComplete)=>
|
|
32
|
+
{
|
|
33
|
+
let _Manyfest = new libManyfest();
|
|
34
|
+
|
|
35
|
+
let templateParser = require(`../source/Manyfest-ParseConditionals.js`);
|
|
36
|
+
|
|
37
|
+
let tmpTestRecord = {Name:'Jimbo', Age:31, Pets:{Fido:'Dog',Spot:'Cat'}};
|
|
38
|
+
|
|
39
|
+
let tmpTestTemplate = 'Document.FormData.Parsable.Filters[]<<~?Name,==,Jimbo?~>>';
|
|
40
|
+
|
|
41
|
+
let tmpTestResult = templateParser(_Manyfest, tmpTestTemplate, tmpTestRecord);
|
|
42
|
+
|
|
43
|
+
Expect(tmpTestResult).to.equal(true);
|
|
44
|
+
|
|
45
|
+
tmpTestRecord.Name = 'Bob';
|
|
46
|
+
|
|
47
|
+
Expect(templateParser(_Manyfest, tmpTestTemplate, tmpTestRecord)).to.equal(false);
|
|
48
|
+
|
|
49
|
+
return fTestComplete();
|
|
50
|
+
}
|
|
51
|
+
)
|
|
28
52
|
test
|
|
29
53
|
(
|
|
30
54
|
'Magic filters should be magic.',
|
|
@@ -12,6 +12,7 @@ var Expect = Chai.expect;
|
|
|
12
12
|
let libManyfest = require('../source/Manyfest.js');
|
|
13
13
|
|
|
14
14
|
let _SampleDataArchiveOrgFrankenberry = require('./Data-Archive-org-Frankenberry.json');
|
|
15
|
+
let _SampleDataYahooWeather = require('./Data-Yahoo-Weather.json');
|
|
15
16
|
|
|
16
17
|
suite
|
|
17
18
|
(
|
|
@@ -100,9 +101,36 @@ suite
|
|
|
100
101
|
);
|
|
101
102
|
suite
|
|
102
103
|
(
|
|
103
|
-
'Advanced Read (with Arrays and Boxed Property addresses)',
|
|
104
|
+
'Advanced Read (with Arrays and Boxed Property and Backwards navigation addresses)',
|
|
104
105
|
()=>
|
|
105
106
|
{
|
|
107
|
+
test
|
|
108
|
+
(
|
|
109
|
+
'Access relative objects',
|
|
110
|
+
(fTestComplete)=>
|
|
111
|
+
{
|
|
112
|
+
let _Manyfest = new libManyfest();
|
|
113
|
+
// Traverse a relative address
|
|
114
|
+
let tmpVideoPointer = _Manyfest.getValueAtAddress(_SampleDataArchiveOrgFrankenberry, 'files[0]');
|
|
115
|
+
Expect(tmpVideoPointer.original).to.equal('frankerberry_countchockula_1971.0001.mpg');
|
|
116
|
+
// The .. means go back one level
|
|
117
|
+
let tmpDir = _Manyfest.getValueAtAddress(_SampleDataArchiveOrgFrankenberry, 'files[0]..dir');
|
|
118
|
+
Expect(tmpDir).to.equal("/7/items/FrankenberryCountChoculaTevevisionCommercial1971");
|
|
119
|
+
fTestComplete();
|
|
120
|
+
}
|
|
121
|
+
);
|
|
122
|
+
test
|
|
123
|
+
(
|
|
124
|
+
'Access relative objects complexly',
|
|
125
|
+
(fTestComplete)=>
|
|
126
|
+
{
|
|
127
|
+
let _Manyfest = new libManyfest();
|
|
128
|
+
Expect(_Manyfest.getValueAtAddress(_SampleDataYahooWeather, 'location.city')).to.equal('Sunnyvale');
|
|
129
|
+
// The .. means go back one level
|
|
130
|
+
Expect(_Manyfest.getValueAtAddress(_SampleDataYahooWeather, 'current_observation.wind...location.city')).to.equal('Sunnyvale');
|
|
131
|
+
fTestComplete();
|
|
132
|
+
}
|
|
133
|
+
);
|
|
106
134
|
test
|
|
107
135
|
(
|
|
108
136
|
'Access specific array elements',
|
|
@@ -1,339 +0,0 @@
|
|
|
1
|
-
(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
|
|
2
|
-
"use strict";
|
|
3
|
-
|
|
4
|
-
var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();
|
|
5
|
-
|
|
6
|
-
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
|
|
7
|
-
|
|
8
|
-
/**
|
|
9
|
-
* Precedent Meta-Templating
|
|
10
|
-
*
|
|
11
|
-
* @license MIT
|
|
12
|
-
*
|
|
13
|
-
* @author Steven Velozo <steven@velozo.com>
|
|
14
|
-
*
|
|
15
|
-
* @description Process text streams, parsing out meta-template expressions.
|
|
16
|
-
*/
|
|
17
|
-
var libWordTree = require("./WordTree.js");
|
|
18
|
-
var libStringParser = require("./StringParser.js");
|
|
19
|
-
|
|
20
|
-
var Precedent = function () {
|
|
21
|
-
/**
|
|
22
|
-
* Precedent Constructor
|
|
23
|
-
*/
|
|
24
|
-
function Precedent() {
|
|
25
|
-
_classCallCheck(this, Precedent);
|
|
26
|
-
|
|
27
|
-
this.WordTree = new libWordTree();
|
|
28
|
-
|
|
29
|
-
this.StringParser = new libStringParser();
|
|
30
|
-
|
|
31
|
-
this.ParseTree = this.WordTree.ParseTree;
|
|
32
|
-
}
|
|
33
|
-
|
|
34
|
-
/**
|
|
35
|
-
* Add a Pattern to the Parse Tree
|
|
36
|
-
* @method addPattern
|
|
37
|
-
* @param {Object} pTree - A node on the parse tree to push the characters into
|
|
38
|
-
* @param {string} pPattern - The string to add to the tree
|
|
39
|
-
* @param {number} pIndex - callback function
|
|
40
|
-
* @return {bool} True if adding the pattern was successful
|
|
41
|
-
*/
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
_createClass(Precedent, [{
|
|
45
|
-
key: "addPattern",
|
|
46
|
-
value: function addPattern(pPatternStart, pPatternEnd, pParser) {
|
|
47
|
-
return this.WordTree.addPattern(pPatternStart, pPatternEnd, pParser);
|
|
48
|
-
}
|
|
49
|
-
|
|
50
|
-
/**
|
|
51
|
-
* Parse a string with the existing parse tree
|
|
52
|
-
* @method parseString
|
|
53
|
-
* @param {string} pString - The string to parse
|
|
54
|
-
* @return {string} The result from the parser
|
|
55
|
-
*/
|
|
56
|
-
|
|
57
|
-
}, {
|
|
58
|
-
key: "parseString",
|
|
59
|
-
value: function parseString(pString) {
|
|
60
|
-
return this.StringParser.parseString(pString, this.ParseTree);
|
|
61
|
-
}
|
|
62
|
-
}]);
|
|
63
|
-
|
|
64
|
-
return Precedent;
|
|
65
|
-
}();
|
|
66
|
-
|
|
67
|
-
module.exports = Precedent;
|
|
68
|
-
|
|
69
|
-
},{"./StringParser.js":2,"./WordTree.js":3}],2:[function(require,module,exports){
|
|
70
|
-
'use strict';
|
|
71
|
-
|
|
72
|
-
var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();
|
|
73
|
-
|
|
74
|
-
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
|
|
75
|
-
|
|
76
|
-
/**
|
|
77
|
-
* String Parser
|
|
78
|
-
*
|
|
79
|
-
* @license MIT
|
|
80
|
-
*
|
|
81
|
-
* @author Steven Velozo <steven@velozo.com>
|
|
82
|
-
*
|
|
83
|
-
* @description Parse a string, properly processing each matched token in the word tree.
|
|
84
|
-
*/
|
|
85
|
-
|
|
86
|
-
var StringParser = function () {
|
|
87
|
-
/**
|
|
88
|
-
* StringParser Constructor
|
|
89
|
-
*/
|
|
90
|
-
function StringParser() {
|
|
91
|
-
_classCallCheck(this, StringParser);
|
|
92
|
-
}
|
|
93
|
-
|
|
94
|
-
/**
|
|
95
|
-
* Create a fresh parsing state object to work with.
|
|
96
|
-
* @method newParserState
|
|
97
|
-
* @param {Object} pParseTree - A node on the parse tree to begin parsing from (usually root)
|
|
98
|
-
* @return {Object} A new parser state object for running a character parser on
|
|
99
|
-
* @private
|
|
100
|
-
*/
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
_createClass(StringParser, [{
|
|
104
|
-
key: 'newParserState',
|
|
105
|
-
value: function newParserState(pParseTree) {
|
|
106
|
-
return {
|
|
107
|
-
ParseTree: pParseTree,
|
|
108
|
-
|
|
109
|
-
Output: '',
|
|
110
|
-
OutputBuffer: '',
|
|
111
|
-
|
|
112
|
-
Pattern: false,
|
|
113
|
-
|
|
114
|
-
PatternMatch: false,
|
|
115
|
-
PatternMatchOutputBuffer: ''
|
|
116
|
-
};
|
|
117
|
-
}
|
|
118
|
-
|
|
119
|
-
/**
|
|
120
|
-
* Assign a node of the parser tree to be the next potential match.
|
|
121
|
-
* If the node has a PatternEnd property, it is a valid match and supercedes the last valid match (or becomes the initial match).
|
|
122
|
-
* @method assignNode
|
|
123
|
-
* @param {Object} pNode - A node on the parse tree to assign
|
|
124
|
-
* @param {Object} pParserState - The state object for the current parsing task
|
|
125
|
-
* @private
|
|
126
|
-
*/
|
|
127
|
-
|
|
128
|
-
}, {
|
|
129
|
-
key: 'assignNode',
|
|
130
|
-
value: function assignNode(pNode, pParserState) {
|
|
131
|
-
pParserState.PatternMatch = pNode;
|
|
132
|
-
|
|
133
|
-
// If the pattern has a END we can assume it has a parse function...
|
|
134
|
-
if (pParserState.PatternMatch.hasOwnProperty('PatternEnd')) {
|
|
135
|
-
// ... this is the legitimate start of a pattern.
|
|
136
|
-
pParserState.Pattern = pParserState.PatternMatch;
|
|
137
|
-
}
|
|
138
|
-
}
|
|
139
|
-
|
|
140
|
-
/**
|
|
141
|
-
* Append a character to the output buffer in the parser state.
|
|
142
|
-
* This output buffer is used when a potential match is being explored, or a match is being explored.
|
|
143
|
-
* @method appendOutputBuffer
|
|
144
|
-
* @param {string} pCharacter - The character to append
|
|
145
|
-
* @param {Object} pParserState - The state object for the current parsing task
|
|
146
|
-
* @private
|
|
147
|
-
*/
|
|
148
|
-
|
|
149
|
-
}, {
|
|
150
|
-
key: 'appendOutputBuffer',
|
|
151
|
-
value: function appendOutputBuffer(pCharacter, pParserState) {
|
|
152
|
-
pParserState.OutputBuffer += pCharacter;
|
|
153
|
-
}
|
|
154
|
-
|
|
155
|
-
/**
|
|
156
|
-
* Flush the output buffer to the output and clear it.
|
|
157
|
-
* @method flushOutputBuffer
|
|
158
|
-
* @param {Object} pParserState - The state object for the current parsing task
|
|
159
|
-
* @private
|
|
160
|
-
*/
|
|
161
|
-
|
|
162
|
-
}, {
|
|
163
|
-
key: 'flushOutputBuffer',
|
|
164
|
-
value: function flushOutputBuffer(pParserState) {
|
|
165
|
-
pParserState.Output += pParserState.OutputBuffer;
|
|
166
|
-
pParserState.OutputBuffer = '';
|
|
167
|
-
}
|
|
168
|
-
|
|
169
|
-
/**
|
|
170
|
-
* Check if the pattern has ended. If it has, properly flush the buffer and start looking for new patterns.
|
|
171
|
-
* @method checkPatternEnd
|
|
172
|
-
* @param {Object} pParserState - The state object for the current parsing task
|
|
173
|
-
* @private
|
|
174
|
-
*/
|
|
175
|
-
|
|
176
|
-
}, {
|
|
177
|
-
key: 'checkPatternEnd',
|
|
178
|
-
value: function checkPatternEnd(pParserState) {
|
|
179
|
-
if (pParserState.OutputBuffer.length >= pParserState.Pattern.PatternEnd.length + pParserState.Pattern.PatternStart.length && pParserState.OutputBuffer.substr(-pParserState.Pattern.PatternEnd.length) === pParserState.Pattern.PatternEnd) {
|
|
180
|
-
// ... this is the end of a pattern, cut off the end tag and parse it.
|
|
181
|
-
// Trim the start and end tags off the output buffer now
|
|
182
|
-
pParserState.OutputBuffer = pParserState.Pattern.Parse(pParserState.OutputBuffer.substr(pParserState.Pattern.PatternStart.length, pParserState.OutputBuffer.length - (pParserState.Pattern.PatternStart.length + pParserState.Pattern.PatternEnd.length)));
|
|
183
|
-
// Flush the output buffer.
|
|
184
|
-
this.flushOutputBuffer(pParserState);
|
|
185
|
-
// End pattern mode
|
|
186
|
-
pParserState.Pattern = false;
|
|
187
|
-
pParserState.PatternMatch = false;
|
|
188
|
-
}
|
|
189
|
-
}
|
|
190
|
-
|
|
191
|
-
/**
|
|
192
|
-
* Parse a character in the buffer.
|
|
193
|
-
* @method parseCharacter
|
|
194
|
-
* @param {string} pCharacter - The character to append
|
|
195
|
-
* @param {Object} pParserState - The state object for the current parsing task
|
|
196
|
-
* @private
|
|
197
|
-
*/
|
|
198
|
-
|
|
199
|
-
}, {
|
|
200
|
-
key: 'parseCharacter',
|
|
201
|
-
value: function parseCharacter(pCharacter, pParserState) {
|
|
202
|
-
// (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....
|
|
203
|
-
if (!pParserState.PatternMatch && pParserState.ParseTree.hasOwnProperty(pCharacter)) {
|
|
204
|
-
// ... assign the node as the matched node.
|
|
205
|
-
this.assignNode(pParserState.ParseTree[pCharacter], pParserState);
|
|
206
|
-
this.appendOutputBuffer(pCharacter, pParserState);
|
|
207
|
-
}
|
|
208
|
-
// (2) If we are in a pattern match (actively seeing if this is part of a new pattern token)
|
|
209
|
-
else if (pParserState.PatternMatch) {
|
|
210
|
-
// If the pattern has a subpattern with this key
|
|
211
|
-
if (pParserState.PatternMatch.hasOwnProperty(pCharacter)) {
|
|
212
|
-
// Continue matching patterns.
|
|
213
|
-
this.assignNode(pParserState.PatternMatch[pCharacter], pParserState);
|
|
214
|
-
}
|
|
215
|
-
this.appendOutputBuffer(pCharacter, pParserState);
|
|
216
|
-
if (pParserState.Pattern) {
|
|
217
|
-
// ... Check if this is the end of the pattern (if we are matching a valid pattern)...
|
|
218
|
-
this.checkPatternEnd(pParserState);
|
|
219
|
-
}
|
|
220
|
-
}
|
|
221
|
-
// (3) If we aren't in a pattern match or pattern, and this isn't the start of a new pattern (RAW mode)....
|
|
222
|
-
else {
|
|
223
|
-
pParserState.Output += pCharacter;
|
|
224
|
-
}
|
|
225
|
-
}
|
|
226
|
-
|
|
227
|
-
/**
|
|
228
|
-
* Parse a string for matches, and process any template segments that occur.
|
|
229
|
-
* @method parseString
|
|
230
|
-
* @param {string} pString - The string to parse.
|
|
231
|
-
* @param {Object} pParseTree - The parse tree to begin parsing from (usually root)
|
|
232
|
-
*/
|
|
233
|
-
|
|
234
|
-
}, {
|
|
235
|
-
key: 'parseString',
|
|
236
|
-
value: function parseString(pString, pParseTree) {
|
|
237
|
-
var tmpParserState = this.newParserState(pParseTree);
|
|
238
|
-
|
|
239
|
-
for (var i = 0; i < pString.length; i++) {
|
|
240
|
-
// TODO: This is not fast.
|
|
241
|
-
this.parseCharacter(pString[i], tmpParserState);
|
|
242
|
-
}
|
|
243
|
-
|
|
244
|
-
this.flushOutputBuffer(tmpParserState);
|
|
245
|
-
|
|
246
|
-
return tmpParserState.Output;
|
|
247
|
-
}
|
|
248
|
-
}]);
|
|
249
|
-
|
|
250
|
-
return StringParser;
|
|
251
|
-
}();
|
|
252
|
-
|
|
253
|
-
module.exports = StringParser;
|
|
254
|
-
|
|
255
|
-
},{}],3:[function(require,module,exports){
|
|
256
|
-
'use strict';
|
|
257
|
-
|
|
258
|
-
var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();
|
|
259
|
-
|
|
260
|
-
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
|
|
261
|
-
|
|
262
|
-
/**
|
|
263
|
-
* Word Tree
|
|
264
|
-
*
|
|
265
|
-
* @license MIT
|
|
266
|
-
*
|
|
267
|
-
* @author Steven Velozo <steven@velozo.com>
|
|
268
|
-
*
|
|
269
|
-
* @description Create a tree (directed graph) of Javascript objects, one character per object.
|
|
270
|
-
*/
|
|
271
|
-
|
|
272
|
-
var WordTree = function () {
|
|
273
|
-
/**
|
|
274
|
-
* WordTree Constructor
|
|
275
|
-
*/
|
|
276
|
-
function WordTree() {
|
|
277
|
-
_classCallCheck(this, WordTree);
|
|
278
|
-
|
|
279
|
-
this.ParseTree = {};
|
|
280
|
-
}
|
|
281
|
-
|
|
282
|
-
/**
|
|
283
|
-
* Add a child character to a Parse Tree node
|
|
284
|
-
* @method addChild
|
|
285
|
-
* @param {Object} pTree - A parse tree to push the characters into
|
|
286
|
-
* @param {string} pPattern - The string to add to the tree
|
|
287
|
-
* @param {number} pIndex - callback function
|
|
288
|
-
* @returns {Object} The resulting leaf node that was added (or found)
|
|
289
|
-
* @private
|
|
290
|
-
*/
|
|
291
|
-
|
|
292
|
-
|
|
293
|
-
_createClass(WordTree, [{
|
|
294
|
-
key: 'addChild',
|
|
295
|
-
value: function addChild(pTree, pPattern, pIndex) {
|
|
296
|
-
if (pIndex > pPattern.length) return pTree;
|
|
297
|
-
|
|
298
|
-
if (!pTree.hasOwnProperty(pPattern[pIndex])) pTree[pPattern[pIndex]] = {};
|
|
299
|
-
|
|
300
|
-
return pTree[pPattern[pIndex]];
|
|
301
|
-
}
|
|
302
|
-
|
|
303
|
-
/** Add a Pattern to the Parse Tree
|
|
304
|
-
* @method addPattern
|
|
305
|
-
* @param {Object} pTree - A node on the parse tree to push the characters into
|
|
306
|
-
* @param {string} pPattern - The string to add to the tree
|
|
307
|
-
* @param {number} pIndex - callback function
|
|
308
|
-
* @return {bool} True if adding the pattern was successful
|
|
309
|
-
*/
|
|
310
|
-
|
|
311
|
-
}, {
|
|
312
|
-
key: 'addPattern',
|
|
313
|
-
value: function addPattern(pPatternStart, pPatternEnd, pParser) {
|
|
314
|
-
if (pPatternStart.length < 1) return false;
|
|
315
|
-
|
|
316
|
-
var tmpLeaf = this.ParseTree;
|
|
317
|
-
|
|
318
|
-
// Add the tree of leaves iteratively
|
|
319
|
-
for (var i = 0; i < pPatternStart.length; i++) {
|
|
320
|
-
tmpLeaf = this.addChild(tmpLeaf, pPatternStart, i);
|
|
321
|
-
}tmpLeaf.PatternStart = pPatternStart;
|
|
322
|
-
tmpLeaf.PatternEnd = typeof pPatternEnd === 'string' && pPatternEnd.length > 0 ? pPatternEnd : pPatternStart;
|
|
323
|
-
tmpLeaf.Parse = typeof pParser === 'function' ? pParser : typeof pParser === 'string' ? function () {
|
|
324
|
-
return pParser;
|
|
325
|
-
} : function (pData) {
|
|
326
|
-
return pData;
|
|
327
|
-
};
|
|
328
|
-
|
|
329
|
-
return true;
|
|
330
|
-
}
|
|
331
|
-
}]);
|
|
332
|
-
|
|
333
|
-
return WordTree;
|
|
334
|
-
}();
|
|
335
|
-
|
|
336
|
-
module.exports = WordTree;
|
|
337
|
-
|
|
338
|
-
},{}]},{},[1])
|
|
339
|
-
//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"sources":["node_modules/browser-pack/_prelude.js","source/Precedent.js","source/StringParser.js","source/WordTree.js"],"names":[],"mappings":"AAAA;;;;;;;ACAA;;;;;;;;;AASA,IAAI,cAAc,wBAAlB;AACA,IAAI,kBAAkB,4BAAtB;;IAEM,S;AAEL;;;AAGA,sBACA;AAAA;;AACC,OAAK,QAAL,GAAgB,IAAI,WAAJ,EAAhB;;AAEA,OAAK,YAAL,GAAoB,IAAI,eAAJ,EAApB;;AAEA,OAAK,SAAL,GAAiB,KAAK,QAAL,CAAc,SAA/B;AACA;;AAED;;;;;;;;;;;;6BAQW,a,EAAe,W,EAAa,O,EACvC;AACC,UAAO,KAAK,QAAL,CAAc,UAAd,CAAyB,aAAzB,EAAwC,WAAxC,EAAqD,OAArD,CAAP;AACA;;AAED;;;;;;;;;8BAMY,O,EACZ;AACC,UAAO,KAAK,YAAL,CAAkB,WAAlB,CAA8B,OAA9B,EAAuC,KAAK,SAA5C,CAAP;AACA;;;;;;AAGF,OAAO,OAAP,GAAiB,SAAjB;;;;;;;;;ACnDA;;;;;;;;;;IAUM,Y;AAEL;;;AAGA,yBACA;AAAA;AACC;;AAED;;;;;;;;;;;iCAOgB,U,EAChB;AACC,UACA;AACI,eAAW,UADf;;AAGC,YAAQ,EAHT;AAIC,kBAAc,EAJf;;AAMC,aAAS,KANV;;AAQC,kBAAc,KARf;AASC,8BAA0B;AAT3B,IADA;AAYA;;AAED;;;;;;;;;;;6BAQY,K,EAAO,Y,EACnB;AACC,gBAAa,YAAb,GAA4B,KAA5B;;AAEA;AACA,OAAI,aAAa,YAAb,CAA0B,cAA1B,CAAyC,YAAzC,CAAJ,EACA;AACC;AACA,iBAAa,OAAb,GAAuB,aAAa,YAApC;AACA;AACD;;AAED;;;;;;;;;;;qCAQoB,U,EAAY,Y,EAChC;AACC,gBAAa,YAAb,IAA6B,UAA7B;AACA;;AAED;;;;;;;;;oCAMmB,Y,EACnB;AACC,gBAAa,MAAb,IAAuB,aAAa,YAApC;AACA,gBAAa,YAAb,GAA4B,EAA5B;AACA;;AAGD;;;;;;;;;kCAMiB,Y,EACjB;AACC,OAAK,aAAa,YAAb,CAA0B,MAA1B,IAAoC,aAAa,OAAb,CAAqB,UAArB,CAAgC,MAAhC,GAAuC,aAAa,OAAb,CAAqB,YAArB,CAAkC,MAA9G,IACF,aAAa,YAAb,CAA0B,MAA1B,CAAiC,CAAC,aAAa,OAAb,CAAqB,UAArB,CAAgC,MAAlE,MAA8E,aAAa,OAAb,CAAqB,UADrG,EAEA;AACC;AACA;AACA,iBAAa,YAAb,GAA4B,aAAa,OAAb,CAAqB,KAArB,CAA2B,aAAa,YAAb,CAA0B,MAA1B,CAAiC,aAAa,OAAb,CAAqB,YAArB,CAAkC,MAAnE,EAA2E,aAAa,YAAb,CAA0B,MAA1B,IAAoC,aAAa,OAAb,CAAqB,YAArB,CAAkC,MAAlC,GAAyC,aAAa,OAAb,CAAqB,UAArB,CAAgC,MAA7G,CAA3E,CAA3B,CAA5B;AACA;AACA,SAAK,iBAAL,CAAuB,YAAvB;AACA;AACA,iBAAa,OAAb,GAAuB,KAAvB;AACA,iBAAa,YAAb,GAA4B,KAA5B;AACA;AACD;;AAED;;;;;;;;;;iCAOgB,U,EAAY,Y,EAC5B;AACC;AACA,OAAI,CAAC,aAAa,YAAd,IAA8B,aAAa,SAAb,CAAuB,cAAvB,CAAsC,UAAtC,CAAlC,EACA;AACC;AACA,SAAK,UAAL,CAAgB,aAAa,SAAb,CAAuB,UAAvB,CAAhB,EAAoD,YAApD;AACA,SAAK,kBAAL,CAAwB,UAAxB,EAAoC,YAApC;AACA;AACD;AANA,QAOK,IAAI,aAAa,YAAjB,EACL;AACC;AACA,SAAI,aAAa,YAAb,CAA0B,cAA1B,CAAyC,UAAzC,CAAJ,EACA;AACC;AACA,WAAK,UAAL,CAAgB,aAAa,YAAb,CAA0B,UAA1B,CAAhB,EAAuD,YAAvD;AACA;AACD,UAAK,kBAAL,CAAwB,UAAxB,EAAoC,YAApC;AACA,SAAI,aAAa,OAAjB,EACA;AACC;AACA,WAAK,eAAL,CAAqB,YAArB;AACA;AACD;AACD;AAfK,SAiBL;AACC,mBAAa,MAAb,IAAuB,UAAvB;AACA;AACD;;AAED;;;;;;;;;8BAMa,O,EAAS,U,EACtB;AACC,OAAI,iBAAiB,KAAK,cAAL,CAAoB,UAApB,CAArB;;AAEA,QAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,QAAQ,MAA5B,EAAoC,GAApC,EACA;AACC;AACA,SAAK,cAAL,CAAoB,QAAQ,CAAR,CAApB,EAAgC,cAAhC;AACA;;AAED,QAAK,iBAAL,CAAuB,cAAvB;;AAEA,UAAO,eAAe,MAAtB;AACA;;;;;;AAGF,OAAO,OAAP,GAAiB,YAAjB;;;;;;;;;AC3KA;;;;;;;;;;IAUM,Q;AAEL;;;AAGA,qBACA;AAAA;;AACC,OAAK,SAAL,GAAiB,EAAjB;AACA;;AAED;;;;;;;;;;;;;2BASU,K,EAAO,Q,EAAU,M,EAC3B;AACC,OAAI,SAAS,SAAS,MAAtB,EACC,OAAO,KAAP;;AAED,OAAI,CAAC,MAAM,cAAN,CAAqB,SAAS,MAAT,CAArB,CAAL,EACC,MAAM,SAAS,MAAT,CAAN,IAA0B,EAA1B;;AAED,UAAO,MAAM,SAAS,MAAT,CAAN,CAAP;AACA;;AAED;;;;;;;;;;6BAOY,a,EAAe,W,EAAa,O,EACxC;AACC,OAAI,cAAc,MAAd,GAAuB,CAA3B,EACC,OAAO,KAAP;;AAED,OAAI,UAAU,KAAK,SAAnB;;AAEA;AACA,QAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,cAAc,MAAlC,EAA0C,GAA1C;AACC,cAAU,KAAK,QAAL,CAAc,OAAd,EAAuB,aAAvB,EAAsC,CAAtC,CAAV;AADD,IAGA,QAAQ,YAAR,GAAuB,aAAvB;AACA,WAAQ,UAAR,GAAuB,OAAO,WAAP,KAAwB,QAAzB,IAAuC,YAAY,MAAZ,GAAqB,CAA7D,GAAmE,WAAnE,GAAiF,aAAtG;AACA,WAAQ,KAAR,GAAiB,OAAO,OAAP,KAAoB,UAArB,GAAmC,OAAnC,GACX,OAAO,OAAP,KAAoB,QAArB,GAAiC,YAAM;AAAE,WAAO,OAAP;AAAiB,IAA1D,GACA,UAAC,KAAD,EAAW;AAAE,WAAO,KAAP;AAAe,IAFhC;;AAIA,UAAO,IAAP;AACA;;;;;;AAGF,OAAO,OAAP,GAAiB,QAAjB","file":"generated.js","sourceRoot":"","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})","/**\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"]}
|