kfogel@collab.net wrote:
>Branko Čibej <brane@xbc.nu> writes:
>
>
>>You can modify the sorted list in O(log N) time, but you can't cache
>>the result. So every time some function reads the entries, it has to
>>spend O(N*log N) time to sort the list before doing a traversal. This
>>is not quadratic, but you have to multiply it by the number of times
>>you have to repeat the sort.
>>
>>
>
>Why can't you cache it and just invalidate it whenever you invalidate
>the thing it's based on?
>
You can't cache it because you don't know when it's modified because the
hash table is accessible through a public API.
-- Brane
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@subversion.tigris.org
For additional commands, e-mail: dev-help@subversion.tigris.org
Received on Wed Feb 23 01:26:23 2005