Article View: comp.lang.modula2
Article #4125Re: 0-based/1-based arrays
From: 00704a-Liber
Date: Mon, 21 Mar 1988 23:22
Date: Mon, 21 Mar 1988 23:22
16 lines
1470 bytes
1470 bytes
In article <8496@reed.UUCP> douglas@reed.UUCP (P Douglas Reeder) writes: >I like being able to make the lower bound of an array whichever I prefer >and is the sensible one. Allowing this requires only a trivial addition to >array element evaluation: the lower bound is subtracted from the index first. Yes, but that must be done to EACH AND EVERY reference to the array!! (Actually, there are other ways to implement arrays, but they all boil down to more runtime overhead). I think that Wirth is trying to get rid of as much runtime overhead as he can without losing the notion of 'verifyability'. And I think he has accomplished that (whether this is good or bad is a matter of opinion). -- _ __ NEVIN J. LIBER ..!ihnp4!ihlpf!nevin1 (312) 510-6194 ' ) ) "The secret compartment of my ring I fill / / _ , __o ____ with an Underdog super-energy pill." / (_</_\/ <__/ / <_ These are solely MY opinions, not AT&T's, blah blah blah
Technical Details
Message-ID:
<4072@ihlpf.ATT.COM>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!ncar!ames!pacbell!att-ih!ihnp4!ihlpf!nevin1References:
<7161@sol.ARPA> <2740@mmintl.UUCP> <4343@june.cs.washington.edu> <kW=wqIy00Uo507dUV3@andrew.cmu.edu> <8496@reed.UUCP>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!husc6!ncar!ames!pacbell!att-ih!ihnp4!ihlpf!nevin1 From: nevin1@ihlpf.ATT.COM (00704a-Liber) Newsgroups: comp.lang.modula2 Subject: Re: 0-based/1-based arrays Message-ID: <4072@ihlpf.ATT.COM> Date: 21 Mar 88 23:22:59 GMT References: <7161@sol.ARPA> <2740@mmintl.UUCP> <4343@june.cs.washington.edu> <kW=wqIy00Uo507dUV3@andrew.cmu.edu> <8496@reed.UUCP> Reply-To: nevin1@ihlpf.UUCP (00704a-Liber,N.J.) Organization: AT&T Bell Laboratories - Naperville, Illinois Lines: 16