Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(82)

Issues Search
    My Issues | Starred     Open | Closed | All

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

Issue 2068053002: Rename Blink constants generated from IDL files. (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Rebase Created 4 years, 4 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 | « third_party/WebKit/Source/core/dom/ProcessingInstruction.cpp ('k') | third_party/WebKit/Source/core/dom/Range.cpp » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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 57 matching lines...) Expand 10 before | Expand all | Expand 10 after
68 68
69 Node* commonAncestorContainer() const; 69 Node* commonAncestorContainer() const;
70 static Node* commonAncestorContainer(const Node* containerA, const Node* con tainerB); 70 static Node* commonAncestorContainer(const Node* containerA, const Node* con tainerB);
71 void setStart(Node* container, int offset, ExceptionState& = ASSERT_NO_EXCEP TION); 71 void setStart(Node* container, int offset, ExceptionState& = ASSERT_NO_EXCEP TION);
72 void setEnd(Node* container, int offset, ExceptionState& = ASSERT_NO_EXCEPTI ON); 72 void setEnd(Node* container, int offset, ExceptionState& = ASSERT_NO_EXCEPTI ON);
73 void collapse(bool toStart); 73 void collapse(bool toStart);
74 bool isNodeFullyContained(Node&) const; 74 bool isNodeFullyContained(Node&) const;
75 bool isPointInRange(Node* refNode, int offset, ExceptionState&) const; 75 bool isPointInRange(Node* refNode, int offset, ExceptionState&) const;
76 short comparePoint(Node* refNode, int offset, ExceptionState&) const; 76 short comparePoint(Node* refNode, int offset, ExceptionState&) const;
77 enum CompareResults { NODE_BEFORE, NODE_AFTER, NODE_BEFORE_AND_AFTER, NODE_I NSIDE }; 77 enum CompareResults { NODE_BEFORE, NODE_AFTER, NODE_BEFORE_AND_AFTER, NODE_I NSIDE };
78 enum CompareHow { START_TO_START, START_TO_END, END_TO_END, END_TO_START }; 78 enum CompareHow { kStartToStart, kStartToEnd, kEndToEnd, kEndToStart };
79 short compareBoundaryPoints(unsigned how, const Range* sourceRange, Exceptio nState&) const; 79 short compareBoundaryPoints(unsigned how, const Range* sourceRange, Exceptio nState&) const;
80 static short compareBoundaryPoints(Node* containerA, int offsetA, Node* cont ainerB, int offsetB, ExceptionState&); 80 static short compareBoundaryPoints(Node* containerA, int offsetA, Node* cont ainerB, int offsetB, ExceptionState&);
81 static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, cons t RangeBoundaryPoint& boundaryB, ExceptionState&); 81 static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, cons t RangeBoundaryPoint& boundaryB, ExceptionState&);
82 bool boundaryPointsValid() const; 82 bool boundaryPointsValid() const;
83 bool intersectsNode(Node* refNode, ExceptionState&); 83 bool intersectsNode(Node* refNode, ExceptionState&);
84 static bool intersectsNode(Node* refNode, const Position& start, const Posit ion& end, ExceptionState&); 84 static bool intersectsNode(Node* refNode, const Position& start, const Posit ion& end, ExceptionState&);
85 void deleteContents(ExceptionState&); 85 void deleteContents(ExceptionState&);
86 DocumentFragment* extractContents(ExceptionState&); 86 DocumentFragment* extractContents(ExceptionState&);
87 DocumentFragment* cloneContents(ExceptionState&); 87 DocumentFragment* cloneContents(ExceptionState&);
88 void insertNode(Node*, ExceptionState&); 88 void insertNode(Node*, ExceptionState&);
(...skipping 82 matching lines...) Expand 10 before | Expand all | Expand 10 after
171 using RangeVector = HeapVector<Member<Range>>; 171 using RangeVector = HeapVector<Member<Range>>;
172 172
173 } // namespace blink 173 } // namespace blink
174 174
175 #ifndef NDEBUG 175 #ifndef NDEBUG
176 // Outside the WebCore namespace for ease of invocation from gdb. 176 // Outside the WebCore namespace for ease of invocation from gdb.
177 void showTree(const blink::Range*); 177 void showTree(const blink::Range*);
178 #endif 178 #endif
179 179
180 #endif // Range_h 180 #endif // Range_h
OLDNEW
« no previous file with comments | « third_party/WebKit/Source/core/dom/ProcessingInstruction.cpp ('k') | third_party/WebKit/Source/core/dom/Range.cpp » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698