This example shows how to scan a QR code with ZXing javascript library from an image. The example decodes from the src in img tag, however is also possible to decode directly from an url without an img tag.
28 | 32 | 33 |34 | 35 |
See the source code for this example.
36 | 37 |This example shows how to write a QR code to SVG with ZXing javascript library. 21 | 22 |
See the source code for this example.
38 | 39 |This example shows how to scan a QR code with ZXing javascript library from a video file. The example decodes from an url and shows the video while decoding, however is also possbile to decode without showing the video.
21 | 22 | 26 | 27 |33 | 34 |35 | 36 |
See the source code for this example.
37 | 38 |ZXing ("zebra crossing") TypeScript is an open-source, multi-format 1D/2D barcode image processing library ported to TypeScript from Java.
21 | 22 |The library can be used from browser or from node. Below are links to browser demo & examples.
23 | 24 |25 | More information can be found in GitHub project home page. 26 |
27 | 28 |37 | View source code on GitHub. 38 |
39 | 40 |Encapsulates the result of detecting a barcode in an image. This includes the raw 24 | * matrix of black/white pixels corresponding to the barcode, and possibly points of interest 25 | * in the image, like the location of finder patterns or corners of the barcode in the image.
26 | * 27 | * @author Sean Owen 28 | */ 29 | export default class DetectorResult { 30 | 31 | private bits: BitMatrix 32 | private points: ArrayImplements Reed-Solomon encoding, as the name implies.
29 | * 30 | * @author Sean Owen 31 | * @author William Rucklidge 32 | */ 33 | export default class ReedSolomonEncoder { 34 | 35 | private field: GenericGF 36 | private cachedGenerators: GenericGFPoly[] 37 | 38 | public constructor(field: GenericGF) { 39 | this.field = field 40 | this.cachedGenerators = [] 41 | this.cachedGenerators.push(new GenericGFPoly(field, Int32Array.from([1]))); 42 | } 43 | 44 | private buildGenerator(degree: number /*int*/): GenericGFPoly { 45 | const cachedGenerators = this.cachedGenerators 46 | if (degree >= cachedGenerators.length) { 47 | let lastGenerator = cachedGenerators[cachedGenerators.length - 1] 48 | const field = this.field 49 | for (let d = cachedGenerators.length; d <= degree; d++) { 50 | const nextGenerator = lastGenerator.multiply( 51 | new GenericGFPoly(field, Int32Array.from([1, field.exp(d - 1 + field.getGeneratorBase()) ]))); 52 | cachedGenerators.push(nextGenerator) 53 | lastGenerator = nextGenerator 54 | } 55 | } 56 | return cachedGenerators[degree] 57 | } 58 | 59 | public encode(toEncode: Int32Array, ecBytes: number /*int*/): void { 60 | if (ecBytes === 0) { 61 | throw new Exception(Exception.IllegalArgumentException, "No error correction bytes") 62 | } 63 | const dataBytes = toEncode.length - ecBytes 64 | if (dataBytes <= 0) { 65 | throw new Exception(Exception.IllegalArgumentException, "No data bytes provided") 66 | } 67 | const generator = this.buildGenerator(ecBytes) 68 | const infoCoefficients: Int32Array = new Int32Array(dataBytes) 69 | System.arraycopy(toEncode, 0, infoCoefficients, 0, dataBytes) 70 | let info = new GenericGFPoly(this.field, infoCoefficients) 71 | info = info.multiplyByMonomial(ecBytes, 1) 72 | const remainder = info.divide(generator)[1] 73 | const coefficients = remainder.getCoefficients() 74 | const numZeroCoefficients = ecBytes - coefficients.length 75 | for (let i = 0; i < numZeroCoefficients; i++) { 76 | toEncode[dataBytes + i] = 0 77 | } 78 | System.arraycopy(coefficients, 0, toEncode, dataBytes + numZeroCoefficients, coefficients.length) 79 | } 80 | 81 | } 82 | -------------------------------------------------------------------------------- /src/core/qrcode/decoder/ECB.ts: -------------------------------------------------------------------------------- 1 | /** 2 | *Encapsulates the parameters for one error-correction block in one symbol version. 3 | * This includes the number of data codewords, and the number of times a block with these 4 | * parameters is used consecutively in the QR code version's format.
5 | */ 6 | export default class ECB { 7 | private count: number /*int*/ 8 | private dataCodewords: number /*int*/ 9 | 10 | public constructor(count: number /*int*/, dataCodewords: number /*int*/) { 11 | this.count = count 12 | this.dataCodewords = dataCodewords 13 | } 14 | 15 | public getCount(): number /*int*/ { 16 | return this.count 17 | } 18 | 19 | public getDataCodewords(): number /*int*/ { 20 | return this.dataCodewords 21 | } 22 | } 23 | -------------------------------------------------------------------------------- /src/core/qrcode/decoder/ECBlocks.ts: -------------------------------------------------------------------------------- 1 | import ECB from './ECB' 2 | 3 | /** 4 | *Encapsulates a set of error-correction blocks in one symbol version. Most versions will 5 | * use blocks of differing sizes within one version, so, this encapsulates the parameters for 6 | * each set of blocks. It also holds the number of error-correction codewords per block since it 7 | * will be the same across all blocks within one version.
8 | */ 9 | export default class ECBlocks { 10 | private ecBlocks: ECB[] 11 | 12 | public constructor(private ecCodewordsPerBlock: number /*int*/, ...ecBlocks: ECB[]) { 13 | this.ecBlocks = ecBlocks 14 | } 15 | 16 | public getECCodewordsPerBlock(): number /*int*/ { 17 | return this.ecCodewordsPerBlock 18 | } 19 | 20 | public getNumBlocks(): number /*int*/ { 21 | let total = 0 22 | const ecBlocks = this.ecBlocks 23 | for (const ecBlock of ecBlocks) { 24 | total += ecBlock.getCount() 25 | } 26 | return total 27 | } 28 | 29 | public getTotalECCodewords(): number /*int*/ { 30 | return this.ecCodewordsPerBlock * this.getNumBlocks(); 31 | } 32 | 33 | public getECBlocks(): ECB[] { 34 | return this.ecBlocks 35 | } 36 | } -------------------------------------------------------------------------------- /src/core/qrcode/decoder/QRCodeDecoderMetaData.ts: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright 2013 ZXing authors 3 | * 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 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 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. 15 | */ 16 | 17 | /*namespace com.google.zxing.qrcode.decoder {*/ 18 | 19 | import ResultPoint from './../../ResultPoint' 20 | 21 | /** 22 | * Meta-data container for QR Code decoding. Instances of this class may be used to convey information back to the 23 | * decoding caller. Callers are expected to process this. 24 | * 25 | * @see com.google.zxing.common.DecoderResult#getOther() 26 | */ 27 | export default class QRCodeDecoderMetaData { 28 | 29 | 30 | public constructor(private mirrored: boolean) {} 31 | 32 | /** 33 | * @return true if the QR Code was mirrored. 34 | */ 35 | public isMirrored(): boolean { 36 | return this.mirrored 37 | } 38 | 39 | /** 40 | * Apply the result points' order correction due to mirroring. 41 | * 42 | * @param points Array of points to apply mirror correction to. 43 | */ 44 | public applyMirroredCorrection(points: ArrayEncapsulates an alignment pattern, which are the smaller square patterns found in 23 | * all but the simplest QR Codes.
24 | * 25 | * @author Sean Owen 26 | */ 27 | export default class AlignmentPattern extends ResultPoint { 28 | 29 | public constructor(posX: number/*float*/, posY: number/*float*/, private estimatedModuleSize: number/*float*/) { 30 | super(posX, posY) 31 | } 32 | 33 | /** 34 | *Determines if this alignment pattern "about equals" an alignment pattern at the stated 35 | * position and size -- meaning, it is at nearly the same center with nearly the same size.
36 | */ 37 | public aboutEquals(moduleSize: number/*float*/, i: number/*float*/, j: number/*float*/): boolean { 38 | if (Math.abs(i - this.getY()) <= moduleSize && Math.abs(j - this.getX()) <= moduleSize) { 39 | const moduleSizeDiff: number/*float*/ = Math.abs(moduleSize - this.estimatedModuleSize) 40 | return moduleSizeDiff <= 1.0 || moduleSizeDiff <= this.estimatedModuleSize 41 | } 42 | return false 43 | } 44 | 45 | /** 46 | * Combines this object's current estimate of a finder pattern position and module size 47 | * with a new estimate. It returns a new {@code FinderPattern} containing an average of the two. 48 | */ 49 | public combineEstimate(i: number/*float*/, j: number/*float*/, newModuleSize: number/*float*/): AlignmentPattern { 50 | const combinedX: number/*float*/ = (this.getX() + j) / 2.0 51 | const combinedY: number/*float*/ = (this.getY() + i) / 2.0 52 | const combinedModuleSize: number/*float*/ = (this.estimatedModuleSize + newModuleSize) / 2.0 53 | return new AlignmentPattern(combinedX, combinedY, combinedModuleSize) 54 | } 55 | 56 | } -------------------------------------------------------------------------------- /src/core/qrcode/detector/FinderPattern.ts: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright 2007 ZXing authors 3 | * 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 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 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. 15 | */ 16 | 17 | /*namespace com.google.zxing.qrcode.detector {*/ 18 | 19 | import ResultPoint from './../../ResultPoint' 20 | 21 | /** 22 | *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.
25 | * 26 | * @author Sean Owen 27 | */ 28 | export default class FinderPattern extends ResultPoint { 29 | 30 | // FinderPattern(posX: number/*float*/, posY: number/*float*/, estimatedModuleSize: number/*float*/) { 31 | // this(posX, posY, estimatedModuleSize, 1) 32 | // } 33 | 34 | public constructor(posX: number/*float*/, posY: number/*float*/, private estimatedModuleSize: number/*float*/, private count?: number /*int*/) { 35 | super(posX, posY) 36 | if (undefined === count) { 37 | this.count = 1 38 | } 39 | } 40 | 41 | public getEstimatedModuleSize(): number/*float*/ { 42 | return this.estimatedModuleSize 43 | } 44 | 45 | public getCount(): number /*int*/ { 46 | return this.count 47 | } 48 | 49 | /* 50 | void incrementCount() { 51 | this.count++ 52 | } 53 | */ 54 | 55 | /** 56 | *Determines if this finder pattern "about equals" a finder pattern at the stated 57 | * position and size -- meaning, it is at nearly the same center with nearly the same size.
58 | */ 59 | public aboutEquals(moduleSize: number/*float*/, i: number/*float*/, j: number/*float*/): boolean { 60 | if (Math.abs(i - this.getY()) <= moduleSize && Math.abs(j - this.getX()) <= moduleSize) { 61 | const moduleSizeDiff: number/*float*/ = Math.abs(moduleSize - this.estimatedModuleSize) 62 | return moduleSizeDiff <= 1.0 || moduleSizeDiff <= this.estimatedModuleSize 63 | } 64 | return false 65 | } 66 | 67 | /** 68 | * Combines this object's current estimate of a finder pattern position and module size 69 | * with a new estimate. It returns a new {@code FinderPattern} containing a weighted average 70 | * based on count. 71 | */ 72 | public combineEstimate(i: number/*float*/, j: number/*float*/, newModuleSize: number/*float*/): FinderPattern { 73 | const combinedCount = this.count + 1 74 | const combinedX: number/*float*/ = (this.count * this.getX() + j) / combinedCount; 75 | const combinedY: number/*float*/ = (this.count * this.getY() + i) / combinedCount; 76 | const combinedModuleSize: number/*float*/ = (this.count * this.estimatedModuleSize + newModuleSize) / combinedCount; 77 | return new FinderPattern(combinedX, combinedY, combinedModuleSize, combinedCount) 78 | } 79 | 80 | } 81 | -------------------------------------------------------------------------------- /src/core/qrcode/detector/FinderPatternInfo.ts: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright 2007 ZXing authors 3 | * 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 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 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. 15 | */ 16 | 17 | /*namespace com.google.zxing.qrcode.detector {*/ 18 | 19 | import FinderPattern from './FinderPattern' 20 | 21 | /** 22 | *Encapsulates information about finder patterns in an image, including the location of 23 | * the three finder patterns, and their estimated module size.
24 | * 25 | * @author Sean Owen 26 | */ 27 | export default class FinderPatternInfo { 28 | 29 | private bottomLeft: FinderPattern 30 | private topLeft: FinderPattern 31 | private topRight: FinderPattern 32 | 33 | public constructor(patternCenters: FinderPattern[]) { 34 | this.bottomLeft = patternCenters[0] 35 | this.topLeft = patternCenters[1] 36 | this.topRight = patternCenters[2] 37 | } 38 | 39 | public getBottomLeft(): FinderPattern { 40 | return this.bottomLeft 41 | } 42 | 43 | public getTopLeft(): FinderPattern { 44 | return this.topLeft 45 | } 46 | 47 | public getTopRight(): FinderPattern { 48 | return this.topRight 49 | } 50 | 51 | } 52 | -------------------------------------------------------------------------------- /src/core/qrcode/encoder/BlockPair.ts: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright 2008 ZXing authors 3 | * 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 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 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. 15 | */ 16 | 17 | /*namespace com.google.zxing.qrcode.encoder {*/ 18 | 19 | export default class BlockPair { 20 | 21 | public constructor(private dataBytes: Uint8Array, private errorCorrectionBytes: Uint8Array) {} 22 | 23 | public getDataBytes(): Uint8Array { 24 | return this.dataBytes 25 | } 26 | 27 | public getErrorCorrectionBytes(): Uint8Array { 28 | return this.errorCorrectionBytes 29 | } 30 | 31 | } 32 | -------------------------------------------------------------------------------- /src/core/util/Arrays.ts: -------------------------------------------------------------------------------- 1 | import System from './System' 2 | 3 | export default class Arrays { 4 | public static equals(first: any, second: any): boolean { 5 | if (!first) { 6 | return false 7 | } 8 | if (!second) { 9 | return false 10 | } 11 | if (!first.length) { 12 | return false 13 | } 14 | if (!second.length) { 15 | return false 16 | } 17 | if (first.length !== second.length) { 18 | return false 19 | } 20 | for (let i = 0, length = first.length; i < length; i++) { 21 | if (first[i] !== second[i]) { 22 | return false 23 | } 24 | } 25 | return true 26 | } 27 | 28 | public static hashCode(a: any) { 29 | if (a === null) { 30 | return 0 31 | } 32 | let result = 1 33 | for (const element of a) { 34 | result = 31 * result + element 35 | } 36 | return result 37 | } 38 | 39 | public static fillUint8Array(a: Uint8Array, value: number) { 40 | for (let i = 0; i !== a.length; i++) { 41 | a[i] = value 42 | } 43 | } 44 | 45 | public static copyOf(original: Int32Array, newLength: number) { 46 | const copy = new Int32Array(newLength) 47 | System.arraycopy(original, 0, copy, 0, Math.min(original.length, newLength)) 48 | return copy 49 | } 50 | 51 | /* 52 | * Returns the index of of the element in a sorted array or (-n-1) where n is the insertion point 53 | * for the new element. 54 | * Parameters: 55 | * ar - A sorted array 56 | * el - An element to search for 57 | * comparator - A comparator function. The function takes two arguments: (a, b) and returns: 58 | * a negative number if a is less than b; 59 | * 0 if a is equal to b; 60 | * a positive number of a is greater than b. 61 | * The array may contain duplicate elements. If there are more than one equal elements in the array, 62 | * the returned value can be the index of any one of the equal elements. 63 | * 64 | * http://jsfiddle.net/aryzhov/pkfst550/ 65 | */ 66 | public static binarySearch(ar: Int32Array, el: number, comparator?: (a: number, b: number) => number): number { 67 | if (undefined === comparator) { 68 | comparator = Arrays.numberComparator 69 | } 70 | let m = 0 71 | let n = ar.length - 1 72 | while (m <= n) { 73 | const k = (n + m) >> 1 74 | const cmp = comparator(el, ar[k]) 75 | if (cmp > 0) { 76 | m = k + 1 77 | } else if (cmp < 0) { 78 | n = k - 1 79 | } else { 80 | return k 81 | } 82 | } 83 | return -m - 1 84 | } 85 | 86 | public static numberComparator(a: number, b: number) { 87 | return a - b 88 | } 89 | } 90 | -------------------------------------------------------------------------------- /src/core/util/Float.ts: -------------------------------------------------------------------------------- 1 | export default class Float { 2 | public static floatToIntBits(f: number): number { 3 | return f 4 | } 5 | } -------------------------------------------------------------------------------- /src/core/util/Integer.ts: -------------------------------------------------------------------------------- 1 | 2 | export default class Integer { 3 | public static MIN_VALUE_32_BITS = -2147483648 4 | 5 | public static numberOfTrailingZeros(i: number): number { 6 | let y; 7 | if (i === 0) return 32 8 | let n = 31 9 | y = i << 16 10 | if (y !== 0) { 11 | n -= 16 12 | i = y 13 | } 14 | y = i << 8 15 | if (y !== 0) { 16 | n -= 8 17 | i = y 18 | } 19 | y = i << 4 20 | if (y !== 0) { 21 | n -= 4 22 | i = y 23 | } 24 | y = i << 2 25 | if (y !== 0) { 26 | n -= 2 27 | i = y 28 | } 29 | return n - ((i << 1) >>> 31) 30 | } 31 | 32 | public static numberOfLeadingZeros(i: number): number { 33 | // HD, Figure 5-6 34 | if (i === 0) { 35 | return 32 36 | } 37 | let n = 1 38 | if (i >>> 16 === 0) { 39 | n += 16 40 | i <<= 16 41 | } 42 | if (i >>> 24 === 0) { 43 | n += 8 44 | i <<= 8 45 | } 46 | if (i >>> 28 === 0) { 47 | n += 4 48 | i <<= 4 49 | } 50 | if (i >>> 30 === 0) { 51 | n += 2 52 | i <<= 2 53 | } 54 | n -= i >>> 31 55 | return n 56 | } 57 | 58 | public static toHexString(i: number) { 59 | return i.toString(16) 60 | } 61 | 62 | // Returns the number of one-bits in the two's complement binary representation of the specified int value. This function is sometimes referred to as the population count. 63 | // Returns: 64 | // the number of one-bits in the two's complement binary representation of the specified int value. 65 | public static bitCount(i: number): number { 66 | // HD, Figure 5-2 67 | i = i - ((i >>> 1) & 0x55555555) 68 | i = (i & 0x33333333) + ((i >>> 2) & 0x33333333) 69 | i = (i + (i >>> 4)) & 0x0f0f0f0f 70 | i = i + (i >>> 8) 71 | i = i + (i >>> 16) 72 | return i & 0x3f 73 | } 74 | } -------------------------------------------------------------------------------- /src/core/util/StringBuilder.ts: -------------------------------------------------------------------------------- 1 | export default class StringBuilder { 2 | public constructor(private value: string = '') { 3 | 4 | } 5 | public append(s: string | number): StringBuilder { 6 | if (typeof s === 'string') { 7 | this.value += s.toString() 8 | } else { 9 | this.value += String.fromCharCode(s) 10 | } 11 | return this 12 | } 13 | 14 | public length(): number { 15 | return this.value.length 16 | } 17 | 18 | public charAt(n: number): string { 19 | return this.value.charAt(n) 20 | } 21 | 22 | public deleteCharAt(n: number) { 23 | this.value = this.value.substr(0, n) + this.value.substring(n + 1) 24 | } 25 | 26 | public setCharAt(n: number, c: string) { 27 | this.value = this.value.substr(0, n) + c + this.value.substr(n + 1) 28 | } 29 | 30 | public toString(): string { 31 | return this.value 32 | } 33 | } 34 | -------------------------------------------------------------------------------- /src/core/util/System.ts: -------------------------------------------------------------------------------- 1 | export default class System { 2 | // public static void arraycopy(Object src, int srcPos, Object dest, int destPos, int length) 3 | public static arraycopy(src: any, srcPos: number, dest: any, destPos: number, length: number) { 4 | // TODO: better use split or set? 5 | let i = srcPos 6 | let j = destPos 7 | let c = length 8 | while (c--) { 9 | dest[j++] = src[i++] 10 | } 11 | } 12 | 13 | public static currentTimeMillis() { 14 | return Date.now() 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /src/test/core/PlanarYUVLuminanceSourceTestCase.ts: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright 2014 ZXing authors 3 | * 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 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 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. 15 | */ 16 | 17 | /*package com.google.zxing;*/ 18 | 19 | import 'mocha' 20 | import * as assert from 'assert' 21 | import AssertUtils from './util/AssertUtils' 22 | import PlanarYUVLuminanceSource from './../../core/PlanarYUVLuminanceSource' 23 | import System from './../../core/util/System' 24 | 25 | describe("PlanarYUVLuminanceSourceTestCase", () => { 26 | 27 | const YUV: Uint8ClampedArray = Uint8ClampedArray.from([ 28 | 0, 1, 1, 2, 3, 5, 29 | 8, 13, 21, 34, 55, 89, 30 | 0, -1, -1, -2, -3, -5, 31 | -8, -13, -21, -34, -55, -89, 32 | 127, 127, 127, 127, 127, 127, 33 | 127, 127, 127, 127, 127, 127, 34 | ]) 35 | 36 | const COLS: number /*int*/ = 6 37 | const ROWS: number /*int*/ = 4 38 | const Y = new Uint8ClampedArray(COLS * ROWS) 39 | 40 | System.arraycopy(YUV, 0, Y, 0, Y.length) 41 | 42 | it("testNoCrop", () => { 43 | const source = new PlanarYUVLuminanceSource(YUV, COLS, ROWS, 0, 0, COLS, ROWS, false) 44 | assertTypedArrayEquals(Y, 0, source.getMatrix(), 0, Y.length); 45 | for (let r: number /*int*/ = 0; r < ROWS; r++) { 46 | assertTypedArrayEquals(Y, r * COLS, source.getRow(r, null), 0, COLS); 47 | } 48 | }) 49 | 50 | it("testCrop", () => { 51 | const source = 52 | new PlanarYUVLuminanceSource(YUV, COLS, ROWS, 1, 1, COLS - 2, ROWS - 2, false) 53 | assert.strictEqual(source.isCropSupported(), true) 54 | const cropMatrix: Uint8ClampedArray = source.getMatrix() 55 | for (let r: number /*int*/ = 0; r < ROWS - 2; r++) { 56 | assertTypedArrayEquals(Y, (r + 1) * COLS + 1, cropMatrix, r * (COLS - 2), COLS - 2) 57 | } 58 | for (let r: number /*int*/ = 0; r < ROWS - 2; r++) { 59 | assertTypedArrayEquals(Y, (r + 1) * COLS + 1, source.getRow(r, null), 0, COLS - 2) 60 | } 61 | }) 62 | 63 | it("testThumbnail", () => { 64 | const source = 65 | new PlanarYUVLuminanceSource(YUV, COLS, ROWS, 0, 0, COLS, ROWS, false) 66 | AssertUtils.typedArraysAreEqual( 67 | Int32Array.from([ 0xFF000000, 0xFF010101, 0xFF030303, 0xFF000000, 0xFFFFFFFF, 0xFFFDFDFD ]), 68 | source.renderThumbnail()) 69 | }) 70 | 71 | function assertTypedArrayEquals(expected: Uint8ClampedArray, expectedFrom: number /*int*/, 72 | actual: Uint8ClampedArray, actualFrom: number /*int*/, 73 | length: number /*int*/) { 74 | for (let i: number /*int*/ = 0; i < length; i++) { 75 | assert.strictEqual(actual[actualFrom + i], expected[expectedFrom + i]) 76 | } 77 | } 78 | 79 | }) 80 | -------------------------------------------------------------------------------- /src/test/core/RGBLuminanceSourceTestCase.ts: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright 2014 ZXing authors 3 | * 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 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 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. 15 | */ 16 | 17 | /*package com.google.zxing;*/ 18 | 19 | import 'mocha' 20 | import * as assert from 'assert' 21 | import AssertUtils from './util/AssertUtils' 22 | import LuminanceSource from '../../core/LuminanceSource' 23 | import RGBLuminanceSource from '../../core/RGBLuminanceSource' 24 | 25 | describe("RGBLuminanceSourceTestCase", () => { 26 | 27 | const SOURCE = new RGBLuminanceSource(Int32Array.from([ 28 | 0x000000, 0x7F7F7F, 0xFFFFFF, 29 | 0xFF0000, 0x00FF00, 0x0000FF, 30 | 0x0000FF, 0x00FF00, 0xFF0000]), 3, 3) 31 | 32 | it("testCrop", () => { 33 | assert.strictEqual(SOURCE.isCropSupported(), true) 34 | const cropped: LuminanceSource = SOURCE.crop(1, 1, 1, 1) 35 | assert.strictEqual(cropped.getHeight(), 1) 36 | assert.strictEqual(cropped.getWidth(), 1) 37 | assert.strictEqual(AssertUtils.typedArraysAreEqual(Uint8ClampedArray.from([0x7F]), cropped.getRow(0, null)), true) 38 | }) 39 | 40 | it("testMatrix", () => { 41 | assert.strictEqual(AssertUtils.typedArraysAreEqual(Uint8ClampedArray.from([0x00, 0x7F, 0xFF, 0x3F, 0x7F, 0x3F, 0x3F, 0x7F, 0x3F]), 42 | SOURCE.getMatrix()), true) 43 | const croppedFullWidth: LuminanceSource = SOURCE.crop(0, 1, 3, 2) 44 | assert.strictEqual(AssertUtils.typedArraysAreEqual(Uint8ClampedArray.from([0x3F, 0x7F, 0x3F, 0x3F, 0x7F, 0x3F]), 45 | croppedFullWidth.getMatrix()), true) 46 | const croppedCorner: LuminanceSource = SOURCE.crop(1, 1, 2, 2) 47 | assert.strictEqual(AssertUtils.typedArraysAreEqual(Uint8ClampedArray.from([0x7F, 0x3F, 0x7F, 0x3F]), 48 | croppedCorner.getMatrix()), true) 49 | }) 50 | 51 | it("testGetRow", () => { 52 | assert.strictEqual(AssertUtils.typedArraysAreEqual(Uint8ClampedArray.from([0x3F, 0x7F, 0x3F]), SOURCE.getRow(2, new Uint8ClampedArray(3))), true) 53 | }) 54 | 55 | it("testToString", () => { 56 | assert.strictEqual(SOURCE.toString(), "#+ \n#+#\n#+#\n") 57 | }) 58 | 59 | }) 60 | -------------------------------------------------------------------------------- /src/test/core/common/BitSourceBuilder.ts: -------------------------------------------------------------------------------- 1 | /* 2 | * Copyright 2008 ZXing authors 3 | * 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 7 | * 8 | * http://www.apache.org/licenses/LICENSE-2.0 9 | * 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. 15 | */ 16 | 17 | /*package com.google.zxing.common;*/ 18 | 19 | /*import java.io.ByteArrayOutputStream;*/ 20 | 21 | /** 22 | * Class that lets one easily build an array of bytes by appending bits at a time. 23 | * 24 | * @author Sean Owen 25 | */ 26 | export default class BitSourceBuilder { 27 | 28 | private output: Array