/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | sample.tex | 54 \item For notes that the reader can safely skip on first reading, 57 \Note{For notes that the reader can safely skip on first reading,
|
H A D | prolog.tex | 38 %We shall first introduce 305 the first one is true because both conjuncts are true, the second is false: 461 Since we will annotate some of our programs, we first introduce 536 between the clauses. So the first 561 % shall first discuss the basic mechanism for computation in Prolog -- 629 \item Select the first of these clause. If there are more, remember the 643 unify with the goal, but the textually first clause, clause 1, is 644 selected first, and successfully unified with the goal: 659 with clause 5 selected first. There are no body goals to add, and 670 empty resolvent. The program has thus found the first solutio [all...] |
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/x509v3/ |
H A D | v3_crld.c | 249 int first = 1; local 256 if (first) 257 first = 0; 263 if (first)
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/ms/ |
H A D | testss.bat | 83 echo first generated request is invalid 89 echo first generated cert is invalid
|
H A D | testssce.bat | 89 echo first generated request is invalid 95 echo first generated cert is invalid
|
/barrelfish-2018-10-04/lib/barrelfish/ |
H A D | ump_chan.c | 377 struct ump_chan *uc, *first = dp->ump_send_events_list, *next; local 380 for (uc = first; uc != NULL; uc = next) { 392 first = next; 399 if (next == first) {
|
H A D | lmp_chan.c | 394 struct lmp_chan *lc, *first = dp->lmp_send_events_list, *next; local 397 for (lc = first; lc != NULL; lc = next) { 405 if (next == first) {
|
/barrelfish-2018-10-04/lib/libc/iconv/ |
H A D | bsd_iconv.c | 192 qsort_helper(const void *first, const void *second) argument 197 s1 = first;
|
/barrelfish-2018-10-04/usr/eclipseclp/Opium/ |
H A D | opium_light_kernel_patch.pl | 60 Tells whether the first trace line upon returning to 77 In Opium the very first line of each execution is always
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/test/ |
H A D | tests.com | 148 $ write sys$output "test first x509v3 certificate"
|
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | order.pl | 46 % first argument as =<. This is good for generating prefixes
|
/barrelfish-2018-10-04/lib/cxx/cxx/ |
H A D | regex.cpp | 293 __s.__node_ = this->first(); 322 __s.__node_ = this->first();
|
H A D | thread.cpp | 198 i->first->notify_all();
|
/barrelfish-2018-10-04/tools/fof/ |
H A D | IntroLanguage.tex | 19 the language, we first implement an interpreter for the core language
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | bip_misc.c | 264 * first argument must be an integer in the range [0..Argc[ 319 * unifies its second argument with the value associated with the first 1100 double first, interv; local 1103 first = (double) vfirst.nint; 1105 first = Dbl(vfirst); 1120 if (!ec_set_alarm(first, interv, _post_alarm, ec_sigalrm, 0, 0)) 1163 double first = Dbl(vfirst); local 1164 desc.it_value.tv_sec = (long) first; 1166 (long) ((first - floor(first)) * 1000000. [all...] |
H A D | sch_util.c | 83 pword first; local 87 first.tag = t_inst; 88 first.val = v_inst; 89 cur_mc = &first;
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extconjunto.tex | 243 If {\em Svar} is a set variable, it labels {\em Svar} to its first 281 The first example gives a set of cars from which we know 286 first two sets. The first execution tells us that 373 The approach is is the following: first create the set domain 471 The approach with sets is the following: first we create the number of 809 we just check deterministically if the first one is included (lattice 814 \item We check if the first set is ground and the second is a set 815 domain variable. If so, \verb/check_incl/ is called over the first 823 \item We check if the second set is ground and the first on [all...] |
/barrelfish-2018-10-04/lib/libc/net/ |
H A D | rcmd.c | 433 int first; local 444 first = 1; 454 if (first == 1 && (__check_rhosts_file || superuser)) { 455 first = 0;
|
/barrelfish-2018-10-04/lib/lua/src/ |
H A D | lcode.h | 70 LUAI_FUNC void luaK_ret (FuncState *fs, int first, int nret);
|
H A D | liolib.c | 424 static int g_read (lua_State *L, FILE *f, int first) { argument 431 n = first+1; /* to return 1 result */ 436 for (n = first; nargs-- && success; n++) { 470 return n - first; 497 else { /* first result is nil: EOF or error */
|
/barrelfish-2018-10-04/usr/eclipseclp/Opium/demo/ |
H A D | yoyo1.pl | 22 write('If subset/2 is called with the first parameter non-ground the first \n\ 61 % shift(L1,L2) : first element of L1 will be the last one of L2
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/objects/ |
H A D | obj_dat.c | 422 * if "noname" is not set then search for short and long names first. 468 int i,n=0,len,nid, first, use_bn; local 499 first = 1; 538 if (first) 540 first = 0;
|
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/include/ |
H A D | usb_xfer.h | 129 * - first: the head of the queue (first element) 137 struct usb_xfer *first; member in struct:usb_xfer_queue::__anon1595 177 void *hcd_td_first; // first td in the list
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | numbervars.pl | 53 where N is an integer number. The first encountered variable will be
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsstring.tex | 53 Let us first compare strings with character lists. 73 property that when two lists are concatenated, only the first one needs 81 At a first glance, an atom does not look too different from a string. 135 to unify the call with the first clause, then the second and so on until
|