c-calculate.a, and assigns the result to a. Returns the value of a after it was incremented (the value assigned to a).a, and assigns the result to a. Returns the value of a before it was incremented.n. The fractional part of n will be truncated if there is any.n. For example, 6! is equivalent to 6 * 5 * 4 * 3 * 2 * 1.a to the power of b.a and b.a by b.a by b and return the remainder of the result. This is also known as modulus division, or remainder division.a and b.b from a.a to the left b times. For example, 1 << 3 is equal to 2 ^ 3. After shiting by 3 bits, the resulting binary is 1000, equivalent to 8.a to the right b times. Bits at the end of the number will get discarded.a is equal to b.a is not equal to b.a is approximately equal to b. The difference between them must be less than 1 * 10 ^ -6. For complex numbers, this operator will compare the real and imaginary components separately.~== operator.a is greater than b.a is less than b.a is greater than or equal to b.a is less than or equal to b.a and b one by one. If both bits have a value of 1, the corresponding bit in the new number will also be 1.a and b one by one. If either bit has a value of 1, the corresponding bit in the new number will also be 1.a and b are truthy values.a or b are truthy values.b to the symbol a. If a isn't a valid symbol, this operation will throw an error.a ^= b is a shortcut for writing a = a ^ b; writing a += b is a shortcut for a = a + b, etc. If a isn't a valid symbol, this operation will throw an error.exp where the special variable ind represents the current index of the loop. ind will be initially set to start; then it will increment by step until it reaches end, at which point the loop will break and return the value of acc.step is not provided, it will be set to either 1 or -1 depending on the values of start and end.accum_exp is an expression that contains two special variables, cur and acc. cur represents the current value of exp, while acc represents the combined values of all old values of cur. Therefore, you can set accum_exp to, for example, get the sum of a sequence exp bounded by start and end. See the examples below for various ways you can utilize accum_exp.exp. If an error is generated while evaluating exp, error_exp will be returned instead.exp, evaluated from when variable = start to variable = end. Both bounds are inclusive.exp, evaluated from when variable = start to variable = end. Both bounds are inclusive.value for the variable in the given expression. For example, subst(x^2+5x+6, x, 0) substitutes 0 for x in the expression x^2+5x+6, giving 6.sin(angle), cos(angle), and tan(angle) respectively. For example, csc(angle) = 1 / sin(angle).sin(angle), cos(angle), and tan(angle) respectively.csc(angle), sec(angle), and cot(angle) respectively.sinh(value), cosh(value), and tanh(value) respectively. For example, csch(value) = 1 / sinh(value).sinh(value), cosh(value), and tanh(value) respectively.csch(angle), sech(angle), and coth(angle) respectively.circle(0.5) returns half of a full revolution. If the current trigonometric mode is degrees, this function returns value * 360; otherwise, if it is radians, this function returns value * 2 * pi.a * 10 ^ b.e. Returns e ^ x.10 by default.exp(x). Equivalent to the logarithmic function with base e, or log(x, e).a and b, formally the square root of the sum of squares of a and b, that is sqrt(a^2 + b^2).n.n.ith root of n. For example, root(16, 2) is equal to sqrt(16).n raised to the p power. This function is implicitly called when using the alternative syntax: n ^ p.z.z.z.z.nth term of the Fibonacci sequence.x ^ k in the polynomial expansion of the binomial (1 + x) ^ n. This is also the number in row n column k of Pascal's triangle.r elements from a set of n elements.m and standard deviation s, falling in the interval a to b.p, occurs on the nth trial.p, occurs on or before the nth trial.x successes of an event, with success probability p, occurring out of n total trials.x or fewer success of an event, with success probability p, occurring out of n total trials.z.n. This function is implicitly called when using the alternative syntax: n!n using Lanczos's approximation.n.v1 to v2 by a constant t. For example, lerp(0, 10, 0.5) returns the midpoint of 0 and 10.v from v1 to v2.n rounded to d significant digits.n rounded to the nearest s, integer by default.n rounded up to the next s, integer by default.n rounded down to the next s, integer by default.a and b.a and b.a and b.a and b.n, clamped to the given range set by l (left, negative) and r (right, positive)n.n. The fractional part of n will be truncated if there is any.