|
From: R. Bruce Hoffman, Jr. <rbruceh@attglobal.net> > > it is SUPPOSED to be like this, but often the compiler writer > > cheats and takes the easiest route. Last time I looked COMP > > is packed and packed arithmetic IS slower than binary. > which emphasizes my point. Spell out your intention. > point is that COMP is supposed to be implemented as the fastest internal representation (which would be binary) but is in fact implemented as packed which is slower. But hey, who really cares nowadays...
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.