Hi Corey, You are right. It is possible, but it increases the amount of work/ time needed for programmatically doing things. eg: inserting/deleting tiddlers. Have a look at "Linked Lists" [1] at Wikipedia. Liked lists are one of the basic things working with collections of data. It is rather technical. But the pictures explain themselfs.
Having a look at [2] Linked_list_operations, you can see, what a programmer has to implement, to insert and delete a "node". If you have parent and grandparent, you don't win anything. It's just more complicated. The basic structure is simple. But dealing with it in a real world application isn't. eg: a programmer needs to face and solve at least the following things: * deal with "node" deleting * deal with inserting a node * create a sort / reordering function * deal with broken lists. eg: someone copy/pastes a tiddler, which deletes the custom fields * deal with programmatic export / import of tiddlers. ** which may leads to orphaned connections ** and may be duplicated connections * reset the whole structure * ... and may be many more. have fun! -m [1] http://en.wikipedia.org/wiki/Linked_lists [2] http://en.wikipedia.org/wiki/Linked_lists#Linked_list_operations -- You received this message because you are subscribed to the Google Groups "TiddlyWiki" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/tiddlywiki?hl=en.
