Make DocumentOrderedMap take a const reference for scope

third_party/WebKit/Source/core/dom/TreeScope.cpp

 /*
  * Copyright (C) 2011 Google Inc. All Rights Reserved.
  * Copyright (C) 2012 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.
  * 2. Redistributions in binary form must reproduce the above copyright
@@ skipping 105 matching lines @@
 
 void TreeScope::ClearScopedStyleResolver() {
   scoped_style_resolver_.Clear();
 }
 
 Element* TreeScope::getElementById(const AtomicString& element_id) const {
   if (element_id.IsEmpty())
     return nullptr;
   if (!elements_by_id_)
     return nullptr;
-  return elements_by_id_->GetElementById(element_id, this);
+  return elements_by_id_->GetElementById(element_id, *this);
 }
 
 const HeapVector<Member<Element>>& TreeScope::GetAllElementsById(
     const AtomicString& element_id) const {
   DEFINE_STATIC_LOCAL(HeapVector<Member<Element>>, empty_vector,
                       (new HeapVector<Member<Element>>));
   if (element_id.IsEmpty())
     return empty_vector;
   if (!elements_by_id_)
     return empty_vector;
-  return elements_by_id_->GetAllElementsById(element_id, this);
+  return elements_by_id_->GetAllElementsById(element_id, *this);
 }
 
 void TreeScope::AddElementById(const AtomicString& element_id,
                                Element* element) {
   if (!elements_by_id_)
     elements_by_id_ = DocumentOrderedMap::Create();
   elements_by_id_->Add(element_id, element);
   id_target_observer_registry_->NotifyObservers(element_id);
 }
 
@@ skipping 37 matching lines @@
 }
 
 HTMLMapElement* TreeScope::GetImageMap(const String& url) const {
   if (url.IsNull())
     return nullptr;
   if (!image_maps_by_name_)
     return nullptr;
   size_t hash_pos = url.find('#');
   String name = hash_pos == kNotFound ? url : url.Substring(hash_pos + 1);
   return toHTMLMapElement(
-      image_maps_by_name_->GetElementByMapName(AtomicString(name), this));
+      image_maps_by_name_->GetElementByMapName(AtomicString(name), *this));
 }
 
 static bool PointWithScrollAndZoomIfPossible(const Document& document,
                                              IntPoint& point) {
   LocalFrame* frame = document.GetFrame();
   if (!frame)
     return false;
   FrameView* frame_view = frame->View();
   if (!frame_view)
     return false;
@@ skipping 240 matching lines @@
         if (child == child1)
           return Node::kDocumentPositionFollowing;
       }
 
       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::kDocumentPositionFollowing |
-                   Node::kDocumentPositionContainedBy
-             : Node::kDocumentPositionPreceding |
-                   Node::kDocumentPositionContains;
+  return index1 < index2 ? Node::kDocumentPositionFollowing |
+                               Node::kDocumentPositionContainedBy
+                         : Node::kDocumentPositionPreceding |
+                               Node::kDocumentPositionContains;
 }
 
 const TreeScope* TreeScope::CommonAncestorTreeScope(
     const TreeScope& other) const {
   HeapVector<Member<const TreeScope>, 16> this_chain;
   for (const TreeScope* tree = this; tree; tree = tree->ParentTreeScope())
     this_chain.push_back(tree);
 
   HeapVector<Member<const TreeScope>, 16> other_chain;
   for (const TreeScope* tree = &other; tree; tree = tree->ParentTreeScope())
@@ skipping 65 matching lines @@
   visitor->Trace(id_target_observer_registry_);
   visitor->Trace(selection_);
   visitor->Trace(elements_by_id_);
   visitor->Trace(image_maps_by_name_);
   visitor->Trace(scoped_style_resolver_);
   visitor->Trace(radio_button_group_scope_);
   visitor->Trace(svg_tree_scoped_resources_);
 }
 
 }  // namespace blink