Lines Matching full:node
44 static PassRefPtr<Range> create(PassRefPtr<Document>, PassRefPtr<Node> startContainer, int startOffset, PassRefPtr<Node> endContainer, int endOffset);
49 Node* startContainer() const { return m_start.container(); }
51 Node* endContainer() const { return m_end.container(); }
54 Node* startContainer(ExceptionCode&) const;
56 Node* endContainer(ExceptionCode&) const;
60 Node* commonAncestorContainer(ExceptionCode&) const;
61 static Node* commonAncestorContainer(Node* containerA, Node* containerB);
62 void setStart(PassRefPtr<Node> container, int offset, ExceptionCode&);
63 void setEnd(PassRefPtr<Node> container, int offset, ExceptionCode&);
65 bool isPointInRange(Node* refNode, int offset, ExceptionCode&);
66 short comparePoint(Node* refNode, int offset, ExceptionCode&) const;
68 CompareResults compareNode(Node* refNode, ExceptionCode&) const;
71 static short compareBoundaryPoints(Node* containerA, int offsetA, Node* containerB, int offsetB);
74 bool intersectsNode(Node* refNode, ExceptionCode&);
78 void insertNode(PassRefPtr<Node>, ExceptionCode&);
89 void setStartAfter(Node*, ExceptionCode&);
90 void setEndBefore(Node*, ExceptionCode&);
91 void setEndAfter(Node*, ExceptionCode&);
92 void selectNode(Node*, ExceptionCode&);
93 void selectNodeContents(Node*, ExceptionCode&);
94 void surroundContents(PassRefPtr<Node>, ExceptionCode&);
95 void setStartBefore(Node*, ExceptionCode&);
100 Node* firstNode() const;
101 Node* pastLastNode() const;
105 Node* shadowTreeRootNode() const;
114 void nodeWillBeRemoved(Node*);
116 void textInserted(Node*, unsigned offset, unsigned length);
117 void textRemoved(Node*, unsigned offset, unsigned length);
135 Range(PassRefPtr<Document>, PassRefPtr<Node> startContainer, int startOffset, PassRefPtr<Node> endContainer, int endOffset);
137 Node* checkNodeWOffset(Node*, int offset, ExceptionCode&) const;
138 void checkNodeBA(Node*, ExceptionCode&) const;
154 PassRefPtr<Range> rangeOfContents(Node*);
