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,8de7eedad50552f1 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news3.google.com!news.glorb.com!proxad.net!usenet-fr.net!enst.fr!melchior!cuivre.fr.eu.org!melchior.frmug.org!not-for-mail From: Marius Amado Alves Newsgroups: comp.lang.ada Subject: Re: Ada bench : count words Date: Tue, 22 Mar 2005 13:12:04 +0000 Organization: Cuivre, Argent, Or Message-ID: References: <87vf7n5njs.fsf@code-hal.de> <423f5813$0$9224$9b4e6d93@newsread4.arcor-online.net> <18arnvu705ly4$.1wz6ybz1jt70y$.dlg@40tude.net> <1q9cx4jt7802s.k45m6mcntl87$.dlg@40tude.net> NNTP-Posting-Host: lovelace.ada-france.org Mime-Version: 1.0 (Apple Message framework v619.2) Content-Type: text/plain; charset=US-ASCII; format=flowed Content-Transfer-Encoding: 7bit X-Trace: melchior.cuivre.fr.eu.org 1111497143 63636 212.85.156.195 (22 Mar 2005 13:12:23 GMT) X-Complaints-To: usenet@melchior.cuivre.fr.eu.org NNTP-Posting-Date: Tue, 22 Mar 2005 13:12:23 +0000 (UTC) To: comp.lang.ada@ada-france.org Return-Path: In-Reply-To: X-Mailer: Apple Mail (2.619.2) X-OriginalArrivalTime: 22 Mar 2005 13:12:05.0106 (UTC) FILETIME=[BE5A2D20:01C52EE0] 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:9729 Date: 2005-03-22T13:12:04+00:00 In case someone's interested, to repeat the input file N=500 times as seemingly required by the benchmark, I use the program below. with Ada.Command_Line; with Ada.Strings.Unbounded; with Ada.Text_IO; procedure Repeat_File is use Ada.Command_Line; use Ada.Strings.Unbounded; use Ada.Text_IO; N : Natural; U : Unbounded_String; C : Character; begin N := Natural'Value (Argument (1)); while not End_Of_File loop Get_Immediate (C); Append (U, C); end loop; for I in 1 .. N loop Put (To_String (U)); end loop; end;