Searched refs:partial (Results 1 - 25 of 30) sorted by relevance

12

/barrelfish-2018-10-04/lib/libc/gen/
H A Dpututxline.c74 off_t partial; local
77 partial = -1;
107 if (partial == -1) {
108 partial = ftello(fp);
113 if (partial != -1)
114 partial -= (off_t)sizeof(fe);
121 * No exact match found. Use the partial match. If no partial
124 if (partial != -1)
125 ret = fseeko(fp, partial, SEEK_SE
[all...]
/barrelfish-2018-10-04/lib/cxx/cxx/
H A Dlocale.cpp1534 return partial;
1550 return partial;
1560 return frm_nxt == frm_end ? ok : partial;
1606 return partial;
1613 return frm_nxt == frm_end ? ok : partial;
1638 return frm_nxt == frm_end ? ok : partial;
1656 return partial;
1757 return codecvt_base::partial;
1770 return codecvt_base::partial;
1776 return codecvt_base::partial;
[all...]
/barrelfish-2018-10-04/lib/pcre/
H A Dpcre_exec.c161 -2 partial match; always given if at end subject
466 /* These macros pack up tests that are used for partial matching, and which
469 something has been matched). For hard partial matching, we then return
474 if (md->partial != 0 && eptr >= md->end_subject && \
478 if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL); \
482 if (md->partial != 0 && eptr > md->start_used_ptr) \
485 if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL); \
2120 if (md->partial != 0 &&
2127 if (md->partial > 1) RRETURN(PCRE_ERROR_PARTIAL);
2164 if (md->partial !
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/cms/
H A Dcms_lcl.h128 int partial; member in struct:CMS_EncapsulatedContentInfo_st
H A Dcms_sd.c90 cms->d.signedData->encapContentInfo->partial = 1;
697 cms->d.signedData->encapContentInfo->partial = 0;
819 if (cms->d.signedData->encapContentInfo->partial)
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dprolog.tex741 A data structure which contains variables is called a partial data
744 The most common case of a partial data structure is a list whose
747 Consider first an example where no partial lists occur.
771 ''partial lists'', i.e.\ lists whose head is known, but whose tail is not.
779 %around, and its ``holes'' (the variables) are filled in by further partial
783 %An example use of partial data structure is in the use of accumulator pairs,
785 %`value' being accumulated can be a partial data structure, as shown with
799 %An important technique using partial data structure is the difference list.
800 %In difference lists, a list is represented by a pair of (perhaps partial)
H A Dsearch.tex95 by incrementally constructing assignments (thereby reasoning about partial
/barrelfish-2018-10-04/usr/eclipseclp/documents/mpslib/
H A Declipse.tex74 the scheduler would only be a partial solution since quite often the scheduler
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dfd.pl2221 is found using the branch and bound method; as soon as a partial
2243 is found using the branch and bound method; as soon as a partial
2316 is found using the branch and bound method; as soon as a partial
2346 is found using the branch and bound method; as soon as a partial
2385 is found using the branch and bound method; as soon as a partial
3099 starting times of operations according to the necessary partial
H A Dlists.pl813 If List is not instantiated, member/2 binds List to a new partial list
837 If List is not instantiated, memberchk/2 binds List to a new partial
H A Dmegalog.pl38 ** a partial compatibility is achieved, however the missing parts
H A Dmodes.pl538 % Abstract domain partial ordering:
H A Dfd_domain.pl981 % Make a partial list of integers from M to N
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/
H A Ddebugger.tex139 % (partial solution, because untraced skipped parents don't
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Drepair.tex42 These tentative values may together form a partial
90 typically used to register values the variables are given in a partial
H A Dextpropia.tex341 current partial solution).
H A Dextconjunto.tex544 many real life problems. A partial list includes: railroad crew
H A Dextfd.tex237 as soon as a partial solution is found that is worse than a previously
H A Dgfd.tex956 \item the partial search methods of generic search are not supported.
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dcardinal_comments.pl58 considering set inclusion as a partial ordering. Consistency techniques are then
94 sets defines a partial order on P(U), the powerset over a certain universe U,
H A Dxml_utilities.pl388 "part"-[8706], % partial differential, U+2202 ISOtech
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Drepair.pl143 tentative values may together form a partial or even inconsistent
879 program, they can form a tentative assignment which may be a partial or
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/
H A Ddbi.tex403 partial rollbacks care has to be taken not to redo transactions on
/barrelfish-2018-10-04/usr/eclipseclp/documents/visualisation/
H A Dclients.tex190 problem. The resulting schedule/partial schedule is rendered as a
/barrelfish-2018-10-04/lib/tommath/
H A Dtommath.tex2270 shifts $k$ times to achieve a multiplication by $2^{\pm k}$ a mixture of whole digit shifting and partial digit shifting is employed.
2557 a bit awkward to modify the function from its simple $O(n^2)$ description, the usefulness of partial multipliers will arise in a subsequent
3299 The outer loop of this algorithm begins on step 4. It is best to think of the outer loop as walking down the rows of the partial results, while
3300 the inner loop computes the columns of the partial result. Step 4.1 and 4.2 compute the square term for each row, and step 4.3 and 4.4 propagate
3307 Similar to algorithm s\_mp\_mul\_digs, after every pass of the inner loop, the destination is correctly set to the sum of all of the partial
3614 exponentiations without having to perform (\textit{in this example}) $b - 1$ multiplications. These algorithms will produce partial results in the
5188 By step 13 there are no more digits left in the exponent. However, there may be partial bits in the window left. If $mode = 2$ then
5721 that the numerator of ${f(x) \over f'(x)}$ can be derived from a partial denominator. That is at first the denominator is calculated by finding

Completed in 176 milliseconds

12