Lines Matching refs:nodeNr
938 fprintf(output, "Set contains %d nodes:\n", cur->nodeNr);
939 for (i = 0;i < cur->nodeNr;i++) {
956 if ((cur == NULL) || (cur->nodeNr == 0) || (cur->nodeTab[0] == NULL)) {
2034 ret->nodesetval->nodeNr = 1;
3330 len = set->nodeNr;
3447 ret->nodeTab[ret->nodeNr++] =
3450 ret->nodeTab[ret->nodeNr++] = val;
3501 for (i = 0; i < cur->nodeNr; i++) {
3515 for (i = 0; i < cur->nodeNr; i++) {
3545 for (i = 0;i < cur->nodeNr;i++) {
3566 } else if (cur->nodeNr == cur->nodeMax) {
3578 cur->nodeTab[cur->nodeNr++] = xmlXPathNodeSetDupNs(node, ns);
3603 for (i = 0;i < cur->nodeNr;i++)
3619 } else if (cur->nodeNr == cur->nodeMax) {
3634 cur->nodeTab[cur->nodeNr++] =
3637 cur->nodeTab[cur->nodeNr++] = val;
3671 } else if (cur->nodeNr == cur->nodeMax) {
3686 cur->nodeTab[cur->nodeNr++] =
3689 cur->nodeTab[cur->nodeNr++] = val;
3725 val1 = xmlXPathNodeSetCreateSize(val2->nodeNr);
3728 if (val2->nodeNr != 0) {
3729 if (val2->nodeNr == 1)
3733 val2->nodeNr * sizeof(xmlNodePtr));
3735 val1->nodeNr = val2->nodeNr;
3742 initNr = val1->nodeNr;
3744 for (i = 0;i < val2->nodeNr;i++) {
3782 } else if (val1->nodeNr == val1->nodeMax) {
3797 val1->nodeTab[val1->nodeNr++] =
3800 val1->nodeTab[val1->nodeNr++] = n2;
3830 for (i = 0;i < val2->nodeNr;i++) {
3844 } else if (val1->nodeNr == val1->nodeMax) {
3859 val1->nodeTab[val1->nodeNr++] =
3862 val1->nodeTab[val1->nodeNr++] = val2->nodeTab[i];
3890 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
3893 if (set2->nodeNr != 0) {
3895 set2->nodeNr * sizeof(xmlNodePtr));
3896 set1->nodeNr = set2->nodeNr;
3907 initNbSet1 = set1->nodeNr;
3908 for (i = 0;i < set2->nodeNr;i++) {
3951 } else if (set1->nodeNr >= set1->nodeMax) {
3966 set1->nodeTab[set1->nodeNr++] =
3969 set1->nodeTab[set1->nodeNr++] = n2;
3974 set2->nodeNr = 0;
4001 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
4004 if (set2->nodeNr != 0) {
4006 set2->nodeNr * sizeof(xmlNodePtr));
4007 set1->nodeNr = set2->nodeNr;
4018 for (i = 0;i < set2->nodeNr;i++) {
4035 } else if (set1->nodeNr >= set1->nodeMax) {
4047 set1->nodeTab[set1->nodeNr++] = n2;
4050 set2->nodeNr = 0;
4071 for (i = 0;i < cur->nodeNr;i++)
4074 if (i >= cur->nodeNr) { /* not found */
4085 cur->nodeNr--;
4086 for (;i < cur->nodeNr;i++)
4088 cur->nodeTab[cur->nodeNr] = NULL;
4101 if (val >= cur->nodeNr) return;
4105 cur->nodeNr--;
4106 for (;val < cur->nodeNr;val++)
4108 cur->nodeTab[cur->nodeNr] = NULL;
4124 for (i = 0;i < obj->nodeNr;i++)
4144 if ((set == NULL) || (set->nodeNr <= 0))
4150 for (i = 0; i < set->nodeNr; i++) {
4157 set->nodeNr = 0;
4172 if ((set == NULL) || (set->nodeNr <= 0) || (pos >= set->nodeNr))
4178 for (i = pos; i < set->nodeNr; i++) {
4185 set->nodeNr = pos;
4202 for (i = 0;i < obj->nodeNr;i++) {
4233 if (obj->nodeNr == 0) {
4241 for (i = 0; i < obj->nodeNr; i++) {
4337 for (i = 1; i < val->nodeNr; ++i)
5543 if (tmpset->nodeNr > 1) {
5547 for (i = 0; i < tmpset->nodeNr; i++) {
5555 } else if (tmpset->nodeNr == 1) {
5560 tmpset->nodeNr = 0;
5667 if ((ns == NULL) || (ns->nodeNr
5670 if (ns->nodeNr > 1)
5948 if ((ns == NULL) || (ns->nodeNr == 0))
6413 for (i = 0;i < ns->nodeNr;i++) {
6468 for (i = 0;i < ns->nodeNr;i++) {
6539 if ((ns1 == NULL) || (ns1->nodeNr <= 0)) {
6544 if ((ns2 == NULL) || (ns2->nodeNr <= 0)) {
6550 values2 = (double *) xmlMalloc(ns2->nodeNr * sizeof(double));
6557 for (i = 0;i < ns1->nodeNr;i++) {
6561 for (j = 0;j < ns2->nodeNr;j++) {
6665 if ((ns == NULL) || (ns->nodeNr <= 0) )
6668 for (i = 0; i < ns->nodeNr; i++) {
6723 for (i=0;i<ns->nodeNr;i++) {
6790 if ((ns1 == NULL) || (ns1->nodeNr <= 0))
6792 if ((ns2 == NULL) || (ns2->nodeNr <= 0))
6799 for (i = 0;i < ns1->nodeNr;i++)
6800 for (j = 0;j < ns2->nodeNr;j++)
6804 values1 = (xmlChar **) xmlMalloc(ns1->nodeNr * sizeof(xmlChar *));
6809 hashs1 = (unsigned int *) xmlMalloc(ns1->nodeNr * sizeof(unsigned int));
6815 memset(values1, 0, ns1->nodeNr * sizeof(xmlChar *));
6816 values2 = (xmlChar **) xmlMalloc(ns2->nodeNr * sizeof(xmlChar *));
6823 hashs2 = (unsigned int *) xmlMalloc(ns2->nodeNr * sizeof(unsigned int));
6831 memset(values2, 0, ns2->nodeNr * sizeof(xmlChar *));
6832 for (i = 0;i < ns1->nodeNr;i++) {
6834 for (j = 0;j < ns2->nodeNr;j++) {
6856 for (i = 0;i < ns1->nodeNr;i++)
6859 for (j = 0;j < ns2->nodeNr;j++)
7114 (arg1->nodesetval->nodeNr == 0)) ret = 0;
7199 (arg1->nodesetval->nodeNr == 0)) ret = 0;
8469 (double) cur->nodesetval->nodeNr));
8471 if ((cur->nodesetval->nodeNr != 1) ||
8588 for (i = 0; i < obj->nodesetval->nodeNr; i++) {
8641 if ((cur->nodesetval == NULL) || (cur->nodesetval->nodeNr == 0)) {
8699 if ((cur->nodesetval == NULL) || (cur->nodesetval->nodeNr == 0)) {
8759 if ((cur->nodesetval == NULL) || (cur->nodesetval->nodeNr == 0)) {
9543 if ((cur->nodesetval != NULL) && (cur->nodesetval->nodeNr != 0)) {
9544 for (i = 0; i < cur->nodesetval->nodeNr; i++) {
11635 for (i = 0; i < set->nodeNr; i++) {
11780 for (i = 0; i < set->nodeNr; i++) {
11850 set->nodeNr = 1;
12145 (obj->nodesetval != NULL) ? obj->nodesetval->nodeNr : 0);
12153 if ((contextSeq == NULL) || (contextSeq->nodeNr <= 0)) {
12224 while ((contextIdx < contextSeq->nodeNr) || (contextNode != NULL)) {
12479 nbMatches += seq->nodeNr;
12486 if ((predOp != NULL) && (seq->nodeNr > 0)) {
12515 size = seq->nodeNr;
12535 } else if (seq->nodeNr > 0) {
12559 } else if (seq->nodeNr > 0) {
12590 if ((seq != NULL) && (seq->nodeNr == 0))
12654 && (ctxt->value->nodesetval->nodeNr >= 1)) {
12665 if (ctxt->value->nodesetval->nodeNr > 1)
12733 && (ctxt->value->nodesetval->nodeNr > 1))
12785 && (ctxt->value->nodesetval->nodeNr >= 1)) {
12789 if (ctxt->value->nodesetval->nodeNr > 1)
12793 nodesetval->nodeNr -
12806 && (ctxt->value->nodesetval->nodeNr >= 1)) { /* TODO: NOP ? */
12868 && (ctxt->value->nodesetval->nodeNr > 1))
12922 (ctxt->value->nodesetval->nodeNr > 1)) {
12927 nodeNr -
12929 ctxt->value->nodesetval->nodeNr = 1;
13065 if ((oldset == NULL) || (oldset->nodeNr == 0)) {
13092 for (i = 0; i < oldset->nodeNr; i++) {
13109 ctxt->context->contextSize = oldset->nodeNr;
13146 if (newset->nodeNr > 0) {
13349 (arg2->nodesetval->nodeNr != 0)))
13564 (ctxt->value->nodesetval->nodeNr > 1))
13565 ctxt->value->nodesetval->nodeNr = 1;
13599 (ctxt->value->nodesetval->nodeNr > 1)) {
13604 nodeNr -
13606 ctxt->value->nodesetval->nodeNr = 1;
13740 if ((oldset == NULL) || (oldset->nodeNr == 0)) {
13790 for (i = 0; i < oldset->nodeNr; i++) {
13807 ctxt->context->contextSize = oldset->nodeNr;
13879 (ctxt->value->nodesetval->nodeNr > 1))
13990 for (i = 0; i < oldset->nodeNr; i++) {
14358 nb_nodes, retObj->nodesetval->nodeNr);
14483 return(res->nodesetval->nodeNr != 0);
14527 return(res->nodesetval->nodeNr != 0);
