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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,c9db882405e08110
X-Google-Attributes: gid103376,public
From: Ehud Lamm <mslamm@mscc.huji.ac.il>
Subject: Re: Large Look-up Table question ?
Date: 1999/06/03
Message-ID: 
 <Pine.A41.3.96-heb-2.07.990603142812.97222B-100000@pluto.mscc.huji.ac.il>#1/1
X-Deja-AN: 485230774
References: <375299F4.CDEA8A81@hotmail.com> <3755a21c@eeyore.callnetuk.com>
Content-Type: TEXT/PLAIN; charset=US-ASCII
Organization: The hebrew University of Jerusalem
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 1999-06-03T00:00:00+00:00
List-Id: <comp.lang.ada>

On Wed, 2 Jun 1999, Nick Roberts wrote:

> A huge array, particularly a linear (one-dimensional) one, can work on a
> virtual memory machine very efficiently when implemented in the language as
> a simple array: the virtual memory management system effectively converts
> the array into a sparse array invisibly. 


I suggest trying things out!

Searching a large (~10^6 elements) array of floating point numbers, on a
PC using GNAT seems fast enough (to make life interesting I looked for
the sqrt).

This is part something I am playing with, so there is a good chance more
on this will come later in more detail.

Ehud Lamm     mslamm@pluto.mscc.huji.ac.il