we need to be able to create trees that act as templates to be filled. This should work on any kind of tree. It would work something like this:
_t_fill_template(T* template, T* items)
where template is a tree with slots represented by a TEMPLATE_SLOT symbol who's surface is the semanticID of the thing that goes in that place, and where items is a list of items to fill in those slots.
and then we also need a process FILL_FROM_TEMPLATE that works at runtime where code that is "template" code can fill portions of it from the template items.
This does raise the question of quoting TEMPLATE_SLOT...
INTERPOLATE_FROM_MATCH and o_resolve should get refactored to use this engine.
zippy
commented
8 years ago
we need to be able to create trees that act as templates to be filled. This should work on any kind of tree. It would work something like this:
_t_fill_template(T* template, T* items)
where template is a tree with slots represented by a TEMPLATE_SLOT symbol who's surface is the semanticID of the thing that goes in that place, and where items is a list of items to fill in those slots.
and then we also need a process FILL_FROM_TEMPLATE that works at runtime where code that is "template" code can fill portions of it from the template items.
This does raise the question of quoting TEMPLATE_SLOT...
INTERPOLATE_FROM_MATCH and o_resolve should get refactored to use this engine.