Deactivate/Publish Tree

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: dev-unsubscribelenya.apache.org
For additional commands, e-mail: dev-helplenya.apache.org

On Mon, 2006-03-27 at 15:42 +0200, Jann Forrer wrote:
> 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?

I have disabled this check in one of our projects, and
everything is
running fine 
I believe if you're using the DefaultSiteTree it should be
safe to turn
off this test.

Josias

> 
> Jann
> 
>
------------------------------------------------------------
---------
> To unsubscribe, e-mail: dev-unsubscribelenya.apache.org
> For additional commands, e-mail: dev-helplenya.apache.org
> 
> 


------------------------------------------------------------
---------
To unsubscribe, e-mail: dev-unsubscribelenya.apache.org
For additional commands, e-mail: dev-helplenya.apache.org

On Mon, 27 Mar 2006, Josias Thöny wrote:

> On Mon, 2006-03-27 at 15:42 +0200, Jann Forrer wrote:
>> 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?
>
> I have disabled this check in one of our projects, and
everything is
> running fine 
> I believe if you're using the DefaultSiteTree it
should be safe to turn
> off this test.
>

Thank for the answer. I did also test it by comment the
respecitve line 
but I was not sure whether that change can lead to some
"unpredictable" 
errors.

Jann
------------------------------------------------------------
---------
To unsubscribe, e-mail: dev-unsubscribelenya.apache.org
For additional commands, e-mail: dev-helplenya.apache.org

Josias Thöny schrieb:
> On Mon, 2006-03-27 at 15:42 +0200, Jann Forrer wrote:
>> 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?
> 
> I have disabled this check in one of our projects, and
everything is
> running fine 
> I believe if you're using the DefaultSiteTree it
should be safe to turn
> off this test.

Yes, that's true. The transitive closure of a directed
acyclic graph
(in our case, the dependency relation) is a strict partial
order.

Maybe it would be more efficient to check for cycles instead
of the
strict partial order conditions.

In any case, the TreeSiteManager could override the check()
method
and do nothing there.

-- Andreas


------------------------------------------------------------
---------
To unsubscribe, e-mail: dev-unsubscribelenya.apache.org
For additional commands, e-mail: dev-helplenya.apache.org