| 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 72 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 83 // Find first anchor with the given name. | 83 // Find first anchor with the given name. |
| 84 // First searches for an element with the given ID, but if that fails, then
looks | 84 // First searches for an element with the given ID, but if that fails, then
looks |
| 85 // for an anchor with the given name. ID matching is always case sensitive,
but | 85 // for an anchor with the given name. ID matching is always case sensitive,
but |
| 86 // Anchor name matching is case sensitive in strict mode and not case sensit
ive in | 86 // Anchor name matching is case sensitive in strict mode and not case sensit
ive in |
| 87 // quirks mode for historical compatibility reasons. | 87 // quirks mode for historical compatibility reasons. |
| 88 Element* findAnchor(const String& name); | 88 Element* findAnchor(const String& name); |
| 89 | 89 |
| 90 bool applyAuthorStyles() const; | 90 bool applyAuthorStyles() const; |
| 91 | 91 |
| 92 // Used by the basic DOM mutation methods (e.g., appendChild()). | 92 // Used by the basic DOM mutation methods (e.g., appendChild()). |
| 93 void adoptIfNeeded(Node*); | 93 void adoptIfNeeded(Node&); |
| 94 | 94 |
| 95 Node* rootNode() const { return m_rootNode; } | 95 Node* rootNode() const { return m_rootNode; } |
| 96 | 96 |
| 97 IdTargetObserverRegistry& idTargetObserverRegistry() const { return *m_idTar
getObserverRegistry.get(); } | 97 IdTargetObserverRegistry& idTargetObserverRegistry() const { return *m_idTar
getObserverRegistry.get(); } |
| 98 | 98 |
| 99 static TreeScope* noDocumentInstance() | 99 static TreeScope* noDocumentInstance() |
| 100 { | 100 { |
| 101 DEFINE_STATIC_LOCAL(TreeScope, instance, ()); | 101 DEFINE_STATIC_LOCAL(TreeScope, instance, ()); |
| 102 return &instance; | 102 return &instance; |
| 103 } | 103 } |
| (...skipping 89 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 193 inline bool operator!=(const TreeScope& a, const TreeScope& b) { return !(a == b
); } | 193 inline bool operator!=(const TreeScope& a, const TreeScope& b) { return !(a == b
); } |
| 194 inline bool operator!=(const TreeScope& a, const TreeScope* b) { return !(a == b
); } | 194 inline bool operator!=(const TreeScope& a, const TreeScope* b) { return !(a == b
); } |
| 195 inline bool operator!=(const TreeScope* a, const TreeScope& b) { return !(a == b
); } | 195 inline bool operator!=(const TreeScope* a, const TreeScope& b) { return !(a == b
); } |
| 196 | 196 |
| 197 RenderObject* rendererFromPoint(Document*, int x, int y, LayoutPoint* localPoint
= 0); | 197 RenderObject* rendererFromPoint(Document*, int x, int y, LayoutPoint* localPoint
= 0); |
| 198 TreeScope* commonTreeScope(Node*, Node*); | 198 TreeScope* commonTreeScope(Node*, Node*); |
| 199 | 199 |
| 200 } // namespace WebCore | 200 } // namespace WebCore |
| 201 | 201 |
| 202 #endif // TreeScope_h | 202 #endif // TreeScope_h |
| OLD | NEW |