2 * Copyright 2007 ZXing authors
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
17 package com.google.zxing.qrcode.detector;
19 import com.google.zxing.ResultPoint;
22 * <p>Encapsulates a finder pattern, which are the three square patterns found in
23 * the corners of QR Codes. It also encapsulates a count of similar finder patterns,
24 * as a convenience to the finder's bookkeeping.</p>
26 * @author srowen@google.com (Sean Owen)
28 public final class FinderPattern implements ResultPoint {
30 private final float posX;
31 private final float posY;
32 private final float estimatedModuleSize;
35 FinderPattern(float posX, float posY, float estimatedModuleSize) {
38 this.estimatedModuleSize = estimatedModuleSize;
50 float getEstimatedModuleSize() {
51 return estimatedModuleSize;
58 void incrementCount() {
63 * <p>Determines if this finder pattern "about equals" a finder pattern at the stated
64 * position and size -- meaning, it is at nearly the same center with nearly the same size.</p>
66 boolean aboutEquals(float moduleSize, float i, float j) {
67 return Math.abs(i - posY) <= moduleSize &&
68 Math.abs(j - posX) <= moduleSize &&
69 (Math.abs(moduleSize - estimatedModuleSize) <= 1.0f ||
70 Math.abs(moduleSize - estimatedModuleSize) / estimatedModuleSize <= 0.1f);