Re: ANN: miscellaneous Math routines, GPL'd

[johnscpg@googlemail.com]

On May 13, 12:52 pm, gautier_niou...@hotmail.com wrote:
> On 13 Mai, 11:25, johns...@googlemail.com wrote:
>
>
>
> > Another irritation:  suppose user declares
>
> >   V : Vector (1..10);
> >   M : Matrix (0..9, 0..9);
> > or worse
> >   M : Matrix (0..9, 2..11);
> > or worse still
> >   M : Matrix (0..11, 2..11);
>
> > How do you handle it?
> > 1. shift indices during iteration inside loops in the lin alg program.
> > 2. slide arrays so indices coincide.
> > 3. Raise constraint_error;
> > 4. Assume they won't do it.
>
> > I do 3. (See for example procedure Choleski_Decompose at end of
> > Disorderly-Random-Deviates.adb  and near bottom of
> > Disorderly-Random-Deviates.ads.)   But I'm not sure what to do.
> > (I was going ask here on comp.lang.ada, but got lazy.)
> > Generics with constrained arrays work ok for me here.
>
> It's done here:http://www.cs.umbc.edu/~squire/adaclass/gnatmath95,
> generic_real_linear_equations.ads .
>
> For using with Ada 2005's matrices, all you need is to replace
> package Generic_Real_Arrays by Ada.Numerics.Generic_Real_Arrays
> :-)
> _________________________________________________________
> Gautier's Ada programming --http://sf.net/users/gdemont/
>
> NB: For a direct answer, e-mail address on the Web site!

Thanks Gautier!  After a quick inspection, I notice a lot
of method 1, (shifting indices inside loops), but sometimes the
author copies the entire input array over to a new local array
with the desired indices (usually 1..N).  Also
raises an exception if there's a length mismatch.

cheers,
jonathan