Searched refs:sets (Results 26 - 50 of 91) sorted by relevance

1234

/barrelfish-master/usr/eclipseclp/ecrc_solvers/
H A Dconjunto.pl73 defined from the union of the domains or known sets appearing in Lsets.
141 disjoint. If both terms are known sets, it checks the empty
203 elements for the labeling of weighted sets.
457 only over the upper and lower bound sets of values of the set domain and
458 makes sure that these sets of values are consistent with those of other
582 set term Sterm1. If both terms are known sets, this constraint checks
H A Dset.pl856 set(SetX), % At least the first two sets are known
947 /*--------------------------------------union of a conjunction (list) of sets-*/
983 /* the domains of the two first sets is modified */
1113 set(SetY), /* the first two sets are known */
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dintroduction.tex102 \eclipse\ offers constraint solving over the domain of finite sets of
104 to reason about sets and set cardinality \cite{gervet}\footnote{
106 is generally less efficient, but implements sets of symbolic elements as
107 well as integer sets}.
H A Drepair.tex230 Note that using different conflict sets for different groups of constraints
272 conflict sets.
275 When all conflict sets are empty, a solution is found.
421 We then observe the result by retrieving the conflict sets:
/barrelfish-master/lib/libc/regex/grot/
H A Ddebug.c117 cs = &g->sets[opnd];
/barrelfish-master/lib/cpuid/
H A Dcpuid_intel.c141 _tci->ci.sets = _size / _assoc / _tci->ci.linesize; \
418 /* the the number of sets */
419 ci->sets = reg.ecx + 1;
422 ci->size = (size_t)ci->linesize * ci->sets;
426 ci->size = (size_t)ci->linesize * ci->sets * ci->associativity;
/barrelfish-master/usr/eclipseclp/icparc_solvers/rxspencer/
H A Ddebug.c148 cs = &g->sets[opnd];
/barrelfish-master/lib/libc/regex/
H A Dregcomp.c250 g->sets = NULL;
753 if ((ch = singleton(cs)) != OUT) { /* optimize singleton sets */
757 EMIT(OANYOF, (int)(cs - p->g->sets));
999 EMIT(OANYOF, (int)(cs - p->g->sets));
1146 ncs = realloc(p->g->sets, (p->g->ncsets + 1) * sizeof(*ncs));
1151 p->g->sets = ncs;
1152 cs = &p->g->sets[p->g->ncsets++];
1165 cset *top = &p->g->sets[p->g->ncsets];
H A Dengine.c603 cs = &m->g->sets[OPND(s)];
1027 cs = &g->sets[OPND(s)];
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dsolversintro.tex131 sets of integers\footnote{
134 The constraints are the usual relations over sets,
136 In addition, there are constraints between sets and integers, e.g.\
/barrelfish-master/lib/openssl-1.0.0d/apps/
H A Dmakeapps.com31 $! P3, if defined, sets a TCP/IP library to use, through one of the following
38 $! P4, if defined, sets a compiler thread NOT needed on OpenVMS 7.1 (and up)
40 $! P5, if defined, sets a choice of programs to compile.
/barrelfish-master/usr/eclipseclp/Kernel/lib/
H A Ddefine.pl76 * This sets an error handler ("macro successfully defined") so, it can be
/barrelfish-master/doc/015-disk-driver-arch/
H A Dlibahci.tex151 command header and sets the bit to indicate the \acs{dma} direction (according
152 to \lstinline+is_write+) and also sets the \ac{fis} length in the command
170 Finally \issuecmd sets the issue command bit for the command slot in which the
201 On the first call to \ahciinit, the bind callback sets up the function table
H A Dusage.tex60 The callback \lstinline+ahci_bind_cb+ simply sets the global
/barrelfish-master/usr/eclipseclp/documents/megalog/
H A Dmultiuser-sec.tex284 This provides a useful way of passing sets of tuples or clauses
363 sets of solutions (see previous example).
366 but since it is a useful way of passing sets of clauses
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Ddebugger.tex255 sets DBG_PRI,DBG_PORT,DBG_INVOC and raises event
258 sets up call and goes to event handler
/barrelfish-master/lib/openssl-1.0.0d/
H A Dmakevms.com57 $! P5, if defined, sets a TCP/IP library to use, through one of the following
68 $! P6, if defined, sets a compiler thread NOT needed on OpenVMS 7.1 (and up)
/barrelfish-master/doc/026-device-queues/
H A Ddevif.tex399 In this section we model the system as a transfer of ownership of sets of addresses. We model it as a
412 To go any further, we have to define on what sets an agent can operate on. In the following
419 The sets an Agent can operate on are $S_x$ for agent $X$ and $S_y$ for agent $Y$ and
420 each of these sets consists of memory addresses.
450 A bidirectional queue $Q$ between the two agents $X$ and $Y$ consists of two sets of addresses called
523 \caption{Buffer transfer protocol sets and the operations}
539 also address the sets $T_{xy}$ and $T_{yx}$.
812 connects to a remote endpoint, the local endpoint sets up memory for the receive/send
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Dic_probe_support.pl181 my_tent_call sets up two demons, one to perform propagation whenever the
H A Dprobe_support.pl180 my_tent_call sets up two demons, one to perform propagation whenever the
H A Dic_probe_search.pl94 variable Biv to 0 and then on backtracking sets it to 1. The
102 "gives up", sets the binary variable to the amount of resource required,
H A Dprobe_search.pl95 variable Biv to 0 and then on backtracking sets it to 1. The
103 "gives up", sets the binary variable to the amount of resource required,
H A Drepair.pl347 % use the tenability flag that it sets.
433 Note that using different conflict sets for different groups of constraints
487 Note that using different conflict sets for different groups of constraints
1377 % Constant time sets ----------------------------------------------------
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsexcept.tex198 This sets up an event \about{EventId} so that the event is raised once after
205 This sets up an event \about{EventId} so
212 This sets up a series of after events specified in the list \about{EventList},
402 sets the event handler for error type \about{ErrorId} to the procedure specified
695 provided the programmer sets up a corresponding interrupt handler.
H A Dumsintro.tex193 %There a two sets of predicates for the indexed database.
361 %\item [library(conjunto)] finite sets constraint solver

Completed in 149 milliseconds

1234