hedgewars: comparison hedgewars/uLandGenTemplateBased.pas

equal deleted inserted replaced

-:3388822b3914
+:0cb20aa8877a
 var i: LongInt;
 begin
 with Template do
 begin
 pa.Count:= BasePointsCount;
-for i:= 0 to LongInt(pred(pa.Count)) do
+for i:= 0 to pred(LongInt(pa.Count)) do
 begin
 pa.ar[i].x:= BasePoints^[i].x + LongInt(GetRandom(BasePoints^[i].w));
 if pa.ar[i].x <> NTPX then
 pa.ar[i].x:= pa.ar[i].x + ((LAND_WIDTH - Template.TemplateWidth) div 2);
 pa.ar[i].y:= BasePoints^[i].y + LongInt(GetRandom(BasePoints^[i].h)) + LAND_HEIGHT - LongInt(Template.TemplateHeight)
 if t2 > 0 then distR:= min(d, distR) else distL:= min(d, distL);
 end;
 // now go through all other segments
 fp:= pa.ar[0];
-for i:= 0 to pa.Count - 2 do
+for i:= 0 to LongInt(pa.Count) - 2 do
 if pa.ar[i].x = NTPX then
 fp:= pa.ar[i + 1]
 else if (i <> si) then
 begin
 p4:= pa.ar[i + 1];
 end;
 end;
 end;
 // go through all points, including fill points
-for i:= 0 to Pred(pa.Count + fillPointsCount) do
+for i:= 0 to Pred(LongInt(pa.Count + fillPointsCount)) do
 // if this point isn't on current segment
 if (si <> i) and (i <> si + 1) and (pa.ar[i].x <> NTPX) then
 begin
 // also check intersection with rays through pa.ar[i] if this point is good
 t1:= (p1.x - pa.ar[i].x) * b - a * (p1.y - pa.ar[i].y);
 begin
 newPoint.x:= 0;
 newPoint.y:= 0;
 i:= 0;
-while i < pa.Count - 1 do
+while i < LongInt(pa.Count) - 1 do
 begin
 FindPoint(i, fillPointsCount, newPoint, pa);
 if (newPoint.x <> pa.ar[i].x) or (newPoint.y <> pa.ar[i].y) then
 begin