 |
lingua-franca 0.10.1
Lingua Franca code generator
|
|
lingua-franca 0.10.1
Lingua Franca code generator
|
Representation of a permuted mixed radix (PMR) integer. More...
Public Member Functions | |
| MixedRadixInt | copy () |
| boolean | equals (Object obj) |
| int | get () |
| Get the value as an integer. | |
| int | get (int n) |
| Get the value as an integer after dropping the first n digits. | |
| List< Integer > | getDigits () |
| Return the digits. | |
| List< Integer > | getPermutation () |
| Return the permutation list. | |
| List< Integer > | getRadixes () |
| Return the radixes. | |
| int | hashCode () |
| void | increment () |
| Increment the number by one, using the permutation vector to determine the order in which the digits are incremented. | |
| int | magnitude () |
Return the magnitude of this PMR, which is defined to be the number of times that increment() would need to invoked starting with zero before the value returned by get() would be reached. | |
| MixedRadixInt (List< Integer > digits, List< Integer > radixes, List< Integer > permutation) | |
| Create a mixed radix number with the specified digits and radixes, which are given low-order digits first. | |
| int | numDigits () |
| Return the number of digits in this mixed radix number. | |
| void | set (int v) |
| Set the value of this number to equal that of the specified integer. | |
| void | setMagnitude (int v) |
Set the magnitude of this number to equal that of the specified integer, which is the number of times that increment must be invoked from zero for the value returned by get() to equal v. | |
| String | toString () |
| Give a string representation of the number, where each digit is represented as nr, where r is the radix. | |
Static Public Attributes | |
| static final MixedRadixInt | ZERO = new MixedRadixInt(null, List.of(1), null) |
| A zero-valued mixed radix number with just one digit will radix 1. | |
Representation of a permuted mixed radix (PMR) integer.
A mixed radix number is a number representation where each digit can have a distinct radix. The radixes are given by a list of numbers, r0, r1, ... , rn, where r0 is the radix of the lowest-order digit and rn is the radix of the highest order digit that has a specified radix.
A PMR is a mixed radix number that, when incremented, increments the digits in the order given by the permutation matrix. For an ordinary mixed radix number, the permutation matrix is [0, 1, ..., n-1]. The permutation matrix may be any permutation of these digits, [d0, d1, ..., dn-1], in which case, when incremented, the d0 digit will be incremented first. If it overflows, it will be set to 0 and the d1 digit will be incremented. If it overflows, the next digit is incremented. If the last digit overflows, then the number wraps around so that all digits become zero.
This implementation realizes a finite set of numbers, where incrementing past the end of the range wraps around to the beginning. As a consequence, the increment() function from any starting point is guaranteed to eventually cover all possible values.
The toString() method gives a string representation of the number where each digit is represented by the string "d%r", where d is the digit and r is the radix. For example, the number "1%2, 2%3, 1%4" has value 11, 1 + (2*2) + (1*2*3).
| org.lflang.generator.MixedRadixInt.MixedRadixInt | ( | List< Integer > | digits, |
| List< Integer > | radixes, | ||
| List< Integer > | permutation ) |
Create a mixed radix number with the specified digits and radixes, which are given low-order digits first.
If there is one more digit than radixes, throw an exception.
| digits | The digits, or null to get a zero-valued number. |
| radixes | The radixes. |
| permutation | The permutation matrix, or null for the default permutation. |
| MixedRadixInt org.lflang.generator.MixedRadixInt.copy | ( | ) |
| boolean org.lflang.generator.MixedRadixInt.equals | ( | Object | obj | ) |
| int org.lflang.generator.MixedRadixInt.get | ( | ) |
Get the value as an integer.
| int org.lflang.generator.MixedRadixInt.get | ( | int | n | ) |
Get the value as an integer after dropping the first n digits.
| n | The number of digits to drop. |
| List< Integer > org.lflang.generator.MixedRadixInt.getDigits | ( | ) |
Return the digits.
This is assured of returning as many digits as there are radixes.
| List< Integer > org.lflang.generator.MixedRadixInt.getPermutation | ( | ) |
Return the permutation list.
| List< Integer > org.lflang.generator.MixedRadixInt.getRadixes | ( | ) |
Return the radixes.
| int org.lflang.generator.MixedRadixInt.hashCode | ( | ) |
| void org.lflang.generator.MixedRadixInt.increment | ( | ) |
Increment the number by one, using the permutation vector to determine the order in which the digits are incremented.
If an overflow occurs, then a radix-infinity digit will be added to the digits array if there isn't one there already.
| int org.lflang.generator.MixedRadixInt.magnitude | ( | ) |
Return the magnitude of this PMR, which is defined to be the number of times that increment() would need to invoked starting with zero before the value returned by get() would be reached.
| int org.lflang.generator.MixedRadixInt.numDigits | ( | ) |
Return the number of digits in this mixed radix number.
This is the size of the radixes list.
| void org.lflang.generator.MixedRadixInt.set | ( | int | v | ) |
Set the value of this number to equal that of the specified integer.
| v | The ordinary integer value of this number. |
| void org.lflang.generator.MixedRadixInt.setMagnitude | ( | int | v | ) |
Set the magnitude of this number to equal that of the specified integer, which is the number of times that increment must be invoked from zero for the value returned by get() to equal v.
| v | The new magnitude of this number. |
| String org.lflang.generator.MixedRadixInt.toString | ( | ) |
Give a string representation of the number, where each digit is represented as nr, where r is the radix.
|
static |
A zero-valued mixed radix number with just one digit will radix 1.
1.15.0