OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
5 * (C) 2006 Alexey Proskuryakov (ap@webkit.org) | 5 * (C) 2006 Alexey Proskuryakov (ap@webkit.org) |
6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. |
7 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 7 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
8 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) | 8 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) |
9 * Copyright (C) 2011 Google Inc. All rights reserved. | 9 * Copyright (C) 2011 Google Inc. All rights reserved. |
10 * | 10 * |
(...skipping 661 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
672 void invalidateNodeListCaches(const QualifiedName* attrName); | 672 void invalidateNodeListCaches(const QualifiedName* attrName); |
673 | 673 |
674 void attachNodeIterator(NodeIterator*); | 674 void attachNodeIterator(NodeIterator*); |
675 void detachNodeIterator(NodeIterator*); | 675 void detachNodeIterator(NodeIterator*); |
676 void moveNodeIteratorsToNewDocument(Node&, Document&); | 676 void moveNodeIteratorsToNewDocument(Node&, Document&); |
677 | 677 |
678 void attachRange(Range*); | 678 void attachRange(Range*); |
679 void detachRange(Range*); | 679 void detachRange(Range*); |
680 | 680 |
681 void updateRangesAfterChildrenChanged(ContainerNode*); | 681 void updateRangesAfterChildrenChanged(ContainerNode*); |
| 682 void updateRangesAfterNodeMovedToAnotherDocument(const Node&); |
682 // nodeChildrenWillBeRemoved is used when removing all node children at once
. | 683 // nodeChildrenWillBeRemoved is used when removing all node children at once
. |
683 void nodeChildrenWillBeRemoved(ContainerNode&); | 684 void nodeChildrenWillBeRemoved(ContainerNode&); |
684 // nodeWillBeRemoved is only safe when removing one node at a time. | 685 // nodeWillBeRemoved is only safe when removing one node at a time. |
685 void nodeWillBeRemoved(Node&); | 686 void nodeWillBeRemoved(Node&); |
686 bool canReplaceChild(const Node& newChild, const Node& oldChild) const; | 687 bool canReplaceChild(const Node& newChild, const Node& oldChild) const; |
687 | 688 |
688 void didInsertText(Node*, unsigned offset, unsigned length); | 689 void didInsertText(Node*, unsigned offset, unsigned length); |
689 void didRemoveText(Node*, unsigned offset, unsigned length); | 690 void didRemoveText(Node*, unsigned offset, unsigned length); |
690 void didMergeTextNodes(Text& oldNode, unsigned offset); | 691 void didMergeTextNodes(Text& oldNode, unsigned offset); |
691 void didSplitTextNode(Text& oldNode); | 692 void didSplitTextNode(Text& oldNode); |
(...skipping 773 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1465 inline bool Node::isDocumentNode() const | 1466 inline bool Node::isDocumentNode() const |
1466 { | 1467 { |
1467 return this == document(); | 1468 return this == document(); |
1468 } | 1469 } |
1469 | 1470 |
1470 Node* eventTargetNodeForDocument(Document*); | 1471 Node* eventTargetNodeForDocument(Document*); |
1471 | 1472 |
1472 } // namespace WebCore | 1473 } // namespace WebCore |
1473 | 1474 |
1474 #endif // Document_h | 1475 #endif // Document_h |
OLD | NEW |