Deprecated
As of release 5.1.0, replaced by Mod10Check and Mod11Check
Allows to validate that a series of digits pass the mod 10 or mod 11 checksum algorithm.
The supported type is CharSequence. null is considered valid.
| Modifier and Type | Class and Description |
|---|---|
| public static @interface | ModCheck.List
Defines several |
| public static enum |
| Modifier and Type | Method and Description |
|---|---|
| public int | Returns: The position of the check digit in input. Per default it is assumes that the check digit is part of the specified range. If set, the digit at the specified position is used as check digit. If set it the following holds true:checkDigitPosition > 0 && (checkDigitPosition < startIndex || checkDigitPosition >= endIndex.
|
| public int | Returns: the end index (exclusive) for calculating the checksum. If not specified the whole value is considered
|
| public Class | |
| public boolean | Returns: Returnstrue if non digit characters should be ignored, false if a non digit character
results in a validation error. startIndex and endIndex are always only referring to digit
characters.
|
| public String | |
| public ModCheck. | |
| public int | |
| public Class | |
| public int | Returns: the start index (inclusive) for calculating the checksum. If not specified 0 is assumed.
|
| checkDigitPosition | back to summary |
|---|---|
public int checkDigitPosition()
| |
| endIndex | back to summary |
|---|---|
public int endIndex()
| |
| groups | back to summary |
|---|---|
| public Class | |
| ignoreNonDigitCharacters | back to summary |
|---|---|
public boolean ignoreNonDigitCharacters()
| |
| message | back to summary |
|---|---|
| public String message() | |
| modType | back to summary |
|---|---|
| public ModCheck. | |
| multiplier | back to summary |
|---|---|
public int multiplier()
| |
| payload | back to summary |
|---|---|
| public Class | |
| startIndex | back to summary |
|---|---|
public int startIndex()
| |
@ModCheck annotations on the same element.
| Modifier and Type | Method and Description |
|---|---|
| public ModCheck[] |
| value | back to summary |
|---|---|
| public ModCheck[] value()
Deprecated as a consequence of | |
| Modifier and Type | Field and Description |
|---|---|
| public static final ModCheck. | MOD10
Represents a MOD10 algorithm (Also known as Luhn algorithm) |
| public static final ModCheck. | MOD11
Represents a MOD11 algorithm. |
| Access | Constructor and Description |
|---|---|
| private |
| Modifier and Type | Method and Description |
|---|---|
| public static ModCheck. | |
| public static ModCheck. |
| MOD10 | back to summary |
|---|---|
| public static final ModCheck. Represents a MOD10 algorithm (Also known as Luhn algorithm) | |
| MOD11 | back to summary |
|---|---|
| public static final ModCheck. Represents a MOD11 algorithm. A remainder of 10 or 11 in the algorithm is mapped to the check digit 0. | |
| ModType | back to summary |
|---|---|
| private ModType() | |
| valueOf | back to summary |
|---|---|
| public static ModCheck. | |
| values | back to summary |
|---|---|
| public static ModCheck. | |