Source/core/dom/Range.h - Issue 592293003: IDL: Remove the CompareHow special case

Side by Side Diff: Source/core/dom/Range.h

Issue 592293003: IDL: Remove the CompareHow special case (Closed) Base URL: https://chromium.googlesource.com/chromium/blink.git@master

Patch Set: Created 6 years, 3 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch

« no previous file with comments | « Source/bindings/tests/results/core/V8TestObject.cpp ('k') | Source/core/dom/Range.cpp » ('j') | no next file with comments »

OLD	NEW
1 /*	1 /*

2 * (C) 1999 Lars Knoll (knoll@kde.org)	2 * (C) 1999 Lars Knoll (knoll@kde.org)

3 * (C) 2000 Gunnstein Lye (gunnstein@netcom.no)	3 * (C) 2000 Gunnstein Lye (gunnstein@netcom.no)

4 * (C) 2000 Frederik Holljen (frederik.holljen@hig.no)	4 * (C) 2000 Frederik Holljen (frederik.holljen@hig.no)

5 * (C) 2001 Peter Kelly (pmk@post.com)	5 * (C) 2001 Peter Kelly (pmk@post.com)

6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv ed.	6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv ed.

7 *	7 *

8 * This library is free software; you can redistribute it and/or	8 * This library is free software; you can redistribute it and/or

9 * modify it under the terms of the GNU Library General Public	9 * modify it under the terms of the GNU Library General Public

10 * License as published by the Free Software Foundation; either	10 * License as published by the Free Software Foundation; either

(...skipping 55 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
66 Node* commonAncestorContainer() const;	66 Node* commonAncestorContainer() const;

67 static Node* commonAncestorContainer(Node* containerA, Node* containerB);	67 static Node* commonAncestorContainer(Node* containerA, Node* containerB);

68 void setStart(PassRefPtrWillBeRawPtr<Node> container, int offset, ExceptionS tate& = ASSERT_NO_EXCEPTION);	68 void setStart(PassRefPtrWillBeRawPtr<Node> container, int offset, ExceptionS tate& = ASSERT_NO_EXCEPTION);

69 void setEnd(PassRefPtrWillBeRawPtr<Node> container, int offset, ExceptionSta te& = ASSERT_NO_EXCEPTION);	69 void setEnd(PassRefPtrWillBeRawPtr<Node> container, int offset, ExceptionSta te& = ASSERT_NO_EXCEPTION);

70 void collapse(bool toStart);	70 void collapse(bool toStart);

71 bool isPointInRange(Node* refNode, int offset, ExceptionState&);	71 bool isPointInRange(Node* refNode, int offset, ExceptionState&);

72 short comparePoint(Node* refNode, int offset, ExceptionState&) const;	72 short comparePoint(Node* refNode, int offset, ExceptionState&) const;

73 enum CompareResults { NODE_BEFORE, NODE_AFTER, NODE_BEFORE_AND_AFTER, NODE_I NSIDE };	73 enum CompareResults { NODE_BEFORE, NODE_AFTER, NODE_BEFORE_AND_AFTER, NODE_I NSIDE };

74 CompareResults compareNode(Node* refNode, ExceptionState&) const;	74 CompareResults compareNode(Node* refNode, ExceptionState&) const;

75 enum CompareHow { START_TO_START, START_TO_END, END_TO_END, END_TO_START };	75 enum CompareHow { START_TO_START, START_TO_END, END_TO_END, END_TO_START };

76 short compareBoundaryPoints(CompareHow, const Range* sourceRange, ExceptionS tate&) const;	76 short compareBoundaryPoints(unsigned how, const Range* sourceRange, Exceptio nState&) const;

77 static short compareBoundaryPoints(Node* containerA, int offsetA, Node* cont ainerB, int offsetB, ExceptionState&);	77 static short compareBoundaryPoints(Node* containerA, int offsetA, Node* cont ainerB, int offsetB, ExceptionState&);

78 static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, cons t RangeBoundaryPoint& boundaryB, ExceptionState&);	78 static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, cons t RangeBoundaryPoint& boundaryB, ExceptionState&);

79 bool boundaryPointsValid() const;	79 bool boundaryPointsValid() const;

80 bool intersectsNode(Node* refNode, ExceptionState&);	80 bool intersectsNode(Node* refNode, ExceptionState&);

81 static bool intersectsNode(Node* refNode, const Position& start, const Posit ion& end, ExceptionState&);	81 static bool intersectsNode(Node* refNode, const Position& start, const Posit ion& end, ExceptionState&);

82 void deleteContents(ExceptionState&);	82 void deleteContents(ExceptionState&);

83 PassRefPtrWillBeRawPtr<DocumentFragment> extractContents(ExceptionState&);	83 PassRefPtrWillBeRawPtr<DocumentFragment> extractContents(ExceptionState&);

84 PassRefPtrWillBeRawPtr<DocumentFragment> cloneContents(ExceptionState&);	84 PassRefPtrWillBeRawPtr<DocumentFragment> cloneContents(ExceptionState&);

85 void insertNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&);	85 void insertNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&);

86 String toString() const;	86 String toString() const;

(...skipping 91 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
178 bool areRangesEqual(const Range, const Range);	178 bool areRangesEqual(const Range, const Range);

179	179

180 } // namespace blink	180 } // namespace blink

181	181

182 #ifndef NDEBUG	182 #ifndef NDEBUG

183 // Outside the WebCore namespace for ease of invocation from gdb.	183 // Outside the WebCore namespace for ease of invocation from gdb.

184 void showTree(const blink::Range*);	184 void showTree(const blink::Range*);

185 #endif	185 #endif

186	186

187 #endif // Range_h	187 #endif // Range_h

OLD	NEW