- //go down right
- for (int i = 1; i < max_size; i++){
- ResultPoint a = new ResultPoint(left, up+i);
- ResultPoint b = new ResultPoint(left+i, up);
- t = getBlackPointOnSegment(a, b);
- if (t != null){
- break;
- }
- }
-
- if (t == null){
- throw NotFoundException.getNotFoundInstance();
- }
-
- //go down left
- for (int i = 1; i < max_size; i++){
- ResultPoint a = new ResultPoint(right, up+i);
- ResultPoint b = new ResultPoint(right-i, up);
- x = getBlackPointOnSegment(a, b);
- if (x != null){
- break;
- }
+ final int max_size = right - left;
+
+ for (int i = 1; i < max_size; i++) {
+ z = getBlackPointOnSegment(left, down - i, left + i, down);
+ if (z != null) {
+ break;