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,f2690a5e963b61b6
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news3.google.com!news.glorb.com!hwmnpeer01.lga!hwmedia!hw-filter.lga!fe02.lga.POSTED!53ab2750!not-for-mail
From: Mikhail Terekhov <terekhov@emc.com>
User-Agent: Mozilla Thunderbird 1.0.2 (Windows/20050317)
X-Accept-Language: en-us, en
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: GCC 4.0 Ada.Containers Cursor danger.
References: <1120474891.635131.216700@g44g2000cwa.googlegroups.com>
 <1120583470.429264.325450@g43g2000cwa.googlegroups.com>
 <osoo6gccqpnm.2o5eehhafwb1.dlg@40tude.net>
 <42cb8d21$0$22761$9b4e6d93@newsread2.arcor-online.net>
 <ldco4pwrxop4$.1py0a7isiagea.dlg@40tude.net>
 <z--dnRI60_7j_lHfRVn-qw@megapath.net>
 <tyi72ga8ch55$.3tea03tbwrtx.dlg@40tude.net>
 <42cd064c$0$10817$9b4e6d93@newsread4.arcor-online.net>
 <k62rlp2n1ls3.1cnwufmnuit7v.dlg@40tude.net>
 <42cda8c4$0$22780$9b4e6d93@newsread2.arcor-online.net>
 <1u3hh2597i4ne$.1ryetugksbmus.dlg@40tude.net> <uslyp8mmb.fsf@earthlink.net>
 <ad6fbg9gg773$.fzh0v45r7n53.dlg@40tude.net>
 <1120834341.499757.133770@g43g2000cwa.googlegroups.com>
 <1121093867.964444.232420@g14g2000cwa.googlegroups.com>
 <42d2bc2d$0$20148$9b4e6d93@newsread2.arcor-online.net>
 <1121134291.379399.79460@z14g2000cwz.googlegroups.com>
 <42d46b51$0$18005$9b4e6d93@newsread4.arcor-online.net>
 <rBlBe.100$Lv6.23@fe04.lga> <uy8898sm3.fsf@earthlink.net>
In-Reply-To: <uy8898sm3.fsf@earthlink.net>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <4QYCe.11363$1Y1.5180@fe02.lga>
X-Trace: 
 ejlmlnpfppkfdeplmdipgedofipooandmienfjacfgfjjjeblkofpbhdcomdnfbnkocbaabgcpdeoapbkgngfglkbnbokccpgofaalfkbcdbcecahcofimhegcfklgnlbcfagklmibllijll
NNTP-Posting-Date: Mon, 18 Jul 2005 18:38:08 MST
Date: Mon, 18 Jul 2005 21:38:18 -0400
Xref: g2news1.google.com comp.lang.ada:3666
Date: 2005-07-18T21:38:18-04:00
List-Id: <comp.lang.ada>

Matthew Heaney wrote:
> Mikhail Terekhov <terekhov@emc.com> writes:
> 
> 
>>The problem with your example is that it is based on the wrong
>>assumptions:
>>	- First is that all containers have an order.
>>	  Again, sets and hashes in general are *not ordered*.
> 
> 
> This reminds me of Galileo's famous pronouncement "Eppur si muove!"
> when being confronted by the church hierarchy.  The Generic_Find
> algorithm works, even if you say it doesn't!

It is a great honour for me to be compared to Galileo, but wait a 
minute, may be you mean yourself? No, that can't be, Galileo wouldn't 
allow such a disregard to mathematics! ;)

> 
> The Generic_Find algorithm simply tests each element in the sequence as
> the element is being visited, and the algorithm terminates when it
> either finds a match, or has visited every element in the sequence.  It
> doesn't matter in what order the elements appear in the sequence.

That is very true. No mention about order or cusors.

> 
> The Generic_Find algorithm is actually a good example, since it works
> for any container.  That is, it works irrespective of the order in which
> a container delivers elements via the active iterator (cursor), since
> the algorithm itself doesn't depend on a specific order.

Again, that is very true. Can't believe you say it.