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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a714625b3763f46e X-Google-Attributes: gid103376,public From: mab@dst17.wdl.loral.com (Mark A Biggar) Subject: Re: Modest proposal, 3 of 3 Date: 1996/11/25 Message-ID: <57csa5$7c8@wdl1.wdl.lmco.com>#1/1 X-Deja-AN: 200681626 references: <575aq0$t4j@netline-fddi.jpl.nasa.gov> <32999420.53AA@lmtas.lmco.com> organization: Loral Western Development Labs newsgroups: comp.lang.ada Date: 1996-11-25T00:00:00+00:00 List-Id: In article <32999420.53AA@lmtas.lmco.com> Ken Garlington writes: >Van Snyder wrote: >> BACKGROUND >> This is OK, because there are only two things you can >> do with pointers (in a sane language): dereference them and copy them. >I'm not sure what a "sane" language is (isn't SANE a numerical representation?), >but I have certainly done mathematics with Ada accesses (systems programming-type >algorithms), and would like to continue to do so. Also, I'm not sure >what "copy" entails, but I assume this would permit access values to be passed >to subprograms. Humm, but what about = and \=, it is really hard to write most linked list algorithms if you can't at least compare against the null pointer? -- Mark Biggar mab@wdl.lmco.com