Replace ASSERT*() with DCHECK*() in core/xml/.

third_party/WebKit/Source/core/xml/XPathNodeSet.cpp

 /*
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * 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 33 matching lines @@
 {
     NodeSet* nodeSet = NodeSet::create();
     nodeSet->m_isSorted = other.m_isSorted;
     nodeSet->m_subtreesAreDisjoint = other.m_subtreesAreDisjoint;
     nodeSet->m_nodes.appendVector(other.m_nodes);
     return nodeSet;
 }
 
 static inline Node* parentWithDepth(unsigned depth, const NodeSetVector& parents)
 {
-    ASSERT(parents.size() >= depth + 1);
+    DCHECK_GE(parents.size(), depth + 1);
     return parents[parents.size() - 1 - depth];
 }
 
 static void sortBlock(unsigned from, unsigned to, HeapVector<NodeSetVector>& parentMatrix, bool mayContainAttributeNodes)
 {
     // Should not call this function with less that two nodes to sort.
-    ASSERT(from + 1 < to);
+    DCHECK_LT(from + 1, to);
     unsigned minDepth = UINT_MAX;
     for (unsigned i = from; i < to; ++i) {
         unsigned depth = parentMatrix[i].size() - 1;
         if (minDepth > depth)
             minDepth = depth;
     }
 
     // Find the common ancestor.
     unsigned commonAncestorDepth = minDepth;
     Node* commonAncestor;
@@ skipping 62 matching lines @@
         // children in the node-set to the beginning.
         if (parentNodes.contains(n)) {
             for (unsigned i = groupEnd; i < to; ++i) {
                 if (parentWithDepth(commonAncestorDepth + 1, parentMatrix[i]) == n)
                     parentMatrix[i].swap(parentMatrix[groupEnd++]);
             }
 
             if (groupEnd - previousGroupEnd > 1)
                 sortBlock(previousGroupEnd, groupEnd, parentMatrix, mayContainAttributeNodes);
 
-            ASSERT(previousGroupEnd != groupEnd);
+            DCHECK_NE(previousGroupEnd, groupEnd);
             previousGroupEnd = groupEnd;
-#if ENABLE(ASSERT)
+#if DCHECK_IS_ON()
             parentNodes.remove(n);
 #endif
         }
     }
 
-    ASSERT(parentNodes.isEmpty());
+    DCHECK(parentNodes.isEmpty());
 }
 
 void NodeSet::sort() const
 {
     if (m_isSorted)
         return;
 
     unsigned nodeCount = m_nodes.size();
     if (nodeCount < 2) {
         const_cast<bool&>(m_isSorted) = true;
@@ skipping 44 matching lines @@
     }
     return node;
 }
 
 void NodeSet::traversalSort() const
 {
     HeapHashSet<Member<Node>> nodes;
     bool containsAttributeNodes = false;
 
     unsigned nodeCount = m_nodes.size();
-    ASSERT(nodeCount > 1);
+    DCHECK_GT(nodeCount, 1u);
     for (unsigned i = 0; i < nodeCount; ++i) {
         Node* node = m_nodes[i].get();
         nodes.add(node);
         if (node->isAttributeNode())
             containsAttributeNodes = true;
     }
 
     HeapVector<Member<Node>> sortedNodes;
     sortedNodes.reserveInitialCapacity(nodeCount);
 
     for (Node& n : NodeTraversal::startsAt(*findRootNode(m_nodes.first()))) {
         if (nodes.contains(&n))
             sortedNodes.append(&n);
 
         if (!containsAttributeNodes || !n.isElementNode())
             continue;
 
         Element* element = toElement(&n);
         AttributeCollection attributes = element->attributes();
         for (auto& attribute : attributes) {
             Attr* attr = element->attrIfExists(attribute.name());
             if (attr && nodes.contains(attr))
                 sortedNodes.append(attr);
         }
     }
 
-    ASSERT(sortedNodes.size() == nodeCount);
+    DCHECK_EQ(sortedNodes.size(), nodeCount);
     const_cast<HeapVector<Member<Node>>&>(m_nodes).swap(sortedNodes);
 }
 
 void NodeSet::reverse()
 {
     if (m_nodes.isEmpty())
         return;
 
     unsigned from = 0;
     unsigned to = m_nodes.size() - 1;
@@ skipping 18 matching lines @@
 Node* NodeSet::anyNode() const
 {
     if (isEmpty())
         return nullptr;
 
     return m_nodes.at(0).get();
 }
 
 } // namespace XPath
 } // namespace blink