(69 . 6)(69 . 7)
      
   end FZ_IDiv;
   
   
   -- Exactly same thing as IDiv, but keep only the Quotient
   procedure FZ_Div(Dividend  : in  FZ;
                    Divisor   : in  FZ;
(79 . 6)(80 . 7)
      FZ_IDiv(Dividend, Divisor, Quotient, Remainder);
   end FZ_Div;
   
   
   -- Modulus. Permits the asymmetric Dividend and Divisor in FZ_Mod_Exp.
   procedure FZ_Mod(Dividend  : in FZ;
                    Divisor   : in FZ;
(99 . 48)(101 . 43)
      -- Performs Restoring Division on a given segment of Dividend:Divisor
      procedure Slice(Index : Dividend_Index;
                      Cut   : Divisor_Cuts) is
         
         -- Borrow, from comparator
         C   : WBool;
         
         -- Left-Shift Overflow
         LsO : WBool;
         
         -- Current cut of Remainder register
         Rs  : FZ renames R(1 .. Cut);
         
         -- Current cut of Divisor
         Ds  : FZ renames Divisor(1 .. Cut);
         
         -- Current word of Dividend, starting from the highest
         W   : Word  := Dividend(Dividend'Last + 1 - Index);
         
      begin
         
         declare
            
            -- Borrow, from comparator
            C   : WBool;
            
            -- Left-Shift Overflow
            LsO : WBool;
            
            -- Current cut of Remainder register
            Rs  : FZ renames R(1 .. Cut);
         -- For each bit in the current Dividend word:
         for b in 1 .. Bitness loop
            
            -- Current cut of Divisor
            Ds  : FZ renames Divisor(1 .. Cut);
            -- Send top bit of current Dividend word to the bottom of W
            W := Rotate_Left(W, 1);
            
            -- Current word of Dividend, starting from the highest
            W   : Word  := Dividend(Dividend'Last + 1 - Index);
            -- Advance Rs, shifting in the current Dividend bit
            FZ_ShiftLeft_O_I(N => Rs, ShiftedN => Rs, Count => 1,
                             OF_In => W and 1,
                             Overflow => LsO);
            
         begin
            -- Subtract Divisor-Cut from R-Cut; Underflow goes into C
            FZ_Sub(X => Rs, Y => Ds, Difference => Rs, Underflow => C);
            
            -- For each bit in the current Dividend word:
            for b in 1 .. Bitness loop
               
               -- Send top bit of current Dividend word to the bottom of W
               W := Rotate_Left(W, 1);
               
               -- Advance Rs, shifting in the current Dividend bit
               FZ_ShiftLeft_O_I(N => Rs, ShiftedN => Rs, Count => 1,
                                OF_In => W and 1,
                                Overflow => LsO);
               
               -- Subtract Divisor-Cut from R-Cut; Underflow goes into C
               FZ_Sub(X => Rs, Y => Ds, Difference => Rs, Underflow => C);
               
               -- If C=1, subtraction underflowed, and we must undo it:
               FZ_Add_Gated(X => Rs, Y => Ds, Sum => Rs,
                            Gate => C and W_Not(LsO));
               
            end loop;
            -- If C=1, subtraction underflowed, and we must undo it:
            FZ_Add_Gated(X => Rs, Y => Ds, Sum => Rs,
                         Gate => C and W_Not(LsO));
            
         end;
         end loop;
         
      end Slice;