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

Unified Diff: third_party/WebKit/Source/core/dom/TreeScope.cpp

Issue 2068053002: Rename Blink constants generated from IDL files. (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Fix unintended exception message change Created 4 years, 5 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 side-by-side diff with in-line comments
Download patch
Index: third_party/WebKit/Source/core/dom/TreeScope.cpp
diff --git a/third_party/WebKit/Source/core/dom/TreeScope.cpp b/third_party/WebKit/Source/core/dom/TreeScope.cpp
index 6f791307b23225ed76a8a8d5d15f23f609817cbf..97af9e7615017f94c4b5704ce076c5238ef94acb 100644
--- a/third_party/WebKit/Source/core/dom/TreeScope.cpp
+++ b/third_party/WebKit/Source/core/dom/TreeScope.cpp
@@ -420,7 +420,7 @@ unsigned short TreeScope::comparePosition(const TreeScope& otherScope) const
unsigned index1 = chain1.size();
unsigned index2 = chain2.size();
if (chain1[index1 - 1] != chain2[index2 - 1])
- return Node::DOCUMENT_POSITION_DISCONNECTED | Node::DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC;
+ return Node::kDocumentPositionDisconnected | Node::kDocumentPositionImplementationSpecific;
for (unsigned i = std::min(index1, index2); i; --i) {
const TreeScope* child1 = chain1[--index1];
@@ -433,18 +433,18 @@ unsigned short TreeScope::comparePosition(const TreeScope& otherScope) const
for (const ShadowRoot* child = toShadowRoot(child2->rootNode()).olderShadowRoot(); child; child = child->olderShadowRoot()) {
if (child == child1)
- return Node::DOCUMENT_POSITION_FOLLOWING;
+ return Node::kDocumentPositionFollowing;
}
- return Node::DOCUMENT_POSITION_PRECEDING;
+ return Node::kDocumentPositionPreceding;
}
}
// There was no difference between the two parent chains, i.e., one was a subset of the other. The shorter
// chain is the ancestor.
return index1 < index2 ?
- Node::DOCUMENT_POSITION_FOLLOWING | Node::DOCUMENT_POSITION_CONTAINED_BY :
- Node::DOCUMENT_POSITION_PRECEDING | Node::DOCUMENT_POSITION_CONTAINS;
+ Node::kDocumentPositionFollowing | Node::kDocumentPositionContainedBy :
+ Node::kDocumentPositionPreceding | Node::kDocumentPositionContains;
}
const TreeScope* TreeScope::commonAncestorTreeScope(const TreeScope& other) const

Powered by Google App Engine
This is Rietveld 408576698