Re: Following renames
- From
- David Lang <dlang@digitalinsight.com>
- Date
- Mar 27, 2006, 07:40 UTC
- Message-ID
- <Pine.LNX.4.62.0603262337580.26865@qynat.qvtvafvgr.pbz>
- In-Reply-To
- <e0827k$7tk$1@sea.gmane.org>
On Mon, 27 Mar 2006, Jakub Narebski wrote:
> 2.) Caching the results of similarity algorithm/rename detection tool (also > Paul Jakma post), including remembering false positives and undetected > renames, for efficiency. Calculated automatically parts might be > throw-away.
this sounds like it could easily devolve into a O(n!) situation where you are cacheing how everything is related (or not related) to everything else. Paul was makeing the point that the purpose was to cache the data to eliminate the time needed to calculate it, but if you don't store all the results then you don't know if the result is not relavent, or unknown, so you need to calculate it again.
David Lang
-- There are two ways of constructing a software design. One way is to make it so simple that there are obviously no deficiencies. And the other way is to make it so complicated that there are no obvious deficiencies. -- C.A.R. Hoare