Lines Matching full:child
223 Node* child = n->childNode(o - 1);
224 if (child)
225 return lastDeepEditingPositionForNode(child);
227 // There are two reasons child might be 0:
230 // 2) The old offset was a bogus offset like (<br>, 1), and there is no child.
261 Node* child = n->childNode(o);
262 if (child || (!n->hasChildNodes() && o < lastOffsetForEditing(n))) {
263 if (child)
264 return firstDeepEditingPositionForNode(child);
266 // There are two reasons child might be 0:
269 // 2) The new offset is a bogus offset like (<br>, 1), and there is no child.
