Originally Posted by ixtab
's an improved version of the patch.
This should be considerably faster than the previous version. It now requires only Θ(h) queries of the collections database, where the previous one required O(n). (where h=the height of the "collections tree" rooted at the given collection, and n=the number of leaf nodes of the tree).
It won't get any faster now
Let me know...
This really improved the speed!
To be honest, I don't use this patch as I don't have nested collections. I just pointed it out to check whether it was an impression or not!!
Anyway, thanks again!!!!