/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/ |
H A D | multiuser-sec.tex | 280 This is because temporary relations are conceptually intended to last
|
H A D | database-sec.tex | 478 The last example illustrates the use of the wild character `\verb-*-' in 485 with `F'. Note that the wild character `\verb-*-' may only occur as last
|
H A D | knowbase-sec.tex | 466 The last clause is one created by {\bf define\_implicit/1}. Such clauses
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/ |
H A D | search.tex | 214 If not, the last solution found is the proven optimum. 1053 (min_max) is invoked in the last line of the code. 1409 new alternative values to one (generally the last assigned) variable. The 1683 nogood, the constraint that this last variable cannot take on its nogood
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsopsys.tex | 237 the part beginning with the last dot in the string).
|
H A D | umsmacros.tex | 151 bind the fourth argument. In both \pattern{TransPred} cases, the optional last
|
/barrelfish-2018-10-04/doc/009-notifications/ |
H A D | Notify.tex | 228 x86$\_$64 (2K cycles) compared to the hacky syscall I was using last week
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extconjunto.tex | 524 procedure backtracks and removes the last element added to the set 850 \item the last action \verb/wake/ triggers the execution of all goals that are
|
H A D | eplex.tex | 498 constraints posted to the eplex instance since the solver was last invoked 825 For example, it is possible to obtain the solution values from the last
|
H A D | ic.tex | 759 expression context and as such should provide forms where the last argument 1181 computation since the last reset.
|
/barrelfish-2018-10-04/doc/019-device-drivers/ |
H A D | DeviceDriver.tex | 214 The last argument specifies the architectures we want to build this driver 587 region of the OMAP4 chip. The last argument specifies where this new
|
/barrelfish-2018-10-04/lib/arranet/ |
H A D | arranet.c | 1724 /* uint64_t last = rdpmc(0); */ 1739 /* memcache_times[19][memcache_transactions[19]] = now - last; */ 2566 ne->last[0], ne->last[1], ne->last[2]);
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn.tex | 176 This is to help resolve as many dependencies as possible. In the last pass the symbol LTM\_LAST will be defined. 197 Build trims are meant to be defined on the last pass of the configuration which means they are to be defined 321 The last two codes listed are not actually ``return'ed'' by a function. They are placed in an integer (the caller must
|
H A D | tommath.tex | 531 That is, to implement the lowest level dependencies first and work towards the most abstract functions last. For example, 1049 though, with no final carry into the last position. However, suppose the destination had to be first expanded 1086 the most. For example, this will happen in cases where there is not a carry to fill the last position. Step two fixes the sign for 2184 The loop on step 7 copies the digit from the tail to the head. In each iteration the window is moved down one digit. The last loop on 2397 The last algorithm in the series of polynomial basis power of two algorithms is calculating the remainder of division by $2^b$. This 2446 the number. First we zero any digits above the last digit in $2^b$ (line 42). Next we reduce the 2821 a carry for the next pass. After the outer loop we use the final carry (line 77) as the last digit of the product. 2941 By adding the first and last equation to the equation in the middle the term $w_1$ can be isolated and all three coefficients solved for. The simplicity 3277 \hspace{3mm}Set the last carry. \\ 3395 Finally the last differenc [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | search.tex | 194 If not, the last solution found is the proven optimum. 833 and so on. Any remaining credit after the last child node is lost.
|
H A D | constimpl.tex | 443 either the first, or one of the last three clauses is executed.
|
H A D | tkdebug.tex | 533 have been updated since {\eclipse} last compiled the file.
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/asm/ |
H A D | pa-risc2.s | 238 CMPIB,=,N 0,num,bn_mul_add_words_exit ; are we done, or cleanup last one
|
H A D | pa-risc2W.s | 230 CMPIB,=,N 0,num,bn_mul_add_words_exit ; are we done, or cleanup last one
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | scheduler.c | 209 #define SMSG_MAXNUM 31 /* last item */ 2206 st_id_t *last = self; local 2227 } while (!ComnKnot(prev,last));
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/ |
H A D | dbi.tex | 359 this undoes all transactional changes made to the database since the last
|
H A D | umscmacros.tex | 522 one in the last subscript are adjacent in memory.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | runtime.tex | 222 and is used to free the string when the last functor with this name disappears.
|
H A D | umscmacros.tex | 532 %one in the last subscript are adjacent in memory.
|
/barrelfish-2018-10-04/doc/003-hake/ |
H A D | Hake.tex | 642 Ignoring the last line for the moment, if you know enough Haskell this
|