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.0 required=5.0 tests=BAYES_00,FORGED_HOTMAIL_RCVD2,
	FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,1ff542cf207f32ca,start
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.68.213.68 with SMTP id nq4mr14237255pbc.2.1328625810282;
        Tue, 07 Feb 2012 06:43:30 -0800 (PST)
Path: 
 lh20ni270778pbb.0!nntp.google.com!news2.google.com!postnews.google.com!k10g2000yqk.googlegroups.com!not-for-mail
From: adacrypt <austin.obyrne@hotmail.com>
Newsgroups: comp.lang.ada
Subject: Help needed - Upper Bound of an array - Question.
Date: Tue, 7 Feb 2012 06:41:38 -0800 (PST)
Organization: http://groups.google.com
Message-ID: 
 <9203a648-af0d-45a1-87ba-67373435b391@k10g2000yqk.googlegroups.com>
NNTP-Posting-Host: 109.155.140.236
Mime-Version: 1.0
X-Trace: posting.google.com 1328625810 1968 127.0.0.1 (7 Feb 2012 14:43:30
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Tue, 7 Feb 2012 14:43:30 +0000 (UTC)
Complaints-To: groups-abuse@google.com
Injection-Info: k10g2000yqk.googlegroups.com; posting-host=109.155.140.236;
 posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg
User-Agent: G2/1.0
X-Google-Web-Client: true
X-Google-Header-Order: ARLUEHNKC
X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 7.0; Windows NT 5.1;
 Trident/4.0; GTB7.2; .NET CLR 1.1.4322; .NET CLR 2.0.50727; .NET CLR
 3.0.04506.30; .NET CLR 3.0.4506.2152; .NET CLR 3.5.30729),gzip(gfe)
Content-Type: text/plain; charset=ISO-8859-1
Date: 2012-02-07T06:41:38-08:00
List-Id: <comp.lang.ada>

I am not an expert programmer in Ada but I have taught myself enough
Ada-95 to be able to write some difficult cryptography programs that I
post in another group.

My problem is this.  I need to test the frequency of the ciphertext
which is sometimes a long string of large positive integers of 7 or 8
digits in magnitude and to do that I need an array that will
accommodate up to 10,000,000 elements ideally.

I have already found out that I cannot go more than 500,000 elements
in the array size.  My computer has 32-bit architecture.

What I need to know from some kind person is this - Is the array size
a property of the Ada-95 language or the computer?

I need to know this before resorting to a 64-bit computer which might
not solve the problem and be an expensive mistake.

Your help would be greatly appreciated.

- adacrypt