Revert of Update re2

third_party/re2/re2/testing/string_generator.cc

Index: third_party/re2/re2/testing/string_generator.cc
diff --git a/third_party/re2/re2/testing/string_generator.cc b/third_party/re2/re2/testing/string_generator.cc
index f96ff208dba4d356acb82d117d22f6d35b2170be..5be6d3eb5d9002c9518199e02aba628a6915164c 100644
--- a/third_party/re2/re2/testing/string_generator.cc
+++ b/third_party/re2/re2/testing/string_generator.cc
@@ -43,14 +43,14 @@
 // Returns false if all the numbers have been used.
 bool StringGenerator::IncrementDigits() {
   // First try to increment the current number.
-  for (int i = static_cast<int>(digits_.size()) - 1; i >= 0; i--) {
-    if (++digits_[i] < static_cast<int>(alphabet_.size()))
+  for (int i = digits_.size() - 1; i >= 0; i--) {
+    if (++digits_[i] < alphabet_.size())
       return true;
     digits_[i] = 0;
   }
 
   // If that failed, make a longer number.
-  if (static_cast<int>(digits_.size()) < maxlen_) {
+  if (digits_.size() < maxlen_) {
     digits_.push_back(0);
     return true;
   }
@@ -68,7 +68,7 @@
   int len = acm_->Uniform(maxlen_+1);
   digits_.resize(len);
   for (int i = 0; i < len; i++)
-    digits_[i] = acm_->Uniform(static_cast<int32>(alphabet_.size()));
+    digits_[i] = acm_->Uniform(alphabet_.size());
   return true;
 }
 
@@ -84,7 +84,7 @@
     return sp_;
   }
   s_.clear();
-  for (size_t i = 0; i < digits_.size(); i++) {
+  for (int i = 0; i < digits_.size(); i++) {
     s_ += alphabet_[digits_[i]];
   }
   hasnext_ = random_ ? RandomDigits() : IncrementDigits();
@@ -110,3 +110,4 @@
 }
 
 }  // namespace re2
+