Thanks a lot for your reply.
Just to be sure I understand well your sentence:
Quote:
Originally posted by bernard
It would also be interesting to check how valuable such improvement would be: maybe you could measure this extra memory allocation cost with your example, and compare it with the time it takes to write to disk?
|
Do you mean that if the ratio of the time consumed to do "StringSeq ss=p->second" is (very) small compared to the time consumed by "p.set(ss)" then there is no need to to further optimisation because the overall time will not change a lot? (and so the safety of the "slow" implementation is a bigger overall benefit)
It is very interresting, I was not used to think in this way, but I think your really right! I am learning everyday with you...
I suppose there is some kind of rules of the thumb to set the threshold for the ratio between the time consumed by two part of an algorithm. If the ratio is below this threshold, then there is no need to optimize the fastest part.