Fix style erros in XPath-related files.

Source/core/xml/XPathResult.cpp

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
@@ skipping 25 matching lines @@
 
 using namespace XPath;
 
 XPathResult::XPathResult(Document* document, const Value& value)
     : m_value(value)
     , m_nodeSetPosition(0)
     , m_domTreeVersion(0)
 {
     ScriptWrappable::init(this);
     switch (m_value.type()) {
-        case Value::BooleanValue:
-            m_resultType = BOOLEAN_TYPE;
-            return;
-        case Value::NumberValue:
-            m_resultType = NUMBER_TYPE;
-            return;
-        case Value::StringValue:
-            m_resultType = STRING_TYPE;
-            return;
-        case Value::NodeSetValue:
-            m_resultType = UNORDERED_NODE_ITERATOR_TYPE;
-            m_nodeSetPosition = 0;
-            m_nodeSet = NodeSet::create(m_value.toNodeSet());
-            m_document = document;
-            m_domTreeVersion = document->domTreeVersion();
-            return;
+    case Value::BooleanValue:
+        m_resultType = BOOLEAN_TYPE;
+        return;
+    case Value::NumberValue:
+        m_resultType = NUMBER_TYPE;
+        return;
+    case Value::StringValue:
+        m_resultType = STRING_TYPE;
+        return;
+    case Value::NodeSetValue:
+        m_resultType = UNORDERED_NODE_ITERATOR_TYPE;
+        m_nodeSetPosition = 0;
+        m_nodeSet = NodeSet::create(m_value.toNodeSet());
+        m_document = document;
+        m_domTreeVersion = document->domTreeVersion();
+        return;
     }
     ASSERT_NOT_REACHED();
 }
 
 XPathResult::~XPathResult()
 {
 }
 
 void XPathResult::trace(Visitor* visitor)
 {
     visitor->trace(m_value);
     visitor->trace(m_nodeSet);
     visitor->trace(m_document);
 }
 
 void XPathResult::convertTo(unsigned short type, ExceptionState& exceptionState)
 {
     switch (type) {
-        case ANY_TYPE:
-            break;
-        case NUMBER_TYPE:
-            m_resultType = type;
-            m_value = m_value.toNumber();
-            break;
-        case STRING_TYPE:
-            m_resultType = type;
-            m_value = m_value.toString();
-            break;
-        case BOOLEAN_TYPE:
-            m_resultType = type;
-            m_value = m_value.toBoolean();
-            break;
-        case UNORDERED_NODE_ITERATOR_TYPE:
-        case UNORDERED_NODE_SNAPSHOT_TYPE:
-        case ANY_UNORDERED_NODE_TYPE:
-        case FIRST_ORDERED_NODE_TYPE: // This is correct - singleNodeValue() will take care of ordering.
-            if (!m_value.isNodeSet()) {
-                exceptionState.throwTypeError("The result is not a node set, and therefore cannot be converted to the desired type.");
-                return;
-            }
-            m_resultType = type;
-            break;
-        case ORDERED_NODE_ITERATOR_TYPE:
-            if (!m_value.isNodeSet()) {
-                exceptionState.throwTypeError("The result is not a node set, and therefore cannot be converted to the desired type.");
-                return;
-            }
-            nodeSet().sort();
-            m_resultType = type;
-            break;
-        case ORDERED_NODE_SNAPSHOT_TYPE:
-            if (!m_value.isNodeSet()) {
-                exceptionState.throwTypeError("The result is not a node set, and therefore cannot be converted to the desired type.");
-                return;
-            }
-            m_value.toNodeSet().sort();
-            m_resultType = type;
-            break;
+    case ANY_TYPE:
+        break;
+    case NUMBER_TYPE:
+        m_resultType = type;
+        m_value = m_value.toNumber();
+        break;
+    case STRING_TYPE:
+        m_resultType = type;
+        m_value = m_value.toString();
+        break;
+    case BOOLEAN_TYPE:
+        m_resultType = type;
+        m_value = m_value.toBoolean();
+        break;
+    case UNORDERED_NODE_ITERATOR_TYPE:
+    case UNORDERED_NODE_SNAPSHOT_TYPE:
+    case ANY_UNORDERED_NODE_TYPE:
+    // This is correct - singleNodeValue() will take care of ordering.
+    case FIRST_ORDERED_NODE_TYPE:
+        if (!m_value.isNodeSet()) {
+            exceptionState.throwTypeError("The result is not a node set, and therefore cannot be converted to the desired type.");
+            return;
+        }
+        m_resultType = type;
+        break;
+    case ORDERED_NODE_ITERATOR_TYPE:
+        if (!m_value.isNodeSet()) {
+            exceptionState.throwTypeError("The result is not a node set, and therefore cannot be converted to the desired type.");
+            return;
+        }
+        nodeSet().sort();
+        m_resultType = type;
+        break;
+    case ORDERED_NODE_SNAPSHOT_TYPE:
+        if (!m_value.isNodeSet()) {
+            exceptionState.throwTypeError("The result is not a node set, and therefore cannot be converted to the desired type.");
+            return;
+        }
+        m_value.toNodeSet().sort();
+        m_resultType = type;
+        break;
     }
 }
 
 unsigned short XPathResult::resultType() const
 {
     return m_resultType;
 }
 
 double XPathResult::numberValue(ExceptionState& exceptionState) const
 {
@@ skipping 25 matching lines @@
 Node* XPathResult::singleNodeValue(ExceptionState& exceptionState) const
 {
     if (resultType() != ANY_UNORDERED_NODE_TYPE && resultType() != FIRST_ORDERED_NODE_TYPE) {
         exceptionState.throwTypeError("The result type is not a single node.");
         return 0;
     }
 
     const NodeSet& nodes = m_value.toNodeSet();
     if (resultType() == FIRST_ORDERED_NODE_TYPE)
         return nodes.firstNode();
-    else
-        return nodes.anyNode();
+    return nodes.anyNode();
 }
 
 bool XPathResult::invalidIteratorState() const
 {
     if (resultType() != UNORDERED_NODE_ITERATOR_TYPE && resultType() != ORDERED_NODE_ITERATOR_TYPE)
         return false;
 
     ASSERT(m_document);
     return m_document->domTreeVersion() != m_domTreeVersion;
 }
@@ skipping 38 matching lines @@
     }
 
     const NodeSet& nodes = m_value.toNodeSet();
     if (index >= nodes.size())
         return 0;
 
     return nodes[index];
 }
 
 }