On Aug 2, 4:10 pm, goo...@[EMAIL PROTECTED]
wrote:
> On Aug 2, 12:35 pm, Claus <socaciu.clau...@[EMAIL PROTECTED]
> wrote:
>
> > Actually is not what i wanted.
>
> > The problem is to calculate the modulo of a integer number of 30
> > digits long.
>
> Hi Claudiu,
>
> Not sure if you are looging at doing this in Progress and if so the
> problem will be that it does not sup****t integers of that size, what
> you can do is use a decimal and create your own function.
>
> def var aa as dec no-undo.
>
> function fModulo returns dec
> (longNum as dec, longNum2 as dec) forward.
>
> aa = 123456789012345678901234567890.
>
> message "ans --> " fModulo (aa,9996614.0).
>
> function fModulo returns dec (longNum as dec, longNum2 as dec).
>
> def var i as int.
>
> if longNum < 2147483647 and
> longNum2 < 2147483647 then
> return dec(longNum modulo longNum2).
>
> assign longNum = truncate(longNum,0)
> longNum2 = truncate(longNum2,0).
>
> return truncate(longNum - (longNum2 * truncate((longNum /
> longNum2),0)),0).
>
> end.
Thanks for this. It is what I wanted.
|
