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 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,229ea0001655d6a2 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Newsgroups: comp.lang.ada Subject: Re: Generic Package References: <1177539306.952515.222940@s33g2000prh.googlegroups.com> <1177601484.444701.171560@r35g2000prh.googlegroups.com> From: Markus E Leypold Organization: N/A Date: Fri, 27 Apr 2007 13:43:58 +0200 Message-ID: <9eejm6rqip.fsf@hod.lan.m-e-leypold.de> User-Agent: Some cool user agent (SCUG) Cancel-Lock: sha1:FmpVejL43mpNLmZVDuNZg1FNwX8= MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii NNTP-Posting-Host: 88.72.204.237 X-Trace: news.arcor-ip.de 1177673755 88.72.204.237 (27 Apr 2007 13:35:55 +0200) X-Complaints-To: abuse@arcor-ip.de Path: g2news1.google.com!news2.google.com!news.glorb.com!newsgate.cistron.nl!xs4all!newsfeed.bit.nl!xlned.com!feeder1.xlned.com!newsfeed.freenet.de!news.unit0.net!newsfeed.arcor-ip.de!news.arcor-ip.de!not-for-mail Xref: g2news1.google.com comp.lang.ada:15380 Date: 2007-04-27T13:43:58+02:00 List-Id: "Dmitry A. Kazakov" writes: > On Thu, 26 Apr 2007 22:52:58 +0100, Simon Wright wrote: > >> "Dmitry A. Kazakov" writes: >> >>> You cannot iterate a relational table, because there is no order >>> defined on it. >> >> Why would that stop me iterating over all the rows? > > Because iterating presumes following an order. If there is no *any* order, > which one would you follow? None. Iteration gives the values in a certain sequence, any time you iterate. But it doesn't follow an order in the case of unordered collections. Next time you iterate the elements might come in another sequence. > It is clear that we could enumerate anything on > a real computer, but that would be same as Unchecked_Conversion, it would > break the abstraction. So I'm having an unchecked operation if I enumerate elements of a set (sets are unordered). How embarrasing. Theat would mean, that there is no efficient way to get at the elements of a given subset of the natural numbers. I'd have to for I in 0 ... infinity: if (I in M) then ... else ... > I guess, one should first create a "result set", then enumerate it > according to some order relation. That thing could be iterated > through. What nonsense. Regards -- Markus