on master help sign in
Slightly refactor node and attribute search
commit3548c3cb8475d20010be9a4493c7fca05d3d5961 authorNeil Mitchell <ndmitchell@gmail.com> dateWed 30 Nov 2016, 19:08 (10 years ago) parentf09f113
1 file changed+3−4
cbits/hexml.c+3−4
cbits/hexml.c+3−4
@@ -195,9 +195,8 @@ attr* node_attributes(document* d, node* n, int* res)
195195attr* node_attributeBy(document* d, node* n, char* s, int slen)
196196{
197197 if (slen == -1) slen = strlen(s);
198− int i = n->attrs.start;
199− int limit = end(n->attrs);
200− for (i = n->attrs.start; i < limit; i++)
198+ const int limit = end(n->attrs);
199+ for (int i = n->attrs.start; i < limit; i++)
201200 {
202201 attr* r = &d->attrs.attrs[i];
203202 if (r->name.length == slen && memcmp(s, &d->body[r->name.start], slen) == 0)
@@ -211,7 +210,7 @@ node* node_childBy(document* d, node* parent, node* prev, char* s, int slen)
211210{
212211 if (slen == -1) slen = strlen(s);
213212 int i = prev == NULL ? parent->nodes.start : prev + 1 - d->nodes.nodes;
214− int limit = end(parent->nodes);
213+ const int limit = end(parent->nodes);
215214 for (; i < limit; i++)
216215 {
217216 node* r = &d->nodes.nodes[i];