1
2
3
4
5
6
7
8
9
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
/*
* Permission is hereby granted, free of charge, to any person obtaining a copy of
* this software and associated documentation files (the "Software"), to deal in
* the Software without restriction, including without limitation the rights to
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
* of the Software, and to permit persons to whom the Software is furnished to do
* so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package jdk.nashorn.internal.runtime.regexp.joni;
import jdk.nashorn.internal.runtime.regexp.joni.constants.TokenType;
final class Token {
TokenType type;
boolean escaped;
int backP;
// union fields
private int INT1, INT2, INT3, INT4;
// union accessors
int getC() {
return INT1;
}
void setC(int c) {
INT1 = c;
}
int getCode() {
return INT1;
}
void setCode(int code) {
INT1 = code;
}
int getAnchor() {
return INT1;
}
void setAnchor(int anchor) {
INT1 = anchor;
}
// repeat union member
int getRepeatLower() {
return INT1;
}
void setRepeatLower(int lower) {
INT1 = lower;
}
int getRepeatUpper() {
return INT2;
}
void setRepeatUpper(int upper) {
INT2 = upper;
}
boolean getRepeatGreedy() {
return INT3 != 0;
}
void setRepeatGreedy(boolean greedy) {
INT3 = greedy ? 1 : 0;
}
boolean getRepeatPossessive() {
return INT4 != 0;
}
void setRepeatPossessive(boolean possessive) {
INT4 = possessive ? 1 : 0;
}
int getBackrefRef() {
return INT2;
}
void setBackrefRef(int ref1) {
INT2 = ref1;
}
// prop union member
int getPropCType() {
return INT1;
}
void setPropCType(int ctype) {
INT1 = ctype;
}
boolean getPropNot() {
return INT2 != 0;
}
void setPropNot(boolean not) {
INT2 = not ? 1 : 0;
}
}
|
