/barrelfish-master/usr/eclipseclp/documents/libman/ |
H A D | fdglobal.tex | 159 The list Profile indicates the level of resource usage at the
|
H A D | obsman.tex | 776 The \eclipse\ debugger is a low-level debugger which is 975 Another reason is that the library performs no meta-level reasoning on 1017 The {\bf fd.pl} library defines a set of low-level predicates 1511 We use more or less directly the low-level primitives to handle 1980 If we want to model the containment with low-level domain predicates, 2056 As you can see again, modeling with the low-level domain predicates 2062 some or all constraints with the low-level predicates. 2074 With low-level predicates, 2115 With low-level domain predicates, 2156 A low-level solutio [all...] |
H A D | extchr.tex | 55 %high-level debugging environment of \eclipse. 70 are a high-level language 75 The high-level \chrs\ are an excellent tool for {\em rapid prototyping} and 828 the top-level and debuggers, \eclipse\ macro transformation (for write
|
H A D | introduction.tex | 96 resource level. They reduce the finite domains of the task start times
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | umsdynamic.tex | 60 be separated in one or more source files or by the user from the top level.
|
H A D | umsstring.tex | 148 manipulation on the single character level, it is probably best to use
|
H A D | umsporting.tex | 260 can very often be solved at the Prolog level.
|
/barrelfish-master/lib/openssl-1.0.0d/engines/ |
H A D | e_capi.c | 250 "debug level (1=errors, 2=trace)", 359 CAPI_trace(ctx, "Setting debug level to %d\n", ctx->debug_level); 1031 static void capi_vtrace(CAPI_CTX *ctx, int level, char *format, va_list argptr) argument 1035 if (!ctx || (ctx->debug_level < level) || (!ctx->debug_file))
|
/barrelfish-master/doc/017-arm/ |
H A D | ARM.tex | 430 Justin Cappos to allow an atomic resume of a user-level thread 530 in user space, if the user-level scheduler (also known as the 631 \item[serial.h]: Low-level drivers for a multiple UART devices. 698 This section gives a high-level overview of the boot up process of the
|
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/ |
H A D | runtime.tex | 32 \item integers (on the implementation level we distinguish small integers\index{integers} 202 (see set_flag/2, gc_interval_dict), and this is detected in the low-level 449 level, in {\eclipse} code:
|
H A D | gc.tex | 45 The top level procedure of the collector looks like this:
|
/barrelfish-master/lib/tommath/ |
H A D | tommath.tex | 236 would truncate excess bits to maintain a fixed level of precision. 361 All of the algorithms presented in this text have a polynomial time work level. That is, of the form 406 Problems at the first level are meant to be simple questions that the reader can answer quickly without programming a solution or 407 devising new theory. These problems are quick tests to see if the material is understood. Problems at the second level 409 two levels are essentially entry level questions. 411 Problems at the third level are meant to be a bit more difficult than the first two levels. The answer is often 416 Problems at the fourth level are meant to be similar to those of the level three questions except they will require 420 Problems at the fifth level are meant to be the hardest 421 problems relative to all the other problems in the chapter. People who can correctly answer fifth level problem [all...] |
/barrelfish-master/usr/eclipseclp/Mercury/ |
H A D | m_tree234.pl | 19 % user-level documentation. 2409 % move T0 one level down and combine it with the subtrees of T1 2439 % move T1 one level down and combine it with the subtrees of T0 2470 % move T0 one level down to become the leftmost subtree of T1 2502 % move T1 one level down to become the rightmost subtree of T0 2534 % move T2 one level down to become the rightmost subtree of T1 2567 % move T0 one level down to become the leftmost subtree of T1 2600 % move T1 one level down to become the leftmost subtree of T2 2633 % move T2 one level down to become the leftmost subtree of T3 2666 % move T3 one level dow [all...] |
/barrelfish-master/doc/011-idc/ |
H A D | IDC.tex | 850 In general, messages at this level of the system are word-granularity 863 the monitors. Section~\ref{sec:binding_bindingproc} documents the user-level 1034 \section{UMP: user-level message passing with coherent shared memory} 1037 IDC between dispatchers on different cores uses UMP (user-level message passing) 1044 \caption{User-level Message Passing}
|
/barrelfish-master/lib/arranet/ |
H A D | arranet.c | 348 int lwip_getsockopt(int s, int level, int optname, void *optval, socklen_t *optlen) argument 352 switch(level) { 391 int lwip_setsockopt(int s, int level, int optname, const void *optval, socklen_t optlen) argument 395 switch(level) { 413 printf("%d, %d\n", level, optname);
|
/barrelfish-master/usr/eclipseclp/documents/embedding/ |
H A D | embed.tex | 249 back to the C level. This is implemented by returning from a function. 326 to the C++ level. By posting a goal that fails, the {\eclipse} execution 423 control to the C++ level. This is done with the
|
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | icintro.tex | 46 The typical top-level structure of a constraint program is 562 so-called \emph{global} constraints. These are high-level constraints that 602 \index{alldifferent/1@\texttt{alldifferent/1}!ic} predicate from the IC library provides a level of propagation equivalent to
|
H A D | solversintro.tex | 116 resource level. They reduce the finite domains of the task start times
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | asm.pl | 264 object format can be loaded into an ECLiPSe session using the low level 319 This predicate is intended as a replacement for the lower level als/1, 348 This predicate is intended as a replacement for the lower level als/1, 923 % asm/2 is based on the low-level builtins store_pred/9. 1009 This typed word list has no low level dependencies in that the switch 1468 % disasm/2 is based on the low-level builtins retrieve_code/3
|
H A D | lists.pl | 303 For multi-dimensional sub-arrays, only the top level is converted 1054 flatten(1, List, Flat) just flattens the top-level list of List, etc.
|
/barrelfish-master/lib/lua/src/ |
H A D | lparser.c | 257 Mark block where variable at given level was defined 260 static void markupval (FuncState *fs, int level) { argument 262 while (bl->nactvar > level) bl = bl->previous; 275 int v = searchvar(fs, n); /* look up locals at current level */ 282 else { /* not found as local at current level; try upvalues */ 415 ** "export" pending gotos to outer level, to check them against
|
/barrelfish-master/doc/026-device-queues/ |
H A D | devif.tex | 558 generic library. A high level overview of how to use the \devif interface is shown in Figure 567 \caption{High level overview} 745 When a VNIC is created, it can be instantiated with user-level networking enabled or disabled. 746 If user-level networking is enabled, mappings from of buffers that can be used to send/receive
|
/barrelfish-master/usr/skb/programs/ |
H A D | bridge_postorder_sorted.pl | 12 % on the next level children (which include subordinate bridges) are sorted by
|
H A D | bridge_postorder_sorted_sum.pl | 12 % on the next level children (which include subordinate bridges) are sorted by
|
H A D | bridge_postorder_sorted_sum_ascending.pl | 12 % on the next level children (which include subordinate bridges) are sorted by
|