/macosx-10.10.1/CPANInternal-159.1/Crypt-OpenSSL-Bignum-0.04/ |
H A D | test.pl | 106 my( $quotient, $remainder ) = $bn25->div( $bn23, $ctx ); 107 ok( $quotient->is_one ); 110 $bn25->div( $bn6, $ctx, $quotient, $remainder ); 111 ok( $quotient2 == $quotient ); 113 ok( 4 == $quotient->get_word() ); 116 $bn25->div( $bn6, $ctx, $quotient ); 117 ok( $quotient3 == $quotient ); 118 ok( 4 == $quotient->get_word() );
|
H A D | Bignum.xs | 212 BIGNUM* quotient; 216 croak( "usage: $bn->add( $bn2, $ctx, [, $quotient [, $remainder ] ] )" ); 217 quotient = ( items < 4 ) ? BN_new() : sv2bn( ST(3) ); 219 checkOpenSslCall( BN_div( quotient, remainder, a, b, ctx ) ); 220 ST(0) = ( (items < 4 ) ? proto_obj( quotient ) : ST(3) );
|
H A D | Bignum.pm | 196 This method returns a list consisting of quotient and the remainder 202 set to the quotient. If a fourth argument is passed, the value of the
|
/macosx-10.10.1/ICU-531.30/icuSources/i18n/ |
H A D | gregoimp.cpp | 34 double quotient; local 35 quotient = uprv_floor(numerator / denominator); 36 remainder = (int32_t) (numerator - (quotient * denominator)); 37 return (int32_t) quotient; 44 double quotient = floorDivide(dividend, divisor); local 45 remainder = dividend - (quotient * divisor); 47 // is a bug such that the quotient is off by one. If you doubt 53 double q = quotient; 54 quotient += (remainder < 0) ? -1 : +1; 55 if (q == quotient) { [all...] |
/macosx-10.10.1/tcl-105/tcl_ext/tcllib/tcllib/modules/math/ |
H A D | bessel.tcl | 169 set quotient [expr {(2.0*$sum-$ynm1)/exp($x)}] 171 expr {$result/$quotient}
|
H A D | polynomials.tcl | 352 # Divide two polynomials and return the quotient 387 foreach {quotient remainder} [DivRemPolyn $polyn1 $polyn2] {break} 388 return $quotient 427 foreach {quotient remainder} [DivRemPolyn $polyn1 $polyn2] {break} 432 # Divide two polynomials and return the quotient and remainder 486 set quotient [polynomial $quot_coeffs] 488 return [list $quotient $polyn1]
|
H A D | bigfloat.tcl | 774 # and the quotient (x divided by Pi/2) 841 # i.e. 3% on A + 2% on B --> 5% on the quotient 851 set quotient [::math::bignum::div $integerA $integerB] 853 set quotient [::math::bignum::sub $quotient 1] 855 return [normalize [list F $quotient $exp [::math::bignum::add $delta 1]]] 1506 set quotient [div $a $b] 1507 # examples : fmod(3,2)=1 quotient=1.5 1508 # fmod(1,2)=1 quotient=0.5 1509 # quotient> [all...] |
H A D | bigfloat2.tcl | 704 # and the quotient (x divided by Pi/2) 772 # i.e. 3% on A + 2% on B --> 5% on the quotient 779 set quotient [expr {$integerA/$integerB}] 781 incr quotient -1 783 return [normalize [list F $quotient $exp [incr delta]]] 1401 set quotient [div $a $b] 1402 # examples : fmod(3,2)=1 quotient=1.5 1403 # fmod(1,2)=1 quotient=0.5 1404 # quotient>0 and b>0 : get floor(quotient) [all...] |
/macosx-10.10.1/WTF-7600.1.24/wtf/dtoa/ |
H A D | fixed-dtoa.cc | 337 // The quotient delivers the first digits, and the remainder fits into a 64 344 uint32_t quotient; local 347 // Then need q (quotient) and r (remainder) as follows: 358 quotient = static_cast<uint32_t>(dividend / divisor); 362 quotient = static_cast<uint32_t>(dividend / divisor); 365 FillDigits32(quotient, buffer, length);
|
H A D | bignum.cc | 528 int quotient = this_bigit / other_bigit; 529 bigits_[used_digits_ - 1] = this_bigit - other_bigit * quotient; 530 result += quotient;
|
/macosx-10.10.1/emacs-93/emacs/lisp/obsolete/ |
H A D | float.el | 204 "Returns the quotient of two floating point numbers." 208 (quotient 0) 214 (setq quotient (ash quotient 1)) 215 (setq quotient (1+ (ash quotient 1)) 220 (cons (if sign (- quotient) quotient)
|
/macosx-10.10.1/bc-21/bc/dc/ |
H A D | numeric.c | 124 /* divide two dc_nums, place quotient into *quotient and remainder 129 dc_divrem DC_DECLARG((a, b, kscale, quotient, remainder)) 133 dc_num *quotient DC_DECLSEP 136 bc_init_num((bc_num *)quotient); 139 (bc_num *)quotient, (bc_num *)remainder, kscale)){
|
/macosx-10.10.1/hfs-285/fsck_hfs/dfalib/ |
H A D | SAllocate.c | 345 UInt32 quotient; local 347 quotient = numerator / denominator; 348 if (quotient * denominator != numerator) 349 quotient++; 351 return quotient;
|
/macosx-10.10.1/CommonCrypto-60061/include/ |
H A D | CommonBigNum.h | 464 @param quotient A bigNum in which to place the quotient (a div b). 473 CCBigNumDiv(CCBigNumRef quotient, CCBigNumRef remainder, const CCBigNumRef a, const CCBigNumRef b)
|
/macosx-10.10.1/CommonCrypto-60061/lib/ |
H A D | CommonBigNum.c | 362 CCBigNumDiv(CCBigNumRef quotient, CCBigNumRef remainder, const CCBigNumRef a, const CCBigNumRef b) argument 365 ccz_divmod((ccz *)quotient, (ccz *)remainder, (ccz *)a, (ccz *)b);
|
/macosx-10.10.1/OpenSSL098-52/src/MacOS/GetHTTPS.src/ |
H A D | CPStringUtils.cpp | 755 unsigned long tempNum,quotient,remainder; local 789 quotient = tempNum / 10; 791 remainder = tempNum - (quotient * 10); 797 tempNum = quotient;
|
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
H A D | tommath.tex | 2376 This algorithm will divide an input $a$ by $2^b$ and produce the quotient and remainder. The algorithm is designed much like algorithm 2390 the quotient is obtained. 3673 Provided that $2^q \ge a$ this algorithm will produce a quotient that is either exactly correct or off by a value of one. In the context of Barrett 3677 Let $n$ represent the number of digits in $b$. This algorithm requires approximately $2n^2$ single precision multiplications to produce the quotient and 3682 $a = 180388626447$ modulo $b$ using the above reduction equation. The quotient using the new formula is $\lfloor (a \cdot \mu) / 2^q \rfloor = 152913$. 3689 the initial multiplication that finds the quotient. 3694 $m - 1$'th digit of $a$ will contribute at most a value of $1$ to the quotient because $\beta^k < b$ for any $0 \le k \le m - 1$. Another way to 3696 ${a \over b} \equiv {{a' + a''} \over b}$ which is equivalent to ${a' \over b} + {a'' \over b}$. Since $a'$ is bound to be less than $b$ the quotient 3699 Since the digits of $a'$ do not contribute much to the quotient the observation is that they might as well be zero. However, if the digits 3709 would have the exponent $2m$ so in the end the exponents do ``add up''. Using the above equation the quotient [all...] |
/macosx-10.10.1/bc-21/bc/lib/ |
H A D | number.c | 993 /* Calculate the number of quotient digits. */ 1008 /* Allocate and zero the storage for the quotient. */ 1037 /* Calculate the quotient digit guess. */ 1100 /* We now know the quotient digit. */ 1132 bc_num quotient = NULL; local 1146 quotient = bc_copy_num (temp); 1154 *quot = quotient;
|
/macosx-10.10.1/CPANInternal-159.1/Time-HiRes-Value-0.07/lib/Time/HiRes/ |
H A D | Value.pm | 287 This method returns a new C<Time::HiRes::Value> value, containing the quotient
|
/macosx-10.10.1/WTF-7600.1.24/wtf/ |
H A D | DateMath.cpp | 358 int quotient = difference / 28; local 359 int product = (quotient) * 28;
|
/macosx-10.10.1/emacs-93/emacs/etc/ |
H A D | calccard.tex | 500 \key{integer quotient, remainder}{\\\, \%} 576 \key{polynomial quotient, remainder, GCD}{a \\\, a \%\, a g}
|
/macosx-10.10.1/vim-55/runtime/syntax/ |
H A D | monk.vim | 80 syn keyword monkFunc quotient remainder modulo gcd lcm numerator denominator
|
H A D | maxima.vim | 152 syn keyword maximaFunc qunit quotient radcan radexpand radsubstflag random rank
|
H A D | scheme.vim | 86 syn keyword schemeFunc quotient remainder modulo gcd lcm numerator denominator
|
/macosx-10.10.1/dtrace-147/libdtrace/ |
H A D | dt_consume.c | 230 dt_divide_128(uint64_t *dividend, uint64_t divisor, uint64_t *quotient) argument 269 quotient[0] = result[0]; 270 quotient[1] = result[1];
|