Searched refs:re (Results 76 - 100 of 133) sorted by relevance

123456

/barrelfish-2018-10-04/lib/openssl-1.0.0d/ms/
H A Dtestce.bat15 rem Copy the DLL's (though they'll only exist if we're in out32dll)
/barrelfish-2018-10-04/lib/openssl-1.0.0d/
H A Dopenssl.spec157 - Removed redundant subsection that re-installed libcrypto.a and libssl.a
161 - Removed redundant subsection that re-installed libcrypto.so.0.9.6 and
/barrelfish-2018-10-04/usr/eclipseclp/Alog/src/
H A Dconfigure240 | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
429 | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) ;;
725 -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dheaps.pl18 % when you use or re-distribute any of these files.
90 be grown, otherwise one of the empty slots will be re-used. (I
H A Dlinearize.pl48 % linrenorm/2 re-normalises a linear normal form expression after variable
360 % (re)normalise a linear term (see above) by collecting constants,
H A Dtracer.pl286 /* might be needed if we re-introduce shallow choicepoints
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumserrors.tex419 %then re-calls the culprit goal with the evaluated arguments.
521 %the culprit is re-called. Otherwise like {\bf error_handler/2}.
H A Dumsmodules.tex328 when the compiler encounters the local (re)definition. To avoid that,
445 avoid duplication of definitions, it is possible to re-export definitions.
831 or implicitly when the module is re-compiled, or when the {\eclipse}
H A Dumscompiler.tex227 (This is the default.) Load and replace code in memory, create/re-create
233 Do not re-create modules, but create new ones and erase them
238 Do not re-create modules, but create new ones and erase them
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/
H A Dtkeclipse.tcl1205 Scrolling is disabled by warning and error messages. Left-click on scrollbar to re-enable scrolling.\n\
/barrelfish-2018-10-04/usr/eclipseclp/Usc/src/
H A Dconfigure240 | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
429 | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) ;;
907 -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dmp.tex196 repeatedly be asked to re-solve the problem with minor modifications.
H A Deplexdiff.tex91 keeper's \verb'::/2' was re-exported through the eplex module (but not
H A Deplex.tex482 eplex_solve/1} repeatedly to re-solve the problem, perhaps after adding
499 taken into account, to re-solve the problem.
512 This technique allows for repeated re-solving with reduced variable bounds
543 Then we start a solver demon which will re-examine the problem
586 If the variable bounds change subsequently, the solver will be re-triggered,
H A Dextchr.tex334 constraint goal is added or re-activated, it checks itself the
360 same partner constraint) if the constraint goal is re-activated.
364 Then the constraint is re-activated and all its rules are tried
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/
H A Dcrypto-lib.com15 $! It was re-written so it would try to determine what "C" compiler to use
412 $! Look in the LIB_MODULE is we're in state LIB
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Ddbi.tex43 \item Tuple templates to permit the allocation and re-use of fixed size
524 The example shows how to re-code the bank transfer predicate from
672 This cursor can be re-used to check any number of accounts.
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/
H A DGraphViewer.java59 protected static final String REROUTE_STRAIGHT ="re-route edges (straight)";
60 protected static final String REROUTE_SPLINE ="re-route edges (splines)";
160 // add "edge re-layout actions"
1077 } catch(RuntimeException re) {
1078 // re-throw the exception after cleaning up the state by
1083 throw re;
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Dio.tex194 re-created when the corresponding syntax options are set, and
/barrelfish-2018-10-04/lib/openssl-1.0.0d/apps/
H A Dmakeapps.com200 $! Decide if we're building the object files or not.
/barrelfish-2018-10-04/doc/021-cpudriver/
H A Dcpudriver.tex338 The serial device is later re-initialized into a different state once the
/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/
H A Dclients.tex555 action sequence can then be optionally re-played the next time a
572 \item Watch as things magically re-arrange themselves into the configuration you previously had.
/barrelfish-2018-10-04/usr/eclipseclp/Eplex/
H A DMakefile.in768 echo === Please re-run configure on this host ; \
776 echo === Please re-run configure on this host ; \
/barrelfish-2018-10-04/usr/eclipseclp/documents/applications/
H A Dtutorial.tex90 The tutorial uses excerpts from one of applications developed by Parc Technologies to highlight some of the design choices and also to provide code examples taken from real-life components. This application is centered on IP network analysis, so devices like routers and interfaces will occur throughout the example code. A detailed understanding of the application domain should not be required to understand and re-use the examples.
171 The critical issue in defining the queries lies in identifying which data are required and/or produced, without building an actual implementation of the system. Another issue is the format of the data, which should allow a simple and efficient implementation without extra overhead for data manipulation. It is most important to get this interface right from the start, as any change will create re-work and problems integrating different versions of the software.
422 In this chapter we discuss the choice of data structures for the different application parts. Next to the top-level design, this is the most important aspect that must be specified correctly right from the beginning of a project. The wrong choice of a data structure may mean significant re-work in order to change some deficiency later on, while on the other hand a good data structure design can simplify the coding process and can lead to a very efficient implementation.
1647 It is not possible to write unbound constrained variables to a file and to load them later, they will not be re-created with their previous state and constraints. In general, it is a good idea to restrict the data format to ground terms\index{ground terms}, i.e. terms that do not contain any variables.
1793 We can often distinguish these problems by re-stating the constraint a second time after the wrong answer has been found.
1797 If the program fails when the constraint is re-stated, then we have a problem with the dynamic execution of the constraints in the constraint solver. That normally is a much more difficult problem to solve, and may involve the constraint engine itself.
1846 In a large program, it may be difficult to leap directly to the interesting part of the program. But we may have to repeat this operation several times, if we repeatedly leap/skip over an interesting statement. We can use the invocation number of a statement to jump\index{jump} to this exact place in the execution again. The invocation number\index{invocation number} is printed in parentheses at the beginning of each trace line. By re-starting the debugger, copying this number into the text field to the right of the button {\it To Invoc:}\index{To Invoc} and then pressing this button we can directly jump to this location.
1869 \item {\it Correctness}\index{correctness} of a program can only be checked if we have obtained the expected results of a test in an independent way, either by hand or by a trusted program, or simply by re-using benchmark sets from a third party.
1895 \item It helps spread knowledge about applications and their sub-systems, so that re-use opportunities are recognized earlier.
1909 For most predicates, in particular those following one of the programming concepts in chapter \ref{programmingconcepts}, it is quite simple to avoid unwanted choicepoints. Other predicates may need more effort. We can use the ECLiPSe debugger to detect if there are any unwanted choicepoints. In the trace output for the {\it EXIT} \index{EXIT}port ECLiPSe will print a \verb+*+ if the predicate leaves a choicepoint. We can easily check a complete query by skipping over its execution and checking the exit port. If a choicepoint is indicated, we can re
[all...]
/barrelfish-2018-10-04/doc/022-armv8/
H A Dreport.tex605 The ARMv8 machines that we're porting to are different to both existing ARM
614 we're taking the opportunity to simplify the initial boot process within the
847 In implementing user-level threading, we're not concerned with privilege

Completed in 297 milliseconds

123456