Lines Matching defs:val
603 ec_trail_undo(_g_delete_space, ec_arg(1).val.ptr, ec_arg(1).val.ptr+SPACE_STAMP_POS, NULL, 0, TRAILED_WORD32);
680 int val;
692 val = solver->vInt[(int)idx].val();
693 return unify(EC_arg(3), EC_word((long)val));
704 long idx, val;
715 if (EC_succeed != EC_arg(3).is_long(&val)) return(TYPE_ERROR);
718 if (solver->vInt[(int)idx].in((int)val))
795 long val;
796 if (EC_succeed != EC_arg(3).is_long(&val)) return(TYPE_ERROR);
806 rel(*solver, solver->vInt[(int)idx], relop, (int)val);
810 ec_trail_undo(_g_delete_space, ec_arg(1).val.ptr, ec_arg(1).val.ptr+SPACE_STAMP_POS, NULL, 0, TRAILED_WORD32);
1610 int idx, val;
1616 val = (int) l;
1628 dom(*solver, solver->vInt[idx], (int)val);
1629 // rel(*solver, solver->vInt[idx], IRT_EQ, (int)val);
1644 int idx, val;
1650 val = (int) l;
1665 if (me_failed(vv.nq(*solver, (int)val))) solver->fail();
2043 long val;
2044 if (EC_succeed != EC_arg(3).is_long(&val)) return(TYPE_ERROR);
2058 if (me_failed(vv.nq(*solver, (int)val))) {
2178 long val;
2180 if (EC_succeed != EC_arg(3).is_long(&val)) return(TYPE_ERROR);
2199 dom(*solver, x, (int)val, reif);
2665 long val;
2667 Assign_IntVar(4, val, valvar);
2683 IntVar val, n;
2692 Assign_IntVar(2, vidx, val);
2712 count(*solver, vars, val, rel, n, cl);
2724 IntVar val, n;
2768 IntVar val, n;
2811 long val, n;
2901 long val, n;
2947 long val, n;
5268 // time() sets the seeds for the random var/val methods
5284 ec_trail_undo(_g_delete_space, ec_arg(1).val.ptr, ec_arg(1).val.ptr+SPACE_STAMP_POS, NULL, 0, TRAILED_WORD32);
5360 p_fprintf(log_output_,"Found a solution with cost %d\n", solver->vCost.val());
5405 //ec_trail_undo(_g_delete_space, ec_arg(1).val.ptr, NULL, NULL, 0, TRAILED_WORD32);