Searched refs:combine (Results 1 - 16 of 16) sorted by relevance

/barrelfish-master/lib/openssl-1.0.0d/crypto/asn1/
H A Dtasn_fre.c65 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine);
79 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) argument
127 if (!combine)
174 if (!combine)
H A Dtasn_new.c68 int combine);
89 int combine)
103 if (!combine) *pval = NULL;
161 if (!combine)
189 if (!combine)
321 /* NB: could probably combine most of the real XXX_new() behaviour and junk
88 asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) argument
/barrelfish-master/lib/lua/src/
H A Dluac.c136 static const Proto* combine(lua_State* L, int n) function
174 f=combine(L,argc);
/barrelfish-master/usr/eclipseclp/ecrc_solvers/chr/
H A Dmath-fourier.pl13 combine(=:=, _3916, _3916) :- inequation(_3916).
14 combine(_3933, =:=, _3933) :- inequation(_3933).
15 combine(>, _3949, >).
16 combine(_3961, >, >).
17 combine(>=, >=, >=).
523 coca(try_double(O, eq([I * J|K], L, M), F, eq(A, B, C), eq([P * Q|R], S, T), eq(U, V, W), augmentation, (inequation(T), var(P), extract(P * X, U, Y), Z is Q * X, call_kernel(Z < 0), combine(T, W, A1)), (is_div(X, Q, B1), mult_const(eq0(S, R), B1, C1), add_eq0(eq0(V, Y), C1, eq0(D1, E1)), sort1(E1, F1), eq(F1, D1, A1)), propagate)),
524 no_delayed_goals((inequation(M), var(I), extract(I * G1, A, H1), I1 is J * G1, call_kernel(I1 < 0), combine(M, C, J1))),
549 coca(try_double(O, eq(K, L, M), H, eq([A * B|C], D, E), eq(P, Q, R), eq([S * T|U], V, W), augmentation, (inequation(W), var(S), extract(S * X, P, Y), Z is T * X, call_kernel(Z < 0), combine(W, R, A1)), (is_div(X, T, B1), mult_const(eq0(V, U), B1, C1), add_eq0(eq0(Q, Y), C1, eq0(D1, E1)), sort1(E1, F1), eq(F1, D1, A1)), propagate)),
550 no_delayed_goals((inequation(E), var(A), extract(A * G1, K, H1), I1 is B * G1, call_kernel(I1 < 0), combine(E, M, J1))),
/barrelfish-master/usr/skb/programs/
H A Dobjects3.pl234 % this is nothing else as a subscription, combine this with pubsub
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex978 This concept takes a list, combines\index{combine} consecutive elements according to some criterion and returns a list of the combined elements.
988 :-mode combine(+,-).
989 combine([],[]).
990 combine([A,B|R],Res):-
993 combine([C|R],Res).
994 combine([A|A1],[A|Res]):-
995 combine(A1,Res).
1006 \index{combine\_traffic/2}
1038 Here we combine traffic samples for the same interface and time point by adding the sample values $X_{1} ... X_{10}$ and $Y_{1} ... Y_{10}$. The predicate {\it try\_to\_combine} will only succeed if the two input arguments have the same time stamp, router and interface, but it will fail if the arguments differ on these fields.
1166 We can use this concept to combine informatio
[all...]
/barrelfish-master/usr/eclipseclp/documents/tutorial/
H A Dhybrid.tex237 The following program illustrates how to combine these optimisations:
261 A simple way to combine {\tt eplex} and {\tt ic} is to send the linear
H A Dsearch.tex826 is not good enough. A possible remedy is to combine credit search with
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumslanguage.tex420 There are three ways to combine the above specifiers in a single do loop:
426 This is the normal way to combine iteration specifiers: simply
H A Dumsmodules.tex475 combine modules into new modules, as illustrated in figure~\ref{reexport}.
/barrelfish-master/usr/eclipseclp/Mercury/
H A Dm_tree234.pl2395 % steal T1's leftmost subtree and combine it with T0
2402 % steal T1's leftmost subtree and combine it with T0
2409 % move T0 one level down and combine it with the subtrees of T1
2425 % steal T0's leftmost subtree and combine it with T1
2432 % steal T0's leftmost subtree and combine it with T1
2439 % move T1 one level down and combine it with the subtrees of T0
2456 % steal T1's leftmost subtree and combine it with T0
2463 % steal T1's leftmost subtree and combine it with T0
2488 % steal T0's rightmost subtree and combine it with T1
2495 % steal T0's rightmost subtree and combine i
[all...]
/barrelfish-master/doc/000-overview/
H A DOverview.tex80 into a domain. Typically this is used to combine related dispatchers
/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dextfd.tex344 The logical constraints can be used to combine simpler constraints
H A Dic.tex707 which can be used to combine reified constraints using logical
H A Dobsman.tex449 The logical constraints can be used to combine simpler constraints
/barrelfish-master/usr/eclipseclp/documents/search/
H A Dsearch.tex749 is not good enough. A possible remedy is to combine credit search with

Completed in 200 milliseconds