/macosx-10.10.1/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_Cursor b_); [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.1/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 1035 row.ConcatRow(b_);
|
H A D | viewx.cpp | 384 bool operator == (const c4_Reference &a_, const c4_Reference &b_) { argument 389 bool f2 = b_.GetData(buf2);
|
/macosx-10.10.1/Security-57031.1.35/Security/include/security_cryptkit/ |
H A D | CryptKitAsn1.h | 54 CSSM_DATA b_; // can't use variable/field b member in struct:__anon3717
|
H A D | CryptKitAsn1.cpp | 24 { SEC_ASN1_SIGNED, offsetof(FEECurveParametersASN1,b_) },
|
H A D | CryptKitDER.cpp | 380 giantToCssmData(cp->b, asnCp.b_, coder); 413 cp->b = cssmDataToGiant(asnCp.b_);
|
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cryptkit/lib/ |
H A D | CryptKitAsn1.h | 54 CSSM_DATA b_; // can't use variable/field b member in struct:__anon4432
|
H A D | CryptKitAsn1.cpp | 24 { SEC_ASN1_SIGNED, offsetof(FEECurveParametersASN1,b_) },
|
H A D | CryptKitDER.cpp | 380 giantToCssmData(cp->b, asnCp.b_, coder); 413 cp->b = cssmDataToGiant(asnCp.b_);
|
/macosx-10.10.1/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 78 const TSortData *b=b_;
|
/macosx-10.10.1/ncurses-44/ncurses/Ada95/samples/ |
H A D | Makefile.in | 147 rm -f *.o *.ali b_t*.* *.s $(PROGS) a.out core b_*_test.c *.xr[bs] \
|
/macosx-10.10.1/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 747 const module * const *b = b_;
|
/macosx-10.10.1/apr-32/apr/apr/poll/unix/ |
H A D | kqueue.c | 320 static apr_status_t cb_cleanup(void *b_) argument 322 apr_pollcb_t *pollcb = (apr_pollcb_t *) b_;
|
/macosx-10.10.1/ksh-23/ksh/src/cmd/ksh93/data/ |
H A D | builtins.c | 33 # define bltin(x) (b_##x)
|
/macosx-10.10.1/OpenSSL098-52/src/crypto/x509v3/ |
H A D | v3_addr.c | 720 const IPAddressFamily * const *b_) 723 const ASN1_OCTET_STRING *b = (*b_)->addressFamily;
|
H A D | v3_asid.c | 170 const ASIdOrRange * const *b_) 172 const ASIdOrRange *a = *a_, *b = *b_;
|
/macosx-10.10.1/ncurses-44/ncurses/Ada95/src/ |
H A D | Makefile.in | 190 rm -f *.o *.ali b_t*.* *.s $(PROGS) a.out core b_*_test.c *.xr[bs] *.a
|
/macosx-10.10.1/CPANInternal-159.1/JSON-XS-3.01/ |
H A D | XS.xs | 554 he_cmp_fast (const void *a_, const void *b_) 559 HE *b = *(HE **)b_;
|
/macosx-10.10.1/tcl-105/tcl_ext/snack/snack/demos/tcl/ |
H A D | sdx | 690 �1S�-��v~a�G�w\/��m����q����L���A>��1����Ml��6lm��f�+��?Bx���~d�1��O��������}��bg=}O����W�z�z �Y�|6���������R(�P"���S�������k$$
|p�wrJ�fX�����1E'��$��(������_Q����.�C��D��FV��3���%���R�2�O��]�nY����l��i!��y� ��7T��b���/ �����OG���9�>�t!���E&vLp ����I
�Nt:0����n�C�y��\C���>��kb~����T�P����sC�gA��<]��~
�����
���q�7 �y.�5� a�y/��CSA��������B9��D��/�#��?u�����2��-Y�����5�4^�1B��@K]�
�����$f����������N�������!�<l>o�m.���]Su������#��i�z ��|������,](\��jL5X������K"����@���,MZs�l��;p����$�R����@��Ad�`9b_c��dR�G#�d�%�� �}$,n9 �<�qOqAB����Y��=��v'>�� -a%�r��)A���X1*���D��g������
���#�#��pV��1���&*����?��y��������@��o�P�rH�������Y�%��vG8��>�8�:�8�~3�)1�����&��-������g�����t�^��i�NN��s�����g]��<w�Q���(�<�^ �#U~��r���(��
�J �oPwu�t���j�t�s"��� +z2��7�.����p8:Hz0��A�����F�~,e�o���` �1w2������z����^]���$D��u�4���x������U�����em��d�� �8��B&��b����zj- Njj��� ���d�?�b�����3���B���|O}��n��,x�UKXX���$�2I���!u�aU)2��=v�_��;�&� }(��]M�9�N�B�a�9���H��O]����Ts� �����;�<����`�N�_��P�x��Kg��2U�e�f\��|���O?`������#����],8�:W�;&�����cOX
M
&������;���nkb��yq�i�%u;N�u�j��t������$�*8e<��r{��c,����&�����@D��� �g�"/pD �o�5UW��a� 1523 ��L��H��8M5�a�N3�����8� ��x����E���}v�{�(�����I��b_�}'��;�U��[�q.��El.>�gE������3,~�-�S�D����6�]]���>�����P�sE�w^n�y/x���nd��^���A k���kHoi
|
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
H A D | tommath.tex | 1149 \hspace{3mm}2.1 $b_{n} \leftarrow a_{n}$ \\ 1151 \hspace{3mm}3.1 $b_{n} \leftarrow 0$ \\ 2040 \hspace{3mm}6.1 $b_{n + 1} \leftarrow r$ \\ 2539 \hspace{6mm}5.4.1 $\hat r \leftarrow t_{iy + ix} + a_{ix} \cdot b_{iy} + u$ \\ 2754 \hspace{6mm}5.4.1 $\_ \hat W \leftarrow \_ \hat W + a_{tx+iy}b_{ty-iy}$ \\ 3371 \hspace{3mm}8.1 $b_{ix} \leftarrow W_{ix}$ \\ 3373 \hspace{3mm}9.1 $b_{ix} \leftarrow 0$ \\ 4839 slower than squaring. Recall from the previous algorithm that $b_{i}$ refers to the $i$'th bit of the exponent $b$. Suppose instead it referred to 4945 \hspace{6mm}2.2.2 Extract the $k$ bits from $(b_{i}b_{ [all...] |