...using a ''special protocol'' to represent iterative data sequences * use an Index-Key with a CSV list of element prefixes * synthesise key-prefixes for each data element * perform lookup with the decorated key first This allows to somehow ''emulate'' nested associations within a single, flat Map. Obviously this is more like a proof-of-concept; actually the Map-databinding is meant to handle the simple cases, where just placeholders are to be substituted. The logic structures are much more relevant when binding to structural data, most notably to the Lumiera _External Tree Description_ format, which is used for model data and inter-layer communication. |
||
|---|---|---|
| .. | ||
| draw | ||
| DIR_INFO | ||
| empty.html | ||
| InterfaceConcept_Varga.mm | ||
| renderengine.html | ||
| thinkPad.ichthyo.mm | ||
| uml | ||
| workflow.mm | ||