Liking cljdoc? Tell your friends :D

sicmutils.polynomial-gcd


*poly-gcd-cache-enable*clj

source

*poly-gcd-debug*clj

source

*poly-gcd-time-limit*clj

source

gcdclj

(gcd u v)

Knuth's algorithm 4.6.1E. This can take a long time, unfortunately, and so we bail if it seems to be taking too long.

Knuth's algorithm 4.6.1E.
This can take a long time, unfortunately, and so we bail if it seems to
be taking too long.
sourceraw docstring

gcd-continuation-chaincljmacro

(gcd-continuation-chain u v & fs)

Takes two polynomials and a chain of functions. Each function, except the last, should have signature [p q k] where p and q are polynomials and k is a continuation of the same type. The last function should have signature [p q], without a continuation argument, since there's nowhere to go from there.

Takes two polynomials and a chain of functions. Each function, except
the last, should have signature [p q k] where p and q are polynomials
and k is a continuation of the same type. The last function should have
signature [p q], without a continuation argument, since there's nowhere
to go from there.
sourceraw docstring

gcd-seqclj

Compute the GCD of a sequence of polynomials (we take care to break early if the gcd of an initial segment is unity)

Compute the GCD of a sequence of polynomials (we take care to
break early if the gcd of an initial segment is unity)
sourceraw docstring

gcd-statsclj

(gcd-stats)
source

primitive-gcdclj

(primitive-gcd xs)

A function which will return the gcd of a sequence of numbers.

A function which will return the gcd of a sequence of numbers.
sourceraw docstring

cljdoc is a website building & hosting documentation for Clojure/Script libraries

× close