From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,38b27bed88e97415 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-02-21 14:54:44 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!nntp-relay.ihug.net!ihug.co.nz!west.cox.net!cox.net!newsfeed1.earthlink.net!newsfeed.earthlink.net!stamper.news.pas.earthlink.net!newsread1.prod.itd.earthlink.net.POSTED!not-for-mail Message-ID: <3E56AE14.9B5F31A@tsoft.com> From: Yuri X-Mailer: Mozilla 4.79 [en] (X11; U; Linux 2.4.2 i386) X-Accept-Language: en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Question: Combination of Access and Constraining References: <1d13e1b4.0302200006.70207b86@posting.google.com> <9d795v0h3qa2922u8vodfhpfvprpre6ak2@4ax.com> <1d13e1b4.0302200720.9666350@posting.google.com> <3E5517AE.1040003@acm.org> <3E553C5E.7B2850FD@tsoft.com> <3E557F4C.1010101@acm.org> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Date: Fri, 21 Feb 2003 22:53:08 GMT NNTP-Posting-Host: 63.215.233.84 X-Complaints-To: abuse@earthlink.net X-Trace: newsread1.prod.itd.earthlink.net 1045867988 63.215.233.84 (Fri, 21 Feb 2003 14:53:08 PST) NNTP-Posting-Date: Fri, 21 Feb 2003 14:53:08 PST Organization: EarthLink Inc. -- http://www.EarthLink.net Xref: archiver1.google.com comp.lang.ada:34403 Date: 2003-02-21T22:53:08+00:00 List-Id: > Yuri wrote: > > And how efficient will be eventual comparison/argument > > passing code resulting from such Null_Tp constant? Is it going to be > > one-instruction comparison in ASM or much more? > > The answer is, a software engineer doesn't care. Until it is done in the > most straightforward, readable, and understandable way, and measurement > shows that the system does not meet its timing requirments, and analysis > shows that the only way to meet those timing requirements is by dealing > with these issues, it's not an issue. Since compilers are very good at > dealing with these kinds of things, I doubt it will ever be an issue. > Those who worry about such things with no evidence that they are > problems are simply wasting the most expensive resource on the project. I agree mostly, but there could be projects where performance is critical. If rate of processing is low than performance is no issue. But if say you process real-time video higher-performance processor may make project cost-inefficient. Yuri.