Create a transclusion tiddler (a processing engine) which takes a tiddler name as its parameter and reads through each line in the specified tiddler to determine which lines to process (render as output) and which lines to ignore. For the processable lines (i.e. numbered-list items) do one of the following: *if its not a tiddler name, output as is *if its a tiddler name, recurse, i.e. call the renderer tiddler with the tiddler name as the parameter Since the output will be a single tiddler, you should achieve the numbering sequence you want. Because it can handle nested tiddlers, there should be no reasonable limit to how large the list could grow to. But be careful about creating an infinite loop!
That would be version 1. For version 2 you could pass a tag instead of a tiddler name to "seed the engine". All tiddlers with the specified tag would be processed (the order of which will require v2.5). For version 3 you could support processing line items other than numbered lists, e.g. bullet lists, URLs. This version would require more support for output formatting. Craig -- You received this message because you are subscribed to the Google Groups "TiddlyWiki" group. To post to this group, send email to tiddlyw...@googlegroups.com. To unsubscribe from this group, send email to tiddlywiki+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/tiddlywiki?hl=en.
