I have a different viewpoint: abstraction can be an aid to performance.
Here's an example: the perl interpreter is written in C, yet for many string matching tasks, perl's regular expression engine is faster than hand-crafted C code. That sounds like a contradiction, but for most tasks the speed of string matching is not worth spending several man-years of development time on. Every time you use the regexp engine, you are leveraging the many man-years of development that have gone into making it fast.
Regular expressions (and the irregular extensions available in perl) are an example of an abstraction that gain you performance by letting you use someone else's work. The better the abstraction, the more widely applicable it is, the more benefit stands to be gained.
And by using abstractions that hide the gory details of highly optimised code, it frees up my precious development time to find performance wins in other parts of the code, or to write a Sudoku solver.
Hugo
In reply to Re: Performance, Abstraction and HOP
by hv
in thread Performance, Abstraction and HOP
by pg
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |