Follow-up Comment #9, bug #51309 (project make):
I suggested also a comparison of two algorithms
<https://en.wikipedia.org/wiki/Computational_complexity_theory>.
* A simple time measurement can also show test results for which you might not
be looking for.
* The usage of data structures like list and trees has got also different run
time characteristics. Each of them can have a corresponding application
domain.
* Which test environments would you find representative?
> From this I conclude that the performance impact of an additional notdir
function is negligible and there's no performance advantage to avoiding it.
It might matter more under other circumstances. (The current software can be
fast enough to some degree.)
_______________________________________________________
Reply to this item at:
<http://savannah.gnu.org/bugs/?51309>
_______________________________________________
Message sent via/by Savannah
http://savannah.gnu.org/
_______________________________________________
Bug-make mailing list
Bug-make@gnu.org
https://lists.gnu.org/mailman/listinfo/bug-make
