Searched refs:statements (Results 1 - 11 of 11) sorted by relevance

/barrelfish-master/usr/eclipseclp/documents/embedding/
H A Ddbi.tex42 \item Re-use of SQL statements that are parametrised with placeholders.
134 prepared SQL statements with parameters (placeholders). Prepared SQL
135 statements are pre-parsed by the database, and can be executed more
140 prepared statements is that provided by the database, but a common syntax
203 prepared SQL statements, and passed from the database to {\eclipse\/} via
279 and the situation (input/output, prepared/direct statements), such an
301 session are a number of cursors. These are handles to SQL statements
412 statements on the database without returning results.
415 prepare SQL statements, returning a cursor to the prepared statement,
536 statements an
[all...]
/barrelfish-master/usr/eclipseclp/icparc_solvers/ilog/
H A Dscheduler.pl99 % Backtrackable statements---------------------------------------------------
/barrelfish-master/usr/eclipseclp/Contrib/
H A Dstruct.pl134 /* In order to handle statements and expressions which contain variables,
H A Dtidy.pl36 Tidy_stmt works from top down. It doesn't bother putting statements in
39 statements: (E1 & E2) & E3 -> E1 & (E2 & E3). This can do no harm. As label
/barrelfish-master/lib/openssl-1.0.0d/util/
H A Dmkerr.pl57 statements with prefix P. Default: 'openssl/' (without
/barrelfish-master/usr/eclipseclp/documents/internal/project/
H A Dorganisation.tex229 (1) consist of several statements and
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex698 If we want to scan several lists in parallel, we can use multiple {\it foreach} statements\index{foreach, multiple} in the same {\it do} loop. The following code fragment calls predicate {\it q} for the first elements of list $L$ and $K$, then for the second elements, etc.
884 In this example the transformation is completely handled by matching arguments in the {\it foreach} statements. We use the predicate {\it true} \index{true}for an empty loop body\index{loop body, empty}.
1392 If we want to create the elements in the same order as the elements in the input list, we have to exchange input and output arguments of the {\it fromto} statements, like so:
/barrelfish-master/lib/tommath/
H A Dtommath.tex1558 The two if statements (lines 25 and 29) compare the number of digits in the two inputs. These two are
1560 considerable time. The implementation given is also not valid without those two statements. $b.alloc$ may be
1601 The two if statements (lines 23 and 24) perform the initial sign comparison. If the signs are not the equal then which ever
1711 variable $\mu$ is set to zero outside the loop. Inside the loop an ``addition'' step requires three statements to produce
3011 The new coding element in this routine, not seen in previous routines, is the usage of goto statements. The conventional
3012 wisdom is that goto statements should be avoided. This is generally true, however when every single function call can fail, it makes sense
3014 required. Note how each of the if statements goes to a different label in case of failure. This allows the routine to correctly free only
3125 description, several statements have been compounded to save space. The intention is that the statements are executed from left to right across
/barrelfish-master/doc/011-idc/
H A DIDC.tex335 statements. All import files are processed in the order in which they occur on
/barrelfish-master/doc/008-tracing/
H A DTracing.tex391 is introducing preprocessor statements at different locations in the code.
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dkernel.tex2101 statements), e.g. for general unification\index{unification}, error handling etc.

Completed in 86 milliseconds