pWiki/v3/pwiki/macros.js

1696 lines
46 KiB
JavaScript

/**********************************************************************
*
*
*
**********************************************************************/
((typeof define)[0]=='u'?function(f){module.exports=f(require)}:define)
(function(require){ var module={} // make module AMD/node compatible...
/*********************************************************************/
var object = require('ig-object')
var types = require('ig-types')
var serialize = require('ig-serialize')
var pwpath = require('./path')
//---------------------------------------------------------------------
// Parser/Runner...
// XXX TODO:
// - callbacks on elements resolving...
// - option/way to wrap macro output -- callback??
// - naming:
// parser -> macro
//
//
// XXX ASAP move the macros here...
// XXX BUG?: <macro src=/moo/> is not parsed correctly...
// XXX need to correctly handle nested and escaped quotes...
// i.e.
// "aaa \"bbb \\"ccc\\" bbb\" aaa"
// XXX RENAME...
// ...this handles the syntax and execution...
var BaseMacros =
module.BaseMacros = {
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Passive parsing...
//
// XXX might be a good idea to rewrite this level as an actual parser.
//
// patterns...
//
// The way the patterns are organized might seem a bit overcomplicated
// and it has to be to be able to reuse the same pattern in different
// contexts, e.g. the arguments pattern...
//
// needs:
// STOP -- '\\>' or ')'
// PREFIX -- 'inline' or 'elem'
//
// XXX should we support unquoted macros as single arguments???
// i.e. '@(aaa @(bbb ccc))' should collect '@(bbb ccc)' as an
// argument, currently this will be stplit at whitespace...
// ...this is logical but then we'll need to group all nested
// levels, not yet sure how to do this cleanly (one way is to
// write a dedicated parser)
MACRO_ARGS: ['(\\s*(',[
// arg='val' | arg="val" | arg=val
'(?<PREFIXArgName>[a-z:-_]+)\\s*=\\s*(?<PREFIXArgValue>'+([
'"(?<PREFIXDoubleQuotedValue>(\\"|[^"])*?)"',
"'(?<PREFIXSingleQuotedValue>(\\'|[^'])*?)'",
'(?<PREFIXValue>[^\\sSTOP\'"]+)',
].join('|'))+')',
// "arg" | 'arg'
'"(?<PREFIXDoubleQuotedArg>(\\"|[^"])*?)"',
"'(?<PREFIXSingleQuotedArg>(\\'|[^'])*?)'",
// arg
// NOTE: this is last because it could eat up parts of
// the above alternatives...
//'|\\s+[^\\s\\/>\'"]+',
'(?<PREFIXArg>[^\\sSTOP\'"]+)',
].join('|'),
'))'].join(''),
MACRO_ARGS_PATTERN: undefined,
//
// .buildArgsPattern(<prefix>[, <stop>[, <flags>]])
// -> <pattern>
//
// .buildArgsPattern(<prefix>[, <stop>[, false]])
// -> <string>
//
buildArgsPattern: function(prefix='elem', stop='', regexp='smig'){
var pattern = this.MACRO_ARGS
.replace(/PREFIX/g, prefix)
.replace(/STOP/g, stop)
return regexp ?
new RegExp(pattern, regexp)
: pattern },
//
// needs:
// MACROS
// INLINE_ARGS
// UNNAMED_ARGS
// ARGS
//
// XXX BUG?: this does not consume closing ')'...
// `A @(aaa @(bbb)) B`
// -> ['A', '@(aaa', '@(bbb', ')) B'] (simplified)
// This works correctly:
// `A @(aaa "@(bbb)") B`
MACRO: '('+([
// @macro(arg ..)
'\\\\?@(?<nameInline>MACROS)\\((?<argsInline>INLINE_ARGS)\\)',
// @(arg ..)
'\\\\?@\\((?<argsUnnamed>UNNAMED_ARGS)\\)',
// <macro ..> | <macro ../>
'<\\s*(?<nameOpen>MACROS)(?<argsOpen>\\sARGS)?\\s*/?>',
// </macro>
'</\\s*(?<nameClose>MACROS)\\s*>',
].join('|'))+')',
MACRO_PATTERN: undefined,
MACRO_PATTERN_GROUPS: undefined,
//
// .buildMacroPattern(<macros>[, <flags>])
// -> <pattern>
//
// .buildMacroPattern(<macros>[, false])
// -> <string>
//
buildMacroPattern: function(macros=['MACROS'], regexp='smig'){
var pattern = this.MACRO
.replace(/MACROS/g,
macros
.filter(function(m){
return m.length > 0 })
.join('|'))
.replace(/INLINE_ARGS/g,
this.buildArgsPattern('inline', ')', false) +'*')
.replace(/UNNAMED_ARGS/g,
this.buildArgsPattern('unnamed', ')', false) +'*')
.replace(/ARGS/g,
this.buildArgsPattern('elem', '\\/>', false) +'*')
return regexp ?
new RegExp(pattern, regexp)
: pattern },
countMacroPatternGroups: function(){
// NOTE: the -2 here is to compensate for the leading and trailing ""'s...
return '<MACROS>'.split(this.buildMacroPattern()).length - 2 },
// XXX should this be closer to .stripComments(..)
// XXX do we need basic inline and block commets a-la lisp???
COMMENT_PATTERN: RegExp('('+[
// <!--[pwiki[ .. ]]-->
'<!--\\[pwiki\\[(?<uncomment>.*?)\\]\\]-->',
// <pwiki-comment> .. </pwiki-comment>
'<\\s*pwiki-comment[^>]*>.*?<\\/\\s*pwiki-comment\\s*>',
// <pwiki-comment .. />
'<\\s*pwiki-comment[^\\/>]*\\/>',
// html comments...
'<!--.*?-->',
].join('|') +')', 'smig'),
// helpers...
//
// Spec format:
// [<orderd>, ... [<keyword>, ...]]
//
// Keyword arguments if given without a value are true by default,
// explicitly setting a keyword argument to 'true' or 'yes' will set
// it to true, explicitly setting to 'false' or 'no' will set it to
// false, any other value will be set as-is...
//
// NOTE: the input to this is formatted by .lex(..)
// NOTE: arg pre-parsing is dome by .lex(..) but at that stage we do not
// yet touch the actual macros (we need them to get the .arg_spec)
// so the actual parsing is done in .expand(..)
parseArgs: function(spec, args){
// spec...
var order = spec.slice()
var bools = new Set(
order[order.length-1] instanceof Array ?
order.pop()
: [])
order = order
.filter(function(k){
return !(k in args) })
var res = {}
var pos = Object.entries(args)
// stage 1: populate res with explicit data and place the rest in pos...
.reduce(function(pos, [key, value]){
;/^[0-9]+$/.test(key) ?
(bools.has(value) ?
// bool...
(res[value] = true)
// positional...
: (pos[key*1] = value))
// keyword/bool default values...
: bools.has(key) ?
(res[key] =
// value escaping...
value[0] == '\\' ?
value.slice(1)
: (value == 'true' || value == 'yes') ?
true
: (value == 'false' || value == 'no') ?
false
: value)
// keyword...
: (res[key] = value)
return pos }, [])
// stage 2: populate implicit values from pos...
.forEach(function(e, i){
order.length == 0 ?
(res[e] = true)
: (res[order.shift()] = e) })
return res },
// NOTE: this unifies the body, body argument and text argument (in
// order of priority) and passes the value in the body macro
// handler argument.
// XXX should a macro be run in the context of the page or the parser???
callMacro: function(page, macro, args, body, state, ...rest){
do {
macro = this.macros[macro]
} while(typeof(macro) == 'string')
var args =
this.parseArgs(
macro.arg_spec
?? [],
args)
body = body == '' ?
undefined
: body
if(args.body
|| args.text
|| body){
body =
args.body =
args.text =
body
?? args.body
?? args.text }
return macro.call(this, page, args, body, state, ...rest) },
// place join block between block elements...
joinBlocks: function(page, blocks, join, state){
var that = this
if(typeof(blocks) == 'string'
|| join == null){
return blocks }
// we do not need to rebuild the ast for each use...
// XXX this can break things -- need to store the parse stage
// in the structure so as to determine where we left off...
// ...the problem is that we can't tell the difference
// between a parsed and expanded stages -- one way, re-running
// a stage is not an issue but the other way, skipping can
// break...
//join = this.ast(page, join, state)
return blocks
.map(function(block, i, l){
return [
block,
...(i < l.length-1 ?
that.expand(page, join, state)
: []),
] })
.flat() },
normalizeFilters: function(filters){
var skip = new Set()
return filters
.flat()
.tailUnique()
.filter(function(filter){
filter[0] == '-'
&& skip.add(filter.slice(1))
return filter[0] != '-' })
.filter(function(filter){
return !skip.has(filter) })},
applyFilters: function(filters, str, state={}){
var that = this
filters = this.normalizeFilters(filters)
.filter(function(f){
return f in (that.filters ?? {})})
var handle = function(str){
// skip non-basic data...
if(str == null
|| typeof(str) == 'object'
|| typeof(str) == 'function'){
return str }
return filters
.reduce(function(res, filter){
return that.filters[filter].call(that, str, state) }, str) }
return str instanceof Array ?
str.map(handle)
: handle(str) },
// Strip comments...
//
stripComments: function(str){
return str
.replace(this.COMMENT_PATTERN,
function(...a){
return a.pop().uncomment
|| '' }) },
// Lexically split the string (generator)...
//
// <item> ::=
// <string>
// | {
// name: <string>,
// type: 'inline'
// | 'element'
// | 'opening'
// | 'closing',
// args: {
// <index>: <value>,
// <key>: <value>,
//
// ...
//
// // special case: .body argument's value is treated in
// // the same way as block body -- it is parsed.
// body: <ast>,
// }
// match: <string>,
// }
//
//
// NOTE: this internally uses .macros' keys to generate the
// lexing pattern.
lex: function*(str){
str = typeof(str) != 'string' ?
str+''
: str
// NOTE: we are doing a separate pass for comments to completely
// decouple them from the base macro syntax, making them fully
// transparent...
str = this.stripComments(str)
var macro_pattern = this.MACRO_PATTERN
?? this.buildMacroPattern(Object.deepKeys(this.macros))
var macro_pattern_groups = this.MACRO_PATTERN_GROUPS
?? this.countMacroPatternGroups()
var macro_args_pattern = this.MACRO_ARGS_PATTERN
?? this.buildArgsPattern()
var lst = str.split(macro_pattern)
var macro = false
while(lst.length > 0){
if(macro){
var match = lst.splice(0, macro_pattern_groups)[0]
// NOTE: we essentially are parsing the detected macro a
// second time here, this gives us access to named groups
// avoiding maintaining match indexes with the .split(..)
// output...
var cur = [...match.matchAll(macro_pattern)][0].groups
// special case: escaped inline macro -> keep as text...
if(match.startsWith('\\@')){
yield match
macro = false
continue }
// args...
var args = {}
var i = -1
for(var {groups}
of (cur.argsInline
?? cur.argsUnnamed
?? cur.argsOpen
?? '')
.matchAll(macro_args_pattern)){
i++
args[groups.elemArgName
?? groups.inlineArgName
?? groups.unnamedArgName
?? i] =
(groups.elemSingleQuotedValue
?? groups.inlineSingleQuotedValue
?? groups.unnamedSingleQuotedValue
?? groups.elemDoubleQuotedValue
?? groups.inlineDoubleQuotedValue
?? groups.unnamedDoubleQuotedValue
?? groups.elemValue
?? groups.inlineValue
?? groups.unnamedValue
?? groups.elemSingleQuotedArg
?? groups.inlineSingleQuotedArg
?? groups.unnamedSingleQuotedArg
?? groups.elemDoubleQuotedArg
?? groups.inlineDoubleQuotedArg
?? groups.unnamedDoubleQuotedArg
?? groups.elemArg
?? groups.inlineArg
?? groups.unnamedArg)
.replace(/\\(["'])/g, '$1') }
// macro-spec...
yield {
name: (cur.nameInline
?? cur.nameOpen
?? cur.nameClose
?? '')
.toLowerCase(),
type: match[0] == '@' ?
'inline'
: match[1] == '/' ?
'closing'
: match[match.length-2] == '/' ?
'element'
: 'opening',
args,
match,
}
macro = false
// normal text...
} else {
var str = lst.shift()
// skip empty strings from output...
if(str != ''){
yield str }
macro = true } } },
// NOTE: so as to avod cluterring the main parser flow the macros are
// defined separtly below...
macros: undefined,
// Group block elements (generator)...
//
// <item> ::=
// <string>
// | {
// type: 'inline'
// | 'element'
// | 'block',
// body: [
// <item>,
// ...
// ],
//
// // rest of items are the same as for lex(..)
// ...
// }
//
// Special arguments:
// .args.body | .args.text
// - if .body is given both arges are ignored and dropped
// - if .body is empty and one of the args is present it's
// content will be set as .body and grouped while the rest
// is dropped
// - priority order:
// .body -> .args.body -> .args.text
//
// NOTE: this internaly uses .macros to check for propper nesting
group: function*(lex, to=false, context){
lex = typeof(lex) != 'object' ?
this.lex(lex)
: lex
var quoting = to
&& !!this.macros[to].quoting
&& []
// NOTE: we are not using for .. of .. here as it depletes the
// generator even if the end is not reached...
while(true){
var {value, done} = lex.next()
// check if unclosed blocks remaining...
if(done){
if(to){
throw new Error(
'Premature end of input: Expected </'+ to +'>') }
return }
// special case: quoting -> collect text...
// NOTE: we do not care about nesting here...
if(quoting !== false){
if(value.name == to
&& value.type == 'closing'){
yield quoting.join('')
return
} else {
quoting.push(
typeof(value) == 'string' ?
value
: value.match ) }
continue }
// assert nesting rules...
// NOTE: we only check for direct nesting...
if(this.macros[value.name] instanceof Array
// stray nesting...
&& (context
&& !this.macros[value.name].includes(context))
// stray nesting/closing...
&& !this.macros[value.name].includes(to)
// do not complain about closing nestable tags...
&& !(value.name == to
&& value.type == 'closing') ){
throw new Error(
'Unexpected <'+ value.name +'> macro'
+(to ?
' in <'+to+'>'
: '')) }
// open block...
if(value.type == 'opening'){
//value.body = [...this.group(lex, value.name)]
value.body = [...this.group(lex, value.name, value)]
value.type = 'block'
// unify .body, .args.body and .args.text into .body...
// (first non-empty takes precedance, the rest are removed)
if(value.body.length == 0
&& (value.args.body
?? value.args.text)){
value.body =
[...this.group(
value.args.body
?? value.args.text,
false,
value.name)] }
delete value.args.body
delete value.args.text
// close block...
} else if(value.type == 'closing'){
if(value.name != to){
throw new Error('Unexpected </'+ value.name +'>') }
// NOTE: we are intentionally not yielding the value here...
// ...this supports the above scan use-case.
return }
// normal value...
yield value } },
// Generate ast...
//
// NOTE: this is a convenience wrapper of .group(..), for more docs
// see it...
// NOTE: the output of this can be safely cached, it does not depend
// on anything external and as long as the code stays the same
// this will not change.
ast: function(...args){
return [...this.group(...args)] },
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Active parsing...
// Expand macros (stage I)...
//
// .expand(<page>, <ast>[, <state>])
// -> <ast>
//
//
// <ast> ::= [ <item>, .. ]
// <item> ::=
// {
// <group-data>
// value: ...,
// }
// | <string>
//
// NOTE: the returned structure is re-expandable.
//
//
// <state> ::= {
// // wait for last non-isolated...
// waitNested: <promise> | null,
//
// // wait for last isolated...
// waitAll: <promise> | null,
//
// // wait for all...
// // NOTE: this is set just before .expand(..) returns and is
// // not available during the expansion process.
// wait: <promise> | null,
//
// ...
// }
//
// .expand(..) will call all macros encountered in AST, in order of
// occurance and will place their return values in AST.
// .expand(..) always returns sync.
//
// Macros can run either sync or return a promise and run async.
// Macros can synchronize by awaiting on local state.waitNested or
// state.waitNested they receive in state.
//
// If all macros are sync none of .waitAll, .waitNested or .wait are
// created.
//
// Promises:
// .waitNested
// Waits for the last non-isolated async macro, skipping
// waiting for isolated macros.
// .waitAll
// Waits for the last async macro.
// .wait
// Waits for the full AST to resolve (i.e. each promise in
// the AST is resolved).
//
//
// NOTE: this is always sync, but some of the items in the returned
// array may be promises.
// NOTE: each macro call will receive a "local" state cotaining
// specific to it .waitNested, .waitAll (not affexted by
// subsequent expansion), and references to .parent and .root
// state.
// NOTE: macros should never await on .wait as this will create a
// deadlock, use the local .waitNested and/or .waitAll instead.
// .wait is intended for client code, patser sequencing, and
// extensions.
// NOTE: .waitAll and .waitNested are "live", each updated for every
// promise returned while expanding, while .wait is global and
// will resolve only when all other promises are resolved.
// NOTE: macro-local state is forgotten as soon as the macro returns,
// thus if a macro wants to store state it should either store
// it in state.parent or state.root.
//
//
// XXX Handle errors...
expand: function(page, ast, state={}, nested_handlers={}){
var that = this
ast = typeof(ast) != 'object' ?
this.group(ast)
: ast instanceof types.Generator ?
ast
: ast.iter()
var cleanup = function(state, wait, val){
if(state[wait] === val){
if(!('root' in state)
|| state.root === state){
delete state[wait]
} else {
state[wait] = undefined } } }
var elems = []
for(let elem of ast){
// text block...
if(typeof(elem) != 'object'){
elems.push(elem)
continue }
// do not re-expand expanded elements...
if('value' in elem
&& !state.forceReExpand){
elems.push(serialize.partialDeepCopy(elem))
continue }
// cleanup...
elem = serialize.partialDeepCopy(elem)
delete elem.error
delete elem.value
//delete elem.resolving
var {name, args, body} = elem
// nested macro...
if(that.macros[name] instanceof Array){
// call handler...
if(nested_handlers[name]){
elems.push(
nested_handlers[name].call(that, elem))
// skip...
} else {
elems.push(elem) }
continue }
// drop non-macros/aliases...
if(typeof(that.macros[name]) != 'function'
&& typeof(that.macros[name]) != 'string'){
continue }
// expand down...
body
&& !that.macros[name].lazy
&& (body = this.expand(page, body, state, nested_handlers))
// call macro...
// NOTE: here we separate local macro state and global/parent
// state via the prototpype...
// This is mainly needed to sparate promises, since the
// inicial execution is done on order of occurenca while
// each macro can wait async for an arbitrary amount of
// time it only should care about what was promised
// before it neglecting what came after.
// NOTE: this also enables nested namespaces but the current
// macros do not use this.
var res =
that.callMacro(page, name, args, body, {
// global/parent state...
__proto__: state,
root: state.root ?? state,
parent: state,
// local state...
waitAll: state.waitAll,
waitNested: state.waitNested,
})
// async...
if(res instanceof Promise){
elem.resolving = res
let all, nested
all = state.waitAll =
Promise.all([state.waitAll, res])
if(!res.isolated){
nested = state.waitNested =
Promise.all([state.waitNested, res]) }
res.then(
function(value){
cleanup(state, 'waitAll', all)
cleanup(state, 'waitNested', nested)
delete elem.resolving
elem.value = value
return value },
function(err){
state.errors ??= []
state.errors.push(elem)
delete elem.resolving
elem.error = err })
// sync...
} else {
elem.value = res }
elems.push(elem) }
// cleanup...
var wait
var waitAll = state.waitAll
state.waitAll
&& state.waitAll
.then(function(){
cleanup(state, 'waitAll', waitAll) })
&& (wait = state.wait = waitAll
.then(function(){
cleanup(state, 'wait', wait)
return elems }))
var waitNested = state.waitNested
state.waitNested
&& state.waitNested
.then(function(){
cleanup(state, 'waitNested', waitNested) })
return elems },
// Resolve macros (stage II)...
//
// <ast> ::= [ <item>, ... ]
// <item> ::=
// <basic-value>
// | Promise(<value>)
// | <elem>
//
// <elem> is returned if its value is not resolved yet.
//
//
// NOTE: to fully resolve the ast this may need to be called several
// times...
//
resolve: function(page, ast, state={}, nested_handlers={}){
var that = this
ast = typeof(ast) != 'object' ?
this.expand(page, ast, state, nested_handlers)
: ast instanceof types.Generator ?
ast
: ast.iter()
var unresolved = []
// merge resolved elements into the last item of elems...
var elems = []
for(var elem of ast){
// nesting...
while(elem && elem.value){
// exec stage II macros...
if(typeof(elem.value) == 'function'){
let e = elem
let func = e.value
elem = Promise.awaitOrRun(
// if not everything is resolved, delay the stage II
// callbacks till .wait is done...
// NOTE: this depends on that JS is single thread
// and we can't have state.wait resolve in
// the middle of this loop.
state.wait,
function(){
return func(state) })
break }
elem = elem.value }
if(elem == null){
continue }
// atomic values...
if(typeof(elem) != 'object'){
elems.push(elem)
continue }
// value is resolved but "empty" -> skip...
if('value' in elem
&& (elem.value == null
|| elem.value == '')){
continue }
// expand ast...
if(elem instanceof Array){
elems.push(...that.resolve(page, elem, state))
continue }
// nested macro with no value set -- skip...
if(that.macros[elem.name] instanceof Array){
continue }
unresolved
.push(elem.resolving instanceof Promise ?
elem.resolving
: elem)
// NOTE: we do not need to expand .body attributes as these
// are the responsibility of the respective macros...
elems.push(elem) }
// global .wait...
if(unresolved.length > 0){
var resolving =
state.wait =
Promise.all([state.wait, ...unresolved])
// cleanup...
.then(function(){
if(state.wait === resolving){
delete state.wait } }) }
return elems },
isResolved: function(ast){
if(!(ast instanceof Array)){
return false }
for(var e of ast){
if(typeof(e) == 'object'){
return false } }
return true },
filters: undefined,
// Merge and apply global filters (stage III)...
//
// - ensure the ast is fully resolved
// resolve and re-resolve untill all done
// - apply stage III pre handlers
// - apply global filters
// - apply stage III post handlers
//
// XXX do we report recursion errors here???
finalize: function(page, ast, state={}, nested_handlers={}, wait='wait'){
var that = this
var stage3 = function(ast){
return ast
.map(function(e){
return typeof(e) == 'function' ?
e.call(that, state)
: e })
.flat() }
// NOTE: we are not guarding against recursion here as there is no
// point of manually doing what JS does anyway, unless there
// is an explicit reason to do so (e.g. report error).
var resolve = function(ast){
return Promise.awaitOrRun(
state.hasOwnProperty('wait') ?
state.wait
: null,
function(){
//delete state.unresolved
// re-resolve...
ast = that.resolve(page, ast, state, nested_handlers)
// NOTE: this is essentially running in the same frame
// as .resolve(..) above so there should not be
// any races to delete .unresolved...
//return state.unresolved ?
//return state.hasOwnProperty('wait') ?
return !that.isResolved(ast) ?
resolve(ast)
: ast }) }
ast = this.resolve(page, ast, state, nested_handlers)
return Promise.awaitOrRun(
// in case ast contains value promises, expand them...
Promise
.iter(ast)
.sync(),
// wait...
(wait && state.hasOwnProperty(wait)) ?
state[wait]
: null,
function(ast){
// NOTE: in an async world where any promised macro can
// call .exec(..) / .execNested(..) we can't trust
// the lack of .unresolved in state...
return Promise.awaitOrRun(
that.isResolved(ast) ?
ast
: resolve(ast),
function(ast){
return (
// stage III post...
stage3(
that.applyFilters(
state.filters ?? [],
// stage III pre...
stage3( ast ),
state))) }) }) },
exec: function(page, ast, state={}, nested_handlers={}, wait='wait'){
return Promise.awaitOrRun(
this.finalize(...arguments),
function(res){
return res.join('') }) },
execNested: function(page, ast, state={}, nested_handlers={}){
return this.exec(page, ast, state, nested_handlers, 'waitNested') },
// XXX render api...
// XXX how should this play with filters???
// ...should filters be client-side only??
render: function*(page, ast, callback, state={}){
// XXX
},
}
var Macro =
module.Macro =
function(spec, func){
var args = [...arguments]
// function...
func = args.pop()
// arg sepc...
;(args.length > 0
&& args[args.length-1] instanceof Array)
&& (func.arg_spec = args.pop())
return func }
// wait for .waitNested
var isolated =
module.isolated =
function(macro){
macro.isolated = true
return macro }
// body: ast
var lazy =
module.lazy =
function(macro){
macro.lazy = true
return macro }
// body: as text
var quoting =
module.quoting =
function(macro){
macro.quoting = true
return macro }
// XXX RENAME...
// ...this is more of an expander/executer...
// ...might be a good idea to also do a check without executing...
var macros =
module.macros = {
__proto__: BaseMacros,
// String to be substetuted for a recursive include...
//
// NOTE: if set to null include will throw an error if recursion is
// detected.
RECURSION_STRING: '',
// Filters...
//
// NOE: filters can't be named 'body', 'text', or 'clear' -- they
// will be shadowed by @filter(..)'s keyword arguments...
filters: {},
// Macros...
//
// <macro>(<args>, <body>, <state>){ .. }
// -> undefined
// -> <text>
// -> <array>
// -> <iterator> XXX ???
// -> <promise>
// -> <func>(<state>)
// -> ...
//
macros: {
// XXX DEBUG this is not needed for production (???) move to tests...
echo: function(page, args, body, state){
console.log(['----', ...Object.keys(args), body ?? ''].join(' ').gray)
return Promise.awaitOrRun(
state.waitNested,
function(){
console.log(' --', ...Object.keys(args), body ?? '')
return Object.keys(args) }) },
//*/
// Filter...
//
// @filter(<filter-spec>)
// <filter <filter-spec>/>
//
// <filter <filter-spec>>
// ...
// </filter>
//
// <filter-spec> ::=
// <filter> <filter-spec>
// | -<filter> <filter-spec>
//
//
// XXX should local filter include the global filters (current)
// or exclude them by default???
filter: Macro(
[['clear']],
function(page, args, body, state){
var that = this
// get filters...
var clear = args.clear
delete args.text
delete args.body
delete args.clear
var filters = Object.keys(args)
// local filter...
if(body){
// stage II
// NOTE: stage I is handled by .expand(..) as we are not
// lazy(..)'ied...
return function(state){
body = that.resolve(page, body, state)
// stage III
return function(state){
return Promise.awaitOrRun(
// apply the filters...
that.finalize(
page,
body,
{
__proto__: state,
filters: clear ?
filters
: [...filters, ...state.filters ?? []],
}),
function(body){
// stage III post...
// NOTE: we are protecting the result from
// global filters...
return function(){
return body } }) } }
// global filter...
} else if(filters.length > 0){
// NOTE: we are pushing this past the expand stage so as to
// avoid messing up all the small .exec*(..) calls used
// to handle macro attributes asn the like...
// ...but we need to do this before stage III so as not
// to race with applying local filters...
return function(state){
(state.filters = (state.filters ??= []))
.push(...filters) } } }),
// Args...
//
// @(<name>[ <else>][ local])
// @(name=<name>[ else=<value>][ local])
//
// @arg(<name>[ <else>][ local])
// @arg(name=<name>[ else=<value>][ local])
//
// <arg <name>[ <else>][ local]/>
// <arg name=<name>[ else=<value>][ local]/>
//
// Resolution order:
// - local
// - .renderer
// - .root
//
// NOTE: else (default) value is parsed when accessed...
'': 'arg',
arg: Macro(
['name', 'else', ['local']],
function(page, args, _, state){
var v = (page.args ?? {})[args.name]
|| (!args.local
&& (page.renderer
&& page.renderer.args[args.name])
|| (page.root
&& page.root.args[args.name]))
v = v === true ?
args.name
: v
return v
|| (args['else']
&& this.expand(this, args['else'], state)) }),
args: function(page){
return pwpath.obj2args(page.args) },
// XXX EXPERIMENTAL...
//
// NOTE: var value is parsed only on assignment and not on dereferencing...
//
// XXX should alpha/Alpha be 0 (current) or 1 based???
// XXX do we need a default attr???
// ...i.e. if not defined set to ..
// XXX INC_DEC do we need inc/dec and parent???
'var': Macro(
['name', 'text',
// XXX INC_DEC
['shown', 'hidden',
'parent',
'inc', 'dec',
'alpha', 'Alpha', 'roman', 'Roman']],
/*/
['shown', 'hidden']],
//*/
function(page, args, body, state){
var that = this
var name = args.name
if(!name){
return '' }
// XXX LOCAL_STATE
var vars = state.parent.vars ??= {}
//var vars = state.root.vars ??= {}
return Promise.awaitOrRun(
this.execNested(page, name, state),
function(name){
// XXX INC_DEC
var inc = args.inc
var dec = args.dec
//*/
var text = args.text
?? body
// NOTE: .hidden has priority...
var show =
('hidden' in args ?
!args.hidden
: undefined)
?? args.shown
// XXX INC_DEC
if(args.parent && name in vars){
while(!vars.hasOwnProperty(name)
&& vars.__proto__ !== Object.prototype){
vars = vars.__proto__ } }
var handleFormat = function(value){
// roman number...
if(args.roman || args.Roman){
var n = parseInt(value)
return isNaN(n) ?
''
: args.Roman ?
n.toRoman()
: n.toRoman().toLowerCase() }
// alpha number...
if(args.alpha || args.Alpha){
var n = parseInt(value)
return isNaN(n) ?
''
: args.Alpha ?
n.toAlpha().toUpperCase()
: n.toAlpha() }
return value }
// inc/dec...
if(inc || dec){
if(!(name in vars)
|| isNaN(parseInt(vars[name]))){
return '' }
var cur = parseInt(vars[name])
cur +=
inc === true ?
1
: !inc ?
0
: parseInt(inc)
cur -=
dec === true ?
1
: !dec ?
0
: parseInt(dec)
vars[name] = cur + ''
// as-is...
return show ?? true ?
handleFormat(vars[name])
: '' }
//*/
// set...
if(text){
return Promise.awaitOrRun(
//state.waitNested,
that.execNested(page, text, state),
function(value){
text = vars[name] = value
return show ?? false ?
text
: '' })
// get...
} else {
return handleFormat(vars[name] ?? '') } }) }),
vars: function(page, args, body, state){
var that = this
var lst = []
for(var [name, value] of Object.entries(args)){
lst.push(
this.execNested(page, name, state),
this.execNested(page, value, state)) }
var vars = state.vars ??= {}
return Promise.awaitOrRun(
state.waitNested,
...lst,
function(_, ...lst){
for(var i=0; i < lst.length; i+=2){
vars[lst[i]] = lst[i+1] }
return '' }) },
// Slot...
//
// <slot name=<name>/>
//
// <slot name=<name> text=<text>/>
//
// <slot name=<name>>
// ...
// </slot>
//
// Wrap previous value of slot
// <slot name=<name>>
// ...
// <content/>
// ...
// </slot>
//
// Force show a slot...
// <slot shown ... />
//
// Force hide a slot...
// <slot hidden ... />
//
// NOTE: slots are expanded in order of occurance not in order
// of topology, thus nested can override slots they are
// nested in, e.g.:
// '<slot moo>[[ <slot moo "new value"> ]]</slot>'
// will resolve to:
// 'new value'
// NOTE: by default only the first slot with <name> is visible,
// all other slots with <name> will replace its content, unless
// explicit shown/hidden arguments are given.
// NOTE: hidden has precedence over shown if both are given.
//
// XXX can there be a situation where not all <content/> elements
// are cleared???
// XXX revise the use of hidden/shown use mechanic and if it's
// needed...
slot: Macro(
['name', 'text', ['shown', 'hidden']],
// NOTE: this is needed to be able to control the sequence of
// overrides in nesteed slots...
lazy(
function(page, args, body, state){
var that = this
var name = args.name
// XXX LOCAL_STATE
var slots = state.parent.slots ??= {}
//var slots = state.root.slots ??= {}
return Promise.awaitOrRun(
this.execNested(page, name, state),
function(name){
//var hidden = name in slots
var hidden =
// 'hidden' has priority...
args.hidden
// explicitly show... ()
|| (args.shown ?
false
// show first instance...
: name in slots)
// set slot value...
//
var slot = slots[name] ??= []
// NOTE: the placeholder is a stand-in for our
// current value that is still to be generated...
var placeholder = [...slot]
slot.splice(0, slot.length, placeholder)
// expand body...
body = body ?
// XXX can we pass content handler here???
that.expand(page, body ?? [], state, {})
: body
// if slot not overriden, write our value...
if(slot[0] === placeholder){
slot.splice(0, slot.length,
...(body != null ?
[body]
: placeholder))
// placeholder -> <content/>
body = placeholder }
// <content/> -- handle slot's original value...
slot[0] =
body.flat().length > 0
&& slot[0] instanceof Array ?
slot[0]
.map(function(e){
if(e && e.name == 'content'){
return body }
return e })
: slot[0]
return hidden ?
''
: Object.assign(
// stage II: place the latest slot value...
function(st){
return ((st ?? state).slots ?? {})[name] },
{slot: name}) }) })),
// XXX do not like this name...
content: ['slot'],
//
// @include(<path>)
//
// @include(<path> isolated recursive=<text>)
// @include(src=<path> isolated recursive=<text>)
//
// <include src=<path> .. >
// ...
// <concent/>
// ...
// </include>
//
// NOTE: if body is not empty and <content/> is not present, the
// included page will not be placed.
// NOTE: body is expanded in the context of the included page
// NOTE: there can be two ways of recursion in pWiki:
// - flat recursion
// /A -> /A -> /A -> ..
// - nested recursion
// /A -> /A/A -> /A/A/A -> ..
// Both can be either direct (type I) or indirect (type II).
// The former is trivial to check for while the later is
// not quite so, as we can have different contexts at
// different paths that would lead to different resulting
// renders.
// At the moment nested recursion is checked in a fast but
// not 100% correct manner focusing on path depth and ignoring
// the context, this potentially can lead to false positives.
//
// XXX FILTER do we skip includes from outer filters???
// XXX need a way to make encode option transparent...
// XXX RECURSIVE do we set state.recursive or keep it local???
// ...i.e. should it be inherited??
// XXX do we want to load a specific slot/block???
// XXX page API used:
// .resolvePathVars(path)
// .get(path)
// is this a promise/value, iterable promise a generator
// an async generator, ... or a combination/stack of the above???
include: Macro(
['src', 'recursive', 'join',
['s', 'strict', 'isolated']],
lazy(
function(page, args, body, state, handler){
var that = this
// XXX RECURSIVE de we inherit this???
var recursive =
state.recursive =
args.recursive
?? state.recursive
?? this.RECURSION_STRING
var base = page.basepath
return Promise.awaitOrRun(
this.execNested(page, args.src, state),
function(src){
//src = page.resolvePathVars(src)
// XXX is this a good place for this -- maybe someplace more global???
// XXX is there an inline way to do this???
var isRecursive = function(page, tree, path=[]){
if(!(page instanceof Array)){
if(path.includes(page)){
return path }
return page in tree
&& isRecursive(Object.keys(tree[page]), tree, [...path, page]) }
for(var p of page){
if(p = isRecursive(p, tree, path)){
return p } }
return false }
// content handler...
handler ??=
function(page, body, path, text, state){
// XXX check cache???
// XXX do we include in page or page.get(src)'s context????
page = page.get(path)
var nested
return args.isolated ?
//this.resolve(
this.finalize(
page,
text,
nested = args.isolated == 'partial' ?
serialize.partialDeepCopy(state)
: {})
// XXX FILTER need to localize target page
// filters to it, somehow...
// XXX should this be .finalize(..)???
// .finalize(..) here breaks things...
: this.expand(page, text, state) }
var pageHandler =
function([path, text]){
// recursion...
var included = state.included ??= {}
var cur = included[path] ??= {}
cur[page.path] ??= true
// check...
var p = isRecursive(path, included)
if(p !== false){
if(recursive == null){
throw new Error('Recursion detected:'
+'\n\t'+ [...p, path].join('\n\t -> ')) }
// set error data...
;(state.vars ??= {})['error:recursion'] = path
return that.expand(page, recursive, state) }
// handle nested promises...
return Promise.awaitOrRun(
text,
function(text){
return handler.call(that, page, body, path, text, state) }) }
// get and run things...
return Promise.awaitOrRun(
page.get(src).matched,
page.get(src).raw,
function(paths, texts){
// track pattern matches...
if(paths.length > 1){
;(state.matches ??= {})[page.path +'|'+ src] = paths }
texts =
// XXX how do we handle paths returning non-strings???
// special case: list page...
paths.length == 1
&& texts instanceof Array ?
[texts]
: texts instanceof Array ?
texts
: [texts ?? '']
return Promise.awaitOrRun(
// handle pages...
Promise
.iter(
that.joinBlocks(
page,
Array
.zip(paths, texts)
.map(pageHandler),
args.join,
state))
.flat()
.sync(),
function(pages){
/* XXX cache the final result...
cache[src] = pages
//*/
return pages }) }) }) })),
// NOTE: the main difference between this and @include is that
// this renders the src in the context of current page while
// include is rendered in the context of its page but with
// the same state...
// i.e. for @include(PATH) the paths within the included page
// are resolved relative to PATH while for @source(PATH)
// relative to the page containing the @source(..) statement...
source: Macro(
['src', 'recursive', 'join',
['s', 'strict']],
//['src'],
function(page, args, body, state){
var that = this
return this.macros['include'].call(this,
page, args, body, state,
function(page, body, path, text, state){
return that.expand(page, text, state) }) }),
// Load macro and slot definitions but ignore the page text...
//
// NOTE: this is essentially the same as @source(..) but returns ''.
load: Macro(
['src'],
function(page, args, body, state){
var that = this
return Promise.awaitOrRun(
this.macros['include'].call(this,
page, {src: args.src}, body, state),
function(){
return '' }) }),
//
// @quote(<src>)
//
// <quote src=<src>[ filter="<filter> ..."]/>
//
// <quote text=" .. "[ filter="<filter> ..."]/>
//
// <quote[ filter="<filter> ..."]>
// ..
// </quote>
//
// This has two modes of operation, i.e. the body can be treated
// in two destinct ways:
// - if both src and body are given -- like @include(..) body is
// used as a wrapper for the quoted page
// - if only body is given -- body is inderted as is without
// any processing.
// XXX not sure I like this, this might change in the futore...
// one way to split the two is to split this into two macros,
// but I can't make the split logical/obvious...
//
// NOTE: src ant text arguments are mutually exclusive, src takes
// priority.
// NOTE: the filter argument has the same semantics as the filter
// macro with one exception, when used in quote, the body is
// not expanded...
// NOTE: the filter argument uses the same filters as @filter(..)
//
// XXX might be a good idea to do an auto-filter that would be
// apropriately selected according to format -- md, html, ...
quote: Macro(
['src', 'join', 'filter'],
quoting(
function(page, args, body, state){
var that = this
var filters = (args.filter ?? '')
.split(/\s+/)
.filter(function(s){
return s.length > 0 })
return Promise.awaitOrRun(
args.src
&& this.execNested(page, args.src, state),
function(src){
//src = page.resolvePathVars(src)
var text =
src ?
page.get(src).raw
: body ?
body
: []
return Promise.awaitOrRun(
text,
function(text){
return that.joinBlocks(
page,
that.applyFilters(
filters,
text,
state),
args.join,
state) }) }) })),
/* XXX
// very similar to @filter(..) but will affect @quote(..) filters...
'quote-filter': function(args, body, state){
var filters = state.quote_filters =
state.quote_filters ?? []
filters.splice(filters.length, 0, ...Object.keys(args)) },
//*/
// expand the body in the context of a page...
//
// <macro src=<url>> .. </macro>
//
// <macro name=<name> src=<url> sort=<sort-spec>> .. </macro>
//
// <macro ...> ... </macro>
// <macro ... text=<text>/>
//
// <macro ... else=<text>> ... </macro>
// <macro ...>
// ...
//
//
// <join>
// ...
// </join>
//
// <else>
// ...
// </else>
// </macro>
//
// Macro variables:
// macro:count
// macro:index
//
// NOTE: this handles src count argument internally partially
// overriding <store>.match(..)'s implementation, this is done
// because @macro(..) needs to account for arbitrary nesting
// that <store>.match(..) can not know about...
// XXX should we do the same for offset???
//
// XXX macro variables...
// XXX should macro:index be 0 or 1 (current) based???
// XXX sorting...
// XXX check macro recursion...
macro: Macro(
//['name', 'src', 'sort', 'text', 'join', 'else',
['name', 'src', 'join', 'else',
['strict', 'isolated', 'inheritmacros', 'inheritvars']],
lazy(
function(page, args, body, state){
var that = this
// XXX LOCAL_STATE
var macros = state.parent.macros ??= {}
//var macros = state.root.macros ??= {}
return Promise.awaitOrRun(
this.execNested(page, args.name, state),
function(name){
// set macro...
if(name && body){
macros[name] = body
// get macro...
} else if(name){
body = macros[name] }
// else...
if(args.src
&& !page.get(args.src).exists()){
// <else> .. </else>
for(var elem of body){
if(elem.name == 'else'){
body = elem.body
return that.expand(page.get(args.src), body, state) } }
// args.else...
return args['else'] ?
that.expand(page.get(args.src), args['else'], state)
: [] }
// join macro???
// XXX
return args.src && body ?
// run macro...
that.macros.include.call(that, page, args, body, state,
function(page, body, path, text, state){
return this.expand(page.get(path), body, state) })
: '' }) })),
// nesting rules...
'else': ['macro'],
join: ['macro'],
},
}
/**********************************************************************
* vim:set ts=4 sw=4 nowrap : */ return module })