Index: cc/layer_sorter.cc |
diff --git a/cc/layer_sorter.cc b/cc/layer_sorter.cc |
index 0344e809f9a6201464ba61fea5db4ab2ea3122d7..d106442812a894d174b78c7c4e75dc39f5cf3c3a 100644 |
--- a/cc/layer_sorter.cc |
+++ b/cc/layer_sorter.cc |
@@ -296,7 +296,7 @@ void CCLayerSorter::createGraphEdges() |
void CCLayerSorter::removeEdgeFromList(GraphEdge* edge, std::vector<GraphEdge*>& list) |
{ |
std::vector<GraphEdge*>::iterator iter = std::find(list.begin(), list.end(), edge); |
- ASSERT(iter != list.end()); |
+ DCHECK(iter != list.end()); |
list.erase(iter); |
} |
@@ -381,7 +381,7 @@ void CCLayerSorter::sort(LayerList::iterator first, LayerList::iterator last) |
nextNode = &m_nodes[i]; |
} |
} |
- ASSERT(nextNode); |
+ DCHECK(nextNode); |
// Remove all its incoming edges. |
for (unsigned e = 0; e < nextNode->incoming.size(); e++) { |
GraphEdge* incomingEdge = nextNode->incoming[e]; |