Searched refs:U1 (Results 1 - 19 of 19) sorted by relevance

/macosx-10.10.1/swig-12/Lib/csharp/
H A Dstd_pair.i29 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/swig-12/Lib/java/
H A Dstd_pair.i29 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/swig-12/Lib/ocaml/
H A Dstd_pair.i29 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/swig-12/Lib/perl5/
H A Dstd_pair.i29 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/swig-12/Lib/php/
H A Dstd_pair.i29 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/swig-12/Lib/tcl/
H A Dstd_pair.i29 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dbn_mp_exteuclid.c21 int mp_exteuclid(mp_int *a, mp_int *b, mp_int *U1, mp_int *U2, mp_int *U3) argument
70 if (U1 != NULL) { mp_exch(U1, &u1); }
H A Dtommath.h378 /* produces value such that U1*a + U2*b = U3 */
379 int mp_exteuclid(mp_int *a, mp_int *b, mp_int *U1, mp_int *U2, mp_int *U3);
H A Dbn.tex1774 mp_int *U1, mp_int *U2, mp_int *U3);
1777 This finds the triple U1/U2/U3 using the Extended Euclidean algorithm such that the following equation holds.
1780 a \cdot U1 + b \cdot U2 = U3
1783 Any of the U1/U2/U3 paramters can be set to \textbf{NULL} if they are not desired.
/macosx-10.10.1/swig-12/Lib/std/
H A Dstd_pair.i40 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/swig-12/Lib/guile/
H A Dstd_pair.i124 template <class U1, class U2> pair(const pair<U1, U2> &p);
227 template <class U1, class U2> pair(const pair<U1, U2> &p);
328 template <class U1, class U2> pair(const pair<U1, U2> &p);
421 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/swig-12/Lib/mzscheme/
H A Dstd_pair.i125 template <class U1, class U2> pair(const pair<U1, U2> &p);
227 template <class U1, class U2> pair(const pair<U1, U2> &p);
328 template <class U1, class U2> pair(const pair<U1, U2> &p);
423 template <class U1, class U2> pair(const pair<U1, U2> &p);
/macosx-10.10.1/tcl-105/tcl_ext/tcllib/tcllib/modules/ripemd/
H A Dripemd160_test.c48 static const uchar U1[] = {0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa, variable
73 { 20, U1, 50, U2 },
/macosx-10.10.1/llvmCore-3425.0.34/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-tuple.h228 template <typename U0, typename U1>
229 tuple(const ::std::pair<U0, U1>& p) : f0_(p.first), f1_(p.second) {}
237 template <typename U0, typename U1>
238 tuple& operator=(const ::std::pair<U0, U1>& p) {
/macosx-10.10.1/vim-55/src/testdir/
H A Dtest3.in1103 :set cino=(s,U1
H A Dtest49.vim9222 autocmd FuncUndefined U1 function! U1()
9223 autocmd FuncUndefined U1 Xpath 64 " X: 0
9224 autocmd FuncUndefined U1 endfunction
9225 autocmd FuncUndefined U1 Xpath 128 " X: 128
9226 autocmd FuncUndefined U1 throw "U1"
9227 autocmd FuncUndefined U1 Xpath 256 " X: 0
9292 if exists("*U1") | delfunction U1 | endi
[all...]
/macosx-10.10.1/tcl-105/tcl/tcl/libtommath/
H A Dtommath.h374 /* produces value such that U1*a + U2*b = U3 */
375 int mp_exteuclid(mp_int *a, mp_int *b, mp_int *U1, mp_int *U2, mp_int *U3);
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Scalar/
H A DIndVarSimplify.cpp272 Instruction *U1 = cast<Instruction>(*IncrUse++); local
279 FCmpInst *Compare = dyn_cast<FCmpInst>(U1);
/macosx-10.10.1/OpenLDAP-499.27/OpenLDAP/build/
H A Dshtool1336 (diff -U1 $file $file.new >$tmpfile) 2>/dev/null

Completed in 370 milliseconds