Re: Extended modal types

[Anatoly Chernyshev <rhezusfactor@yahoo.com>]

Well, this post got a surprising response, so I have to make some
explanation on that.
First, I beg your pardon for probable confusing of the terms. I did not
think of modular types as a computer scientist, instead I just thought of
some �cyclical� integer type, which will never overflow even being added
with an �out of range� number. I found this type should mostly be the
modular alike.

I see the usefulness of this type is in arrays dimensions � when one goes
beyond the array boundary it automatically gets to the opposite side.
Arrays with such a property known as �periodic boundary condition� are
widely used in molecular mechanics and cellular automata (Conway�s Game of
Life, for instance). I had not found those types in packages available to
public, so I decided to write my own.

Actually, the package for deal with such �extended modular� types merely is
a service one aimed for further development of package(s) for periodical
boundary condition arrays.

Anatoly Chernyshev


Anatoly Chernyshev wrote:

> Once I have been introduced in Ada programming, I was very
> exciting about modular types. Later on it became evident to me that
> these types are rather limited, and one cannot use arbitrary modular
> range,
> for example, like -100..345. I didn't find any packages in the WWW that
> can
> deal with such "extended" modular variables, so I wrote my own.
> Anyone interested could pick it up at
> http://www.polarhome.com/~ada/ch_rings.zip
>