From bb093f12a450e4ce2be6bacadff01495cb17eab4 Mon Sep 17 00:00:00 2001
From: Paul Wankadia <junyer@google.com>
Date: Thu, 22 Feb 2018 04:53:34 -0800
Subject: [PATCH] Oops, not in DeBruijnString() though.

Change-Id: I537ddc8e4ffc3cb430813afd338ddd682e1bfcec
Reviewed-on: https://code-review.googlesource.com/24070
Reviewed-by: Paul Wankadia <junyer@google.com>
---
 re2/testing/dfa_test.cc | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/re2/testing/dfa_test.cc b/re2/testing/dfa_test.cc
index 58bd49fe5..eb44b4a26 100644
--- a/re2/testing/dfa_test.cc
+++ b/re2/testing/dfa_test.cc
@@ -117,8 +117,8 @@ TEST(SingleThreaded, BuildEntireDFA) {
 // position in the input, never reusing any states until it gets to the
 // end of the string.  This is the worst possible case for DFA execution.
 static string DeBruijnString(int n) {
-  ASSERT_LT(n, static_cast<int>(8*sizeof(int)));
-  ASSERT_GT(n, 0);
+  CHECK_LT(n, static_cast<int>(8*sizeof(int)));
+  CHECK_GT(n, 0);
 
   std::vector<bool> did(size_t{1}<<n);
   for (int i = 0; i < 1<<n; i++)
@@ -138,7 +138,7 @@ static string DeBruijnString(int n) {
     } else {
       s.append("0");
     }
-    ASSERT_FALSE(did[bits]);
+    CHECK(!did[bits]);
     did[bits] = true;
   }
   return s;