| /macosx-10.10.1/CPANInternal-159.1/Perl4-CoreLibs-0.003/lib/ |
| H A D | bigrat.pl | 64 local($gcd) = &'bgcd($num,$dom);
65 $gcd =~ s/^-/+/;
66 if ($gcd ne '+1') {
67 $num = &'bdiv($num,$gcd);
68 $dom = &'bdiv($dom,$gcd);
|
| /macosx-10.10.1/bash-94.1.2/bash-3.2/ |
| H A D | bracecomp.c | 66 int start, end, gcd; local
84 gcd = strlen (array[start]);
94 gcd = temp;
121 tlen = gcd - gcd_zero;
132 subterm = really_munge_braces (array, start, end + 1, gcd);
|
| /macosx-10.10.1/emacs-93/emacs/lisp/calc/ |
| H A D | calc-frac.el | 85 ;;; the plain gcd algorithm.)
90 (let ((gcd (math-gcd num den)))
91 (if (eq gcd 1)
95 (if (equal gcd den)
96 (math-quotient num gcd)
97 (list 'frac (math-quotient num gcd) (math-quotient den gcd))))))
|
| H A D | calc-poly.el | 56 (cont (math-poly-gcd-list p)))
68 (math-neg (math-poly-gcd cont c2))
69 (math-poly-gcd cont c2))))))
141 ;;; Return gcd of two polynomials
149 (math-poly-gcd pn pd)))
367 (defun math-poly-gcd (u v)
372 (calcFunc-gcd u (calcFunc-pcont v))))
376 (calcFunc-gcd v (calcFunc-pcont u))))
378 (let ((base (math-poly-gcd-base u v)))
383 (math-poly-gcd
[all...] |
| /macosx-10.10.1/Libc-1044.1.2/stdlib/FreeBSD/ |
| H A D | getopt_long.c | 111 static int gcd(int, int);
142 gcd(int a, int b) function
173 ncycle = gcd(nnonopts, nopts);
|
| /macosx-10.10.1/file-46/file/src/ |
| H A D | getopt_long.c | 93 static int gcd(int, int);
115 gcd(a, b) function
153 ncycle = gcd(nnonopts, nopts);
|
| /macosx-10.10.1/CPANInternal-159.1/Crypt-OpenSSL-Bignum-0.04/ |
| H A D | test.pl | 121 ok( 6 == _new_bn( 18 )->gcd( _new_bn( 42 ), $ctx )->get_word() );
|
| H A D | Bignum.xs | 321 gcd(a, b, ctx)
|
| /macosx-10.10.1/ruby-106/ruby/test/ruby/ |
| H A D | test_complexrational.rb | 208 gcd = num.gcd(den)
209 @num = num.div(gcd)
210 @den = den.div(gcd)
|
| /macosx-10.10.1/text_cmds-88/sort/ |
| H A D | system.h | 745 gcd (size_t u, size_t v) function
765 return u * (v / gcd (u, v));
|
| /macosx-10.10.1/zlib-55/zlib/examples/ |
| H A D | gzappend.c | 100 local unsigned gcd(unsigned a, unsigned b) function
152 cycles = gcd(len, rot); /* number of cycles */
|
| /macosx-10.10.1/BerkeleyDB-21/db/test/ |
| H A D | sdbutils.tcl | 159 set last [expr $n * $last / [gcd $n $last]]
|
| H A D | join.tcl | 389 set last [expr $n * $last / [gcd $n $last]]
445 proc gcd { a b } { procedure
|
| /macosx-10.10.1/ICU-531.30/icuSources/i18n/ |
| H A D | nfrs.cpp | 64 // binary gcd algorithm from Knuth, "The Art of Computer Programming,"
95 int64_t gcd = x1 << p2; local
97 // x * y == gcd(x, y) * lcm(x, y)
98 return x / gcd * y;
|
| /macosx-10.10.1/ruby-106/ruby/ |
| H A D | rational.c | 474 VALUE gcd; local
486 gcd = f_gcd(num, den);
487 num = f_idiv(num, gcd);
488 den = f_idiv(den, gcd);
625 * rat.numerator.gcd(rat.denominator) #=> 1
1687 * int.gcd(int2) -> integer
1689 * Returns the greatest common divisor (always positive). 0.gcd(x)
1690 * and x.gcd(0) return abs(x).
1692 * 2.gcd(2) #=> 2
1693 * 3.gcd(
[all...] |
| /macosx-10.10.1/vim-55/runtime/syntax/ |
| H A D | plaintex.vim | 96 \ '\\\%(arc\%(cos\|sin\|tan\)\|arg\|\%(cos\|sin\|tan\)h\=\|coth\=\|csc\|de[gt]\|dim\|exp\|gcd\|hom\|inf\|ker\|lo\=g\|lim\%(inf\|sup\)\=\|ln\|max\|min\|Pr\|sec\|sup\)\>'
|
| H A D | monk.vim | 80 syn keyword monkFunc quotient remainder modulo gcd lcm numerator denominator
|
| H A D | mupad.vim | 99 syn keyword mupadFunction funcenv gamma gcd gcdex genident genpoly
|
| H A D | maxima.vim | 93 syn keyword maximaFunc gamma %gamma gammalim gauss gcd gcdex gcfactor gdet genfact
|
| H A D | scheme.vim | 86 syn keyword schemeFunc quotient remainder modulo gcd lcm numerator denominator
|
| /macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/mtest/ |
| H A D | mpi.c | 2018 ... by computing the product, and dividing out the gcd.
2023 mp_int gcd, prod; local
2029 if((res = mp_init(&gcd)) != MP_OKAY)
2036 if((res = mp_gcd(a, b, &gcd)) != MP_OKAY)
2039 res = mp_div(&prod, &gcd, c, NULL);
2044 mp_clear(&gcd);
|
| /macosx-10.10.1/emacs-93/emacs/lisp/emacs-lisp/ |
| H A D | cl.el | 607 gcd lcm isqrt floor* ceiling* truncate* round*
|
| H A D | cl-extra.el | 326 (defun gcd (&rest args) function
341 (setq a (* (/ a (gcd a b)) b))))
|
| /macosx-10.10.1/ruby-106/ruby/ext/openssl/ |
| H A D | ossl_bn.c | 357 BIGNUM_2c(gcd)
776 rb_define_method(cBN, "gcd", ossl_bn_gcd, 1);
|
| /macosx-10.10.1/JavaScriptCore-7600.1.17/tests/exceptionFuzz/ |
| H A D | earley-boyer.js | 405 var gcd = 0;
407 gcd = sc_euclid_gcd(gcd, arguments[i]);
408 return gcd;
|