raw
ffa_ch2_logicals.kv     1 ------------------------------------------------------------------------------
ffa_ch2_logicals.kv     2 ------------------------------------------------------------------------------
ffa_ch2_logicals.kv     3 -- This file is part of 'Finite Field Arithmetic', aka 'FFA'.               --
ffa_ch2_logicals.kv     4 --                                                                          --
ffa_ch15_gcd.kv         5 -- (C) 2019 Stanislav Datskovskiy ( www.loper-os.org )                      --
ffa_ch2_logicals.kv     6 -- http://wot.deedbot.org/17215D118B7239507FAFED98B98228A001ABFFC7.html     --
ffa_ch2_logicals.kv     7 --                                                                          --
ffa_ch2_logicals.kv     8 -- You do not have, nor can you ever acquire the right to use, copy or      --
ffa_ch2_logicals.kv     9 -- distribute this software ; Should you use this software for any purpose, --
ffa_ch2_logicals.kv    10 -- or copy and distribute it to anyone or in any manner, you are breaking   --
ffa_ch2_logicals.kv    11 -- the laws of whatever soi-disant jurisdiction, and you promise to         --
ffa_ch2_logicals.kv    12 -- continue doing so for the indefinite future. In any case, please         --
ffa_ch2_logicals.kv    13 -- always : read and understand any software ; verify any PGP signatures    --
ffa_ch2_logicals.kv    14 -- that you use - for any purpose.                                          --
ffa_ch2_logicals.kv    15 --                                                                          --
ffa_ch2_logicals.kv    16 -- See also http://trilema.com/2015/a-new-software-licensing-paradigm .     --
ffa_ch2_logicals.kv    17 ------------------------------------------------------------------------------
ffa_ch2_logicals.kv    18 ------------------------------------------------------------------------------
ffa_ch2_logicals.kv    19 
ffa_ch2_logicals.kv    20 with Words; use Words;
ffa_ch2_logicals.kv    21 
ffa_ch2_logicals.kv    22 -- Elementary Predicates on Words:
ffa_ch2_logicals.kv    23 package W_Pred is
ffa_ch2_logicals.kv    24    
ffa_ch2_logicals.kv    25    pragma Pure;
ffa_ch2_logicals.kv    26    
ffa_ch2_logicals.kv    27    -- Return 1 if N is equal to 0; otherwise return 0.
ffa_ch2_logicals.kv    28    function W_ZeroP(N : in Word) return WBool;
ffa_ch11_tuning_a...   29    pragma Inline_Always(W_ZeroP);
ffa_ch2_logicals.kv    30    
ffa_ch2_logicals.kv    31    -- Return 1 if N is unequal to 0; otherwise return 0.
ffa_ch2_logicals.kv    32    function W_NZeroP(N : in Word) return WBool;
ffa_ch11_tuning_a...   33    pragma Inline_Always(W_NZeroP);
ffa_ch2_logicals.kv    34    
ffa_ch5_egypt.kv       35    -- Return WBool-complement of N.
ffa_ch5_egypt.kv       36    function W_Not(N : in WBool) return WBool;
ffa_ch11_tuning_a...   37    pragma Inline_Always(W_Not);
ffa_ch5_egypt.kv       38    
ffa_ch2_logicals.kv    39    -- Return 1 if N is odd; otherwise return 0.
ffa_ch2_logicals.kv    40    function W_OddP(N : in Word) return WBool;
ffa_ch11_tuning_a...   41    pragma Inline_Always(W_OddP);
ffa_ch2_logicals.kv    42    
ffa_ch2_logicals.kv    43    -- Return 1 if A is equal to B ; otherwise return 0.
ffa_ch2_logicals.kv    44    function W_EqP(A : in Word; B : in Word) return WBool;
ffa_ch11_tuning_a...   45    pragma Inline_Always(W_EqP);
ffa_ch2_logicals.kv    46    
ffa_ch16_miller_r...   47    -- Return 1 if A is less than B ; otherwise return 0.
ffa_ch16_miller_r...   48    function W_LtP(A : in Word; B : in Word) return WBool;
ffa_ch16_miller_r...   49    pragma Inline_Always(W_LtP);
ffa_ch16_miller_r...   50    
ffa_ch2_logicals.kv    51 end W_Pred;