Function Index
$#! · 0-9 · A · B · C · D · E · F · G · H · I · J · K · L · M · N · O · P · Q · R · S · T · U · V · W · X · Y · Z
$#!
 )
SchemeNumber.fn.gcd(nSchemeNumber.fn.lcm(nSchemeNumber.fn.max(x,xSchemeNumber.fn.min(x,xSchemeNumber.fn[">"](x,x,xSchemeNumber.fn[">="](x,x,xSchemeNumber.fn["<"](x,x,xSchemeNumber.fn["<="](x,x,xSchemeNumber.fn["*"](zSchemeNumber.fn["+"](zSchemeNumber.fn["-"](z1,z2SchemeNumber.fn["/"](z1,z2SchemeNumber.fn["="](z,z,z
A
 abs, BigInteger
 abs(x), SchemeNumber.fn
 acos(z), SchemeNumber.fn
 add, BigInteger
 angle(z), SchemeNumber.fn
 asin(z), SchemeNumber.fn
 atan(y,x), SchemeNumber.fn
 atan(z), SchemeNumber.fn
B
 BigInteger, BigInteger
C
 ceiling(x), SchemeNumber.fn
 compare, BigInteger
 compareAbs, BigInteger
 cos(z), SchemeNumber.fn
D
 denominator(q), SchemeNumber.fn
 div(x,y), SchemeNumber.fn
 div0(x,y), SchemeNumber.fn
 divide, BigInteger
 divRem, BigInteger
E
 epilog_js
 exact(z), SchemeNumber.fn
 exp(z), SchemeNumber.fn
 exp10, BigInteger
 expt(z1,z2), SchemeNumber.fn
F
 floor(x), SchemeNumber.fn
 fn["-"](z), SchemeNumber
 fn["/"](z), SchemeNumber
 fn["complex?"](obj), SchemeNumber
 fn["div-and-mod"](x,y), SchemeNumber
 fn["div0-and-mod0"](x,y), SchemeNumber
 fn["eqv?"](obj1,obj2), SchemeNumber
 fn["even?"](n), SchemeNumber
 fn["exact-integer-sqrt"](k), SchemeNumber
 fn["exact?"](z), SchemeNumber
 fn["finite?"](x), SchemeNumber
 fn["imag-part"](z), SchemeNumber
 fn["inexact?"](z), SchemeNumber
 fn["infinite?"](x), SchemeNumber
 fn["integer-valued?"](obj), SchemeNumber
 fn["integer?"](obj), SchemeNumber
 fn["make-polar"](r,theta), SchemeNumber
 fn["make-rectangular"](x,y), SchemeNumber
 fn["nan?"](x), SchemeNumber
 fn["negative?"](x), SchemeNumber
 fn["number?"](obj), SchemeNumber
 fn["odd?"](n), SchemeNumber
 fn["positive?"](x), SchemeNumber
 fn["rational-valued?"](obj), SchemeNumber
 fn["rational?"](obj), SchemeNumber
 fn["real-part"](z), SchemeNumber
 fn["real-valued?"](obj), SchemeNumber
 fn["real?"](obj), SchemeNumber
 fn["zero?"](z), SchemeNumber
G
 gen
 gen_all
 gen_js
 gen_scheme
I
 inexact(z), SchemeNumber.fn
 isEven, BigInteger
 isNegative, BigInteger
 isOdd, BigInteger
 isPositive, BigInteger
 isUnit, BigInteger
 isZero, BigInteger
L
 log, BigInteger
 log(z), SchemeNumber.fn
 log(z1,z2), SchemeNumber.fn
M
 magnitude(z), SchemeNumber.fn
 mod(x,y), SchemeNumber.fn
 mod0(x,y), SchemeNumber.fn
 modPow, BigInteger
 multiply, BigInteger
N
 negate, BigInteger
 next, BigInteger
 number”](string), SchemeNumber.fn[“string
 number”](string,radix), SchemeNumber.fn[“string
 numerator(q), SchemeNumber.fn
P
 parse, BigInteger
 pow, BigInteger
 prev, BigInteger
 prolog_js
 prolog_scheme
Q
 quotient, BigInteger
R
 rationalize(x,y), SchemeNumber.fn
 remainder, BigInteger
 round(x), SchemeNumber.fn
Returns the arguments’ greatest common non-negative divisor.
Returns the arguments’ least common positive multiple.
Returns the greatest argument.
Returns the least argument.
Returns true if arguments decrease monotonically.
Returns true if arguments are monotonically nonincreasing.
Returns true if arguments increase monotonically.
Returns true if arguments are monotonically nondecreasing.
Returns the product of the arguments.
Returns the sum of the arguments.
Returns z1 minus the sum of the number(s) z2.
Returns z1 divided by the product of the number(s) z2.
Returns true if all arguments are mathematically equal, though perhaps differing in exactness.
BigInteger.prototype.abs = function()
Get the absolute value of a BigInteger.
Returns the absolute value of x.
Returns a number whose cosine is z.
BigInteger.prototype.add = function(n)
Add two BigIntegers.
Returns fn.atan2(y,x) where z = x + iy.
Returns a number whose sine is z.
Returns the angle that passes through (x,y).
Returns a number whose tangent is z.
function BigInteger(n,
s)
Convert a value to a BigInteger.
Returns the least integer not less than x.
BigInteger.prototype.compare = function(n)
Compare two BigIntegers.
BigInteger.prototype.compareAbs = function(n)
Compare the absolute value of two BigIntegers.
Returns the cosine of z.
Returns the smallest positive integer which when multiplied by q yields an integer.
Returns the greatest integer less than or equal to x / y.
Returns the integer nearest x / y, ties go lower.
Deprecated synonym for quotient.
BigInteger.prototype.divRem = function(n)
Calculate the integer quotient and remainder of two BigIntegers.
sub epilog_js
Returns an exact number equal to z.
Returns e to the z.
BigInteger.prototype.exp10 = function(n)
Multiply a BigInteger by a power of 10.
Returns z1 to the power z2.
Returns the greatest integer not greater than x.
Returns the negation of z (-z).
Returns the reciprocal of z (1 / z).
Returns true if obj is a Scheme complex number.
Returns fn.div(x, y) and fn.mod(x, y).
Returns fn.div0(x, y) and fn.mod0(x, y).
Returns true if obj1 === obj2 or both arguments are Scheme numbers and behave identically.
Returns true if n is even.
Returns maximal exact s and non-negative r such that s*s + r = k.
Returns true if z is exact.
Returns true if x is finite.
Returns y such that z = x + iy.
Returns true if z is inexact.
Returns true if x is plus or minus infinity.
Returns true if obj is real-valued and fn[“real-part”](obj) is an integer.
Returns true if obj is a Scheme integer.
Returns the complex number with magnitude r and angle theta.
Returns the complex number x + iy.
Returns true if x is a NaN.
Returns true if x is negative.
Returns true if obj is a Scheme number.
Returns true if n is odd.
Returns true if x is positive.
Returns true if obj is real-valued and fn[“real-part”](obj) is rational.
Returns true if obj is a Scheme rational number.
Returns x such that z = x + iy.
Returns true if obj is a Scheme complex number and fn[“imag-part”](obj) is zero.
Returns true if obj is a Scheme real number.
Returns true if z equals zero.
sub gen
sub gen_all
sub gen_js
sub gen_scheme
Returns an inexact number equal to z.
BigInteger.prototype.isEven = function()
Return true iff this is divisible by two.
BigInteger.prototype.isNegative = function()
Return true iff this < 0.
BigInteger.prototype.isOdd = function()
Return true iff this is not divisible by two.
BigInteger.prototype.isPositive = function()
Return true iff this > 0.
BigInteger.prototype.isUnit = function()
Return true iff this is either 1 or -1.
BigInteger.prototype.isZero = function()
Return true iff this == 0.
BigInteger.prototype.log = function()
Get the natural logarithm of a BigInteger as a native JavaScript number.
Returns the natural logarithm of z.
Returns the base-z2 logarithm of z1.
Returns the magnitude of z.
Returns x - (y * fn.div(x, y)).
Returns x - (y * fn.div0(x, y)).
BigInteger.prototype.modPow = function(exponent,
modulus)
Raise a BigInteger to a power (mod m).
BigInteger.prototype.multiply = function(n)
Multiply two BigIntegers.
BigInteger.prototype.negate = function()
Get the additive inverse of a BigInteger.
BigInteger.prototype.next = function()
Get the next BigInteger (add one).
Parses string as a Scheme number.
Parses string as a Scheme number using radix as default radix.
Returns q * fn.denominator(q).
BigInteger.parse = function(s,
base)
Parse a string into a BigInteger.
BigInteger.prototype.pow = function(n)
Raise a BigInteger to a power.
BigInteger.prototype.prev = function()
Get the previous BigInteger (subtract one).
sub prolog_js
sub prolog_scheme
BigInteger.prototype.quotient = function(n)
Divide two BigIntegers and truncate towards zero.
Returns the simplest fraction within y of x.
BigInteger.prototype.remainder = function(n)
Calculate the remainder of two BigIntegers.
Returns the closest integer to x, ties go even.
Close