Replace ASSERT with DCHECK in platform/

third_party/WebKit/Source/platform/PODRedBlackTree.h

 /*
  * Copyright (C) 2010 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:
  *
  * 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
@@ skipping 153 matching lines @@
     if (!arena_)
       arena_ = PODFreeListArena<Node>::Create();
   }
 
   void InitIfNeeded(PODFreeListArena<Node>* arena) {
     if (!arena_)
       arena_ = arena;
   }
 
   void Add(const T& data) {
-    ASSERT(IsInitialized());
+    DCHECK(IsInitialized());
     Node* node = arena_->template AllocateObject<T>(data);
     InsertNode(node);
   }
 
   // Returns true if the datum was found in the tree.
   bool Remove(const T& data) {
-    ASSERT(IsInitialized());
+    DCHECK(IsInitialized());
     Node* node = TreeSearch(data);
     if (node) {
       DeleteNode(node);
       return true;
     }
     return false;
   }
 
   bool Contains(const T& data) const {
-    ASSERT(IsInitialized());
+    DCHECK(IsInitialized());
     return TreeSearch(data);
   }
 
   void VisitInorder(Visitor* visitor) const {
-    ASSERT(IsInitialized());
+    DCHECK(IsInitialized());
     if (!root_)
       return;
     VisitInorderImpl(root_, visitor);
   }
 
   int size() const {
-    ASSERT(IsInitialized());
+    DCHECK(IsInitialized());
     Counter counter;
     VisitInorder(&counter);
     return counter.Count();
   }
 
   // See the class documentation for an explanation of this property.
   void SetNeedsFullOrderingComparisons(bool needs_full_ordering_comparisons) {
     needs_full_ordering_comparisons_ = needs_full_ordering_comparisons;
   }
 
   virtual bool CheckInvariants() const {
-    ASSERT(IsInitialized());
+    DCHECK(IsInitialized());
     int black_count;
     return CheckInvariantsFromNode(root_, &black_count);
   }
 
 #ifndef NDEBUG
   // Dumps the tree's contents to the logging info stream for
   // debugging purposes.
   void Dump() const {
     if (arena_)
       DumpFromNode(root_, 0);
@@ skipping 311 matching lines @@
   // a node. Note that x may be null, which is why xParent must be
   // supplied.
   void DeleteFixup(Node* x, Node* x_parent) {
     while (x != root_ && (!x || x->GetColor() == kBlack)) {
       if (x == x_parent->Left()) {
         // Note: the text points out that w can not be null.
         // The reason is not obvious from simply looking at
         // the code; it comes about from the properties of the
         // red-black tree.
         Node* w = x_parent->Right();
-        ASSERT(w);  // x's sibling should not be null.
+        DCHECK(w);  // x's sibling should not be null.
         if (w->GetColor() == kRed) {
           // Case 1
           w->SetColor(kBlack);
           x_parent->SetColor(kRed);
           LeftRotate(x_parent);
           w = x_parent->Right();
         }
         if ((!w->Left() || w->Left()->GetColor() == kBlack) &&
             (!w->Right() || w->Right()->GetColor() == kBlack)) {
           // Case 2
@@ skipping 19 matching lines @@
         }
       } else {
         // Same as "then" clause with "right" and "left"
         // exchanged.
 
         // Note: the text points out that w can not be null.
         // The reason is not obvious from simply looking at
         // the code; it comes about from the properties of the
         // red-black tree.
         Node* w = x_parent->Left();
-        ASSERT(w);  // x's sibling should not be null.
+        DCHECK(w);  // x's sibling should not be null.
         if (w->GetColor() == kRed) {
           // Case 1
           w->SetColor(kBlack);
           x_parent->SetColor(kRed);
           RightRotate(x_parent);
           w = x_parent->Left();
         }
         if ((!w->Right() || w->Right()->GetColor() == kBlack) &&
             (!w->Left() || w->Left()->GetColor() == kBlack)) {
           // Case 2
@@ skipping 188 matching lines @@
   Node* root_;
   bool needs_full_ordering_comparisons_;
 #ifndef NDEBUG
   bool verbose_debugging_;
 #endif
 };
 
 }  // namespace blink
 
 #endif  // PODRedBlackTree_h