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: 103376,470860aa3e635a7
X-Google-Attributes: gid103376,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news4.google.com!proxad.net!feeder1-2.proxad.net!news.mixmin.net!feeder.erje.net!news.osn.de!diablo1.news.osn.de!noris.net!newsfeed.arcor.de!newsspool3.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Newsgroups: comp.lang.ada
Subject: Re: GNAT for MS Visual Studio
From: Georg Bauhaus <rm.tsoh+bauhaus@maps.futureapps.de>
In-Reply-To: <1191840144.683169.155070@o3g2000hsb.googlegroups.com>
References: <rkr7df.7mp.ln@hunter.axlog.fr>
	 <soednbei8rlx-mXbnZ2dnUVZ_rignZ2d@comcast.com>
	 <xwir5zj8j2.fsf@hod.lan.m-e-leypold.de>
	 <wvbrabr9hq0t.fsf@astra06.norway.sun.com>
	 <ePWdnf5PGZFiwmfbnZ2dnUVZ_jidnZ2d@comcast.com>
	 <ltfy11y10v.fsf@hod.lan.m-e-leypold.de>
	 <TJSdncwgUrlA-2HbnZ2dnUVZ_ramnZ2d@comcast.com>
	 <4xsl4zw3bp.fsf@hod.lan.m-e-leypold.de>
	 <YcCdnaCp_dEWKmLbnZ2dnUVZ_qqgnZ2d@comcast.com>
	 <fdsf0r$q0t$1@jacob-sparre.dk>
	 <1191357491.860178.230380@22g2000hsm.googlegroups.com>
	 <4702ADCC.7080209@obry.net>
	 <1191439439.120567.172630@g4g2000hsf.googlegroups.com>
	 <4703F02D.3030207@obry.net>
	 <1191682021.844225.236870@g4g2000hsf.googlegroups.com>
	 <4707A3D0.3070702@obry.net> <fe9j33$968$1@jacob-sparre.dk>
	 <47088904.1090201@obry.net> <m2lkae95uz.fsf@mac.com>
	 <1191837141.7362.18.camel@kartoffel>
	 <1191840144.683169.155070@o3g2000hsb.googlegroups.com>
Content-Type: text/plain
Content-Transfer-Encoding: 7bit
Message-Id: <1191841627.7362.45.camel@kartoffel>
Mime-Version: 1.0
X-Mailer: Evolution 2.10.1 
Date: Mon, 08 Oct 2007 13:07:07 +0200
Organization: Arcor
NNTP-Posting-Date: 08 Oct 2007 13:07:07 CEST
NNTP-Posting-Host: 9498ddd3.newsspool4.arcor-online.net
X-Trace: 
 DXC=1@\jY4kEH0ag`45cDR8l?o4IUK<Cl32<a4Fo<]lROoRa^YC2XCjHcbiV;g>JLa4nahN[W<lHX`=Bd\6BhD5G6\il\B2X52S1UYj
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news2.google.com comp.lang.ada:2349
Date: 2007-10-08T13:07:07+02:00
List-Id: <comp.lang.ada>

On Mon, 2007-10-08 at 03:42 -0700, Maciej Sobczak wrote:
> On 8 Pa , 11:52, Georg Bauhaus <rm.tsoh+bauh...@maps.futureapps.de>

> > Are there others than the simulation Pascal has been mentioning?
> 
> A dictionary?

Good example, I think, because analysis will have to consider two times.
I'm assuming that after loading the dictionary, no changes are made.

Likely, a program will iterate these steps:

1)  protect read access
2)  find the key and possibly deliver the value

What are the relative times?

(I have a program of this sort, using rather large dictionaries,
as a Java webapp. Maybe I can compare its times to an AWS based
solution.)