Home | History | Annotate | Download | only in dom

Lines Matching refs:Node

27 #include "Node.h"
33 typedef void (*NodeCallback)(Node*);
40 class ContainerNode : public Node {
44 Node* firstChild() const { return m_firstChild; }
45 Node* lastChild() const { return m_lastChild; }
47 bool insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionCode&, bool shouldLazyAttach = false);
48 bool replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionCode&, bool shouldLazyAttach = false);
49 bool removeChild(Node* child, ExceptionCode&);
50 bool appendChild(PassRefPtr<Node> newChild, ExceptionCode&, bool shouldLazyAttach = false);
55 void parserAddChild(PassRefPtr<Node>);
56 void parserRemoveChild(Node*);
57 void parserInsertBefore(PassRefPtr<Node> newChild, Node* refChild);
68 Node* childNode(unsigned index) const;
74 virtual void childrenChanged(bool createdByParser = false, Node* beforeChange = 0, Node* afterChange = 0, int childCountDelta = 0);
86 static void queuePostAttachCallback(NodeCallback, Node*);
101 void setFirstChild(Node* child) { m_firstChild = child; }
102 void setLastChild(Node* child) { m_lastChild = child; }
109 virtual void deprecatedParserAddChild(PassRefPtr<Node>);
111 void removeBetween(Node* previousChild, Node* nextChild, Node* oldChild);
112 void insertBeforeCommon(Node* nextChild, Node* oldChild);
119 Node* m_firstChild;
120 Node* m_lastChild;
123 inline ContainerNode* toContainerNode(Node* node)
125 ASSERT(!node || node->isContainerNode());
126 return static_cast<ContainerNode*>(node);
129 inline const ContainerNode* toContainerNode(const Node* node)
131 ASSERT(!node || node->isContainerNode());
132 return static_cast<const ContainerNode*>(node);
139 : Node(document, type)
145 inline unsigned Node::childNodeCount() const
152 inline Node* Node::childNode(unsigned index) const
159 inline Node* Node::firstChild() const
166 inline Node* Node::lastChild() const