zxing-js/library

Function embedDataBits has 35 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    public static embedDataBits(dataBits: BitArray, maskPattern: number /*int*/, matrix: ByteMatrix): void {
        let bitIndex = 0;
        let direction = -1;
        // Start from the right bottom cell.
        let x = matrix.getWidth() - 1;

Function textCompaction has 35 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  private static textCompaction(codewords: Int32Array, codeIndex: int, result: StringBuilder): int {
    // 2 character per codeword
    let textCompactionData: Int32Array = new Int32Array((codewords[0] - codeIndex) * 2);
    // Used to hold the byte compaction value if there is a mode shift
    let byteCompactionData: Int32Array = new Int32Array((codewords[0] - codeIndex) * 2);

Function findGuardPattern has 35 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  private static findGuardPattern( matrix: BitMatrix,
                                         column: /*int*/ number,
                                         row: /*int*/ number,
                                         width: /*int*/ number,
                                         whiteFirst: boolean,

Function buildBitArray has 35 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  static buildBitArray(pairs: Array<ExpandedPair>): BitArray {
    let charNumber: number = pairs.length * 2 - 1;
    if (pairs[pairs.length - 1].getRightChar() == null) {
      charNumber -= 1;
    }

Function getMatrixCenter has 35 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    private getMatrixCenter(): Point {

        let pointA: ResultPoint;
        let pointB: ResultPoint;
        let pointC: ResultPoint;

Similar blocks of code found in 4 locations. Consider refactoring.

Open

          case '$':
            // $A to $Z map to control codes SH to SB
            if (next >= 'A' && next <= 'Z') {
              decodedChar = String.fromCharCode(next.charCodeAt(0) - 64);
            } else {

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

          case 'd':
            // +A to +Z map to a to z
            if (next >= 'A' && next <= 'Z') {
              decodedChar = String.fromCharCode(next.charCodeAt(0) + 32);
            } else {

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

          case 'a':
            // $A to $Z map to control codes SH to SB
            if (next >= 'A' && next <= 'Z') {
              decodedChar = String.fromCharCode(next.charCodeAt(0) - 64);
            } else {

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

          case '+':
            // +A to +Z map to a to z
            if (next >= 'A' && next <= 'Z') {
              decodedChar = String.fromCharCode(next.charCodeAt(0) + 32);
            } else {

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

        if (yi < this.width / 2.0) {
            return [
                new ResultPoint(ti - CORR, tj + CORR),
                new ResultPoint(zi + CORR, zj + CORR),
                new ResultPoint(xi - CORR, xj - CORR),

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

        try {
            let detectorResult = detector.detectMirror(false);
            points = detectorResult.getPoints();
            this.reportFoundResultPoints(hints, points);
            decoderResult = new Decoder().decode(detectorResult);

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

            try {
                let detectorResult = detector.detectMirror(true);
                points = detectorResult.getPoints();
                this.reportFoundResultPoints(hints, points);
                decoderResult = new Decoder().decode(detectorResult);

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

        } else {
            return [
                new ResultPoint(ti + CORR, tj + CORR),
                new ResultPoint(zi + CORR, zj - CORR),
                new ResultPoint(xi - CORR, xj + CORR),

• Read up
  Read up

Function processFinderPatternInfo has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  protected processFinderPatternInfo(info: FinderPatternInfo): DetectorResult {

    const topLeft: FinderPattern = info.getTopLeft();
    const topRight: FinderPattern = info.getTopRight();
    const bottomLeft: FinderPattern = info.getBottomLeft();

Function toString has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    public toString(): string {
        let result = '';
        for (let degree = this.getDegree(); degree >= 0; degree--) {
            let coefficient = this.getCoefficient(degree);
            if (coefficient !== 0) {

Function toString has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    public toString(): string {
        let result = '';
        for (let degree = this.getDegree(); degree >= 0; degree--) {
            let coefficient = this.getCoefficient(degree);
            if (coefficient !== 0) {

Function decode has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  public decode(received: Int32Array,
    numECCodewords: int,
    erasures: Int32Array): int {

    let poly: ModulusPoly = new ModulusPoly(this.field, received);

Function retrieveNextPair has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  retrieveNextPair(
    row: BitArray,
    previousPairs: Array<ExpandedPair>,
    rowNumber: number
  ): ExpandedPair {

Function decodeRow2pairs has 34 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  decodeRow2pairs(rowNumber: number, row: BitArray): Array<ExpandedPair> {
    let done = false;
    while (!done) {
      try {
        this.pairs.push(this.retrieveNextPair(row, this.pairs, rowNumber));

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    public flip(x: number /*int*/, y: number /*int*/): void {
        const offset = y * this.rowSize + Math.floor(x / 32);
        this.bits[offset] ^= ((1 << (x & 0x1f)) & 0xFFFFFFFF);
    }

• Read up
  Read up