Lines Matching defs:tset
758 Tree *t=NULL, *tset=NULL, *u;
778 if ( !set_nil(p->tset) )
785 a = set_and(p->tset, *constrain);
791 a = set_dup(p->tset);
798 if ( tset==NULL ) { tset = n; tail = n; }
810 tset = tnode( p->token );
822 /* MR11 */ Tfree(tset);
827 if ( k == 1 ) return tset;
837 Tfree(tset);
848 if ( tset!=NULL ) Tfree( tset );
856 /* MR10 - set_nil(p->tset) isn't a good test because of ConstraintSearch */
858 if (tset->right == NULL) return tmake(tset, t, NULL); /* MR10 */
860 /* here we must make a copy of t as a child of each element of the tset;
863 for (u=tset; u!=NULL; u=u->right)
870 fprintf(stderr, "range is:"); preorder(tset); fprintf(stderr, "\n");
872 return tset;
947 Tree *tset;
995 tset=MR_make_tree_from_set(pred->scontext[1]);
996 tAND=MR_computeTreeAND(t,tset);
997 Tfree(tset);
2071 if (set_nil(tn->tset)) {
2216 if (set_nil(tn->tset)) {
2219 remainder=set_dif(fset[depth],tn->tset);