186,7 → 186,11 |
for(r = 0; r < bikes.count(); r++) |
{ |
bike = bikes[r]; |
for(j = 0; j < bike->linePoints.count() - 1; j++) |
int forsubtract = 1; |
if(bike->name == name){ |
forsubtract = 3; |
} |
for(j = 0; j < bike->linePoints.count() - forsubtract; j++) |
{ |
int jx = bike->linePoints[j].x(); |
int j1x = bike->linePoints[j+1].x(); |
196,22 → 200,7 |
int i1x = linePoints[i].x(); |
int iy = linePoints[i-1].y(); |
int i1y = linePoints[i].y(); |
if(jx > j1x){ |
jx += 1; |
j1x -= 1; |
} |
else if(j1x > jx){ |
jx -= 1; |
j1x += 1; |
} |
if(jy > j1y){ |
jy += 1; |
j1y -= 1; |
} |
else if(j1y > jy){ |
jy += 1; |
j1y -= 1; |
} |
|
if(angle == 0){ |
iy += 1; |
i1y -= 1; |