raw
ffa_ch3_shifts.kv       1 ------------------------------------------------------------------------------
ffa_ch3_shifts.kv 2 ------------------------------------------------------------------------------
ffa_ch3_shifts.kv 3 -- This file is part of 'Finite Field Arithmetic', aka 'FFA'. --
ffa_ch3_shifts.kv 4 -- --
ffa_ch15_gcd.kv 5 -- (C) 2019 Stanislav Datskovskiy ( www.loper-os.org ) --
ffa_ch3_shifts.kv 6 -- http://wot.deedbot.org/17215D118B7239507FAFED98B98228A001ABFFC7.html --
ffa_ch3_shifts.kv 7 -- --
ffa_ch3_shifts.kv 8 -- You do not have, nor can you ever acquire the right to use, copy or --
ffa_ch3_shifts.kv 9 -- distribute this software ; Should you use this software for any purpose, --
ffa_ch3_shifts.kv 10 -- or copy and distribute it to anyone or in any manner, you are breaking --
ffa_ch3_shifts.kv 11 -- the laws of whatever soi-disant jurisdiction, and you promise to --
ffa_ch3_shifts.kv 12 -- continue doing so for the indefinite future. In any case, please --
ffa_ch3_shifts.kv 13 -- always : read and understand any software ; verify any PGP signatures --
ffa_ch3_shifts.kv 14 -- that you use - for any purpose. --
ffa_ch3_shifts.kv 15 -- --
ffa_ch3_shifts.kv 16 -- See also http://trilema.com/2015/a-new-software-licensing-paradigm . --
ffa_ch3_shifts.kv 17 ------------------------------------------------------------------------------
ffa_ch3_shifts.kv 18 ------------------------------------------------------------------------------
ffa_ch3_shifts.kv 19
ffa_ch2_logicals.kv 20 with W_Pred; use W_Pred;
ffa_ch2_logicals.kv 21
ffa_ch2_logicals.kv 22
ffa_ch2_logicals.kv 23 package body FZ_Pred is
ffa_ch2_logicals.kv 24
ffa_ch2_logicals.kv 25 ---------------------------------------------------------------------------
ffa_ch2_logicals.kv 26 -- Fundamental Predicate Operations on FZ (finite integers)
ffa_ch2_logicals.kv 27 ---------------------------------------------------------------------------
ffa_ch2_logicals.kv 28
ffa_ch2_logicals.kv 29 -- 1 iff N == 0 (branch-free); else 0
ffa_ch2_logicals.kv 30 function FZ_ZeroP(N : in FZ) return WBool is
ffa_ch2_logicals.kv 31 A : WBool := 1;
ffa_ch2_logicals.kv 32 begin
ffa_ch2_logicals.kv 33 for i in N'Range loop
ffa_ch2_logicals.kv 34 A := A and W_ZeroP(N(i));
ffa_ch2_logicals.kv 35 end loop;
ffa_ch2_logicals.kv 36 return A;
ffa_ch2_logicals.kv 37 end FZ_ZeroP;
ffa_ch2_logicals.kv 38
ffa_ch2_logicals.kv 39
ffa_ch4_ffacalc.kv 40 -- 1 iff N != 0 (branch-free); else 0
ffa_ch4_ffacalc.kv 41 function FZ_NZeroP(N : in FZ) return WBool is
ffa_ch4_ffacalc.kv 42 begin
ffa_ch4_ffacalc.kv 43 return 1 xor FZ_ZeroP(N);
ffa_ch4_ffacalc.kv 44 end FZ_NZeroP;
ffa_ch4_ffacalc.kv 45
ffa_ch4_ffacalc.kv 46
ffa_ch2_logicals.kv 47 -- 1 iff N is odd
ffa_ch2_logicals.kv 48 function FZ_OddP(N : in FZ) return WBool is
ffa_ch2_logicals.kv 49 begin
ffa_ch2_logicals.kv 50 return W_OddP(N(N'First));
ffa_ch2_logicals.kv 51 end FZ_OddP;
ffa_ch2_logicals.kv 52
ffa_ch16_miller_r... 53
ffa_ch16_miller_r... 54 -- 1 iff N fits inside one Word
ffa_ch16_miller_r... 55 function FZ_OneWordP(N : in FZ) return WBool is
ffa_ch16_miller_r... 56 begin
ffa_ch16_miller_r... 57 return FZ_ZeroP(N(N'First + 1 .. N'Last));
ffa_ch16_miller_r... 58 end FZ_OneWordP;
ffa_ch16_miller_r... 59
ffa_ch2_logicals.kv 60 end FZ_Pred;