Searched refs:choices (Results 1 - 25 of 46) sorted by relevance

12

/barrelfish-master/lib/nfs/
H A Dxdr.c348 const struct xdr_discrim *choices, /* [value, xdr proc] for each arm */
362 * search choices for a value that matches the discriminator.
365 for (; choices->proc != NULL_xdrproc_t; choices++) {
366 if (choices->value == dscm)
367 return ((*(choices->proc))(xdrs, unp));
/barrelfish-master/tools/aarch64_gem5/
H A Dgem5script.py81 choices = ["atomic", "arm_detailed"], variable in class:setCPUClass.TmpClass
99 choices=["ref", "test", "train", "smred", "mdred", variable in class:setCPUClass.TmpClass
103 choices=["arm", "thumb", "aarch64"], variable in class:setCPUClass.TmpClass
/barrelfish-master/lib/libc/xdr/
H A Dxdr.c630 xdr_union(XDR *xdrs, enum_t *dscmp, char *unp, const struct xdr_discrim *choices, xdrproc_t dfault) argument
635 * const struct xdr_discrim *choices; // [value, xdr proc] for each arm
650 * search choices for a value that matches the discriminator.
653 for (; choices->proc != NULL_xdrproc_t; choices++) {
654 if (choices->value == dscm)
655 return ((*(choices->proc))(xdrs, unp));
/barrelfish-master/usr/eclipseclp/ecrc_solvers/grace/
H A Dlabel.pl144 decval(choices),
179 getval(choices, Ch),
192 setval(choices, Ch),
204 setval(choices, Ch),
221 incval(choices),
855 getval(choices, N),
H A Dgrace.pl200 :- make_local_array(choices).
256 setval(choices, 0),
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dsearch.tex127 represent choices which partition the remaining search space into two
272 In general, the nodes of a search tree represent {\em choices}.
274 These choices should be mutually exclusive and therefore partition the
292 Other forms of choices are possible. If X2 is a variable that can take
302 However, choices do not necessarily involve choosing a concrete value
303 for a variable. It is also possible to make disjoint choices by
601 flag (deep\_fail) which ensures that backtracking to exhausted choices
774 nondeterministic choices is limited a priori. This is achieved by
779 are not allowed any nondeterministics choices, only one path though these
823 Note that this method in its pure form allows choices onl
[all...]
H A Dprolog.tex651 More choices: clause 2
667 More choices: clause 6, then clause 2
691 More choices: clause 2
705 More choices:
717 More choices: clause 6
1098 Recall that backtracking causes alternative choices to be explored, if
1100 in the poredicate definition, but alternative choices may come from
/barrelfish-master/usr/eclipseclp/WinMSC/CPPexample/
H A DCPPexample.mak15 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/Cexample/
H A DCexample.mak15 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/Minimain/
H A DMinimain.mak15 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/Ria/
H A DRia.mak14 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/Shm/
H A DShm.mak14 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/documents/search/
H A Dsearch.tex148 represent choices which partition the remaining search space into two
275 In general, the nodes of a search tree represent {\em choices}.
277 These choices should be mutually exclusive and therefore partition the
295 Other forms of choices are possible. If X2 is a variable that can take
305 However, choices do not necessarily involve choosing a concrete value
306 for a variable. It is also possible to make disjoint choices by
584 flag (deep\_fail) which ensures that backtracking to exhausted choices
697 nondeterministic choices is limited a priori. This is achieved by
702 are not allowed any nondeterministics choices, only one path though these
746 Note that this method in its pure form allow choices onl
[all...]
/barrelfish-master/usr/eclipseclp/WinMSC/Bitmap/
H A DBitmap.mak14 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/EcJava/
H A DEcJava.mak14 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/EcJavaLoad/
H A DEcJavaLoad.mak15 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/Edge_finder/
H A DEdge_finder.mak15 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/IC/
H A DIC.mak14 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/PtEclipse/
H A DPtEclipse.mak15 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/Standalone/
H A DStandalone.mak15 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/TkEclipse/
H A DTkEclipse.mak15 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/WinMSC/TkExdr/
H A DTkExdr.mak14 !MESSAGE Possible choices for configuration are:
/barrelfish-master/usr/eclipseclp/
H A DBUILD_ROTD651 eval choices=\"'$MACHINE_CLASS_ALIAS_'$m\"
652 if [ "$choices" != "" ] ; then
653 for machine in $choices ; do
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dgfd.tex948 search library make repeated choices on one variable until it becomes ground,
950 strategies on the other hand always interleave value choices with variable
1028 The multi-way choice methods make repeated choices on one variable as
1059 (possibly several) value choices on a variable are made until the
1159 allowing the restarted search to make different branching choices,
1166 if different branching choices can be made, e.g. if at least some of these
1167 choices are random, or if some of the choices have a learning component,
1170 The branching choices can also be different if the restarted search
H A Dextpropia.tex74 way Propia reduces the number of choices that need to be explored and
298 Now \verb0sum0 refuses to make any choices:

Completed in 244 milliseconds

12