X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=src%2Fthird_party%2FWebKit%2FSource%2Fcore%2Fdom%2FDocumentOrderedMap.cpp;h=f71fcee109d1d714a3bfd16efdd6489a2b494b55;hb=1afa4dd80ef85af7c90efaea6959db1d92330844;hp=556fe1a8ba1e747266cc71eed22e950a5e04e0de;hpb=90762837333c13ccf56f2ad88e4481fc71e8d281;p=platform%2Fframework%2Fweb%2Fcrosswalk.git

diff --git a/src/third_party/WebKit/Source/core/dom/DocumentOrderedMap.cpp b/src/third_party/WebKit/Source/core/dom/DocumentOrderedMap.cpp
index 556fe1a..f71fcee 100644
--- a/src/third_party/WebKit/Source/core/dom/DocumentOrderedMap.cpp
+++ b/src/third_party/WebKit/Source/core/dom/DocumentOrderedMap.cpp
@@ -121,11 +121,11 @@ inline Element* DocumentOrderedMap::get(const AtomicString& key, const TreeScope
         return entry->element;
 
     // We know there's at least one node that matches; iterate to find the first one.
-    for (Element* element = ElementTraversal::firstWithin(scope->rootNode()); element; element = ElementTraversal::next(*element)) {
-        if (!keyMatches(key, *element))
+    for (Element& element : ElementTraversal::startsAfter(scope->rootNode())) {
+        if (!keyMatches(key, element))
             continue;
-        entry->element = element;
-        return element;
+        entry->element = &element;
+        return &element;
     }
     ASSERT_NOT_REACHED();
     return 0;