Methods
| Modifier and Type |
Method and Description |
BitvectorFormula |
add(BitvectorFormula number1,
BitvectorFormula number2) |
BitvectorFormula |
and(BitvectorFormula bits1,
BitvectorFormula bits2)
Creates a formula representing an AND of the two arguments.
|
BitvectorFormula |
concat(BitvectorFormula number,
BitvectorFormula append) |
BitvectorFormula |
divide(BitvectorFormula number1,
BitvectorFormula number2,
boolean signed) |
BooleanFormula |
equal(BitvectorFormula number1,
BitvectorFormula number2) |
BitvectorFormula |
extend(BitvectorFormula number,
int extensionBits,
boolean signed)
Extend a bitvector to the left (add most significant bits).
|
BitvectorFormula |
extract(BitvectorFormula number,
int msb,
int lsb,
boolean signed) |
int |
getLength(BitvectorFormula number) |
BooleanFormula |
greaterOrEquals(BitvectorFormula number1,
BitvectorFormula number2,
boolean signed) |
BooleanFormula |
greaterThan(BitvectorFormula number1,
BitvectorFormula number2,
boolean signed) |
BooleanFormula |
lessOrEquals(BitvectorFormula number1,
BitvectorFormula number2,
boolean signed) |
BooleanFormula |
lessThan(BitvectorFormula number1,
BitvectorFormula number2,
boolean signed) |
BitvectorFormula |
makeBitvector(int length,
BigInteger pI) |
BitvectorFormula |
makeBitvector(int length,
long pI) |
BitvectorFormula |
makeVariable(FormulaType.BitvectorType type,
String pVar) |
BitvectorFormula |
makeVariable(int length,
String pVar) |
BooleanFormula |
modularCongruence(BitvectorFormula pNumber1,
BitvectorFormula pNumber2,
long pModulo) |
BitvectorFormula |
modulo(BitvectorFormula number1,
BitvectorFormula number2,
boolean signed) |
BitvectorFormula |
multiply(BitvectorFormula number1,
BitvectorFormula number2) |
BitvectorFormula |
negate(BitvectorFormula number) |
BitvectorFormula |
not(BitvectorFormula bits)
Creates a formula representing a negation of the argument.
|
BitvectorFormula |
or(BitvectorFormula bits1,
BitvectorFormula bits2)
Creates a formula representing an OR of the two arguments.
|
BitvectorFormula |
shiftLeft(BitvectorFormula number,
BitvectorFormula toShift) |
BitvectorFormula |
shiftRight(BitvectorFormula number,
BitvectorFormula toShift,
boolean signed)
Return a term representing the (arithmetic if signed is true) right shift of number by toShift.
|
BitvectorFormula |
subtract(BitvectorFormula number1,
BitvectorFormula number2) |
BitvectorFormula |
xor(BitvectorFormula bits1,
BitvectorFormula bits2) |