diff --git a/src/common/detector/MonochromeRectangleDetector.rs b/src/common/detector/MonochromeRectangleDetector.rs
index 7a0eec9..98134ee 100644
--- a/src/common/detector/MonochromeRectangleDetector.rs
+++ b/src/common/detector/MonochromeRectangleDetector.rs
@@ -15,9 +15,8 @@
  */
 
 //package com.google.zxing.common.detector;
-use crate::{NotFoundException,RXingResultPoint};
 use crate::common::BitMatrix;
-
+use crate::{NotFoundException, RXingResultPoint};
 
 /**
  * <p>A somewhat generic detector that looks for a barcode-like rectangular region within an image.
@@ -27,190 +26,277 @@ use crate::common::BitMatrix;
  * @author Sean Owen
  * @deprecated without replacement since 3.3.0
  */
-@Deprecated
-public final class MonochromeRectangleDetector {
+#[deprecated]
+pub struct MonochromeRectangleDetector {
+    MAX_MODULES: i32,
 
-  private static final int MAX_MODULES = 32;
+    image: BitMatrix,
+}
 
-  private final BitMatrix image;
-
-  public MonochromeRectangleDetector(BitMatrix image) {
-    this.image = image;
-  }
-
-  /**
-   * <p>Detects a rectangular region of black and white -- mostly black -- with a region of mostly
-   * white, in an image.</p>
-   *
-   * @return {@link RXingResultPoint}[] describing the corners of the rectangular region. The first and
-   *  last points are opposed on the diagonal, as are the second and third. The first point will be
-   *  the topmost point and the last, the bottommost. The second point will be leftmost and the
-   *  third, the rightmost
-   * @throws NotFoundException if no Data Matrix Code can be found
-   */
-  public RXingResultPoint[] detect() throws NotFoundException {
-    int height = image.getHeight();
-    int width = image.getWidth();
-    int halfHeight = height / 2;
-    int halfWidth = width / 2;
-    int deltaY = Math.max(1, height / (MAX_MODULES * 8));
-    int deltaX = Math.max(1, width / (MAX_MODULES * 8));
-
-    int top = 0;
-    int bottom = height;
-    int left = 0;
-    int right = width;
-    RXingResultPoint pointA = findCornerFromCenter(halfWidth, 0, left, right,
-        halfHeight, -deltaY, top, bottom, halfWidth / 2);
-    top = (int) pointA.getY() - 1;
-    RXingResultPoint pointB = findCornerFromCenter(halfWidth, -deltaX, left, right,
-        halfHeight, 0, top, bottom, halfHeight / 2);
-    left = (int) pointB.getX() - 1;
-    RXingResultPoint pointC = findCornerFromCenter(halfWidth, deltaX, left, right,
-        halfHeight, 0, top, bottom, halfHeight / 2);
-    right = (int) pointC.getX() + 1;
-    RXingResultPoint pointD = findCornerFromCenter(halfWidth, 0, left, right,
-        halfHeight, deltaY, top, bottom, halfWidth / 2);
-    bottom = (int) pointD.getY() + 1;
-
-    // Go try to find point A again with better information -- might have been off at first.
-    pointA = findCornerFromCenter(halfWidth, 0, left, right,
-        halfHeight, -deltaY, top, bottom, halfWidth / 4);
-
-    return new RXingResultPoint[] { pointA, pointB, pointC, pointD };
-  }
-
-  /**
-   * Attempts to locate a corner of the barcode by scanning up, down, left or right from a center
-   * point which should be within the barcode.
-   *
-   * @param centerX center's x component (horizontal)
-   * @param deltaX same as deltaY but change in x per step instead
-   * @param left minimum value of x
-   * @param right maximum value of x
-   * @param centerY center's y component (vertical)
-   * @param deltaY change in y per step. If scanning up this is negative; down, positive;
-   *  left or right, 0
-   * @param top minimum value of y to search through (meaningless when di == 0)
-   * @param bottom maximum value of y
-   * @param maxWhiteRun maximum run of white pixels that can still be considered to be within
-   *  the barcode
-   * @return a {@link RXingResultPoint} encapsulating the corner that was found
-   * @throws NotFoundException if such a point cannot be found
-   */
-  private RXingResultPoint findCornerFromCenter(int centerX,
-                                           int deltaX,
-                                           int left,
-                                           int right,
-                                           int centerY,
-                                           int deltaY,
-                                           int top,
-                                           int bottom,
-                                           int maxWhiteRun) throws NotFoundException {
-    int[] lastRange = null;
-    for (int y = centerY, x = centerX;
-         y < bottom && y >= top && x < right && x >= left;
-         y += deltaY, x += deltaX) {
-      int[] range;
-      if (deltaX == 0) {
-        // horizontal slices, up and down
-        range = blackWhiteRange(y, maxWhiteRun, left, right, true);
-      } else {
-        // vertical slices, left and right
-        range = blackWhiteRange(x, maxWhiteRun, top, bottom, false);
-      }
-      if (range == null) {
-        if (lastRange == null) {
-          throw NotFoundException.getNotFoundInstance();
+impl MonochromeRectangleDetector {
+    pub fn new(image: &BitMatrix) -> Self {
+        Self {
+            MAX_MODULES: 32,
+            image: image,
         }
-        // lastRange was found
-        if (deltaX == 0) {
-          int lastY = y - deltaY;
-          if (lastRange[0] < centerX) {
-            if (lastRange[1] > centerX) {
-              // straddle, choose one or the other based on direction
-              return new RXingResultPoint(lastRange[deltaY > 0 ? 0 : 1], lastY);
+    }
+
+    /**
+     * <p>Detects a rectangular region of black and white -- mostly black -- with a region of mostly
+     * white, in an image.</p>
+     *
+     * @return {@link RXingResultPoint}[] describing the corners of the rectangular region. The first and
+     *  last points are opposed on the diagonal, as are the second and third. The first point will be
+     *  the topmost point and the last, the bottommost. The second point will be leftmost and the
+     *  third, the rightmost
+     * @throws NotFoundException if no Data Matrix Code can be found
+     */
+    pub fn detect() -> Result<Vec<RXingResultPoint>, NotFoundException> {
+        let height = image.getHeight();
+        let width = image.getWidth();
+        let halfHeight = height / 2;
+        let halfWidth = width / 2;
+        let deltaY = Math.max(1, height / (MAX_MODULES * 8));
+        let deltaX = Math.max(1, width / (MAX_MODULES * 8));
+
+        let top = 0;
+        let bottom = height;
+        let left = 0;
+        let right = width;
+        let pointA = findCornerFromCenter(
+            halfWidth,
+            0,
+            left,
+            right,
+            halfHeight,
+            -deltaY,
+            top,
+            bottom,
+            halfWidth / 2,
+        );
+        top = pointA.getY() - 1;
+        let pointB = findCornerFromCenter(
+            halfWidth,
+            -deltaX,
+            left,
+            right,
+            halfHeight,
+            0,
+            top,
+            bottom,
+            halfHeight / 2,
+        );
+        left = pointB.getX() - 1;
+        let pointC = findCornerFromCenter(
+            halfWidth,
+            deltaX,
+            left,
+            right,
+            halfHeight,
+            0,
+            top,
+            bottom,
+            halfHeight / 2,
+        );
+        right = pointC.getX() + 1;
+        let pointD = findCornerFromCenter(
+            halfWidth,
+            0,
+            left,
+            right,
+            halfHeight,
+            deltaY,
+            top,
+            bottom,
+            halfWidth / 2,
+        );
+        bottom = pointD.getY() + 1;
+
+        // Go try to find point A again with better information -- might have been off at first.
+        pointA = findCornerFromCenter(
+            halfWidth,
+            0,
+            left,
+            right,
+            halfHeight,
+            -deltaY,
+            top,
+            bottom,
+            halfWidth / 4,
+        );
+
+        return Vec!([pointA, pointB, pointC, pointD]);
+    }
+
+    /**
+     * Attempts to locate a corner of the barcode by scanning up, down, left or right from a center
+     * point which should be within the barcode.
+     *
+     * @param centerX center's x component (horizontal)
+     * @param deltaX same as deltaY but change in x per step instead
+     * @param left minimum value of x
+     * @param right maximum value of x
+     * @param centerY center's y component (vertical)
+     * @param deltaY change in y per step. If scanning up this is negative; down, positive;
+     *  left or right, 0
+     * @param top minimum value of y to search through (meaningless when di == 0)
+     * @param bottom maximum value of y
+     * @param maxWhiteRun maximum run of white pixels that can still be considered to be within
+     *  the barcode
+     * @return a {@link RXingResultPoint} encapsulating the corner that was found
+     * @throws NotFoundException if such a point cannot be found
+     */
+    fn findCornerFromCenter(
+        centerX: i32,
+        deltaX: i32,
+        left: i32,
+        right: i32,
+        centerY: i32,
+        deltaY: i32,
+        top: i32,
+        bottom: i32,
+        maxWhiteRun: i32,
+    ) -> Result<RXingResultPoint, NotFoundException> {
+        lastRange = null;
+        let y: i32 = centerY;
+        let x: i32 = centerX;
+        while (y < bottom && y >= top && x < right && x >= left) {
+            let range: Vec::new();
+            if (deltaX == 0) {
+                // horizontal slices, up and down
+                range = blackWhiteRange(y, maxWhiteRun, left, right, true);
+            } else {
+                // vertical slices, left and right
+                range = blackWhiteRange(x, maxWhiteRun, top, bottom, false);
             }
-            return new RXingResultPoint(lastRange[0], lastY);
-          } else {
-            return new RXingResultPoint(lastRange[1], lastY);
-          }
+            if (range == null) {
+                if (lastRange == null) {
+                    return Err(NotFoundException.getNotFoundInstance());
+                }
+                // lastRange was found
+                if (deltaX == 0) {
+                    let lastY = y - deltaY;
+                    if (lastRange[0] < centerX) {
+                        if (lastRange[1] > centerX) {
+                            // straddle, choose one or the other based on direction
+                            return RXingResultPoint::new(
+                                lastRange[if deltaY > 0 { 0 } else { 1 }],
+                                lastY,
+                            );
+                        }
+                        return RXingResultPoint::new(lastRange[0], lastY);
+                    } else {
+                        return RXingResultPoint::new(lastRange[1], lastY);
+                    }
+                } else {
+                    let lastX = x - deltaX;
+                    if (lastRange[0] < centerY) {
+                        if (lastRange[1] > centerY) {
+                            return RXingResultPoint::new(
+                                lastX,
+                                lastRange[if deltaX < 0 { 0 } else { 1 }],
+                            );
+                        }
+                        return RXingResultPoint::new(lastX, lastRange[0]);
+                    } else {
+                        return RXingResultPoint::new(lastX, lastRange[1]);
+                    }
+                }
+            }
+            lastRange = range;
+            y += deltaY;
+            x += deltaX
+        }
+        return Err(NotFoundException.getNotFoundInstance());
+    }
+
+    /**
+     * Computes the start and end of a region of pixels, either horizontally or vertically, that could
+     * be part of a Data Matrix barcode.
+     *
+     * @param fixedDimension if scanning horizontally, this is the row (the fixed vertical location)
+     *  where we are scanning. If scanning vertically it's the column, the fixed horizontal location
+     * @param maxWhiteRun largest run of white pixels that can still be considered part of the
+     *  barcode region
+     * @param minDim minimum pixel location, horizontally or vertically, to consider
+     * @param maxDim maximum pixel location, horizontally or vertically, to consider
+     * @param horizontal if true, we're scanning left-right, instead of up-down
+     * @return int[] with start and end of found range, or null if no such range is found
+     *  (e.g. only white was found)
+     */
+    fn blackWhiteRange(
+        fixedDimension: i32,
+        maxWhiteRun: i32,
+        minDim: i32,
+        maxDim: i32,
+        horizontal: bool,
+    ) -> Option<Vec<i32>> {
+        let center = (minDim + maxDim) / 2;
+
+        // Scan left/up first
+        let start = center;
+        while (start >= minDim) {
+            if (if horizontal {
+                image.get(start, fixedDimension)
+            } else {
+                image.get(fixedDimension, start)
+            }) {
+                start = start - 1;
+            } else {
+                let whiteRunStart = start;
+                start = start - 1;
+                while start >= minDim
+                    && !(if horizontal {
+                        image.get(start, fixedDimension);
+                    } else {
+                        image.get(fixedDimension, start);
+                    })
+                {
+                    start = start - 1;
+                }
+                let whiteRunSize = whiteRunStart - start;
+                if (start < minDim || whiteRunSize > maxWhiteRun) {
+                    start = whiteRunStart;
+                    break;
+                }
+            }
+        }
+        start = start + 1;
+
+        // Then try right/down
+        let end = center;
+        while (end < maxDim) {
+            if (if horizontal {
+                image.get(end, fixedDimension)
+            } else {
+                image.get(fixedDimension, end)
+            }) {
+                end = end + 1;
+            } else {
+                let whiteRunStart = end;
+                end = end + 1;
+                while end < maxDim
+                    && !(if horizontal {
+                        image.get(end, fixedDimension)
+                    } else {
+                        image.get(fixedDimension, end)
+                    })
+                {
+                    end = end + 1;
+                }
+                let whiteRunSize = end - whiteRunStart;
+                if (end >= maxDim || whiteRunSize > maxWhiteRun) {
+                    end = whiteRunStart;
+                    break;
+                }
+            }
+        }
+        end = end - 1;
+
+        return if end > start {
+            Some(Vec! {start, end})
         } else {
-          int lastX = x - deltaX;
-          if (lastRange[0] < centerY) {
-            if (lastRange[1] > centerY) {
-              return new RXingResultPoint(lastX, lastRange[deltaX < 0 ? 0 : 1]);
-            }
-            return new RXingResultPoint(lastX, lastRange[0]);
-          } else {
-            return new RXingResultPoint(lastX, lastRange[1]);
-          }
-        }
-      }
-      lastRange = range;
+            None
+        };
     }
-    throw NotFoundException.getNotFoundInstance();
-  }
-
-  /**
-   * Computes the start and end of a region of pixels, either horizontally or vertically, that could
-   * be part of a Data Matrix barcode.
-   *
-   * @param fixedDimension if scanning horizontally, this is the row (the fixed vertical location)
-   *  where we are scanning. If scanning vertically it's the column, the fixed horizontal location
-   * @param maxWhiteRun largest run of white pixels that can still be considered part of the
-   *  barcode region
-   * @param minDim minimum pixel location, horizontally or vertically, to consider
-   * @param maxDim maximum pixel location, horizontally or vertically, to consider
-   * @param horizontal if true, we're scanning left-right, instead of up-down
-   * @return int[] with start and end of found range, or null if no such range is found
-   *  (e.g. only white was found)
-   */
-  private int[] blackWhiteRange(int fixedDimension, int maxWhiteRun, int minDim, int maxDim, boolean horizontal) {
-
-    int center = (minDim + maxDim) / 2;
-
-    // Scan left/up first
-    int start = center;
-    while (start >= minDim) {
-      if (horizontal ? image.get(start, fixedDimension) : image.get(fixedDimension, start)) {
-        start--;
-      } else {
-        int whiteRunStart = start;
-        do {
-          start--;
-        } while (start >= minDim && !(horizontal ? image.get(start, fixedDimension) :
-            image.get(fixedDimension, start)));
-        int whiteRunSize = whiteRunStart - start;
-        if (start < minDim || whiteRunSize > maxWhiteRun) {
-          start = whiteRunStart;
-          break;
-        }
-      }
-    }
-    start++;
-
-    // Then try right/down
-    int end = center;
-    while (end < maxDim) {
-      if (horizontal ? image.get(end, fixedDimension) : image.get(fixedDimension, end)) {
-        end++;
-      } else {
-        int whiteRunStart = end;
-        do {
-          end++;
-        } while (end < maxDim && !(horizontal ? image.get(end, fixedDimension) :
-            image.get(fixedDimension, end)));
-        int whiteRunSize = end - whiteRunStart;
-        if (end >= maxDim || whiteRunSize > maxWhiteRun) {
-          end = whiteRunStart;
-          break;
-        }
-      }
-    }
-    end--;
-
-    return end > start ? new int[]{start, end} : null;
-  }
-
-}
\ No newline at end of file
+}
diff --git a/src/common/detector/WhiteRectangleDetector.java b/src/common/detector/WhiteRectangleDetector.rs
similarity index 57%
rename from src/common/detector/WhiteRectangleDetector.java
rename to src/common/detector/WhiteRectangleDetector.rs
index eec9fe2..3d7a51c 100644
--- a/src/common/detector/WhiteRectangleDetector.java
+++ b/src/common/detector/WhiteRectangleDetector.rs
@@ -14,11 +14,10 @@
  * limitations under the License.
  */
 
-package com.google.zxing.common.detector;
+//package com.google.zxing.common.detector;
 
-import com.google.zxing.NotFoundException;
-import com.google.zxing.RXingResultPoint;
-import com.google.zxing.common.BitMatrix;
+use crate::{NotFoundException,RXingResultPoint};
+use crate::common::BitMatrix;
 
 /**
  * <p>
@@ -30,21 +29,23 @@ import com.google.zxing.common.BitMatrix;
  *
  * @author David Olivier
  */
-public final class WhiteRectangleDetector {
+const INIT_SIZE:i32 = 10;
+const CORR:i32 = 1;
+pub struct WhiteRectangleDetector {
 
-  private static final int INIT_SIZE = 10;
-  private static final int CORR = 1;
+  image: BitMatrix,
+   height: i32,
+  width: i32,
+  leftInit: i32,
+  rightInit: i32,
+  downInit: i32,
+  upInit: i32,
+}
 
-  private final BitMatrix image;
-  private final int height;
-  private final int width;
-  private final int leftInit;
-  private final int rightInit;
-  private final int downInit;
-  private final int upInit;
+impl WhiteRectangleDetector {
 
-  public WhiteRectangleDetector(BitMatrix image) throws NotFoundException {
-    this(image, INIT_SIZE, image.getWidth() / 2, image.getHeight() / 2);
+  pub fn new_from_image(image:&BitMatrix) -> Result<Self,NotFoundException> {
+    Self::new(image, INIT_SIZE, image.getWidth() / 2, image.getHeight() / 2);
   }
 
   /**
@@ -54,18 +55,21 @@ public final class WhiteRectangleDetector {
    * @param y y position of search center
    * @throws NotFoundException if image is too small to accommodate {@code initSize}
    */
-  public WhiteRectangleDetector(BitMatrix image, int initSize, int x, int y) throws NotFoundException {
-    this.image = image;
-    height = image.getHeight();
-    width = image.getWidth();
-    int halfsize = initSize / 2;
-    leftInit = x - halfsize;
-    rightInit = x + halfsize;
-    upInit = y - halfsize;
-    downInit = y + halfsize;
+  pub fn new( image:&BitMatrix,  initSize:i32,  x:i32,  y:i32) -> Result<Self, NotFoundException> {
+    let new_wrd : Self;
+    new_wrd.image = image;
+    new_wrd.height = image.getHeight();
+    new_wrd.width = image.getWidth();
+    let halfsize = initSize / 2;
+    new_wrd.leftInit = x - halfsize;
+    new_wrd.rightInit = x + halfsize;
+    new_wrd.upInit = y - halfsize;
+    new_wrd.downInit = y + halfsize;
     if (upInit < 0 || leftInit < 0 || downInit >= height || rightInit >= width) {
-      throw NotFoundException.getNotFoundInstance();
+      return Err( NotFoundException.getNotFoundInstance());
     }
+    
+    Ok(new_wrd)
   }
 
   /**
@@ -82,19 +86,19 @@ public final class WhiteRectangleDetector {
    *         leftmost and the third, the rightmost
    * @throws NotFoundException if no Data Matrix Code can be found
    */
-  public RXingResultPoint[] detect() throws NotFoundException {
+  pub fn  detect() -> Result<Vec<RXingResultPoint>, NotFoundException> {
 
-    int left = leftInit;
-    int right = rightInit;
-    int up = upInit;
-    int down = downInit;
-    boolean sizeExceeded = false;
-    boolean aBlackPointFoundOnBorder = true;
+    let left :i32= leftInit;
+    let right:i32 = rightInit;
+    let up:i32 = upInit;
+    let down:i32 = downInit;
+    let sizeExceeded = false;
+    let aBlackPointFoundOnBorder = true;
 
-    boolean atLeastOneBlackPointFoundOnRight = false;
-    boolean atLeastOneBlackPointFoundOnBottom = false;
-    boolean atLeastOneBlackPointFoundOnLeft = false;
-    boolean atLeastOneBlackPointFoundOnTop = false;
+    let atLeastOneBlackPointFoundOnRight = false;
+    let atLeastOneBlackPointFoundOnBottom = false;
+    let atLeastOneBlackPointFoundOnLeft = false;
+    let atLeastOneBlackPointFoundOnTop = false;
 
     while (aBlackPointFoundOnBorder) {
 
@@ -103,15 +107,15 @@ public final class WhiteRectangleDetector {
       // .....
       // .   |
       // .....
-      boolean rightBorderNotWhite = true;
+      let rightBorderNotWhite = true;
       while ((rightBorderNotWhite || !atLeastOneBlackPointFoundOnRight) && right < width) {
         rightBorderNotWhite = containsBlackPoint(up, down, right, false);
         if (rightBorderNotWhite) {
-          right++;
+          right += 1;
           aBlackPointFoundOnBorder = true;
           atLeastOneBlackPointFoundOnRight = true;
         } else if (!atLeastOneBlackPointFoundOnRight) {
-          right++;
+          right+=1;
         }
       }
 
@@ -123,15 +127,15 @@ public final class WhiteRectangleDetector {
       // .....
       // .   .
       // .___.
-      boolean bottomBorderNotWhite = true;
+      let bottomBorderNotWhite = true;
       while ((bottomBorderNotWhite || !atLeastOneBlackPointFoundOnBottom) && down < height) {
         bottomBorderNotWhite = containsBlackPoint(left, right, down, true);
         if (bottomBorderNotWhite) {
-          down++;
+          down+=1;
           aBlackPointFoundOnBorder = true;
           atLeastOneBlackPointFoundOnBottom = true;
         } else if (!atLeastOneBlackPointFoundOnBottom) {
-          down++;
+          down+=1;
         }
       }
 
@@ -143,15 +147,15 @@ public final class WhiteRectangleDetector {
       // .....
       // |   .
       // .....
-      boolean leftBorderNotWhite = true;
+      let leftBorderNotWhite = true;
       while ((leftBorderNotWhite || !atLeastOneBlackPointFoundOnLeft) && left >= 0) {
         leftBorderNotWhite = containsBlackPoint(up, down, left, false);
         if (leftBorderNotWhite) {
-          left--;
+          left-=1;
           aBlackPointFoundOnBorder = true;
           atLeastOneBlackPointFoundOnLeft = true;
         } else if (!atLeastOneBlackPointFoundOnLeft) {
-          left--;
+          left-=1;
         }
       }
 
@@ -163,15 +167,15 @@ public final class WhiteRectangleDetector {
       // .___.
       // .   .
       // .....
-      boolean topBorderNotWhite = true;
+      let topBorderNotWhite = true;
       while ((topBorderNotWhite || !atLeastOneBlackPointFoundOnTop) && up >= 0) {
         topBorderNotWhite = containsBlackPoint(left, right, up, true);
         if (topBorderNotWhite) {
-          up--;
+          up-=1;
           aBlackPointFoundOnBorder = true;
           atLeastOneBlackPointFoundOnTop = true;
         } else if (!atLeastOneBlackPointFoundOnTop) {
-          up--;
+          up-=1;
         }
       }
 
@@ -184,67 +188,79 @@ public final class WhiteRectangleDetector {
 
     if (!sizeExceeded) {
 
-      int maxSize = right - left;
+      let maxSize = right - left;
 
-      RXingResultPoint z = null;
-      for (int i = 1; z == null && i < maxSize; i++) {
+      let mut z: Option<RXingResultPoint> = None;
+      let mut i = 1;
+      while z.is_none() && i < maxSize {
+      //for (int i = 1; z == null && i < maxSize; i++) {
         z = getBlackPointOnSegment(left, down - i, left + i, down);
+        i+=1;
       }
 
-      if (z == null) {
-        throw NotFoundException.getNotFoundInstance();
+      if (z .is_none()) {
+        return Err( NotFoundException.getNotFoundInstance());
       }
 
-      RXingResultPoint t = null;
+      let mut  t : Option<RXingResultPoint> = None;
       //go down right
-      for (int i = 1; t == null && i < maxSize; i++) {
+      let mut i = 1;
+      while t.is_none() && i < maxSize {
+      //for (int i = 1; t == null && i < maxSize; i++) {
         t = getBlackPointOnSegment(left, up + i, left + i, up);
+        i+=1;
       }
 
-      if (t == null) {
-        throw NotFoundException.getNotFoundInstance();
+      if (t .is_none()) {
+        return Err( NotFoundException.getNotFoundInstance());
       }
 
-      RXingResultPoint x = null;
+      let mut  x : Option<RXingResultPoint> = None;
       //go down left
-      for (int i = 1; x == null && i < maxSize; i++) {
+      let mut i = 1;
+      while x.is_none() && i < maxSize {
+      //for (int i = 1; x == null && i < maxSize; i++) {
         x = getBlackPointOnSegment(right, up + i, right - i, up);
+        i += 1;
       }
 
-      if (x == null) {
-        throw NotFoundException.getNotFoundInstance();
+      if (x .is_none()) {
+        return Err( NotFoundException.getNotFoundInstance());
       }
 
-      RXingResultPoint y = null;
+      let mut  y : Option<RXingResultPoint> = None;
       //go up left
-      for (int i = 1; y == null && i < maxSize; i++) {
+      let mut i = 1;
+      while y.is_none() && i < maxSize {
+      //for (int i = 1; y == null && i < maxSize; i++) {
         y = getBlackPointOnSegment(right, down - i, right - i, down);
+        i+=1;
       }
 
-      if (y == null) {
-        throw NotFoundException.getNotFoundInstance();
+      if (y .is_none()) {
+        return Err( NotFoundException.getNotFoundInstance());
       }
 
       return centerEdges(y, z, x, t);
 
     } else {
-      throw NotFoundException.getNotFoundInstance();
+      return Err( NotFoundException.getNotFoundInstance());
     }
   }
 
-  private RXingResultPoint getBlackPointOnSegment(float aX, float aY, float bX, float bY) {
-    int dist = MathUtils.round(MathUtils.distance(aX, aY, bX, bY));
-    float xStep = (bX - aX) / dist;
-    float yStep = (bY - aY) / dist;
+  fn  getBlackPointOnSegment( aX:f32,  aY:f32,  bX:f32,  bY:f32) -> Option<RXingResultPoint> {
+    let dist = MathUtils.round(MathUtils.distance(aX, aY, bX, bY));
+    let xStep :f32= (bX - aX) / dist;
+    let yStep:f32 = (bY - aY) / dist;
 
-    for (int i = 0; i < dist; i++) {
-      int x = MathUtils.round(aX + i * xStep);
-      int y = MathUtils.round(aY + i * yStep);
+    for i in 0..dist {
+      let x = MathUtils.round(aX + i * xStep);
+      let y = MathUtils.round(aY + i * yStep);
       if (image.get(x, y)) {
-        return new RXingResultPoint(x, y);
+        return  RXingResultPoint::new(x, y);
       }
     }
-    return null;
+    return None;
   }
 
   /**
@@ -260,8 +276,8 @@ public final class WhiteRectangleDetector {
    *         point and the last, the bottommost. The second point will be
    *         leftmost and the third, the rightmost
    */
-  private RXingResultPoint[] centerEdges(RXingResultPoint y, RXingResultPoint z,
-                                    RXingResultPoint x, RXingResultPoint t) {
+  fn  centerEdges( y:&RXingResultPoint,  z:&RXingResultPoint,
+                                     x:&RXingResultPoint,  t:&RXingResultPoint) -> Vec<RXingResultPoint> {
 
     //
     //       t            t
@@ -270,27 +286,27 @@ public final class WhiteRectangleDetector {
     //   y                    y
     //
 
-    float yi = y.getX();
-    float yj = y.getY();
-    float zi = z.getX();
-    float zj = z.getY();
-    float xi = x.getX();
-    float xj = x.getY();
-    float ti = t.getX();
-    float tj = t.getY();
+    let yi = y.getX();
+    let yj = y.getY();
+    let zi = z.getX();
+    let zj = z.getY();
+    let xi = x.getX();
+    let xj = x.getY();
+    let ti = t.getX();
+    let tj = t.getY();
 
     if (yi < width / 2.0f) {
-      return new RXingResultPoint[]{
-          new RXingResultPoint(ti - CORR, tj + CORR),
-          new RXingResultPoint(zi + CORR, zj + CORR),
-          new RXingResultPoint(xi - CORR, xj - CORR),
-          new RXingResultPoint(yi + CORR, yj - CORR)};
+      return Vec!
+          [ RXingResultPoint::new(ti - CORR, tj + CORR),
+           RXingResultPoint::new(zi + CORR, zj + CORR),
+           RXingResultPoint::new(xi - CORR, xj - CORR),
+           RXingResultPoint::new(yi + CORR, yj - CORR)];
     } else {
-      return new RXingResultPoint[]{
-          new RXingResultPoint(ti + CORR, tj + CORR),
-          new RXingResultPoint(zi + CORR, zj - CORR),
-          new RXingResultPoint(xi - CORR, xj + CORR),
-          new RXingResultPoint(yi - CORR, yj - CORR)};
+      return Vec![
+           RXingResultPoint::new(ti + CORR, tj + CORR),
+           RXingResultPoint::new(zi + CORR, zj - CORR),
+           RXingResultPoint::new(xi - CORR, xj + CORR),
+           RXingResultPoint::new(yi - CORR, yj - CORR)];
     }
   }
 
@@ -303,16 +319,18 @@ public final class WhiteRectangleDetector {
    * @param horizontal set to true if scan must be horizontal, false if vertical
    * @return true if a black point has been found, else false.
    */
-  private boolean containsBlackPoint(int a, int b, int fixed, boolean horizontal) {
+  fn  containsBlackPoint( a:i32,  b:i32,  fixed:i32,  horizontal:bool) -> bool {
 
     if (horizontal) {
-      for (int x = a; x <= b; x++) {
+      
+      for x in a..=b {
         if (image.get(x, fixed)) {
           return true;
         }
       }
     } else {
-      for (int y = a; y <= b; y++) {
+      
+      for y in a..=b {
         if (image.get(fixed, y)) {
           return true;
         }