anchor.diff:  function TKMWeightedPointList.GetWeightedRandom(out Point: TKMPoint): Boolean;
   var
     I: Integer;
  -  WeightsSum, Rnd: Extended;
  +  weightsSum, rnd: Extended;
   begin
     Result := False;
   
     if Count = 0 then
       Exit;
   
  -  WeightsSum := 0;
  +  weightsSum := 0;
     for I := 0 to fCount - 1 do
  -    WeightsSum := WeightsSum + fWeight[I];
  -
  -  Rnd := KaMRandomS1(WeightsSum, 'TKMPointCenteredList.GetWeightedRandom');
  +    weightsSum := weightsSum + fWeight[I];
  +
  +  rnd := KaMRandomS1(weightsSum, 'TKMPointCenteredList.GetWeightedRandom');
   
     for I := 0 to fCount - 1 do
     begin
  -    if Rnd < fWeight[I] then
  +    if rnd < fWeight[I] then
       begin
         Point := fItems[I];
         Exit(True);
       end;
  -    Rnd := Rnd - fWeight[I];
  +    rnd := rnd - fWeight[I];
     end;
     Assert(False, 'Error getting weighted random');
   end;
  
positive.code:   // Quicksort implementation (because there is not specified count of elements buble does not give any sense)
    procedure QuickSort(MinIdx,MaxIdx: Integer);
    var
      I,K,X: Integer;
    begin
      I := MinIdx;
      K := MaxIdx;
  
negative.code: 
    fCount := K;
    SetLength(fItems, fCount);
    Move(tmp[0], fItems[0], SizeOf(fItems[0]) * fCount);
  end;
  
  
  function TKMPointList.GetBounds(out Bounds: TKMRect): Boolean;
  var
    I: Integer;
  begin
    Result := fCount <> 0;
  
  