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, LOTS_OF_MONEY,MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,54e6f3bfd18d2769 X-Google-Attributes: gid103376,public From: Ted Dennison Subject: Re: Pointer function parameter Date: 2000/10/19 Message-ID: <8snh8l$for$1@nnrp1.deja.com>#1/1 X-Deja-AN: 683503263 References: X-Http-Proxy: 1.0 x51.deja.com:80 (Squid/1.1.22) for client 204.48.27.130 Organization: Deja.com - Before you buy. X-Article-Creation-Date: Thu Oct 19 19:15:43 2000 GMT X-MyDeja-Info: XMYDJUIDtedennison Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.7 [en] (WinNT; I) Date: 2000-10-19T00:00:00+00:00 List-Id: In article , tmoran@bix.com wrote: > >virtually all dynamic data structures (linked lists, trees, etc.) > >require them. [access types] > No. People were making those structures using array indexing and not > access types a long, long time ago. Look at some old Fortran code. ...or refer to Donald Knuth's classic "The Art of Computer Programming". -- T.E.D. http://www.telepath.com/~dennison/Ted/TED.html Sent via Deja.com http://www.deja.com/ Before you buy.