1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101

/*
 * Copyright 2007 ZXing authors
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

use crate::{RXingResultPoint, ResultPoint};

/**
 * <p>Encapsulates a finder pattern, which are the three square patterns found in
 * the corners of QR Codes. It also encapsulates a count of similar finder patterns,
 * as a convenience to the finder's bookkeeping.</p>
 *
 * @author Sean Owen
 */
#[derive(Debug, Clone, Copy, PartialEq)]
pub struct FinderPattern {
    estimatedModuleSize: f32,
    count: usize,
    point: (f32, f32),
}

impl ResultPoint for FinderPattern {
    fn getX(&self) -> f32 {
        self.point.0
    }

    fn getY(&self) -> f32 {
        self.point.1
    }

    fn into_rxing_result_point(self) -> RXingResultPoint {
        RXingResultPoint {
            x: self.point.0,
            y: self.point.1,
        }
    }
}

impl FinderPattern {
    pub fn new(posX: f32, posY: f32, estimatedModuleSize: f32) -> Self {
        Self::private_new(posX, posY, estimatedModuleSize, 1)
    }

    fn private_new(posX: f32, posY: f32, estimatedModuleSize: f32, count: usize) -> Self {
        Self {
            estimatedModuleSize,
            count,
            point: (posX, posY),
        }
    }

    pub fn getEstimatedModuleSize(&self) -> f32 {
        self.estimatedModuleSize
    }

    pub fn getCount(&self) -> usize {
        self.count
    }

    /**
     * <p>Determines if this finder pattern "about equals" a finder pattern at the stated
     * position and size -- meaning, it is at nearly the same center with nearly the same size.</p>
     */
    pub fn aboutEquals(&self, moduleSize: f32, i: f32, j: f32) -> bool {
        if (i - self.getY()).abs() <= moduleSize && (j - self.getX()).abs() <= moduleSize {
            let moduleSizeDiff = (moduleSize - self.estimatedModuleSize).abs();
            return moduleSizeDiff <= 1.0 || moduleSizeDiff <= self.estimatedModuleSize;
        }
        false
    }

    /**
     * Combines this object's current estimate of a finder pattern position and module size
     * with a new estimate. It returns a new {@code FinderPattern} containing a weighted average
     * based on count.
     */
    pub fn combineEstimate(&self, i: f32, j: f32, newModuleSize: f32) -> FinderPattern {
        let combinedCount = self.count as f32 + 1.0;
        let combinedX = (self.count as f32 * self.getX() + j) / combinedCount;
        let combinedY = (self.count as f32 * self.getY() + i) / combinedCount;
        let combinedModuleSize =
            (self.count as f32 * self.estimatedModuleSize + newModuleSize) / combinedCount;
        FinderPattern::private_new(
            combinedX,
            combinedY,
            combinedModuleSize,
            combinedCount.round() as usize,
        )
    }
}