Replace ASSERT, ASSERT_NOT_REACHED, and RELEASE_ASSERT in platform/text

third_party/WebKit/Source/platform/text/BidiResolverTest.cpp

 /*
  * Copyright (C) 2013 Google Inc. 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
@@ skipping 198 matching lines @@
                 << bidi_test::nameFromParagraphDirection(paragraph_direction);
 
   std::vector<int> actual_order;
   std::vector<int> actual_levels;
   actual_levels.assign(input.size(), -1);
   BidiCharacterRun* run = runs.FirstRun();
   while (run) {
     // Blink's UBA just makes runs, the actual ordering of the display of
     // characters is handled later in our pipeline, so we fake it here:
     bool reversed = run->Reversed(false);
-    ASSERT(run->Stop() >= run->Start());
+    DCHECK_GE(run->Stop(), run->Start());
     size_t length = run->Stop() - run->Start();
     for (size_t i = 0; i < length; i++) {
       int input_index = reversed ? run->Stop() - i - 1 : run->Start() + i;
       if (!IsNonRenderedCodePoint(input[input_index]))
         actual_order.push_back(input_index);
       // BidiTest.txt gives expected level data in the order of the original
       // input.
       actual_levels[input_index] = run->Level();
     }
     run = run->Next();
@@ skipping 85 matching lines @@
             << runner.order_failures_ << " order failures.";
 
   EXPECT_EQ(91660u, runner.tests_run_);
   EXPECT_EQ(39u, runner.tests_skipped_);
   EXPECT_EQ(0u, runner.ignored_char_failures_);
   EXPECT_EQ(14533u, runner.level_failures_);
   EXPECT_EQ(14533u, runner.order_failures_);
 }
 
 }  // namespace blink