Hi, I'd like to build a display tree (dtml-tree or SimpleTree) from a catalog searchResults query. Does someone have a hint, where this already has been realized and point me there? Thanks Bories -- Bories v. dem Bussche Duesseldorf - Germany
Bories v. dem Bussche wrote at 2003-11-29 08:58 +0100:
I'd like to build a display tree (dtml-tree or SimpleTree) from a catalog searchResults query. Does someone have a hint, where this already has been realized and point me there?
Read the "dtml-tree" documentation. There is a HowTo about "Advanced dtml-tree" use. -- Dieter
Dieter Maurer wrote:
Bories v. dem Bussche wrote at 2003-11-29 08:58 +0100:
I'd like to build a display tree (dtml-tree or SimpleTree) from a catalog searchResults query. Does someone have a hint, where this already has been realized and point me there?
Read the "dtml-tree" documentation. There is a HowTo about "Advanced dtml-tree" use.
Thanks, but that is not exactly what I am trying to figure out. Maybe my explanation of what I am looking for, was to short. Sorry for that. From a catalog search I retrieve a list of objects, which all have a method that I can use for accessing the branches. My problem is how to properly construct a root element, that stays accessible while a user expands and collapses the branches of the tree. I suppose I have to wrap the list, resulting from the catalog query, into a temporary, session based object. This wrapper should have the same child access method, as the objects resulting from the catalog query. It should then be possible, to construct a tree with the temporary, wrapped list as root object. Is there an easier way, or can anyone point me to an example, where this had been realized? Thanks Bories -- Bories v. dem Bussche Duesseldorf - Germany
Bories v. dem Bussche wrote at 2003-12-1 21:50 +0100:
... From a catalog search I retrieve a list of objects, which all have a method that I can use for accessing the branches. My problem is how to properly construct a root element, that stays accessible while a user expands and collapses the branches of the tree.
Each "expand/collapse" is a separate request. The standard way is to redetermine the hierarchical structure (as far as necessary). In your case, this would mean, the catalog search is performed in each request.
I suppose I have to wrap the list, resulting from the catalog query, into a temporary, session based object. This wrapper should have the same child access method, as the objects resulting from the catalog query.
That may be a second step optimization. First implement your task in a straight forward way. When this is too slow, think about optimizations... -- Dieter
participants (2)
-
Bories v. dem Bussche -
Dieter Maurer