Another aspect of this debate is orthogonality. The word gets bandied about a lot, and I'm not sure everyone agrees on what it means, I'm not sure I even understand it myself. But what it means for me is that something you pick up in one corner of the language can successfully be applied to another part of the language... and it will work! Perl excels at this sort of thing, like the notion of the last expression in a block is returned, and lazy evaluation and what not.
This got me thinking because if I had been asked what orthogonality is I would have a used a mathematically based description, probably something like
In math it means that two lines are perpandicular to each other, which means that if those lines are seen as representing variables then those variables are independant. In computing this idea of independance is extended into the abstract realm and means that two ideas or solutions are independant to each other. This sense is usually used when a programmer wants to indicate that some algorithm or solution is independant of another to the extent that changes to one should in way affect the other.
But as grinder said im not so sure if this a common understanding or that I even have it correct.
What do the monks at large think is orthogonality and how would you explain it or define it if you needed to?
Yves / DeMerphq
---
Writing a good benchmark isnt as easy as it might look.
In reply to (OT) On Orthogonality by demerphq
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |