Reflow comments in core/dom/.

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

 /*
  * 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 28 matching lines @@
 class ContainerNode;
 class DOMSelection;
 class Document;
 class Element;
 class HTMLMapElement;
 class HitTestResult;
 class IdTargetObserverRegistry;
 class ScopedStyleResolver;
 class Node;
 
-// A class which inherits both Node and TreeScope must call clearRareData() in its destructor
-// so that the Node destructor no longer does problematic NodeList cache manipulation in
-// the destructor.
+// A class which inherits both Node and TreeScope must call clearRareData() in
+// its destructor so that the Node destructor no longer does problematic
+// NodeList cache manipulation in the destructor.
 class CORE_EXPORT TreeScope : public GarbageCollectedMixin {
  public:
   TreeScope* parentTreeScope() const { return m_parentTreeScope; }
 
   TreeScope* olderShadowRootOrParentTreeScope() const;
   bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(
       const TreeScope&) const;
 
   Element* adjustedFocusedElement() const;
-  // Finds a retargeted element to the given argument, when the retargetd element is in this
-  // TreeScope. Returns null otherwise.
-  // TODO(kochi): once this algorithm is named in the spec, rename the method name.
+  // Finds a retargeted element to the given argument, when the retargeted
+  // element is in this TreeScope. Returns null otherwise.
+  // TODO(kochi): once this algorithm is named in the spec, rename the method
+  // name.
   Element* adjustedElement(const Element&) const;
   Element* getElementById(const AtomicString&) const;
   const HeapVector<Member<Element>>& getAllElementsById(
       const AtomicString&) const;
   bool hasElementWithId(const AtomicString& id) const;
   bool containsMultipleElementsWithId(const AtomicString& id) const;
   void addElementById(const AtomicString& elementId, Element*);
   void removeElementById(const AtomicString& elementId, Element*);
 
   Document& document() const {
@@ skipping 10 matching lines @@
   Element* elementFromPoint(int x, int y) const;
   Element* hitTestPoint(int x, int y, const HitTestRequest&) const;
   HeapVector<Member<Element>> elementsFromPoint(int x, int y) const;
   HeapVector<Member<Element>> elementsFromHitTestResult(HitTestResult&) const;
 
   DOMSelection* getSelection() const;
 
   Element* retarget(const Element& target) const;
 
   // Find first anchor with the given name.
-  // First searches for an element with the given ID, but if that fails, then looks
-  // for an anchor with the given name. ID matching is always case sensitive, but
-  // Anchor name matching is case sensitive in strict mode and not case sensitive in
-  // quirks mode for historical compatibility reasons.
+  // First searches for an element with the given ID, but if that fails, then
+  // looks for an anchor with the given name. ID matching is always case
+  // sensitive, but Anchor name matching is case sensitive in strict mode and
+  // not case sensitive in quirks mode for historical compatibility reasons.
   Element* findAnchor(const String& name);
 
   // Used by the basic DOM mutation methods (e.g., appendChild()).
   void adoptIfNeeded(Node&);
 
   ContainerNode& rootNode() const { return *m_rootNode; }
 
   IdTargetObserverRegistry& idTargetObserverRegistry() const {
     return *m_idTargetObserverRegistry.get();
   }
@@ skipping 58 matching lines @@
 
 HitTestResult hitTestInDocument(
     const Document*,
     int x,
     int y,
     const HitTestRequest& = HitTestRequest::ReadOnly | HitTestRequest::Active);
 
 }  // namespace blink
 
 #endif  // TreeScope_h