- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
private int checkTerm(PatternTerm term, int arr[],
int symbNum, boolean isEditing) {
if (term.count != INFINITY) {
int endIdx = Math.min(symbNum + term.count, arr.length);
int count = 0;
switch(term.termType) {
case DIGIT: {
for(int i = symbNum; i < endIdx; i++) {
if (!Character.isDigit((char)arr[i]))
return -1;
count++;
}
break;
}
case LETTER: {
for(int i = symbNum; i < endIdx; i++) {
if (!Character.isLetter((char)arr[i]))
return -1;
count++;
}
break;
}
case LETTERORDIGIT: {
for(int i = symbNum; i < endIdx; i++) {
if (!Character.isLetterOrDigit((char)arr[i]))
return -1;
count++;
}
break;
}
case CHARACTER: {
for(int i = symbNum; i < endIdx; i++) {
if (arr[i] != term.value)
return -1;
count++;
}
break;
}
}
if (!isEditing && count != term.count)
return -1;
symbNum+=term.count;
} else {
int i = 0;
switch(term.termType) {
case DIGIT: {
while (((symbNum + i) < arr.length) &&
Character.isDigit((char)arr[symbNum + i])) i++;
break;
}
case LETTER: {
while (((symbNum + i) < arr.length) &&
Character.isLetter((char)arr[symbNum + i])) i++;
break;
}
case LETTERORDIGIT: {
while (((symbNum + i) < arr.length) &&
Character.isLetterOrDigit((char)arr[symbNum + i])) i++;
break;
}
case CHARACTER: {
while (((symbNum + i) < arr.length) &&
(arr[symbNum + i] == term.value)) i++;
break;
}
}
symbNum+=i;
}
return symbNum;
}
Follow us!