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,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: 103376,2cb1f0b6d642e1dc
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news4.google.com!news1.google.com!news.glorb.com!news2.glorb.com!news-out.readnews.com!transit3.readnews.com!s09-10.readnews.com!not-for-mail
Date: Tue, 29 Mar 2011 09:10:40 -0400
From: Hyman Rosen <hyrosen@mail.com>
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.1; en-US;
 rv:1.9.2.15) Gecko/20110303 Thunderbird/3.1.9
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Pascal Calling Convention
References: <9b04626e-567d-408c-aab3-39b964b3ffd6@l2g2000prg.googlegroups.com>
 <op.vstkpc1rule2fv@index.ici> <ime30d$rrk$1@munin.nbi.dk>
 <op.vstobjtxule2fv@index.ici>
 <F8mdnYCca6tRJBfQnZ2dnUVZ_s-dnZ2d@earthlink.com>
 <lnipv89vg7.fsf@nuthaus.mib.org> <wccd3lf5gq6.fsf@shell01.TheWorld.com>
 <lny64384wx.fsf@nuthaus.mib.org> <wccbp0xy5hu.fsf@shell01.TheWorld.com>
 <4d90efdd$1$14806$882e7ee2@usenet-news.net>
 <330393be-cb82-4cd8-ba44-6e59af7b75bf@v11g2000prb.googlegroups.com>
 <4d90fd41$1$14782$882e7ee2@usenet-news.net>
 <d68b20bc-3aa5-4cc5-bd8e-a944dee20f24@a11g2000pri.googlegroups.com>
 <4d911e17$0$6776$9b4e6d93@newsspool3.arcor-online.net>
 <Pine.LNX.4.64.1103291415240.11824@medsec1.medien.uni-weimar.de>
In-Reply-To: <Pine.LNX.4.64.1103291415240.11824@medsec1.medien.uni-weimar.de>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Message-ID: <4d91da88$0$14789$882e7ee2@usenet-news.net>
NNTP-Posting-Host: 745e63f0.usenet-news.net
X-Trace: 
 DXC=O=5F63a?D38ZPi]J2cn8@?QFZ3T]GPM]7mX0AG3X_jU?F:F`E@;`^n4i22nWOTKLQ3McWTcYQB@P1Ko28P5Lcl`5OU=0K9e<nR=
X-Complaints-To: abuse@usenet-news.net
Xref: g2news1.google.com comp.lang.ada:18576
Date: 2011-03-29T09:10:40-04:00
List-Id: <comp.lang.ada>

On 3/29/2011 8:23 AM, stefan-lucks@see-the.signature wrote:
> Very nice, indeed. Here is a bare minimum version, which is closer to the
> original proposal. Note that in Ada we don't need to perform the explicit
> check for K < N, unlike C++.

This <http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.7319&rep=rep1&type=pdf>
is the original paper: Briggs & Torczon, "An efficient representation for sparse sets".
There's also discussion here:
<http://research.swtch.com/2008/03/using-uninitialized-memory-for-fun-and.html>