Lines Matching full:nodenr
1309 fprintf(output, "Set contains %d nodes:\n", cur->nodeNr);
1310 for (i = 0;i < cur->nodeNr;i++) {
1327 if ((cur == NULL) || (cur->nodeNr == 0) || (cur->nodeTab[0] == NULL)) {
2405 ret->nodesetval->nodeNr = 1;
3431 len = set->nodeNr;
3454 libxml_domnode_tim_sort(set->nodeTab, set->nodeNr);
3551 ret->nodeTab[ret->nodeNr++] =
3554 ret->nodeTab[ret->nodeNr++] = val;
3605 for (i = 0; i < cur->nodeNr; i++) {
3619 for (i = 0; i < cur->nodeNr; i++) {
3651 for (i = 0;i < cur->nodeNr;i++) {
3672 } else if (cur->nodeNr == cur->nodeMax) {
3688 cur->nodeTab[cur->nodeNr++] = xmlXPathNodeSetDupNs(node, ns);
3711 for (i = 0;i < cur->nodeNr;i++)
3727 } else if (cur->nodeNr == cur->nodeMax) {
3746 cur->nodeTab[cur->nodeNr++] =
3749 cur->nodeTab[cur->nodeNr++] = val;
3781 } else if (cur->nodeNr == cur->nodeMax) {
3800 cur->nodeTab[cur->nodeNr++] =
3803 cur->nodeTab[cur->nodeNr++] = val;
3840 val1 = xmlXPathNodeSetCreateSize(val2->nodeNr);
3843 if (val2->nodeNr != 0) {
3844 if (val2->nodeNr == 1)
3848 val2->nodeNr * sizeof(xmlNodePtr));
3850 val1->nodeNr = val2->nodeNr;
3857 initNr = val1->nodeNr;
3859 for (i = 0;i < val2->nodeNr;i++) {
3897 } else if (val1->nodeNr == val1->nodeMax) {
3916 val1->nodeTab[val1->nodeNr++] =
3919 val1->nodeTab[val1->nodeNr++] = n2;
3947 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
3950 if (set2->nodeNr != 0) {
3952 set2->nodeNr * sizeof(xmlNodePtr));
3953 set1->nodeNr = set2->nodeNr;
3964 initNbSet1 = set1->nodeNr;
3965 for (i = 0;i < set2->nodeNr;i++) {
4008 } else if (set1->nodeNr >= set1->nodeMax) {
4027 set1->nodeTab[set1->nodeNr++] =
4030 set1->nodeTab[set1->nodeNr++] = n2;
4035 set2->nodeNr = 0;
4062 set1 = xmlXPathNodeSetCreateSize(set2->nodeNr);
4065 if (set2->nodeNr != 0) {
4067 set2->nodeNr * sizeof(xmlNodePtr));
4068 set1->nodeNr = set2->nodeNr;
4079 for (i = 0;i < set2->nodeNr;i++) {
4096 } else if (set1->nodeNr >= set1->nodeMax) {
4112 set1->nodeTab[set1->nodeNr++] = n2;
4115 set2->nodeNr = 0;
4136 for (i = 0;i < cur->nodeNr;i++)
4139 if (i >= cur->nodeNr) { /* not found */
4150 cur->nodeNr--;
4151 for (;i < cur->nodeNr;i++)
4153 cur->nodeTab[cur->nodeNr] = NULL;
4166 if (val >= cur->nodeNr) return;
4170 cur->nodeNr--;
4171 for (;val < cur->nodeNr;val++)
4173 cur->nodeTab[cur->nodeNr] = NULL;
4189 for (i = 0;i < obj->nodeNr;i++)
4209 if ((set == NULL) || (set->nodeNr <= 0))
4215 for (i = 0; i < set->nodeNr; i++) {
4222 set->nodeNr = 0;
4237 if ((set == NULL) || (set->nodeNr <= 0) || (pos >= set->nodeNr))
4243 for (i = pos; i < set->nodeNr; i++) {
4250 set->nodeNr = pos;
4267 for (i = 0;i < obj->nodeNr;i++) {
4298 if (obj->nodeNr == 0) {
4306 for (i = 0; i < obj->nodeNr; i++) {
4402 for (i = 1; i < val->nodeNr; ++i) {
5618 if (tmpset->nodeNr > 1) {
5622 for (i = 0; i < tmpset->nodeNr; i++) {
5630 } else if (tmpset->nodeNr == 1) {
5635 tmpset->nodeNr = 0;
5742 if ((ns == NULL) || (ns->nodeNr == 0) || (ns->nodeTab == NULL))
5745 if (ns->nodeNr > 1)
6023 if ((ns == NULL) || (ns->nodeNr == 0))
6488 for (i = 0;i < ns->nodeNr;i++) {
6543 for (i = 0;i < ns->nodeNr;i++) {
6614 if ((ns1 == NULL) || (ns1->nodeNr <= 0)) {
6619 if ((ns2 == NULL) || (ns2->nodeNr <= 0)) {
6625 values2 = (double *) xmlMalloc(ns2->nodeNr * sizeof(double));
6632 for (i = 0;i < ns1->nodeNr;i++) {
6636 for (j = 0;j < ns2->nodeNr;j++) {
6740 if ((ns == NULL) || (ns->nodeNr <= 0) )
6743 for (i = 0; i < ns->nodeNr; i++) {
6798 for (i=0;i<ns->nodeNr;i++) {
6865 if ((ns1 == NULL) || (ns1->nodeNr <= 0))
6867 if ((ns2 == NULL) || (ns2->nodeNr <= 0))
6874 for (i = 0;i < ns1->nodeNr;i++)
6875 for (j = 0;j < ns2->nodeNr;j++)
6879 values1 = (xmlChar **) xmlMalloc(ns1->nodeNr * sizeof(xmlChar *));
6884 hashs1 = (unsigned int *) xmlMalloc(ns1->nodeNr * sizeof(unsigned int));
6890 memset(values1, 0, ns1->nodeNr * sizeof(xmlChar *));
6891 values2 = (xmlChar **) xmlMalloc(ns2->nodeNr * sizeof(xmlChar *));
6898 hashs2 = (unsigned int *) xmlMalloc(ns2->nodeNr * sizeof(unsigned int));
6906 memset(values2, 0, ns2->nodeNr * sizeof(xmlChar *));
6907 for (i = 0;i < ns1->nodeNr;i++) {
6909 for (j = 0;j < ns2->nodeNr;j++) {
6931 for (i = 0;i < ns1->nodeNr;i++)
6934 for (j = 0;j < ns2->nodeNr;j++)
7189 (arg1->nodesetval->nodeNr == 0)) ret = 0;
7274 (arg1->nodesetval->nodeNr == 0)) ret = 0;
8554 (double) cur->nodesetval->nodeNr));
8556 if ((cur->nodesetval->nodeNr != 1) ||
8673 for (i = 0; i < obj->nodesetval->nodeNr; i++) {
8726 if ((cur->nodesetval == NULL) || (cur->nodesetval->nodeNr == 0)) {
8784 if ((cur->nodesetval == NULL) || (cur->nodesetval->nodeNr == 0)) {
8844 if ((cur->nodesetval == NULL) || (cur->nodesetval->nodeNr == 0)) {
9628 if ((cur->nodesetval != NULL) && (cur->nodesetval->nodeNr != 0)) {
9629 for (i = 0; i < cur->nodesetval->nodeNr; i++) {
11730 for (i = 0; i < set->nodeNr; i++) {
11879 for (i = 0; i < set->nodeNr; i++) {
11953 set->nodeNr = 1;
12240 (obj->nodesetval != NULL) ? obj->nodesetval->nodeNr : 0);
12248 if ((contextSeq == NULL) || (contextSeq->nodeNr <= 0)) {
12318 while (((contextIdx < contextSeq->nodeNr) || (contextNode != NULL)) &&
12562 nbMatches += seq->nodeNr;
12572 if ((predOp != NULL) && (seq->nodeNr > 0)) {
12601 size = seq->nodeNr;
12621 } else if (seq->nodeNr > 0) {
12645 } else if (seq->nodeNr > 0) {
12676 if ((seq != NULL) && (seq->nodeNr == 0))
12740 && (ctxt->value->nodesetval->nodeNr >= 1)) {
12751 if (ctxt->value->nodesetval->nodeNr > 1)
12819 && (ctxt->value->nodesetval->nodeNr > 1))
12871 && (ctxt->value->nodesetval->nodeNr >= 1)) {
12875 if (ctxt->value->nodesetval->nodeNr > 1)
12879 nodesetval->nodeNr -
12892 && (ctxt->value->nodesetval->nodeNr >= 1)) { /* TODO: NOP ? */
12954 && (ctxt->value->nodesetval->nodeNr > 1))
13008 (ctxt->value->nodesetval->nodeNr > 1)) {
13013 nodeNr -
13015 ctxt->value->nodesetval->nodeNr = 1;
13153 if ((oldset == NULL) || (oldset->nodeNr == 0)) {
13180 for (i = 0; i < oldset->nodeNr; i++) {
13199 ctxt->context->contextSize = oldset->nodeNr;
13237 if (newset->nodeNr > 0) {
13440 (arg2->nodesetval->nodeNr != 0)))
13663 (ctxt->value->nodesetval->nodeNr > 1))
13664 ctxt->value->nodesetval->nodeNr = 1;
13698 (ctxt->value->nodesetval->nodeNr > 1)) {
13703 nodeNr -
13705 ctxt->value->nodesetval->nodeNr
13839 if ((oldset == NULL) || (oldset->nodeNr == 0)) {
13889 for (i = 0; i < oldset->nodeNr; i++) {
13908 ctxt->context->contextSize = oldset->nodeNr;
13982 (ctxt->value->nodesetval->nodeNr > 1))
14093 for (i = 0; i < oldset->nodeNr; i++) {
14466 nb_nodes, retObj->nodesetval->nodeNr);
14591 return(res->nodesetval->nodeNr != 0);
14635 return(res->nodesetval->nodeNr != 0);
