Index: third_party/WebKit/Source/core/dom/Node.cpp |
diff --git a/third_party/WebKit/Source/core/dom/Node.cpp b/third_party/WebKit/Source/core/dom/Node.cpp |
index 8e19a72a5765676f2d251006ae1098cf3285c06a..c89d0295736d40a685145aa5bb4903d9dfb1cc3c 100644 |
--- a/third_party/WebKit/Source/core/dom/Node.cpp |
+++ b/third_party/WebKit/Source/core/dom/Node.cpp |
@@ -524,9 +524,10 @@ void Node::before(const HeapVector<NodeOrString>& nodes, |
return; |
Node* viablePreviousSibling = findViablePreviousSibling(*this, nodes); |
if (Node* node = convertNodesIntoNode(nodes, document(), exceptionState)) |
- parent->insertBefore(node, viablePreviousSibling |
- ? viablePreviousSibling->nextSibling() |
- : parent->firstChild(), |
+ parent->insertBefore(node, |
+ viablePreviousSibling |
+ ? viablePreviousSibling->nextSibling() |
+ : parent->firstChild(), |
exceptionState); |
} |
@@ -1497,11 +1498,10 @@ unsigned short Node::compareDocumentPosition( |
// 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 |
- ? kDocumentPositionFollowing | kDocumentPositionContainedBy | |
- connection |
- : kDocumentPositionPreceding | kDocumentPositionContains | |
- connection; |
+ return index1 < index2 ? kDocumentPositionFollowing | |
+ kDocumentPositionContainedBy | connection |
+ : kDocumentPositionPreceding | |
+ kDocumentPositionContains | connection; |
} |
String Node::debugName() const { |