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.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD, FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: 103376,bb7cc916bd63ab43 X-Google-Attributes: gid103376,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!postnews.google.com!v18g2000pro.googlegroups.com!not-for-mail From: Maciej Sobczak Newsgroups: comp.lang.ada Subject: Re: Performance of element access in Vector Date: Thu, 22 Jan 2009 04:43:41 -0800 (PST) Organization: http://groups.google.com Message-ID: <8c316acf-32e7-4fe6-8b60-6afa00302205@v18g2000pro.googlegroups.com> References: <0a8baaf0-19f7-40c0-a041-884e93fa7020@w39g2000prb.googlegroups.com> <1fp3pbmn4q3o5.1b0fk6lircbld.dlg@40tude.net> <4c38e681-3996-4ce9-ad33-6f7bd790fdbf@u18g2000pro.googlegroups.com> <49784401$0$31872$9b4e6d93@newsspool3.arcor-online.net> NNTP-Posting-Host: 128.141.45.238 Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit X-Trace: posting.google.com 1232628222 4556 127.0.0.1 (22 Jan 2009 12:43:42 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Thu, 22 Jan 2009 12:43:42 +0000 (UTC) Complaints-To: groups-abuse@google.com Injection-Info: v18g2000pro.googlegroups.com; posting-host=128.141.45.238; posting-account=bMuEOQoAAACUUr_ghL3RBIi5neBZ5w_S User-Agent: G2/1.0 X-HTTP-UserAgent: Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.5; en-US; rv:1.9.0.4) Gecko/2008102920 Firefox/3.0.4,gzip(gfe),gzip(gfe) Xref: g2news1.google.com comp.lang.ada:3477 Date: 2009-01-22T04:43:41-08:00 List-Id: On 22 Sty, 11:01, Georg Bauhaus wrote: > 1) How does straight forward STL iteration differ from > FP recursion on lists? Try to iterate over more than one sequence, in parallel, but not necessarily with the same "speed". Like, let's say, in merge sort. You are right - the STL iteration is *straightforward*. :-) > 2) Can we rely on pure FPL style compilation techniques What for? You have a very nice *imperative* language - why would you like to rely on non-imperative compilation techniques? -- Maciej Sobczak * www.msobczak.com * www.inspirel.com Database Access Library for Ada: www.inspirel.com/soci-ada