Searched refs:first (Results 201 - 225 of 314) sorted by relevance

1234567891011>>

/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dstruct.pl138 natural choice of working structure in the first step is a substitution
H A Dcardinal_util.pl244 % The first N elements of List constitute ListTillNth (List's prefix of length N).
254 % (The first N-1 elements of List are discarded).
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dapply_macros.pl76 summary:"Call Pred on all Subterms of Term (depth-first and left-to-right order)"
102 desc:"The traversal is depth-first and left-to-right",
289 % traversal is depth-first and left-to-right
332 % traversal is depth-first and left-to-right
H A Dcp_min.pl103 HP is ((100 * H) // (100 - P)) + 1, % ensures first solution when P>0
H A Ddebug.pl200 % look first for preds defined locally
/barrelfish-2018-10-04/doc/018-Practical-guide/
H A Dreadme.tex218 \texttt{core=N} as its first argument.
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumslanguage.tex305 For all but the first iteration, the value of \about{In} is the same as the
428 iterated synchronously; that is, they all take their first
429 ``value'' for the first execution of \about{Goals}, their second ``value''
985 Let us first compare strings with character lists.
1006 property that when two lists are concatenated, only the first one needs
1014 At a first glance, an atom does not look too different from a string.
1072 to unify the call with the first clause, then the second and so on until
H A Dumsusing.tex62 The first is using \notation{tkeclipse}, which provides an interactive graphical
130 To execute a query, first enter it into the \guitext{Query Entry}
217 the first time; and
378 The list in square brackets on the first line specifies the configuration
771 directory. If such a file is found, {\eclipse} compiles it first.
H A Dumsdebug.tex61 enters the procedure box by its CALL port and enters the first clause
251 \item The first character shows some properties of the
295 \item[\notation{CALL}:] a procedure is called for the first time concerning a
474 prompt for a command at the crossing of the first
478 it will prompt for a command at the first port of a leashed
767 program in \notation{creep} mode and type \notation{q} at the first command
1138 to the first argument, and the number style of the command to move to the
1327 first argument of the parent term, then the movement will stop at the first
1344 the current subterm stopped at leftmost position---the first argumen
[all...]
H A Dexthsusp.tex110 At any time, the system attempts to solve the most urgent subgoal first.
239 provides several alternatives, the first being \defnotion{delay clauses}.
345 Delay if the first two arguments are identical and the third is a variable:
353 Delay if the argument is a structure whose first subterm is not ground:
468 we can rewrite our first delay-clause example from above as follows:
515 first in the queue, the suspended goal is executed.
572 the goal will wake up as soon as the first of them occurs:
602 implemented by first waiting for \about{X}'s instantiation, then waking up and
1154 Appends the first of two suspension lists (argument
H A Dumsmemory.tex36 This chapter may be skipped on a first reading.
193 Should the first clause fail, the system will backtrack
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Dembed.tex430 The data passed out via the first argument of \bipref{yield/2}{../bips/kernel/externals/yield-2.html}
469 first argument to the \bipref{yield/2}{../bips/kernel/externals/yield-2.html} goal. If it returns \verb.EC_fail.
615 the first elements.
660 To convert from an {\eclipse} term to a C type you first have to
697 copy it first.
H A Dembjava.tex210 Note the first line using {\tt import}. We need to have this in every
258 \ref{sec:ji-calling-goals} and \ref{sec:ji-using-queue-streams}, but it is first necessary to understand how {\eclipse} data is represented in Java.
338 first parameter is a string which becomes the functor of the term. The
528 // The first and second arguments of the goal term are the two subgoals
532 // X is the first argument of the first goal.
534 // Y is the first argument of the second goal.
563 following Java code will output {\tt q(b, b)} for the first {\tt rpc}\index{rpc() method}
582 is returned to Java immediately after the first solution to the goal
584 for example, although the first {\eclips
[all...]
H A Dembtclmulti.tex91 except at the start (first) and end (last) of a multitasking phase. In
140 supplied as the first argument. This will for example allow the
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dicintro.tex293 The basic IC relational constraints come in two forms. The first form is
776 passing a list containing the product identifiers in the first argument
784 \verb0element/30 constraint, it is usually faster than the first
1099 The search is done by first choosing a colour for each bin, and then
1108 The remaining variables are labelled by employing the first fail heuristic
/barrelfish-2018-10-04/doc/003-hake/
H A DHake.tex25 % Include version history first
248 The first argument is the name of the platform (``\texttt{ARMv7}''),
278 The first component is called the ``tree''. Whenever Hake runs, it
489 be generated first in order to calculate C dependencies, but which
671 case, the first thing to try to is completely remove the build tree
/barrelfish-2018-10-04/doc/013-capability-mgmt/
H A Dtype_system.tex668 \arg Offset (in #pages) of the first page to get new set of flags from the
669 first page in the mapping identified by the mapping capability.
755 \item[Origin] Given to the first domain spawned on a core.
797 \item[Origin] Given to the first domain spawned on a core.
823 \arg CSpace address of the Dispatcher capability of the first domain to run
/barrelfish-2018-10-04/doc/019-device-drivers/
H A DDeviceDriver.tex167 In a first step, we will look at the necessary bits and pieces to write a new
405 helps doing that. One of the first steps is to initialize the client library
486 the first place. For that we have to look at the \fnname{device\_caps.c} file
579 the first user-space program called init, in the system. Similar to a UNIX
583 the pages are not zeroed before mapping it for the first time. The next two
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Dbip_domain.c1554 insert_interval(word first, word last, pword *newi) argument
1561 if (first == last) {
1562 newi->val.nint = first;
1564 } else if (first + 1 == last) {
1565 newi->val.nint = first;
1574 } else if (first < last) {
1583 p[1].val.nint = first;
3151 } else { /* The head of the first list is moved in the result */
H A Dread.c328 #define PREBINFIRST 0x08 /* first argument of prefix binary op */
752 * prefix with lower priority CAN follow first prefix
1708 * first argument, unifies the second argument with the list of doublets
2081 int i, first = 1; local
2100 if (first) {
2102 first = 0;
/barrelfish-2018-10-04/doc/002-mackerel/
H A DMackerel.tex264 least-significant bits first or most-sigificant bits first.
555 \texttt{device} specification: if \texttt{lsbfirst}, the first field
814 field containing bit 31) first. On an Intel architecture machine,
816 the first set of fields whose width adds up to 32, reversing their
993 %% This is at first sight a little confusing. Suppose we have a device
1019 you first need to declare one of these, and then call a function
1287 read/writeable or reserved register fields will be determined first
1358 read/writeable or reserved register fields will be determined first
1481 %% This is at first sigh
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/
H A Dset.pl856 set(SetX), % At least the first two sets are known
983 /* the domains of the two first sets is modified */
1011 inter_s(SetX,SetY,S) :- %first two terms are at least known
1113 set(SetY), /* the first two sets are known */
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Deplex_relax.pl242 % Compute the start of the convex hull (typically up to the first
606 % If first segment going down, P0 can only be
683 % If first segment going up, P0 can only be
735 % Find the first point in common between the old and the new hulls,
H A Drepair.pl59 % lib(repair) should occur first to achieve this !
343 % Make this low so that propagation comes first
468 is that when a violation is first detected and the Constraint enters the
665 % the first time it finds a constraint is unsatisfiable
/barrelfish-2018-10-04/include/vm/
H A Dvm_page.c362 int error, first; local
364 first = 1;
370 sbuf_printf(&sbuf, "%s%#jx", first ? "" : ",",
372 first = 0;
814 * Called after the first try the exclusive unbusy of a page failed.
1828 * first physical page in the set. If the given value "boundary" is
2273 * the first page in a power-of-two-
2324 * is the first page in a power-of-two-sized run of
2335 * first page in a run of contiguous cache/free pages.
2565 * Moreover, it is the first pag
[all...]

Completed in 460 milliseconds

1234567891011>>