Ejemplo n.º 1
0
		// The mask penalty calculation is complicated.  See Table 21 of JISX0510:2004 (p.45) for details.
		// Basically it applies four rules and summate all penalties.
		private static int calculateMaskPenalty(ByteMatrix matrix)
		{
			int penalty = 0;
			penalty += MaskUtil.applyMaskPenaltyRule1(matrix);
			penalty += MaskUtil.applyMaskPenaltyRule2(matrix);
			penalty += MaskUtil.applyMaskPenaltyRule3(matrix);
			penalty += MaskUtil.applyMaskPenaltyRule4(matrix);
			return penalty;
		}
Ejemplo n.º 2
0
		// Build 2D matrix of QR Code from "dataBits" with "ecLevel", "version" and "getMaskPattern". On
		// success, store the result in "matrix" and return true.
		public static void  buildMatrix(BitVector dataBits, ErrorCorrectionLevel ecLevel, int version, int maskPattern, ByteMatrix matrix)
		{
			clearMatrix(matrix);
			embedBasicPatterns(version, matrix);
			// Type information appear with any version.
			embedTypeInfo(ecLevel, maskPattern, matrix);
			// Version info appear if version >= 7.
			maybeEmbedVersionInfo(version, matrix);
			// Data should be embedded at end.
			embedDataBits(dataBits, maskPattern, matrix);
		}
Ejemplo n.º 3
0
		// Embed basic patterns. On success, modify the matrix and return true.
		// The basic patterns are:
		// - Position detection patterns
		// - Timing patterns
		// - Dark dot at the left bottom corner
		// - Position adjustment patterns, if need be
		public static void  embedBasicPatterns(int version, ByteMatrix matrix)
		{
			// Let's get started with embedding big squares at corners.
			embedPositionDetectionPatternsAndSeparators(matrix);
			// Then, embed the dark dot at the left bottom corner.
			embedDarkDotAtLeftBottomCorner(matrix);
			
			// Position adjustment patterns appear if version >= 2.
			maybeEmbedPositionAdjustmentPatterns(version, matrix);
			// Timing patterns should be embedded after position adj. patterns.
			embedTimingPatterns(matrix);
		}
Ejemplo n.º 4
0
		// Apply mask penalty rule 2 and return the penalty. Find 2x2 blocks with the same color and give
		// penalty to them.
		public static int applyMaskPenaltyRule2(ByteMatrix matrix)
		{
			int penalty = 0;
			sbyte[][] array = matrix.Array;
			int width = matrix.Width;
			int height = matrix.Height;
			for (int y = 0; y < height - 1; ++y)
			{
				for (int x = 0; x < width - 1; ++x)
				{
					int value_Renamed = array[y][x];
					if (value_Renamed == array[y][x + 1] && value_Renamed == array[y + 1][x] && value_Renamed == array[y + 1][x + 1])
					{
						penalty += 3;
					}
				}
			}
			return penalty;
		}
Ejemplo n.º 5
0
 private static void  embedPositionDetectionPattern(int xStart, int yStart, ByteMatrix matrix)
 {
     // We know the width and height.
     if (POSITION_DETECTION_PATTERN[0].Length != 7 || POSITION_DETECTION_PATTERN.Length != 7)
     {
         throw new WriterException("Bad position detection pattern");
     }
     for (int y = 0; y < 7; ++y)
     {
         for (int x = 0; x < 7; ++x)
         {
             if (!isEmpty(matrix.get_Renamed(xStart + x, yStart + y)))
             {
                 throw new WriterException();
             }
             matrix.set_Renamed(xStart + x, yStart + y, POSITION_DETECTION_PATTERN[y][x]);
         }
     }
 }
Ejemplo n.º 6
0
 // Note that we cannot unify the function with embedPositionDetectionPattern() despite they are
 // almost identical, since we cannot write a function that takes 2D arrays in different sizes in
 // C/C++. We should live with the fact.
 private static void  embedPositionAdjustmentPattern(int xStart, int yStart, ByteMatrix matrix)
 {
     // We know the width and height.
     if (POSITION_ADJUSTMENT_PATTERN[0].Length != 5 || POSITION_ADJUSTMENT_PATTERN.Length != 5)
     {
         throw new WriterException("Bad position adjustment");
     }
     for (int y = 0; y < 5; ++y)
     {
         for (int x = 0; x < 5; ++x)
         {
             if (!isEmpty(matrix.get_Renamed(xStart + x, yStart + y)))
             {
                 throw new WriterException();
             }
             matrix.set_Renamed(xStart + x, yStart + y, POSITION_ADJUSTMENT_PATTERN[y][x]);
         }
     }
 }
Ejemplo n.º 7
0
        // Apply mask penalty rule 2 and return the penalty. Find 2x2 blocks with the same color and give
        // penalty to them.
        public static int applyMaskPenaltyRule2(ByteMatrix matrix)
        {
            int penalty = 0;

            sbyte[][] array  = matrix.Array;
            int       width  = matrix.Width;
            int       height = matrix.Height;

            for (int y = 0; y < height - 1; ++y)
            {
                for (int x = 0; x < width - 1; ++x)
                {
                    int value_Renamed = array[y][x];
                    if (value_Renamed == array[y][x + 1] && value_Renamed == array[y + 1][x] && value_Renamed == array[y + 1][x + 1])
                    {
                        penalty += 3;
                    }
                }
            }
            return(penalty);
        }
Ejemplo n.º 8
0
		// 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. Examples:
		// -   0% => 100
		// -  40% =>  20
		// -  45% =>  10
		// -  50% =>   0
		// -  55% =>  10
		// -  55% =>  20
		// - 100% => 100
		public static int applyMaskPenaltyRule4(ByteMatrix matrix)
		{
			int numDarkCells = 0;
			sbyte[][] array = matrix.Array;
			int width = matrix.Width;
			int height = matrix.Height;
			for (int y = 0; y < height; ++y)
			{
				for (int x = 0; x < width; ++x)
				{
					if (array[y][x] == 1)
					{
						numDarkCells += 1;
					}
				}
			}
			int numTotalCells = matrix.Height * matrix.Width;
			double darkRatio = (double) numDarkCells / numTotalCells;
			//UPGRADE_WARNING: Data types in Visual C# might be different.  Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
			return System.Math.Abs((int) (darkRatio * 100 - 50)) / 5 * 10;
		}
Ejemplo n.º 9
0
		// Apply mask penalty rule 3 and return the penalty. Find consecutive cells of 00001011101 or
		// 10111010000, and give penalty to them.  If we find patterns like 000010111010000, we give
		// penalties twice (i.e. 40 * 2).
		public static int applyMaskPenaltyRule3(ByteMatrix matrix)
		{
			int penalty = 0;
			sbyte[][] array = matrix.Array;
			int width = matrix.Width;
			int height = matrix.Height;
			for (int y = 0; y < height; ++y)
			{
				for (int x = 0; x < width; ++x)
				{
					// Tried to simplify following conditions but failed.
					if (x + 6 < width && array[y][x] == 1 && array[y][x + 1] == 0 && array[y][x + 2] == 1 && array[y][x + 3] == 1 && array[y][x + 4] == 1 && array[y][x + 5] == 0 && array[y][x + 6] == 1 && ((x + 10 < width && array[y][x + 7] == 0 && array[y][x + 8] == 0 && array[y][x + 9] == 0 && array[y][x + 10] == 0) || (x - 4 >= 0 && array[y][x - 1] == 0 && array[y][x - 2] == 0 && array[y][x - 3] == 0 && array[y][x - 4] == 0)))
					{
						penalty += 40;
					}
					if (y + 6 < height && array[y][x] == 1 && array[y + 1][x] == 0 && array[y + 2][x] == 1 && array[y + 3][x] == 1 && array[y + 4][x] == 1 && array[y + 5][x] == 0 && array[y + 6][x] == 1 && ((y + 10 < height && array[y + 7][x] == 0 && array[y + 8][x] == 0 && array[y + 9][x] == 0 && array[y + 10][x] == 0) || (y - 4 >= 0 && array[y - 1][x] == 0 && array[y - 2][x] == 0 && array[y - 3][x] == 0 && array[y - 4][x] == 0)))
					{
						penalty += 40;
					}
				}
			}
			return penalty;
		}
Ejemplo n.º 10
0
        // 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. Examples:
        // -   0% => 100
        // -  40% =>  20
        // -  45% =>  10
        // -  50% =>   0
        // -  55% =>  10
        // -  55% =>  20
        // - 100% => 100
        public static int applyMaskPenaltyRule4(ByteMatrix matrix)
        {
            int numDarkCells = 0;

            sbyte[][] array  = matrix.Array;
            int       width  = matrix.Width;
            int       height = matrix.Height;

            for (int y = 0; y < height; ++y)
            {
                for (int x = 0; x < width; ++x)
                {
                    if (array[y][x] == 1)
                    {
                        numDarkCells += 1;
                    }
                }
            }
            int    numTotalCells = matrix.Height * matrix.Width;
            double darkRatio     = (double)numDarkCells / numTotalCells;

            //UPGRADE_WARNING: Data types in Visual C# might be different.  Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
            return(System.Math.Abs((int)(darkRatio * 100 - 50)) / 5 * 10);
        }
Ejemplo n.º 11
0
 // Set all cells to -1.  -1 means that the cell is empty (not set yet).
 //
 // JAVAPORT: We shouldn't need to do this at all. The code should be rewritten to begin encoding
 // with the ByteMatrix initialized all to zero.
 public static void  clearMatrix(ByteMatrix matrix)
 {
     matrix.clear((sbyte)(-1));
 }
Ejemplo n.º 12
0
		private static void  embedPositionDetectionPattern(int xStart, int yStart, ByteMatrix matrix)
		{
			// We know the width and height.
			if (POSITION_DETECTION_PATTERN[0].Length != 7 || POSITION_DETECTION_PATTERN.Length != 7)
			{
				throw new WriterException("Bad position detection pattern");
			}
			for (int y = 0; y < 7; ++y)
			{
				for (int x = 0; x < 7; ++x)
				{
					if (!isEmpty(matrix.get_Renamed(xStart + x, yStart + y)))
					{
						throw new WriterException();
					}
					matrix.set_Renamed(xStart + x, yStart + y, POSITION_DETECTION_PATTERN[y][x]);
				}
			}
		}
Ejemplo n.º 13
0
		// Embed position detection patterns and surrounding vertical/horizontal separators.
		private static void  embedPositionDetectionPatternsAndSeparators(ByteMatrix matrix)
		{
			// Embed three big squares at corners.
			int pdpWidth = POSITION_DETECTION_PATTERN[0].Length;
			// Left top corner.
			embedPositionDetectionPattern(0, 0, matrix);
			// Right top corner.
			embedPositionDetectionPattern(matrix.Width - pdpWidth, 0, matrix);
			// Left bottom corner.
			embedPositionDetectionPattern(0, matrix.Width - pdpWidth, matrix);
			
			// Embed horizontal separation patterns around the squares.
			int hspWidth = HORIZONTAL_SEPARATION_PATTERN[0].Length;
			// Left top corner.
			embedHorizontalSeparationPattern(0, hspWidth - 1, matrix);
			// Right top corner.
			embedHorizontalSeparationPattern(matrix.Width - hspWidth, hspWidth - 1, matrix);
			// Left bottom corner.
			embedHorizontalSeparationPattern(0, matrix.Width - hspWidth, matrix);
			
			// Embed vertical separation patterns around the squares.
			int vspSize = VERTICAL_SEPARATION_PATTERN.Length;
			// Left top corner.
			embedVerticalSeparationPattern(vspSize, 0, matrix);
			// Right top corner.
			embedVerticalSeparationPattern(matrix.Height - vspSize - 1, 0, matrix);
			// Left bottom corner.
			embedVerticalSeparationPattern(vspSize, matrix.Height - vspSize, matrix);
		}
Ejemplo n.º 14
0
		// Set all cells to -1.  -1 means that the cell is empty (not set yet).
		//
		// JAVAPORT: We shouldn't need to do this at all. The code should be rewritten to begin encoding
		// with the ByteMatrix initialized all to zero.
		public static void  clearMatrix(ByteMatrix matrix)
		{
			matrix.clear((sbyte) (- 1));
		}
Ejemplo n.º 15
0
		private static int chooseMaskPattern(BitVector bits, ErrorCorrectionLevel ecLevel, int version, ByteMatrix matrix)
		{
			
			int minPenalty = System.Int32.MaxValue; // Lower penalty is better.
			int bestMaskPattern = - 1;
			// We try all mask patterns to choose the best one.
			for (int maskPattern = 0; maskPattern < QRCode.NUM_MASK_PATTERNS; maskPattern++)
			{
				MatrixUtil.buildMatrix(bits, ecLevel, version, maskPattern, matrix);
				int penalty = calculateMaskPenalty(matrix);
				if (penalty < minPenalty)
				{
					minPenalty = penalty;
					bestMaskPattern = maskPattern;
				}
			}
			return bestMaskPattern;
		}
Ejemplo n.º 16
0
		// Note that we cannot unify the function with embedPositionDetectionPattern() despite they are
		// almost identical, since we cannot write a function that takes 2D arrays in different sizes in
		// C/C++. We should live with the fact.
		private static void  embedPositionAdjustmentPattern(int xStart, int yStart, ByteMatrix matrix)
		{
			// We know the width and height.
			if (POSITION_ADJUSTMENT_PATTERN[0].Length != 5 || POSITION_ADJUSTMENT_PATTERN.Length != 5)
			{
				throw new WriterException("Bad position adjustment");
			}
			for (int y = 0; y < 5; ++y)
			{
				for (int x = 0; x < 5; ++x)
				{
					if (!isEmpty(matrix.get_Renamed(xStart + x, yStart + y)))
					{
						throw new WriterException();
					}
					matrix.set_Renamed(xStart + x, yStart + y, POSITION_ADJUSTMENT_PATTERN[y][x]);
				}
			}
		}
Ejemplo n.º 17
0
		public QRCode()
		{
			mode = null;
			ecLevel = null;
			version = - 1;
			matrixWidth = - 1;
			maskPattern = - 1;
			numTotalBytes = - 1;
			numDataBytes = - 1;
			numECBytes = - 1;
			numRSBlocks = - 1;
			matrix = null;
		}
Ejemplo n.º 18
0
		// Embed "dataBits" using "getMaskPattern". On success, modify the matrix and return true.
		// For debugging purposes, it skips masking process if "getMaskPattern" is -1.
		// See 8.7 of JISX0510:2004 (p.38) for how to embed data bits.
		public static void  embedDataBits(BitVector dataBits, int maskPattern, ByteMatrix matrix)
		{
			int bitIndex = 0;
			int direction = - 1;
			// Start from the right bottom cell.
			int x = matrix.Width - 1;
			int y = matrix.Height - 1;
			while (x > 0)
			{
				// Skip the vertical timing pattern.
				if (x == 6)
				{
					x -= 1;
				}
				while (y >= 0 && y < matrix.Height)
				{
					for (int i = 0; i < 2; ++i)
					{
						int xx = x - i;
						// Skip the cell if it's not empty.
						if (!isEmpty(matrix.get_Renamed(xx, y)))
						{
							continue;
						}
						int bit;
						if (bitIndex < dataBits.size())
						{
							bit = dataBits.at(bitIndex);
							++bitIndex;
						}
						else
						{
							// Padding bit. If there is no bit left, we'll fill the left cells with 0, as described
							// in 8.4.9 of JISX0510:2004 (p. 24).
							bit = 0;
						}
						
						// Skip masking if mask_pattern is -1.
						if (maskPattern != - 1)
						{
							if (MaskUtil.getDataMaskBit(maskPattern, xx, y))
							{
								bit ^= 0x1;
							}
						}
						matrix.set_Renamed(xx, y, bit);
					}
					y += direction;
				}
				direction = - direction; // Reverse the direction.
				y += direction;
				x -= 2; // Move to the left.
			}
			// All bits should be consumed.
			if (bitIndex != dataBits.size())
			{
				throw new WriterException("Not all bits consumed: " + bitIndex + '/' + dataBits.size());
			}
		}
Ejemplo n.º 19
0
		public static void  encode(System.String content, ErrorCorrectionLevel ecLevel, System.Collections.Hashtable hints, QRCode qrCode)
		{
			
			System.String encoding = hints == null?null:(System.String) hints[EncodeHintType.CHARACTER_SET];
			if (encoding == null)
			{
				encoding = DEFAULT_BYTE_MODE_ENCODING;
			}
			
			// Step 1: Choose the mode (encoding).
			Mode mode = chooseMode(content, encoding);
			
			// Step 2: Append "bytes" into "dataBits" in appropriate encoding.
			BitVector dataBits = new BitVector();
			appendBytes(content, mode, dataBits, encoding);
			// Step 3: Initialize QR code that can contain "dataBits".
			int numInputBytes = dataBits.sizeInBytes();
			initQRCode(numInputBytes, ecLevel, mode, qrCode);
			
			// Step 4: Build another bit vector that contains header and data.
			BitVector headerAndDataBits = new BitVector();
			
			// Step 4.5: Append ECI message if applicable
			if (mode == Mode.BYTE && !DEFAULT_BYTE_MODE_ENCODING.Equals(encoding))
			{
				CharacterSetECI eci = CharacterSetECI.getCharacterSetECIByName(encoding);
				if (eci != null)
				{
					appendECI(eci, headerAndDataBits);
				}
			}
			
			appendModeInfo(mode, headerAndDataBits);
			
			int numLetters = mode.Equals(Mode.BYTE)?dataBits.sizeInBytes():content.Length;
			appendLengthInfo(numLetters, qrCode.Version, mode, headerAndDataBits);
			headerAndDataBits.appendBitVector(dataBits);
			
			// Step 5: Terminate the bits properly.
			terminateBits(qrCode.NumDataBytes, headerAndDataBits);
			
			// Step 6: Interleave data bits with error correction code.
			BitVector finalBits = new BitVector();
			interleaveWithECBytes(headerAndDataBits, qrCode.NumTotalBytes, qrCode.NumDataBytes, qrCode.NumRSBlocks, finalBits);
			
			// Step 7: Choose the mask pattern and set to "qrCode".
			ByteMatrix matrix = new ByteMatrix(qrCode.MatrixWidth, qrCode.MatrixWidth);
			qrCode.MaskPattern = chooseMaskPattern(finalBits, qrCode.ECLevel, qrCode.Version, matrix);
			
			// Step 8.  Build the matrix and set it to "qrCode".
			MatrixUtil.buildMatrix(finalBits, qrCode.ECLevel, qrCode.Version, qrCode.MaskPattern, matrix);
			qrCode.Matrix = matrix;
			// Step 9.  Make sure we have a valid QR Code.
			if (!qrCode.Valid)
			{
				throw new WriterException("Invalid QR code: " + qrCode.ToString());
			}
		}
Ejemplo n.º 20
0
		// 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.
		public static int applyMaskPenaltyRule1(ByteMatrix matrix)
		{
			return applyMaskPenaltyRule1Internal(matrix, true) + applyMaskPenaltyRule1Internal(matrix, false);
		}
Ejemplo n.º 21
0
		// Helper function for applyMaskPenaltyRule1. We need this for doing this calculation in both
		// vertical and horizontal orders respectively.
		private static int applyMaskPenaltyRule1Internal(ByteMatrix matrix, bool isHorizontal)
		{
			int penalty = 0;
			int numSameBitCells = 0;
			int prevBit = - 1;
			// Horizontal mode:
			//   for (int i = 0; i < matrix.height(); ++i) {
			//     for (int j = 0; j < matrix.width(); ++j) {
			//       int bit = matrix.get(i, j);
			// Vertical mode:
			//   for (int i = 0; i < matrix.width(); ++i) {
			//     for (int j = 0; j < matrix.height(); ++j) {
			//       int bit = matrix.get(j, i);
			int iLimit = isHorizontal?matrix.Height:matrix.Width;
			int jLimit = isHorizontal?matrix.Width:matrix.Height;
			sbyte[][] array = matrix.Array;
			for (int i = 0; i < iLimit; ++i)
			{
				for (int j = 0; j < jLimit; ++j)
				{
					int bit = isHorizontal?array[i][j]:array[j][i];
					if (bit == prevBit)
					{
						numSameBitCells += 1;
						// Found five repetitive cells with the same color (bit).
						// We'll give penalty of 3.
						if (numSameBitCells == 5)
						{
							penalty += 3;
						}
						else if (numSameBitCells > 5)
						{
							// After five repetitive cells, we'll add the penalty one
							// by one.
							penalty += 1;
						}
					}
					else
					{
						numSameBitCells = 1; // Include the cell itself.
						prevBit = bit;
					}
				}
				numSameBitCells = 0; // Clear at each row/column.
			}
			return penalty;
		}
Ejemplo n.º 22
0
		// Embed type information. On success, modify the matrix.
		public static void  embedTypeInfo(ErrorCorrectionLevel ecLevel, int maskPattern, ByteMatrix matrix)
		{
			BitVector typeInfoBits = new BitVector();
			makeTypeInfoBits(ecLevel, maskPattern, typeInfoBits);
			
			for (int i = 0; i < typeInfoBits.size(); ++i)
			{
				// Place bits in LSB to MSB order.  LSB (least significant bit) is the last value in
				// "typeInfoBits".
				int bit = typeInfoBits.at(typeInfoBits.size() - 1 - i);
				
				// Type info bits at the left top corner. See 8.9 of JISX0510:2004 (p.46).
				int x1 = TYPE_INFO_COORDINATES[i][0];
				int y1 = TYPE_INFO_COORDINATES[i][1];
				matrix.set_Renamed(x1, y1, bit);
				
				if (i < 8)
				{
					// Right top corner.
					int x2 = matrix.Width - i - 1;
					int y2 = 8;
					matrix.set_Renamed(x2, y2, bit);
				}
				else
				{
					// Left bottom corner.
					int x2 = 8;
					int y2 = matrix.Height - 7 + (i - 8);
					matrix.set_Renamed(x2, y2, bit);
				}
			}
		}
Ejemplo n.º 23
0
		private static void  embedTimingPatterns(ByteMatrix matrix)
		{
			// -8 is for skipping position detection patterns (size 7), and two horizontal/vertical
			// separation patterns (size 1). Thus, 8 = 7 + 1.
			for (int i = 8; i < matrix.Width - 8; ++i)
			{
				int bit = (i + 1) % 2;
				// Horizontal line.
				if (!isValidValue(matrix.get_Renamed(i, 6)))
				{
					throw new WriterException();
				}
				if (isEmpty(matrix.get_Renamed(i, 6)))
				{
					matrix.set_Renamed(i, 6, bit);
				}
				// Vertical line.
				if (!isValidValue(matrix.get_Renamed(6, i)))
				{
					throw new WriterException();
				}
				if (isEmpty(matrix.get_Renamed(6, i)))
				{
					matrix.set_Renamed(6, i, bit);
				}
			}
		}
Ejemplo n.º 24
0
		// Embed the lonely dark dot at left bottom corner. JISX0510:2004 (p.46)
		private static void  embedDarkDotAtLeftBottomCorner(ByteMatrix matrix)
		{
			if (matrix.get_Renamed(8, matrix.Height - 8) == 0)
			{
				throw new WriterException();
			}
			matrix.set_Renamed(8, matrix.Height - 8, 1);
		}
Ejemplo n.º 25
0
 // Build 2D matrix of QR Code from "dataBits" with "ecLevel", "version" and "getMaskPattern". On
 // success, store the result in "matrix" and return true.
 public static void  buildMatrix(BitVector dataBits, ErrorCorrectionLevel ecLevel, int version, int maskPattern, ByteMatrix matrix)
 {
     clearMatrix(matrix);
     embedBasicPatterns(version, matrix);
     // Type information appear with any version.
     embedTypeInfo(ecLevel, maskPattern, matrix);
     // Version info appear if version >= 7.
     maybeEmbedVersionInfo(version, matrix);
     // Data should be embedded at end.
     embedDataBits(dataBits, maskPattern, matrix);
 }
Ejemplo n.º 26
0
        // Embed type information. On success, modify the matrix.
        public static void  embedTypeInfo(ErrorCorrectionLevel ecLevel, int maskPattern, ByteMatrix matrix)
        {
            BitVector typeInfoBits = new BitVector();

            makeTypeInfoBits(ecLevel, maskPattern, typeInfoBits);

            for (int i = 0; i < typeInfoBits.size(); ++i)
            {
                // Place bits in LSB to MSB order.  LSB (least significant bit) is the last value in
                // "typeInfoBits".
                int bit = typeInfoBits.at(typeInfoBits.size() - 1 - i);

                // Type info bits at the left top corner. See 8.9 of JISX0510:2004 (p.46).
                int x1 = TYPE_INFO_COORDINATES[i][0];
                int y1 = TYPE_INFO_COORDINATES[i][1];
                matrix.set_Renamed(x1, y1, bit);

                if (i < 8)
                {
                    // Right top corner.
                    int x2 = matrix.Width - i - 1;
                    int y2 = 8;
                    matrix.set_Renamed(x2, y2, bit);
                }
                else
                {
                    // Left bottom corner.
                    int x2 = 8;
                    int y2 = matrix.Height - 7 + (i - 8);
                    matrix.set_Renamed(x2, y2, bit);
                }
            }
        }
Ejemplo n.º 27
0
		private static void  embedVerticalSeparationPattern(int xStart, int yStart, ByteMatrix matrix)
		{
			// We know the width and height.
			if (VERTICAL_SEPARATION_PATTERN[0].Length != 1 || VERTICAL_SEPARATION_PATTERN.Length != 7)
			{
				throw new WriterException("Bad vertical separation pattern");
			}
			for (int y = 0; y < 7; ++y)
			{
				if (!isEmpty(matrix.get_Renamed(xStart, yStart + y)))
				{
					throw new WriterException();
				}
				matrix.set_Renamed(xStart, yStart + y, VERTICAL_SEPARATION_PATTERN[y][0]);
			}
		}
Ejemplo n.º 28
0
 // 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.
 public static int applyMaskPenaltyRule1(ByteMatrix matrix)
 {
     return(applyMaskPenaltyRule1Internal(matrix, true) + applyMaskPenaltyRule1Internal(matrix, false));
 }
Ejemplo n.º 29
0
        // Note that the input matrix uses 0 == white, 1 == black, while the output matrix uses
        // 0 == black, 255 == white (i.e. an 8 bit greyscale bitmap).
        private static ByteMatrix renderResult(QRCode code, int width, int height)
        {
            ByteMatrix input        = code.Matrix;
            int        inputWidth   = input.Width;
            int        inputHeight  = input.Height;
            int        qrWidth      = inputWidth + (QUIET_ZONE_SIZE << 1);
            int        qrHeight     = inputHeight + (QUIET_ZONE_SIZE << 1);
            int        outputWidth  = System.Math.Max(width, qrWidth);
            int        outputHeight = System.Math.Max(height, qrHeight);

            int multiple = System.Math.Min(outputWidth / qrWidth, outputHeight / qrHeight);

            int leftPadding = 0; // (outputWidth - (inputWidth * multiple)) / 2;
            int topPadding  = 0; // (outputHeight - (inputHeight * multiple)) / 2;

            ByteMatrix output = new ByteMatrix(outputWidth, outputHeight);

            sbyte[][] outputArray = output.Array;

            // We could be tricky and use the first row in each set of multiple as the temporary storage,
            // instead of allocating this separate array.
            sbyte[] row = new sbyte[outputWidth];

            // 1. Write the white lines at the top
            for (int y = 0; y < topPadding; y++)
            {
                setRowColor(outputArray[y], (sbyte)SupportClass.Identity(255));
            }

            // 2. Expand the QR image to the multiple
            sbyte[][] inputArray = input.Array;
            for (int y = 0; y < inputHeight; y++)
            {
                // a. Write the white pixels at the left of each row
                for (int x = 0; x < leftPadding; x++)
                {
                    row[x] = (sbyte)SupportClass.Identity(255);
                }

                // b. Write the contents of this row of the barcode
                int offset = leftPadding;
                for (int x = 0; x < inputWidth; x++)
                {
                    sbyte value_Renamed = (sbyte)((inputArray[y][x] == 1) ? 0 : SupportClass.Identity(255));
                    for (int z = 0; z < multiple; z++)
                    {
                        row[offset + z] = value_Renamed;
                    }
                    offset += multiple;
                }

                // c. Write the white pixels at the right of each row
                offset = leftPadding + (inputWidth * multiple);
                for (int x = offset; x < outputWidth; x++)
                {
                    row[x] = (sbyte)SupportClass.Identity(255);
                }

                // d. Write the completed row multiple times
                offset = topPadding + (y * multiple);
                for (int z = 0; z < multiple; z++)
                {
                    Array.Copy(row, 0, outputArray[offset + z], 0, outputWidth);
                }
            }

            // 3. Write the white lines at the bottom
            int offset2 = topPadding + (inputHeight * multiple);

            for (int y = offset2; y < outputHeight; y++)
            {
                setRowColor(outputArray[y], (sbyte)SupportClass.Identity(255));
            }

            return(output);
        }
Ejemplo n.º 30
0
 private static int chooseMaskPattern(BitVector bits, ErrorCorrectionLevel ecLevel, int version, ByteMatrix matrix)
 {
     int minPenalty = System.Int32.MaxValue; // Lower penalty is better.
     int bestMaskPattern = - 1;
     // We try all mask patterns to choose the best one.
     for (int maskPattern = 0; maskPattern < QRCode.NUM_MASK_PATTERNS; maskPattern++)
     {
         MatrixUtil.buildMatrix(bits, ecLevel, version, maskPattern, matrix);
         int penalty = calculateMaskPenalty(matrix);
         if (penalty < minPenalty)
         {
             minPenalty = penalty;
             bestMaskPattern = maskPattern;
         }
     }
     return bestMaskPattern;
 }
Ejemplo n.º 31
0
 private static void  embedHorizontalSeparationPattern(int xStart, int yStart, ByteMatrix matrix)
 {
     // We know the width and height.
     if (HORIZONTAL_SEPARATION_PATTERN[0].Length != 8 || HORIZONTAL_SEPARATION_PATTERN.Length != 1)
     {
         throw new WriterException("Bad horizontal separation pattern");
     }
     for (int x = 0; x < 8; ++x)
     {
         if (!isEmpty(matrix.get_Renamed(xStart + x, yStart)))
         {
             throw new WriterException();
         }
         matrix.set_Renamed(xStart + x, yStart, HORIZONTAL_SEPARATION_PATTERN[0][x]);
     }
 }
Ejemplo n.º 32
0
		private static void  embedHorizontalSeparationPattern(int xStart, int yStart, ByteMatrix matrix)
		{
			// We know the width and height.
			if (HORIZONTAL_SEPARATION_PATTERN[0].Length != 8 || HORIZONTAL_SEPARATION_PATTERN.Length != 1)
			{
				throw new WriterException("Bad horizontal separation pattern");
			}
			for (int x = 0; x < 8; ++x)
			{
				if (!isEmpty(matrix.get_Renamed(xStart + x, yStart)))
				{
					throw new WriterException();
				}
				matrix.set_Renamed(xStart + x, yStart, HORIZONTAL_SEPARATION_PATTERN[0][x]);
			}
		}
Ejemplo n.º 33
0
		// Embed position adjustment patterns if need be.
		private static void  maybeEmbedPositionAdjustmentPatterns(int version, ByteMatrix matrix)
		{
			if (version < 2)
			{
				// The patterns appear if version >= 2
				return ;
			}
			int index = version - 1;
			int[] coordinates = POSITION_ADJUSTMENT_PATTERN_COORDINATE_TABLE[index];
			int numCoordinates = POSITION_ADJUSTMENT_PATTERN_COORDINATE_TABLE[index].Length;
			for (int i = 0; i < numCoordinates; ++i)
			{
				for (int j = 0; j < numCoordinates; ++j)
				{
					int y = coordinates[i];
					int x = coordinates[j];
					if (x == - 1 || y == - 1)
					{
						continue;
					}
					// If the cell is unset, we embed the position adjustment pattern here.
					if (isEmpty(matrix.get_Renamed(x, y)))
					{
						// -2 is necessary since the x/y coordinates point to the center of the pattern, not the
						// left top corner.
						embedPositionAdjustmentPattern(x - 2, y - 2, matrix);
					}
				}
			}
		}
Ejemplo n.º 34
0
		// Note that the input matrix uses 0 == white, 1 == black, while the output matrix uses
		// 0 == black, 255 == white (i.e. an 8 bit greyscale bitmap).
		private static ByteMatrix renderResult(QRCode code,  int width,  int height)
		{
			ByteMatrix input = code.Matrix;
			int inputWidth = input.Width;
			int inputHeight = input.Height;
			int qrWidth = inputWidth + (QUIET_ZONE_SIZE << 1);
			int qrHeight = inputHeight + (QUIET_ZONE_SIZE << 1);
			int outputWidth = System.Math.Max(width, qrWidth);
			int outputHeight = System.Math.Max(height, qrHeight);
           
			int multiple = System.Math.Min(outputWidth / qrWidth, outputHeight / qrHeight);

            int leftPadding =0;// (outputWidth - (inputWidth * multiple)) / 2;
            int topPadding = 0;// (outputHeight - (inputHeight * multiple)) / 2;
			
			ByteMatrix output = new ByteMatrix(outputWidth, outputHeight);
			sbyte[][] outputArray = output.Array;
			
			// We could be tricky and use the first row in each set of multiple as the temporary storage,
			// instead of allocating this separate array.
			sbyte[] row = new sbyte[outputWidth];
			
			// 1. Write the white lines at the top
			for (int y = 0; y < topPadding; y++)
			{
				setRowColor(outputArray[y], (sbyte) SupportClass.Identity(255));
			}
			
			// 2. Expand the QR image to the multiple
			sbyte[][] inputArray = input.Array;
			for (int y = 0; y < inputHeight; y++)
			{
				// a. Write the white pixels at the left of each row
				for (int x = 0; x < leftPadding; x++)
				{
					row[x] = (sbyte) SupportClass.Identity(255);
				}
				
				// b. Write the contents of this row of the barcode
				int offset = leftPadding;
				for (int x = 0; x < inputWidth; x++)
				{
                    sbyte value_Renamed = (sbyte)((inputArray[y][x] == 1) ? 0 : SupportClass.Identity(255));
					for (int z = 0; z < multiple; z++)
					{
						row[offset + z] = value_Renamed;
					}
					offset += multiple;
				}
				
				// c. Write the white pixels at the right of each row
				offset = leftPadding + (inputWidth * multiple);
				for (int x = offset; x < outputWidth; x++)
				{
					row[x] = (sbyte) SupportClass.Identity(255);
				}
				
				// d. Write the completed row multiple times
				offset = topPadding + (y * multiple);
				for (int z = 0; z < multiple; z++)
				{
					Array.Copy(row, 0, outputArray[offset + z], 0, outputWidth);
				}
			}
			
			// 3. Write the white lines at the bottom
			int offset2 = topPadding + (inputHeight * multiple);
			for (int y = offset2; y < outputHeight; y++)
			{
				setRowColor(outputArray[y], (sbyte) SupportClass.Identity(255));
			}
			
			return output;
		}
Ejemplo n.º 35
0
		// Embed version information if need be. On success, modify the matrix and return true.
		// See 8.10 of JISX0510:2004 (p.47) for how to embed version information.
		public static void  maybeEmbedVersionInfo(int version, ByteMatrix matrix)
		{
			if (version < 7)
			{
				// Version info is necessary if version >= 7.
				return ; // Don't need version info.
			}
			BitVector versionInfoBits = new BitVector();
			makeVersionInfoBits(version, versionInfoBits);
			
			int bitIndex = 6 * 3 - 1; // It will decrease from 17 to 0.
			for (int i = 0; i < 6; ++i)
			{
				for (int j = 0; j < 3; ++j)
				{
					// Place bits in LSB (least significant bit) to MSB order.
					int bit = versionInfoBits.at(bitIndex);
					bitIndex--;
					// Left bottom corner.
					matrix.set_Renamed(i, matrix.Height - 11 + j, bit);
					// Right bottom corner.
					matrix.set_Renamed(matrix.Height - 11 + j, i, bit);
				}
			}
		}