Rename ASSERT_NO_EXCEPTION_STATE and IGNORE_EXCEPTION_STATE

Source/core/dom/Range.h

 /*
  * (C) 1999 Lars Knoll (knoll@kde.org)
  * (C) 2000 Gunnstein Lye (gunnstein@netcom.no)
  * (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
@@ skipping 50 matching lines @@
     int endOffset() const { return m_end.offset(); }
 
     Node* startContainer(ExceptionState&) const;
     int startOffset(ExceptionState&) const;
     Node* endContainer(ExceptionState&) const;
     int endOffset(ExceptionState&) const;
     bool collapsed(ExceptionState&) const;
 
     Node* commonAncestorContainer(ExceptionState&) const;
     static Node* commonAncestorContainer(Node* containerA, Node* containerB);
-    void setStart(PassRefPtr<Node> container, int offset, ExceptionState& = ASSERT_NO_EXCEPTION_STATE);
-    void setEnd(PassRefPtr<Node> container, int offset, ExceptionState& = ASSERT_NO_EXCEPTION_STATE);
+    void setStart(PassRefPtr<Node> container, int offset, ExceptionState& = ASSERT_NO_EXCEPTION);
+    void setEnd(PassRefPtr<Node> container, int offset, ExceptionState& = ASSERT_NO_EXCEPTION);
     void collapse(bool toStart, ExceptionState&);
     bool isPointInRange(Node* refNode, int offset, ExceptionState&);
     short comparePoint(Node* refNode, int offset, ExceptionState&) const;
     enum CompareResults { NODE_BEFORE, NODE_AFTER, NODE_BEFORE_AND_AFTER, NODE_INSIDE };
     CompareResults compareNode(Node* refNode, ExceptionState&) const;
     enum CompareHow { START_TO_START, START_TO_END, END_TO_END, END_TO_START };
     short compareBoundaryPoints(CompareHow, const Range* sourceRange, ExceptionState&) const;
     static short compareBoundaryPoints(Node* containerA, int offsetA, Node* containerB, int offsetB, ExceptionState&);
     static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, const RangeBoundaryPoint& boundaryB, ExceptionState&);
     bool boundaryPointsValid() const;
     bool intersectsNode(Node* refNode, ExceptionState&);
     void deleteContents(ExceptionState&);
     PassRefPtr<DocumentFragment> extractContents(ExceptionState&);
     PassRefPtr<DocumentFragment> cloneContents(ExceptionState&);
     void insertNode(PassRefPtr<Node>, ExceptionState&);
     String toString(ExceptionState&) const;
 
     String toHTML() const;
     String text() const;
 
     PassRefPtr<DocumentFragment> createContextualFragment(const String& html, ExceptionState&);
 
     void detach(ExceptionState&);
     PassRefPtr<Range> cloneRange(ExceptionState&) const;
 
-    void setStartAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION_STATE);
-    void setEndBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION_STATE);
-    void setEndAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION_STATE);
-    void selectNode(Node*, ExceptionState& = ASSERT_NO_EXCEPTION_STATE);
+    void setStartAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION);
+    void setEndBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION);
+    void setEndAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION);
+    void selectNode(Node*, ExceptionState& = ASSERT_NO_EXCEPTION);
     void selectNodeContents(Node*, ExceptionState&);
     void surroundContents(PassRefPtr<Node>, ExceptionState&);
     void setStartBefore(Node*, ExceptionState&);
 
     const Position startPosition() const { return m_start.toPosition(); }
     const Position endPosition() const { return m_end.toPosition(); }
-    void setStart(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION_STATE);
-    void setEnd(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION_STATE);
+    void setStart(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION);
+    void setEnd(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION);
 
     Node* firstNode() const;
     Node* pastLastNode() const;
 
     ShadowRoot* shadowRoot() const;
 
     enum RangeInFixedPosition {
         NotFixedPosition,
         PartiallyFixedPosition,
         EntirelyFixedPosition
@@ skipping 58 matching lines @@
 bool areRangesEqual(const Range*, const Range*);
 
 } // namespace
 
 #ifndef NDEBUG
 // Outside the WebCore namespace for ease of invocation from gdb.
 void showTree(const WebCore::Range*);
 #endif
 
 #endif