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 639 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
650 | 650 |
651 void attachNodeIterator(NodeIterator*); | 651 void attachNodeIterator(NodeIterator*); |
652 void detachNodeIterator(NodeIterator*); | 652 void detachNodeIterator(NodeIterator*); |
653 void moveNodeIteratorsToNewDocument(Node&, Document&); | 653 void moveNodeIteratorsToNewDocument(Node&, Document&); |
654 | 654 |
655 void attachRange(Range*); | 655 void attachRange(Range*); |
656 void detachRange(Range*); | 656 void detachRange(Range*); |
657 | 657 |
658 void updateRangesAfterChildrenChanged(ContainerNode*); | 658 void updateRangesAfterChildrenChanged(ContainerNode*); |
659 // nodeChildrenWillBeRemoved is used when removing all node children at once
. | 659 // nodeChildrenWillBeRemoved is used when removing all node children at once
. |
660 void nodeChildrenWillBeRemoved(ContainerNode*); | 660 void nodeChildrenWillBeRemoved(ContainerNode&); |
661 // nodeWillBeRemoved is only safe when removing one node at a time. | 661 // nodeWillBeRemoved is only safe when removing one node at a time. |
662 void nodeWillBeRemoved(Node&); | 662 void nodeWillBeRemoved(Node&); |
663 bool canReplaceChild(const Node& newChild, const Node& oldChild) const; | 663 bool canReplaceChild(const Node& newChild, const Node& oldChild) const; |
664 | 664 |
665 void didInsertText(Node*, unsigned offset, unsigned length); | 665 void didInsertText(Node*, unsigned offset, unsigned length); |
666 void didRemoveText(Node*, unsigned offset, unsigned length); | 666 void didRemoveText(Node*, unsigned offset, unsigned length); |
667 void didMergeTextNodes(Text* oldNode, unsigned offset); | 667 void didMergeTextNodes(Text* oldNode, unsigned offset); |
668 void didSplitTextNode(Text* oldNode); | 668 void didSplitTextNode(Text* oldNode); |
669 | 669 |
670 void clearDOMWindow() { m_domWindow = 0; } | 670 void clearDOMWindow() { m_domWindow = 0; } |
(...skipping 725 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1396 inline bool Node::isDocumentNode() const | 1396 inline bool Node::isDocumentNode() const |
1397 { | 1397 { |
1398 return this == document(); | 1398 return this == document(); |
1399 } | 1399 } |
1400 | 1400 |
1401 Node* eventTargetNodeForDocument(Document*); | 1401 Node* eventTargetNodeForDocument(Document*); |
1402 | 1402 |
1403 } // namespace WebCore | 1403 } // namespace WebCore |
1404 | 1404 |
1405 #endif // Document_h | 1405 #endif // Document_h |
OLD | NEW |