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-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,d89e2d213646aec8
X-Google-Attributes: gid103376,public
Path: 
 controlnews3.google.com!news1.google.com!news.glorb.com!news.cs.univ-paris8.fr!proxad.net!freenix!enst.fr!melchior!cuivre.fr.eu.org!melchior.frmug.org!not-for-mail
From: Marius Amado Alves <amado.alves@netcabo.pt>
Newsgroups: comp.lang.ada
Subject: Re: Mneson announcement and help request
Date: Wed, 02 Jun 2004 18:47:18 +0100
Organization: Cuivre, Argent, Or
Message-ID: <mailman.37.1086198453.391.comp.lang.ada@ada-france.org>
References: <mailman.28.1086105372.391.comp.lang.ada@ada-france.org>
	<oVavc.34141$js4.3916@attbi_s51>
	<mailman.30.1086145552.391.comp.lang.ada@ada-france.org><c9kd3v$i1n$1@a1-hrz.uni-duisburg.de>
	<mailman.34.1086176483.391.comp.lang.ada@ada-france.org>
	<c9l0vo$pq3$1@sparta.btinternet.com>
NNTP-Posting-Host: lovelace.ada-france.org
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: melchior.cuivre.fr.eu.org 1086198454 61043 212.85.156.195 (2 Jun 2004
 17:47:34 GMT)
X-Complaints-To: usenet@melchior.cuivre.fr.eu.org
NNTP-Posting-Date: Wed, 2 Jun 2004 17:47:34 +0000 (UTC)
Cc: comp.lang.ada@ada-france.org
Return-Path: <amado.alves@netcabo.pt>
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US;
	rv:1.4) Gecko/20030624 Netscape/7.1 (ax)
X-Accept-Language: en-us, en
In-Reply-To: <c9l0vo$pq3$1@sparta.btinternet.com>
X-Virus-Scanned: by amavisd-new-20030616-p7 (Debian) at ada-france.org
X-BeenThere: comp.lang.ada@ada-france.org
X-Mailman-Version: 2.1.4
Precedence: list
List-Id: "Gateway to the comp.lang.ada Usenet newsgroup"
	<comp.lang.ada.ada-france.org>
List-Unsubscribe: <http://www.ada-france.org/mailman/listinfo/comp.lang.ada>,
	<mailto:comp.lang.ada-request@ada-france.org?subject=unsubscribe>
List-Post: <mailto:comp.lang.ada@ada-france.org>
List-Help: <mailto:comp.lang.ada-request@ada-france.org?subject=help>
List-Subscribe: <http://www.ada-france.org/mailman/listinfo/comp.lang.ada>,
	<mailto:comp.lang.ada-request@ada-france.org?subject=subscribe>
Xref: controlnews3.google.com comp.lang.ada:1032
Date: 2004-06-02T18:47:18+01:00

Ok, so the secret formula is:

   cost(exception check) < cost(condition check) < cost(raising)

And of course which idiom is best for algorithm A depends on the nature 
and casuistics of A. Finding the critical algorithms and determining 
these properties for each one is the hard work now.

In the ASCLWG discussion I didn't intend to demonstrate past the case at 
hand then, namely the first two costs above. Maybe I was blissfully 
ignorant of the third.

Now I'll have one more hint next time I find some Mneson function slow.

Thanks for the byte :-)