Home | History | Annotate | Download | only in html

Lines Matching full:child

57     Node* child = 0;
62 for (child = previous->nextSibling(); child; child = child->nextSibling()) {
63 if (child->hasTagName(trTag))
64 return static_cast<HTMLTableRowElement*>(child);
70 child = table->firstChild();
72 child = previous->parent()->nextSibling();
73 for (; child; child = child->nextSibling()) {
74 if (child->hasTagName(theadTag)) {
75 for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->nextSibling()) {
84 child = table->firstChild();
86 child = previous->nextSibling();
88 child = previous->parent()->nextSibling();
89 for (; child; child = child->nextSibling()) {
90 if (child->hasTagName(trTag))
91 return static_cast<HTMLTableRowElement*>(child);
92 if (child->hasTagName(tbodyTag)) {
93 for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->nextSibling()) {
102 child = table->firstChild();
104 child = previous->parent()->nextSibling();
105 for (; child; child = child->nextSibling()) {
106 if (child->hasTagName(tfootTag)) {
107 for (Node* grandchild = child->firstChild(); grandchild; grandchild = grandchild->nextSibling()) {
119 for (Node* child = table->lastChild(); child; child = child->previousSibling()) {
120 if (child->hasTagName(tfootTag)) {
121 for (Node* grandchild = child->lastChild(); grandchild; grandchild = grandchild->previousSibling()) {
128 for (Node* child = table->lastChild(); child; child = child->previousSibling()) {
129 if (child->hasTagName(trTag))
130 return static_cast<HTMLTableRowElement*>(child);
131 if (child->hasTagName(tbodyTag)) {
132 for (Node* grandchild = child->lastChild(); grandchild; grandchild = grandchild->previousSibling()) {
139 for (Node* child = table->lastChild(); child; child = child->previousSibling()) {
140 if (child->hasTagName(theadTag)) {
141 for (Node* grandchild = child->lastChild(); grandchild; grandchild = grandchild->previousSibling()) {