Searched refs:correct (Results 1 - 25 of 71) sorted by relevance

123

/barrelfish-master/lib/libc/tests/gen/
H A Dfmtcheck_test.c44 int correct; member in struct:test_fmt
88 if (test_fmts[i].correct == 1)
95 (test_fmts[i].correct == 1) ? "1st" : "2nd");
/barrelfish-master/lib/libc/tests/stdio/
H A Dprint_positional_test.c43 const char correct[] = variable
120 temp = correct;
/barrelfish-master/lib/compiler-rt/test/
H A Dpowixf2_test.c29 int correct = (x == expected) && (signbit(x) == signbit(expected)); local
30 if (!correct)
33 return !correct;
H A Dpowitf2_test.c28 int correct = (x == expected) && (signbit(x) == signbit(expected)); local
29 if (!correct)
32 return !correct;
H A Dpowidf2_test.c25 int correct = (x == expected) && (signbit(x) == signbit(expected)); local
26 if (!correct)
29 return !correct;
H A Dpowisf2_test.c25 int correct = (x == expected) && (signbit(x) == signbit(expected)); local
26 if (!correct)
29 return !correct;
/barrelfish-master/usr/eclipseclp/Opium/demo/
H A Dmastermind.pl47 Bulls = N1, % correct number of bulls
49 Cows is N2 - Bulls. % correct number of cows
H A Dcheck_entry.pl48 CORRECT: display correct bibliography entry \n \
351 to correct/reject them.
501 % process correct(ed) entries
H A Dyoyo3.pl341 to correct/reject them.
436 % process correct(ed) entries
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dspell.pl64 % similar to the one found. If the user wants the handler to correct the
65 % spelling, the handler will do so and call the correct definition.
73 correct(Functor,Corr,Module),
128 % correct/3
129 % correct(+Functor,+ListOfCorrection,Module)
130 :- mode correct(+,-,+).
141 correct(F , Ps, Module) :-
144 correct(F , Ps,Module) :-
147 correct(F , Ps,Module) :-
/barrelfish-master/lib/pcre/
H A Dpcre_ucd.c3626 #error Please correct UCD_BLOCK_SIZE in pcre_internal.h
/barrelfish-master/tools/fof/
H A DFutureWork.tex33 Paka, we need a more principled back-back-end, generating (correct)
46 sure that the generated code is correct ;
56 C code is correct, we are ensured that it must never failed at
/barrelfish-master/lib/compiler-rt/builtins/
H A Dfp_extend_impl.inc91 // the correct adjusted exponent in the destination type.
/barrelfish-master/lib/openssl-1.0.0d/test/
H A Dmaketests.com810 $! Time to check the contents, and to make sure we get the correct library.
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dilog.pl181 V = Var. % To get correct behaviour if Var is instantiated or constrained
186 V = Var. % To get correct behaviour if Var is instantiated or constrained
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Dshadow_cons.pl127 % Since we put the shadow variables (which have already the correct
/barrelfish-master/usr/skb/programs/
H A Ddevice_db.pl248 % TODO: In future use ApicId to select cpu driver that has listed the correct
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dbuiltins.tex200 that are either in the correct order or in reverse order are detected.
H A Ddebugger.tex306 %This is fragile as it relies on F/L flags being always correct and
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsstyle.tex44 included in the correct modules.
/barrelfish-master/lib/openssl-1.0.0d/ssl/
H A Dssl-lib.com974 $! Time to check the contents, and to make sure we get the correct library.
/barrelfish-master/usr/eclipseclp/Contrib/
H A Dintervals.pl74 (1) Proof that the predicates terminate on correct arguments.
75 (2) Proof that the result is algebraically correct (even though it may
H A Dbags.pl198 % These routines are correct, but Oh, so costly!
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex203 For major application interfaces\index{application interfaces}, in particular those linking the Java\index{Java} and the ECLiPSe side, it is recommended to write specific code checking the data for compliance with the constraints. This simplifies the integration task by either pointing out which data do not satisfy the constraints and are therefore invalid, or by guaranteeing that the data passed are correct, and any problem is on the receiving side of the interface.
269 Once we have decided on a top-level structure, we must consider the input/output arguments of each part. We have to decide which data must be fed into which modules, where new data structures will be created and which other modules require this data. For each piece of information we must identify its source and its possible sinks. Designing these data flows is an iterative process, assigning functionality to modules and making sure that the required information is available. The design aim should be to minimize the amount of information that must be passed across module boundaries and to arrange functions in the correct data flow order, so that all information is produced before it is required in another module.
536 \index{stubs}Each query has been defined in form of a predicate, with input and output parameters. Regardless of the actual function of the query, it is easy to generate a predicate which syntactically behaves like the finished program. It reads the input parameters and creates output terms which satisfy the specification. Initially, it does not matter if the output parameters are not consistent with the input values, as long as their form is correct.
538 If a top-level query has already been revised into smaller components, we can immediately write the body of the top-level predicate calling the individual components in the right order and with the correct parameters. Adding stub definitions of these components again leads to an executable program.
944 The cuts (!) \index{cut}in the program clauses are very important, as they remove the possibility that a selected element is not included in the filtered list. If we remove the cuts, then the {\it filter} predicate has an exponential number of ``solutions''. Only the first solution will be correct, on backtracking we will decide to reject elements which satisfy the test criterion and we will explore all combinations until we reach the empty list as the last ``solution''.
1720 Suppose we have followed our methodology, and just made some modification of our previously running program. Unfortunately, after the change the program stops working. What do we do next to find the problem and to correct it? We first have to understand what types of errors\index{error} can occur in an ECLiPSe program.
1799 \subsection{Missing answer} Probably the most complex problem is a missing answer\index{missing answer}, i.e. the program produces correct answers, but not all of them. This assumes that we know this missing answer, or we know how many answers there should be to a particular problem and we get a different count when we try to generate them all. In the first case we can try to instantiate our problem variables with the missing answer before stating the constraints and then check where this solution is rejected.
1855 We typically define what a correct program should do only in an informal way, stating constraints that should be satisfied, data formats that should be accepted, etc. Proving correctness\index{correctness} would require a much more formal approach, where we first agree on a specification in a formal language and then prove that the implementation satisfies that specification. But even that does not protect us from a misunderstanding in defining the spec itself, which may not reflect the wishes of the user.
1859 Related to the question of correctness is the issue of performance\index{performance}. The program should not only produce correct results, but must produce them within a limited time. The correct resul
[all...]
/barrelfish-master/lib/openssl-1.0.0d/
H A Dmakevms.com1230 $! Time to check the contents of P5, and to make sure we get the correct library.

Completed in 177 milliseconds

123