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,
	MSGID_RANDY 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: dennison@telepath.com
Subject: Re: Large Look-up Table question ?
Date: 1999/06/03
Message-ID: <7j61cm$fsn$1@nnrp1.deja.com>#1/1
X-Deja-AN: 485248670
References: <375299F4.CDEA8A81@hotmail.com>
X-Http-Proxy: 1.0 x23.deja.com:80 (Squid/1.1.22) for client 204.48.27.130
Organization: Deja.com - Share what you know. Learn what you don't.
X-Article-Creation-Date: Thu Jun 03 13:53:30 1999 GMT
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.6 [en] (WinNT; I)
Date: 1999-06-03T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <375299F4.CDEA8A81@hotmail.com>,
  Nick Wilson <snow_moose@hotmail.com> wrote:
> I'm implementing a large matrix of values which is basically just a
big
> lookup table. What would be the best way to implement this in only
ada83
> code ? My initial idea is to use a static table for all the values but
> this seems clunky, can anyone offer some advice ?

Well, if it's just a one-dimensional lookup, you can dynamicly allocate
an array of the correct size once you know what that size is. Is that
what you were looking for, or did you want something "sexier"?

--
T.E.D.


Sent via Deja.com http://www.deja.com/
Share what you know. Learn what you don't.