Searched refs:so (Results 176 - 200 of 246) sorted by relevance

12345678910

/barrelfish-2018-10-04/lib/tommath/
H A Dbn.tex76 large integer numbers. It was written in portable ISO C source code so that it will build on any platform with a conforming
196 RSA cryptography you only require exponentiation with odd moduli so even moduli support can be safely removed.
384 This function expects a pointer to an mp\_int structure and will initialize the members of the structure so the mp\_int
656 function has a return type of \textbf{void}. It cannot cause an error so it is safe to assume the function
1237 So why not always use Karatsuba or Toom-Cook? The simple answer is that they have so much overhead that they're not
1439 /* normalize `a' so now a is equal to aR */
1622 or so unique bases. However, it has been proven that the probability of failure goes down as the size of the input goes up.
/barrelfish-2018-10-04/doc/014-bulk-transfer/
H A Dbulk-transfer.tex221 \textit{Beltway buffers} so the solution of this problem is known to
402 only part of the tear-down process so some inefficiency can be
754 slots so that it can maintain the fairness in the number of
803 populating the generator-queue with free slots so that generator can
825 the producer so that it will start sending data-elements.
846 slots so that it can quickly find them whenever they are needed.
1023 slots is maintained in the private memory by the producer, so consumer
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dobsman.tex201 be representable in a machine word, and so must
224 so that in the internal representation, the term is converted
385 equivalent and so the search for next better solution starts
396 the search is aborted and the best solution found so far is
1157 the same physical domain and so when defining a new variable
1269 so that the user predicates may ignore scheduling and waking completely.
1306 to the waking scheduler and so is the {\bf constrained} list
1421 so that all values greater than this value are removed
1430 so that it is woken as soon as the minimum of either domain
1630 and readable, so tha
[all...]
H A Dintroduction.tex226 send the code to the \eclipse\ team so that it can be added to
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dexthsusp.tex322 to a variable, so it delays forever and cannot be woken again.
728 constrain a variable. They do so by invoking the built-ins
1248 To do so, it suspends on some or all of those variables.
1415 % they cannot be written out and read in. If it is necessary to do so,
1591 there is no way to escape it and wake them after, and so if
1597 so the sequence
H A Dumsusing.tex168 If you wish to edit a file (e.g., a program source file), then you may do so
635 to compile another file, and so large programs can be split between files,
798 file name, so that it does not have to be specified;
H A Dumsio.tex379 so that all standard output is redirected to some other destination
430 consider it as a sequence of characters, so that the basic unit to
1022 & terminate the term with a fullstop, so
1039 \notation{A1} and so on. When the
H A Dumsporting.tex159 when doing so.
H A Dumsflags.tex325 It is usually \notation{so} for systems that support shared libraries
435 \item {\tt \$VAR} - terms of the form '\$VAR'(N) are printed in a special way by all the predicates that obey operator declarations (i.e.\ write, writeq, print and partly printf). '\$VAR'(0) is printed as A, '\$VAR'(25) as Z, '\$VAR'(26) as A1 and so on.
H A Dumsmacros.tex295 Use \notation{set_flag(macro_expansion, off)} to do so.
314 When we want to convert the \predspec{s/1} terms back to normal integers so that
H A Dumsmodules.tex646 so that they know from which module they have been called.
776 so new languages can be added easily.
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Ddatabase-sec.tex612 The operations presented so far create relations with all the attributes
630 We can adapt the example given in section \ref{joins} so that
945 To make the retrieval of tuples from the database transparent (i.e. so there
H A Dknowbase-sec.tex252 on the number of sub-goals in the complex clause, so the following
575 DB and KB predicates, so only a brief summary is given here. For
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Dgc.tex147 target object, so this has to be moved elsewhere.
H A Druntime.tex54 so the appropriate function can be selected for every type.
105 different, but so close to each other that they are
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dcolgen.tex61 so that unused boards have zero cost in the objective function. The complete problem formulation is then:
H A Dprogramanalysis.tex150 The frequency at which the profiler samples is fixed, so in order to
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dfd_domain.pl86 * A structure declaration is used so that e.g.
96 * with these macros so that the access is independent of the
H A Dlinearize.pl195 % a -0.0__-0.0 breal in doing so
285 %% function left delayed goals, so return it to the caller
H A Dtracer.pl47 These points are synchronous in the execution, so we can easily insert
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Dlex.c129 /* nul soh stx etx eot enq ack bel bs ht nl vt np cr so si */
292 /* at eoi we don't advance pligne, so don't backup */
1008 /* strip spaces so that we know if we match a predicate or not */
/barrelfish-2018-10-04/usr/eclipseclp/documents/mpslib/
H A Doutline.tex188 so essential for distributed applications.
459 The examples presented so far use only a single port per process and
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/
H A Dchr.pl248 % so the name of the rule is not enough, the position of the head must also
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/ccgost/
H A DMakefile50 *DSO_BEOS*) sfx=".so";; \
51 *DSO_DLFCN*) sfx=`expr "$(SHLIB_EXT)" : '.*\(\.[a-z][a-z]*\)' \| ".so"`;; \
58 sfx=".so"; \
88 rm -f *.o *.obj lib tags core .pure .nfs* *.old *.bak fluff *.so *.sl *.dll
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dcardinal_union.pl291 % element of GlbUVar. It is there so that in the end of last clause (when we know
308 % PossUVar is updated so that it is contained in PossU (with counters).

Completed in 453 milliseconds

12345678910