Fix presubmit errors caused by updated depot tools

src/bignum.h

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 74 matching lines @@
     return PlusCompare(a, b, c) == 0;
   }
   // Returns a + b <= c
   static bool PlusLessEqual(const Bignum& a, const Bignum& b, const Bignum& c) {
     return PlusCompare(a, b, c) <= 0;
   }
   // Returns a + b < c
   static bool PlusLess(const Bignum& a, const Bignum& b, const Bignum& c) {
     return PlusCompare(a, b, c) < 0;
   }
+
  private:
   typedef uint32_t Chunk;
   typedef uint64_t DoubleChunk;
 
   static const int kChunkSize = sizeof(Chunk) * 8;
   static const int kDoubleChunkSize = sizeof(DoubleChunk) * 8;
   // With bigit size of 28 we loose some bits, but a double still fits easily
   // into two chunks, and more importantly we can use the Comba multiplication.
   static const int kBigitSize = 28;
   static const Chunk kBigitMask = (1 << kBigitSize) - 1;
@@ skipping 26 matching lines @@
   int used_digits_;
   // The Bignum's value equals value(bigits_) * 2^(exponent_ * kBigitSize).
   int exponent_;
 
   DISALLOW_COPY_AND_ASSIGN(Bignum);
 };
 
 } }  // namespace v8::internal
 
 #endif  // V8_BIGNUM_H_