/macosx-10.10.1/JavaScriptCore-7600.1.17/tests/mozilla/ecma/Expressions/ |
H A D | 11.4.8.js | 81 var sign = ( n < 0 ) ? -1 : 1; 89 return ( sign * Math.floor(Math.abs(n)) ); 93 var sign = ( n < 0 ) ? -1 : 1; 99 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32); 106 var sign = ( n < 0 ) ? -1 : 1; 111 n = sign * Math.floor( Math.abs(n) ) 122 var sign = ( n < 0 ) ? -1 : 1; 128 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16); 156 var sign = ( n < 0 ) ? -1 : 1; 158 b += ( sign [all...] |
H A D | 11.7.1.js | 88 var sign = ( n < 0 ) ? -1 : 1; 96 return ( sign * Math.floor(Math.abs(n)) ); 100 var sign = ( n < 0 ) ? -1 : 1; 106 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32); 113 var sign = ( n < 0 ) ? -1 : 1; 118 n = sign * Math.floor( Math.abs(n) ) 129 var sign = ( n < 0 ) ? -1 : 1; 135 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16); 163 var sign = ( n < 0 ) ? -1 : 1; 165 b += ( sign [all...] |
H A D | 11.7.2.js | 26 Performs a sign-filling bitwise right shift operation on the left argument 40 8. Perform sign-extending right shift of Result(5) by Result(7) bits. The 102 var sign = ( n < 0 ) ? -1 : 1; 110 return ( sign * Math.floor(Math.abs(n)) ); 114 var sign = ( n < 0 ) ? -1 : 1; 120 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32); 127 var sign = ( n < 0 ) ? -1 : 1; 132 n = sign * Math.floor( Math.abs(n) ) 143 var sign = ( n < 0 ) ? -1 : 1; 149 n = ( sign * Mat [all...] |
H A D | 11.7.3.js | 93 var sign = ( n < 0 ) ? -1 : 1; 101 return ( sign * Math.floor(Math.abs(n)) ); 105 var sign = ( n < 0 ) ? -1 : 1; 111 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32); 118 var sign = ( n < 0 ) ? -1 : 1; 123 n = sign * Math.floor( Math.abs(n) ) 134 var sign = ( n < 0 ) ? -1 : 1; 140 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16); 168 var sign = ( n < 0 ) ? -1 : 1; 170 b += ( sign [all...] |
H A D | 11.10-1.js | 90 var sign = ( n < 0 ) ? -1 : 1; 98 return ( sign * Math.floor(Math.abs(n)) ); 102 var sign = ( n < 0 ) ? -1 : 1; 108 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32); 115 var sign = ( n < 0 ) ? -1 : 1; 120 n = sign * Math.floor( Math.abs(n) ) 131 var sign = ( n < 0 ) ? -1 : 1; 137 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16); 165 var sign = ( n < 0 ) ? -1 : 1; 167 b += ( sign [all...] |
H A D | 11.10-2.js | 89 var sign = ( n < 0 ) ? -1 : 1; 97 return ( sign * Math.floor(Math.abs(n)) ); 101 var sign = ( n < 0 ) ? -1 : 1; 107 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32); 114 var sign = ( n < 0 ) ? -1 : 1; 119 n = sign * Math.floor( Math.abs(n) ) 130 var sign = ( n < 0 ) ? -1 : 1; 136 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16); 164 var sign = ( n < 0 ) ? -1 : 1; 166 b += ( sign [all...] |
H A D | 11.10-3.js | 89 var sign = ( n < 0 ) ? -1 : 1; 97 return ( sign * Math.floor(Math.abs(n)) ); 101 var sign = ( n < 0 ) ? -1 : 1; 107 n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32); 114 var sign = ( n < 0 ) ? -1 : 1; 119 n = sign * Math.floor( Math.abs(n) ) 130 var sign = ( n < 0 ) ? -1 : 1; 136 n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16); 164 var sign = ( n < 0 ) ? -1 : 1; 166 b += ( sign [all...] |
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
H A D | bn_mp_clamp.c | 22 * Typically very fast. Also fixes the sign if there 35 /* reset the sign flag if used == 0 */ 37 a->sign = MP_ZPOS;
|
H A D | bn_mp_to_signed_bin.c | 26 b[0] = (unsigned char) ((a->sign == MP_ZPOS) ? 0 : 1);
|
H A D | bn_mp_add_d.c | 33 if (a->sign == MP_NEG && (a->used > 1 || a->dp[0] >= b)) { 34 /* temporarily fix sign of a */ 35 a->sign = MP_ZPOS; 40 /* fix sign */ 41 a->sign = c->sign = MP_NEG; 52 /* sign always positive */ 53 c->sign = MP_ZPOS; 62 if (a->sign == MP_ZPOS) {
|
H A D | bn_mp_sub_d.c | 35 if (a->sign == MP_NEG) { 36 a->sign = MP_ZPOS; 38 a->sign = c->sign = MP_NEG; 61 c->sign = MP_NEG; 65 c->sign = MP_ZPOS;
|
/macosx-10.10.1/tcl-105/tcl/tcl/libtommath/ |
H A D | bn_mp_clamp.c | 22 * Typically very fast. Also fixes the sign if there 35 /* reset the sign flag if used == 0 */ 37 a->sign = MP_ZPOS;
|
H A D | bn_mp_add_d.c | 33 if (a->sign == MP_NEG && (a->used > 1 || a->dp[0] >= b)) { 34 /* temporarily fix sign of a */ 35 a->sign = MP_ZPOS; 41 a->sign = MP_NEG; 42 c->sign = (c->used) ? MP_NEG : MP_ZPOS; 53 /* sign always positive */ 54 c->sign = MP_ZPOS; 63 if (a->sign == MP_ZPOS) {
|
H A D | bn_mp_sub_d.c | 35 if (a->sign == MP_NEG) { 36 a->sign = MP_ZPOS; 38 a->sign = c->sign = MP_NEG; 61 c->sign = MP_NEG; 65 c->sign = MP_ZPOS;
|
/macosx-10.10.1/CPANInternal-159.1/Perl4-CoreLibs-0.003/ |
H A D | Build.PL | 62 sign => 1,
|
/macosx-10.10.1/emacs-93/emacs/lisp/gnus/ |
H A D | mml-sec.el | 31 (autoload 'mml2015-sign "mml2015") 33 (autoload 'mml1991-sign "mml1991") 38 (defvar mml-sign-alist 39 '(("smime" mml-smime-sign-buffer mml-smime-sign-query) 40 ("pgp" mml-pgp-sign-buffer list) 41 ("pgpauto" mml-pgpauto-sign-buffer list) 42 ("pgpmime" mml-pgpmime-sign-buffer list)) 45 (defcustom mml-default-sign-method "pgpmime" 46 "Default sign metho [all...] |
/macosx-10.10.1/ruby-106/ruby/missing/ |
H A D | tgamma.c | 20 int sign; local 35 d = lgamma_r(x, &sign); 36 return sign * exp(d); 79 int sign; local 87 sign = (fmod(i, 2.0) != 0.0) ? 1 : -1; 88 return sign * PI / (sin(PI * f) * exp(loggamma(1 - x)));
|
/macosx-10.10.1/Security-57031.1.35/Security/include/security_cryptkit/ |
H A D | giantIntegers.c | 54 Fixed (b<n), (sign<0) case in gmersennemod() to allow for arbitrary n. 56 Fixed sign-extend bug in data_to_giant(). 92 sprintf(printbuf2, "sign=%d cap=%d n[]=", x->sign, x->capacity); 93 for(i=0; i<abs(x->sign); i++) { 104 sprintf(printbuf4, "sign=%d cap=%d n[]=", x->sign, x->capacity); 105 for(i=0; i<abs(x->sign); i++) { 428 g->sign = 0; // not sure this is important... 470 result->sign 1036 int sign = gsign(g); local 1601 int s = 2*(bitlen(r)-1), sign = gsign(n); local 1649 int s = (bitlen(r)-1), sign = n->sign; local [all...] |
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_cryptkit/lib/ |
H A D | giantIntegers.c | 54 Fixed (b<n), (sign<0) case in gmersennemod() to allow for arbitrary n. 56 Fixed sign-extend bug in data_to_giant(). 92 sprintf(printbuf2, "sign=%d cap=%d n[]=", x->sign, x->capacity); 93 for(i=0; i<abs(x->sign); i++) { 104 sprintf(printbuf4, "sign=%d cap=%d n[]=", x->sign, x->capacity); 105 for(i=0; i<abs(x->sign); i++) { 428 g->sign = 0; // not sure this is important... 470 result->sign 1036 int sign = gsign(g); local 1601 int s = 2*(bitlen(r)-1), sign = gsign(n); local 1649 int s = (bitlen(r)-1), sign = n->sign; local [all...] |
/macosx-10.10.1/ruby-106/ruby/test/ruby/ |
H A D | test_sprintf_comb.rb | 174 sign = '' 195 sign = '..' 197 sign = '-' 201 sign = '+' 203 sign = ' ' 208 dlen += 2 if sign == '..' 237 nlen = prefix.length + sign.length + str.length 252 if sign == '..' 253 str = prefix + sign + str 255 str = sign [all...] |
/macosx-10.10.1/BerkeleyDB-21/db/build_windows/ |
H A D | dbkill.cpp | 39 int sign = 1; /* + */ local 46 sign = -sign; 62 if (sign > 1) 68 return sign * result;
|
/macosx-10.10.1/Libc-1044.1.2/gdtoa/FreeBSD/ |
H A D | _ldtoa.c | 46 __ldtoa(long double *ld, int mode, int ndigits, int *decpt, int *sign, argument 51 char * ret = __dtoa((double)*ld, mode, ndigits, decpt, sign, rve); 78 * gdtoa doesn't know anything about the sign of the number, so 82 *sign = u.bits.sign; 83 fpi.rounding ^= (fpi.rounding >> 1) & u.bits.sign;
|
/macosx-10.10.1/CPANInternal-159.1/Class-C3-XS-0.13/inc/Module/Install/ |
H A D | WriteAll.pm | 18 sign => 0, 24 $self->sign(1) if $args{sign};
|
/macosx-10.10.1/CPANInternal-159.1/Class-Trigger-0.14/inc/Module/Install/ |
H A D | WriteAll.pm | 18 sign => 0, 24 $self->sign(1) if $args{sign};
|
/macosx-10.10.1/CPANInternal-159.1/DateTime-Format-Pg-0.16007/inc/Module/Install/ |
H A D | WriteAll.pm | 18 sign => 0, 24 $self->sign(1) if $args{sign};
|