Package com.google.zxing.qrcode.encoder
Class MaskUtil
java.lang.Object
com.google.zxing.qrcode.encoder.MaskUtil
- Author:
- Satoru Takabayashi, Daniel Switkin, Sean Owen
-
Method Summary
Modifier and TypeMethodDescription(package private) static int
applyMaskPenaltyRule1
(ByteMatrix matrix) Apply mask penalty rule 1 and return the penalty.(package private) static int
applyMaskPenaltyRule2
(ByteMatrix matrix) Apply mask penalty rule 2 and return the penalty.(package private) static int
applyMaskPenaltyRule3
(ByteMatrix matrix) Apply mask penalty rule 3 and return the penalty.(package private) static int
applyMaskPenaltyRule4
(ByteMatrix matrix) Apply mask penalty rule 4 and return the penalty.(package private) static boolean
getDataMaskBit
(int maskPattern, int x, int y) Return the mask bit for "getMaskPattern" at "x" and "y".
-
Method Details
-
applyMaskPenaltyRule1
Apply mask penalty rule 1 and return the penalty. Find repetitive cells with the same color and give penalty to them. Example: 00000 or 11111. -
applyMaskPenaltyRule2
Apply mask penalty rule 2 and return the penalty. Find 2x2 blocks with the same color and give penalty to them. This is actually equivalent to the spec's rule, which is to find MxN blocks and give a penalty proportional to (M-1)x(N-1), because this is the number of 2x2 blocks inside such a block. -
applyMaskPenaltyRule3
Apply mask penalty rule 3 and return the penalty. Find consecutive runs of 1:1:3:1:1:4 starting with black, or 4:1:1:3:1:1 starting with white, and give penalty to them. If we find patterns like 000010111010000, we give penalty once. -
applyMaskPenaltyRule4
Apply mask penalty rule 4 and return the penalty. Calculate the ratio of dark cells and give penalty if the ratio is far from 50%. It gives 10 penalty for 5% distance. -
getDataMaskBit
static boolean getDataMaskBit(int maskPattern, int x, int y) Return the mask bit for "getMaskPattern" at "x" and "y". See 8.8 of JISX0510:2004 for mask pattern conditions.
-