Re: Pascal Calling Convention

[Phil Clayton <phil.clayton@lineone.net>]

On Mar 30, 2:42 pm, Phil Clayton <phil.clay...@lineone.net> wrote:
> On Mar 29, 1:23 pm, stefan-lu...@see-the.signature wrote:
>
>
>
> > The original C++ from Hyman Rosen was
>
> > template <unsigned N>
> > class set
> > {
> >     unsigned n;    // number of members in set
> >     unsigned d[N]; // members are in d[0..n-1]
> >     unsigned s[N]; // d[s[k]] == k if k is a member
> >     // unspecified elements of d and s are arbitrary
>
> > public:
> >     set() : n(0) { }
> >     bool has(unsigned k)
> >         { return k < N && s[k] < n && d[s[k]] == k; }
> >     void add(unsigned k)
> >         { if (k < N && !has(k)) { d[n] = k; s[k] = n++; }
> >     void del(unsigned k)
> >         { if (has(k)) { unsigned i = s[k]; d[i] = d[--n]; s[d[i]] = i; }
> >     void clr() { n = 0; }
>
> > };
>
> Interesting.  It's worth noting that if N is equal to the number of
> keys representable by unsigned

Except that it can't be because N is also of type unsigned so there
can't be 'overflow' either. I didn't see that in the template
argument. Ignore me.

Phil