Searched refs:cases (Results 26 - 50 of 72) sorted by relevance

123

/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Ddbi.tex116 To successfully load the dbi library in such cases, you must have a version
280 intermediate buffer may not be used; in such cases, the buffer size will be
H A Dembjava.tex306 There are also a number of peculiarities for certain cases which we
642 cases, the standard streams ({\tt stdin}, {\tt stdout} and {\tt stderr}) of
718 writing. Although in some cases reading of the data is possible
720 % \footnote{Note that in extreme cases, even flushing a {\it
1037 writing. Although in some cases reading of the data is possible
1039 % \footnote{Note that in extreme cases, even flushing a {\it
1093 cases where {\eclipse} is embedded), it stores some global information
1458 an execution of a \bipref{remote_yield/1}{../bips/kernel/externals/remote_yield-1.html} goal in most cases. In addition,
H A Dembremoteproto.tex528 the diagram. In such cases, the nested interaction can be initiated, and this
909 from within an interaction. In such cases, the interaction(s) would not be
1303 cases, the interaction will be terminated early along with the attachment.
1354 cases, a unilateral disconnect will be performed by that side -- only the
H A Dembsumc.tex122 Other unexpected types yield a TYPE_ERROR. Special cases are explained below.
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dconstimpl.tex462 instantiated. An extra check ({\tt nonvar(N)}) is needed to distinguish the two cases.
464 specialised for one of these cases:
H A Drepairtut.tex749 the worst one from the knapsack. In both cases, the move gets rememebered
H A Dumsusing.tex182 tells {\eclipse} to try to find another solution. In all cases it
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dextmeta.tex469 unclear, there may be cases where changes inside this handler
578 new value). We distinguish two cases:
H A Dumsmemory.tex108 Note that space reclaiming is usually delayed in these cases
H A Dumsexcept.tex515 In those cases the second and third argument are sometimes used
791 Apart from these special cases, all other arguments will
H A Dumscompiler.tex376 module name. In rare cases, it may make sense to have an auxiliary
487 In rare cases it can make sense to split a single module into several
H A Dumsarith.tex100 constraints. Note that {\eclipse} uses the same syntax in both cases,
H A Dumsdebug.tex66 indexing). In such cases, the flow does not enter any clause box.
1135 debugger to prompt for a number. In both cases, the number specifies the
1159 subterm, instead of \pattern{Name/Arity}, since in both cases the subterms are
1414 or if it is at an attribute. In these cases, the default for the argument
H A Dumsmacros.tex151 bind the fourth argument. In both \pattern{TransPred} cases, the optional last
H A Dumsmodules.tex531 Other cases are I/O predicates---they must be executed in a
H A Dumssyntax.tex549 Again, in rare cases parentheses may be necessary to enforce the
/barrelfish-master/usr/eclipseclp/Contrib/
H A Drdtok.pl293 % three cases:
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dextchr.tex704 special cases of each constraint and then looking at interactions of
1150 actually detect some cases where guard bindings cannot constrain any global
1151 variables (for example, \verb'var/1'), and will in such cases no check
H A Deplex.tex471 best possible solution value). In these cases, it may be useful to obtain
1161 classifies these into the following cases, with default ways of handling them:
1209 eplex_abort} for the different abort cases. These events can themselves be
1348 variable). LicNum is unused. % in both cases.
/barrelfish-master/doc/014-bulk-transfer/
H A Dbulk-transfer.tex178 running on separate core. It is reasonable to prefer such cases
187 different core. But there are cases like SCC where you may end up
728 slot-pointers within each other. There are two cases here. In
931 in-order or private-mutable consumption. In these two cases, the
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Dmeta.pl757 % The cases where the first arg is instantiated are handled
/barrelfish-master/lib/tommath/
H A Dtommath.tex259 In most cases how an algorithm is explained and how it is actually implemented are two very different concepts. For
717 and it was not deemed ideal by the author of LibTomMath to force developers to have signal handlers for such cases.
1086 the most. For example, this will happen in cases where there is not a carry to fill the last position. Step two fixes the sign for
1407 Often a mp\_int must be set to a relatively small value such as $1$ or $2$. For these cases the mp\_set algorithm is useful.
1855 flag. A high level addition is actually performed as a series of eight separate cases which can be optimized down to three unique cases.
1914 specific cases need to be handled. The return code of the unsigned operations at step 1.2, 2.1.2 and 2.2.2 are
2249 After the trivial cases of inputs have been handled the sliding window is setup. Much like the case of algorithm mp\_lshd a sliding window that
2441 We first avoid cases of $b \le 0$ by simply mp\_zero()'ing the destination in such cases
[all...]
/barrelfish-master/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex1410 In cases like this, propagation can be augmented by a technique known
1421 in cases where the constraints have only one solution, interval
1452 solver to recognise cases such as these.
2331 longer delays until, in many cases, it fails to yield any new
2334 In cases where complete search is impractical, the heuristics guiding
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dkernel.tex900 The variants are for the different cases of the current clause, the
959 processing predicates), and the integer_range_switch which has cases
1476 architectures. In these cases, the data should be copied (using memcpy())
1510 its new value New. Then there are the following different cases.
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex1409 The example builds all pairs of sources and sink nodes for flows and creates contribution structures from them. An additional accumulator $NoPath$ is used to collect cases where there is no route between the nodes.
1832 or which can be directed to a log file. This can be useful in ``live'' code, in order to capture information about problems in failure cases.
1867 \item A more complex test can be used to exercise all (or nearly all) of the program code. The test data must contain enough variation to force all alternative parts in the program. This can be achieved either by accumulating large number of tests or by designing particular tests to handle special cases.
1937 \item Base clauses should be stated before recursive cases.
2009 side of infix operators. In both cases, this makes them easier to read,

Completed in 213 milliseconds

123