Searched refs:up (Results 126 - 150 of 199) sorted by relevance

12345678

/barrelfish-2018-10-04/doc/016-serial-ports/
H A DSerial.tex70 Check the header file for a (possibly) more-up-to-date description.
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/core/
H A Duser_mad.c67 * device special file is opened, we look up the corresponding struct
919 up(&port->sm_sem);
945 up(&port->sm_sem);
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/
H A Dtkinspect.tcl48 ## Speeded up moving down structures in navigation panel by use of the new
237 brings up a menu with summary information and options. \n Note: cannot interact \
249 bind $iw <Key-Left> "tkinspect:Move $iw $h up $alert_text"
350 -command "tkinspect:Move $iw $h up $alert_text"] -side $side -padx $pad
351 pack [button $cf.up -image $tkinspectvalues(upimage) \
397 balloonhelp $cf.up "Move to previous sibling term"
H A Declipse_tools.tcl429 balloonhelp $t "Help Information Window: displays description of ECLiPSe libraries or predicates\n selected from either the tree display or the entry window.\nSelect item from tree display to obtain short description here,\n or type in entry window for longer description of predicates.\nLeft click on any word to put it in entry\nDouble left-click to look word up directly"
1740 bind $ec_tracer.buttons <Key-u> {tkecl:set_tracercommand up}
1756 button $ec_tracer.buttons.up -text Up -underline 0 -command {tkecl:set_tracercommand up}
1757 pack $ec_tracer.buttons.up -side left -fill x -expand 1
1821 balloonhelp $ec_tracer.buttons.up "Continue until back to parent's\
2023 up { ;# jump one level up
2047 # with spypoints as we will set one up on the template
2190 $ec_tracer.buttons.up configur
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Ddbi.tex106 Your environment must be set up so that you can connect to a
149 involves parsing the SQL statement and setting up a buffer for the tuples.
264 \item[s(123,X)] Describes any Prolog term that occupies up to 123 bytes
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Drepair.tex217 When the constraint goes into conflict, it will show up in the
320 a change has been made, in order to obtain an up-to-date conflict set.
418 In the following example, we set up three constraints as both repair and
H A Dic.tex39 appearing in both kinds of constraints would end up with two domain
89 to be ``safe'' if it strays up into this region by ensuring no
191 up to the user to decide how large an error is tolerable for any given
940 constraints over real variables are only guaranteed to be consistent up to
943 Note that a higher threshold speeds up computations, but reduces precision
1147 The number of linear constraints set up.
/barrelfish-2018-10-04/usr/eclipseclp/documents/mpslib/
H A Doutline.tex113 can be {\it registered}, {\it looked up}, and {\it deregistered}.
164 the name server is up and running. Normally, it is not used in an
168 {\it mps\_port\_deregister} are used for registering, looking up and
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Drepairtut.tex377 in reverse order when backing up the tree to a parent node. This fits
474 This speeds up hill climbing because, after each move, its effect on
625 up as explained above. The violation of the capacity constraint
H A Deprolog.tex151 iterate Goals with I ranging over integers from Min up to Max.
348 read a string up to a certain terminator character.
809 like {\tt call(Goal)}, except that in addition a Recovery goal is set up, which
H A Dsearch.tex45 Once the model is set up, we go into the search phase.
680 This will of course not speed up the finding of the first solution.
729 up to a certain depth and switch to an incomplete search method below this
808 by rounding the child node's credit up rather than down.
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dextsuspend.tex127 is instantiated, and so we can pick up any variable and
139 Instead, we pick up one variable from the list until
403 Now we can see that compound terms are processed up to the first
H A Dumsarith.tex261 ceiling(E) & round up to integral value & number & number \\
337 Caution: In {\eclipse} versions up to 5.8, \notation{mod} was the
362 An arithmetic expression is a Prolog term that is made up of variables,
H A Dumslanguage.tex396 up to \about{Max}.
524 Iterate over integers from 1 up to 5:
884 Indices run from 1 up to the arity of the array-structure.
1007 to be copied, while the list that makes up the tail of the concatenated
1029 be looked up and possibly entered into the dictionary, which implies
H A Dumsprofile.tex236 %succeed to pick up the right clause at the first try
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/
H A Dsearch.tex75 Once the model is set up, we go into the search phase.
731 by rounding the child node's credit up rather than down.
1012 in reverse order when backing up the tree to a parent node. This fits
1156 up as explained above. The violation of the capacity constraint
1443 already have set up the initial constraints so that the search can
1481 \item Setting up the nogood constraints to apply to both the actual and
1704 The nogood-constraint is set up by
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Devents.pl789 % end of loading a code unit: do any finishing up work
1135 functor(NewGoal, F, A), % up to 5.10 culprit is tool
1346 % This is not strictly necessary, but we can clean up the postponed
1570 ?- reset_error_handlers. % set up the handlers
1637 % We expect this handler to be set up with the defers-option.
H A Dtracer_tty.pl87 % doesn't get mixed up with the standard input of the debugged program.
390 printf(debug_output, "Var/term spy set up with invocation number (%d)", [I]),
540 do_tracer_command(0'A, Frame, N, Cont) :- !, % move up
541 writeln(debug_output, "up subterm"),
597 [N]<up> move up [N times] (alternative: A)\n\
H A Dsystools.pl69 (ST = BT -> % check if up-to-date
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mthca/
H A Dmthca_cmd.c154 * Round up and add 1 to make sure we get the full wait time (since we
338 up(&dev->cmd.poll_sem);
415 up(&dev->cmd.event_sem);
560 up(&dev->cmd.poll_sem);
811 * Round up number of system pages needed in case
1550 * Round up number of system pages needed in case
/barrelfish-2018-10-04/lib/lua/src/
H A Dlparser.c223 Upvaldesc *up = fs->f->upvalues; local
225 if (luaS_eqstr(up[i].name, name)) return i;
275 int v = searchvar(fs, n); /* look up locals at current level */
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Ddebugger.tex258 sets up call and goes to event handler
/barrelfish-2018-10-04/doc/000-overview/
H A DOverview.tex259 kernel looks up the capability reference in the appropriate cspace to find the
487 or domains. When they start up, they are supplied with arguments
533 starting up driver domains based on information in the SKB and in
794 coherent, up-to-date documentation at the same time. However, efforts
/barrelfish-2018-10-04/doc/011-idc/
H A DIDC.tex894 Figure~\ref{fig:ump_bind} shows the steps in setting up UMP binding:
1020 receiver, where it sets up its own endpoint cap and buffer and binding struct,
1066 The sender also has to know whether it is going to run up against the
1078 it on to the receiver. This sets up its channel struct accordingly and finalises
/barrelfish-2018-10-04/lib/tommath/
H A Dtommath.tex129 great deal of work in which multiple precision mathematics was needed. Understanding the possibilities for speeding up
146 Karatsuba multiplication. I was laid up, alone and immobile, and thought ``Why not?'' I vaguely knew what Karatsuba multiplication was, but not
206 see fit.} can only represent values up to $10^{19}$ as shown in figure \ref{fig:ISOC}. On its own the C language is
220 The basic IEEE \cite{IEEE} standard floating point type is made up of an integer mantissa $q$, an exponent $e$ and a sign bit $s$.
425 is encouraged to answer the follow-up problems and try to draw the relevance of problems.
511 (\textit{GCC}). This means that without changes the library will build without configuration or setting up any
583 will not exceed the allowed boundaries. These three properties make up what is known as a multiple precision
913 The requested digit count is padded up to next multiple of \textbf{MP\_PREC} plus an additional \textbf{MP\_PREC} (steps two and three).
1053 The ideal solution is to always assume the result is $i + j$ and fix up the \textbf{used} count after the function
1613 $\left [ 1 \right ]$ & Suggest a simple method to speed up th
[all...]

Completed in 462 milliseconds

12345678