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,LOTS_OF_MONEY autolearn=ham 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-12 03:12:34 PST Date: Thu, 12 Jun 2003 12:12:24 +0200 From: =?UTF-8?B?Um9kcmlnbyBHYXJjw61h?= User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:0.9.9) Gecko/20020513 X-Accept-Language: en-us, en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Qs re 'Write & 'Read References: <02qFa.1186062$F1.140501@sccrnsc04> Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit NNTP-Posting-Host: lglpc31.epfl.ch Message-ID: <3ee8520c$1@epflnews.epfl.ch> X-Trace: epflnews.epfl.ch 1055412748 128.178.76.8 (12 Jun 2003 12:12:28 +0200) Organization: EPFL Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!nntp.infostrada.it!news.mailgate.org!news-zh.switch.ch!switch.ch!epflnews.epfl.ch!not-for-mail Xref: archiver1.google.com comp.lang.ada:39040 Date: 2003-06-12T12:12:24+02:00 List-Id: Thomas Wolf wrote: > 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. I would not say that it is totally outside standard's business... It clearly adds complexity to the compiler/run-time, but Java does that automatically (and it detects circularities). Rodrigo