Searched refs:quotient (Results 1 - 25 of 32) sorted by relevance

12

/macosx-10.9.5/CPANInternal-140/Crypt-OpenSSL-Bignum/
H A Dtest.pl106 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 DBignum.xs212 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 DBignum.pm196 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.9.5/CPANInternal-140/Crypt-OpenSSL-Bignum-0.04/
H A Dtest.pl106 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 DBignum.xs212 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 DBignum.pm196 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.9.5/ICU-511.35/icuSources/i18n/
H A Dgregoimp.cpp34 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.9.5/tcl-102/tcl_ext/tcllib/tcllib/modules/math/
H A Dbessel.tcl169 set quotient [expr {(2.0*$sum-$ynm1)/exp($x)}]
171 expr {$result/$quotient}
H A Dpolynomials.tcl352 # 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 Dbigfloat.tcl774 # 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 Dbigfloat2.tcl704 # 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.9.5/WebCore-7537.78.1/platform/
H A DDecimal.cpp169 uint32_t quotient[4]; local
174 quotient[i] = static_cast<uint32_t>(work / divisor);
176 m_low = makeUInt64(quotient[0], quotient[1]);
177 m_high = makeUInt64(quotient[2], quotient[3]);
906 const Decimal quotient = *this / rhs;
907 return quotient.isSpecial() ? quotient : *this - (quotient
[all...]
/macosx-10.9.5/WebCore-7537.78.1/platform/graphics/cpu/arm/filters/
H A DFEBlendNEON.h41 uint16x8_t quotient = vshrq_n_u16(num, 8); local
42 uint16x8_t remainder = vaddq_u16(vsubq_u16(num, vmulq_u16(sixteenConst255, quotient)), sixteenConstOne);
43 return vaddq_u16(quotient, vshrq_n_u16(remainder, 8));
/macosx-10.9.5/emacs-92/emacs/lisp/obsolete/
H A Dfloat.el204 "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.9.5/bc-21/bc/dc/
H A Dnumeric.c124 /* 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.9.5/hfs-226.1.1/fsck_hfs/dfalib/
H A DSAllocate.c345 UInt32 quotient; local
347 quotient = numerator / denominator;
348 if (quotient * denominator != numerator)
349 quotient++;
351 return quotient;
/macosx-10.9.5/CommonCrypto-60049/include/
H A DCommonBigNum.h463 @param quotient A bigNum in which to place the quotient (a div b).
472 CCBigNumDiv(CCBigNumRef quotient, CCBigNumRef remainder, const CCBigNumRef a, const CCBigNumRef b)
/macosx-10.9.5/CommonCrypto-60049/lib/
H A DCommonBigNum.c362 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.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/
H A Dtommath.tex2376 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.9.5/bc-21/bc/lib/
H A Dnumber.c993 /* 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.9.5/CPANInternal-140/Time-HiRes-Value/lib/Time/HiRes/
H A DValue.pm286 This method returns a new C<Time::HiRes::Value> value, containing the quotient
/macosx-10.9.5/CPANInternal-140/Time-HiRes-Value-0.07/lib/Time/HiRes/
H A DValue.pm287 This method returns a new C<Time::HiRes::Value> value, containing the quotient
/macosx-10.9.5/emacs-92/emacs/etc/
H A Dcalccard.tex500 \key{integer quotient, remainder}{\\\, \%}
576 \key{polynomial quotient, remainder, GCD}{a \\\, a \%\, a g}
/macosx-10.9.5/vim-53/runtime/syntax/
H A Dmonk.vim80 syn keyword monkFunc quotient remainder modulo gcd lcm numerator denominator
/macosx-10.9.5/dtrace-118.1/libdtrace/
H A Ddt_consume.c208 dt_divide_128(uint64_t *dividend, uint64_t divisor, uint64_t *quotient) argument
247 quotient[0] = result[0];
248 quotient[1] = result[1];

Completed in 276 milliseconds

12