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: a07f3367d7,6327f05d4989a68d X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,ASCII-7-bit X-Received: by 10.180.94.8 with SMTP id cy8mr4978225wib.1.1356187920186; Sat, 22 Dec 2012 06:52:00 -0800 (PST) Path: i11ni256694wiw.0!nntp.google.com!feeder1.cambriumusenet.nl!feed.tweaknews.nl!194.109.133.81.MISMATCH!newsfeed.xs4all.nl!newsfeed2.news.xs4all.nl!xs4all!feeder.erje.net!us.feeder.erje.net!gandalf.srv.welterde.de!news.swapon.de!news.albasani.net!newsfeed.freenet.ag!takemy.news.telefonica.de!telefonica.de!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail Date: Wed, 19 Dec 2012 10:00:57 +0100 From: Georg Bauhaus User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.7; rv:17.0) Gecko/17.0 Thunderbird/17.0 MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Press Release - Ada 2012 Language Standard Approved by ISO References: <7wrdmbre6jw9.qww9l0uzj6mg.dlg@40tude.net> In-Reply-To: <7wrdmbre6jw9.qww9l0uzj6mg.dlg@40tude.net> Message-ID: <50d18248$0$6571$9b4e6d93@newsspool3.arcor-online.net> Organization: Arcor NNTP-Posting-Date: 19 Dec 2012 10:00:56 CET NNTP-Posting-Host: 20394c13.newsspool3.arcor-online.net X-Trace: DXC=kEUeO^?oOo7;]cDoEWD6A4McF=Q^Z^V384Fo<]lROoR18kFejV8_\jo[C[7\20>YfT:60I8K0 X-Complaints-To: usenet-abuse@arcor.de Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Date: 2012-12-19T10:00:56+01:00 List-Id: On 19.12.12 09:33, Dmitry A. Kazakov wrote: > Take an instance of Ada.Numerics.Discrete_Random and do: > > subtype More_Fun_Number is Integer with > Dynamic_Predicate => Random = More_Fun_Number; > You could use subtype More_Fun_Number is Integer with Dynamic_Predicate => At_Least_A_Thousand (Random (G), More_Fun_Number); to test whether or not your random number generator is, say, dodging at least 1_000 numbers that your algorithm happens to produce, and assign, in a predictable way. This approach doesn't seem so wrong in case one cannot know the result in advance, but operation of the program critically depends on certain properties of those unknown parts.