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=-0.3 required=5.0 tests=BAYES_00,FREEMAIL_FROM, LOTS_OF_MONEY,REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,60d761814c33393c X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-06-11 12:19:49 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!out.nntp.be!propagator2-sterling!news-in.nuthinbutnews.com!newsfeed-zh.ip-plus.net!news.ip-plus.net!not-for-mail From: Thomas Wolf Newsgroups: comp.lang.ada Subject: Re: Qs re 'Write & 'Read Date: Wed, 11 Jun 2003 21:19:47 +0200 Organization: --- Message-ID: References: <02qFa.1186062$F1.140501@sccrnsc04> Reply-To: t_wolf@angelfire.com NNTP-Posting-Host: pargate2.paranor.ch X-Trace: rex.ip-plus.net 1055359227 5498 195.65.4.190 (11 Jun 2003 19:20:27 GMT) X-Complaints-To: abuse@ip-plus.net NNTP-Posting-Date: Wed, 11 Jun 2003 19:20:27 +0000 (UTC) X-Newsreader: MicroPlanet Gravity v2.60 Xref: archiver1.google.com comp.lang.ada:39002 Date: 2003-06-11T21:19:47+02:00 List-Id: david.c.hoos.sr@ada95.com wrote: > > wrote in message news:02qFa.1186062$F1.140501@sccrnsc04... > > >the string itself is preceded by its contstraint, access types are > written > > >to the stream with a boolean value preceding the data (if any). > > Sounds right. > > > > >It surely seemed to me like the language standard could have defined > > >something like this as the default for access types, but alas, it did > not. > > I can see there would be difficulties for general access types, but > > heap access types seem easy enough. Unless storage pools cause > > difficulties. > Maybe my mind's just in a fog today, but please explain why there'd be > a problem with any kind of access type -- general, or not, using my > approach. Cyclic self-referential data structures. It's clearly out of the standard's business; it's up to your application to define how a graph (cyclic or not, tree-shaped or not) is to be written to and read from a stream. -- ----------------------------------------------------------------- Thomas Wolf e-mail: t_wolf@angelfire.com