Searched refs:first (Results 176 - 200 of 314) sorted by relevance

1234567891011>>

/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dpdb.pl327 % We do a garbage collection first because trimcore0 unmaps unsed
H A Dt_all.pl314 % If not, print first difference and fail
H A Dbsi.pl197 % the following predicates have the stream as first argument
H A Dtest_util.pl120 The first value is the name of the test (last argument in test pattern).
161 first solution of Goal is committed to, and CheckGoal executed with
/barrelfish-2018-10-04/usr/eclipseclp/Opium/
H A Dopium.pl89 * instantiated to the first parameter
H A Dopium_light.pl144 * instantiated to the first parameter
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Ddebugger.tex301 %Assume: first and last call in a clause are marked F and L respectively.
303 %When encountering a non-first call, generate exit ports for all
H A Dumscmacros.tex45 This set of macros was historically the first "external predicate
391 to the string value and {\tt s} to the first string character.
474 pointer to the first character of the string.\\
528 %the first one is the DID of the array functor
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dcolgen.tex230 where we first create a {\tt colgen} instance {\tt cut\_stock}, set up the variable domains of the subproblem and the demand constraints of the master problem, set up the initial master problem bound constraints and subproblem knapsack constraint, then solve and return the variables with non-zero values in the optimal solution. The definition of cutting cost as waste has been combined with the knapsack constraint, while the bounds placed on this cost exclude cuttings with sufficient waste to produce further boards, thus limiting the amount of search in subproblem solution. The chosen method of subproblem solution is:
277 we first rank the variables in order of decreasing dual value, label
H A Dsolversintro.tex206 performing depth-first tree search.
207 With combinatorial problems, naive depth-first search is usually not
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dchangeset.pl72 What happened here is that the first constraint X1 #> X2 caused X1 to
H A Dfrequency.pl183 % Ys_Zs is the list Ys_X_Zs without X (the first element of X_Zs)
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ech/
H A Dpuzzle_bool.pl117 % odd/2 generates the constraint that an odd number of elements of its first
/barrelfish-2018-10-04/usr/drivers/solarflare/
H A Dsfn5122f_cdriver.c53 // first entries of the buffer table to make up queue
175 // first to start everything
176 bool first; member in struct:sfn5122f_driver_state
1026 /* Which buffer table entries are used (which is the first entry) */
1079 /* Which buffer table entries are used (which is the first entry) */
1571 /* Map first BAR for register access */
1620 if (st->first){
1622 st->first = 0;
1702 st->first = 1;
/barrelfish-2018-10-04/usr/tests/devif/
H A Dbench.c41 struct list_ele* first; member in struct:direct_state
98 // first 10 % is warmup
H A Ddebug_test.c46 struct list_ele* first; member in struct:direct_state
H A Dqueue_interface.c57 struct list_ele* first; member in struct:direct_state
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dextfd.tex800 The approach is similar to the previous example: first we create
957 Note however, that this matching clause succeeds even if the first
1052 with an existing domain, the domain has to be copied first.
1478 clauses of the fit predicate. The first colour list contains
1479 colours in the first argument of fit/2 and the second list
1513 Propia is the first candidate to convert an existing relation into
1572 Five men with different nationalities live in the first five houses
1581 The Norwegian lives in the first house on the left.
1748 first it tries to match the amount of remaining components with zero
2075 lexicographically greater or equal than the first on
[all...]
H A Dicsymbolic.tex149 the number of domain elements. The first value in the domain
/barrelfish-2018-10-04/lib/lua/src/
H A Dlcode.c69 void luaK_ret (FuncState *fs, int first, int nret) { argument
70 luaK_codeABC(fs, OP_RETURN, first, nret+1, 0);
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Dembfunc.tex61 Here are two examples working with lists, the first one constructing
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumscmdlineopts.tex127 The system will first search for these files in the current directory,
H A Dumsmacros.tex141 The term to transform is passed as the first argument, the second is a free
317 Note that we first erase the read macro for integers, otherwise we would get
521 The first argument of \bipref{phrase/3}{../bips/kernel/control/phrase-3.html} is
650 The first argument represents the parsing input before consuming
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/grace/
H A Doptions.pl37 % Initialization, done on first Grace invocation
88 % Short form, if we know that the array already exists (not the first call)
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dapplic.pl176 % improved if the List argument came first, but this argument order

Completed in 99 milliseconds

1234567891011>>