Fixing whitespace lint errors.

xfa/src/fxbarcode/qrcode/BC_QRCoderMaskUtil.cpp

 // Copyright 2014 PDFium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
 // Original code is licensed as follows:
 /*
  * Copyright 2008 ZXing authors
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
@@ skipping 14 matching lines @@
 #include "xfa/src/fxbarcode/qrcode/BC_QRCoder.h"
 #include "xfa/src/fxbarcode/qrcode/BC_QRCoderErrorCorrectionLevel.h"
 #include "xfa/src/fxbarcode/qrcode/BC_QRCoderMaskUtil.h"
 CBC_QRCoderMaskUtil::CBC_QRCoderMaskUtil() {}
 CBC_QRCoderMaskUtil::~CBC_QRCoderMaskUtil() {}
 int32_t CBC_QRCoderMaskUtil::ApplyMaskPenaltyRule1(
     CBC_CommonByteMatrix* matrix) {
   return ApplyMaskPenaltyRule1Internal(matrix, TRUE) +
          ApplyMaskPenaltyRule1Internal(matrix, FALSE);
 }
+
 int32_t CBC_QRCoderMaskUtil::ApplyMaskPenaltyRule2(
     CBC_CommonByteMatrix* matrix) {
   int32_t penalty = 0;
   uint8_t* array = matrix->GetArray();
   int32_t width = matrix->GetWidth();
   int32_t height = matrix->GetHeight();
   for (int32_t y = 0; y < height - 1; y++) {
     for (int32_t x = 0; x < width - 1; x++) {
       int32_t value = array[y * width + x];
       if (value == array[y * width + x + 1] &&
           value == array[(y + 1) * width + x] &&
           value == array[(y + 1) * width + x + 1]) {
         penalty++;
       }
     }
   }
   return 3 * penalty;
 }
+
 int32_t CBC_QRCoderMaskUtil::ApplyMaskPenaltyRule3(
     CBC_CommonByteMatrix* matrix) {
   int32_t penalty = 0;
   uint8_t* array = matrix->GetArray();
   int32_t width = matrix->GetWidth();
   int32_t height = matrix->GetHeight();
   for (int32_t y = 0; y < height; ++y) {
     for (int32_t x = 0; x < width; ++x) {
       if (x == 0 &&
           ((y >= 0 && y <= 6) || (y >= height - 7 && y <= height - 1))) {
@@ skipping 123 matching lines @@
         }
       } else {
         numSameBitCells = 1;
         prevBit = bit;
       }
     }
     numSameBitCells = 0;
   }
   return penalty;
 }