anchor.diff:  function BigInteger.Add(const Other: BigInteger): PBigInteger;
   var
     SelfSize, OtherSize: Integer;
  -  Comparison: TValueSign;
  +  Comparison: Integer;
   begin
     Result := @Self;
     if Other.IsZero then
  
positive.code: {$ELSE !PUREPASCAL}
  {$IFDEF WIN32}
  asm
          PUSH    ESI
          PUSH    EDI
          PUSH    EBX
  
negative.code: // TODO: Better parsing. Recursive parsing (more or less the reverse of recursive routine for ToString) for normal
  //       bases, shifting for bases 2, 4 and 16. This means that normal bases are parsed BaseInfo.MaxDigits at a time.
  
  { TODO: Profiling showed that @DynArrayAsg, @DynArrayClear and @CopyRecord take up most of the time.
    Should I do my own memory management? If so, how?
  
      @DynArrayAsg:    40.46%
      @DynArrayClear:  18.34%
      @CopyRecord:     12.64%
  
    See BigIntSpeedTest.dpr
  }
  
  interface
  