- for (j = 0; j < nplv[i]; ++j) {\r
- k = nplh[i]*nplz[i];\r
- while (--k >= 0) {\r
- node->parent = parentnode; //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);\r
- ++node; ++n; \r
- if (--k >= 0 && n < p) {\r
- node->parent = parentnode; //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);\r
- ++node; ++n; \r
- }\r
- if (nplz[i] != 1){ //2D operation vs 3D operation\r
- if (--k >= 0 && n < p) {\r
- node->parent = parentnode; //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);\r
- ++node; ++n;\r
- }\r
- if (--k >= 0 && n < p) {\r
- node->parent = parentnode; //fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);\r
- ++node; ++n;\r
+ for (z = 0; z < nplz[i]; ++z) {\r
+ for (j = 0; j < nplv[i]; ++j) {\r
+ k = nplh[i];\r
+ while(--k >= 0) {\r
+ node->parent = parentnode; /*fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);*/\r
+ ++node;\r
+ if(--k >= 0) {\r
+ node->parent = parentnode; /*fprintf(stdout,"node[%d].parent = node[%d]\n",n,p);*/\r
+ ++node;\r