Ruud Prein wrote: > hi, > > Sound interesting? So nested relatednodes can be replaced by the tree tag?
That, currently, is indeed possible. But the tree-tag is conceptually quite hard, and I think no-one will intuitively understand it. Using nested mm:relatednodes however, seems quite straightforward, and I think it can be understood easily. Currently it is implemented also quite straightforwardly, which means that on deep nests, this would leed to very many queries. Tree tag would always only issue that many queries as the tree is deep. Tree-tag is more generic, because you don't need to specify every level explicitely. The code of TreeTag is based on 'TreeList', which does the real work. The idea is to make mm:relatednodes detect that is used in another query, and then also use TreeList. Then the number of queries would also be limited to the maximal depth (in stead of, worst case, the number of nodes). Actually, I consider this change one of the last things for the taglib project. Michiel -- Michiel Meeuwissen mihxil' Mediacentrum 140 H'sum [] () +31 (0)35 6772979 nl_NL eo_XX en_US
