Hi
If I want to deactivate/publish a tree of documents the respective set is checked for a strict partial order. That means it is checked whether it is irreflexive and antisymmetric and transitive. If the tree has many document in it e.g. 200 that check needs quite a lot of time (> 1 min).
I do not have a firm grasp on set theory anymore and I am wondering whether some conditions for a strict partial order are given anyway if i e.g. use a tree like structure (SiteTree), so that i can bypass that check?
Any ideas? Jann --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
