-
+ F9DAAB09EBA1B9A1C45DF770508F27F4E20B87E0A7BFFF19B85BB3CE82A7B73929D04A7D7E9C97E35AD8012CBA61ED1247A93067F3D90A96BA2C727E78A36E76ffa/libffa/fz_gcd.ads(0 . 0)(1 . 33)
763 ------------------------------------------------------------------------------
764 ------------------------------------------------------------------------------
765 -- This file is part of 'Finite Field Arithmetic', aka 'FFA'. --
766 -- --
767 -- (C) 2019 Stanislav Datskovskiy ( www.loper-os.org ) --
768 -- http://wot.deedbot.org/17215D118B7239507FAFED98B98228A001ABFFC7.html --
769 -- --
770 -- You do not have, nor can you ever acquire the right to use, copy or --
771 -- distribute this software ; Should you use this software for any purpose, --
772 -- or copy and distribute it to anyone or in any manner, you are breaking --
773 -- the laws of whatever soi-disant jurisdiction, and you promise to --
774 -- continue doing so for the indefinite future. In any case, please --
775 -- always : read and understand any software ; verify any PGP signatures --
776 -- that you use - for any purpose. --
777 -- --
778 -- See also http://trilema.com/2015/a-new-software-licensing-paradigm . --
779 ------------------------------------------------------------------------------
780 ------------------------------------------------------------------------------
781
782 with FZ_Type; use FZ_Type;
783
784
785 package FZ_GCD is
786
787 pragma Pure;
788
789 -- Find Greatest Common Divisor (GCD) of X and Y.
790 procedure FZ_Greatest_Common_Divisor(X : in FZ;
791 Y : in FZ;
792 Result : out FZ);
793 pragma Inline_Always(FZ_Greatest_Common_Divisor);
794
795 end FZ_GCD;