ASSERT -> {DCHECK|DCHECK_XX}, ENABLE(ASSERT) -> DCHECK_IS_ON() in dom

third_party/WebKit/Source/core/dom/DocumentOrderedMap.h

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple 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 44 matching lines @@
     bool containsMultiple(const AtomicString&) const;
     // concrete instantiations of the get<>() method template
     Element* getElementById(const AtomicString&, const TreeScope*) const;
     const HeapVector<Member<Element>>& getAllElementsById(const AtomicString&, const TreeScope*) const;
     Element* getElementByMapName(const AtomicString&, const TreeScope*) const;
     Element* getElementByLowercasedMapName(const AtomicString&, const TreeScope*) const;
     Element* getElementByLabelForAttribute(const AtomicString&, const TreeScope*) const;
 
     DECLARE_TRACE();
 
-#if ENABLE(ASSERT)
+#if DCHECK_IS_ON()
     // While removing a ContainerNode, ID lookups won't be precise should the tree
     // have elements with duplicate IDs contained in the element being removed.
     // Rare trees, but ID lookups may legitimately fail across such removals;
     // this scope object informs DocumentOrderedMaps about the transitory
     // state of the underlying tree.
     class RemoveScope {
         STACK_ALLOCATED();
     public:
         RemoveScope();
         ~RemoveScope();
@@ skipping 40 matching lines @@
 
 inline bool DocumentOrderedMap::containsMultiple(const AtomicString& id) const
 {
     Map::const_iterator it = m_map.find(id);
     return it != m_map.end() && it->value->count > 1;
 }
 
 } // namespace blink
 
 #endif // DocumentOrderedMap_h