cur_part          547 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int cur_part, i, ii, j, jj, m = n/k, s;
cur_part          560 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for( cur_part = 0 ; cur_part < k ; cur_part ++ ){
cur_part          569 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if ( partition[j] == cur_part )
cur_part          576 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	fprintf(stderr,"too many elements of the partition for the permuation (s=%d>%d=m). n=%d, k=%d, cur_part= %d\n",s,m,n,k, cur_part);
cur_part          604 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     res[cur_part] = sub_com_mat;
cur_part          616 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int i, j, cur_part;
cur_part          628 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for( cur_part = 0; cur_part < k ; cur_part ++){
cur_part          632 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if ( partition[j] == cur_part )
cur_part          634 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     res[cur_part] = sub_vertices;
cur_part          636 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       printf("partition %d: ",cur_part);print_1D_tab(sub_vertices,m);
cur_part          706 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int cur_part, j;
cur_part          708 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for( cur_part = 0; cur_part < k ; cur_part ++){
cur_part          709 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     print_tab(depth); fprintf(stdout,"%d :",cur_part);
cur_part          711 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if ( partition[j] == cur_part ){