| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All Rights Reserved. | 2 * Copyright (C) 2011 Google Inc. All Rights Reserved. |
| 3 * Copyright (C) 2012 Apple Inc. All Rights Reserved. | 3 * Copyright (C) 2012 Apple Inc. All Rights Reserved. |
| 4 * | 4 * |
| 5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
| 6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
| 7 * are met: | 7 * are met: |
| 8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
| (...skipping 70 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 81 | 81 |
| 82 void addImageMap(HTMLMapElement*); | 82 void addImageMap(HTMLMapElement*); |
| 83 void removeImageMap(HTMLMapElement*); | 83 void removeImageMap(HTMLMapElement*); |
| 84 HTMLMapElement* getImageMap(const String& url) const; | 84 HTMLMapElement* getImageMap(const String& url) const; |
| 85 | 85 |
| 86 Element* elementFromPoint(int x, int y) const; | 86 Element* elementFromPoint(int x, int y) const; |
| 87 Element* hitTestPoint(int x, int y, const HitTestRequest&) const; | 87 Element* hitTestPoint(int x, int y, const HitTestRequest&) const; |
| 88 HeapVector<Member<Element>> elementsFromPoint(int x, int y) const; | 88 HeapVector<Member<Element>> elementsFromPoint(int x, int y) const; |
| 89 HeapVector<Member<Element>> elementsFromHitTestResult(HitTestResult&) const; | 89 HeapVector<Member<Element>> elementsFromHitTestResult(HitTestResult&) const; |
| 90 | 90 |
| 91 bool hasSelection() const; |
| 91 DOMSelection* getSelection() const; | 92 DOMSelection* getSelection() const; |
| 92 | 93 |
| 93 Element* retarget(const Element& target) const; | 94 Element* retarget(const Element& target) const; |
| 94 | 95 |
| 95 // Find first anchor with the given name. | 96 // Find first anchor with the given name. |
| 96 // First searches for an element with the given ID, but if that fails, then | 97 // First searches for an element with the given ID, but if that fails, then |
| 97 // looks for an anchor with the given name. ID matching is always case | 98 // looks for an anchor with the given name. ID matching is always case |
| 98 // sensitive, but Anchor name matching is case sensitive in strict mode and | 99 // sensitive, but Anchor name matching is case sensitive in strict mode and |
| 99 // not case sensitive in quirks mode for historical compatibility reasons. | 100 // not case sensitive in quirks mode for historical compatibility reasons. |
| 100 Element* findAnchor(const String& name); | 101 Element* findAnchor(const String& name); |
| (...skipping 71 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 172 | 173 |
| 173 HitTestResult hitTestInDocument( | 174 HitTestResult hitTestInDocument( |
| 174 const Document*, | 175 const Document*, |
| 175 int x, | 176 int x, |
| 176 int y, | 177 int y, |
| 177 const HitTestRequest& = HitTestRequest::ReadOnly | HitTestRequest::Active); | 178 const HitTestRequest& = HitTestRequest::ReadOnly | HitTestRequest::Active); |
| 178 | 179 |
| 179 } // namespace blink | 180 } // namespace blink |
| 180 | 181 |
| 181 #endif // TreeScope_h | 182 #endif // TreeScope_h |
| OLD | NEW |