Replace ASSERT, ASSERT_NOT_REACHED, and RELEASE_ASSERT in platform/text

third_party/WebKit/Source/platform/text/SuffixTree.h

 /*
  * Copyright (C) 2010 Adam Barth. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 87 matching lines @@
 
     ChildrenVector m_children;
     bool m_isLeaf;
   };
 
   void build(const String& text) {
     for (unsigned base = 0; base < text.length(); ++base) {
       Node* current = &m_root;
       unsigned limit = std::min(base + m_depth, text.length());
       for (unsigned offset = 0; base + offset < limit; ++offset) {
-        ASSERT(current != &m_leaf);
+        DCHECK_NE(current, &m_leaf);
         Node*& child = current->at(Codebook::codeWord(text[base + offset]));
         if (!child)
           child = base + offset + 1 == limit ? &m_leaf : new Node();
         current = child;
       }
     }
   }
 
   Node m_root;
   unsigned m_depth;
 
   // Instead of allocating a fresh empty leaf node for ever leaf in the tree
   // (there can be a lot of these), we alias all the leaves to this "static"
   // leaf node.
   Node m_leaf;
 };
 
 }  // namespace blink
 
 #endif  // SuffixTree_h