/barrelfish-2018-10-04/include/bfdmuxtools/ |
H A D | codegen.h | 34 void compile_filter(char *expression, uint8_t ** filter_code, int32_t *filter_len);
|
/barrelfish-2018-10-04/include/lwip/lwip/ |
H A D | debug.h | 70 /** if "expression" isn't true, then print "message" and execute "handler" expression */ 72 #define LWIP_ERROR(message, expression, handler) do { if (!(expression)) { \
|
/barrelfish-2018-10-04/include/lwip2/lwip/ |
H A D | debug.h | 134 /* if "expression" isn't true, then print "message" and execute "handler" expression */ 135 #define LWIP_ERROR(message, expression, handler) do { if (!(expression)) { \
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/ |
H A D | knowbase-lst.tex | 36 \item[+RelationName \hspace {1mm} $<$$-$$-$$-$ \hspace {1mm} +Expression]{Set evaluation of a deductive algebraic expression and deletion from a deductive relation.} 38 \item[+RelationName \hspace {1mm} $<$+++ \hspace {1mm} +Expression]{Set evaluation of a deductive algebraic expression and insertion into a deductive relation.} 46 \item[expand +Expression]{Set evaluation of a deductive algebraic expression and display on standard output.} 48 \item[?RelationName expand +Expression]{Set evaluation of a deductive algebraic expression and creation of a deductive target relation.} 50 \item[isdr +Expression]{Set evaluation of a deductive algebraic expression and display on standard output.} 52 \item[?RelationName isdr +Expression]{Set evaluation of a deductive algebraic expression and creation of a deductive target relation.}
|
H A D | database-lst.tex | 37 \item[+Expression \hspace{1mm} ++$>$ \hspace{1mm} ?TupleList]{Set retrieval specified by an algebraic expression.} 39 \item[+RelationName \hspace{1mm} $<$++ \hspace{1mm} +Expression]{Set insertion of an algebraic expression or a list of tuples.} 41 \item[+RelationName \hspace{1mm} $<$$-$$-$ \hspace{1mm} +Expression]{Set deletion of an algebraic expression or a list of tuples.} 49 \item[?RelationName isr +Expression]{Set evaluation of an algebraic expression and creation of a target relation.}
|
H A D | backwards-sec.tex | 52 expression
|
H A D | database-sec.tex | 449 used in an {\bf isr} relational expression to perform selection 470 \index{attribute expression} 554 It is possible for an ambiguity to arise in the expression 650 which takes either a relational expression or a list of tuples and puts them 709 either by a relational expression or as an 718 of the deletion operator may be any expression that is legal for
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ech/ |
H A D | puzzle_bool.pl | 39 boolean expression (and in fact is so by SICStus Prolog's bool:sat) and in L 40 the list of variables involved in this boolean expression; so 45 shows the instantiations of L for which the boolean expression is true 61 the expression generated by the program below, for large N and in reasonable 68 in case you have to adapt the expression for your own boolean solver, in 69 the expression generated, ~ means negation, + means disjunction,
|
H A D | deussen_bool.pl | 56 solve_bool(X,1), % boolean expression X must be 1 (true)
|
/barrelfish-2018-10-04/lib/bfdmuxtools/ |
H A D | codegen.c | 102 * @param expr the expression to search in 126 * \brief Removes leading and trailing spaces, and brackets that sourround the expression 127 * @param expr the expression to work with 205 * @param expr the expression to work with 232 // Enforce syntax: Don't ignore left part of the expression, if 318 * \brief Compiles a filter expression in Bfdmux Filter Language into Bfdmux Intermediate Code 319 * @param expression the expression to compile 324 compile_filter(char *expression, uint8_t ** filter_code, int32_t *filter_len) argument 333 // int len = strlen(expression); [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | linearize.pl | 31 % A linear expression is normalised into a list (sum) of the form 38 % linearize/3 converts a general arithmetic expression into a 45 % lin(Lin) embedded normalised linear expression 48 % linrenorm/2 re-normalises a linear normal form expression after variable 51 % delinearize/2 converts back into normal arithmetic expression, but 76 summary:"Split and arithmetic expression into linear and nonlinear parts", 78 args:["Expression":"Arithmetic expression with constants and variables", 83 The linear component of expression is normalised into a list 91 linearize/3 converts a general arithmetic expression into a 100 where Lin is an already normalised linear expression [all...] |
H A D | db.pl | 494 ** expression ++> List % retrieve result of evaluation 496 ** RelName isr expression % create for result of evaluation 499 ** relname <++ expression % insert result of evalutation 502 ** relname <-- expression % delete result of evalutation 504 ** An expression is one of 684 ** the kernel of a relational expression is one of
|
/barrelfish-2018-10-04/lib/barrelfish/ |
H A D | init.c | 83 static void libc_assert(const char *expression, const char *file, argument 93 disp_name(), expression, function, file, line);
|
/barrelfish-2018-10-04/lib/cxx/unwind/ |
H A D | DwarfInstructions.hpp | 56 static pint_t evaluateExpression(pint_t expression, A &addressSpace, 217 DwarfInstructions<A, R>::evaluateExpression(pint_t expression, A &addressSpace, argument 221 pint_t p = expression; 222 pint_t expressionEnd = expression + 20; // temp, until len read 751 fprintf(stderr, "expression evaluates to 0x%llX\n", (uint64_t) * sp);
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsarith.tex | 38 Unlike other languages, Prolog usually interprets an arithmetic expression like 42 unify with a number. The evaluation of an arithmetic expression has to be 47 The basic predicate for evaluating an arithmetic expression is 55 \about{Expression} is a valid arithmetic expression and \about{Result} 59 An error occurs if \about{Expression} is not a valid arithmetic expression or 308 eval(E) & evaluate runtime expression & term & number \\ 362 An arithmetic expression is a Prolog term that is made up of variables, 376 For instance, the expression above would be evaluated by the goal sequence 429 The arguments of the user-defined arithmetic expression are \emph{not 431 For example, the expression \notatio [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | read.pl | 70 syntax_error([operator,expected,after,expression], S). 124 syntax_error([expression,expected], []). 187 syntax_error([Token,cannot,start,an,expression], S0). 288 syntax_error([Culprit,follows,expression], [Thing|S1]).
|
H A D | tidy.pl | 20 Purpose: Limited algebraic expression simplifier. 32 An <expr> is an ordinary algebraic expression. Statements are scanned 96 tidy_expr/2, % tidy an expression 119 tidy_expr(+,-), % tidy expression
|
H A D | distfix.pl | 108 syntax_error([operator,expected,after,expression], S). 162 syntax_error([expression,expected], []). 233 syntax_error([Token,cannot,start,an,expression], S0). 334 syntax_error([Culprit,follows,expression], [Thing|S1]).
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extfd.tex | 122 \item[constraint expression] 123 A constraint expression is either an arithmetic constraint 206 The constraint expression {\it E} is evaluated on runtime 209 default compile-time transformation of the given expression 369 expression {\it E1} is imposed. 397 The constraint expression {\it E1} implies the 398 constraint expression {\it E2}. 405 The constraint expression {\it E1} is equivalent to the 406 constraint expression {\it E2}. 407 If one expression become [all...] |
H A D | gfd.tex | 178 any sub-expression within the expression. However, it is possible that some of
296 expression) or a truth value (constraint expression). Integer and
306 with the truth value of the expression treated as the integer value 1 (true)
323 Specifies a logical connection between constraint expression(s).
338 as a constraint expression, evaluating to the reified truth value.
443 ExprIdx can be an integer expression.
453 Within the expression context, the constraint evaluates to its
455 state of the constraint store then the (sub-)expression
[all...] |
H A D | fdsets.tex | 206 use a set expression. A set expression is composed from ground sets
|
H A D | ic.tex | 128 may be embedded in any other constraint expression, evaluating to 234 with an expression which evaluates to the same real value we get 283 can be reified simply by including it in an expression where it will 299 The following arithmetic expression can be used inside the constraints: 414 goal may also appear within an expression. 416 Within the expression context, the constraint evaluates to its 418 state of the constraint store then the (sub-)expression 429 Any terms found in the expression whose principle functor is 430 not listed above will be replaced in the expression by a newly 447 indicate that a variable will be bound to an expression a [all...] |
H A D | obsman.tex | 227 \item[constraint expression] 228 A constraint expression is either an arithmetic constraint 311 The constraint expression {\it E} is evaluated on runtime 314 default compile-time transformation of the given expression 474 expression {\it E1} is imposed. 502 The constraint expression {\it E1} implies the 503 constraint expression {\it E2}. 510 The constraint expression {\it E1} is equivalent to the 511 constraint expression {\it E2}. 512 If one expression become [all...] |
/barrelfish-2018-10-04/doc/003-hake/ |
H A D | Hake.tex | 91 Each Hakefile should be thought of as containing a Haskell expression 92 which evaluates to a set of rules for Make. The expression will be 107 Haskell expression which itself evaluates to a set of Make rules. 108 \item Hake constructs a single very large Haskell expression out of 114 \item This large expression is then evaluated. The result is a single 191 The outermost square brackets are a Haskell list expression - each 368 Each Hakefile is an expression that must evaluate to a list of 456 the expression: 631 In the expression:
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | icintro.tex | 388 \Note{If one wishes to construct an expression to use in an IC constraint at 406 expression and can be used by: 419 When constraints appear in an expression context, 427 place it in an expression context (i.e.\ on either side of a \verb|$=|, 482 in an expression context and as such should provide a version with an extra 492 \quickref{Constraint Expression Connectives\label{expression-connectives}}{ 510 expressions. These are summarised in Figure~\ref{expression-connectives}.
|