Functions

Functions process one or more input values and produce an output value. Click on a function to read more about it.

xm
logbx
distance AB
m∠ABC
AB || CD
slope of line AB
area of △ABC
area of quadrilateral ABCD
area of pentagon ABCDE
area of hexagon ABCDEF
line AB intersects line CD
line AB intersects line CD at point E
∠ABC and ∠DEF are supplementary
∠ABC is a right angle
AB ⊥ CD
ABCD is a parallelogram
△ABC is a triangle
△ABC is a right triangle
△ABC is an isosceles triangle
∠ABC is an acute angle
ray BD bisects ∠ABC
△ABC ≅ △XYZ
segment AB ≅ segment XY
△ABC is an acute triangle
M is the midpoint of line AB
the x coordinate of point A
the y coordinate of point A
∠ABC and ∠DEF are complementary
ABCD is a square
ABCD is a rectangle
ABCD is a rhombus
△ABC is an equilateral triangle
quadrilateral ABCD is an isosceles trapezoid
quadrilateral ABCD is a trapezoid
△ABC ∼ △DEF
sum of bit a bit b and bit c
carry on sum of bit a bit b and c
sum of a b and carry bit c
sum of unsigned integers a and b
decrement a by 1
empty list
list x and xs
x multiplied by y
compare bit x and bit y
compare bit stack x and bit stack y
compare numbers x and y
minimum value of stack x
index of the mininum value in stack x
maximum value in stack x
index of the maximum value in stack x
result of sorting x
result of sorting x with sorted stack y
the element at index i of stack x
result of storing value at index idx of stack x
set index idx of remaining stack x to value with visited : parsed
remaining elements after x is popped at index i
remaining elements after x is popped at index i and visited stack is result
popped value from stack x at index i
stack after popping a value from stack x at index i
stack after popping a value from stack x at index i in traversed elements: result
length of stack x
length of remaining stack x with count count
stack x contains value
x is less than y
x is greater than y
index of value n in x
index of value n in x with current index i
index of value n in x
output of the index_compute function where the input stack is s, value is n, and index is i
index of value n in x
index of value n in x with current index i
x = y
x ≠ y
bit x minus bit y
reverse of x
reverse of remaining stack x and already reversed stack r
result of dumping y to x
reverse and insert y to the beginning of x
result of appending y to xs
point X lies in interior of ∠ABC
point X is in segment AB
points A B and C are collinear
quadrilateral ABCD is convex
tangent of x
sine of x
cosine of x
square root of x
divide x by y
remainder of x divided by y
x in bits
join lists x and y
f(x)
derivative of x
limit of f as x approaches c
x squared
instruction #i is add dst=dst src1=src1 src2=src2
an add instruction with dst: dst src1: src1 and src2: src2
instruction #i is beq left=left right=right imm=imm
a BEQ instruction that compares left and right with immediate imm
instruction #i is jump imm=imm
Pages: 1 2 ... 3