FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
processing/app/src/processing/app/syntax/PdeKeywords.java at master · orgicus/processing · GitHub
orgicus
processing
Repository navigation
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
processing
/
app
/
src
/
processing
/
app
/
syntax
/
PdeKeywords.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
237 lines (213 loc) · 6.73 KB
Breadcrumbs
processing
/
app
/
src
/
processing
/
app
/
syntax
/
PdeKeywords.java
Copy path
File metadata and controls
237 lines (213 loc) · 6.73 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
/* -*- mode: java; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
PdeKeywords - handles text coloring and links to html reference
Part of the Processing project - http://processing.org
Copyright (c) 2004-12 Ben Fry and Casey Reas
Copyright (c) 2001-04 Massachusetts Institute of Technology
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package
processing
.
app
.
syntax
;
import
javax
.
swing
.
text
.
Segment
;
import
processing
.
app
.
ui
.
Editor
;
public
class
PdeKeywords
extends
TokenMarker
{
protected
KeywordMap
keywordColoring
;
protected
int
lastOffset
;
protected
int
lastKeyword
;
/**
* Add a keyword, and the associated coloring. KEYWORD2 and KEYWORD3
* should only be used with functions (where parens are present).
* This is done for the extra paren handling.
* @param coloring one of KEYWORD1, KEYWORD2, LITERAL1, etc.
*/
public
void
addColoring
(
String
keyword
,
String
coloring
) {
if
(
keywordColoring
==
null
) {
keywordColoring
=
new
KeywordMap
(
false
);
}
// KEYWORD1 -> 0, KEYWORD2 -> 1, etc
int
num
=
coloring
.
charAt
(
coloring
.
length
() -
1
) -
'1'
;
// byte id = (byte) ((isKey ? Token.KEYWORD1 : Token.LITERAL1) + num);
int
id
=
0
;
switch
(
coloring
.
charAt
(
0
)) {
case
'K'
:
id
=
Token
.
KEYWORD1
+
num
;
keywordColoring
.
add
(
keyword
, (
byte
)
id
,
false
);
if
(
id
==
Token
.
KEYWORD6
) {
// these can be followed by parens
keywordColoring
.
add
(
keyword
, (
byte
)
id
,
true
);
}
break
;
case
'L'
:
id
=
Token
.
LITERAL1
+
num
;
keywordColoring
.
add
(
keyword
, (
byte
)
id
,
false
);
break
;
case
'F'
:
id
=
Token
.
FUNCTION1
+
num
;
keywordColoring
.
add
(
keyword
, (
byte
)
id
,
true
);
break
;
}
}
public
byte
markTokensImpl
(
byte
token
,
Segment
line
,
int
lineIndex
) {
char
[]
array
=
line
.
array
;
int
offset
=
line
.
offset
;
lastOffset
=
offset
;
lastKeyword
=
offset
;
int
mlength
=
offset
+
line
.
count
;
boolean
backslash
=
false
;
loop
:
for
(
int
i
=
offset
;
i
<
mlength
;
i
++) {
int
i1
= (
i
+
1
);
char
c
=
array
[
i
];
if
(
c
==
'\\'
) {
backslash
= !
backslash
;
continue
;
}
switch
(
token
) {
case
Token
.
NULL
:
switch
(
c
) {
case
'#'
:
if
(
backslash
)
backslash
=
false
;
break
;
case
'"'
:
doKeyword
(
line
,
i
,
c
);
if
(
backslash
)
backslash
=
false
;
else
{
addToken
(
i
-
lastOffset
,
token
);
token
=
Token
.
LITERAL1
;
lastOffset
=
lastKeyword
=
i
;
}
break
;
case
'\''
:
doKeyword
(
line
,
i
,
c
);
if
(
backslash
)
backslash
=
false
;
else
{
addToken
(
i
-
lastOffset
,
token
);
token
=
Token
.
LITERAL2
;
lastOffset
=
lastKeyword
=
i
;
}
break
;
case
':'
:
if
(
lastKeyword
==
offset
) {
if
(
doKeyword
(
line
,
i
,
c
))
break
;
backslash
=
false
;
addToken
(
i1
-
lastOffset
,
Token
.
LABEL
);
lastOffset
=
lastKeyword
=
i1
;
}
else
if
(
doKeyword
(
line
,
i
,
c
))
break
;
break
;
case
'/'
:
backslash
=
false
;
doKeyword
(
line
,
i
,
c
);
if
(
mlength
-
i
>
1
) {
switch
(
array
[
i1
]) {
case
'*'
:
addToken
(
i
-
lastOffset
,
token
);
lastOffset
=
lastKeyword
=
i
;
if
(
mlength
-
i
>
2
&&
array
[
i
+
2
] ==
'*'
)
token
=
Token
.
COMMENT2
;
else
token
=
Token
.
COMMENT1
;
break
;
case
'/'
:
addToken
(
i
-
lastOffset
,
token
);
addToken
(
mlength
-
i
,
Token
.
COMMENT1
);
lastOffset
=
lastKeyword
=
mlength
;
break
loop
;
}
// https://github.com/processing/processing/issues/1681
if
(
array
[
i1
] !=
' '
) {
i
++;
// http://processing.org/bugs/bugzilla/609.html [jdf]
}
}
break
;
default
:
backslash
=
false
;
if
(!
Character
.
isLetterOrDigit
(
c
) &&
c
!=
'_'
) {
doKeyword
(
line
,
i
,
c
);
}
break
;
}
break
;
case
Token
.
COMMENT1
:
case
Token
.
COMMENT2
:
backslash
=
false
;
if
(
c
==
'*'
&&
mlength
-
i
>
1
) {
if
(
array
[
i1
] ==
'/'
) {
i
++;
addToken
((
i
+
1
) -
lastOffset
,
token
);
token
=
Token
.
NULL
;
lastOffset
=
lastKeyword
=
i
+
1
;
}
}
break
;
case
Token
.
LITERAL1
:
if
(
backslash
)
backslash
=
false
;
else
if
(
c
==
'"'
) {
addToken
(
i1
-
lastOffset
,
token
);
token
=
Token
.
NULL
;
lastOffset
=
lastKeyword
=
i1
;
}
break
;
case
Token
.
LITERAL2
:
if
(
backslash
)
backslash
=
false
;
else
if
(
c
==
'\''
) {
addToken
(
i1
-
lastOffset
,
Token
.
LITERAL1
);
token
=
Token
.
NULL
;
lastOffset
=
lastKeyword
=
i1
;
}
break
;
default
:
throw
new
InternalError
(
"Invalid state: "
+
token
);
}
}
if
(
token
==
Token
.
NULL
) {
doKeyword
(
line
,
mlength
,
'\0'
);
}
switch
(
token
) {
case
Token
.
LITERAL1
:
case
Token
.
LITERAL2
:
addToken
(
mlength
-
lastOffset
,
Token
.
INVALID
);
token
=
Token
.
NULL
;
break
;
case
Token
.
KEYWORD2
:
addToken
(
mlength
-
lastOffset
,
token
);
if
(!
backslash
)
token
=
Token
.
NULL
;
addToken
(
mlength
-
lastOffset
,
token
);
break
;
default
:
addToken
(
mlength
-
lastOffset
,
token
);
break
;
}
return
token
;
}
protected
boolean
doKeyword
(
Segment
line
,
int
i
,
char
c
) {
int
i1
=
i
+
1
;
int
len
=
i
-
lastKeyword
;
boolean
paren
=
Editor
.
checkParen
(
line
.
array
,
i
,
line
.
array
.
length
);
byte
id
=
keywordColoring
.
lookup
(
line
,
lastKeyword
,
len
,
paren
);
if
(
id
!=
Token
.
NULL
) {
if
(
lastKeyword
!=
lastOffset
) {
addToken
(
lastKeyword
-
lastOffset
,
Token
.
NULL
);
}
addToken
(
len
,
id
);
lastOffset
=
i
;
}
lastKeyword
=
i1
;
return
false
;
}
}
Back
|
FazBrowse Home
|
New Git URL