/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | kernel.tex | 133 value val; /* value part first */ 262 stack. The first on has a TEXTERN tag and a pointer to a type descriptor 277 consecutive pwords on the global stack, of which the first one represents 377 B points to the first free word. Word-aligned, contains a mixture 383 TG points to the first free pword, the stack is pword-aligned. 434 B points to the first free word. Word-aligned, contains a mixture 447 after the first subgoal call. 710 Since nested structures are handled depth-first, a mechanism is required 720 read_structure(F,ref(L)) & unify first compound subterm at a nesting level \\ 725 read_list(ref(L)) & unify first lis [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/ |
H A D | database-sec.tex | 179 The first argument of the {\bf \verb-<=>-} predicate is the name of the 202 the first has the name `boy' allocated by the user and is permanent, while 285 This is done by making the first argument the name of the relation 524 The first solution inserts each tuple twice in a relation. Tuple 559 joined on their first attributes by: 662 In the first example tuples are selected from a relation and projected 818 tuples into a relation. In the first form of the predicate the 841 is used to express this goal. The first argument names the relation from which 919 the second form. In the first form wild characters are taken as 968 tuples from a relation. In the first for [all...] |
H A D | knowbase-sec.tex | 129 the first argument is the relation's name and the second the 353 This will have no effect as clause (i) has its first argument instantiated 363 To execute a clause stored in a deductive relation it is first retrieved 552 and instead of storing them directly expands them first. 649 the first two arguments of the example clauses, then a simple comparison is 652 {\bf Time}) then its valid instantiations have to be derived first, and 656 type can only deal with the first. The reason for keeping both types is
|
/barrelfish-2018-10-04/doc/017-arm/ |
H A D | ARM.tex | 42 % Include version history first 356 argument: the address of the multiboot info block. It first 584 datastructure corresponding to a DCB. This is the first struct in 667 In-Order and O3. The first two are simple one-cycle-per-instruction 694 \section{Boot process: first (bootstrap) core} 710 \item Invalidate TLB, setup arguments for first C-function arch init 732 therefore include this revised overview here. The first core is called 737 \item Pass argument from bootloader to first C-function arch 800 To compile Barrelfish for the Pandaboard, first configure your 886 \item Write the first tw [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | modelling.tex | 42 The first one is paraphrased from Kowalski \cite{kowalski79} 69 In this chapter we will focus on the first issue, {\bf Problem Modelling}, 353 will erroneously take this for a success and take the first alternative.
|
H A D | real.tex | 487 A solution to the problem can then be found by first instantiating the area 490 the farm first ensures that the first solution returned will be the minimal 492 chooses the smallest possible value first:
|
H A D | propiachr.tex | 57 that the second task not start until the first is finished. 80 constraint wakes, detects that the first 315 \verb0p(X,Y) infers most0, first the goal \verb0p(X,Y)0 is in effect 317 However Propia does not stop at the first solution, but continues to 340 For example the first result of calling \verb0member(X,[a,b,c])0 is 342 This instantiated term represents the (first) solution to the goal. 441 first step $OutTerm := \top$ is changed to finding a first solution
|
/barrelfish-2018-10-04/usr/skb/programs/ |
H A D | irq_routing_new.pl | 334 % get a route, use get_route first. 521 % EntryType = 1 for the first invocation, 2 for the recursive calls. 601 % It first translates Legacy to GSI, then GSI to internal. 602 % The first translation involves the ACPI int override table 850 %% install route going from the first input of the ioapic_0 to the first CPU.
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | tommath.tex | 92 perhaps explains it better. I am the first to admit there is not anything that special with what I have done. Perhaps 133 This text is for people who stop and wonder when first examining algorithms such as RSA for the first time and asks 149 At the time of writing this, I've still not met Tom or Mads in meatspace. I've been following Tom's progress since his first splash on the 406 Problems at the first level are meant to be simple questions that the reader can answer quickly without programming a solution or 411 Problems at the third level are meant to be a bit more difficult than the first two levels. The answer is often 531 That is, to implement the lowest level dependencies first and work towards the most abstract functions last. For example, 626 first starting at the location indexed by zero\footnote{In C all arrays begin at zero.} in the array. For example, 665 functions and make sense of them. For example, the first function would read ``multiply a and b and store in c''. 723 Given the basic mp\_int structure an initialization routine must first allocat [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | ptags.pl | 162 (string(File) -> % first convert to a string 287 (string(File) -> % first convert to a string
|
H A D | queens.pl | 47 - first fail: finite domains, the most constrained queen 51 us the first fail principle. 322 [naive, constraints, 'first fail', 'heuristics']), below, []). 330 queen_constraints_selected(_, 'first fail') :-
|
H A D | define.pl | 56 * define(+MacroName, ?Term, +Goal) will first execute Goal (the purpose
|
H A D | fd_chip.pl | 121 % The predicates for first fail principle
|
H A D | matrix_util.pl | 100 the end of file has been reached. In the first case, not all numbers in the
|
H A D | setof.pl | 134 % We first use FreeBindingsPlain to group solutions as in the attribute-free 218 % Pick the first sequence
|
/barrelfish-2018-10-04/usr/eclipseclp/Opium/ |
H A D | loadopium.pl | 127 /* scenario_handler has to be laoded first */
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/intro_paper/ |
H A D | eclipse.tex | 93 The first generation of constraint programming languages focussed on a 136 first algorithm implemented by the application developer is guaranteed 185 %at least some aspects of behaviour first. 190 We will separate this discussion into two subsections. The first is 541 In fact the problem of embedding has been overcome, though first 567 In our first example we modelled a map colouring problem using only 912 The first is a library for handling symbolic finite domains, with 1053 In this case it calls {\em indomain} first on $X$, then $Y$ and then 1061 Query 9 illustrates a heuristic based on the {\em fail first} 1064 often best to make the choice with the fewest alternatives first [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ech/ |
H A D | diaz_bool.pl | 54 /* [1,0,0],[0,0,1],[0,1,0],[0,1,0],[0,0,1]] (first solution) */ 187 /* N=8 [[0,0,0,0,0,0,0,1], (first solution) */
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/Netware/ |
H A D | cpy_tests.bat | 18 rem it will be deleted first.
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/rc4/asm/ |
H A D | rc4-ia64.pl | 65 # of the 2nd iteration is performed BEFORE the SWP of the first 70 # of S[I] from the first iteration (thanks to the fact that SWP 124 # - Note that due to the bypass/forwarding-path, the first two 126 # particular, note that the first stage of the pipeline is 136 # first few bytes separately). 155 # load and first use of the input data. 402 We must perform the first phase of the pipeline explicitly since 403 we will always load from the stable the first time. The br.cexit
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | xahcid.tex | 42 As a first step, the \ac{hba} is reset in order to get to a known state. The
|
/barrelfish-2018-10-04/doc/023-coreboot/ |
H A D | coreboot.tex | 63 architectures. We first explain the terminology used throughout this document. 204 integrating into the running OS. This involves spawning the first user-space 206 for the first user-space program loaded on the new core can be overridden 307 first send a message to the target KCB is skipped.
|
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/ |
H A D | util.tcl | 11 ## The provide goes first to prevent the recursive provide/require 345 catch {$w see $opts(-tag).first} 366 while {$ei>=$e && [string first $ec $l]} {
|
/barrelfish-2018-10-04/tools/fof/ |
H A D | FutureWork.tex | 26 that. But printing the type of such pointer was a first trouble, if
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | emu_par.c | 130 * first choicepoint is created. Temporary. 161 int first = ec_options.parallel_worker==1; local 167 if (first) 172 sch_genesis(&eng_root_node, theleaf, &eng_root_branch, first); 175 if (first) 247 * Therefore we first build a reversed list in pb, then process it. 1153 bfirst = bnew; /* find first above root */ 1182 bcommon = bfirst; /* start from first above root */ 1272 /* make the first copy packet: the engine registers */ 1433 /* Process first oracl [all...] |