(2 . 7)(2 . 7)
398 ------------------------------------------------------------------------------
399 -- This file is part of 'Finite Field Arithmetic', aka 'FFA'. --
400 -- --
401 -- (C) 2018 Stanislav Datskovskiy ( www.loper-os.org ) --
402 -- (C) 2019 Stanislav Datskovskiy ( www.loper-os.org ) --
403 -- http://wot.deedbot.org/17215D118B7239507FAFED98B98228A001ABFFC7.html --
404 -- --
405 -- You do not have, nor can you ever acquire the right to use, copy or --
(21 . 6)(21 . 7)
407 with FZ_Shift;
408 with FZ_Mul;
409 with FZ_Sqr;
410 with FZ_GCD;
411
412
413 -- Wrapper bodies for routines that we inline, but must enforce preconditions
(117 . 4)(118 . 16)
415 FZ_Sqr.FZ_Square_Buffered(X => X, XX_Lo => XX_Lo, XX_Hi => XX_Hi);
416 end FFA_FZ_Square;
417
418 ----------------------------------------------------------------------------
419 --- Other Operations on FZ
420 ----------------------------------------------------------------------------
421
422 -- Find Greatest Common Divisor (GCD) of X and Y.
423 procedure FFA_FZ_Greatest_Common_Divisor(X : in FZ;
424 Y : in FZ;
425 Result : out FZ) is
426 begin
427 FZ_GCD.FZ_Greatest_Common_Divisor(X => X, Y => Y, Result => Result);
428 end FFA_FZ_Greatest_Common_Divisor;
429
430 end FFA;