/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/ |
H A D | tkeclipse.tcl | 394 ;# make sure last error is always visible 609 clipboard append [$t get sel.first sel.last] 622 $t delete sel.first sel.last 1196 balloonhelp .tkecl.query.buttons.status "Status of last query"
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/ |
H A D | embvb.tex | 220 that has been written on the stream since the last flush.
|
H A D | embremote.tex | 510 Note that the last \verb'{}' specifies that there is no {\eclipse} 527 else that has been written since the last flush), and puts it into the text 673 ec_input_popup} with myqueue. The last \verb'{}' specifies that there is no 1177 in the `InitGoal' (last) argument of {\it remote_connect/3}. InitGoal can 1219 handler is to do it during the connection, via the last argument of \bipref{remote_connect/3}{../bips/kernel/externals/remote_connect-3.html}.
|
H A D | embtclmulti.tex | 91 except at the start (first) and end (last) of a multitasking phase. In
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | globalstate.tex | 128 When the releasing process is the last attached one, the mapfile
|
H A D | debugger.tex | 301 %Assume: first and last call in a clause are marked F and L respectively.
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsdynamic.tex | 63 the previous occurrence of that procedure, and so only the last one will
|
H A D | extsuspend.tex | 126 The \about{Goal} has to be called when the last variable in \about{Term} 483 know if it is the last one or not. 497 identical, the second variable of the last suspension
|
H A D | umsarith.tex | 374 \about{n} arguments and returns a numeric result as its last argument. 424 Any predicate that returns a number as its last argument 516 where always the first arguments are taken as input and the last
|
H A D | umsdebug.tex | 88 with an asterisk (*EXIT). When the last possibly matching clause of a 123 Two situations may occur: either the last tried clause has called a 128 Otherwise, if the last clause tried does not contain any 132 The last REDO port in such a sequence is the one which contains the 135 time of the last one. 1366 the last argument of the parent term, then the movement will stop at the 1367 last argument: 1380 In the above example, the current subterm was at the third (and last) 1810 the execution returns to the debugger and the last trace line is redisplayed.
|
H A D | umsporting.tex | 59 Here, the last argument of the module/3 directive indicates the language
|
H A D | umscompiler.tex | 148 The following shorthands can be used, but note that the last two forms 700 yet or if it has been modified since the last compilation. 716 since their last compilation or loading.
|
/barrelfish-2018-10-04/doc/013-capability-mgmt/ |
H A D | type_system.tex | 42 the last copy of a capability is deleted. For capability types 43 that refer to actual memory, if the last reference to a piece of 112 \item[Last copy deleted] When the last copy is deleted, all 902 operations necessary -- as outlined in this section -- when deleting last
|
/barrelfish-2018-10-04/include/vm/ |
H A D | uma_core.c | 257 static uma_slab_t zone_fetch_slab(uma_zone_t zone, uma_keg_t last, int flags); 258 static uma_slab_t zone_fetch_slab_multi(uma_zone_t zone, uma_keg_t last, int flags); 1063 * It's ok to lose tmps references. The last one will 2389 * The last pointer is used to seed the search. It is not required. 2392 zone_fetch_slab_multi(uma_zone_t zone, uma_keg_t last, int rflags) argument 2408 * Use the last slab allocated as a hint for where to start 2411 if (last != NULL) { 2412 slab = keg_fetch_slab(last, zone, flags); 2415 KEG_UNLOCK(last); 2755 /* ub_cnt is pointing to the last fre [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | prolog.tex | 160 The last line shows that the list actually consists of 3 {\tt [Head|Tail]} 161 pairs, where the tail of the last pair is the empty list. 187 name/arity}. The last example above therefore has the functor {\tt 335 Sometimes the system cannot decide whether an answer is the last one. 377 Note in particular the last two examples (which are equivalent):
|
H A D | repairtut.tex | 296 To express this we introduce a last time point \verb0End0 which is 393 For the satisfiability example of the last section, we can change
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | gfd.tex | 476 Reified constraints (whose last argument is a 0/1 variable)
477 and functional constraints (whose last argument is an integer
478 variable) can be written without their last argument within
542 Reified constraints (whose last argument is a 0/1 variable)
543 can be written without their last argument within
1520 In addition, ``functional'' (where the last argument is a domain
1522 last argument, as in IC.
|
H A D | eplexdiff.tex | 45 changed or not since the last invocation. This can become very expensive if
|
H A D | extchr.tex | 875 \item \verb/delay_rule/: The last tried rule cannot fire because the guard did not succeed. 877 \item \verb/fire_rule/: The last tried rule fires. 884 \item \verb/delay_label/: The last label\_with declaration delays because the guard did not succeed. 886 \item \verb/fire_label/: The last tried label\_with declaration succeeds,
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/ |
H A D | tutorial.tex | 109 The tutorial follows a top-down methodology for the design of an application. Chapter~\ref{highleveldesign} discusses general issues of modular design and self-documenting code for ECLiPSe programs. The next chapter on data structures compares different ways of representing data internally and externally, and presents a canonical multi-representation format which allows effective access to data in all parts of an application. Chapter~\ref{gettingittowork} shows how to convert a high level specification into an executable program early in the development stage. The bulk of the tutorial is contained in chapter~\ref{programmingconcepts}, where we present a number of different programming concepts which can be used as development templates to solve particular problems. This is followed by chapter~\ref{inputoutput} on input/output, a particularly important aspect of developing extensible programs. The last two chapters deal with debugging (chapter~\ref{ifitdoesntwork}) and testing (chapter~\ref{correctnessandperformance}). 111 There are three appendices to the tutorial. The first one summarizes style rules that good ECLiPSe programs should satisfy. Most of the rules are explained inside the main tutorial text, they are presented here for easy reference. Appendix~\ref{layoutrules} gives some rules how ECLiPSe programs should be indented. The last section (appendix~\ref{corepredicates}) lists core ECLiPSe predicates which should cover most programming needs and which all ECLiPSe programmers should be familiar with. 264 \item[output results] The last module consists in an output routine, which creates the result data files. 436 \item[facts] The last alternative is to store the data as facts \index{fact}in the application. They can then be accessed from any part of the ECLiPSe code quite easily. Testing the code is simple by compiling some data files into the system. The Java interface can also store facts into the database quite easily. But changing the data for a new query can be rather complex, and may require recompiling some data modules. 561 As a general rule, once we have created a working stub system, we should always keep the program working by making changes in small increments and testing after each change. This way we know which part of the program was modified last and which is therefore most likely to cause the problem. 588 this we use a cut (!) \index{cut}after each guard but the last. We can leave out the cut after 589 the last guard, as there are no choices left at this point. 619 If we miss an argument on one of the clauses in the middle, the compiler will create an error message about {\it non consecutive clauses}\index{non consecutive clauses}. But if we miss an argument for either the first or the last clause, the compiler will just treat this as another predicate definition with the same name, but a different arity. Errors of this form are very hard to spot. 640 Here we branch on information passed in the first two arguments, and return a result in the last argument. The last claus [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | write.c | 530 /* write a space if last character was a symbol */ 683 * ARGLAST last term, i.e. a delimiter follows 1373 * last character of the operator and lazily insert a space if necessary 1386 int last = sd->char_class[*(DidName(d) + DidLength(d) - 1)]; local 1401 last == first_right || Alphanum(last) && Alphanum(first_right) ||
|
H A D | read.c | 1849 register vword *last = v + NUMBER_VAR; local 1850 while (v < last)
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | menu.tcl | 123 .sleep_button.menu entryconfigure [.sleep_button.menu index last] -state disabled
|
/barrelfish-2018-10-04/usr/eclipseclp/ |
H A D | BUILD_ROTD | 83 # for testing might be different to last time, in which case the old 88 # because their creation worked fine last time (e.g. the test template 112 --last-sucessful 114 last successful main branch. You cannot give a --date or 254 --last-successful) 1560 # Check if anything has changed since the last successful build 1564 echo \"Checking whether anything has changed since the last build.\" 1671 # Update the last successful build 2019 # (only if anything has changed since the last successful build) 2195 # change since the last successfu [all...] |
/barrelfish-2018-10-04/doc/002-mackerel/ |
H A D | Mackerel.tex | 131 \texttt{-S} and \texttt{-B} options are specified, the last one 894 generated code may keep a ``shadow'' copy of the last value written 1025 this is used to keep track of the last value written to the register. 1062 the last value written to the register (or 0 if the register has not 1534 the last value written to the register (or 0 if the register has not 1660 read a bitfield value from a saved copy of the last value written to 1745 read a bitfield value from a saved copy of the last value written to
|