/macosx-10.10/tcl-105/tcl_ext/mk4tcl/metakit/include/ |
H A D | mk4dll.h | 68 d4_DLLSPEC(bool)operator == (const c4_View &a_, const c4_View &b_); 69 d4_DLLSPEC(bool)operator != (const c4_View &a_, const c4_View &b_); 70 d4_DLLSPEC(bool)operator < (const c4_View &a_, const c4_View &b_); 71 d4_DLLSPEC(bool)operator > (const c4_View &a_, const c4_View &b_); 72 d4_DLLSPEC(bool)operator <= (const c4_View &a_, const c4_View &b_); 73 d4_DLLSPEC(bool)operator >= (const c4_View &a_, const c4_View &b_); 75 d4_DLLSPEC(bool)operator == (c4_Cursor a_, c4_Cursor b_); 76 d4_DLLSPEC(bool)operator != (c4_Cursor a_, c4_Cursor b_); 77 d4_DLLSPEC(bool)operator < (c4_Cursor a_, c4_Cursor b_); 78 d4_DLLSPEC(bool)operator > (c4_Cursor a_, c4_Curso [all...] |
H A D | mk4.h | 220 bool operator == (const t4_i64 a_, const t4_i64 b_); 221 bool operator < (const t4_i64 a_, const t4_i64 b_); 351 bool operator == (const c4_RowRef &a_, const c4_RowRef &b_); 352 bool operator != (const c4_RowRef &a_, const c4_RowRef &b_); 353 bool operator <= (const c4_RowRef &a_, const c4_RowRef &b_); 354 bool operator >= (const c4_RowRef &a_, const c4_RowRef &b_); 355 bool operator > (const c4_RowRef &a_, const c4_RowRef &b_); 356 bool operator < (const c4_RowRef &a_, const c4_RowRef &b_);
|
/macosx-10.10/tcl-105/tcl_ext/mk4tcl/metakit/src/ |
H A D | table.cpp | 143 bool operator == (const c4_Bytes &a_, const c4_Bytes &b_) { argument 144 return a_._contents == b_._contents || (a_._size == b_._size && memcmp 145 (a_._contents, b_._contents, a_._size) == 0);
|
H A D | view.cpp | 1033 c4_Row operator + (const c4_RowRef &a_, const c4_RowRef &b_) { argument 1034 c4_Row row = a_;
|
H A D | viewx.cpp | 384 bool operator == (const c4_Reference &a_, const c4_Reference &b_) { argument 386 bool f1 = a_.GetData(buf1);
|
/macosx-10.10/apr-32/apr-util/apr-util/hooks/ |
H A D | apr_hooks.c | 75 static int crude_order(const void *a_,const void *b_) argument 77 const TSortData *a=a_;
|
/macosx-10.10/apache-793/httpd/modules/generators/ |
H A D | mod_info.c | 693 static int cmp_provider_groups(const void *a_, const void *b_) argument 695 const ap_list_provider_groups_t *a = a_, *b = b_; 702 static int cmp_provider_names(const void *a_, const void *b_) argument 704 const ap_list_provider_names_t *a = a_, *b = b_; 744 static int cmp_module_name(const void *a_, const void *b_) argument 746 const module * const *a = a_;
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_apple_csp/open_ssl/bn/ |
H A D | bntest.c | 100 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_); 905 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_) argument 915 if(a_) 916 a=a_;
|
/macosx-10.10/OpenSSL098-52/src/crypto/bn/ |
H A D | bn_gf2m.c | 924 int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx) argument 930 bn_check_top(a_); 945 if (!BN_GF2m_mod_arr(a, a_, p)) goto err;
|
H A D | bntest.c | 97 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_); 1820 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_) argument 1830 if(a_) 1831 a=a_;
|
/macosx-10.10/OpenSSL098-52/src/test/ |
H A D | bntest.c | 97 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_); 1820 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_) argument 1830 if(a_) 1831 a=a_;
|
/macosx-10.10/OpenSSL098-52/src/crypto/x509v3/ |
H A D | v3_addr.c | 719 static int IPAddressFamily_cmp(const IPAddressFamily * const *a_, 722 const ASN1_OCTET_STRING *a = (*a_)->addressFamily;
|
H A D | v3_asid.c | 169 static int ASIdOrRange_cmp(const ASIdOrRange * const *a_, 172 const ASIdOrRange *a = *a_, *b = *b_;
|
/macosx-10.10/vim-55/runtime/ |
H A D | scripts.vim | 339 elseif expand("%") =~ '\a\a_\a\a\($\|[.@]\)\|i18n$\|POSIX$\|translit_'
|
H A D | menu.vim | 34 if s:lang =~ '^\a\a$\|^\a\a_\a\a$'
|
/macosx-10.10/CPANInternal-159.1/JSON-XS-3.01/ |
H A D | XS.xs | 554 he_cmp_fast (const void *a_, const void *b_) 558 HE *a = *(HE **)a_;
|
/macosx-10.10/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
H A D | tommath.tex | 1074 1. while $a.used > 0$ and $a_{a.used - 1} = 0$ do \\ 1149 \hspace{3mm}2.1 $b_{n} \leftarrow a_{n}$ \\ 2142 Given a polynomial in $x$ such as $f(x) = a_n x^n + a_{n-1} x^{n-1} + ... + a_0$ multiplying by $x$ amounts to shifting the coefficients up one 2143 degree. In this case $f(x) \cdot x = a_n x^{n+1} + a_{n-1} x^n + ... + a_0 x$. From a scalar basis point of view multiplying by $x$ is equivalent to 2161 \hspace{3mm}7.1 $a_{i} \leftarrow a_{j}$ \\ 2539 \hspace{6mm}5.4.1 $\hat r \leftarrow t_{iy + ix} + a_{ix} \cdot b_{iy} + u$ \\ 2570 innermost loop $a_{ix}$ is multiplied against $b$ and the result is added (\textit{with an appropriate shift}) to $t$. 2754 \hspace{6mm}5.4.1 $\_ \hat W \leftarrow \_ \hat W + a_{tx+iy}b_{ty-iy}$ \\ 3269 \hspace{3mm}4.1 $\hat r \leftarrow t_{2ix} + \left (a_{i [all...] |
/macosx-10.10/Heimdal-398.1.2/tests/apple/ |
H A D | principal.GUPTA4.APPLE.COM | 814 ���0w&�l�G�|�����]_{O6�� . ��0Jp�a_��N������7B}M�DL�a�
���p�$]�A�@Ir . ��a��#X�*b(����Xu!.ylE3 �K�Z��Ki�>��h�*� > |