Lines Matching refs:incomplete
401 fprintf(output," Incomplete Set at k=%d !",k);
405 fprintf(output," Incomplete Tree at k=%d !",k);
848 set MR_First(int ck,Junction *j,set *incomplete)
850 set MR_First(ck,j,incomplete)
853 set *incomplete;
865 REACH(p,ck,incomplete,tokensUsed);
919 void MR_complete_set(int predDepth,set *tokensUsed,set *incomplete)
921 void MR_complete_set(predDepth,tokensUsed,incomplete)
924 set *incomplete;
934 if (set_int(*incomplete) > (unsigned) predDepth) {
961 while ( !set_nil(*incomplete) ) {
962 k2=set_int(*incomplete);
964 set_rm(k2,*incomplete);
972 set_orin(incomplete,rk2); /* remember what we couldn't do */
974 if (set_int(*incomplete) > (unsigned) predDepth) break; /* <=== another exit from loop */
984 void MR_complete_tree(int predDepth,Tree **t,set *incomplete)
986 void MR_complete_tree(predDepth,t,incomplete)
989 set *incomplete;
1000 if (set_int(*incomplete) > (unsigned) predDepth) {
1029 while ( !set_nil(*incomplete) ) {
1030 k2 = set_int(*incomplete);
1032 set_rm(k2,*incomplete);
1043 set_orin(incomplete,rk2); /* remember what we couldn't do */
1048 if (set_int(*incomplete) > (unsigned) predDepth) break; /* <=== another exit from loop */
1428 set incomplete;
1440 incomplete=empty;
1507 MR_set_reuse(&incomplete);
1508 plainSet=MR_First(depth1,jList[i],&incomplete);
1509 MR_complete_set(depth1,&plainSet,&incomplete);
1510 require(set_nil(incomplete),"couldn't complete k=1");
1563 If completed to depth=1 then the context would be incomplete.
1565 would have incomplete information. It would lead to
1708 set_free(incomplete);
2690 set incomplete;
2724 incomplete=empty;
2733 TRAV(suppressNode,maxk,&incomplete,t);
2737 require (set_nil(incomplete),"MR_suppressK_client TRAV incomplete");
2740 set_free(incomplete);
