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=-2.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM, MAILING_LIST_MULTI autolearn=unavailable autolearn_force=no version=3.4.4 X-Google-Thread: 103376,1fa85f3df5841ae1 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news4.google.com!news2.google.com!proxad.net!usenet-fr.net!news.enst.fr!melchior!cuivre.fr.eu.org!melchior.frmug.org!not-for-mail From: Duncan Sands Newsgroups: comp.lang.ada Subject: Re: Ada.Containers.Vectors - querying multiple elements Date: Wed, 27 Apr 2005 13:57:13 +0200 Organization: Cuivre, Argent, Or Message-ID: References: <426e4c2b$0$7515$9b4e6d93@newsread2.arcor-online.net> <1114530273.185327.319710@z14g2000cwz.googlegroups.com> <1114531544.32583.142.camel@localhost.localdomain> <426E72C3.9070108@on2.com> <426e90ef$0$10506$9b4e6d93@newsread4.arcor-online.net> <426f7310$0$10498$9b4e6d93@newsread4.arcor-online.net> NNTP-Posting-Host: lovelace.ada-france.org Mime-Version: 1.0 Content-Type: text/plain Content-Transfer-Encoding: 7bit X-Trace: melchior.cuivre.fr.eu.org 1114603052 59360 212.85.156.195 (27 Apr 2005 11:57:32 GMT) X-Complaints-To: usenet@melchior.cuivre.fr.eu.org NNTP-Posting-Date: Wed, 27 Apr 2005 11:57:32 +0000 (UTC) Cc: comp.lang.ada@ada-france.org To: Georg Bauhaus Return-Path: In-Reply-To: <426f7310$0$10498$9b4e6d93@newsread4.arcor-online.net> X-Mailer: Evolution 2.2.1.1 X-Virus-Scanned: by amavisd-new-20030616-p10 (Debian) at ada-france.org X-BeenThere: comp.lang.ada@ada-france.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: "Gateway to the comp.lang.ada Usenet newsgroup" List-Unsubscribe: , List-Post: List-Help: List-Subscribe: , Xref: g2news1.google.com comp.lang.ada:10753 Date: 2005-04-27T13:57:13+02:00 Hi Georg, > Recursive algorithms on arrays that change their > 'Length during recursion by removing or inserting slices? > Or are array parameters used for the side effect of passing > bounds which are really central to the algorithm? (This can > be expressed using nested subprograms of two index values, > like in quicksort, such that the array is visible to the > subprogram.) that's how I reimplemented the recursive algorithm that started this thread: just pass the bounds around instead of an actual array. However this required rewriting the code. That's why I've been mentioning legacy code: what about legacy code that I can't reasonably rewrite? And it seems wrong that if I want to use "vector" in some high level abstraction built on low level building blocks, I have to push the use of "vector" down into those building blocks too. Ciao, Duncan.