- 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
- 72
- 73
- 74
- 75
- 76
- 77
- 78
static final class Single extends Node {
Node dup(boolean not) {
if (not)
return new NotSingle(ch);
else
return new Single(ch);
}
boolean study(TreeInfo info) {
info.minLength++;
info.maxLength++;
return next.study(info);
}
static final class NotSingle extends Node {
Node dup(boolean not) {
if (not)
return new Single(ch);
else
return new NotSingle(ch);
}
boolean study(TreeInfo info) {
info.minLength++;
info.maxLength++;
return next.study(info);
}
}
static final class SingleA extends Node {
Node dup(boolean not) {
if (not)
return new NotSingleA(ch);
else
return new SingleA(ch);
}
boolean study(TreeInfo info) {
info.minLength++;
info.maxLength++;
return next.study(info);
}
}
static final class NotSingleA extends Node {
int ch;
NotSingleA(int n) {
ch = ASCII.toLower(n);
}
Node dup(boolean not) {
if (not)
return new SingleA(ch);
else
return new NotSingleA(ch);
}
boolean study(TreeInfo info) {
info.minLength++;
info.maxLength++;
return next.study(info);
}
}
static final class Ctype extends Node
Node dup(boolean not) {
if (not) {
return new NotCtype(ctype);
} else {
return new Ctype(ctype);
}
}
boolean study(TreeInfo info) {
info.minLength++;
info.maxLength++;
return next.study(info);
}
}
далее идут
static final class SingleU extends Node {
static final class NotCtype extends Node {
static final class NotSingleU extends Node {
c очевидно какими методами внутри
Follow us!