Package avail.interpreter.primitive.integers

Primitive: Given any integer B, and a shift factor S, compute ⌊B×2^S⌋. This is the left-shift operation, but when S is negative it acts as a right-shift.

Primitive: Given any integer B, and a shift factor S, compute ⌊B÷2^S⌋. This is the right-shift operation, but when S is negative it acts as a left-shift.

Primitive: Given a positive integer B, a shift factor S, and a truncation bit count T, shift B to the left by S bits (treating a negative factor as a right shift), then truncate the result to the bottom T bits by zeroing the rest.

Primitive: Given an integer and a whole number, use the whole number to index a bit from the integer's 2's complement representation, and return it as a boolean.

Primitive: Compute the bitwise AND of the arguments.

Primitive: Compute the bitwise OR of the arguments.

Primitive: Compute the bitwise EXCLUSIVE OR of the arguments.

Primitive: Answer the integer range constrained by the specified upper and lower bounds. The provided booleans indicate whether their corresponding bounds are inclusive (true) or exclusive (false).

Primitive: Answer the lower bound. The client can ask the integer range if it includes the answer to determine whether it is inclusive or exclusive.

Primitive: Answer the upper bound. The client can ask the integer range if it includes the answer to determine whether it is inclusive or exclusive.