cross,to,out,unsafe
cross
cross
(2.70e-01)
mul
(2.22e-01)
pick
(1.07e-01)
out
(5.63e-02)
assert
(4.82e-02)
dst
(4.22e-02)
dot
(3.34e-02)
solve
(2.77e-02)
to
(1.44e-02)
write
(1.33e-02)
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
to
%END%
(3.66e-01)
out
(1.37e-01)
to
(8.43e-02)
pick
(5.87e-02)
unsafe
(5.23e-02)
cross
(4.67e-02)
mul
(3.82e-02)
trans
(1.94e-02)
%UNK%
(1.71e-02)
solve
(1.51e-02)
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
out
%END%
(4.21e-01)
out
(1.20e-01)
to
(7.92e-02)
pick
(5.07e-02)
unsafe
(4.90e-02)
cross
(3.93e-02)
mul
(3.41e-02)
trans
(1.86e-02)
%UNK%
(1.69e-02)
solve
(1.46e-02)
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
unsafe
%END%
(7.72e-01)
out
(4.67e-02)
unsafe
(3.33e-02)
to
(3.22e-02)
pick
(1.05e-02)
trans
(8.90e-03)
cross
(6.25e-03)
%UNK%
(5.68e-03)
x
(4.17e-03)
mul
(4.08e-03)
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
%END%
%END%
(8.62e-01)
out
(2.17e-02)
unsafe
(1.97e-02)
to
(1.61e-02)
x
(6.45e-03)
trans
(4.22e-03)
z
(3.87e-03)
pick
(3.63e-03)
y
(3.53e-03)
assert
(2.85e-03)
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
out
!=
b
)
;
assert
(
out
!=
a
)
;
out
.
x
=
a
.
y
*
b
.
z
-
a
.
z
*
b
.
y
;
out
.
y
=
a
.
z
*
b
.
x
-
a
.
x
*
b
.
z
;
out
.
z
=
a
.
x
*
b
.
y
-
a
.
y
*
b
.
x
;
}
<SENTENCE_END/>
generate
generate
%END%
(2.32e-01)
%UNK%
(1.36e-01)
main
(6.43e-02)
parse
(3.20e-02)
load
(3.16e-02)
create
(2.51e-02)
setup
(1.74e-02)
initialize
(1.30e-02)
init
(1.26e-02)
convert
(1.25e-02)
<SENTENCE_START>
{
if
(
target
.
os
!=
target
os
.
android
)
throw
new
illegal
argument
exception
(
"target os must be Android"
)
;
if
(
!
config
.
libs
dir
.
exists
(
)
)
{
if
(
!
config
.
libs
dir
.
mkdirs
(
)
)
throw
new
runtime
exception
(
"Couldn't create directory for shared library files in '"
+
config
.
libs
dir
+
"'"
)
;
}
if
(
!
config
.
jni
dir
.
exists
(
)
)
{
if
(
!
config
.
jni
dir
.
mkdirs
(
)
)
throw
new
runtime
exception
(
"Couldn't create native code directory '"
+
config
.
jni
dir
+
"'"
)
;
}
array
list
<
file
descriptor
>
files
=
new
array
list
<
file
descriptor
>
(
)
;
int
idx
=
0
;
string
[
]
includes
=
new
string
[
target
.
c
includes
.
length
+
target
.
cpp
includes
.
length
]
;
for
(
string
include
:
target
.
c
includes
)
includes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
include
;
for
(
string
include
:
target
.
cpp
includes
)
includes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
include
;
idx
=
0
;
string
[
]
excludes
=
new
string
[
target
.
c
excludes
.
length
+
target
.
cpp
excludes
.
length
+
1
]
;
for
(
string
exclude
:
target
.
c
excludes
)
excludes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
exclude
;
for
(
string
exclude
:
target
.
cpp
excludes
)
excludes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
exclude
;
excludes
[
idx
]
=
"**/target/*"
;
gather
source
files
(
config
.
jni
dir
,
includes
,
excludes
,
files
)
;
file
descriptor
application
=
config
.
jni
dir
.
child
(
"Application.mk"
)
;
application
.
write
string
(
new
file
descriptor
(
"com/badlogic/gdx/jnigen/resources/scripts/Application.mk.template"
,
file
type
.
classpath
)
.
read
string
(
)
,
false
)
;
string
template
=
new
file
descriptor
(
"com/badlogic/gdx/jnigen/resources/scripts/Android.mk.template"
,
file
type
.
classpath
)
.
read
string
(
)
;
string
buffer
src
files
=
new
string
buffer
(
)
;
for
(
int
i
=
0
;
i
<
files
.
size
(
)
;
i
++
)
{
if
(
i
>
0
)
src
files
.
append
(
" "
)
;
src
files
.
append
(
files
.
get
(
i
)
.
path
(
)
.
replace
(
'|'
,
'/'
)
.
replace
(
config
.
jni
dir
.
to
string
(
)
+
"/"
,
""
)
)
;
if
(
i
<
files
.
size
(
)
-
1
)
src
files
.
append
(
"| "
)
;
else
src
files
.
append
(
" "
)
;
}
string
buffer
header
dirs
=
new
string
buffer
(
)
;
for
(
string
header
dir
:
target
.
header
dirs
)
{
header
dirs
.
append
(
header
dir
)
;
header
dirs
.
append
(
" "
)
;
}
template
=
template
.
replace
(
"%sharedLibName%"
,
config
.
shared
lib
name
)
;
template
=
template
.
replace
(
"%headerDirs%"
,
header
dirs
)
;
template
=
template
.
replace
(
"%cFlags%"
,
target
.
c
flags
)
;
template
=
template
.
replace
(
"%cppFlags%"
,
target
.
cpp
flags
)
;
template
=
template
.
replace
(
"%linkerFlags%"
,
target
.
linker
flags
)
;
template
=
template
.
replace
(
"%srcFiles%"
,
src
files
)
;
config
.
jni
dir
.
child
(
"Android.mk"
)
.
write
string
(
template
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
target
.
os
!=
target
os
.
android
)
throw
new
illegal
argument
exception
(
"target os must be Android"
)
;
if
(
!
config
.
libs
dir
.
exists
(
)
)
{
if
(
!
config
.
libs
dir
.
mkdirs
(
)
)
throw
new
runtime
exception
(
"Couldn't create directory for shared library files in '"
+
config
.
libs
dir
+
"'"
)
;
}
if
(
!
config
.
jni
dir
.
exists
(
)
)
{
if
(
!
config
.
jni
dir
.
mkdirs
(
)
)
throw
new
runtime
exception
(
"Couldn't create native code directory '"
+
config
.
jni
dir
+
"'"
)
;
}
array
list
<
file
descriptor
>
files
=
new
array
list
<
file
descriptor
>
(
)
;
int
idx
=
0
;
string
[
]
includes
=
new
string
[
target
.
c
includes
.
length
+
target
.
cpp
includes
.
length
]
;
for
(
string
include
:
target
.
c
includes
)
includes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
include
;
for
(
string
include
:
target
.
cpp
includes
)
includes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
include
;
idx
=
0
;
string
[
]
excludes
=
new
string
[
target
.
c
excludes
.
length
+
target
.
cpp
excludes
.
length
+
1
]
;
for
(
string
exclude
:
target
.
c
excludes
)
excludes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
exclude
;
for
(
string
exclude
:
target
.
cpp
excludes
)
excludes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
exclude
;
excludes
[
idx
]
=
"**/target/*"
;
gather
source
files
(
config
.
jni
dir
,
includes
,
excludes
,
files
)
;
file
descriptor
application
=
config
.
jni
dir
.
child
(
"Application.mk"
)
;
application
.
write
string
(
new
file
descriptor
(
"com/badlogic/gdx/jnigen/resources/scripts/Application.mk.template"
,
file
type
.
classpath
)
.
read
string
(
)
,
false
)
;
string
template
=
new
file
descriptor
(
"com/badlogic/gdx/jnigen/resources/scripts/Android.mk.template"
,
file
type
.
classpath
)
.
read
string
(
)
;
string
buffer
src
files
=
new
string
buffer
(
)
;
for
(
int
i
=
0
;
i
<
files
.
size
(
)
;
i
++
)
{
if
(
i
>
0
)
src
files
.
append
(
" "
)
;
src
files
.
append
(
files
.
get
(
i
)
.
path
(
)
.
replace
(
'|'
,
'/'
)
.
replace
(
config
.
jni
dir
.
to
string
(
)
+
"/"
,
""
)
)
;
if
(
i
<
files
.
size
(
)
-
1
)
src
files
.
append
(
"| "
)
;
else
src
files
.
append
(
" "
)
;
}
string
buffer
header
dirs
=
new
string
buffer
(
)
;
for
(
string
header
dir
:
target
.
header
dirs
)
{
header
dirs
.
append
(
header
dir
)
;
header
dirs
.
append
(
" "
)
;
}
template
=
template
.
replace
(
"%sharedLibName%"
,
config
.
shared
lib
name
)
;
template
=
template
.
replace
(
"%headerDirs%"
,
header
dirs
)
;
template
=
template
.
replace
(
"%cFlags%"
,
target
.
c
flags
)
;
template
=
template
.
replace
(
"%cppFlags%"
,
target
.
cpp
flags
)
;
template
=
template
.
replace
(
"%linkerFlags%"
,
target
.
linker
flags
)
;
template
=
template
.
replace
(
"%srcFiles%"
,
src
files
)
;
config
.
jni
dir
.
child
(
"Android.mk"
)
.
write
string
(
template
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.91e-01)
%UNK%
(2.32e-02)
string
(9.27e-03)
template
(8.40e-03)
main
(3.53e-03)
file
(3.50e-03)
target
(3.47e-03)
dir
(2.94e-03)
files
(2.74e-03)
config
(2.65e-03)
<SENTENCE_START>
{
if
(
target
.
os
!=
target
os
.
android
)
throw
new
illegal
argument
exception
(
"target os must be Android"
)
;
if
(
!
config
.
libs
dir
.
exists
(
)
)
{
if
(
!
config
.
libs
dir
.
mkdirs
(
)
)
throw
new
runtime
exception
(
"Couldn't create directory for shared library files in '"
+
config
.
libs
dir
+
"'"
)
;
}
if
(
!
config
.
jni
dir
.
exists
(
)
)
{
if
(
!
config
.
jni
dir
.
mkdirs
(
)
)
throw
new
runtime
exception
(
"Couldn't create native code directory '"
+
config
.
jni
dir
+
"'"
)
;
}
array
list
<
file
descriptor
>
files
=
new
array
list
<
file
descriptor
>
(
)
;
int
idx
=
0
;
string
[
]
includes
=
new
string
[
target
.
c
includes
.
length
+
target
.
cpp
includes
.
length
]
;
for
(
string
include
:
target
.
c
includes
)
includes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
include
;
for
(
string
include
:
target
.
cpp
includes
)
includes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
include
;
idx
=
0
;
string
[
]
excludes
=
new
string
[
target
.
c
excludes
.
length
+
target
.
cpp
excludes
.
length
+
1
]
;
for
(
string
exclude
:
target
.
c
excludes
)
excludes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
exclude
;
for
(
string
exclude
:
target
.
cpp
excludes
)
excludes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
exclude
;
excludes
[
idx
]
=
"**/target/*"
;
gather
source
files
(
config
.
jni
dir
,
includes
,
excludes
,
files
)
;
file
descriptor
application
=
config
.
jni
dir
.
child
(
"Application.mk"
)
;
application
.
write
string
(
new
file
descriptor
(
"com/badlogic/gdx/jnigen/resources/scripts/Application.mk.template"
,
file
type
.
classpath
)
.
read
string
(
)
,
false
)
;
string
template
=
new
file
descriptor
(
"com/badlogic/gdx/jnigen/resources/scripts/Android.mk.template"
,
file
type
.
classpath
)
.
read
string
(
)
;
string
buffer
src
files
=
new
string
buffer
(
)
;
for
(
int
i
=
0
;
i
<
files
.
size
(
)
;
i
++
)
{
if
(
i
>
0
)
src
files
.
append
(
" "
)
;
src
files
.
append
(
files
.
get
(
i
)
.
path
(
)
.
replace
(
'|'
,
'/'
)
.
replace
(
config
.
jni
dir
.
to
string
(
)
+
"/"
,
""
)
)
;
if
(
i
<
files
.
size
(
)
-
1
)
src
files
.
append
(
"| "
)
;
else
src
files
.
append
(
" "
)
;
}
string
buffer
header
dirs
=
new
string
buffer
(
)
;
for
(
string
header
dir
:
target
.
header
dirs
)
{
header
dirs
.
append
(
header
dir
)
;
header
dirs
.
append
(
" "
)
;
}
template
=
template
.
replace
(
"%sharedLibName%"
,
config
.
shared
lib
name
)
;
template
=
template
.
replace
(
"%headerDirs%"
,
header
dirs
)
;
template
=
template
.
replace
(
"%cFlags%"
,
target
.
c
flags
)
;
template
=
template
.
replace
(
"%cppFlags%"
,
target
.
cpp
flags
)
;
template
=
template
.
replace
(
"%linkerFlags%"
,
target
.
linker
flags
)
;
template
=
template
.
replace
(
"%srcFiles%"
,
src
files
)
;
config
.
jni
dir
.
child
(
"Android.mk"
)
.
write
string
(
template
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
target
.
os
!=
target
os
.
android
)
throw
new
illegal
argument
exception
(
"target os must be Android"
)
;
if
(
!
config
.
libs
dir
.
exists
(
)
)
{
if
(
!
config
.
libs
dir
.
mkdirs
(
)
)
throw
new
runtime
exception
(
"Couldn't create directory for shared library files in '"
+
config
.
libs
dir
+
"'"
)
;
}
if
(
!
config
.
jni
dir
.
exists
(
)
)
{
if
(
!
config
.
jni
dir
.
mkdirs
(
)
)
throw
new
runtime
exception
(
"Couldn't create native code directory '"
+
config
.
jni
dir
+
"'"
)
;
}
array
list
<
file
descriptor
>
files
=
new
array
list
<
file
descriptor
>
(
)
;
int
idx
=
0
;
string
[
]
includes
=
new
string
[
target
.
c
includes
.
length
+
target
.
cpp
includes
.
length
]
;
for
(
string
include
:
target
.
c
includes
)
includes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
include
;
for
(
string
include
:
target
.
cpp
includes
)
includes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
include
;
idx
=
0
;
string
[
]
excludes
=
new
string
[
target
.
c
excludes
.
length
+
target
.
cpp
excludes
.
length
+
1
]
;
for
(
string
exclude
:
target
.
c
excludes
)
excludes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
exclude
;
for
(
string
exclude
:
target
.
cpp
excludes
)
excludes
[
idx
++
]
=
config
.
jni
dir
+
"/"
+
exclude
;
excludes
[
idx
]
=
"**/target/*"
;
gather
source
files
(
config
.
jni
dir
,
includes
,
excludes
,
files
)
;
file
descriptor
application
=
config
.
jni
dir
.
child
(
"Application.mk"
)
;
application
.
write
string
(
new
file
descriptor
(
"com/badlogic/gdx/jnigen/resources/scripts/Application.mk.template"
,
file
type
.
classpath
)
.
read
string
(
)
,
false
)
;
string
template
=
new
file
descriptor
(
"com/badlogic/gdx/jnigen/resources/scripts/Android.mk.template"
,
file
type
.
classpath
)
.
read
string
(
)
;
string
buffer
src
files
=
new
string
buffer
(
)
;
for
(
int
i
=
0
;
i
<
files
.
size
(
)
;
i
++
)
{
if
(
i
>
0
)
src
files
.
append
(
" "
)
;
src
files
.
append
(
files
.
get
(
i
)
.
path
(
)
.
replace
(
'|'
,
'/'
)
.
replace
(
config
.
jni
dir
.
to
string
(
)
+
"/"
,
""
)
)
;
if
(
i
<
files
.
size
(
)
-
1
)
src
files
.
append
(
"| "
)
;
else
src
files
.
append
(
" "
)
;
}
string
buffer
header
dirs
=
new
string
buffer
(
)
;
for
(
string
header
dir
:
target
.
header
dirs
)
{
header
dirs
.
append
(
header
dir
)
;
header
dirs
.
append
(
" "
)
;
}
template
=
template
.
replace
(
"%sharedLibName%"
,
config
.
shared
lib
name
)
;
template
=
template
.
replace
(
"%headerDirs%"
,
header
dirs
)
;
template
=
template
.
replace
(
"%cFlags%"
,
target
.
c
flags
)
;
template
=
template
.
replace
(
"%cppFlags%"
,
target
.
cpp
flags
)
;
template
=
template
.
replace
(
"%linkerFlags%"
,
target
.
linker
flags
)
;
template
=
template
.
replace
(
"%srcFiles%"
,
src
files
)
;
config
.
jni
dir
.
child
(
"Android.mk"
)
.
write
string
(
template
,
false
)
;
}
<SENTENCE_END/>
gather,source,files
gather
load
(1.81e-01)
parse
(7.24e-02)
initialize
(5.90e-02)
process
(5.75e-02)
%UNK%
(5.27e-02)
%END%
(3.89e-02)
add
(3.75e-02)
main
(2.98e-02)
save
(2.68e-02)
write
(2.33e-02)
<SENTENCE_START>
{
string
file
name
=
file
.
path
(
)
.
replace
(
'|'
,
'/'
)
;
if
(
file
.
is
directory
(
)
)
{
if
(
match
(
file
name
,
excludes
)
)
return
;
for
(
file
descriptor
child
:
file
.
list
(
)
)
{
%SELF%
(
child
,
includes
,
excludes
,
files
)
;
}
}
else
{
if
(
match
(
file
name
,
includes
)
&&
!
match
(
file
name
,
excludes
)
)
files
.
add
(
file
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
file
name
=
file
.
path
(
)
.
replace
(
'|'
,
'/'
)
;
if
(
file
.
is
directory
(
)
)
{
if
(
match
(
file
name
,
excludes
)
)
return
;
for
(
file
descriptor
child
:
file
.
list
(
)
)
{
%SELF%
(
child
,
includes
,
excludes
,
files
)
;
}
}
else
{
if
(
match
(
file
name
,
includes
)
&&
!
match
(
file
name
,
excludes
)
)
files
.
add
(
file
)
;
}
}
<SENTENCE_END/>
source
%END%
(8.61e-01)
file
(2.72e-02)
includes
(7.49e-03)
descriptor
(5.80e-03)
string
(4.61e-03)
directory
(4.53e-03)
excludes
(4.06e-03)
name
(4.05e-03)
child
(3.53e-03)
match
(2.37e-03)
<SENTENCE_START>
{
string
file
name
=
file
.
path
(
)
.
replace
(
'|'
,
'/'
)
;
if
(
file
.
is
directory
(
)
)
{
if
(
match
(
file
name
,
excludes
)
)
return
;
for
(
file
descriptor
child
:
file
.
list
(
)
)
{
%SELF%
(
child
,
includes
,
excludes
,
files
)
;
}
}
else
{
if
(
match
(
file
name
,
includes
)
&&
!
match
(
file
name
,
excludes
)
)
files
.
add
(
file
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
file
name
=
file
.
path
(
)
.
replace
(
'|'
,
'/'
)
;
if
(
file
.
is
directory
(
)
)
{
if
(
match
(
file
name
,
excludes
)
)
return
;
for
(
file
descriptor
child
:
file
.
list
(
)
)
{
%SELF%
(
child
,
includes
,
excludes
,
files
)
;
}
}
else
{
if
(
match
(
file
name
,
includes
)
&&
!
match
(
file
name
,
excludes
)
)
files
.
add
(
file
)
;
}
}
<SENTENCE_END/>
files
%END%
(9.23e-01)
file
(1.12e-02)
descriptor
(3.11e-03)
name
(2.78e-03)
child
(2.65e-03)
includes
(2.64e-03)
string
(2.56e-03)
excludes
(2.14e-03)
directory
(1.99e-03)
match
(1.39e-03)
<SENTENCE_START>
{
string
file
name
=
file
.
path
(
)
.
replace
(
'|'
,
'/'
)
;
if
(
file
.
is
directory
(
)
)
{
if
(
match
(
file
name
,
excludes
)
)
return
;
for
(
file
descriptor
child
:
file
.
list
(
)
)
{
%SELF%
(
child
,
includes
,
excludes
,
files
)
;
}
}
else
{
if
(
match
(
file
name
,
includes
)
&&
!
match
(
file
name
,
excludes
)
)
files
.
add
(
file
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
file
name
=
file
.
path
(
)
.
replace
(
'|'
,
'/'
)
;
if
(
file
.
is
directory
(
)
)
{
if
(
match
(
file
name
,
excludes
)
)
return
;
for
(
file
descriptor
child
:
file
.
list
(
)
)
{
%SELF%
(
child
,
includes
,
excludes
,
files
)
;
}
}
else
{
if
(
match
(
file
name
,
includes
)
&&
!
match
(
file
name
,
excludes
)
)
files
.
add
(
file
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(9.59e-01)
file
(5.10e-03)
string
(1.64e-03)
name
(1.48e-03)
includes
(1.30e-03)
directory
(1.08e-03)
excludes
(9.32e-04)
child
(7.63e-04)
match
(7.61e-04)
descriptor
(6.22e-04)
<SENTENCE_START>
{
string
file
name
=
file
.
path
(
)
.
replace
(
'|'
,
'/'
)
;
if
(
file
.
is
directory
(
)
)
{
if
(
match
(
file
name
,
excludes
)
)
return
;
for
(
file
descriptor
child
:
file
.
list
(
)
)
{
%SELF%
(
child
,
includes
,
excludes
,
files
)
;
}
}
else
{
if
(
match
(
file
name
,
includes
)
&&
!
match
(
file
name
,
excludes
)
)
files
.
add
(
file
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
file
name
=
file
.
path
(
)
.
replace
(
'|'
,
'/'
)
;
if
(
file
.
is
directory
(
)
)
{
if
(
match
(
file
name
,
excludes
)
)
return
;
for
(
file
descriptor
child
:
file
.
list
(
)
)
{
%SELF%
(
child
,
includes
,
excludes
,
files
)
;
}
}
else
{
if
(
match
(
file
name
,
includes
)
&&
!
match
(
file
name
,
excludes
)
)
files
.
add
(
file
)
;
}
}
<SENTENCE_END/>
match
match
process
(2.83e-01)
new
(1.26e-01)
main
(4.01e-02)
read
(3.10e-02)
%UNK%
(1.95e-02)
%START%
(1.83e-02)
build
(1.80e-02)
file
(1.79e-02)
show
(1.72e-02)
write
(1.35e-02)
<SENTENCE_START>
{
return
new
ant
path
matcher
(
)
.
%SELF%
(
file
,
patterns
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
ant
path
matcher
(
)
.
%SELF%
(
file
,
patterns
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.04e-01)
file
(1.76e-02)
%UNK%
(9.67e-03)
matcher
(4.06e-03)
path
(2.87e-03)
string
(2.53e-03)
directory
(2.20e-03)
equal
(1.27e-03)
args
(1.18e-03)
new
(1.06e-03)
<SENTENCE_START>
{
return
new
ant
path
matcher
(
)
.
%SELF%
(
file
,
patterns
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
ant
path
matcher
(
)
.
%SELF%
(
file
,
patterns
)
;
}
<SENTENCE_END/>
set,style
set
set
(9.15e-01)
style
(5.57e-02)
illegal
(2.10e-03)
this
(1.75e-03)
new
(6.49e-04)
invalidate
(6.10e-04)
hierarchy
(4.91e-04)
argument
(4.64e-04)
update
(4.43e-04)
add
(4.15e-04)
<SENTENCE_START>
{
if
(
style
==
null
)
throw
new
illegal
argument
exception
(
"style cannot be null."
)
;
this
.
style
=
style
;
invalidate
hierarchy
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
style
==
null
)
throw
new
illegal
argument
exception
(
"style cannot be null."
)
;
this
.
style
=
style
;
invalidate
hierarchy
(
)
;
}
<SENTENCE_END/>
style
style
(9.85e-01)
%END%
(9.04e-03)
set
(8.88e-04)
update
(7.64e-05)
invalidate
(4.82e-05)
hierarchy
(3.44e-05)
actor
(3.19e-05)
attribute
(2.43e-05)
add
(2.17e-05)
draw
(2.03e-05)
<SENTENCE_START>
{
if
(
style
==
null
)
throw
new
illegal
argument
exception
(
"style cannot be null."
)
;
this
.
style
=
style
;
invalidate
hierarchy
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
style
==
null
)
throw
new
illegal
argument
exception
(
"style cannot be null."
)
;
this
.
style
=
style
;
invalidate
hierarchy
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.79e-01)
style
(7.33e-03)
argument
(9.56e-04)
invalidate
(7.64e-04)
hierarchy
(7.10e-04)
exception
(3.67e-04)
illegal
(3.24e-04)
actor
(1.91e-04)
all
(1.75e-04)
throw
(1.63e-04)
<SENTENCE_START>
{
if
(
style
==
null
)
throw
new
illegal
argument
exception
(
"style cannot be null."
)
;
this
.
style
=
style
;
invalidate
hierarchy
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
style
==
null
)
throw
new
illegal
argument
exception
(
"style cannot be null."
)
;
this
.
style
=
style
;
invalidate
hierarchy
(
)
;
}
<SENTENCE_END/>
get,style
get
get
(9.90e-01)
is
(4.64e-03)
return
(1.40e-03)
style
(1.01e-03)
iterator
(3.16e-04)
protected
(3.55e-05)
owns
(3.48e-05)
as
(2.01e-05)
needs
(1.98e-05)
can
(1.21e-05)
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
style
style
(9.98e-01)
%END%
(9.07e-04)
return
(5.07e-04)
update
(3.99e-05)
atlas
(7.76e-06)
text
(1.81e-06)
label
(1.52e-06)
circle
(1.33e-06)
title
(1.14e-06)
get
(1.09e-06)
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
%END%
%END%
(9.73e-01)
style
(1.30e-02)
value
(1.15e-03)
only
(5.04e-04)
title
(4.33e-04)
accessible
(4.21e-04)
20
(3.59e-04)
return
(3.57e-04)
display
(3.48e-04)
performed
(3.01e-04)
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
get,value
get
get
(9.74e-01)
is
(1.43e-02)
protected
(1.64e-03)
return
(1.52e-03)
iterator
(1.37e-03)
append
(1.32e-03)
needs
(6.04e-04)
value
(4.96e-04)
state
(3.84e-04)
owns
(2.77e-04)
<SENTENCE_START>
{
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
value
;
}
<SENTENCE_END/>
value
value
(9.79e-01)
%END%
(9.93e-03)
return
(3.43e-03)
object
(1.57e-03)
state
(5.12e-04)
long
(2.26e-04)
header
(2.20e-04)
get
(2.06e-04)
append
(1.49e-04)
attribute
(1.37e-04)
<SENTENCE_START>
{
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
value
;
}
<SENTENCE_END/>
%END%
%END%
(8.77e-01)
value
(1.03e-01)
only
(1.83e-03)
20
(1.68e-03)
object
(1.38e-03)
header
(7.99e-04)
array
(7.04e-04)
offset
(4.67e-04)
buffer
(4.28e-04)
byte
(3.77e-04)
<SENTENCE_START>
{
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
value
;
}
<SENTENCE_END/>
get,visual,value
get
animate
(9.68e-01)
queue
(1.04e-02)
update
(3.82e-03)
time
(2.37e-03)
return
(2.26e-03)
interpolation
(1.25e-03)
apply
(8.39e-04)
action
(4.83e-04)
switch
(4.82e-04)
act
(4.74e-04)
<SENTENCE_START>
{
if
(
animate
time
>
0
)
return
animate
interpolation
.
apply
(
animate
from
value
,
value
,
1
-
animate
time
/
animate
duration
)
;
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
animate
time
>
0
)
return
animate
interpolation
.
apply
(
animate
from
value
,
value
,
1
-
animate
time
/
animate
duration
)
;
return
value
;
}
<SENTENCE_END/>
visual
animate
(3.88e-01)
%END%
(1.48e-01)
animation
(1.07e-01)
update
(5.11e-02)
queue
(3.44e-02)
interpolation
(2.10e-02)
action
(1.58e-02)
%UNK%
(1.55e-02)
scale
(1.30e-02)
time
(1.13e-02)
<SENTENCE_START>
{
if
(
animate
time
>
0
)
return
animate
interpolation
.
apply
(
animate
from
value
,
value
,
1
-
animate
time
/
animate
duration
)
;
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
animate
time
>
0
)
return
animate
interpolation
.
apply
(
animate
from
value
,
value
,
1
-
animate
time
/
animate
duration
)
;
return
value
;
}
<SENTENCE_END/>
value
%END%
(8.03e-01)
animation
(2.46e-02)
value
(1.63e-02)
animate
(1.20e-02)
interpolation
(1.12e-02)
%UNK%
(1.09e-02)
time
(8.58e-03)
update
(5.50e-03)
from
(2.95e-03)
index
(2.49e-03)
<SENTENCE_START>
{
if
(
animate
time
>
0
)
return
animate
interpolation
.
apply
(
animate
from
value
,
value
,
1
-
animate
time
/
animate
duration
)
;
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
animate
time
>
0
)
return
animate
interpolation
.
apply
(
animate
from
value
,
value
,
1
-
animate
time
/
animate
duration
)
;
return
value
;
}
<SENTENCE_END/>
%END%
%END%
(9.47e-01)
value
(6.37e-03)
time
(5.50e-03)
animation
(2.91e-03)
animate
(2.77e-03)
%UNK%
(2.07e-03)
interpolation
(1.45e-03)
from
(1.09e-03)
apply
(1.02e-03)
at
(8.63e-04)
<SENTENCE_START>
{
if
(
animate
time
>
0
)
return
animate
interpolation
.
apply
(
animate
from
value
,
value
,
1
-
animate
time
/
animate
duration
)
;
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
animate
time
>
0
)
return
animate
interpolation
.
apply
(
animate
from
value
,
value
,
1
-
animate
time
/
animate
duration
)
;
return
value
;
}
<SENTENCE_END/>
get,percent
get
get
(6.19e-01)
state
(1.10e-01)
min
(3.97e-02)
sub
(3.08e-02)
max
(1.86e-02)
%UNK%
(1.82e-02)
mouse
(1.56e-02)
peek
(1.35e-02)
fast
(8.78e-03)
clamp
(8.77e-03)
<SENTENCE_START>
{
return
(
value
-
min
)
/
(
max
-
min
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
value
-
min
)
/
(
max
-
min
)
;
}
<SENTENCE_END/>
percent
max
(2.08e-01)
min
(1.86e-01)
value
(1.62e-01)
state
(6.76e-02)
%END%
(6.39e-02)
%UNK%
(3.92e-02)
dragged
(3.69e-02)
of
(1.53e-02)
get
(1.04e-02)
fast
(9.29e-03)
<SENTENCE_START>
{
return
(
value
-
min
)
/
(
max
-
min
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
value
-
min
)
/
(
max
-
min
)
;
}
<SENTENCE_END/>
%END%
%END%
(3.35e-01)
value
(2.77e-01)
max
(5.24e-02)
min
(4.26e-02)
%UNK%
(3.58e-02)
state
(3.53e-02)
dragged
(2.04e-02)
of
(1.30e-02)
height
(6.97e-03)
size
(6.33e-03)
<SENTENCE_START>
{
return
(
value
-
min
)
/
(
max
-
min
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
value
-
min
)
/
(
max
-
min
)
;
}
<SENTENCE_END/>
get,visual,percent
get
get
(9.69e-01)
visual
(1.19e-02)
is
(9.44e-03)
return
(2.93e-03)
interpolation
(7.74e-04)
min
(6.12e-04)
max
(4.82e-04)
apply
(3.90e-04)
value
(2.11e-04)
percent
(1.72e-04)
<SENTENCE_START>
{
return
visual
interpolation
.
apply
(
(
get
visual
value
(
)
-
min
)
/
(
max
-
min
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
visual
interpolation
.
apply
(
(
get
visual
value
(
)
-
min
)
/
(
max
-
min
)
)
;
}
<SENTENCE_END/>
visual
visual
(4.06e-01)
get
(1.64e-01)
percent
(6.29e-02)
dragged
(3.11e-02)
%UNK%
(2.20e-02)
interpolation
(1.91e-02)
%END%
(1.49e-02)
is
(1.34e-02)
value
(9.79e-03)
max
(7.79e-03)
<SENTENCE_START>
{
return
visual
interpolation
.
apply
(
(
get
visual
value
(
)
-
min
)
/
(
max
-
min
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
visual
interpolation
.
apply
(
(
get
visual
value
(
)
-
min
)
/
(
max
-
min
)
)
;
}
<SENTENCE_END/>
percent
interpolation
(1.86e-01)
%END%
(1.49e-01)
%UNK%
(6.87e-02)
dragged
(5.13e-02)
get
(3.81e-02)
value
(3.68e-02)
percent
(2.66e-02)
max
(1.34e-02)
changed
(1.17e-02)
state
(1.15e-02)
<SENTENCE_START>
{
return
visual
interpolation
.
apply
(
(
get
visual
value
(
)
-
min
)
/
(
max
-
min
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
visual
interpolation
.
apply
(
(
get
visual
value
(
)
-
min
)
/
(
max
-
min
)
)
;
}
<SENTENCE_END/>
%END%
%END%
(6.46e-01)
%UNK%
(2.98e-02)
value
(2.72e-02)
dragged
(2.25e-02)
interpolation
(1.94e-02)
at
(6.96e-03)
and
(6.86e-03)
visual
(6.02e-03)
max
(5.58e-03)
point
(4.84e-03)
<SENTENCE_START>
{
return
visual
interpolation
.
apply
(
(
get
visual
value
(
)
-
min
)
/
(
max
-
min
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
visual
interpolation
.
apply
(
(
get
visual
value
(
)
-
min
)
/
(
max
-
min
)
)
;
}
<SENTENCE_END/>
get,knob,drawable
get
get
(5.36e-01)
touch
(1.79e-01)
is
(8.45e-02)
knob
(5.10e-02)
update
(2.66e-02)
calculate
(1.59e-02)
disabled
(1.14e-02)
tap
(7.31e-03)
act
(5.95e-03)
mouse
(5.89e-03)
<SENTENCE_START>
{
return
(
disabled
&&
style
.
disabled
knob
!=
null
)
?
style
.
disabled
knob
:
style
.
knob
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
disabled
&&
style
.
disabled
knob
!=
null
)
?
style
.
disabled
knob
:
style
.
knob
;
}
<SENTENCE_END/>
knob
disabled
(5.71e-01)
style
(2.74e-01)
knob
(2.42e-02)
touch
(2.58e-03)
down
(1.38e-03)
update
(1.19e-03)
tap
(1.15e-03)
dragged
(1.03e-03)
pressed
(6.21e-04)
center
(4.36e-04)
<SENTENCE_START>
{
return
(
disabled
&&
style
.
disabled
knob
!=
null
)
?
style
.
disabled
knob
:
style
.
knob
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
disabled
&&
style
.
disabled
knob
!=
null
)
?
style
.
disabled
knob
:
style
.
knob
;
}
<SENTENCE_END/>
drawable
disabled
(4.43e-01)
knob
(4.07e-01)
%END%
(4.23e-02)
style
(9.53e-03)
down
(1.03e-03)
pressed
(7.56e-04)
dragged
(5.72e-04)
update
(4.72e-04)
and
(2.74e-04)
performed
(2.60e-04)
<SENTENCE_START>
{
return
(
disabled
&&
style
.
disabled
knob
!=
null
)
?
style
.
disabled
knob
:
style
.
knob
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
disabled
&&
style
.
disabled
knob
!=
null
)
?
style
.
disabled
knob
:
style
.
knob
;
}
<SENTENCE_END/>
%END%
%END%
(6.98e-01)
knob
(2.29e-01)
disabled
(2.78e-02)
style
(1.73e-03)
down
(1.43e-03)
performed
(1.36e-03)
pressed
(1.19e-03)
dragged
(8.15e-04)
and
(5.90e-04)
moved
(5.86e-04)
<SENTENCE_START>
{
return
(
disabled
&&
style
.
disabled
knob
!=
null
)
?
style
.
disabled
knob
:
style
.
knob
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
disabled
&&
style
.
disabled
knob
!=
null
)
?
style
.
disabled
knob
:
style
.
knob
;
}
<SENTENCE_END/>
get,knob,position
get
iterator
(7.42e-01)
get
(2.13e-01)
is
(1.50e-02)
cpy
(4.96e-03)
as
(3.63e-03)
set
(3.37e-03)
position
(2.33e-03)
duplicate
(2.04e-03)
equals
(1.23e-03)
this
(8.50e-04)
<SENTENCE_START>
{
return
this
.
position
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
position
;
}
<SENTENCE_END/>
knob
position
(9.63e-01)
%END%
(3.29e-02)
bounds
(2.01e-04)
down
(1.24e-04)
at
(9.39e-05)
long
(9.10e-05)
y
(7.48e-05)
this
(5.80e-05)
local
(4.80e-05)
x
(4.21e-05)
<SENTENCE_START>
{
return
this
.
position
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
position
;
}
<SENTENCE_END/>
position
%END%
(9.01e-01)
position
(6.24e-02)
value
(1.99e-03)
only
(1.77e-03)
y
(1.10e-03)
2
(1.01e-03)
height
(9.88e-04)
bounds
(9.77e-04)
width
(8.87e-04)
local
(8.32e-04)
<SENTENCE_START>
{
return
this
.
position
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
position
;
}
<SENTENCE_END/>
%END%
%END%
(9.75e-01)
position
(3.41e-03)
value
(2.44e-03)
only
(1.43e-03)
20
(8.45e-04)
2
(8.29e-04)
height
(6.98e-04)
width
(5.52e-04)
positions
(4.12e-04)
fv
(4.11e-04)
<SENTENCE_START>
{
return
this
.
position
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
position
;
}
<SENTENCE_END/>
set,value
set
set
(3.24e-01)
update
(8.77e-02)
reset
(6.46e-02)
remove
(5.57e-02)
cancel
(2.19e-02)
apply
(2.17e-02)
%UNK%
(1.85e-02)
action
(1.76e-02)
load
(1.65e-02)
%END%
(1.54e-02)
<SENTENCE_START>
{
value
=
clamp
(
math
.
round
(
value
/
step
size
)
*
step
size
)
;
if
(
!
shift
ignores
snap
||
(
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
&&
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
)
)
value
=
snap
(
value
)
;
float
old
value
=
this
.
value
;
if
(
value
==
old
value
)
return
false
;
float
old
visual
value
=
get
visual
value
(
)
;
this
.
value
=
value
;
change
event
change
event
=
pools
.
obtain
(
change
event
.
class
)
;
boolean
cancelled
=
fire
(
change
event
)
;
if
(
cancelled
)
this
.
value
=
old
value
;
else
if
(
animate
duration
>
0
)
{
animate
from
value
=
old
visual
value
;
animate
time
=
animate
duration
;
}
pools
.
free
(
change
event
)
;
return
!
cancelled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
value
=
clamp
(
math
.
round
(
value
/
step
size
)
*
step
size
)
;
if
(
!
shift
ignores
snap
||
(
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
&&
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
)
)
value
=
snap
(
value
)
;
float
old
value
=
this
.
value
;
if
(
value
==
old
value
)
return
false
;
float
old
visual
value
=
get
visual
value
(
)
;
this
.
value
=
value
;
change
event
change
event
=
pools
.
obtain
(
change
event
.
class
)
;
boolean
cancelled
=
fire
(
change
event
)
;
if
(
cancelled
)
this
.
value
=
old
value
;
else
if
(
animate
duration
>
0
)
{
animate
from
value
=
old
visual
value
;
animate
time
=
animate
duration
;
}
pools
.
free
(
change
event
)
;
return
!
cancelled
;
}
<SENTENCE_END/>
value
%END%
(6.20e-01)
visual
(6.35e-02)
value
(4.60e-02)
change
(1.18e-02)
old
(1.16e-02)
%UNK%
(1.12e-02)
event
(1.12e-02)
down
(8.32e-03)
changed
(7.91e-03)
key
(6.84e-03)
<SENTENCE_START>
{
value
=
clamp
(
math
.
round
(
value
/
step
size
)
*
step
size
)
;
if
(
!
shift
ignores
snap
||
(
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
&&
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
)
)
value
=
snap
(
value
)
;
float
old
value
=
this
.
value
;
if
(
value
==
old
value
)
return
false
;
float
old
visual
value
=
get
visual
value
(
)
;
this
.
value
=
value
;
change
event
change
event
=
pools
.
obtain
(
change
event
.
class
)
;
boolean
cancelled
=
fire
(
change
event
)
;
if
(
cancelled
)
this
.
value
=
old
value
;
else
if
(
animate
duration
>
0
)
{
animate
from
value
=
old
visual
value
;
animate
time
=
animate
duration
;
}
pools
.
free
(
change
event
)
;
return
!
cancelled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
value
=
clamp
(
math
.
round
(
value
/
step
size
)
*
step
size
)
;
if
(
!
shift
ignores
snap
||
(
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
&&
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
)
)
value
=
snap
(
value
)
;
float
old
value
=
this
.
value
;
if
(
value
==
old
value
)
return
false
;
float
old
visual
value
=
get
visual
value
(
)
;
this
.
value
=
value
;
change
event
change
event
=
pools
.
obtain
(
change
event
.
class
)
;
boolean
cancelled
=
fire
(
change
event
)
;
if
(
cancelled
)
this
.
value
=
old
value
;
else
if
(
animate
duration
>
0
)
{
animate
from
value
=
old
visual
value
;
animate
time
=
animate
duration
;
}
pools
.
free
(
change
event
)
;
return
!
cancelled
;
}
<SENTENCE_END/>
%END%
%END%
(8.57e-01)
value
(1.20e-02)
%UNK%
(7.32e-03)
down
(6.02e-03)
changed
(4.83e-03)
pressed
(4.38e-03)
change
(3.84e-03)
and
(3.84e-03)
event
(3.67e-03)
key
(2.89e-03)
<SENTENCE_START>
{
value
=
clamp
(
math
.
round
(
value
/
step
size
)
*
step
size
)
;
if
(
!
shift
ignores
snap
||
(
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
&&
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
)
)
value
=
snap
(
value
)
;
float
old
value
=
this
.
value
;
if
(
value
==
old
value
)
return
false
;
float
old
visual
value
=
get
visual
value
(
)
;
this
.
value
=
value
;
change
event
change
event
=
pools
.
obtain
(
change
event
.
class
)
;
boolean
cancelled
=
fire
(
change
event
)
;
if
(
cancelled
)
this
.
value
=
old
value
;
else
if
(
animate
duration
>
0
)
{
animate
from
value
=
old
visual
value
;
animate
time
=
animate
duration
;
}
pools
.
free
(
change
event
)
;
return
!
cancelled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
value
=
clamp
(
math
.
round
(
value
/
step
size
)
*
step
size
)
;
if
(
!
shift
ignores
snap
||
(
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
&&
!
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
)
)
value
=
snap
(
value
)
;
float
old
value
=
this
.
value
;
if
(
value
==
old
value
)
return
false
;
float
old
visual
value
=
get
visual
value
(
)
;
this
.
value
=
value
;
change
event
change
event
=
pools
.
obtain
(
change
event
.
class
)
;
boolean
cancelled
=
fire
(
change
event
)
;
if
(
cancelled
)
this
.
value
=
old
value
;
else
if
(
animate
duration
>
0
)
{
animate
from
value
=
old
visual
value
;
animate
time
=
animate
duration
;
}
pools
.
free
(
change
event
)
;
return
!
cancelled
;
}
<SENTENCE_END/>
clamp
clamp
get
(8.66e-01)
append
(1.66e-02)
is
(1.45e-02)
value
(8.18e-03)
min
(7.32e-03)
max
(7.23e-03)
abs
(6.23e-03)
length
(4.94e-03)
state
(4.83e-03)
set
(4.49e-03)
<SENTENCE_START>
{
return
math
utils
.
%SELF%
(
value
,
min
,
max
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
math
utils
.
%SELF%
(
value
,
min
,
max
)
;
}
<SENTENCE_END/>
%END%
value
(3.98e-01)
%END%
(3.32e-01)
max
(8.25e-02)
min
(2.04e-02)
%UNK%
(8.55e-03)
size
(8.46e-03)
state
(8.04e-03)
width
(6.93e-03)
get
(6.15e-03)
height
(4.78e-03)
<SENTENCE_START>
{
return
math
utils
.
%SELF%
(
value
,
min
,
max
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
math
utils
.
%SELF%
(
value
,
min
,
max
)
;
}
<SENTENCE_END/>
set,range
set
max
(4.31e-01)
min
(3.20e-01)
ext
(4.81e-02)
set
(4.64e-02)
pad
(4.39e-02)
space
(3.83e-02)
pref
(1.66e-02)
value
(4.86e-03)
clamp
(3.13e-03)
illegal
(3.09e-03)
<SENTENCE_START>
{
if
(
min
>
max
)
throw
new
illegal
argument
exception
(
"min must be <= max"
)
;
this
.
min
=
min
;
this
.
max
=
max
;
if
(
value
<
min
)
set
value
(
min
)
;
else
if
(
value
>
max
)
set
value
(
max
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
min
>
max
)
throw
new
illegal
argument
exception
(
"min must be <= max"
)
;
this
.
min
=
min
;
this
.
max
=
max
;
if
(
value
<
min
)
set
value
(
min
)
;
else
if
(
value
>
max
)
set
value
(
max
)
;
}
<SENTENCE_END/>
range
max
(4.74e-01)
min
(3.10e-01)
%END%
(5.69e-02)
value
(4.71e-02)
space
(6.84e-03)
pad
(6.83e-03)
size
(5.71e-03)
pref
(3.72e-03)
height
(3.39e-03)
illegal
(2.87e-03)
<SENTENCE_START>
{
if
(
min
>
max
)
throw
new
illegal
argument
exception
(
"min must be <= max"
)
;
this
.
min
=
min
;
this
.
max
=
max
;
if
(
value
<
min
)
set
value
(
min
)
;
else
if
(
value
>
max
)
set
value
(
max
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
min
>
max
)
throw
new
illegal
argument
exception
(
"min must be <= max"
)
;
this
.
min
=
min
;
this
.
max
=
max
;
if
(
value
<
min
)
set
value
(
min
)
;
else
if
(
value
>
max
)
set
value
(
max
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.32e-01)
value
(4.57e-02)
max
(4.25e-02)
min
(1.80e-02)
size
(3.61e-03)
height
(2.27e-03)
set
(1.87e-03)
argument
(1.51e-03)
width
(1.49e-03)
attribute
(1.43e-03)
<SENTENCE_START>
{
if
(
min
>
max
)
throw
new
illegal
argument
exception
(
"min must be <= max"
)
;
this
.
min
=
min
;
this
.
max
=
max
;
if
(
value
<
min
)
set
value
(
min
)
;
else
if
(
value
>
max
)
set
value
(
max
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
min
>
max
)
throw
new
illegal
argument
exception
(
"min must be <= max"
)
;
this
.
min
=
min
;
this
.
max
=
max
;
if
(
value
<
min
)
set
value
(
min
)
;
else
if
(
value
>
max
)
set
value
(
max
)
;
}
<SENTENCE_END/>
set,step,size
set
size
(3.29e-01)
clear
(3.04e-01)
truncate
(1.79e-01)
compute
(2.92e-02)
shrink
(2.55e-02)
set
(2.42e-02)
resize
(2.04e-02)
step
(1.41e-02)
pack
(9.45e-03)
add
(8.49e-03)
<SENTENCE_START>
{
if
(
step
size
<=
0
)
throw
new
illegal
argument
exception
(
"steps must be > 0: "
+
step
size
)
;
this
.
step
size
=
step
size
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
step
size
<=
0
)
throw
new
illegal
argument
exception
(
"steps must be > 0: "
+
step
size
)
;
this
.
step
size
=
step
size
;
}
<SENTENCE_END/>
step
%END%
(6.78e-01)
step
(1.84e-01)
size
(8.72e-02)
resize
(4.22e-03)
width
(3.95e-03)
height
(2.99e-03)
%UNK%
(2.24e-03)
all
(1.61e-03)
clear
(1.44e-03)
truncate
(1.17e-03)
<SENTENCE_START>
{
if
(
step
size
<=
0
)
throw
new
illegal
argument
exception
(
"steps must be > 0: "
+
step
size
)
;
this
.
step
size
=
step
size
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
step
size
<=
0
)
throw
new
illegal
argument
exception
(
"steps must be > 0: "
+
step
size
)
;
this
.
step
size
=
step
size
;
}
<SENTENCE_END/>
size
%END%
(9.36e-01)
size
(4.21e-02)
step
(6.20e-03)
argument
(8.89e-04)
all
(6.29e-04)
width
(6.13e-04)
%UNK%
(5.45e-04)
exception
(5.05e-04)
height
(4.98e-04)
illegal
(2.64e-04)
<SENTENCE_START>
{
if
(
step
size
<=
0
)
throw
new
illegal
argument
exception
(
"steps must be > 0: "
+
step
size
)
;
this
.
step
size
=
step
size
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
step
size
<=
0
)
throw
new
illegal
argument
exception
(
"steps must be > 0: "
+
step
size
)
;
this
.
step
size
=
step
size
;
}
<SENTENCE_END/>
%END%
%END%
(9.74e-01)
size
(1.84e-02)
step
(1.28e-03)
exception
(2.14e-04)
all
(2.07e-04)
argument
(1.74e-04)
value
(1.19e-04)
%UNK%
(9.78e-05)
width
(9.62e-05)
illegal
(9.19e-05)
<SENTENCE_START>
{
if
(
step
size
<=
0
)
throw
new
illegal
argument
exception
(
"steps must be > 0: "
+
step
size
)
;
this
.
step
size
=
step
size
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
step
size
<=
0
)
throw
new
illegal
argument
exception
(
"steps must be > 0: "
+
step
size
)
;
this
.
step
size
=
step
size
;
}
<SENTENCE_END/>
get,pref,width
get
get
(7.85e-01)
set
(3.63e-02)
update
(1.60e-02)
touch
(1.44e-02)
drawable
(1.07e-02)
knob
(8.49e-03)
is
(6.74e-03)
disabled
(5.80e-03)
generate
(5.10e-03)
calculate
(4.54e-03)
<SENTENCE_START>
{
if
(
vertical
)
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
width
(
)
,
bg
.
get
min
width
(
)
)
;
}
else
return
140
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
vertical
)
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
width
(
)
,
bg
.
get
min
width
(
)
)
;
}
else
return
140
;
}
<SENTENCE_END/>
pref
drawable
(5.50e-01)
knob
(2.19e-01)
%END%
(6.49e-02)
get
(3.49e-02)
disabled
(3.25e-02)
background
(5.84e-03)
final
(5.78e-03)
style
(4.56e-03)
min
(2.34e-03)
%UNK%
(2.04e-03)
<SENTENCE_START>
{
if
(
vertical
)
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
width
(
)
,
bg
.
get
min
width
(
)
)
;
}
else
return
140
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
vertical
)
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
width
(
)
,
bg
.
get
min
width
(
)
)
;
}
else
return
140
;
}
<SENTENCE_END/>
width
knob
(3.78e-01)
%END%
(3.05e-01)
drawable
(1.43e-01)
disabled
(3.45e-02)
background
(3.11e-02)
get
(1.03e-02)
width
(8.56e-03)
min
(5.38e-03)
bg
(4.87e-03)
style
(2.35e-03)
<SENTENCE_START>
{
if
(
vertical
)
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
width
(
)
,
bg
.
get
min
width
(
)
)
;
}
else
return
140
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
vertical
)
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
width
(
)
,
bg
.
get
min
width
(
)
)
;
}
else
return
140
;
}
<SENTENCE_END/>
%END%
%END%
(8.98e-01)
knob
(2.10e-02)
drawable
(8.30e-03)
background
(6.09e-03)
bg
(5.51e-03)
get
(4.04e-03)
disabled
(2.32e-03)
%UNK%
(1.96e-03)
width
(1.88e-03)
down
(1.19e-03)
<SENTENCE_START>
{
if
(
vertical
)
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
width
(
)
,
bg
.
get
min
width
(
)
)
;
}
else
return
140
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
vertical
)
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
width
(
)
,
bg
.
get
min
width
(
)
)
;
}
else
return
140
;
}
<SENTENCE_END/>
get,pref,height
get
get
(7.55e-01)
set
(5.47e-02)
update
(1.77e-02)
touch
(1.61e-02)
is
(9.16e-03)
drawable
(6.63e-03)
knob
(6.37e-03)
%UNK%
(5.29e-03)
generate
(5.15e-03)
disabled
(4.89e-03)
<SENTENCE_START>
{
if
(
vertical
)
return
140
;
else
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
height
(
)
,
bg
==
null
?
0
:
bg
.
get
min
height
(
)
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
vertical
)
return
140
;
else
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
height
(
)
,
bg
==
null
?
0
:
bg
.
get
min
height
(
)
)
;
}
}
<SENTENCE_END/>
pref
knob
(2.92e-01)
drawable
(2.50e-01)
%END%
(1.55e-01)
disabled
(6.39e-02)
get
(6.15e-02)
final
(1.15e-02)
background
(1.08e-02)
style
(8.20e-03)
min
(6.49e-03)
%UNK%
(4.14e-03)
<SENTENCE_START>
{
if
(
vertical
)
return
140
;
else
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
height
(
)
,
bg
==
null
?
0
:
bg
.
get
min
height
(
)
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
vertical
)
return
140
;
else
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
height
(
)
,
bg
==
null
?
0
:
bg
.
get
min
height
(
)
)
;
}
}
<SENTENCE_END/>
height
%END%
(3.97e-01)
knob
(2.05e-01)
drawable
(1.86e-01)
disabled
(3.97e-02)
background
(3.59e-02)
height
(1.69e-02)
get
(1.26e-02)
min
(9.70e-03)
bg
(8.47e-03)
%UNK%
(2.62e-03)
<SENTENCE_START>
{
if
(
vertical
)
return
140
;
else
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
height
(
)
,
bg
==
null
?
0
:
bg
.
get
min
height
(
)
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
vertical
)
return
140
;
else
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
height
(
)
,
bg
==
null
?
0
:
bg
.
get
min
height
(
)
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(8.97e-01)
knob
(1.51e-02)
drawable
(1.17e-02)
bg
(8.60e-03)
background
(7.11e-03)
get
(4.84e-03)
height
(3.18e-03)
disabled
(2.69e-03)
%UNK%
(1.90e-03)
min
(1.20e-03)
<SENTENCE_START>
{
if
(
vertical
)
return
140
;
else
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
height
(
)
,
bg
==
null
?
0
:
bg
.
get
min
height
(
)
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
vertical
)
return
140
;
else
{
final
drawable
knob
=
get
knob
drawable
(
)
;
final
drawable
bg
=
(
disabled
&&
style
.
disabled
background
!=
null
)
?
style
.
disabled
background
:
style
.
background
;
return
math
.
max
(
knob
==
null
?
0
:
knob
.
get
min
height
(
)
,
bg
==
null
?
0
:
bg
.
get
min
height
(
)
)
;
}
}
<SENTENCE_END/>
get,min,value
get
iterator
(7.41e-01)
get
(1.98e-01)
is
(1.39e-02)
cpy
(1.03e-02)
set
(6.63e-03)
size
(4.55e-03)
equals
(2.54e-03)
min
(1.89e-03)
duplicate
(1.46e-03)
abs
(1.16e-03)
<SENTENCE_START>
{
return
this
.
min
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
min
;
}
<SENTENCE_END/>
min
min
(8.74e-01)
%END%
(6.73e-02)
max
(2.04e-02)
size
(9.48e-03)
width
(4.62e-03)
height
(3.63e-03)
pref
(1.81e-03)
value
(1.73e-03)
minimum
(1.25e-03)
corner
(1.13e-03)
<SENTENCE_START>
{
return
this
.
min
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
min
;
}
<SENTENCE_END/>
value
%END%
(7.18e-01)
min
(1.58e-01)
width
(1.15e-02)
value
(1.14e-02)
height
(1.13e-02)
size
(7.03e-03)
max
(4.57e-03)
%UNK%
(3.34e-03)
2
(3.31e-03)
left
(1.82e-03)
<SENTENCE_START>
{
return
this
.
min
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
min
;
}
<SENTENCE_END/>
%END%
%END%
(9.58e-01)
value
(5.77e-03)
min
(4.20e-03)
height
(2.32e-03)
width
(1.91e-03)
2
(1.53e-03)
only
(1.18e-03)
%UNK%
(9.47e-04)
20
(9.22e-04)
fv
(6.16e-04)
<SENTENCE_START>
{
return
this
.
min
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
min
;
}
<SENTENCE_END/>
get,max,value
get
iterator
(7.66e-01)
get
(1.82e-01)
is
(1.91e-02)
set
(7.80e-03)
cpy
(4.99e-03)
max
(1.95e-03)
size
(1.84e-03)
equals
(1.79e-03)
as
(9.73e-04)
abs
(9.72e-04)
<SENTENCE_START>
{
return
this
.
max
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
max
;
}
<SENTENCE_END/>
max
max
(9.96e-01)
%END%
(7.25e-04)
min
(2.85e-04)
height
(7.96e-05)
corner
(7.53e-05)
width
(6.63e-05)
size
(5.17e-05)
minimum
(5.14e-05)
torque
(3.99e-05)
get
(3.79e-05)
<SENTENCE_START>
{
return
this
.
max
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
max
;
}
<SENTENCE_END/>
value
%END%
(6.34e-01)
max
(2.31e-01)
height
(1.17e-02)
width
(1.04e-02)
value
(9.82e-03)
size
(4.70e-03)
%UNK%
(3.14e-03)
2
(2.41e-03)
torque
(2.21e-03)
local
(1.72e-03)
<SENTENCE_START>
{
return
this
.
max
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
max
;
}
<SENTENCE_END/>
%END%
%END%
(9.51e-01)
value
(6.12e-03)
max
(4.43e-03)
height
(2.63e-03)
width
(2.07e-03)
2
(1.50e-03)
only
(1.41e-03)
%UNK%
(1.10e-03)
20
(1.08e-03)
mode
(7.02e-04)
<SENTENCE_START>
{
return
this
.
max
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
max
;
}
<SENTENCE_END/>
get,step,size
get
iterator
(7.04e-01)
size
(1.09e-01)
set
(5.00e-02)
cpy
(2.93e-02)
get
(2.86e-02)
is
(1.32e-02)
step
(5.69e-03)
%END%
(5.26e-03)
width
(3.81e-03)
to
(3.50e-03)
<SENTENCE_START>
{
return
this
.
step
size
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
step
size
;
}
<SENTENCE_END/>
step
step
(9.69e-01)
%END%
(1.98e-02)
size
(5.85e-03)
resize
(1.01e-03)
%UNK%
(3.58e-04)
set
(2.91e-04)
render
(2.81e-04)
scroll
(2.53e-04)
width
(1.90e-04)
changed
(1.04e-04)
<SENTENCE_START>
{
return
this
.
step
size
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
step
size
;
}
<SENTENCE_END/>
size
%END%
(4.83e-01)
size
(4.50e-01)
step
(2.97e-02)
%UNK%
(3.50e-03)
width
(2.02e-03)
height
(1.67e-03)
value
(9.78e-04)
2
(8.72e-04)
only
(8.50e-04)
set
(5.82e-04)
<SENTENCE_START>
{
return
this
.
step
size
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
step
size
;
}
<SENTENCE_END/>
%END%
%END%
(9.50e-01)
size
(7.53e-03)
value
(3.62e-03)
only
(1.93e-03)
%UNK%
(1.87e-03)
height
(1.78e-03)
width
(1.66e-03)
2
(1.51e-03)
20
(1.06e-03)
accessible
(7.85e-04)
<SENTENCE_START>
{
return
this
.
step
size
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
this
.
step
size
;
}
<SENTENCE_END/>
set,animate,duration
set
set
(8.95e-01)
reset
(2.60e-02)
apply
(1.07e-02)
animate
(7.98e-03)
obtain
(6.42e-03)
rotate
(6.21e-03)
fill
(4.39e-03)
update
(3.77e-03)
scale
(2.92e-03)
get
(2.20e-03)
<SENTENCE_START>
{
this
.
animate
duration
=
duration
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
animate
duration
=
duration
;
}
<SENTENCE_END/>
animate
animate
(8.87e-01)
animation
(5.50e-02)
%END%
(1.81e-02)
queue
(9.90e-03)
duration
(8.93e-03)
scale
(1.99e-03)
update
(1.44e-03)
obtain
(1.05e-03)
fling
(9.85e-04)
fill
(8.15e-04)
<SENTENCE_START>
{
this
.
animate
duration
=
duration
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
animate
duration
=
duration
;
}
<SENTENCE_END/>
duration
%END%
(8.45e-01)
duration
(1.31e-01)
animate
(1.21e-02)
animation
(9.71e-04)
value
(3.38e-04)
%UNK%
(2.90e-04)
count
(2.13e-04)
array
(2.02e-04)
display
(2.01e-04)
layout
(1.64e-04)
<SENTENCE_START>
{
this
.
animate
duration
=
duration
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
animate
duration
=
duration
;
}
<SENTENCE_END/>
%END%
%END%
(9.84e-01)
duration
(7.25e-03)
value
(7.11e-04)
only
(3.25e-04)
20
(2.74e-04)
display
(2.39e-04)
fv
(2.26e-04)
2
(1.89e-04)
array
(1.83e-04)
count
(1.79e-04)
<SENTENCE_START>
{
this
.
animate
duration
=
duration
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
animate
duration
=
duration
;
}
<SENTENCE_END/>
set,animate,interpolation
set
animate
(7.14e-01)
set
(1.98e-01)
queue
(1.41e-02)
switch
(1.32e-02)
interpolation
(6.20e-03)
update
(5.83e-03)
apply
(5.10e-03)
setup
(2.87e-03)
calculate
(2.36e-03)
action
(1.96e-03)
<SENTENCE_START>
{
if
(
animate
interpolation
==
null
)
throw
new
illegal
argument
exception
(
"animateInterpolation cannot be null."
)
;
this
.
animate
interpolation
=
animate
interpolation
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
animate
interpolation
==
null
)
throw
new
illegal
argument
exception
(
"animateInterpolation cannot be null."
)
;
this
.
animate
interpolation
=
animate
interpolation
;
}
<SENTENCE_END/>
animate
animate
(8.83e-01)
%END%
(4.17e-02)
interpolation
(2.61e-02)
animation
(6.39e-03)
queue
(4.43e-03)
scale
(1.92e-03)
update
(1.64e-03)
action
(1.40e-03)
%UNK%
(1.28e-03)
set
(1.19e-03)
<SENTENCE_START>
{
if
(
animate
interpolation
==
null
)
throw
new
illegal
argument
exception
(
"animateInterpolation cannot be null."
)
;
this
.
animate
interpolation
=
animate
interpolation
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
animate
interpolation
==
null
)
throw
new
illegal
argument
exception
(
"animateInterpolation cannot be null."
)
;
this
.
animate
interpolation
=
animate
interpolation
;
}
<SENTENCE_END/>
interpolation
%END%
(7.01e-01)
interpolation
(2.62e-01)
animate
(1.33e-02)
argument
(1.49e-03)
exception
(7.13e-04)
%UNK%
(6.15e-04)
value
(5.98e-04)
at
(4.23e-04)
illegal
(4.14e-04)
and
(3.43e-04)
<SENTENCE_START>
{
if
(
animate
interpolation
==
null
)
throw
new
illegal
argument
exception
(
"animateInterpolation cannot be null."
)
;
this
.
animate
interpolation
=
animate
interpolation
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
animate
interpolation
==
null
)
throw
new
illegal
argument
exception
(
"animateInterpolation cannot be null."
)
;
this
.
animate
interpolation
=
animate
interpolation
;
}
<SENTENCE_END/>
%END%
%END%
(9.80e-01)
interpolation
(1.34e-02)
animate
(4.11e-04)
value
(2.39e-04)
exception
(2.08e-04)
at
(1.53e-04)
argument
(1.26e-04)
and
(1.12e-04)
%UNK%
(7.66e-05)
top
(6.59e-05)
<SENTENCE_START>
{
if
(
animate
interpolation
==
null
)
throw
new
illegal
argument
exception
(
"animateInterpolation cannot be null."
)
;
this
.
animate
interpolation
=
animate
interpolation
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
animate
interpolation
==
null
)
throw
new
illegal
argument
exception
(
"animateInterpolation cannot be null."
)
;
this
.
animate
interpolation
=
animate
interpolation
;
}
<SENTENCE_END/>
set,visual,interpolation
set
set
(8.00e-01)
get
(1.17e-01)
visual
(1.17e-02)
scroll
(5.73e-03)
interpolation
(4.68e-03)
touch
(4.22e-03)
calculate
(4.00e-03)
update
(3.88e-03)
apply
(3.59e-03)
report
(3.07e-03)
<SENTENCE_START>
{
this
.
visual
interpolation
=
interpolation
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
visual
interpolation
=
interpolation
;
}
<SENTENCE_END/>
visual
visual
(9.84e-01)
interpolation
(1.33e-02)
get
(2.13e-03)
percent
(1.17e-04)
is
(9.49e-05)
scroll
(3.99e-05)
corner
(1.26e-05)
unproject
(1.22e-05)
hit
(8.68e-06)
%START%
(8.61e-06)
<SENTENCE_START>
{
this
.
visual
interpolation
=
interpolation
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
visual
interpolation
=
interpolation
;
}
<SENTENCE_END/>
interpolation
interpolation
(9.34e-01)
%END%
(5.23e-02)
visual
(5.35e-03)
position
(3.07e-04)
y
(1.60e-04)
local
(1.53e-04)
%UNK%
(1.46e-04)
value
(1.46e-04)
scroll
(1.18e-04)
to
(1.12e-04)
<SENTENCE_START>
{
this
.
visual
interpolation
=
interpolation
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
visual
interpolation
=
interpolation
;
}
<SENTENCE_END/>
%END%
%END%
(9.35e-01)
interpolation
(4.27e-02)
value
(1.47e-03)
only
(6.10e-04)
position
(5.66e-04)
positions
(5.20e-04)
%UNK%
(4.96e-04)
height
(4.41e-04)
20
(4.30e-04)
2
(4.14e-04)
<SENTENCE_START>
{
this
.
visual
interpolation
=
interpolation
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
visual
interpolation
=
interpolation
;
}
<SENTENCE_END/>
set,snap,to,values
set
set
(9.86e-01)
values
(3.03e-03)
snap
(2.94e-03)
threshold
(2.58e-03)
this
(6.54e-04)
clear
(2.08e-04)
add
(1.97e-04)
reset
(1.81e-05)
uncheck
(1.57e-05)
translate
(1.18e-05)
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
snap
snap
(8.03e-01)
threshold
(8.78e-02)
%END%
(4.25e-02)
values
(2.35e-02)
set
(1.65e-02)
%UNK%
(6.40e-03)
add
(2.07e-03)
size
(8.29e-04)
2
(6.71e-04)
array
(5.44e-04)
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
to
%END%
(9.51e-01)
values
(1.31e-02)
threshold
(1.03e-02)
set
(1.79e-03)
%UNK%
(1.59e-03)
snap
(1.06e-03)
2
(1.01e-03)
value
(6.68e-04)
data
(5.82e-04)
array
(5.80e-04)
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
values
%END%
(9.79e-01)
values
(6.76e-03)
threshold
(8.16e-04)
2
(6.93e-04)
fv
(5.48e-04)
%UNK%
(4.92e-04)
value
(4.52e-04)
set
(4.49e-04)
position
(4.00e-04)
height
(3.83e-04)
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
%END%
%END%
(9.56e-01)
values
(2.66e-02)
threshold
(1.99e-03)
snap
(1.91e-03)
2
(6.10e-04)
fv
(5.38e-04)
value
(4.11e-04)
%UNK%
(3.69e-04)
position
(3.54e-04)
height
(3.44e-04)
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
snap
values
=
values
;
this
.
threshold
=
threshold
;
}
<SENTENCE_END/>
snap
snap
get
(3.70e-01)
%UNK%
(1.20e-01)
contains
(6.03e-02)
value
(4.65e-02)
is
(4.48e-02)
find
(1.93e-02)
first
(1.84e-02)
of
(1.79e-02)
state
(1.60e-02)
equals
(1.52e-02)
<SENTENCE_START>
{
if
(
snap
values
==
null
)
return
value
;
for
(
int
i
=
0
;
i
<
snap
values
.
length
;
i
++
)
{
if
(
math
.
abs
(
value
-
snap
values
[
i
]
)
<=
threshold
)
return
snap
values
[
i
]
;
}
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
snap
values
==
null
)
return
value
;
for
(
int
i
=
0
;
i
<
snap
values
.
length
;
i
++
)
{
if
(
math
.
abs
(
value
-
snap
values
[
i
]
)
<=
threshold
)
return
snap
values
[
i
]
;
}
return
value
;
}
<SENTENCE_END/>
%END%
%END%
(2.95e-01)
value
(2.33e-01)
%UNK%
(6.56e-02)
of
(5.62e-02)
snap
(1.89e-02)
index
(1.72e-02)
get
(1.47e-02)
return
(1.34e-02)
object
(1.10e-02)
int
(6.60e-03)
<SENTENCE_START>
{
if
(
snap
values
==
null
)
return
value
;
for
(
int
i
=
0
;
i
<
snap
values
.
length
;
i
++
)
{
if
(
math
.
abs
(
value
-
snap
values
[
i
]
)
<=
threshold
)
return
snap
values
[
i
]
;
}
return
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
snap
values
==
null
)
return
value
;
for
(
int
i
=
0
;
i
<
snap
values
.
length
;
i
++
)
{
if
(
math
.
abs
(
value
-
snap
values
[
i
]
)
<=
threshold
)
return
snap
values
[
i
]
;
}
return
value
;
}
<SENTENCE_END/>
set,disabled
set
set
(9.27e-01)
disabled
(3.59e-02)
cancel
(7.54e-03)
reset
(4.74e-03)
run
(2.44e-03)
clear
(2.43e-03)
translate
(1.68e-03)
stop
(1.36e-03)
scroll
(1.35e-03)
disable
(1.00e-03)
<SENTENCE_START>
{
this
.
disabled
=
disabled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
disabled
=
disabled
;
}
<SENTENCE_END/>
disabled
disabled
(9.91e-01)
this
(5.57e-06)
scrolling
(3.14e-07)
disable
(2.45e-09)
scroll
(3.74e-10)
pan
(2.52e-10)
mode
(1.84e-10)
released
(1.72e-10)
dragged
(9.57e-11)
moved
(7.39e-11)
<SENTENCE_START>
{
this
.
disabled
=
disabled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
disabled
=
disabled
;
}
<SENTENCE_END/>
%END%
%END%
(4.93e-01)
disabled
(4.33e-01)
scrolling
(1.40e-03)
mode
(1.21e-03)
only
(9.95e-04)
20
(9.83e-04)
display
(9.48e-04)
positions
(8.73e-04)
released
(6.94e-04)
height
(6.56e-04)
<SENTENCE_START>
{
this
.
disabled
=
disabled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
disabled
=
disabled
;
}
<SENTENCE_END/>
is,disabled
is
disabled
(3.17e-01)
is
(2.56e-01)
get
(1.32e-01)
touch
(6.05e-02)
protected
(2.52e-02)
needs
(2.27e-02)
has
(1.69e-02)
mouse
(1.49e-02)
owns
(1.12e-02)
size
(9.70e-03)
<SENTENCE_START>
{
return
disabled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
disabled
;
}
<SENTENCE_END/>
disabled
disabled
(9.76e-01)
return
(2.37e-02)
scrolling
(2.27e-06)
disable
(1.14e-08)
scroll
(1.46e-09)
mode
(1.40e-09)
pan
(1.31e-09)
dragged
(8.36e-10)
moved
(6.81e-10)
focus
(5.18e-10)
<SENTENCE_START>
{
return
disabled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
disabled
;
}
<SENTENCE_END/>
%END%
%END%
(5.21e-01)
disabled
(3.85e-01)
20
(8.64e-03)
only
(8.26e-03)
value
(4.61e-03)
mode
(4.19e-03)
offset
(3.84e-03)
gutter
(2.58e-03)
enabled
(2.56e-03)
scrolling
(2.31e-03)
<SENTENCE_START>
{
return
disabled
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
disabled
;
}
<SENTENCE_END/>
get,c,ptr
get
get
(9.83e-01)
c
(4.72e-03)
obj
(1.88e-03)
swig
(1.36e-03)
is
(8.93e-04)
return
(8.85e-04)
ptr
(5.54e-04)
0
(3.63e-04)
null
(3.14e-04)
obtain
(2.82e-04)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
c
c
(9.96e-01)
ptr
(2.00e-03)
get
(1.04e-03)
%END%
(8.72e-04)
swig
(1.90e-04)
instance
(1.07e-04)
overlaps
(3.51e-05)
derived
(2.62e-05)
match
(7.06e-06)
is
(6.12e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
ptr
ptr
(9.96e-01)
c
(2.15e-03)
%END%
(1.61e-03)
obj
(1.88e-05)
0
(6.12e-06)
get
(6.07e-06)
return
(5.61e-06)
string
(2.74e-06)
instance
(2.57e-06)
swig
(2.31e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
%END%
%END%
(9.61e-01)
ptr
(3.23e-02)
obj
(8.25e-04)
c
(4.05e-04)
return
(2.33e-04)
string
(2.06e-04)
double
(1.33e-04)
at
(1.02e-04)
0
(9.89e-05)
swig
(5.39e-05)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
add,child,shape
add
add
(9.03e-01)
obtain
(2.42e-02)
internal
(1.48e-02)
get
(1.45e-02)
local
(4.10e-03)
create
(4.08e-03)
shape
(3.40e-03)
initialize
(3.14e-03)
child
(2.37e-03)
draw
(1.92e-03)
<SENTENCE_START>
{
internal
add
child
shape
(
local
transform
,
shape
)
;
children
.
add
(
shape
)
;
shape
.
obtain
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
add
child
shape
(
local
transform
,
shape
)
;
children
.
add
(
shape
)
;
shape
.
obtain
(
)
;
}
<SENTENCE_END/>
child
local
(5.24e-01)
%END%
(2.31e-01)
child
(1.06e-01)
transform
(6.62e-02)
shape
(9.93e-03)
children
(7.16e-03)
add
(2.59e-03)
debug
(2.47e-03)
scissors
(2.46e-03)
by
(2.09e-03)
<SENTENCE_START>
{
internal
add
child
shape
(
local
transform
,
shape
)
;
children
.
add
(
shape
)
;
shape
.
obtain
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
add
child
shape
(
local
transform
,
shape
)
;
children
.
add
(
shape
)
;
shape
.
obtain
(
)
;
}
<SENTENCE_END/>
shape
%END%
(5.88e-01)
transform
(2.83e-01)
shape
(3.62e-02)
child
(2.49e-02)
local
(2.37e-02)
children
(4.45e-03)
obtain
(2.22e-03)
add
(1.86e-03)
internal
(1.65e-03)
performed
(3.36e-04)
<SENTENCE_START>
{
internal
add
child
shape
(
local
transform
,
shape
)
;
children
.
add
(
shape
)
;
shape
.
obtain
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
add
child
shape
(
local
transform
,
shape
)
;
children
.
add
(
shape
)
;
shape
.
obtain
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.67e-01)
transform
(9.84e-03)
shape
(4.55e-03)
obtain
(1.42e-03)
local
(1.17e-03)
add
(9.81e-04)
internal
(7.95e-04)
child
(4.42e-04)
children
(4.14e-04)
all
(2.10e-04)
<SENTENCE_START>
{
internal
add
child
shape
(
local
transform
,
shape
)
;
children
.
add
(
shape
)
;
shape
.
obtain
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
add
child
shape
(
local
transform
,
shape
)
;
children
.
add
(
shape
)
;
shape
.
obtain
(
)
;
}
<SENTENCE_END/>
remove,child,shape
remove
remove
(9.16e-01)
index
(5.00e-03)
child
(4.33e-03)
add
(4.06e-03)
end
(3.93e-03)
reset
(3.63e-03)
clear
(3.23e-03)
insert
(2.90e-03)
shape
(2.67e-03)
set
(2.47e-03)
<SENTENCE_START>
{
internal
remove
child
shape
(
shape
)
;
final
int
idx
=
children
.
index
of
(
shape
,
false
)
;
if
(
idx
>=
0
)
children
.
remove
index
(
idx
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
(
shape
)
;
final
int
idx
=
children
.
index
of
(
shape
,
false
)
;
if
(
idx
>=
0
)
children
.
remove
index
(
idx
)
.
release
(
)
;
}
<SENTENCE_END/>
child
%END%
(7.88e-01)
child
(2.51e-02)
shape
(1.12e-02)
children
(1.08e-02)
at
(1.06e-02)
index
(9.86e-03)
all
(9.64e-03)
remove
(8.61e-03)
%UNK%
(6.52e-03)
string
(4.17e-03)
<SENTENCE_START>
{
internal
remove
child
shape
(
shape
)
;
final
int
idx
=
children
.
index
of
(
shape
,
false
)
;
if
(
idx
>=
0
)
children
.
remove
index
(
idx
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
(
shape
)
;
final
int
idx
=
children
.
index
of
(
shape
,
false
)
;
if
(
idx
>=
0
)
children
.
remove
index
(
idx
)
.
release
(
)
;
}
<SENTENCE_END/>
shape
%END%
(9.51e-01)
shape
(1.35e-02)
of
(3.85e-03)
child
(3.81e-03)
index
(1.96e-03)
children
(1.89e-03)
at
(1.80e-03)
all
(1.47e-03)
release
(1.31e-03)
remove
(7.82e-04)
<SENTENCE_START>
{
internal
remove
child
shape
(
shape
)
;
final
int
idx
=
children
.
index
of
(
shape
,
false
)
;
if
(
idx
>=
0
)
children
.
remove
index
(
idx
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
(
shape
)
;
final
int
idx
=
children
.
index
of
(
shape
,
false
)
;
if
(
idx
>=
0
)
children
.
remove
index
(
idx
)
.
release
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.64e-01)
shape
(6.96e-03)
release
(2.77e-03)
index
(2.33e-03)
of
(2.25e-03)
remove
(1.36e-03)
at
(1.23e-03)
children
(1.04e-03)
all
(9.22e-04)
child
(7.80e-04)
<SENTENCE_START>
{
internal
remove
child
shape
(
shape
)
;
final
int
idx
=
children
.
index
of
(
shape
,
false
)
;
if
(
idx
>=
0
)
children
.
remove
index
(
idx
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
(
shape
)
;
final
int
idx
=
children
.
index
of
(
shape
,
false
)
;
if
(
idx
>=
0
)
children
.
remove
index
(
idx
)
.
release
(
)
;
}
<SENTENCE_END/>
remove,child,shape,by,index
remove
remove
(9.81e-01)
index
(4.17e-03)
child
(2.13e-03)
by
(1.55e-03)
insert
(1.30e-03)
shape
(9.08e-04)
internal
(7.94e-04)
children
(7.16e-04)
release
(6.22e-04)
get
(5.28e-04)
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
child
%END%
(4.24e-01)
child
(2.04e-01)
children
(5.66e-02)
index
(4.38e-02)
actor
(3.23e-02)
remove
(2.92e-02)
by
(2.17e-02)
at
(2.14e-02)
particles
(1.96e-02)
shape
(8.64e-03)
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
shape
%END%
(9.62e-01)
index
(1.52e-02)
by
(5.50e-03)
shape
(1.71e-03)
release
(1.56e-03)
all
(1.24e-03)
child
(1.21e-03)
at
(8.21e-04)
internal
(5.78e-04)
children
(5.67e-04)
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
by
%END%
(9.74e-01)
index
(1.05e-02)
release
(1.76e-03)
by
(1.66e-03)
internal
(5.68e-04)
all
(5.35e-04)
shape
(3.58e-04)
remove
(3.40e-04)
at
(2.74e-04)
child
(1.75e-04)
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
index
%END%
(9.53e-01)
index
(2.01e-02)
release
(3.67e-03)
by
(3.40e-03)
internal
(2.16e-03)
remove
(1.04e-03)
all
(4.99e-04)
shape
(4.98e-04)
children
(2.95e-04)
child
(2.75e-04)
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.54e-01)
index
(1.99e-02)
release
(3.66e-03)
by
(3.36e-03)
internal
(2.14e-03)
remove
(1.03e-03)
all
(5.07e-04)
shape
(4.98e-04)
children
(2.94e-04)
child
(2.77e-04)
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
internal
remove
child
shape
by
index
(
index
)
;
children
.
remove
index
(
index
)
.
release
(
)
;
}
<SENTENCE_END/>
get,child,shape
get
get
(9.95e-01)
children
(1.08e-03)
return
(9.93e-04)
index
(2.71e-04)
is
(1.54e-04)
add
(6.08e-05)
child
(4.06e-05)
obtain
(3.72e-05)
pop
(3.07e-05)
last
(3.04e-05)
<SENTENCE_START>
{
return
children
.
get
(
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
children
.
get
(
index
)
;
}
<SENTENCE_END/>
child
children
(5.53e-01)
child
(3.89e-01)
index
(8.05e-03)
actor
(7.90e-03)
particles
(2.03e-03)
add
(1.87e-03)
get
(1.45e-03)
by
(1.31e-03)
remove
(9.29e-04)
draw
(9.00e-04)
<SENTENCE_START>
{
return
children
.
get
(
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
children
.
get
(
index
)
;
}
<SENTENCE_END/>
shape
%END%
(7.02e-01)
children
(3.61e-02)
child
(3.34e-02)
actor
(1.56e-02)
index
(1.26e-02)
particles
(8.88e-03)
count
(8.51e-03)
all
(7.70e-03)
value
(7.38e-03)
string
(7.09e-03)
<SENTENCE_START>
{
return
children
.
get
(
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
children
.
get
(
index
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.67e-01)
get
(5.53e-03)
value
(2.27e-03)
index
(1.28e-03)
20
(7.36e-04)
array
(6.26e-04)
count
(5.60e-04)
at
(4.54e-04)
children
(4.35e-04)
string
(4.23e-04)
<SENTENCE_START>
{
return
children
.
get
(
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
children
.
get
(
index
)
;
}
<SENTENCE_END/>
internal,add,child,shape
internal
add
(9.29e-01)
internal
(4.29e-02)
child
(1.10e-02)
shape
(9.65e-03)
collision
(5.39e-04)
compound
(5.06e-04)
c
(4.82e-04)
ptr
(3.66e-04)
swig
(3.63e-04)
local
(3.52e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
add
child
(5.47e-01)
add
(4.51e-01)
%END%
(1.15e-03)
shape
(3.69e-04)
internal
(2.19e-04)
get
(1.08e-04)
set
(3.13e-05)
obtain
(2.28e-05)
create
(2.25e-05)
c
(1.66e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
child
child
(7.75e-01)
shape
(2.23e-01)
add
(1.16e-03)
%END%
(6.18e-04)
ptr
(1.88e-05)
transform
(1.65e-05)
c
(1.53e-05)
collision
(1.29e-05)
local
(1.08e-05)
bt
(8.86e-06)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
shape
shape
(9.29e-01)
%END%
(5.92e-02)
child
(6.61e-03)
%UNK%
(7.38e-05)
get
(4.16e-05)
ptr
(3.81e-05)
c
(3.81e-05)
set
(3.54e-05)
bt
(3.02e-05)
transform
(2.88e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.93e-01)
shape
(7.61e-02)
%UNK%
(1.12e-03)
get
(4.67e-04)
set
(4.23e-04)
c
(3.82e-04)
bt
(3.58e-04)
transform
(3.09e-04)
create
(2.94e-04)
convex
(2.81e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
add
child
shape
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
internal,remove,child,shape
internal
remove
(9.38e-01)
internal
(4.44e-02)
child
(6.98e-03)
shape
(6.37e-03)
c
(3.83e-04)
collision
(3.43e-04)
ptr
(2.80e-04)
compound
(2.76e-04)
bt
(1.99e-04)
swig
(1.90e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
remove
remove
(6.92e-01)
child
(3.06e-01)
%END%
(1.41e-03)
shape
(3.77e-04)
internal
(2.51e-04)
get
(8.39e-05)
set
(7.31e-05)
actor
(3.93e-05)
node
(2.19e-05)
c
(1.86e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
child
child
(8.21e-01)
shape
(1.78e-01)
remove
(1.12e-03)
%END%
(6.65e-04)
ptr
(2.12e-05)
c
(1.77e-05)
collision
(1.40e-05)
bt
(7.00e-06)
jni
(6.96e-06)
get
(4.75e-06)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
shape
shape
(8.47e-01)
%END%
(1.41e-01)
child
(5.55e-03)
%UNK%
(1.47e-04)
c
(9.29e-05)
set
(9.19e-05)
bt
(8.54e-05)
get
(7.01e-05)
ptr
(6.75e-05)
ref
(6.17e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.14e-01)
shape
(6.47e-02)
%UNK%
(1.01e-03)
set
(5.12e-04)
bt
(5.09e-04)
c
(5.05e-04)
get
(3.90e-04)
ref
(3.90e-04)
derived
(3.58e-04)
ptr
(2.43e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
internal,remove,child,shape,by,index
internal
remove
(9.53e-01)
internal
(2.48e-02)
shape
(5.66e-03)
child
(5.58e-03)
by
(5.50e-03)
index
(3.28e-03)
compound
(2.74e-04)
collision
(2.12e-04)
jni
(1.24e-04)
shapeindex
(1.17e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
remove
child
(5.82e-01)
remove
(4.17e-01)
shape
(9.73e-04)
internal
(1.33e-04)
%END%
(6.91e-05)
actor
(5.02e-05)
by
(4.34e-05)
index
(3.17e-05)
children
(2.24e-05)
insert
(1.73e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
child
shape
(5.77e-01)
child
(4.18e-01)
by
(3.42e-03)
%END%
(7.13e-04)
remove
(4.82e-04)
index
(6.59e-05)
shapeindex
(1.39e-05)
jni
(1.09e-05)
collision
(8.32e-06)
compound
(6.42e-06)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
shape
by
(5.37e-01)
shape
(3.51e-01)
index
(8.42e-02)
%END%
(1.81e-02)
child
(7.05e-03)
jni
(1.73e-04)
shapeindex
(1.67e-04)
remove
(8.33e-05)
compound
(8.15e-05)
collision
(8.08e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
by
%END%
(8.14e-01)
index
(1.23e-01)
by
(4.68e-02)
%UNK%
(1.33e-03)
shape
(1.19e-03)
child
(6.57e-04)
actor
(4.80e-04)
at
(4.50e-04)
string
(4.06e-04)
node
(3.82e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
index
%END%
(8.17e-01)
index
(1.21e-01)
by
(4.54e-02)
%UNK%
(1.34e-03)
shape
(1.15e-03)
child
(6.63e-04)
actor
(4.85e-04)
at
(4.54e-04)
string
(4.10e-04)
node
(3.86e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.18e-01)
index
(1.20e-01)
by
(4.54e-02)
%UNK%
(1.35e-03)
shape
(1.16e-03)
child
(6.67e-04)
actor
(4.89e-04)
at
(4.54e-04)
string
(4.09e-04)
node
(3.89e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
internal
remove
child
shape
by
index
(
swig
c
ptr
,
this
,
child
shapeindex
)
;
}
<SENTENCE_END/>
get,num,child,shapes
get
get
(9.69e-01)
num
(2.09e-02)
shape
(3.51e-03)
child
(2.64e-03)
shapes
(1.32e-03)
compound
(3.67e-04)
return
(2.46e-04)
swig
(2.00e-04)
collision
(1.99e-04)
c
(1.39e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
num
num
(9.93e-01)
child
(6.41e-03)
get
(4.50e-04)
%END%
(1.05e-04)
string
(4.11e-06)
floats
(3.81e-06)
bounding
(3.36e-06)
by
(3.27e-06)
c
(3.12e-06)
obtain
(2.98e-06)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
child
child
(9.77e-01)
shapes
(2.11e-02)
num
(1.66e-03)
%END%
(4.20e-04)
jni
(4.35e-06)
ptr
(3.20e-06)
collision
(3.17e-06)
get
(2.91e-06)
c
(2.36e-06)
this
(2.11e-06)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
shapes
shapes
(7.38e-01)
%END%
(2.33e-01)
child
(2.51e-02)
%UNK%
(9.63e-05)
get
(9.13e-05)
c
(8.50e-05)
bt
(7.05e-05)
string
(4.85e-05)
endian
(4.47e-05)
num
(4.13e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.39e-01)
shapes
(5.19e-02)
child
(4.89e-04)
%UNK%
(3.85e-04)
c
(3.04e-04)
get
(2.52e-04)
bt
(2.33e-04)
string
(2.23e-04)
endian
(1.70e-04)
double
(1.67e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
num
child
shapes
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
get,child,transform
get
get
(9.52e-01)
child
(3.62e-02)
shape
(5.58e-03)
transform
(2.90e-03)
swig
(5.03e-04)
0
(3.75e-04)
compound
(3.36e-04)
return
(2.05e-04)
collision
(1.98e-04)
c
(1.42e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
child
transform
swig
0
(
swig
c
ptr
,
this
,
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
child
transform
swig
0
(
swig
c
ptr
,
this
,
index
)
;
}
<SENTENCE_END/>
child
child
(9.92e-01)
transform
(6.19e-03)
%END%
(5.93e-04)
get
(5.29e-04)
children
(4.34e-05)
string
(3.41e-05)
by
(2.85e-05)
node
(1.90e-05)
index
(1.86e-05)
insert
(1.84e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
child
transform
swig
0
(
swig
c
ptr
,
this
,
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
child
transform
swig
0
(
swig
c
ptr
,
this
,
index
)
;
}
<SENTENCE_END/>
transform
transform
(9.92e-01)
%END%
(5.78e-03)
child
(1.10e-03)
get
(4.01e-05)
0
(2.21e-05)
index
(2.20e-05)
jni
(1.78e-05)
collision
(1.52e-05)
%UNK%
(1.18e-05)
c
(1.10e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
child
transform
swig
0
(
swig
c
ptr
,
this
,
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
child
transform
swig
0
(
swig
c
ptr
,
this
,
index
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.46e-01)
transform
(4.45e-02)
%UNK%
(4.70e-04)
get
(4.32e-04)
swig
(4.30e-04)
bt
(3.32e-04)
c
(2.27e-04)
set
(1.51e-04)
string
(1.11e-04)
at
(1.03e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
child
transform
swig
0
(
swig
c
ptr
,
this
,
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
child
transform
swig
0
(
swig
c
ptr
,
this
,
index
)
;
}
<SENTENCE_END/>
update,child,transform
update
update
(9.35e-01)
child
(4.39e-02)
transform
(6.17e-03)
shape
(6.00e-03)
swig
(7.09e-04)
local
(6.71e-04)
should
(5.50e-04)
0
(5.50e-04)
compound
(5.37e-04)
recalculate
(5.21e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
0
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
,
should
recalculate
local
aabb
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
0
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
,
should
recalculate
local
aabb
)
;
}
<SENTENCE_END/>
child
child
(9.83e-01)
transform
(1.42e-02)
%END%
(1.32e-03)
update
(3.81e-04)
get
(1.30e-04)
string
(6.13e-05)
children
(5.95e-05)
insert
(5.94e-05)
%UNK%
(5.50e-05)
scissors
(4.65e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
0
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
,
should
recalculate
local
aabb
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
0
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
,
should
recalculate
local
aabb
)
;
}
<SENTENCE_END/>
transform
transform
(8.47e-01)
%END%
(1.41e-01)
child
(2.11e-03)
%UNK%
(1.23e-03)
get
(3.17e-04)
string
(3.09e-04)
at
(1.83e-04)
aabb
(1.41e-04)
c
(1.34e-04)
convex
(1.33e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
0
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
,
should
recalculate
local
aabb
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
0
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
,
should
recalculate
local
aabb
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.33e-01)
transform
(4.10e-02)
%UNK%
(4.12e-03)
string
(6.83e-04)
get
(6.52e-04)
at
(4.55e-04)
set
(4.47e-04)
c
(4.05e-04)
convex
(3.84e-04)
swig
(3.64e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
0
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
,
should
recalculate
local
aabb
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
0
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
,
should
recalculate
local
aabb
)
;
}
<SENTENCE_END/>
update,child,transform
update
update
(9.33e-01)
child
(4.83e-02)
shape
(6.34e-03)
transform
(6.03e-03)
swig
(6.36e-04)
1
(5.06e-04)
compound
(4.94e-04)
collision
(3.98e-04)
new
(3.91e-04)
index
(3.48e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
1
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
1
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
)
;
}
<SENTENCE_END/>
child
child
(9.84e-01)
transform
(1.35e-02)
%END%
(7.50e-04)
update
(4.13e-04)
get
(8.58e-05)
children
(6.06e-05)
insert
(3.70e-05)
at
(3.35e-05)
by
(2.90e-05)
string
(2.88e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
1
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
1
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
)
;
}
<SENTENCE_END/>
transform
transform
(8.81e-01)
%END%
(1.13e-01)
child
(2.07e-03)
%UNK%
(2.50e-04)
at
(1.66e-04)
string
(1.22e-04)
get
(1.16e-04)
set
(9.13e-05)
index
(8.39e-05)
c
(7.52e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
1
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
1
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.63e-01)
transform
(2.37e-02)
%UNK%
(1.02e-03)
at
(4.62e-04)
string
(3.47e-04)
swig
(3.31e-04)
set
(3.26e-04)
get
(2.68e-04)
c
(2.50e-04)
convex
(1.93e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
1
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
update
child
transform
swig
1
(
swig
c
ptr
,
this
,
child
index
,
new
child
transform
)
;
}
<SENTENCE_END/>
get,child,list
get
get
(9.73e-01)
child
(1.44e-02)
shape
(2.27e-03)
list
(2.03e-03)
ptr
(1.10e-03)
c
(9.63e-04)
compound
(5.37e-04)
bt
(3.19e-04)
return
(2.94e-04)
long
(2.51e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
child
list
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
compound
shape
child
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
child
list
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
compound
shape
child
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
child
child
(9.95e-01)
list
(2.38e-03)
%END%
(8.24e-04)
get
(7.82e-04)
c
(3.65e-05)
instance
(3.44e-05)
string
(2.69e-05)
%UNK%
(2.46e-05)
node
(2.09e-05)
name
(1.60e-05)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
child
list
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
compound
shape
child
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
child
list
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
compound
shape
child
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
list
list
(9.08e-01)
%END%
(7.61e-02)
child
(7.61e-03)
ptr
(1.14e-03)
c
(9.92e-04)
shape
(3.67e-04)
get
(2.86e-04)
compound
(2.79e-04)
long
(2.35e-04)
bt
(1.85e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
child
list
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
compound
shape
child
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
child
list
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
compound
shape
child
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.66e-01)
list
(2.55e-02)
c
(7.21e-04)
instance
(5.78e-04)
%UNK%
(4.36e-04)
get
(3.84e-04)
ptr
(2.42e-04)
child
(2.16e-04)
string
(2.03e-04)
bt
(2.01e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
child
list
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
compound
shape
child
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
child
list
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
compound
shape
child
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
recalculate,local,aabb
recalculate
local
(9.22e-01)
recalculate
(3.62e-02)
%UNK%
(2.57e-02)
aabb
(7.23e-03)
shape
(2.04e-03)
internal
(1.44e-03)
evaluate
(5.23e-04)
%END%
(3.26e-04)
to
(3.10e-04)
initialize
(2.55e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
recalculate
local
aabb
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
recalculate
local
aabb
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
local
local
(9.37e-01)
aabb
(5.67e-02)
%END%
(6.10e-03)
recalculate
(1.73e-04)
%UNK%
(9.82e-06)
valid
(5.56e-06)
internal
(4.88e-06)
c
(4.07e-06)
2
(3.20e-06)
collision
(2.56e-06)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
recalculate
local
aabb
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
recalculate
local
aabb
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
aabb
aabb
(8.75e-01)
%END%
(1.22e-01)
local
(1.01e-03)
%UNK%
(1.82e-05)
c
(1.22e-05)
ptr
(8.85e-06)
collision
(7.33e-06)
valid
(6.13e-06)
rad
(5.66e-06)
2
(5.14e-06)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
recalculate
local
aabb
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
recalculate
local
aabb
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.78e-01)
aabb
(1.97e-02)
%UNK%
(1.24e-04)
endian
(6.01e-05)
local
(5.72e-05)
rad
(4.21e-05)
bt
(3.97e-05)
2
(3.52e-05)
valid
(3.28e-05)
c
(2.63e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
recalculate
local
aabb
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
recalculate
local
aabb
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
get,dynamic,aabb,tree
get
get
(9.55e-01)
dynamic
(2.79e-02)
shape
(3.86e-03)
aabb
(3.31e-03)
tree
(1.84e-03)
ptr
(7.41e-04)
c
(6.74e-04)
swig
(4.54e-04)
compound
(3.47e-04)
0
(3.13e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
dynamic
dynamic
(9.85e-01)
aabb
(1.21e-02)
%END%
(2.21e-03)
get
(3.43e-04)
c
(9.42e-06)
tree
(8.01e-06)
ptr
(6.46e-06)
bt
(4.22e-06)
long
(3.99e-06)
instance
(3.82e-06)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
aabb
aabb
(9.65e-01)
tree
(3.09e-02)
dynamic
(3.15e-03)
%END%
(3.83e-04)
ptr
(1.29e-05)
c
(1.20e-05)
0
(7.35e-06)
jni
(5.29e-06)
bt
(5.09e-06)
get
(4.41e-06)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
tree
%END%
(6.03e-01)
tree
(3.77e-01)
aabb
(3.55e-03)
c
(5.75e-04)
ptr
(4.61e-04)
instance
(3.18e-04)
swig
(3.10e-04)
bt
(2.77e-04)
get
(2.70e-04)
%UNK%
(2.37e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.86e-01)
tree
(9.93e-02)
c
(6.70e-04)
aabb
(5.84e-04)
instance
(4.58e-04)
ptr
(4.51e-04)
bt
(3.45e-04)
%UNK%
(3.40e-04)
get
(3.28e-04)
swig
(3.26e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
compound
shape
get
dynamic
aabb
tree
swig
0
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
dbvt
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
create,aabb,tree,from,children
create
create
(9.33e-01)
aabb
(5.12e-02)
tree
(6.70e-03)
from
(2.30e-03)
shape
(2.28e-03)
children
(2.13e-03)
compound
(2.18e-04)
collision
(1.69e-04)
swig
(1.24e-04)
c
(1.07e-04)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
aabb
aabb
(8.83e-01)
tree
(1.14e-01)
%END%
(2.50e-03)
create
(9.86e-05)
from
(7.59e-05)
test
(1.30e-05)
triangle
(6.79e-06)
against
(5.65e-06)
convex
(4.63e-06)
%UNK%
(4.09e-06)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
tree
from
(4.99e-01)
tree
(4.95e-01)
children
(4.39e-03)
aabb
(7.65e-04)
%END%
(6.42e-04)
jni
(7.07e-06)
ptr
(6.86e-06)
collision
(5.89e-06)
this
(5.59e-06)
c
(5.19e-06)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
from
from
(5.26e-01)
children
(3.79e-01)
%END%
(8.93e-02)
tree
(4.77e-03)
jni
(5.69e-05)
ptr
(4.50e-05)
collision
(3.73e-05)
this
(3.46e-05)
aabb
(3.43e-05)
c
(3.25e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
children
%END%
(8.65e-01)
children
(1.22e-01)
from
(9.04e-03)
%UNK%
(1.53e-04)
rad
(7.34e-05)
2
(6.81e-05)
c
(6.69e-05)
bt
(6.20e-05)
shape
(5.05e-05)
jni
(4.84e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.65e-01)
children
(1.22e-01)
from
(8.98e-03)
%UNK%
(1.53e-04)
rad
(7.35e-05)
2
(6.82e-05)
c
(6.70e-05)
bt
(6.20e-05)
shape
(5.05e-05)
jni
(4.83e-05)
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
compound
shape
create
aabb
tree
from
children
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
calculate,principal,axis,transform
calculate
calculate
(8.97e-01)
principal
(8.04e-02)
axis
(8.34e-03)
shape
(4.24e-03)
transform
(1.65e-03)
masses
(6.32e-04)
direct
(4.46e-04)
compound
(4.41e-04)
assert
(3.82e-04)
swig
(3.59e-04)
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
principal
principal
(9.15e-01)
axis
(7.92e-02)
%UNK%
(2.73e-03)
%END%
(2.06e-03)
calculate
(3.37e-04)
get
(9.00e-05)
set
(6.54e-05)
transform
(3.29e-05)
from
(2.55e-05)
ray
(2.18e-05)
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
axis
axis
(8.21e-01)
transform
(1.75e-01)
%END%
(1.61e-03)
principal
(1.46e-03)
%UNK%
(1.06e-04)
jni
(1.61e-05)
masses
(1.42e-05)
inertia
(1.24e-05)
collision
(9.17e-06)
direct
(8.39e-06)
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
transform
transform
(7.82e-01)
%END%
(1.79e-01)
axis
(1.68e-02)
%UNK%
(6.53e-03)
set
(3.26e-04)
bt
(2.70e-04)
from
(2.39e-04)
get
(2.03e-04)
2
(2.00e-04)
at
(2.00e-04)
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(8.70e-01)
transform
(5.42e-02)
%UNK%
(2.48e-02)
set
(1.33e-03)
from
(1.13e-03)
bt
(1.13e-03)
2
(9.27e-04)
at
(8.82e-04)
get
(8.37e-04)
string
(7.77e-04)
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
masses
.
is
direct
(
)
:
"Buffer must be allocated direct."
;
{
collision
jni
.
bt
compound
shape
calculate
principal
axis
transform
(
swig
c
ptr
,
this
,
masses
,
principal
,
inertia
)
;
}
}
<SENTENCE_END/>
get,update,revision
get
get
(9.75e-01)
update
(1.61e-02)
shape
(3.58e-03)
revision
(1.92e-03)
compound
(3.29e-04)
return
(3.01e-04)
collision
(3.00e-04)
c
(2.10e-04)
jni
(1.55e-04)
ptr
(1.49e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
update
revision
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
update
revision
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
update
update
(9.70e-01)
revision
(2.92e-02)
get
(9.00e-05)
%UNK%
(7.84e-05)
%END%
(7.41e-05)
set
(2.86e-05)
collision
(5.47e-06)
action
(3.65e-06)
apply
(1.94e-06)
c
(1.80e-06)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
update
revision
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
update
revision
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
revision
revision
(7.95e-01)
%END%
(1.98e-01)
update
(1.33e-03)
jni
(2.40e-04)
collision
(2.21e-04)
%UNK%
(1.82e-04)
c
(1.55e-04)
ptr
(1.43e-04)
this
(9.12e-05)
compound
(7.43e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
update
revision
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
update
revision
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.78e-01)
revision
(1.94e-02)
%UNK%
(1.35e-04)
bt
(9.50e-05)
endian
(9.23e-05)
update
(8.50e-05)
c
(5.69e-05)
rad
(5.31e-05)
shape
(4.72e-05)
swig
(4.51e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
update
revision
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
compound
shape
get
update
revision
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
get,c,ptr
get
get
(9.83e-01)
c
(4.72e-03)
obj
(1.88e-03)
swig
(1.36e-03)
is
(8.93e-04)
return
(8.85e-04)
ptr
(5.54e-04)
0
(3.63e-04)
null
(3.14e-04)
obtain
(2.82e-04)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
c
c
(9.96e-01)
ptr
(2.00e-03)
get
(1.04e-03)
%END%
(8.72e-04)
swig
(1.90e-04)
instance
(1.07e-04)
overlaps
(3.51e-05)
derived
(2.62e-05)
match
(7.06e-06)
is
(6.12e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
ptr
ptr
(9.96e-01)
c
(2.15e-03)
%END%
(1.61e-03)
obj
(1.88e-05)
0
(6.12e-06)
get
(6.07e-06)
return
(5.61e-06)
string
(2.74e-06)
instance
(2.57e-06)
swig
(2.31e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
%END%
%END%
(9.61e-01)
ptr
(3.23e-02)
obj
(8.25e-04)
c
(4.05e-04)
return
(2.33e-04)
string
(2.06e-04)
double
(1.33e-04)
at
(1.02e-04)
0
(9.89e-05)
swig
(5.39e-05)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
fill
fill
reset
(3.72e-01)
set
(1.47e-01)
setup
(4.94e-02)
init
(4.85e-02)
read
(3.96e-02)
%UNK%
(2.50e-02)
seek
(2.11e-02)
touch
(2.04e-02)
end
(1.98e-02)
cancel
(1.27e-02)
<SENTENCE_START>
{
position
=
0
;
limit
=
in
.
read
(
buffer
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
position
=
0
;
limit
=
in
.
read
(
buffer
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.64e-01)
buffer
(7.76e-03)
in
(1.97e-03)
position
(1.41e-03)
%UNK%
(1.28e-03)
short
(9.38e-04)
down
(7.97e-04)
at
(7.41e-04)
long
(7.40e-04)
byte
(5.42e-04)
<SENTENCE_START>
{
position
=
0
;
limit
=
in
.
read
(
buffer
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
position
=
0
;
limit
=
in
.
read
(
buffer
)
;
}
<SENTENCE_END/>
read,line
read
to
(3.66e-01)
get
(8.87e-02)
%UNK%
(5.30e-02)
string
(4.53e-02)
read
(2.88e-02)
%END%
(1.45e-02)
encode
(1.37e-02)
is
(1.15e-02)
index
(1.14e-02)
print
(1.12e-02)
<SENTENCE_START>
{
string
builder
sb
=
new
string
builder
(
)
;
while
(
true
)
{
if
(
position
>=
limit
)
{
fill
(
)
;
}
if
(
position
>=
limit
)
{
return
sb
.
length
(
)
==
0
?
null
:
sb
.
to
string
(
)
;
}
for
(
int
i
=
position
;
i
<
limit
;
++
i
)
{
if
(
buffer
[
i
]
==
'|r'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
if
(
i
+
1
<
limit
)
{
if
(
buffer
[
i
+
1
]
==
'|n'
)
{
position
=
i
+
2
;
}
}
else
{
fill
(
)
;
if
(
buffer
[
position
]
==
'|n'
)
{
position
+=
1
;
}
}
return
sb
.
to
string
(
)
;
}
else
if
(
buffer
[
i
]
==
'|n'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
return
sb
.
to
string
(
)
;
}
}
sb
.
append
(
buffer
,
position
,
limit
-
position
)
;
position
=
limit
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
builder
sb
=
new
string
builder
(
)
;
while
(
true
)
{
if
(
position
>=
limit
)
{
fill
(
)
;
}
if
(
position
>=
limit
)
{
return
sb
.
length
(
)
==
0
?
null
:
sb
.
to
string
(
)
;
}
for
(
int
i
=
position
;
i
<
limit
;
++
i
)
{
if
(
buffer
[
i
]
==
'|r'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
if
(
i
+
1
<
limit
)
{
if
(
buffer
[
i
+
1
]
==
'|n'
)
{
position
=
i
+
2
;
}
}
else
{
fill
(
)
;
if
(
buffer
[
position
]
==
'|n'
)
{
position
+=
1
;
}
}
return
sb
.
to
string
(
)
;
}
else
if
(
buffer
[
i
]
==
'|n'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
return
sb
.
to
string
(
)
;
}
}
sb
.
append
(
buffer
,
position
,
limit
-
position
)
;
position
=
limit
;
}
}
<SENTENCE_END/>
line
%END%
(6.15e-01)
string
(5.24e-02)
to
(4.74e-02)
at
(1.74e-02)
%UNK%
(1.28e-02)
position
(1.01e-02)
sb
(9.48e-03)
buffer
(8.27e-03)
index
(7.45e-03)
limit
(6.04e-03)
<SENTENCE_START>
{
string
builder
sb
=
new
string
builder
(
)
;
while
(
true
)
{
if
(
position
>=
limit
)
{
fill
(
)
;
}
if
(
position
>=
limit
)
{
return
sb
.
length
(
)
==
0
?
null
:
sb
.
to
string
(
)
;
}
for
(
int
i
=
position
;
i
<
limit
;
++
i
)
{
if
(
buffer
[
i
]
==
'|r'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
if
(
i
+
1
<
limit
)
{
if
(
buffer
[
i
+
1
]
==
'|n'
)
{
position
=
i
+
2
;
}
}
else
{
fill
(
)
;
if
(
buffer
[
position
]
==
'|n'
)
{
position
+=
1
;
}
}
return
sb
.
to
string
(
)
;
}
else
if
(
buffer
[
i
]
==
'|n'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
return
sb
.
to
string
(
)
;
}
}
sb
.
append
(
buffer
,
position
,
limit
-
position
)
;
position
=
limit
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
builder
sb
=
new
string
builder
(
)
;
while
(
true
)
{
if
(
position
>=
limit
)
{
fill
(
)
;
}
if
(
position
>=
limit
)
{
return
sb
.
length
(
)
==
0
?
null
:
sb
.
to
string
(
)
;
}
for
(
int
i
=
position
;
i
<
limit
;
++
i
)
{
if
(
buffer
[
i
]
==
'|r'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
if
(
i
+
1
<
limit
)
{
if
(
buffer
[
i
+
1
]
==
'|n'
)
{
position
=
i
+
2
;
}
}
else
{
fill
(
)
;
if
(
buffer
[
position
]
==
'|n'
)
{
position
+=
1
;
}
}
return
sb
.
to
string
(
)
;
}
else
if
(
buffer
[
i
]
==
'|n'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
return
sb
.
to
string
(
)
;
}
}
sb
.
append
(
buffer
,
position
,
limit
-
position
)
;
position
=
limit
;
}
}
<SENTENCE_END/>
%END%
%END%
(8.69e-01)
string
(1.47e-02)
at
(9.47e-03)
to
(8.42e-03)
position
(4.82e-03)
%UNK%
(3.30e-03)
sb
(3.15e-03)
index
(2.74e-03)
buffer
(2.28e-03)
and
(1.99e-03)
<SENTENCE_START>
{
string
builder
sb
=
new
string
builder
(
)
;
while
(
true
)
{
if
(
position
>=
limit
)
{
fill
(
)
;
}
if
(
position
>=
limit
)
{
return
sb
.
length
(
)
==
0
?
null
:
sb
.
to
string
(
)
;
}
for
(
int
i
=
position
;
i
<
limit
;
++
i
)
{
if
(
buffer
[
i
]
==
'|r'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
if
(
i
+
1
<
limit
)
{
if
(
buffer
[
i
+
1
]
==
'|n'
)
{
position
=
i
+
2
;
}
}
else
{
fill
(
)
;
if
(
buffer
[
position
]
==
'|n'
)
{
position
+=
1
;
}
}
return
sb
.
to
string
(
)
;
}
else
if
(
buffer
[
i
]
==
'|n'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
return
sb
.
to
string
(
)
;
}
}
sb
.
append
(
buffer
,
position
,
limit
-
position
)
;
position
=
limit
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
builder
sb
=
new
string
builder
(
)
;
while
(
true
)
{
if
(
position
>=
limit
)
{
fill
(
)
;
}
if
(
position
>=
limit
)
{
return
sb
.
length
(
)
==
0
?
null
:
sb
.
to
string
(
)
;
}
for
(
int
i
=
position
;
i
<
limit
;
++
i
)
{
if
(
buffer
[
i
]
==
'|r'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
if
(
i
+
1
<
limit
)
{
if
(
buffer
[
i
+
1
]
==
'|n'
)
{
position
=
i
+
2
;
}
}
else
{
fill
(
)
;
if
(
buffer
[
position
]
==
'|n'
)
{
position
+=
1
;
}
}
return
sb
.
to
string
(
)
;
}
else
if
(
buffer
[
i
]
==
'|n'
)
{
sb
.
append
(
buffer
,
position
,
i
-
position
)
;
position
=
i
+
1
;
return
sb
.
to
string
(
)
;
}
}
sb
.
append
(
buffer
,
position
,
limit
-
position
)
;
position
=
limit
;
}
}
<SENTENCE_END/>
read
read
slice
(3.72e-01)
read
(1.10e-01)
%END%
(4.27e-02)
fully
(3.61e-02)
length
(3.34e-02)
add
(2.22e-02)
insert
(2.15e-02)
sort
(2.13e-02)
decode
(1.96e-02)
%UNK%
(1.88e-02)
<SENTENCE_START>
{
int
count
=
0
;
if
(
position
>=
limit
&&
length
<
buffer
.
length
)
{
fill
(
)
;
}
if
(
position
<
limit
)
{
int
remaining
=
limit
-
position
;
if
(
remaining
>
length
)
{
remaining
=
length
;
}
system
.
arraycopy
(
buffer
,
position
,
b
,
offset
,
remaining
)
;
count
+=
remaining
;
position
+=
remaining
;
offset
+=
remaining
;
length
-=
remaining
;
}
if
(
length
>
0
)
{
int
c
=
in
.
%SELF%
(
b
,
offset
,
length
)
;
if
(
c
==
-
1
)
{
if
(
count
==
0
)
{
count
=
-
1
;
}
}
else
{
count
+=
c
;
}
}
return
count
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
count
=
0
;
if
(
position
>=
limit
&&
length
<
buffer
.
length
)
{
fill
(
)
;
}
if
(
position
<
limit
)
{
int
remaining
=
limit
-
position
;
if
(
remaining
>
length
)
{
remaining
=
length
;
}
system
.
arraycopy
(
buffer
,
position
,
b
,
offset
,
remaining
)
;
count
+=
remaining
;
position
+=
remaining
;
offset
+=
remaining
;
length
-=
remaining
;
}
if
(
length
>
0
)
{
int
c
=
in
.
%SELF%
(
b
,
offset
,
length
)
;
if
(
c
==
-
1
)
{
if
(
count
==
0
)
{
count
=
-
1
;
}
}
else
{
count
+=
c
;
}
}
return
count
;
}
<SENTENCE_END/>
%END%
%END%
(9.00e-01)
all
(3.60e-03)
length
(3.05e-03)
count
(3.05e-03)
%UNK%
(2.91e-03)
to
(2.82e-03)
fully
(2.41e-03)
array
(2.26e-03)
read
(2.13e-03)
0
(2.03e-03)
<SENTENCE_START>
{
int
count
=
0
;
if
(
position
>=
limit
&&
length
<
buffer
.
length
)
{
fill
(
)
;
}
if
(
position
<
limit
)
{
int
remaining
=
limit
-
position
;
if
(
remaining
>
length
)
{
remaining
=
length
;
}
system
.
arraycopy
(
buffer
,
position
,
b
,
offset
,
remaining
)
;
count
+=
remaining
;
position
+=
remaining
;
offset
+=
remaining
;
length
-=
remaining
;
}
if
(
length
>
0
)
{
int
c
=
in
.
%SELF%
(
b
,
offset
,
length
)
;
if
(
c
==
-
1
)
{
if
(
count
==
0
)
{
count
=
-
1
;
}
}
else
{
count
+=
c
;
}
}
return
count
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
count
=
0
;
if
(
position
>=
limit
&&
length
<
buffer
.
length
)
{
fill
(
)
;
}
if
(
position
<
limit
)
{
int
remaining
=
limit
-
position
;
if
(
remaining
>
length
)
{
remaining
=
length
;
}
system
.
arraycopy
(
buffer
,
position
,
b
,
offset
,
remaining
)
;
count
+=
remaining
;
position
+=
remaining
;
offset
+=
remaining
;
length
-=
remaining
;
}
if
(
length
>
0
)
{
int
c
=
in
.
%SELF%
(
b
,
offset
,
length
)
;
if
(
c
==
-
1
)
{
if
(
count
==
0
)
{
count
=
-
1
;
}
}
else
{
count
+=
c
;
}
}
return
count
;
}
<SENTENCE_END/>
close
close
in
(2.39e-01)
close
(2.13e-01)
%UNK%
(1.30e-01)
end
(3.92e-02)
update
(3.76e-02)
nearest
(3.06e-02)
flush
(2.75e-02)
read
(1.53e-02)
%END%
(1.25e-02)
touch
(1.03e-02)
<SENTENCE_START>
{
in
.
%SELF%
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
in
.
%SELF%
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.69e-01)
in
(7.65e-03)
%UNK%
(2.38e-03)
at
(4.33e-04)
all
(4.31e-04)
close
(3.87e-04)
frustum
(3.42e-04)
count
(3.33e-04)
up
(3.33e-04)
layout
(3.19e-04)
<SENTENCE_START>
{
in
.
%SELF%
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
in
.
%SELF%
(
)
;
}
<SENTENCE_END/>
main
main
main
(6.55e-01)
%END%
(2.11e-01)
setup
(9.21e-03)
build
(9.00e-03)
%UNK%
(6.21e-03)
create
(5.83e-03)
run
(4.23e-03)
load
(4.11e-03)
target
(3.82e-03)
init
(3.21e-03)
<SENTENCE_START>
{
new
native
code
generator
(
)
.
generate
(
"src/"
,
"bin/"
,
"jni/"
)
;
build
config
build
config
=
new
build
config
(
"gdx-controllers-desktop"
)
;
string
[
]
windows
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/win32/*.cpp"
}
;
string
[
]
linux
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/linux/*.cpp"
}
;
string
[
]
mac
64
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/mac/*.mm"
,
"ois-v1-4svn/src/mac/MacHIDManager.cpp"
,
"ois-v1-4svn/src/mac/MacJoyStick.cpp"
}
;
string
[
]
includes
=
new
string
[
]
{
"ois-v1-4svn/includes"
,
"dinput/"
}
;
build
target
win
32
home
=
build
target
.
new
default
target
(
target
os
.
windows
,
false
)
;
win
32
home
.
build
file
name
=
"build-windows32home.xml"
;
win
32
home
.
exclude
from
master
build
file
=
true
;
win
32
home
.
is
64
bit
=
false
;
win
32
home
.
compiler
prefix
=
""
;
win
32
home
.
cpp
includes
=
windows
src
;
win
32
home
.
header
dirs
=
includes
;
win
32
home
.
c
includes
=
new
string
[
0
]
;
win
32
home
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
win
32
=
build
target
.
new
default
target
(
target
os
.
windows
,
false
)
;
win
32
.
cpp
includes
=
windows
src
;
win
32
.
header
dirs
=
includes
;
win
32
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
win
64
=
build
target
.
new
default
target
(
target
os
.
windows
,
true
)
;
win
64
.
cpp
includes
=
windows
src
;
win
64
.
header
dirs
=
includes
;
win
64
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
lin
32
=
build
target
.
new
default
target
(
target
os
.
linux
,
false
)
;
lin
32
.
cpp
includes
=
linux
src
;
lin
32
.
header
dirs
=
includes
;
lin
32
.
libraries
=
"-lX11"
;
build
target
lin
64
=
build
target
.
new
default
target
(
target
os
.
linux
,
true
)
;
lin
64
.
cpp
includes
=
linux
src
;
lin
64
.
header
dirs
=
includes
;
lin
64
.
libraries
=
"-lX11"
;
build
target
mac
=
build
target
.
new
default
target
(
target
os
.
mac
os
x
,
false
)
;
mac
.
cpp
includes
=
mac
64
src
;
mac
.
header
dirs
=
includes
;
mac
.
cpp
flags
+=
" -x objective-c++"
;
mac
.
libraries
=
"-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa"
;
build
target
mac
64
=
build
target
.
new
default
target
(
target
os
.
mac
os
x
,
true
)
;
mac
64
.
cpp
includes
=
mac
64
src
;
mac
64
.
header
dirs
=
includes
;
mac
64
.
cpp
flags
+=
" -x objective-c++"
;
mac
64
.
libraries
=
"-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa"
;
new
ant
script
generator
(
)
.
generate
(
build
config
,
win
32
home
,
win
32
,
win
64
,
lin
32
,
lin
64
,
mac
,
mac
64
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
new
native
code
generator
(
)
.
generate
(
"src/"
,
"bin/"
,
"jni/"
)
;
build
config
build
config
=
new
build
config
(
"gdx-controllers-desktop"
)
;
string
[
]
windows
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/win32/*.cpp"
}
;
string
[
]
linux
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/linux/*.cpp"
}
;
string
[
]
mac
64
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/mac/*.mm"
,
"ois-v1-4svn/src/mac/MacHIDManager.cpp"
,
"ois-v1-4svn/src/mac/MacJoyStick.cpp"
}
;
string
[
]
includes
=
new
string
[
]
{
"ois-v1-4svn/includes"
,
"dinput/"
}
;
build
target
win
32
home
=
build
target
.
new
default
target
(
target
os
.
windows
,
false
)
;
win
32
home
.
build
file
name
=
"build-windows32home.xml"
;
win
32
home
.
exclude
from
master
build
file
=
true
;
win
32
home
.
is
64
bit
=
false
;
win
32
home
.
compiler
prefix
=
""
;
win
32
home
.
cpp
includes
=
windows
src
;
win
32
home
.
header
dirs
=
includes
;
win
32
home
.
c
includes
=
new
string
[
0
]
;
win
32
home
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
win
32
=
build
target
.
new
default
target
(
target
os
.
windows
,
false
)
;
win
32
.
cpp
includes
=
windows
src
;
win
32
.
header
dirs
=
includes
;
win
32
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
win
64
=
build
target
.
new
default
target
(
target
os
.
windows
,
true
)
;
win
64
.
cpp
includes
=
windows
src
;
win
64
.
header
dirs
=
includes
;
win
64
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
lin
32
=
build
target
.
new
default
target
(
target
os
.
linux
,
false
)
;
lin
32
.
cpp
includes
=
linux
src
;
lin
32
.
header
dirs
=
includes
;
lin
32
.
libraries
=
"-lX11"
;
build
target
lin
64
=
build
target
.
new
default
target
(
target
os
.
linux
,
true
)
;
lin
64
.
cpp
includes
=
linux
src
;
lin
64
.
header
dirs
=
includes
;
lin
64
.
libraries
=
"-lX11"
;
build
target
mac
=
build
target
.
new
default
target
(
target
os
.
mac
os
x
,
false
)
;
mac
.
cpp
includes
=
mac
64
src
;
mac
.
header
dirs
=
includes
;
mac
.
cpp
flags
+=
" -x objective-c++"
;
mac
.
libraries
=
"-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa"
;
build
target
mac
64
=
build
target
.
new
default
target
(
target
os
.
mac
os
x
,
true
)
;
mac
64
.
cpp
includes
=
mac
64
src
;
mac
64
.
header
dirs
=
includes
;
mac
64
.
cpp
flags
+=
" -x objective-c++"
;
mac
64
.
libraries
=
"-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa"
;
new
ant
script
generator
(
)
.
generate
(
build
config
,
win
32
home
,
win
32
,
win
64
,
lin
32
,
lin
64
,
mac
,
mac
64
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.47e-01)
main
(5.61e-02)
target
(7.94e-03)
includes
(4.56e-03)
build
(4.45e-03)
%UNK%
(3.78e-03)
32
(2.85e-03)
win
(2.82e-03)
64
(2.78e-03)
mac
(1.99e-03)
<SENTENCE_START>
{
new
native
code
generator
(
)
.
generate
(
"src/"
,
"bin/"
,
"jni/"
)
;
build
config
build
config
=
new
build
config
(
"gdx-controllers-desktop"
)
;
string
[
]
windows
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/win32/*.cpp"
}
;
string
[
]
linux
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/linux/*.cpp"
}
;
string
[
]
mac
64
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/mac/*.mm"
,
"ois-v1-4svn/src/mac/MacHIDManager.cpp"
,
"ois-v1-4svn/src/mac/MacJoyStick.cpp"
}
;
string
[
]
includes
=
new
string
[
]
{
"ois-v1-4svn/includes"
,
"dinput/"
}
;
build
target
win
32
home
=
build
target
.
new
default
target
(
target
os
.
windows
,
false
)
;
win
32
home
.
build
file
name
=
"build-windows32home.xml"
;
win
32
home
.
exclude
from
master
build
file
=
true
;
win
32
home
.
is
64
bit
=
false
;
win
32
home
.
compiler
prefix
=
""
;
win
32
home
.
cpp
includes
=
windows
src
;
win
32
home
.
header
dirs
=
includes
;
win
32
home
.
c
includes
=
new
string
[
0
]
;
win
32
home
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
win
32
=
build
target
.
new
default
target
(
target
os
.
windows
,
false
)
;
win
32
.
cpp
includes
=
windows
src
;
win
32
.
header
dirs
=
includes
;
win
32
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
win
64
=
build
target
.
new
default
target
(
target
os
.
windows
,
true
)
;
win
64
.
cpp
includes
=
windows
src
;
win
64
.
header
dirs
=
includes
;
win
64
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
lin
32
=
build
target
.
new
default
target
(
target
os
.
linux
,
false
)
;
lin
32
.
cpp
includes
=
linux
src
;
lin
32
.
header
dirs
=
includes
;
lin
32
.
libraries
=
"-lX11"
;
build
target
lin
64
=
build
target
.
new
default
target
(
target
os
.
linux
,
true
)
;
lin
64
.
cpp
includes
=
linux
src
;
lin
64
.
header
dirs
=
includes
;
lin
64
.
libraries
=
"-lX11"
;
build
target
mac
=
build
target
.
new
default
target
(
target
os
.
mac
os
x
,
false
)
;
mac
.
cpp
includes
=
mac
64
src
;
mac
.
header
dirs
=
includes
;
mac
.
cpp
flags
+=
" -x objective-c++"
;
mac
.
libraries
=
"-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa"
;
build
target
mac
64
=
build
target
.
new
default
target
(
target
os
.
mac
os
x
,
true
)
;
mac
64
.
cpp
includes
=
mac
64
src
;
mac
64
.
header
dirs
=
includes
;
mac
64
.
cpp
flags
+=
" -x objective-c++"
;
mac
64
.
libraries
=
"-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa"
;
new
ant
script
generator
(
)
.
generate
(
build
config
,
win
32
home
,
win
32
,
win
64
,
lin
32
,
lin
64
,
mac
,
mac
64
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
new
native
code
generator
(
)
.
generate
(
"src/"
,
"bin/"
,
"jni/"
)
;
build
config
build
config
=
new
build
config
(
"gdx-controllers-desktop"
)
;
string
[
]
windows
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/win32/*.cpp"
}
;
string
[
]
linux
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/linux/*.cpp"
}
;
string
[
]
mac
64
src
=
{
"*.cpp"
,
"ois-v1-4svn/src/*.cpp"
,
"ois-v1-4svn/src/mac/*.mm"
,
"ois-v1-4svn/src/mac/MacHIDManager.cpp"
,
"ois-v1-4svn/src/mac/MacJoyStick.cpp"
}
;
string
[
]
includes
=
new
string
[
]
{
"ois-v1-4svn/includes"
,
"dinput/"
}
;
build
target
win
32
home
=
build
target
.
new
default
target
(
target
os
.
windows
,
false
)
;
win
32
home
.
build
file
name
=
"build-windows32home.xml"
;
win
32
home
.
exclude
from
master
build
file
=
true
;
win
32
home
.
is
64
bit
=
false
;
win
32
home
.
compiler
prefix
=
""
;
win
32
home
.
cpp
includes
=
windows
src
;
win
32
home
.
header
dirs
=
includes
;
win
32
home
.
c
includes
=
new
string
[
0
]
;
win
32
home
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
win
32
=
build
target
.
new
default
target
(
target
os
.
windows
,
false
)
;
win
32
.
cpp
includes
=
windows
src
;
win
32
.
header
dirs
=
includes
;
win
32
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
win
64
=
build
target
.
new
default
target
(
target
os
.
windows
,
true
)
;
win
64
.
cpp
includes
=
windows
src
;
win
64
.
header
dirs
=
includes
;
win
64
.
libraries
=
"-ldinput8 -ldxguid"
;
build
target
lin
32
=
build
target
.
new
default
target
(
target
os
.
linux
,
false
)
;
lin
32
.
cpp
includes
=
linux
src
;
lin
32
.
header
dirs
=
includes
;
lin
32
.
libraries
=
"-lX11"
;
build
target
lin
64
=
build
target
.
new
default
target
(
target
os
.
linux
,
true
)
;
lin
64
.
cpp
includes
=
linux
src
;
lin
64
.
header
dirs
=
includes
;
lin
64
.
libraries
=
"-lX11"
;
build
target
mac
=
build
target
.
new
default
target
(
target
os
.
mac
os
x
,
false
)
;
mac
.
cpp
includes
=
mac
64
src
;
mac
.
header
dirs
=
includes
;
mac
.
cpp
flags
+=
" -x objective-c++"
;
mac
.
libraries
=
"-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa"
;
build
target
mac
64
=
build
target
.
new
default
target
(
target
os
.
mac
os
x
,
true
)
;
mac
64
.
cpp
includes
=
mac
64
src
;
mac
64
.
header
dirs
=
includes
;
mac
64
.
cpp
flags
+=
" -x objective-c++"
;
mac
64
.
libraries
=
"-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa"
;
new
ant
script
generator
(
)
.
generate
(
build
config
,
win
32
home
,
win
32
,
win
64
,
lin
32
,
lin
64
,
mac
,
mac
64
)
;
}
<SENTENCE_END/>
get,c,ptr
get
get
(9.83e-01)
c
(4.72e-03)
obj
(1.88e-03)
swig
(1.36e-03)
is
(8.93e-04)
return
(8.85e-04)
ptr
(5.54e-04)
0
(3.63e-04)
null
(3.14e-04)
obtain
(2.82e-04)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
c
c
(9.96e-01)
ptr
(2.00e-03)
get
(1.04e-03)
%END%
(8.72e-04)
swig
(1.90e-04)
instance
(1.07e-04)
overlaps
(3.51e-05)
derived
(2.62e-05)
match
(7.06e-06)
is
(6.12e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
ptr
ptr
(9.96e-01)
c
(2.15e-03)
%END%
(1.61e-03)
obj
(1.88e-05)
0
(6.12e-06)
get
(6.07e-06)
return
(5.61e-06)
string
(2.74e-06)
instance
(2.57e-06)
swig
(2.31e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
%END%
%END%
(9.61e-01)
ptr
(3.23e-02)
obj
(8.25e-04)
c
(4.05e-04)
return
(2.33e-04)
string
(2.06e-04)
double
(1.33e-04)
at
(1.02e-04)
0
(9.89e-05)
swig
(5.39e-05)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
set,lower,limit
set
set
(9.86e-01)
limit
(5.92e-03)
lower
(4.23e-03)
motor
(1.02e-03)
c
(3.09e-04)
ptr
(2.42e-04)
get
(1.69e-04)
value
(1.38e-04)
bt
(1.11e-04)
swig
(8.35e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
lower
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
lower
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
lower
lower
(6.02e-01)
limit
(3.95e-01)
%END%
(2.51e-03)
motor
(1.86e-04)
set
(1.21e-04)
get
(2.11e-05)
c
(1.14e-05)
bt
(4.99e-06)
swig
(4.45e-06)
double
(4.36e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
lower
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
lower
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
limit
limit
(9.16e-01)
%END%
(7.13e-02)
lower
(6.69e-03)
set
(4.60e-03)
ptr
(1.13e-04)
c
(9.99e-05)
motor
(7.91e-05)
bt
(6.31e-05)
value
(6.12e-05)
3
(4.83e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
lower
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
lower
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.53e-01)
limit
(2.27e-02)
set
(1.90e-02)
bt
(6.52e-04)
endian
(2.94e-04)
%UNK%
(2.44e-04)
lower
(1.97e-04)
c
(1.63e-04)
value
(1.52e-04)
ptr
(1.38e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
lower
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
lower
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,lower,limit
get
get
(9.83e-01)
limit
(6.85e-03)
lower
(4.21e-03)
motor
(1.07e-03)
ptr
(6.54e-04)
c
(5.92e-04)
long
(2.05e-04)
return
(1.61e-04)
bt
(1.57e-04)
3
(1.20e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
lower
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
lower
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
lower
limit
(5.13e-01)
lower
(4.84e-01)
%END%
(2.97e-03)
motor
(4.05e-04)
get
(1.56e-04)
c
(3.71e-05)
ptr
(1.66e-05)
set
(1.53e-05)
instance
(1.31e-05)
long
(1.28e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
lower
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
lower
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
limit
limit
(8.98e-01)
%END%
(8.24e-02)
lower
(1.12e-02)
get
(4.78e-03)
ptr
(5.48e-04)
c
(4.60e-04)
motor
(2.49e-04)
bt
(1.06e-04)
long
(9.86e-05)
false
(9.74e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
lower
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
lower
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.59e-01)
limit
(2.23e-02)
get
(1.31e-02)
c
(5.51e-04)
bt
(2.99e-04)
ptr
(2.81e-04)
instance
(2.56e-04)
%UNK%
(2.45e-04)
lower
(1.98e-04)
double
(1.69e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
lower
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
lower
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,upper,limit
set
set
(9.86e-01)
limit
(6.37e-03)
upper
(4.12e-03)
motor
(8.98e-04)
c
(2.76e-04)
ptr
(2.16e-04)
get
(1.49e-04)
value
(1.21e-04)
bt
(9.60e-05)
swig
(7.41e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
upper
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
upper
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
upper
upper
(5.28e-01)
limit
(4.69e-01)
%END%
(2.88e-03)
motor
(1.44e-04)
set
(9.09e-05)
get
(1.40e-05)
c
(1.00e-05)
bt
(4.13e-06)
double
(3.99e-06)
value
(3.76e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
upper
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
upper
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
limit
limit
(9.07e-01)
%END%
(8.12e-02)
upper
(5.86e-03)
set
(5.22e-03)
ptr
(1.27e-04)
c
(1.13e-04)
value
(6.94e-05)
bt
(6.66e-05)
motor
(6.05e-05)
3
(5.18e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
upper
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
upper
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.57e-01)
limit
(2.01e-02)
set
(1.78e-02)
bt
(6.32e-04)
endian
(2.87e-04)
%UNK%
(2.42e-04)
c
(1.51e-04)
upper
(1.49e-04)
value
(1.41e-04)
double
(1.31e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
upper
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
upper
limit
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,upper,limit
get
get
(9.83e-01)
limit
(7.32e-03)
upper
(4.15e-03)
motor
(9.57e-04)
ptr
(5.85e-04)
c
(5.30e-04)
long
(1.85e-04)
return
(1.46e-04)
bt
(1.37e-04)
3
(1.07e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
upper
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
upper
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
upper
limit
(5.86e-01)
upper
(4.10e-01)
%END%
(2.65e-03)
motor
(2.90e-04)
get
(1.15e-04)
c
(2.83e-05)
ptr
(1.41e-05)
long
(1.10e-05)
instance
(9.78e-06)
set
(8.86e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
upper
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
upper
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
limit
limit
(8.85e-01)
%END%
(9.61e-02)
upper
(9.90e-03)
get
(5.13e-03)
ptr
(6.25e-04)
c
(5.21e-04)
motor
(1.97e-04)
bt
(1.19e-04)
long
(1.16e-04)
false
(1.12e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
upper
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
upper
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.61e-01)
limit
(2.04e-02)
get
(1.26e-02)
c
(5.42e-04)
bt
(2.98e-04)
ptr
(2.74e-04)
instance
(2.62e-04)
%UNK%
(2.53e-04)
double
(1.73e-04)
upper
(1.60e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
upper
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
upper
limit
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,accumulated,impulse
set
set
(9.80e-01)
impulse
(8.46e-03)
accumulated
(7.21e-03)
motor
(1.91e-03)
limit
(4.08e-04)
c
(2.55e-04)
ptr
(1.94e-04)
get
(1.41e-04)
value
(1.10e-04)
translational
(1.01e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
accumulated
accumulated
(6.10e-01)
impulse
(3.87e-01)
%END%
(1.86e-03)
motor
(4.11e-04)
set
(8.52e-05)
get
(4.22e-05)
%UNK%
(1.49e-05)
c
(8.15e-06)
limit
(5.79e-06)
bt
(5.59e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
impulse
impulse
(9.77e-01)
%END%
(1.11e-02)
accumulated
(6.13e-03)
set
(5.56e-03)
motor
(4.96e-05)
ptr
(1.84e-05)
c
(1.59e-05)
bt
(1.17e-05)
value
(9.63e-06)
3
(6.80e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.46e-01)
impulse
(2.82e-02)
set
(2.08e-02)
bt
(6.17e-04)
endian
(2.75e-04)
%UNK%
(2.67e-04)
accumulated
(1.36e-04)
double
(1.09e-04)
c
(1.08e-04)
value
(1.04e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,accumulated,impulse
get
get
(9.79e-01)
impulse
(8.60e-03)
accumulated
(6.44e-03)
motor
(1.78e-03)
ptr
(5.40e-04)
c
(4.80e-04)
limit
(4.15e-04)
long
(1.67e-04)
bt
(1.34e-04)
return
(1.25e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
accumulated
accumulated
(5.16e-01)
impulse
(4.81e-01)
%END%
(2.31e-03)
motor
(6.99e-04)
get
(2.07e-04)
c
(2.71e-05)
%UNK%
(1.80e-05)
limit
(1.38e-05)
ptr
(1.36e-05)
instance
(1.22e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
impulse
impulse
(9.69e-01)
%END%
(1.58e-02)
accumulated
(9.16e-03)
get
(5.20e-03)
motor
(1.37e-04)
ptr
(1.18e-04)
c
(9.32e-05)
long
(2.36e-05)
bt
(2.11e-05)
false
(1.83e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.45e-01)
impulse
(3.32e-02)
get
(1.71e-02)
c
(4.68e-04)
instance
(2.77e-04)
bt
(2.67e-04)
%UNK%
(2.64e-04)
ptr
(1.72e-04)
accumulated
(1.64e-04)
double
(1.50e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
accumulated
impulse
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,limit,softness
set
set
(9.88e-01)
softness
(7.09e-03)
limit
(3.44e-03)
motor
(4.80e-04)
c
(9.59e-05)
ptr
(8.90e-05)
this
(8.62e-05)
swig
(7.40e-05)
dynamics
(6.04e-05)
jni
(5.01e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
limit
softness
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
limit
softness
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
limit
softness
(9.07e-01)
limit
(9.07e-02)
%END%
(1.83e-03)
set
(1.04e-04)
get
(1.38e-05)
motor
(9.04e-06)
%START%
(4.36e-06)
value
(1.94e-06)
c
(1.82e-06)
swig
(1.80e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
limit
softness
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
limit
softness
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
softness
softness
(5.64e-01)
%END%
(4.18e-01)
set
(1.45e-02)
limit
(1.44e-03)
dynamics
(1.21e-04)
value
(1.15e-04)
c
(8.49e-05)
jni
(7.38e-05)
bt
(6.47e-05)
ptr
(6.33e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
limit
softness
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
limit
softness
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.73e-01)
set
(1.37e-02)
softness
(1.15e-02)
limit
(1.74e-04)
bt
(8.06e-05)
double
(6.95e-05)
endian
(6.44e-05)
value
(6.04e-05)
swig
(5.43e-05)
c
(4.65e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
limit
softness
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
limit
softness
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
get,limit,softness
get
get
(9.88e-01)
softness
(6.71e-03)
limit
(3.97e-03)
motor
(5.42e-04)
c
(1.06e-04)
return
(1.05e-04)
ptr
(1.01e-04)
dynamics
(7.39e-05)
swig
(6.72e-05)
translational
(4.57e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
limit
softness
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
limit
softness
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
limit
softness
(9.29e-01)
limit
(6.86e-02)
%END%
(1.61e-03)
get
(3.51e-04)
%START%
(9.32e-06)
motor
(6.75e-06)
set
(5.95e-06)
c
(3.82e-06)
ptr
(3.09e-06)
iterator
(2.95e-06)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
limit
softness
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
limit
softness
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
softness
softness
(7.30e-01)
%END%
(2.41e-01)
get
(2.63e-02)
limit
(1.43e-03)
dynamics
(1.22e-04)
c
(1.16e-04)
return
(1.06e-04)
ptr
(9.79e-05)
jni
(7.81e-05)
this
(4.19e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
limit
softness
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
limit
softness
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.73e-01)
get
(1.56e-02)
softness
(9.22e-03)
limit
(2.01e-04)
endian
(1.45e-04)
bt
(1.27e-04)
double
(1.19e-04)
c
(8.62e-05)
swig
(5.48e-05)
rad
(5.32e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
limit
softness
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
limit
softness
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
set,damping
set
set
(9.91e-01)
damping
(6.43e-03)
motor
(1.29e-03)
limit
(1.73e-04)
this
(1.34e-04)
ptr
(1.32e-04)
c
(1.24e-04)
dynamics
(9.30e-05)
jni
(9.15e-05)
swig
(7.07e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
damping
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
damping
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
damping
damping
(9.60e-01)
set
(3.99e-02)
motor
(2.53e-04)
value
(1.07e-05)
this
(3.69e-06)
swig
(2.06e-06)
c
(2.01e-06)
ptr
(1.50e-06)
%END%
(9.29e-07)
get
(9.08e-07)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
damping
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
damping
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.92e-01)
damping
(1.60e-03)
set
(4.67e-04)
value
(4.41e-04)
c
(3.79e-04)
swig
(3.15e-04)
motor
(2.98e-04)
ptr
(2.42e-04)
dynamics
(2.41e-04)
this
(2.16e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
damping
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
damping
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
get,damping
get
get
(9.89e-01)
damping
(7.59e-03)
motor
(1.72e-03)
limit
(2.08e-04)
ptr
(1.49e-04)
return
(1.41e-04)
c
(1.31e-04)
dynamics
(1.10e-04)
jni
(8.01e-05)
this
(6.37e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
damping
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
damping
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
damping
damping
(8.60e-01)
get
(1.40e-01)
motor
(2.35e-04)
set
(7.34e-06)
this
(3.58e-06)
%END%
(3.18e-06)
ptr
(3.04e-06)
dynamics
(2.14e-06)
return
(1.89e-06)
c
(1.74e-06)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
damping
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
damping
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.93e-01)
damping
(1.33e-03)
get
(5.79e-04)
c
(4.48e-04)
ptr
(3.60e-04)
swig
(2.90e-04)
motor
(2.46e-04)
dynamics
(2.35e-04)
return
(2.25e-04)
jni
(2.15e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
damping
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
damping
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
set,restitution
set
set
(9.88e-01)
restitution
(9.00e-03)
motor
(1.77e-03)
limit
(1.76e-04)
this
(1.19e-04)
ptr
(1.17e-04)
c
(1.12e-04)
jni
(8.43e-05)
dynamics
(8.36e-05)
swig
(5.86e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
restitution
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
restitution
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
restitution
restitution
(9.44e-01)
set
(5.54e-02)
motor
(1.51e-04)
value
(8.69e-06)
this
(3.11e-06)
c
(2.08e-06)
ptr
(1.86e-06)
swig
(1.35e-06)
bt
(7.49e-07)
dynamics
(7.06e-07)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
restitution
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
restitution
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.92e-01)
restitution
(1.07e-03)
set
(5.04e-04)
value
(4.11e-04)
c
(3.09e-04)
dynamics
(2.94e-04)
swig
(2.89e-04)
ptr
(2.31e-04)
jni
(2.30e-04)
this
(2.12e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
restitution
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
restitution
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
get,restitution
get
get
(9.87e-01)
restitution
(9.77e-03)
motor
(2.21e-03)
limit
(2.03e-04)
ptr
(1.26e-04)
c
(1.16e-04)
return
(1.16e-04)
dynamics
(9.26e-05)
jni
(6.97e-05)
this
(5.45e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
restitution
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
restitution
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
restitution
restitution
(8.31e-01)
get
(1.68e-01)
motor
(1.47e-04)
ptr
(3.13e-06)
this
(2.90e-06)
dynamics
(2.35e-06)
return
(2.19e-06)
c
(1.78e-06)
set
(1.55e-06)
swig
(9.46e-07)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
restitution
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
restitution
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.92e-01)
restitution
(1.04e-03)
get
(7.37e-04)
c
(4.21e-04)
ptr
(3.95e-04)
dynamics
(3.41e-04)
swig
(3.23e-04)
jni
(3.22e-04)
return
(3.22e-04)
motor
(2.01e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
restitution
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
restitution
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
set,normal,cfm
set
set
(9.84e-01)
cfm
(8.50e-03)
normal
(4.82e-03)
motor
(8.08e-04)
c
(2.80e-04)
ptr
(2.18e-04)
limit
(1.70e-04)
get
(1.60e-04)
value
(1.20e-04)
bt
(1.00e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
normal
cfm
(8.42e-01)
normal
(1.56e-01)
%END%
(1.45e-03)
set
(1.51e-04)
get
(6.09e-05)
motor
(4.11e-05)
c
(5.30e-06)
%UNK%
(4.24e-06)
instance
(3.00e-06)
ptr
(2.59e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
cfm
cfm
(7.50e-01)
%END%
(2.27e-01)
set
(1.43e-02)
normal
(4.90e-03)
ptr
(3.32e-04)
c
(2.74e-04)
value
(2.00e-04)
bt
(1.82e-04)
motor
(1.35e-04)
3
(1.32e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.71e-01)
cfm
(1.86e-02)
set
(6.90e-03)
bt
(4.35e-04)
%UNK%
(2.51e-04)
endian
(2.11e-04)
normal
(1.21e-04)
c
(8.79e-05)
3
(8.39e-05)
value
(8.38e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,normal,cfm
get
get
(9.82e-01)
cfm
(8.56e-03)
normal
(4.17e-03)
motor
(7.15e-04)
ptr
(5.87e-04)
c
(5.33e-04)
long
(1.78e-04)
limit
(1.69e-04)
return
(1.57e-04)
bt
(1.35e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
normal
cfm
(9.08e-01)
normal
(8.97e-02)
%END%
(1.38e-03)
get
(2.97e-04)
motor
(4.55e-05)
instance
(2.52e-05)
c
(1.59e-05)
ptr
(9.89e-06)
set
(7.39e-06)
long
(6.39e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
cfm
cfm
(6.55e-01)
%END%
(3.12e-01)
get
(1.33e-02)
normal
(6.77e-03)
ptr
(2.12e-03)
c
(1.66e-03)
bt
(3.99e-04)
motor
(3.94e-04)
false
(3.87e-04)
long
(3.86e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.66e-01)
cfm
(2.28e-02)
get
(6.61e-03)
c
(3.88e-04)
instance
(2.48e-04)
%UNK%
(2.40e-04)
bt
(1.94e-04)
normal
(1.62e-04)
ptr
(1.47e-04)
endian
(1.09e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
normal
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,stop,erp
set
set
(9.84e-01)
erp
(7.88e-03)
stop
(4.48e-03)
motor
(7.90e-04)
c
(2.91e-04)
ptr
(2.30e-04)
limit
(1.65e-04)
get
(1.54e-04)
value
(1.21e-04)
bt
(1.00e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
erp
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
erp
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
stop
erp
(8.37e-01)
stop
(1.61e-01)
%END%
(1.20e-03)
set
(7.35e-04)
motor
(7.50e-05)
get
(3.66e-05)
%UNK%
(1.22e-05)
c
(8.04e-06)
ptr
(3.35e-06)
value
(3.24e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
erp
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
erp
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
erp
erp
(7.22e-01)
%END%
(2.54e-01)
set
(1.30e-02)
stop
(8.01e-03)
ptr
(3.63e-04)
c
(2.91e-04)
motor
(2.58e-04)
bt
(2.09e-04)
value
(2.06e-04)
3
(1.55e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
erp
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
erp
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.46e-01)
set
(2.45e-02)
erp
(2.33e-02)
bt
(6.48e-04)
%UNK%
(3.72e-04)
stop
(3.39e-04)
endian
(3.21e-04)
c
(2.17e-04)
ptr
(2.09e-04)
value
(2.02e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
erp
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
erp
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,stop,erp
get
get
(9.81e-01)
erp
(8.79e-03)
stop
(4.43e-03)
motor
(7.83e-04)
ptr
(6.09e-04)
c
(5.51e-04)
long
(1.77e-04)
limit
(1.72e-04)
return
(1.62e-04)
bt
(1.36e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
erp
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
erp
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
stop
erp
(8.93e-01)
stop
(1.05e-01)
%END%
(1.60e-03)
get
(4.05e-04)
motor
(1.27e-04)
set
(3.05e-05)
instance
(2.60e-05)
c
(2.58e-05)
%UNK%
(1.56e-05)
ptr
(1.37e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
erp
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
erp
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
erp
erp
(6.44e-01)
%END%
(3.19e-01)
stop
(1.24e-02)
get
(1.15e-02)
ptr
(2.20e-03)
c
(1.68e-03)
motor
(7.63e-04)
bt
(3.83e-04)
false
(3.74e-04)
long
(3.68e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
erp
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
erp
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.53e-01)
erp
(2.31e-02)
get
(1.65e-02)
c
(6.58e-04)
ptr
(4.49e-04)
%UNK%
(3.51e-04)
stop
(3.35e-04)
bt
(3.23e-04)
instance
(3.01e-04)
double
(1.60e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
erp
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
erp
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,stop,cfm
set
set
(9.86e-01)
cfm
(7.07e-03)
stop
(4.14e-03)
motor
(7.36e-04)
c
(2.87e-04)
ptr
(2.27e-04)
limit
(1.61e-04)
get
(1.55e-04)
value
(1.21e-04)
bt
(1.01e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
stop
cfm
(7.37e-01)
stop
(2.60e-01)
%END%
(1.83e-03)
set
(6.04e-04)
motor
(1.37e-04)
get
(4.59e-05)
%UNK%
(2.04e-05)
c
(1.06e-05)
instance
(5.88e-06)
limit
(4.40e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
cfm
cfm
(7.37e-01)
%END%
(2.41e-01)
stop
(1.07e-02)
set
(8.07e-03)
ptr
(3.32e-04)
motor
(3.02e-04)
c
(2.66e-04)
bt
(1.95e-04)
value
(1.91e-04)
3
(1.53e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.45e-01)
cfm
(2.62e-02)
set
(2.23e-02)
bt
(6.42e-04)
%UNK%
(3.71e-04)
stop
(3.69e-04)
endian
(3.18e-04)
c
(2.14e-04)
ptr
(2.05e-04)
value
(1.99e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,stop,cfm
get
get
(9.83e-01)
cfm
(7.86e-03)
stop
(4.07e-03)
motor
(7.28e-04)
ptr
(5.99e-04)
c
(5.42e-04)
long
(1.72e-04)
limit
(1.68e-04)
return
(1.59e-04)
bt
(1.35e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
stop
cfm
(8.25e-01)
stop
(1.72e-01)
%END%
(2.11e-03)
get
(3.85e-04)
motor
(2.40e-04)
instance
(4.84e-05)
c
(3.26e-05)
set
(2.78e-05)
%UNK%
(2.11e-05)
ptr
(1.72e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
cfm
cfm
(6.57e-01)
%END%
(3.07e-01)
stop
(1.62e-02)
get
(7.29e-03)
ptr
(2.06e-03)
c
(1.63e-03)
motor
(8.83e-04)
long
(3.66e-04)
bt
(3.63e-04)
false
(3.55e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.52e-01)
cfm
(2.54e-02)
get
(1.47e-02)
c
(6.54e-04)
ptr
(4.40e-04)
stop
(3.56e-04)
%UNK%
(3.54e-04)
bt
(3.22e-04)
instance
(3.12e-04)
double
(1.59e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
stop
cfm
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,enable,motor
set
set
(9.81e-01)
motor
(1.12e-02)
enable
(6.20e-03)
limit
(2.33e-04)
this
(8.73e-05)
ptr
(8.61e-05)
c
(8.51e-05)
translational
(7.06e-05)
swig
(6.77e-05)
dynamics
(6.11e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
enable
motor
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
enable
motor
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
enable
motor
(9.61e-01)
enable
(3.75e-02)
set
(8.67e-04)
%END%
(1.09e-04)
joint
(2.85e-05)
enabled
(2.02e-05)
damping
(1.14e-05)
speed
(1.01e-05)
get
(6.07e-06)
frequency
(5.46e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
enable
motor
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
enable
motor
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
motor
motor
(7.29e-01)
%END%
(2.42e-01)
set
(2.70e-02)
enable
(1.40e-03)
dynamics
(7.48e-05)
value
(6.19e-05)
c
(5.85e-05)
jni
(4.13e-05)
ptr
(3.63e-05)
bt
(3.58e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
enable
motor
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
enable
motor
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.67e-01)
set
(1.61e-02)
motor
(1.47e-02)
enable
(1.31e-04)
bt
(9.87e-05)
endian
(7.47e-05)
%UNK%
(6.16e-05)
value
(5.90e-05)
limit
(5.69e-05)
double
(5.09e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
enable
motor
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
enable
motor
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
get,enable,motor
get
get
(9.79e-01)
motor
(1.10e-02)
enable
(8.05e-03)
limit
(2.48e-04)
set
(1.55e-04)
is
(1.13e-04)
return
(1.03e-04)
c
(9.44e-05)
ptr
(9.39e-05)
dynamics
(7.07e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
enable
motor
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
enable
motor
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
enable
motor
(9.66e-01)
enable
(3.32e-02)
get
(2.67e-04)
%END%
(1.19e-04)
joint
(1.05e-04)
set
(9.15e-05)
enabled
(3.82e-05)
damping
(3.71e-05)
is
(3.11e-05)
speed
(1.93e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
enable
motor
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
enable
motor
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
motor
motor
(8.48e-01)
%END%
(1.02e-01)
get
(4.86e-02)
enable
(1.01e-03)
dynamics
(6.08e-05)
c
(5.64e-05)
return
(4.91e-05)
ptr
(4.27e-05)
jni
(3.37e-05)
limit
(1.92e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
enable
motor
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
enable
motor
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.69e-01)
get
(1.78e-02)
motor
(1.02e-02)
endian
(1.81e-04)
bt
(1.58e-04)
c
(1.06e-04)
limit
(1.04e-04)
double
(9.13e-05)
enable
(7.52e-05)
%UNK%
(7.02e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
enable
motor
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
enable
motor
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
set,target,velocity
set
set
(9.83e-01)
velocity
(6.95e-03)
target
(5.77e-03)
motor
(1.45e-03)
limit
(3.53e-04)
c
(2.58e-04)
ptr
(2.05e-04)
get
(1.47e-04)
value
(1.15e-04)
translational
(1.14e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
target
velocity
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
target
velocity
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
target
target
(6.79e-01)
velocity
(3.18e-01)
%END%
(2.09e-03)
motor
(6.78e-04)
set
(3.78e-05)
get
(2.16e-05)
limit
(1.26e-05)
c
(6.57e-06)
%UNK%
(4.38e-06)
bt
(4.06e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
target
velocity
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
target
velocity
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
velocity
velocity
(9.45e-01)
%END%
(3.50e-02)
target
(1.55e-02)
set
(3.62e-03)
motor
(2.03e-04)
ptr
(5.28e-05)
c
(4.19e-05)
bt
(3.14e-05)
value
(2.71e-05)
limit
(2.38e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
target
velocity
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
target
velocity
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.50e-01)
velocity
(3.13e-02)
set
(1.42e-02)
bt
(5.58e-04)
endian
(2.62e-04)
target
(2.55e-04)
%UNK%
(2.32e-04)
c
(1.09e-04)
value
(9.68e-05)
get
(9.16e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
target
velocity
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
target
velocity
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,target,velocity
get
get
(9.82e-01)
velocity
(7.25e-03)
target
(5.24e-03)
motor
(1.35e-03)
ptr
(5.59e-04)
c
(5.10e-04)
limit
(3.59e-04)
long
(1.75e-04)
bt
(1.47e-04)
return
(1.39e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
target
velocity
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
target
velocity
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
target
target
(5.72e-01)
velocity
(4.24e-01)
%END%
(2.92e-03)
motor
(1.24e-03)
get
(1.57e-04)
limit
(3.60e-05)
c
(2.34e-05)
ptr
(1.47e-05)
instance
(1.26e-05)
%UNK%
(9.62e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
target
velocity
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
target
velocity
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
velocity
velocity
(9.20e-01)
%END%
(5.14e-02)
target
(2.28e-02)
get
(3.38e-03)
motor
(5.80e-04)
ptr
(3.04e-04)
c
(2.33e-04)
limit
(7.61e-05)
bt
(6.42e-05)
false
(5.76e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
target
velocity
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
target
velocity
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.48e-01)
velocity
(3.62e-02)
get
(1.09e-02)
c
(4.35e-04)
target
(3.10e-04)
bt
(2.58e-04)
instance
(2.34e-04)
%UNK%
(2.33e-04)
ptr
(2.05e-04)
endian
(1.32e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
target
velocity
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
target
velocity
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,max,motor,force
set
set
(9.83e-01)
motor
(6.33e-03)
max
(4.58e-03)
force
(2.20e-03)
limit
(8.56e-04)
c
(3.86e-04)
ptr
(3.10e-04)
get
(2.32e-04)
value
(2.09e-04)
translational
(1.98e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
max
motor
(5.72e-01)
max
(4.26e-01)
%END%
(1.68e-03)
force
(1.76e-04)
set
(1.34e-04)
get
(3.88e-05)
limit
(1.13e-05)
c
(1.05e-05)
joint
(6.72e-06)
bt
(5.76e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
motor
motor
(5.97e-01)
force
(4.00e-01)
max
(2.09e-03)
%END%
(6.64e-04)
set
(9.24e-05)
bt
(7.95e-06)
ptr
(7.13e-06)
limit
(6.59e-06)
c
(6.40e-06)
translational
(5.69e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
force
force
(7.92e-01)
%END%
(1.90e-01)
set
(1.17e-02)
motor
(5.36e-03)
bt
(1.07e-04)
%UNK%
(5.54e-05)
c
(4.97e-05)
endian
(4.60e-05)
get
(4.42e-05)
max
(4.41e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.28e-01)
force
(5.18e-02)
set
(1.47e-02)
bt
(4.57e-04)
%UNK%
(2.44e-04)
endian
(2.30e-04)
motor
(2.28e-04)
c
(1.92e-04)
get
(1.61e-04)
value
(1.57e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,max,motor,force
get
get
(9.81e-01)
motor
(5.96e-03)
max
(3.90e-03)
force
(2.29e-03)
ptr
(7.78e-04)
limit
(7.78e-04)
c
(6.90e-04)
long
(2.63e-04)
bt
(2.10e-04)
translational
(1.62e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
max
motor
(6.64e-01)
max
(3.34e-01)
%END%
(1.66e-03)
force
(2.57e-04)
get
(7.83e-05)
c
(2.62e-05)
set
(2.22e-05)
ptr
(1.27e-05)
limit
(1.10e-05)
instance
(7.06e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
motor
force
(5.13e-01)
motor
(4.84e-01)
max
(1.87e-03)
%END%
(9.48e-04)
get
(1.36e-04)
ptr
(1.86e-05)
c
(1.76e-05)
limit
(7.86e-06)
bt
(6.54e-06)
return
(5.82e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
force
force
(7.50e-01)
%END%
(2.32e-01)
get
(1.27e-02)
motor
(3.36e-03)
c
(2.09e-04)
ptr
(1.00e-04)
bt
(8.76e-05)
instance
(8.57e-05)
%UNK%
(7.74e-05)
swig
(5.25e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.25e-01)
force
(5.35e-02)
get
(1.51e-02)
c
(6.86e-04)
ptr
(3.06e-04)
bt
(2.86e-04)
instance
(2.64e-04)
%UNK%
(2.47e-04)
motor
(2.06e-04)
swig
(1.65e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
max
motor
force
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,current,limit,error
set
set
(9.75e-01)
limit
(7.18e-03)
current
(6.41e-03)
error
(4.56e-03)
motor
(2.78e-03)
c
(4.23e-04)
ptr
(3.37e-04)
get
(2.51e-04)
value
(2.17e-04)
swig
(1.53e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
current
limit
(8.90e-01)
current
(1.08e-01)
%END%
(1.34e-03)
error
(2.93e-04)
motor
(3.11e-05)
c
(4.32e-06)
get
(3.59e-06)
swig
(2.79e-06)
value
(2.76e-06)
ptr
(2.64e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
limit
error
(7.59e-01)
limit
(2.40e-01)
%END%
(1.28e-03)
current
(2.36e-04)
set
(1.17e-04)
ptr
(5.94e-06)
c
(5.94e-06)
bt
(5.45e-06)
value
(3.48e-06)
3
(3.09e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
error
error
(6.23e-01)
%END%
(3.60e-01)
set
(1.42e-02)
limit
(1.25e-03)
bt
(1.13e-04)
%UNK%
(8.39e-05)
endian
(7.01e-05)
c
(4.83e-05)
get
(4.41e-05)
value
(4.18e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.26e-01)
error
(5.16e-02)
set
(1.85e-02)
bt
(2.91e-04)
%UNK%
(2.00e-04)
endian
(1.90e-04)
limit
(1.73e-04)
c
(1.27e-04)
double
(1.11e-04)
value
(1.09e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,current,limit,error
get
get
(9.73e-01)
limit
(7.13e-03)
current
(6.35e-03)
error
(4.17e-03)
motor
(2.95e-03)
ptr
(8.51e-04)
c
(7.55e-04)
long
(2.75e-04)
bt
(2.13e-04)
return
(1.70e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
current
limit
(9.15e-01)
current
(8.28e-02)
%END%
(1.28e-03)
error
(3.23e-04)
motor
(3.17e-05)
c
(9.23e-06)
get
(7.69e-06)
ptr
(6.99e-06)
long
(3.48e-06)
swig
(2.82e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
limit
error
(7.95e-01)
limit
(2.03e-01)
%END%
(1.14e-03)
current
(2.75e-04)
get
(1.43e-04)
ptr
(1.62e-05)
c
(1.62e-05)
bt
(5.21e-06)
motor
(4.97e-06)
return
(4.39e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
error
error
(6.25e-01)
%END%
(3.57e-01)
get
(1.48e-02)
limit
(1.05e-03)
c
(2.01e-04)
instance
(1.16e-04)
%UNK%
(1.01e-04)
bt
(8.36e-05)
ptr
(8.26e-05)
swig
(6.77e-05)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.27e-01)
error
(5.10e-02)
get
(1.72e-02)
c
(4.66e-04)
instance
(2.40e-04)
%UNK%
(2.16e-04)
ptr
(2.10e-04)
bt
(1.96e-04)
limit
(1.62e-04)
double
(1.53e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
limit
error
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,current,linear,diff
set
set
(9.67e-01)
linear
(1.20e-02)
current
(1.04e-02)
diff
(4.91e-03)
motor
(2.65e-03)
limit
(4.65e-04)
c
(2.59e-04)
ptr
(2.11e-04)
get
(1.53e-04)
value
(1.39e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
current
linear
(9.18e-01)
current
(8.05e-02)
%END%
(9.72e-04)
diff
(3.64e-04)
motor
(3.32e-05)
%UNK%
(2.65e-05)
set
(2.36e-05)
get
(1.72e-05)
bt
(1.06e-05)
c
(4.65e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
linear
diff
(6.42e-01)
linear
(3.56e-01)
%END%
(1.45e-03)
current
(3.67e-04)
set
(7.22e-05)
ptr
(5.21e-06)
bt
(4.87e-06)
c
(4.85e-06)
motor
(3.45e-06)
value
(3.41e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
diff
%END%
(5.37e-01)
diff
(4.49e-01)
set
(8.08e-03)
linear
(2.59e-03)
bt
(3.49e-04)
%UNK%
(2.84e-04)
endian
(1.82e-04)
get
(1.15e-04)
c
(8.84e-05)
swig
(7.52e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.24e-01)
diff
(5.59e-02)
set
(1.33e-02)
bt
(6.33e-04)
%UNK%
(4.74e-04)
linear
(4.02e-04)
endian
(3.31e-04)
get
(1.95e-04)
c
(1.76e-04)
value
(1.32e-04)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
set
(
swig
c
ptr
,
this
,
bt
vector
3
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,current,linear,diff
get
get
(9.60e-01)
linear
(1.40e-02)
current
(1.16e-02)
diff
(5.76e-03)
motor
(3.29e-03)
ptr
(6.17e-04)
c
(5.54e-04)
limit
(5.34e-04)
long
(1.86e-04)
bt
(1.63e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
current
linear
(9.36e-01)
current
(6.21e-02)
%END%
(9.40e-04)
diff
(4.22e-04)
get
(3.49e-05)
motor
(3.03e-05)
%UNK%
(2.30e-05)
c
(1.16e-05)
instance
(1.08e-05)
bt
(8.77e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
linear
diff
(7.03e-01)
linear
(2.95e-01)
%END%
(1.57e-03)
current
(3.82e-04)
get
(9.49e-05)
c
(1.52e-05)
ptr
(1.49e-05)
motor
(5.50e-06)
bt
(5.11e-06)
dynamics
(3.75e-06)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
diff
%END%
(5.71e-01)
diff
(4.15e-01)
get
(7.48e-03)
linear
(1.91e-03)
c
(4.27e-04)
%UNK%
(3.42e-04)
instance
(3.31e-04)
bt
(2.36e-04)
swig
(1.41e-04)
endian
(1.18e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.27e-01)
diff
(5.39e-02)
get
(1.16e-02)
c
(6.89e-04)
%UNK%
(4.89e-04)
instance
(4.69e-04)
bt
(3.72e-04)
linear
(3.69e-04)
ptr
(2.32e-04)
swig
(2.01e-04)
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
dynamics
jni
.
bt
translational
limit
motor
current
linear
diff
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
vector
3
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
set,current,limit
set
set
(9.86e-01)
limit
(8.27e-03)
current
(4.08e-03)
motor
(6.52e-04)
c
(1.07e-04)
this
(9.98e-05)
ptr
(9.56e-05)
swig
(8.80e-05)
dynamics
(6.53e-05)
translational
(5.90e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
current
limit
(8.87e-01)
current
(1.11e-01)
%END%
(1.97e-03)
set
(3.44e-05)
motor
(7.12e-06)
double
(3.42e-06)
swig
(3.21e-06)
get
(2.85e-06)
c
(2.52e-06)
value
(1.91e-06)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
limit
limit
(5.74e-01)
%END%
(3.99e-01)
set
(2.39e-02)
current
(9.51e-04)
dynamics
(1.61e-04)
value
(1.45e-04)
c
(1.19e-04)
jni
(8.80e-05)
ptr
(8.61e-05)
this
(7.38e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.82e-01)
set
(9.29e-03)
limit
(7.40e-03)
bt
(5.80e-05)
endian
(5.44e-05)
double
(5.39e-05)
%UNK%
(4.73e-05)
value
(4.54e-05)
current
(4.17e-05)
swig
(3.36e-05)
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
dynamics
jni
.
bt
translational
limit
motor
current
limit
set
(
swig
c
ptr
,
this
,
value
)
;
}
<SENTENCE_END/>
get,current,limit
get
get
(9.85e-01)
limit
(8.28e-03)
current
(5.01e-03)
motor
(7.57e-04)
c
(1.18e-04)
return
(1.18e-04)
ptr
(1.06e-04)
swig
(8.05e-05)
dynamics
(7.77e-05)
translational
(5.65e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
current
limit
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
current
limit
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
current
limit
(9.15e-01)
current
(8.28e-02)
%END%
(1.75e-03)
get
(9.03e-05)
double
(7.66e-06)
motor
(4.93e-06)
c
(4.41e-06)
swig
(4.09e-06)
position
(3.17e-06)
ptr
(2.14e-06)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
current
limit
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
current
limit
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
limit
limit
(7.42e-01)
%END%
(2.11e-01)
get
(4.41e-02)
current
(7.99e-04)
dynamics
(1.47e-04)
return
(1.45e-04)
c
(1.41e-04)
ptr
(1.13e-04)
jni
(8.22e-05)
this
(5.33e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
current
limit
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
current
limit
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.81e-01)
get
(1.12e-02)
limit
(5.79e-03)
endian
(1.25e-04)
double
(9.55e-05)
bt
(9.11e-05)
c
(6.98e-05)
%UNK%
(5.35e-05)
rad
(4.69e-05)
swig
(4.04e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
current
limit
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
current
limit
get
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
is,limited
is
is
(9.62e-01)
limited
(2.08e-02)
motor
(1.08e-02)
limit
(1.96e-03)
this
(3.24e-04)
return
(3.16e-04)
c
(2.74e-04)
dynamics
(2.52e-04)
ptr
(2.36e-04)
index
(2.09e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
is
limited
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
is
limited
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
limited
limited
(9.78e-01)
%END%
(7.31e-03)
is
(3.34e-03)
get
(1.88e-03)
set
(1.85e-03)
%UNK%
(6.07e-04)
limit
(4.88e-04)
c
(3.72e-04)
release
(3.71e-04)
swig
(3.05e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
is
limited
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
is
limited
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.81e-01)
limited
(6.48e-03)
bt
(9.48e-04)
limit
(5.38e-04)
double
(3.63e-04)
endian
(3.59e-04)
index
(2.87e-04)
c
(2.83e-04)
%UNK%
(2.66e-04)
get
(2.19e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
is
limited
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
is
limited
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
need,apply,force
need
apply
(9.53e-01)
need
(3.66e-02)
motor
(4.53e-03)
force
(3.99e-03)
limit
(5.92e-04)
return
(1.60e-04)
c
(1.28e-04)
dynamics
(1.18e-04)
ptr
(1.01e-04)
this
(9.22e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
need
apply
force
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
need
apply
force
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
apply
apply
(9.23e-01)
force
(7.21e-02)
%END%
(1.38e-03)
need
(1.20e-03)
set
(1.11e-03)
get
(1.95e-04)
%UNK%
(7.25e-05)
update
(3.90e-05)
is
(1.75e-05)
limit
(1.55e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
need
apply
force
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
need
apply
force
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
force
force
(8.76e-01)
%END%
(1.19e-01)
apply
(2.68e-03)
%UNK%
(6.23e-05)
limit
(5.50e-05)
bt
(4.77e-05)
c
(2.81e-05)
double
(2.71e-05)
set
(2.70e-05)
get
(2.49e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
need
apply
force
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
need
apply
force
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.70e-01)
force
(2.29e-02)
bt
(4.21e-04)
limit
(3.79e-04)
%UNK%
(3.19e-04)
double
(2.38e-04)
endian
(2.28e-04)
at
(1.39e-04)
position
(1.36e-04)
c
(1.23e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
need
apply
force
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
need
apply
force
(
swig
c
ptr
,
this
,
limit
index
)
;
}
<SENTENCE_END/>
test,limit,value
test
test
(5.90e-01)
instance
(3.82e-01)
limit
(1.76e-02)
motor
(4.41e-03)
value
(2.79e-03)
c
(3.03e-04)
index
(2.62e-04)
return
(2.54e-04)
ptr
(1.94e-04)
dynamics
(1.92e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
test
limit
value
(
swig
c
ptr
,
this
,
limit
index
,
test
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
test
limit
value
(
swig
c
ptr
,
this
,
limit
index
,
test
value
)
;
}
<SENTENCE_END/>
limit
limit
(9.91e-01)
test
(4.51e-03)
%END%
(3.46e-03)
value
(8.84e-04)
instance
(7.87e-06)
c
(4.00e-06)
double
(3.86e-06)
get
(3.06e-06)
index
(1.97e-06)
dynamics
(1.93e-06)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
test
limit
value
(
swig
c
ptr
,
this
,
limit
index
,
test
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
test
limit
value
(
swig
c
ptr
,
this
,
limit
index
,
test
value
)
;
}
<SENTENCE_END/>
value
%END%
(6.43e-01)
value
(3.41e-01)
limit
(1.31e-02)
instance
(1.72e-04)
bt
(1.62e-04)
double
(1.51e-04)
test
(1.07e-04)
%UNK%
(9.37e-05)
c
(8.83e-05)
endian
(8.26e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
test
limit
value
(
swig
c
ptr
,
this
,
limit
index
,
test
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
test
limit
value
(
swig
c
ptr
,
this
,
limit
index
,
test
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.75e-01)
value
(2.02e-02)
limit
(4.43e-04)
bt
(2.55e-04)
double
(1.98e-04)
%UNK%
(1.48e-04)
instance
(1.41e-04)
endian
(1.34e-04)
at
(1.04e-04)
test
(8.71e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
test
limit
value
(
swig
c
ptr
,
this
,
limit
index
,
test
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
test
limit
value
(
swig
c
ptr
,
this
,
limit
index
,
test
value
)
;
}
<SENTENCE_END/>
solve,linear,axis
solve
solve
(9.19e-01)
linear
(5.52e-02)
motor
(1.07e-02)
axis
(4.69e-03)
limit
(8.24e-04)
body
(7.93e-04)
c
(4.01e-04)
time
(3.69e-04)
point
(3.60e-04)
rigid
(3.36e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
solve
linear
axis
(
swig
c
ptr
,
this
,
time
step
,
jac
diag
ab
inv
,
bt
rigid
body
.
get
c
ptr
(
body
1
)
,
body
1
,
point
in
a
,
bt
rigid
body
.
get
c
ptr
(
body
2
)
,
body
2
,
point
in
b
,
limit
index
,
axis
normal
on
a
,
anchor
pos
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
solve
linear
axis
(
swig
c
ptr
,
this
,
time
step
,
jac
diag
ab
inv
,
bt
rigid
body
.
get
c
ptr
(
body
1
)
,
body
1
,
point
in
a
,
bt
rigid
body
.
get
c
ptr
(
body
2
)
,
body
2
,
point
in
b
,
limit
index
,
axis
normal
on
a
,
anchor
pos
)
;
}
<SENTENCE_END/>
linear
linear
(9.86e-01)
solve
(8.87e-03)
axis
(2.17e-03)
%END%
(1.76e-03)
%UNK%
(1.28e-04)
get
(1.26e-04)
bt
(3.50e-05)
initialize
(3.41e-05)
time
(2.08e-05)
c
(1.95e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
solve
linear
axis
(
swig
c
ptr
,
this
,
time
step
,
jac
diag
ab
inv
,
bt
rigid
body
.
get
c
ptr
(
body
1
)
,
body
1
,
point
in
a
,
bt
rigid
body
.
get
c
ptr
(
body
2
)
,
body
2
,
point
in
b
,
limit
index
,
axis
normal
on
a
,
anchor
pos
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
solve
linear
axis
(
swig
c
ptr
,
this
,
time
step
,
jac
diag
ab
inv
,
bt
rigid
body
.
get
c
ptr
(
body
1
)
,
body
1
,
point
in
a
,
bt
rigid
body
.
get
c
ptr
(
body
2
)
,
body
2
,
point
in
b
,
limit
index
,
axis
normal
on
a
,
anchor
pos
)
;
}
<SENTENCE_END/>
axis
axis
(9.02e-01)
%END%
(7.00e-02)
linear
(2.29e-02)
%UNK%
(6.48e-04)
get
(3.20e-04)
initialize
(2.30e-04)
bt
(1.96e-04)
convex
(1.18e-04)
match
(8.99e-05)
set
(7.85e-05)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
solve
linear
axis
(
swig
c
ptr
,
this
,
time
step
,
jac
diag
ab
inv
,
bt
rigid
body
.
get
c
ptr
(
body
1
)
,
body
1
,
point
in
a
,
bt
rigid
body
.
get
c
ptr
(
body
2
)
,
body
2
,
point
in
b
,
limit
index
,
axis
normal
on
a
,
anchor
pos
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
solve
linear
axis
(
swig
c
ptr
,
this
,
time
step
,
jac
diag
ab
inv
,
bt
rigid
body
.
get
c
ptr
(
body
1
)
,
body
1
,
point
in
a
,
bt
rigid
body
.
get
c
ptr
(
body
2
)
,
body
2
,
point
in
b
,
limit
index
,
axis
normal
on
a
,
anchor
pos
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.50e-01)
axis
(8.89e-02)
%UNK%
(7.82e-03)
get
(3.89e-03)
initialize
(2.99e-03)
bt
(2.50e-03)
convex
(1.48e-03)
set
(1.11e-03)
match
(1.08e-03)
create
(9.58e-04)
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
solve
linear
axis
(
swig
c
ptr
,
this
,
time
step
,
jac
diag
ab
inv
,
bt
rigid
body
.
get
c
ptr
(
body
1
)
,
body
1
,
point
in
a
,
bt
rigid
body
.
get
c
ptr
(
body
2
)
,
body
2
,
point
in
b
,
limit
index
,
axis
normal
on
a
,
anchor
pos
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
dynamics
jni
.
bt
translational
limit
motor
solve
linear
axis
(
swig
c
ptr
,
this
,
time
step
,
jac
diag
ab
inv
,
bt
rigid
body
.
get
c
ptr
(
body
1
)
,
body
1
,
point
in
a
,
bt
rigid
body
.
get
c
ptr
(
body
2
)
,
body
2
,
point
in
b
,
limit
index
,
axis
normal
on
a
,
anchor
pos
)
;
}
<SENTENCE_END/>
set,style
set
set
(9.37e-01)
style
(1.13e-02)
check
(1.00e-02)
update
(3.70e-03)
instanceof
(2.60e-03)
illegal
(1.82e-03)
create
(1.71e-03)
add
(1.47e-03)
box
(1.21e-03)
draw
(1.18e-03)
<SENTENCE_START>
{
if
(
!
(
style
instanceof
check
box
style
)
)
throw
new
illegal
argument
exception
(
"style must be a CheckBoxStyle."
)
;
super
.
%SELF%
(
style
)
;
this
.
style
=
(
check
box
style
)
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
!
(
style
instanceof
check
box
style
)
)
throw
new
illegal
argument
exception
(
"style must be a CheckBoxStyle."
)
;
super
.
%SELF%
(
style
)
;
this
.
style
=
(
check
box
style
)
style
;
}
<SENTENCE_END/>
style
style
(5.89e-01)
%END%
(2.63e-01)
box
(2.53e-02)
check
(1.54e-02)
instanceof
(1.53e-02)
update
(4.75e-03)
set
(3.88e-03)
%UNK%
(1.61e-03)
debug
(1.56e-03)
text
(1.47e-03)
<SENTENCE_START>
{
if
(
!
(
style
instanceof
check
box
style
)
)
throw
new
illegal
argument
exception
(
"style must be a CheckBoxStyle."
)
;
super
.
%SELF%
(
style
)
;
this
.
style
=
(
check
box
style
)
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
!
(
style
instanceof
check
box
style
)
)
throw
new
illegal
argument
exception
(
"style must be a CheckBoxStyle."
)
;
super
.
%SELF%
(
style
)
;
this
.
style
=
(
check
box
style
)
style
;
}
<SENTENCE_END/>
%END%
%END%
(9.41e-01)
style
(2.11e-02)
box
(5.99e-03)
check
(4.56e-03)
instanceof
(2.70e-03)
argument
(1.34e-03)
exception
(1.13e-03)
and
(7.27e-04)
%UNK%
(6.29e-04)
changed
(4.66e-04)
<SENTENCE_START>
{
if
(
!
(
style
instanceof
check
box
style
)
)
throw
new
illegal
argument
exception
(
"style must be a CheckBoxStyle."
)
;
super
.
%SELF%
(
style
)
;
this
.
style
=
(
check
box
style
)
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
!
(
style
instanceof
check
box
style
)
)
throw
new
illegal
argument
exception
(
"style must be a CheckBoxStyle."
)
;
super
.
%SELF%
(
style
)
;
this
.
style
=
(
check
box
style
)
style
;
}
<SENTENCE_END/>
get,style
get
get
(9.90e-01)
is
(4.64e-03)
return
(1.40e-03)
style
(1.01e-03)
iterator
(3.16e-04)
protected
(3.55e-05)
owns
(3.48e-05)
as
(2.01e-05)
needs
(1.98e-05)
can
(1.21e-05)
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
style
style
(9.98e-01)
%END%
(9.07e-04)
return
(5.07e-04)
update
(3.99e-05)
atlas
(7.76e-06)
text
(1.81e-06)
label
(1.52e-06)
circle
(1.33e-06)
title
(1.14e-06)
get
(1.09e-06)
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
%END%
%END%
(9.73e-01)
style
(1.30e-02)
value
(1.15e-03)
only
(5.04e-04)
title
(4.33e-04)
accessible
(4.21e-04)
20
(3.59e-04)
return
(3.57e-04)
display
(3.48e-04)
performed
(3.01e-04)
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
style
;
}
<SENTENCE_END/>
draw
draw
set
(4.68e-01)
update
(1.37e-01)
draw
(4.98e-02)
run
(2.68e-02)
style
(2.41e-02)
initialize
(2.10e-02)
setup
(2.07e-02)
load
(1.74e-02)
action
(1.46e-02)
create
(1.38e-02)
<SENTENCE_START>
{
drawable
checkbox
=
null
;
if
(
is
disabled
(
)
)
{
if
(
is
checked
&&
style
.
checkbox
on
disabled
!=
null
)
checkbox
=
style
.
checkbox
on
disabled
;
else
checkbox
=
style
.
checkbox
off
disabled
;
}
if
(
checkbox
==
null
)
{
if
(
is
checked
&&
style
.
checkbox
on
!=
null
)
checkbox
=
style
.
checkbox
on
;
else
if
(
is
over
(
)
&&
style
.
checkbox
over
!=
null
&&
!
is
disabled
(
)
)
checkbox
=
style
.
checkbox
over
;
else
checkbox
=
style
.
checkbox
off
;
}
image
.
set
drawable
(
checkbox
)
;
super
.
%SELF%
(
batch
,
parent
alpha
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
drawable
checkbox
=
null
;
if
(
is
disabled
(
)
)
{
if
(
is
checked
&&
style
.
checkbox
on
disabled
!=
null
)
checkbox
=
style
.
checkbox
on
disabled
;
else
checkbox
=
style
.
checkbox
off
disabled
;
}
if
(
checkbox
==
null
)
{
if
(
is
checked
&&
style
.
checkbox
on
!=
null
)
checkbox
=
style
.
checkbox
on
;
else
if
(
is
over
(
)
&&
style
.
checkbox
over
!=
null
&&
!
is
disabled
(
)
)
checkbox
=
style
.
checkbox
over
;
else
checkbox
=
style
.
checkbox
off
;
}
image
.
set
drawable
(
checkbox
)
;
super
.
%SELF%
(
batch
,
parent
alpha
)
;
}
<SENTENCE_END/>
%END%
checkbox
(2.24e-01)
%END%
(2.03e-01)
on
(9.27e-02)
style
(9.05e-02)
drawable
(1.89e-02)
disabled
(1.40e-02)
checked
(9.33e-03)
update
(9.25e-03)
changed
(7.73e-03)
over
(7.46e-03)
<SENTENCE_START>
{
drawable
checkbox
=
null
;
if
(
is
disabled
(
)
)
{
if
(
is
checked
&&
style
.
checkbox
on
disabled
!=
null
)
checkbox
=
style
.
checkbox
on
disabled
;
else
checkbox
=
style
.
checkbox
off
disabled
;
}
if
(
checkbox
==
null
)
{
if
(
is
checked
&&
style
.
checkbox
on
!=
null
)
checkbox
=
style
.
checkbox
on
;
else
if
(
is
over
(
)
&&
style
.
checkbox
over
!=
null
&&
!
is
disabled
(
)
)
checkbox
=
style
.
checkbox
over
;
else
checkbox
=
style
.
checkbox
off
;
}
image
.
set
drawable
(
checkbox
)
;
super
.
%SELF%
(
batch
,
parent
alpha
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
drawable
checkbox
=
null
;
if
(
is
disabled
(
)
)
{
if
(
is
checked
&&
style
.
checkbox
on
disabled
!=
null
)
checkbox
=
style
.
checkbox
on
disabled
;
else
checkbox
=
style
.
checkbox
off
disabled
;
}
if
(
checkbox
==
null
)
{
if
(
is
checked
&&
style
.
checkbox
on
!=
null
)
checkbox
=
style
.
checkbox
on
;
else
if
(
is
over
(
)
&&
style
.
checkbox
over
!=
null
&&
!
is
disabled
(
)
)
checkbox
=
style
.
checkbox
over
;
else
checkbox
=
style
.
checkbox
off
;
}
image
.
set
drawable
(
checkbox
)
;
super
.
%SELF%
(
batch
,
parent
alpha
)
;
}
<SENTENCE_END/>
get,image
get
get
(9.93e-01)
is
(1.84e-03)
return
(1.56e-03)
image
(1.06e-03)
iterator
(1.27e-04)
append
(5.11e-05)
protected
(4.83e-05)
length
(3.39e-05)
needs
(3.26e-05)
size
(2.96e-05)
<SENTENCE_START>
{
return
image
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
image
;
}
<SENTENCE_END/>
image
image
(9.97e-01)
pack
(1.40e-03)
return
(8.69e-04)
pixmap
(2.09e-04)
rectangle
(9.06e-05)
%END%
(8.84e-05)
get
(6.77e-05)
degenerate
(4.44e-05)
add
(4.24e-05)
atlas
(4.15e-05)
<SENTENCE_START>
{
return
image
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
image
;
}
<SENTENCE_END/>
%END%
%END%
(9.15e-01)
image
(2.90e-02)
value
(3.32e-03)
height
(2.24e-03)
width
(2.18e-03)
buffer
(1.93e-03)
offset
(1.42e-03)
texture
(1.19e-03)
array
(1.12e-03)
display
(1.07e-03)
<SENTENCE_START>
{
return
image
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
image
;
}
<SENTENCE_END/>
get,image,cell
get
get
(9.89e-01)
image
(3.48e-03)
return
(1.97e-03)
is
(1.58e-03)
cell
(5.50e-04)
iterator
(1.65e-04)
append
(6.29e-05)
protected
(6.17e-05)
needs
(4.09e-05)
last
(3.35e-05)
<SENTENCE_START>
{
return
image
cell
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
image
cell
;
}
<SENTENCE_END/>
image
image
(9.94e-01)
cell
(4.88e-03)
pack
(4.76e-04)
return
(2.01e-04)
add
(1.80e-04)
get
(4.66e-05)
draw
(4.33e-05)
%END%
(3.24e-05)
pixmap
(2.96e-05)
rectangle
(1.88e-05)
<SENTENCE_START>
{
return
image
cell
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
image
cell
;
}
<SENTENCE_END/>
cell
cell
(9.64e-01)
%END%
(2.33e-02)
image
(1.04e-02)
width
(1.30e-04)
height
(1.24e-04)
buffer
(8.23e-05)
value
(7.55e-05)
texture
(6.62e-05)
atlas
(4.67e-05)
display
(4.56e-05)
<SENTENCE_START>
{
return
image
cell
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
image
cell
;
}
<SENTENCE_END/>
%END%
%END%
(9.53e-01)
cell
(1.94e-02)
value
(3.89e-03)
20
(1.12e-03)
offset
(1.06e-03)
only
(1.03e-03)
buffer
(8.80e-04)
height
(7.23e-04)
display
(6.55e-04)
array
(6.40e-04)
<SENTENCE_START>
{
return
image
cell
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
image
cell
;
}
<SENTENCE_END/>
get,c,ptr
get
get
(9.83e-01)
c
(4.72e-03)
obj
(1.88e-03)
swig
(1.36e-03)
is
(8.93e-04)
return
(8.85e-04)
ptr
(5.54e-04)
0
(3.63e-04)
null
(3.14e-04)
obtain
(2.82e-04)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
c
c
(9.96e-01)
ptr
(2.00e-03)
get
(1.04e-03)
%END%
(8.72e-04)
swig
(1.90e-04)
instance
(1.07e-04)
overlaps
(3.51e-05)
derived
(2.62e-05)
match
(7.06e-06)
is
(6.12e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
ptr
ptr
(9.96e-01)
c
(2.15e-03)
%END%
(1.61e-03)
obj
(1.88e-05)
0
(6.12e-06)
get
(6.07e-06)
return
(5.61e-06)
string
(2.74e-06)
instance
(2.57e-06)
swig
(2.31e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
%END%
%END%
(9.61e-01)
ptr
(3.23e-02)
obj
(8.25e-04)
c
(4.05e-04)
return
(2.33e-04)
string
(2.06e-04)
double
(1.33e-04)
at
(1.02e-04)
0
(9.89e-05)
swig
(5.39e-05)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
get,c,ptr
get
get
(9.83e-01)
c
(4.72e-03)
obj
(1.88e-03)
swig
(1.36e-03)
is
(8.93e-04)
return
(8.85e-04)
ptr
(5.54e-04)
0
(3.63e-04)
null
(3.14e-04)
obtain
(2.82e-04)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
c
c
(9.96e-01)
ptr
(2.00e-03)
get
(1.04e-03)
%END%
(8.72e-04)
swig
(1.90e-04)
instance
(1.07e-04)
overlaps
(3.51e-05)
derived
(2.62e-05)
match
(7.06e-06)
is
(6.12e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
ptr
ptr
(9.96e-01)
c
(2.15e-03)
%END%
(1.61e-03)
obj
(1.88e-05)
0
(6.12e-06)
get
(6.07e-06)
return
(5.61e-06)
string
(2.74e-06)
instance
(2.57e-06)
swig
(2.31e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
%END%
%END%
(9.61e-01)
ptr
(3.23e-02)
obj
(8.25e-04)
c
(4.05e-04)
return
(2.33e-04)
string
(2.06e-04)
double
(1.33e-04)
at
(1.02e-04)
0
(9.89e-05)
swig
(5.39e-05)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
set,compound,shape
set
set
(9.66e-01)
compound
(1.16e-02)
shape
(8.08e-03)
primitive
(6.10e-03)
manager
(2.10e-03)
c
(5.17e-04)
ptr
(4.49e-04)
collision
(3.46e-04)
impact
(3.43e-04)
get
(3.18e-04)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
set
(
swig
c
ptr
,
this
,
bt
g
impact
compound
shape
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
set
(
swig
c
ptr
,
this
,
bt
g
impact
compound
shape
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
compound
primitive
(9.62e-01)
manager
(2.23e-02)
compound
(1.29e-02)
%END%
(2.59e-03)
shape
(3.02e-05)
c
(1.76e-05)
get
(8.38e-06)
bt
(6.42e-06)
swig
(5.43e-06)
g
(5.18e-06)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
set
(
swig
c
ptr
,
this
,
bt
g
impact
compound
shape
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
set
(
swig
c
ptr
,
this
,
bt
g
impact
compound
shape
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
shape
manager
(7.77e-01)
compound
(1.87e-01)
primitive
(2.64e-02)
shape
(8.06e-03)
%END%
(1.27e-03)
ptr
(6.26e-05)
c
(5.12e-05)
set
(4.30e-05)
impact
(2.52e-05)
g
(2.45e-05)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
set
(
swig
c
ptr
,
this
,
bt
g
impact
compound
shape
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
set
(
swig
c
ptr
,
this
,
bt
g
impact
compound
shape
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
%END%
shape
(5.67e-01)
%END%
(3.00e-01)
compound
(1.04e-01)
set
(1.85e-02)
manager
(4.12e-03)
ptr
(1.71e-03)
c
(5.32e-04)
impact
(3.06e-04)
bt
(2.78e-04)
g
(2.43e-04)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
set
(
swig
c
ptr
,
this
,
bt
g
impact
compound
shape
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
set
(
swig
c
ptr
,
this
,
bt
g
impact
compound
shape
.
get
c
ptr
(
value
)
,
value
)
;
}
<SENTENCE_END/>
get,compound,shape
get
get
(9.67e-01)
compound
(1.07e-02)
primitive
(5.86e-03)
shape
(5.83e-03)
manager
(1.70e-03)
ptr
(1.08e-03)
c
(9.49e-04)
impact
(3.52e-04)
collision
(3.21e-04)
return
(2.68e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
compound
primitive
(9.68e-01)
manager
(1.63e-02)
compound
(1.34e-02)
%END%
(2.34e-03)
c
(3.14e-05)
shape
(2.23e-05)
ptr
(1.46e-05)
get
(9.64e-06)
bt
(7.68e-06)
collision
(6.64e-06)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
shape
manager
(8.21e-01)
compound
(1.35e-01)
primitive
(3.75e-02)
shape
(4.91e-03)
%END%
(1.15e-03)
ptr
(9.73e-05)
c
(5.76e-05)
get
(4.04e-05)
impact
(2.84e-05)
g
(2.42e-05)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
shape
(5.67e-01)
%END%
(2.80e-01)
compound
(1.12e-01)
get
(2.02e-02)
manager
(4.87e-03)
ptr
(2.80e-03)
c
(1.33e-03)
impact
(6.47e-04)
return
(5.15e-04)
g
(4.55e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
compound
primitive
manager
compound
shape
get
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
get,compound,primitive,manager
get
get
(9.62e-01)
compound
(1.50e-02)
shape
(5.61e-03)
primitive
(3.02e-03)
manager
(1.56e-03)
ptr
(1.36e-03)
c
(1.30e-03)
long
(4.86e-04)
collision
(4.56e-04)
impact
(4.32e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
compound
compound
(9.93e-01)
%END%
(3.06e-03)
primitive
(2.16e-03)
get
(1.70e-03)
c
(2.04e-05)
ptr
(1.18e-05)
bt
(7.50e-06)
long
(6.85e-06)
collision
(6.83e-06)
impact
(5.73e-06)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
primitive
primitive
(9.88e-01)
compound
(6.33e-03)
manager
(4.63e-03)
%END%
(6.34e-04)
ptr
(2.58e-05)
c
(2.33e-05)
g
(1.10e-05)
impact
(1.07e-05)
get
(8.63e-06)
bt
(8.17e-06)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
manager
manager
(5.67e-01)
%END%
(3.71e-01)
primitive
(5.47e-02)
ptr
(5.10e-04)
c
(4.46e-04)
shape
(3.65e-04)
compound
(3.31e-04)
bt
(1.94e-04)
impact
(1.50e-04)
null
(1.38e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.14e-01)
manager
(7.66e-02)
primitive
(2.74e-03)
c
(4.44e-04)
ptr
(3.27e-04)
shape
(2.94e-04)
bt
(2.28e-04)
compound
(2.08e-04)
impact
(1.10e-04)
null
(1.04e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
compound
primitive
manager
(
swig
c
ptr
,
this
)
;
return
(
c
ptr
==
0
)
?
null
:
new
bt
g
impact
compound
shape
.
compound
primitive
manager
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
add,child,shape
add
add
(8.84e-01)
child
(8.31e-02)
shape
(2.26e-02)
compound
(1.04e-03)
swig
(9.11e-04)
collision
(8.58e-04)
0
(6.65e-04)
c
(5.22e-04)
ptr
(4.57e-04)
local
(4.01e-04)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
0
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
0
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
child
child
(9.92e-01)
shape
(5.68e-03)
%END%
(1.35e-03)
add
(2.91e-04)
get
(3.64e-05)
%UNK%
(1.15e-05)
c
(9.89e-06)
string
(9.45e-06)
set
(9.33e-06)
draw
(7.27e-06)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
0
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
0
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
shape
shape
(9.92e-01)
%END%
(5.70e-03)
child
(1.81e-03)
ptr
(1.27e-05)
0
(1.23e-05)
c
(1.07e-05)
transform
(9.62e-06)
collision
(8.37e-06)
get
(6.80e-06)
bt
(5.99e-06)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
0
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
0
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.17e-01)
shape
(6.99e-02)
%UNK%
(4.05e-04)
bt
(2.58e-04)
set
(2.51e-04)
swig
(2.50e-04)
c
(2.13e-04)
get
(1.91e-04)
convex
(1.61e-04)
derived
(1.43e-04)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
0
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
0
(
swig
c
ptr
,
this
,
local
transform
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
add,child,shape
add
add
(8.88e-01)
child
(7.74e-02)
shape
(2.47e-02)
compound
(1.20e-03)
collision
(9.79e-04)
swig
(9.71e-04)
1
(6.28e-04)
c
(5.42e-04)
ptr
(4.52e-04)
bt
(3.54e-04)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
1
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
1
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
child
child
(9.92e-01)
shape
(5.97e-03)
%END%
(1.09e-03)
add
(3.22e-04)
get
(3.12e-05)
set
(1.58e-05)
%UNK%
(1.29e-05)
c
(1.23e-05)
ref
(9.68e-06)
draw
(9.49e-06)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
1
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
1
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
shape
shape
(9.93e-01)
%END%
(4.21e-03)
child
(1.70e-03)
1
(1.39e-05)
c
(1.03e-05)
ptr
(1.02e-05)
collision
(6.32e-06)
bt
(5.37e-06)
swig
(4.44e-06)
get
(4.21e-06)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
1
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
1
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.03e-01)
shape
(8.42e-02)
bt
(3.87e-04)
%UNK%
(3.34e-04)
swig
(3.28e-04)
set
(2.62e-04)
c
(2.49e-04)
derived
(1.99e-04)
convex
(1.44e-04)
take
(1.22e-04)
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
1
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
g
impact
compound
shape
add
child
shape
swig
1
(
swig
c
ptr
,
this
,
bt
collision
shape
.
get
c
ptr
(
shape
)
,
shape
)
;
}
<SENTENCE_END/>
get,child,shape
get
get
(9.44e-01)
child
(2.97e-02)
shape
(1.37e-02)
c
(9.61e-04)
ptr
(9.27e-04)
compound
(8.34e-04)
swig
(6.74e-04)
0
(5.80e-04)
collision
(5.77e-04)
long
(4.26e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
child
shape
swig
0
(
swig
c
ptr
,
this
,
index
)
;
return
(
c
ptr
==
0
)
?
null
:
bt
collision
shape
.
new
derived
object
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
child
shape
swig
0
(
swig
c
ptr
,
this
,
index
)
;
return
(
c
ptr
==
0
)
?
null
:
bt
collision
shape
.
new
derived
object
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
child
child
(9.94e-01)
shape
(3.35e-03)
%END%
(1.27e-03)
get
(6.59e-04)
c
(1.89e-05)
instance
(1.21e-05)
string
(1.10e-05)
%UNK%
(1.01e-05)
ptr
(8.68e-06)
derived
(8.32e-06)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
child
shape
swig
0
(
swig
c
ptr
,
this
,
index
)
;
return
(
c
ptr
==
0
)
?
null
:
bt
collision
shape
.
new
derived
object
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
child
shape
swig
0
(
swig
c
ptr
,
this
,
index
)
;
return
(
c
ptr
==
0
)
?
null
:
bt
collision
shape
.
new
derived
object
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
shape
shape
(9.96e-01)
child
(2.24e-03)
%END%
(1.39e-03)
ptr
(3.02e-05)
c
(2.53e-05)
0
(1.54e-05)
collision
(1.49e-05)
derived
(1.30e-05)
object
(1.20e-05)
new
(9.09e-06)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
child
shape
swig
0
(
swig
c
ptr
,
this
,
index
)
;
return
(
c
ptr
==
0
)
?
null
:
bt
collision
shape
.
new
derived
object
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
child
shape
swig
0
(
swig
c
ptr
,
this
,
index
)
;
return
(
c
ptr
==
0
)
?
null
:
bt
collision
shape
.
new
derived
object
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.01e-01)
shape
(1.76e-01)
c
(4.05e-04)
get
(2.91e-04)
swig
(2.56e-04)
%UNK%
(2.46e-04)
instance
(2.13e-04)
bt
(2.08e-04)
derived
(1.75e-04)
ptr
(1.45e-04)
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
child
shape
swig
0
(
swig
c
ptr
,
this
,
index
)
;
return
(
c
ptr
==
0
)
?
null
:
bt
collision
shape
.
new
derived
object
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
c
ptr
=
collision
jni
.
bt
g
impact
compound
shape
get
child
shape
swig
0
(
swig
c
ptr
,
this
,
index
)
;
return
(
c
ptr
==
0
)
?
null
:
bt
collision
shape
.
new
derived
object
(
c
ptr
,
false
)
;
}
<SENTENCE_END/>
get,attribute,type
get
get
(9.49e-01)
1L
(3.92e-03)
is
(3.10e-03)
return
(2.38e-03)
i
(2.28e-03)
to
(2.18e-03)
compare
(2.03e-03)
load
(1.28e-03)
types
(1.27e-03)
find
(1.09e-03)
<SENTENCE_START>
{
for
(
int
i
=
0
;
i
<
types
.
size
;
i
++
)
if
(
types
.
get
(
i
)
.
compare
to
(
alias
)
==
0
)
return
1L
<<
i
;
return
0
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
int
i
=
0
;
i
<
types
.
size
;
i
++
)
if
(
types
.
get
(
i
)
.
compare
to
(
alias
)
==
0
)
return
1L
<<
i
;
return
0
;
}
<SENTENCE_END/>
attribute
%END%
(2.66e-01)
get
(1.05e-01)
of
(7.74e-02)
types
(5.42e-02)
string
(2.46e-02)
to
(1.86e-02)
by
(1.61e-02)
int
(1.57e-02)
0
(1.41e-02)
index
(1.26e-02)
<SENTENCE_START>
{
for
(
int
i
=
0
;
i
<
types
.
size
;
i
++
)
if
(
types
.
get
(
i
)
.
compare
to
(
alias
)
==
0
)
return
1L
<<
i
;
return
0
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
int
i
=
0
;
i
<
types
.
size
;
i
++
)
if
(
types
.
get
(
i
)
.
compare
to
(
alias
)
==
0
)
return
1L
<<
i
;
return
0
;
}
<SENTENCE_END/>
type
%END%
(7.18e-01)
of
(3.15e-02)
string
(1.49e-02)
all
(1.30e-02)
by
(1.15e-02)
types
(1.09e-02)
int
(8.17e-03)
i
(7.48e-03)
value
(6.18e-03)
to
(6.04e-03)
<SENTENCE_START>
{
for
(
int
i
=
0
;
i
<
types
.
size
;
i
++
)
if
(
types
.
get
(
i
)
.
compare
to
(
alias
)
==
0
)
return
1L
<<
i
;
return
0
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
int
i
=
0
;
i
<
types
.
size
;
i
++
)
if
(
types
.
get
(
i
)
.
compare
to
(
alias
)
==
0
)
return
1L
<<
i
;
return
0
;
}
<SENTENCE_END/>
%END%
%END%
(9.13e-01)
of
(6.76e-03)
all
(6.12e-03)
string
(4.51e-03)
by
(3.87e-03)
i
(3.57e-03)
types
(3.35e-03)
0
(2.82e-03)
int
(2.33e-03)
value
(1.95e-03)
<SENTENCE_START>
{
for
(
int
i
=
0
;
i
<
types
.
size
;
i
++
)
if
(
types
.
get
(
i
)
.
compare
to
(
alias
)
==
0
)
return
1L
<<
i
;
return
0
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
int
i
=
0
;
i
<
types
.
size
;
i
++
)
if
(
types
.
get
(
i
)
.
compare
to
(
alias
)
==
0
)
return
1L
<<
i
;
return
0
;
}
<SENTENCE_END/>
get,attribute,alias
get
is
(3.01e-01)
has
(6.08e-02)
%UNK%
(4.68e-02)
find
(4.05e-02)
of
(1.83e-02)
0
(1.60e-02)
check
(1.52e-02)
state
(1.29e-02)
read
(1.27e-02)
next
(1.20e-02)
<SENTENCE_START>
{
int
idx
=
-
1
;
while
(
type
!=
0
&&
++
idx
<
63
&&
(
(
(
type
>>
idx
)
&
1
)
==
0
)
)
;
return
(
idx
>=
0
&&
idx
<
types
.
size
)
?
types
.
get
(
idx
)
:
null
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
idx
=
-
1
;
while
(
type
!=
0
&&
++
idx
<
63
&&
(
(
(
type
>>
idx
)
&
1
)
==
0
)
)
;
return
(
idx
>=
0
&&
idx
<
types
.
size
)
?
types
.
get
(
idx
)
:
null
;
}
<SENTENCE_END/>
attribute
%END%
(7.76e-01)
%UNK%
(1.96e-02)
string
(9.86e-03)
of
(6.28e-03)
in
(5.34e-03)
0
(5.11e-03)
types
(4.19e-03)
valid
(3.88e-03)
idx
(3.70e-03)
and
(3.38e-03)
<SENTENCE_START>
{
int
idx
=
-
1
;
while
(
type
!=
0
&&
++
idx
<
63
&&
(
(
(
type
>>
idx
)
&
1
)
==
0
)
)
;
return
(
idx
>=
0
&&
idx
<
types
.
size
)
?
types
.
get
(
idx
)
:
null
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
idx
=
-
1
;
while
(
type
!=
0
&&
++
idx
<
63
&&
(
(
(
type
>>
idx
)
&
1
)
==
0
)
)
;
return
(
idx
>=
0
&&
idx
<
types
.
size
)
?
types
.
get
(
idx
)
:
null
;
}
<SENTENCE_END/>
alias
%END%
(8.47e-01)
%UNK%
(1.14e-02)
string
(6.34e-03)
in
(4.19e-03)
of
(3.98e-03)
idx
(3.84e-03)
0
(3.64e-03)
and
(2.93e-03)
valid
(2.89e-03)
1
(2.83e-03)
<SENTENCE_START>
{
int
idx
=
-
1
;
while
(
type
!=
0
&&
++
idx
<
63
&&
(
(
(
type
>>
idx
)
&
1
)
==
0
)
)
;
return
(
idx
>=
0
&&
idx
<
types
.
size
)
?
types
.
get
(
idx
)
:
null
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
idx
=
-
1
;
while
(
type
!=
0
&&
++
idx
<
63
&&
(
(
(
type
>>
idx
)
&
1
)
==
0
)
)
;
return
(
idx
>=
0
&&
idx
<
types
.
size
)
?
types
.
get
(
idx
)
:
null
;
}
<SENTENCE_END/>
%END%
%END%
(9.40e-01)
idx
(3.93e-03)
types
(2.74e-03)
valid
(1.65e-03)
null
(1.64e-03)
string
(1.56e-03)
while
(1.45e-03)
at
(1.36e-03)
equal
(1.34e-03)
%UNK%
(1.32e-03)
<SENTENCE_START>
{
int
idx
=
-
1
;
while
(
type
!=
0
&&
++
idx
<
63
&&
(
(
(
type
>>
idx
)
&
1
)
==
0
)
)
;
return
(
idx
>=
0
&&
idx
<
types
.
size
)
?
types
.
get
(
idx
)
:
null
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
idx
=
-
1
;
while
(
type
!=
0
&&
++
idx
<
63
&&
(
(
(
type
>>
idx
)
&
1
)
==
0
)
)
;
return
(
idx
>=
0
&&
idx
<
types
.
size
)
?
types
.
get
(
idx
)
:
null
;
}
<SENTENCE_END/>
register
register
get
(9.71e-01)
return
(4.32e-03)
1L
(2.14e-03)
result
(2.03e-03)
types
(1.67e-03)
type
(1.11e-03)
obtain
(1.06e-03)
attribute
(8.88e-04)
size
(8.01e-04)
is
(7.73e-04)
<SENTENCE_START>
{
long
result
=
get
attribute
type
(
alias
)
;
if
(
result
>
0
)
return
result
;
types
.
add
(
alias
)
;
return
1L
<<
(
types
.
size
-
1
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
result
=
get
attribute
type
(
alias
)
;
if
(
result
>
0
)
return
result
;
types
.
add
(
alias
)
;
return
1L
<<
(
types
.
size
-
1
)
;
}
<SENTENCE_END/>
%END%
%END%
(5.23e-01)
get
(1.24e-01)
types
(5.16e-02)
1L
(2.26e-02)
type
(1.74e-02)
instance
(1.57e-02)
attribute
(1.20e-02)
%UNK%
(8.10e-03)
object
(7.56e-03)
result
(6.49e-03)
<SENTENCE_START>
{
long
result
=
get
attribute
type
(
alias
)
;
if
(
result
>
0
)
return
result
;
types
.
add
(
alias
)
;
return
1L
<<
(
types
.
size
-
1
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
long
result
=
get
attribute
type
(
alias
)
;
if
(
result
>
0
)
return
result
;
types
.
add
(
alias
)
;
return
1L
<<
(
types
.
size
-
1
)
;
}
<SENTENCE_END/>
equals
equals
hash
(9.67e-01)
code
(2.64e-02)
get
(1.07e-03)
equals
(8.44e-04)
return
(6.76e-04)
contains
(4.22e-04)
other
(3.62e-04)
assert
(2.80e-05)
put
(1.55e-05)
insert
(1.51e-05)
<SENTENCE_START>
{
return
other
.
hash
code
(
)
==
hash
code
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
other
.
hash
code
(
)
==
hash
code
(
)
;
}
<SENTENCE_END/>
%END%
hash
(5.56e-01)
%END%
(1.97e-01)
code
(7.23e-02)
equals
(6.05e-02)
and
(3.77e-02)
at
(8.37e-03)
test
(5.78e-03)
to
(5.33e-03)
digest
(2.90e-03)
changed
(2.88e-03)
<SENTENCE_START>
{
return
other
.
hash
code
(
)
==
hash
code
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
other
.
hash
code
(
)
==
hash
code
(
)
;
}
<SENTENCE_END/>
copy
copy
copy
(9.45e-01)
duplicate
(5.67e-03)
same
(5.19e-03)
equals
(5.02e-03)
to
(4.49e-03)
set
(3.46e-03)
read
(2.86e-03)
other
(2.06e-03)
buffer
(1.85e-03)
%END%
(1.72e-03)
<SENTENCE_START>
{
read
only
int
array
buffer
buf
=
new
read
only
int
array
buffer
(
other
.
capacity
(
)
,
other
.
backing
array
,
other
.
offset
)
;
buf
.
limit
=
other
.
limit
(
)
;
buf
.
position
=
other
.
position
(
)
;
buf
.
mark
=
mark
of
other
;
return
buf
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
read
only
int
array
buffer
buf
=
new
read
only
int
array
buffer
(
other
.
capacity
(
)
,
other
.
backing
array
,
other
.
offset
)
;
buf
.
limit
=
other
.
limit
(
)
;
buf
.
position
=
other
.
position
(
)
;
buf
.
mark
=
mark
of
other
;
return
buf
;
}
<SENTENCE_END/>
%END%
%END%
(7.92e-01)
copy
(8.25e-02)
to
(3.70e-02)
array
(1.31e-02)
read
(9.45e-03)
buffer
(4.58e-03)
only
(4.34e-03)
buf
(3.11e-03)
as
(2.63e-03)
slice
(2.39e-03)
<SENTENCE_START>
{
read
only
int
array
buffer
buf
=
new
read
only
int
array
buffer
(
other
.
capacity
(
)
,
other
.
backing
array
,
other
.
offset
)
;
buf
.
limit
=
other
.
limit
(
)
;
buf
.
position
=
other
.
position
(
)
;
buf
.
mark
=
mark
of
other
;
return
buf
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
read
only
int
array
buffer
buf
=
new
read
only
int
array
buffer
(
other
.
capacity
(
)
,
other
.
backing
array
,
other
.
offset
)
;
buf
.
limit
=
other
.
limit
(
)
;
buf
.
position
=
other
.
position
(
)
;
buf
.
mark
=
mark
of
other
;
return
buf
;
}
<SENTENCE_END/>
as,read,only,buffer
as
duplicate
(6.57e-01)
as
(3.35e-01)
copy
(3.14e-03)
get
(1.56e-03)
read
(8.18e-04)
return
(7.08e-04)
is
(2.08e-04)
iterator
(1.52e-04)
mark
(8.60e-05)
protected
(2.12e-05)
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
read
as
(3.11e-01)
duplicate
(1.37e-01)
copy
(7.03e-02)
read
(6.97e-02)
%END%
(5.33e-02)
%UNK%
(3.21e-02)
to
(1.79e-02)
only
(1.53e-02)
buffer
(1.27e-02)
array
(1.09e-02)
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
only
%END%
(4.97e-01)
only
(3.55e-02)
%UNK%
(2.74e-02)
as
(2.31e-02)
array
(2.18e-02)
buffer
(2.03e-02)
value
(1.93e-02)
read
(1.65e-02)
int
(1.08e-02)
string
(1.07e-02)
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
buffer
%END%
(8.95e-01)
value
(1.08e-02)
only
(1.03e-02)
array
(4.35e-03)
20
(4.22e-03)
buffer
(3.56e-03)
%UNK%
(2.65e-03)
file
(2.44e-03)
offset
(2.20e-03)
float
(1.92e-03)
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.27e-01)
value
(7.98e-03)
only
(6.23e-03)
20
(3.32e-03)
array
(2.31e-03)
buffer
(1.84e-03)
offset
(1.63e-03)
duplicate
(1.42e-03)
file
(1.37e-03)
accessible
(1.21e-03)
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
duplicate
(
)
;
}
<SENTENCE_END/>
compact
compact
put
(7.45e-01)
compact
(1.43e-01)
protected
(8.45e-02)
double
(2.82e-03)
exception
(2.79e-03)
long
(2.42e-03)
array
(2.33e-03)
int
(1.79e-03)
read
(1.76e-03)
new
(1.75e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(5.42e-01)
array
(1.10e-01)
double
(4.50e-02)
long
(4.35e-02)
short
(4.25e-02)
int
(3.47e-02)
offset
(3.02e-02)
only
(2.28e-02)
buffer
(1.72e-02)
protected
(1.43e-02)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
duplicate
duplicate
duplicate
(8.83e-01)
copy
(6.61e-02)
as
(3.49e-02)
mark
(4.79e-03)
read
(2.36e-03)
iterator
(1.63e-03)
set
(7.55e-04)
cpy
(7.02e-04)
this
(5.01e-04)
get
(4.72e-04)
<SENTENCE_START>
{
return
copy
(
this
,
mark
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
copy
(
this
,
mark
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.76e-01)
mark
(2.13e-03)
array
(1.87e-03)
only
(1.60e-03)
at
(8.02e-04)
%UNK%
(7.55e-04)
value
(6.28e-04)
buffer
(5.02e-04)
short
(4.94e-04)
string
(3.80e-04)
<SENTENCE_START>
{
return
copy
(
this
,
mark
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
copy
(
this
,
mark
)
;
}
<SENTENCE_END/>
is,read,only
is
is
(3.66e-01)
needs
(1.61e-01)
protected
(1.40e-01)
has
(1.02e-01)
read
(8.25e-02)
can
(5.77e-02)
get
(1.54e-02)
should
(1.32e-02)
mark
(1.21e-02)
duplicate
(5.49e-03)
<SENTENCE_START>
{
return
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
true
;
}
<SENTENCE_END/>
read
has
(2.39e-01)
read
(2.12e-01)
array
(8.34e-02)
gl
(6.77e-02)
protected
(5.67e-02)
only
(3.74e-02)
needs
(2.85e-02)
can
(2.51e-02)
exit
(2.35e-02)
%UNK%
(1.84e-02)
<SENTENCE_START>
{
return
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
true
;
}
<SENTENCE_END/>
only
%END%
(5.66e-01)
only
(8.77e-02)
20
(6.57e-02)
array
(5.95e-02)
value
(2.36e-02)
offset
(1.68e-02)
gl
(1.12e-02)
file
(7.67e-03)
%UNK%
(6.37e-03)
up
(3.71e-03)
<SENTENCE_START>
{
return
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
true
;
}
<SENTENCE_END/>
%END%
%END%
(9.16e-01)
only
(1.39e-02)
20
(1.32e-02)
value
(1.06e-02)
array
(4.81e-03)
offset
(3.65e-03)
file
(1.44e-03)
accessible
(1.18e-03)
buffer
(1.00e-03)
count
(8.41e-04)
<SENTENCE_START>
{
return
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
true
;
}
<SENTENCE_END/>
protected,array
protected
put
(7.45e-01)
compact
(1.43e-01)
protected
(8.45e-02)
double
(2.82e-03)
exception
(2.79e-03)
long
(2.42e-03)
array
(2.33e-03)
int
(1.79e-03)
read
(1.76e-03)
new
(1.75e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
array
%END%
(5.42e-01)
array
(1.10e-01)
double
(4.50e-02)
long
(4.35e-02)
short
(4.25e-02)
int
(3.47e-02)
offset
(3.02e-02)
only
(2.28e-02)
buffer
(1.72e-02)
protected
(1.43e-02)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.16e-01)
array
(6.16e-02)
short
(2.84e-02)
double
(2.72e-02)
long
(2.27e-02)
int
(2.05e-02)
offset
(1.90e-02)
only
(1.29e-02)
buffer
(1.16e-02)
float
(7.26e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
protected,array,offset
protected
put
(7.45e-01)
compact
(1.43e-01)
protected
(8.45e-02)
double
(2.82e-03)
exception
(2.79e-03)
long
(2.42e-03)
array
(2.33e-03)
int
(1.79e-03)
read
(1.76e-03)
new
(1.75e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
array
%END%
(5.42e-01)
array
(1.10e-01)
double
(4.50e-02)
long
(4.35e-02)
short
(4.25e-02)
int
(3.47e-02)
offset
(3.02e-02)
only
(2.28e-02)
buffer
(1.72e-02)
protected
(1.43e-02)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
offset
%END%
(7.16e-01)
array
(6.16e-02)
short
(2.84e-02)
double
(2.72e-02)
long
(2.27e-02)
int
(2.05e-02)
offset
(1.90e-02)
only
(1.29e-02)
buffer
(1.16e-02)
float
(7.26e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.40e-01)
only
(1.18e-02)
array
(8.06e-03)
offset
(4.65e-03)
exception
(4.05e-03)
buffer
(3.95e-03)
double
(3.67e-03)
short
(2.68e-03)
20
(2.53e-03)
value
(2.51e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
protected,has,array
protected
is
(3.21e-01)
needs
(1.96e-01)
protected
(1.17e-01)
has
(7.46e-02)
read
(4.75e-02)
scrolled
(4.60e-02)
mark
(3.90e-02)
key
(2.75e-02)
touch
(2.22e-02)
mouse
(1.38e-02)
<SENTENCE_START>
{
return
false
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
false
;
}
<SENTENCE_END/>
has
gl
(9.17e-02)
down
(7.47e-02)
direct
(7.00e-02)
up
(5.72e-02)
key
(5.51e-02)
has
(5.15e-02)
typed
(4.93e-02)
20
(4.05e-02)
%UNK%
(3.88e-02)
read
(3.72e-02)
<SENTENCE_START>
{
return
false
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
false
;
}
<SENTENCE_END/>
array
%END%
(2.57e-01)
20
(1.05e-01)
only
(8.62e-02)
array
(5.72e-02)
gl
(4.41e-02)
up
(4.17e-02)
down
(3.41e-02)
direct
(2.97e-02)
%UNK%
(2.49e-02)
typed
(1.80e-02)
<SENTENCE_START>
{
return
false
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
false
;
}
<SENTENCE_END/>
%END%
%END%
(9.19e-01)
20
(1.40e-02)
only
(1.19e-02)
value
(9.49e-03)
array
(3.59e-03)
offset
(2.49e-03)
buffer
(1.42e-03)
accessible
(1.02e-03)
file
(9.72e-04)
count
(9.63e-04)
<SENTENCE_START>
{
return
false
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
false
;
}
<SENTENCE_END/>
put
put
put
(7.45e-01)
compact
(1.43e-01)
protected
(8.45e-02)
double
(2.82e-03)
exception
(2.79e-03)
long
(2.42e-03)
array
(2.33e-03)
int
(1.79e-03)
read
(1.76e-03)
new
(1.75e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(5.42e-01)
array
(1.10e-01)
double
(4.50e-02)
long
(4.35e-02)
short
(4.25e-02)
int
(3.47e-02)
offset
(3.02e-02)
only
(2.28e-02)
buffer
(1.72e-02)
protected
(1.43e-02)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
put
put
put
(7.45e-01)
compact
(1.43e-01)
protected
(8.45e-02)
double
(2.82e-03)
exception
(2.79e-03)
long
(2.42e-03)
array
(2.33e-03)
int
(1.79e-03)
read
(1.76e-03)
new
(1.75e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(5.42e-01)
array
(1.10e-01)
double
(4.50e-02)
long
(4.35e-02)
short
(4.25e-02)
int
(3.47e-02)
offset
(3.02e-02)
only
(2.28e-02)
buffer
(1.72e-02)
protected
(1.43e-02)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
put
put
put
(7.45e-01)
compact
(1.43e-01)
protected
(8.45e-02)
double
(2.82e-03)
exception
(2.79e-03)
long
(2.42e-03)
array
(2.33e-03)
int
(1.79e-03)
read
(1.76e-03)
new
(1.75e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(5.42e-01)
array
(1.10e-01)
double
(4.50e-02)
long
(4.35e-02)
short
(4.25e-02)
int
(3.47e-02)
offset
(3.02e-02)
only
(2.28e-02)
buffer
(1.72e-02)
protected
(1.43e-02)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
put
put
put
(7.45e-01)
compact
(1.43e-01)
protected
(8.45e-02)
double
(2.82e-03)
exception
(2.79e-03)
long
(2.42e-03)
array
(2.33e-03)
int
(1.79e-03)
read
(1.76e-03)
new
(1.75e-03)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(5.42e-01)
array
(1.10e-01)
double
(4.50e-02)
long
(4.35e-02)
short
(4.25e-02)
int
(3.47e-02)
offset
(3.02e-02)
only
(2.28e-02)
buffer
(1.72e-02)
protected
(1.43e-02)
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
throw
new
read
only
buffer
exception
(
)
;
}
<SENTENCE_END/>
slice
slice
slice
(9.91e-01)
remaining
(1.16e-03)
buffer
(6.97e-04)
array
(6.44e-04)
only
(5.37e-04)
read
(4.79e-04)
backing
(4.15e-04)
offset
(3.70e-04)
int
(3.33e-04)
new
(2.87e-04)
<SENTENCE_START>
{
return
new
read
only
int
array
buffer
(
remaining
(
)
,
backing
array
,
offset
+
position
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
read
only
int
array
buffer
(
remaining
(
)
,
backing
array
,
offset
+
position
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.70e-01)
array
(7.28e-02)
slice
(8.71e-03)
all
(8.69e-03)
short
(6.69e-03)
int
(4.44e-03)
offset
(4.29e-03)
long
(2.96e-03)
only
(2.33e-03)
byte
(2.31e-03)
<SENTENCE_START>
{
return
new
read
only
int
array
buffer
(
remaining
(
)
,
backing
array
,
offset
+
position
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
read
only
int
array
buffer
(
remaining
(
)
,
backing
array
,
offset
+
position
)
;
}
<SENTENCE_END/>
left
left
is
(5.85e-01)
get
(2.07e-01)
button
(6.17e-02)
pressed
(5.85e-02)
to
(1.20e-02)
mouse
(8.54e-03)
touch
(7.52e-03)
initialize
(5.40e-03)
key
(4.79e-03)
scrolled
(4.00e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
left
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
left
)
;
}
<SENTENCE_END/>
%END%
button
(3.71e-01)
%END%
(3.52e-01)
pressed
(2.29e-01)
to
(5.45e-03)
down
(4.18e-03)
is
(2.88e-03)
key
(2.20e-03)
moved
(2.03e-03)
gdx
(1.34e-03)
status
(1.20e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
left
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
left
)
;
}
<SENTENCE_END/>
left
left
get
(8.23e-01)
is
(1.57e-01)
button
(2.37e-03)
remove
(2.27e-03)
has
(1.68e-03)
add
(1.58e-03)
contains
(1.57e-03)
to
(1.34e-03)
return
(6.58e-04)
append
(6.23e-04)
<SENTENCE_START>
{
return
button
==
buttons
.
left
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
button
==
buttons
.
left
;
}
<SENTENCE_END/>
%END%
button
(9.15e-01)
to
(1.21e-02)
%END%
(1.00e-02)
left
(6.64e-03)
get
(6.11e-03)
pressed
(5.62e-03)
size
(3.52e-03)
add
(2.30e-03)
text
(2.04e-03)
hit
(1.83e-03)
<SENTENCE_START>
{
return
button
==
buttons
.
left
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
button
==
buttons
.
left
;
}
<SENTENCE_END/>
right
right
is
(5.61e-01)
get
(1.95e-01)
button
(7.53e-02)
pressed
(7.21e-02)
to
(1.28e-02)
mouse
(9.64e-03)
touch
(8.53e-03)
initialize
(5.96e-03)
key
(4.98e-03)
scrolled
(4.09e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
right
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
right
)
;
}
<SENTENCE_END/>
%END%
button
(4.36e-01)
pressed
(2.65e-01)
%END%
(2.41e-01)
down
(5.85e-03)
to
(5.66e-03)
is
(3.29e-03)
moved
(2.48e-03)
key
(2.36e-03)
right
(1.95e-03)
next
(1.57e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
right
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
right
)
;
}
<SENTENCE_END/>
right
right
get
(8.20e-01)
is
(1.59e-01)
remove
(2.43e-03)
button
(2.39e-03)
has
(1.90e-03)
add
(1.45e-03)
contains
(1.42e-03)
to
(1.35e-03)
return
(6.63e-04)
append
(6.59e-04)
<SENTENCE_START>
{
return
button
==
buttons
.
right
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
button
==
buttons
.
right
;
}
<SENTENCE_END/>
%END%
button
(9.28e-01)
right
(1.23e-02)
to
(7.77e-03)
get
(5.15e-03)
pressed
(4.05e-03)
%END%
(3.65e-03)
size
(2.99e-03)
text
(1.91e-03)
hit
(1.69e-03)
remove
(1.43e-03)
<SENTENCE_START>
{
return
button
==
buttons
.
right
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
button
==
buttons
.
right
;
}
<SENTENCE_END/>
middle
middle
is
(3.27e-01)
pressed
(2.30e-01)
get
(2.02e-01)
button
(1.07e-01)
to
(1.93e-02)
mouse
(1.30e-02)
touch
(1.06e-02)
initialize
(9.55e-03)
key
(7.15e-03)
scrolled
(3.59e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
middle
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
middle
)
;
}
<SENTENCE_END/>
%END%
button
(5.50e-01)
%END%
(1.94e-01)
pressed
(1.55e-01)
middle
(4.40e-02)
status
(1.02e-02)
to
(3.20e-03)
managed
(2.22e-03)
get
(2.14e-03)
is
(2.14e-03)
down
(1.80e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
middle
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
button
pressed
(
buttons
.
middle
)
;
}
<SENTENCE_END/>
middle
middle
get
(8.98e-01)
is
(8.21e-02)
to
(2.46e-03)
button
(2.43e-03)
remove
(2.38e-03)
add
(2.28e-03)
has
(1.07e-03)
contains
(8.54e-04)
return
(6.41e-04)
buttons
(6.37e-04)
<SENTENCE_START>
{
return
button
==
buttons
.
middle
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
button
==
buttons
.
middle
;
}
<SENTENCE_END/>
%END%
button
(8.09e-01)
middle
(1.00e-01)
get
(4.90e-02)
to
(4.47e-03)
pressed
(2.66e-03)
%END%
(2.14e-03)
text
(1.12e-03)
by
(7.57e-04)
managed
(7.55e-04)
ui
(7.40e-04)
<SENTENCE_START>
{
return
button
==
buttons
.
middle
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
button
==
buttons
.
middle
;
}
<SENTENCE_END/>
shift
shift
key
(8.90e-01)
is
(3.34e-02)
keys
(1.44e-02)
scrolled
(9.87e-03)
pressed
(9.54e-03)
contains
(9.12e-03)
down
(5.07e-03)
get
(3.60e-03)
shift
(1.74e-03)
gdx
(1.50e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
;
}
<SENTENCE_END/>
%END%
key
(6.12e-01)
%END%
(2.38e-01)
pressed
(4.50e-02)
down
(4.48e-02)
keys
(6.97e-03)
is
(6.46e-03)
scrolled
(3.03e-03)
to
(2.59e-03)
up
(2.58e-03)
gdx
(2.16e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
key
pressed
(
keys
.
shift
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
shift
right
)
;
}
<SENTENCE_END/>
shift
shift
key
(9.47e-01)
keys
(2.66e-02)
keycode
(1.06e-02)
contains
(6.01e-03)
viewports
(2.51e-03)
return
(1.86e-03)
shift
(8.21e-04)
scrolled
(6.50e-04)
left
(1.41e-04)
right
(1.15e-04)
<SENTENCE_START>
{
return
keycode
==
keys
.
shift
left
||
keycode
==
keys
.
shift
right
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
keycode
==
keys
.
shift
left
||
keycode
==
keys
.
shift
right
;
}
<SENTENCE_END/>
%END%
key
(8.45e-01)
keys
(7.47e-02)
keycode
(3.13e-02)
down
(1.66e-02)
viewports
(6.98e-03)
shift
(6.07e-03)
contains
(4.43e-03)
right
(3.63e-03)
up
(1.99e-03)
character
(1.61e-03)
<SENTENCE_START>
{
return
keycode
==
keys
.
shift
left
||
keycode
==
keys
.
shift
right
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
keycode
==
keys
.
shift
left
||
keycode
==
keys
.
shift
right
;
}
<SENTENCE_END/>
ctrl
ctrl
key
(8.46e-01)
is
(7.83e-02)
pressed
(1.54e-02)
scrolled
(1.51e-02)
get
(5.45e-03)
keys
(5.10e-03)
down
(4.51e-03)
contains
(3.53e-03)
gdx
(2.31e-03)
return
(2.23e-03)
<SENTENCE_START>
{
if
(
is
mac
)
return
gdx
.
input
.
is
key
pressed
(
keys
.
sym
)
;
else
return
gdx
.
input
.
is
key
pressed
(
keys
.
control
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
control
right
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
is
mac
)
return
gdx
.
input
.
is
key
pressed
(
keys
.
sym
)
;
else
return
gdx
.
input
.
is
key
pressed
(
keys
.
control
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
control
right
)
;
}
<SENTENCE_END/>
%END%
%END%
(4.28e-01)
key
(3.95e-01)
pressed
(6.65e-02)
down
(3.97e-02)
is
(1.11e-02)
scrolled
(3.55e-03)
gdx
(3.22e-03)
keys
(2.83e-03)
input
(2.75e-03)
to
(2.69e-03)
<SENTENCE_START>
{
if
(
is
mac
)
return
gdx
.
input
.
is
key
pressed
(
keys
.
sym
)
;
else
return
gdx
.
input
.
is
key
pressed
(
keys
.
control
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
control
right
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
is
mac
)
return
gdx
.
input
.
is
key
pressed
(
keys
.
sym
)
;
else
return
gdx
.
input
.
is
key
pressed
(
keys
.
control
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
control
right
)
;
}
<SENTENCE_END/>
ctrl
ctrl
key
(9.53e-01)
keycode
(2.07e-02)
keys
(7.52e-03)
viewports
(4.73e-03)
return
(4.66e-03)
contains
(2.29e-03)
scrolled
(6.21e-04)
else
(4.32e-04)
control
(3.33e-04)
left
(1.69e-04)
<SENTENCE_START>
{
if
(
is
mac
)
return
keycode
==
keys
.
sym
;
else
return
keycode
==
keys
.
control
left
||
keycode
==
keys
.
control
right
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
is
mac
)
return
keycode
==
keys
.
sym
;
else
return
keycode
==
keys
.
control
left
||
keycode
==
keys
.
control
right
;
}
<SENTENCE_END/>
%END%
key
(8.92e-01)
keycode
(3.13e-02)
down
(2.51e-02)
keys
(2.48e-02)
viewports
(3.49e-03)
right
(2.53e-03)
up
(2.46e-03)
return
(2.10e-03)
control
(1.54e-03)
scrolled
(1.16e-03)
<SENTENCE_START>
{
if
(
is
mac
)
return
keycode
==
keys
.
sym
;
else
return
keycode
==
keys
.
control
left
||
keycode
==
keys
.
control
right
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
is
mac
)
return
keycode
==
keys
.
sym
;
else
return
keycode
==
keys
.
control
left
||
keycode
==
keys
.
control
right
;
}
<SENTENCE_END/>
alt
alt
key
(8.95e-01)
is
(3.92e-02)
pressed
(1.81e-02)
scrolled
(1.14e-02)
keys
(7.30e-03)
down
(5.35e-03)
get
(2.95e-03)
contains
(2.56e-03)
gdx
(1.46e-03)
input
(1.23e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
key
pressed
(
keys
.
alt
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
alt
right
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
key
pressed
(
keys
.
alt
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
alt
right
)
;
}
<SENTENCE_END/>
%END%
key
(4.96e-01)
%END%
(3.64e-01)
pressed
(4.97e-02)
down
(4.06e-02)
is
(6.83e-03)
keys
(4.10e-03)
alt
(3.02e-03)
right
(2.80e-03)
scrolled
(2.39e-03)
up
(2.16e-03)
<SENTENCE_START>
{
return
gdx
.
input
.
is
key
pressed
(
keys
.
alt
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
alt
right
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gdx
.
input
.
is
key
pressed
(
keys
.
alt
left
)
||
gdx
.
input
.
is
key
pressed
(
keys
.
alt
right
)
;
}
<SENTENCE_END/>
alt
alt
key
(9.59e-01)
keys
(2.14e-02)
keycode
(8.95e-03)
viewports
(2.62e-03)
contains
(2.18e-03)
return
(1.66e-03)
scrolled
(6.00e-04)
alt
(3.42e-04)
left
(1.33e-04)
right
(7.77e-05)
<SENTENCE_START>
{
return
keycode
==
keys
.
alt
left
||
keycode
==
keys
.
alt
right
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
keycode
==
keys
.
alt
left
||
keycode
==
keys
.
alt
right
;
}
<SENTENCE_END/>
%END%
key
(8.43e-01)
keys
(5.33e-02)
keycode
(4.61e-02)
down
(2.43e-02)
viewports
(1.25e-02)
alt
(6.67e-03)
right
(4.51e-03)
up
(2.61e-03)
return
(1.42e-03)
character
(8.64e-04)
<SENTENCE_START>
{
return
keycode
==
keys
.
alt
left
||
keycode
==
keys
.
alt
right
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
keycode
==
keys
.
alt
left
||
keycode
==
keys
.
alt
right
;
}
<SENTENCE_END/>
to,barycoord
to
%UNK%
(1.32e-01)
set
(1.18e-01)
intersect
(4.56e-02)
cross
(4.22e-02)
get
(3.96e-02)
mul
(3.67e-02)
to
(3.17e-02)
create
(2.33e-02)
ray
(2.12e-02)
rotate
(1.90e-02)
<SENTENCE_START>
{
vector
2
v
0
=
tmp
1
.
set
(
b
)
.
sub
(
a
)
;
vector
2
v
1
=
tmp
2
.
set
(
c
)
.
sub
(
a
)
;
vector
2
v
2
=
tmp
3
.
set
(
p
)
.
sub
(
a
)
;
float
d
00
=
v
0
.
dot
(
v
0
)
;
float
d
01
=
v
0
.
dot
(
v
1
)
;
float
d
11
=
v
1
.
dot
(
v
1
)
;
float
d
20
=
v
2
.
dot
(
v
0
)
;
float
d
21
=
v
2
.
dot
(
v
1
)
;
float
denom
=
d
00
*
d
11
-
d
01
*
d
01
;
barycentric
out
.
x
=
(
d
11
*
d
20
-
d
01
*
d
21
)
/
denom
;
barycentric
out
.
y
=
(
d
00
*
d
21
-
d
01
*
d
20
)
/
denom
;
return
barycentric
out
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
vector
2
v
0
=
tmp
1
.
set
(
b
)
.
sub
(
a
)
;
vector
2
v
1
=
tmp
2
.
set
(
c
)
.
sub
(
a
)
;
vector
2
v
2
=
tmp
3
.
set
(
p
)
.
sub
(
a
)
;
float
d
00
=
v
0
.
dot
(
v
0
)
;
float
d
01
=
v
0
.
dot
(
v
1
)
;
float
d
11
=
v
1
.
dot
(
v
1
)
;
float
d
20
=
v
2
.
dot
(
v
0
)
;
float
d
21
=
v
2
.
dot
(
v
1
)
;
float
denom
=
d
00
*
d
11
-
d
01
*
d
01
;
barycentric
out
.
x
=
(
d
11
*
d
20
-
d
01
*
d
21
)
/
denom
;
barycentric
out
.
y
=
(
d
00
*
d
21
-
d
01
*
d
20
)
/
denom
;
return
barycentric
out
;
}
<SENTENCE_END/>
barycoord
%END%
(3.07e-01)
barycentric
(7.99e-02)
%UNK%
(5.97e-02)
2
(5.56e-02)
d
(2.66e-02)
to
(2.10e-02)
out
(2.02e-02)
ray
(1.73e-02)
v
(1.44e-02)
3
(1.36e-02)
<SENTENCE_START>
{
vector
2
v
0
=
tmp
1
.
set
(
b
)
.
sub
(
a
)
;
vector
2
v
1
=
tmp
2
.
set
(
c
)
.
sub
(
a
)
;
vector
2
v
2
=
tmp
3
.
set
(
p
)
.
sub
(
a
)
;
float
d
00
=
v
0
.
dot
(
v
0
)
;
float
d
01
=
v
0
.
dot
(
v
1
)
;
float
d
11
=
v
1
.
dot
(
v
1
)
;
float
d
20
=
v
2
.
dot
(
v
0
)
;
float
d
21
=
v
2
.
dot
(
v
1
)
;
float
denom
=
d
00
*
d
11
-
d
01
*
d
01
;
barycentric
out
.
x
=
(
d
11
*
d
20
-
d
01
*
d
21
)
/
denom
;
barycentric
out
.
y
=
(
d
00
*
d
21
-
d
01
*
d
20
)
/
denom
;
return
barycentric
out
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
vector
2
v
0
=
tmp
1
.
set
(
b
)
.
sub
(
a
)
;
vector
2
v
1
=
tmp
2
.
set
(
c
)
.
sub
(
a
)
;
vector
2
v
2
=
tmp
3
.
set
(
p
)
.
sub
(
a
)
;
float
d
00
=
v
0
.
dot
(
v
0
)
;
float
d
01
=
v
0
.
dot
(
v
1
)
;
float
d
11
=
v
1
.
dot
(
v
1
)
;
float
d
20
=
v
2
.
dot
(
v
0
)
;
float
d
21
=
v
2
.
dot
(
v
1
)
;
float
denom
=
d
00
*
d
11
-
d
01
*
d
01
;
barycentric
out
.
x
=
(
d
11
*
d
20
-
d
01
*
d
21
)
/
denom
;
barycentric
out
.
y
=
(
d
00
*
d
21
-
d
01
*
d
20
)
/
denom
;
return
barycentric
out
;
}
<SENTENCE_END/>
%END%
%END%
(6.05e-01)
out
(5.96e-02)
2
(3.60e-02)
d
(2.18e-02)
%UNK%
(2.09e-02)
barycentric
(1.32e-02)
3
(9.26e-03)
v
(8.75e-03)
to
(7.97e-03)
float
(6.95e-03)
<SENTENCE_START>
{
vector
2
v
0
=
tmp
1
.
set
(
b
)
.
sub
(
a
)
;
vector
2
v
1
=
tmp
2
.
set
(
c
)
.
sub
(
a
)
;
vector
2
v
2
=
tmp
3
.
set
(
p
)
.
sub
(
a
)
;
float
d
00
=
v
0
.
dot
(
v
0
)
;
float
d
01
=
v
0
.
dot
(
v
1
)
;
float
d
11
=
v
1
.
dot
(
v
1
)
;
float
d
20
=
v
2
.
dot
(
v
0
)
;
float
d
21
=
v
2
.
dot
(
v
1
)
;
float
denom
=
d
00
*
d
11
-
d
01
*
d
01
;
barycentric
out
.
x
=
(
d
11
*
d
20
-
d
01
*
d
21
)
/
denom
;
barycentric
out
.
y
=
(
d
00
*
d
21
-
d
01
*
d
20
)
/
denom
;
return
barycentric
out
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
vector
2
v
0
=
tmp
1
.
set
(
b
)
.
sub
(
a
)
;
vector
2
v
1
=
tmp
2
.
set
(
c
)
.
sub
(
a
)
;
vector
2
v
2
=
tmp
3
.
set
(
p
)
.
sub
(
a
)
;
float
d
00
=
v
0
.
dot
(
v
0
)
;
float
d
01
=
v
0
.
dot
(
v
1
)
;
float
d
11
=
v
1
.
dot
(
v
1
)
;
float
d
20
=
v
2
.
dot
(
v
0
)
;
float
d
21
=
v
2
.
dot
(
v
1
)
;
float
denom
=
d
00
*
d
11
-
d
01
*
d
01
;
barycentric
out
.
x
=
(
d
11
*
d
20
-
d
01
*
d
21
)
/
denom
;
barycentric
out
.
y
=
(
d
00
*
d
21
-
d
01
*
d
20
)
/
denom
;
return
barycentric
out
;
}
<SENTENCE_END/>
barycoord,inside,triangle
barycoord
is
(2.23e-01)
hit
(1.19e-01)
contains
(6.80e-02)
%END%
(3.37e-02)
has
(3.20e-02)
choose
(3.16e-02)
find
(2.86e-02)
insert
(2.40e-02)
next
(2.17e-02)
word
(1.72e-02)
<SENTENCE_START>
{
return
barycentric
.
x
>=
0
&&
barycentric
.
y
>=
0
&&
barycentric
.
x
+
barycentric
.
y
<=
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
barycentric
.
x
>=
0
&&
barycentric
.
y
>=
0
&&
barycentric
.
x
+
barycentric
.
y
<=
1
;
}
<SENTENCE_END/>
inside
%END%
(4.86e-01)
barycentric
(3.30e-02)
hit
(3.22e-02)
%START%
(1.79e-02)
set
(1.54e-02)
is
(1.49e-02)
next
(1.22e-02)
edge
(9.90e-03)
draw
(8.18e-03)
up
(7.39e-03)
<SENTENCE_START>
{
return
barycentric
.
x
>=
0
&&
barycentric
.
y
>=
0
&&
barycentric
.
x
+
barycentric
.
y
<=
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
barycentric
.
x
>=
0
&&
barycentric
.
y
>=
0
&&
barycentric
.
x
+
barycentric
.
y
<=
1
;
}
<SENTENCE_END/>
triangle
%END%
(7.79e-01)
edge
(7.76e-03)
at
(7.29e-03)
%UNK%
(5.45e-03)
hit
(5.23e-03)
up
(4.47e-03)
next
(4.35e-03)
barycentric
(3.84e-03)
y
(3.40e-03)
down
(3.19e-03)
<SENTENCE_START>
{
return
barycentric
.
x
>=
0
&&
barycentric
.
y
>=
0
&&
barycentric
.
x
+
barycentric
.
y
<=
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
barycentric
.
x
>=
0
&&
barycentric
.
y
>=
0
&&
barycentric
.
x
+
barycentric
.
y
<=
1
;
}
<SENTENCE_END/>
%END%
%END%
(9.14e-01)
barycentric
(6.67e-03)
at
(4.30e-03)
y
(2.78e-03)
edge
(2.53e-03)
1
(2.18e-03)
%UNK%
(2.05e-03)
value
(2.04e-03)
x
(1.79e-03)
up
(1.44e-03)
<SENTENCE_START>
{
return
barycentric
.
x
>=
0
&&
barycentric
.
y
>=
0
&&
barycentric
.
x
+
barycentric
.
y
<=
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
barycentric
.
x
>=
0
&&
barycentric
.
y
>=
0
&&
barycentric
.
x
+
barycentric
.
y
<=
1
;
}
<SENTENCE_END/>
from,barycoord
from
%END%
(2.71e-01)
get
(2.07e-01)
set
(4.50e-02)
mul
(3.84e-02)
%UNK%
(2.13e-02)
%START%
(1.58e-02)
add
(1.38e-02)
pick
(1.32e-02)
dst
(1.31e-02)
scale
(9.40e-03)
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
interpolated
out
.
x
=
u
*
a
.
x
+
barycentric
.
x
*
b
.
x
+
barycentric
.
y
*
c
.
x
;
interpolated
out
.
y
=
u
*
a
.
y
+
barycentric
.
x
*
b
.
y
+
barycentric
.
y
*
c
.
y
;
return
interpolated
out
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
interpolated
out
.
x
=
u
*
a
.
x
+
barycentric
.
x
*
b
.
x
+
barycentric
.
y
*
c
.
x
;
interpolated
out
.
y
=
u
*
a
.
y
+
barycentric
.
x
*
b
.
y
+
barycentric
.
y
*
c
.
y
;
return
interpolated
out
;
}
<SENTENCE_END/>
barycoord
%END%
(5.12e-01)
to
(4.80e-02)
get
(4.19e-02)
%UNK%
(2.73e-02)
out
(2.59e-02)
y
(1.95e-02)
local
(1.12e-02)
set
(9.39e-03)
barycentric
(9.21e-03)
mul
(8.66e-03)
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
interpolated
out
.
x
=
u
*
a
.
x
+
barycentric
.
x
*
b
.
x
+
barycentric
.
y
*
c
.
x
;
interpolated
out
.
y
=
u
*
a
.
y
+
barycentric
.
x
*
b
.
y
+
barycentric
.
y
*
c
.
y
;
return
interpolated
out
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
interpolated
out
.
x
=
u
*
a
.
x
+
barycentric
.
x
*
b
.
x
+
barycentric
.
y
*
c
.
x
;
interpolated
out
.
y
=
u
*
a
.
y
+
barycentric
.
x
*
b
.
y
+
barycentric
.
y
*
c
.
y
;
return
interpolated
out
;
}
<SENTENCE_END/>
%END%
%END%
(6.58e-01)
to
(4.31e-02)
out
(2.54e-02)
y
(2.18e-02)
%UNK%
(1.85e-02)
x
(1.21e-02)
local
(8.88e-03)
get
(7.65e-03)
barycentric
(6.81e-03)
unsafe
(5.58e-03)
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
interpolated
out
.
x
=
u
*
a
.
x
+
barycentric
.
x
*
b
.
x
+
barycentric
.
y
*
c
.
x
;
interpolated
out
.
y
=
u
*
a
.
y
+
barycentric
.
x
*
b
.
y
+
barycentric
.
y
*
c
.
y
;
return
interpolated
out
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
interpolated
out
.
x
=
u
*
a
.
x
+
barycentric
.
x
*
b
.
x
+
barycentric
.
y
*
c
.
x
;
interpolated
out
.
y
=
u
*
a
.
y
+
barycentric
.
x
*
b
.
y
+
barycentric
.
y
*
c
.
y
;
return
interpolated
out
;
}
<SENTENCE_END/>
from,barycoord
from
%END%
(2.15e-01)
get
(1.45e-01)
derivative
(9.11e-02)
mul
(3.15e-02)
dst
(3.05e-02)
calculate
(2.46e-02)
pick
(1.66e-02)
cubic
(1.64e-02)
set
(1.56e-02)
len
(1.54e-02)
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
return
u
*
a
+
barycentric
.
x
*
b
+
barycentric
.
y
*
c
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
return
u
*
a
+
barycentric
.
x
*
b
+
barycentric
.
y
*
c
;
}
<SENTENCE_END/>
barycoord
%END%
(8.66e-01)
get
(8.57e-03)
barycentric
(6.50e-03)
u
(3.88e-03)
%UNK%
(3.69e-03)
float
(3.43e-03)
y
(3.10e-03)
%START%
(2.85e-03)
set
(2.83e-03)
left
(2.26e-03)
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
return
u
*
a
+
barycentric
.
x
*
b
+
barycentric
.
y
*
c
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
return
u
*
a
+
barycentric
.
x
*
b
+
barycentric
.
y
*
c
;
}
<SENTENCE_END/>
%END%
%END%
(9.37e-01)
barycentric
(9.15e-03)
u
(3.01e-03)
y
(2.31e-03)
2
(1.56e-03)
x
(1.45e-03)
%UNK%
(1.45e-03)
float
(1.16e-03)
c
(1.02e-03)
a
(9.34e-04)
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
return
u
*
a
+
barycentric
.
x
*
b
+
barycentric
.
y
*
c
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
u
=
1
-
barycentric
.
x
-
barycentric
.
y
;
return
u
*
a
+
barycentric
.
x
*
b
+
barycentric
.
y
*
c
;
}
<SENTENCE_END/>
lowest,positive,root
lowest
dst
(7.30e-02)
mul
(5.73e-02)
cross
(4.91e-02)
%UNK%
(4.58e-02)
det
(4.46e-02)
2
(3.58e-02)
overlaps
(2.77e-02)
%END%
(2.77e-02)
slerp
(2.75e-02)
dot
(2.70e-02)
<SENTENCE_START>
{
float
det
=
b
*
b
-
4
*
a
*
c
;
if
(
det
<
0
)
return
float
.
na
n
;
float
sqrt
d
=
(
float
)
math
.
sqrt
(
det
)
;
float
inv
a
=
1
/
(
2
*
a
)
;
float
r
1
=
(
-
b
-
sqrt
d
)
*
inv
a
;
float
r
2
=
(
-
b
+
sqrt
d
)
*
inv
a
;
if
(
r
1
>
r
2
)
{
float
tmp
=
r
2
;
r
2
=
r
1
;
r
1
=
tmp
;
}
if
(
r
1
>
0
)
return
r
1
;
if
(
r
2
>
0
)
return
r
2
;
return
float
.
na
n
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
det
=
b
*
b
-
4
*
a
*
c
;
if
(
det
<
0
)
return
float
.
na
n
;
float
sqrt
d
=
(
float
)
math
.
sqrt
(
det
)
;
float
inv
a
=
1
/
(
2
*
a
)
;
float
r
1
=
(
-
b
-
sqrt
d
)
*
inv
a
;
float
r
2
=
(
-
b
+
sqrt
d
)
*
inv
a
;
if
(
r
1
>
r
2
)
{
float
tmp
=
r
2
;
r
2
=
r
1
;
r
1
=
tmp
;
}
if
(
r
1
>
0
)
return
r
1
;
if
(
r
2
>
0
)
return
r
2
;
return
float
.
na
n
;
}
<SENTENCE_END/>
positive
%END%
(6.93e-01)
2
(3.36e-02)
float
(3.27e-02)
%UNK%
(1.01e-02)
d
(8.89e-03)
r
(8.21e-03)
equals
(8.16e-03)
dst
(6.57e-03)
1
(6.54e-03)
to
(6.19e-03)
<SENTENCE_START>
{
float
det
=
b
*
b
-
4
*
a
*
c
;
if
(
det
<
0
)
return
float
.
na
n
;
float
sqrt
d
=
(
float
)
math
.
sqrt
(
det
)
;
float
inv
a
=
1
/
(
2
*
a
)
;
float
r
1
=
(
-
b
-
sqrt
d
)
*
inv
a
;
float
r
2
=
(
-
b
+
sqrt
d
)
*
inv
a
;
if
(
r
1
>
r
2
)
{
float
tmp
=
r
2
;
r
2
=
r
1
;
r
1
=
tmp
;
}
if
(
r
1
>
0
)
return
r
1
;
if
(
r
2
>
0
)
return
r
2
;
return
float
.
na
n
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
det
=
b
*
b
-
4
*
a
*
c
;
if
(
det
<
0
)
return
float
.
na
n
;
float
sqrt
d
=
(
float
)
math
.
sqrt
(
det
)
;
float
inv
a
=
1
/
(
2
*
a
)
;
float
r
1
=
(
-
b
-
sqrt
d
)
*
inv
a
;
float
r
2
=
(
-
b
+
sqrt
d
)
*
inv
a
;
if
(
r
1
>
r
2
)
{
float
tmp
=
r
2
;
r
2
=
r
1
;
r
1
=
tmp
;
}
if
(
r
1
>
0
)
return
r
1
;
if
(
r
2
>
0
)
return
r
2
;
return
float
.
na
n
;
}
<SENTENCE_END/>
root
%END%
(8.27e-01)
float
(2.70e-02)
2
(1.92e-02)
d
(5.57e-03)
r
(5.50e-03)
1
(4.80e-03)
rad
(3.89e-03)
%UNK%
(3.79e-03)
sqrt
(3.18e-03)
equals
(3.05e-03)
<SENTENCE_START>
{
float
det
=
b
*
b
-
4
*
a
*
c
;
if
(
det
<
0
)
return
float
.
na
n
;
float
sqrt
d
=
(
float
)
math
.
sqrt
(
det
)
;
float
inv
a
=
1
/
(
2
*
a
)
;
float
r
1
=
(
-
b
-
sqrt
d
)
*
inv
a
;
float
r
2
=
(
-
b
+
sqrt
d
)
*
inv
a
;
if
(
r
1
>
r
2
)
{
float
tmp
=
r
2
;
r
2
=
r
1
;
r
1
=
tmp
;
}
if
(
r
1
>
0
)
return
r
1
;
if
(
r
2
>
0
)
return
r
2
;
return
float
.
na
n
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
det
=
b
*
b
-
4
*
a
*
c
;
if
(
det
<
0
)
return
float
.
na
n
;
float
sqrt
d
=
(
float
)
math
.
sqrt
(
det
)
;
float
inv
a
=
1
/
(
2
*
a
)
;
float
r
1
=
(
-
b
-
sqrt
d
)
*
inv
a
;
float
r
2
=
(
-
b
+
sqrt
d
)
*
inv
a
;
if
(
r
1
>
r
2
)
{
float
tmp
=
r
2
;
r
2
=
r
1
;
r
1
=
tmp
;
}
if
(
r
1
>
0
)
return
r
1
;
if
(
r
2
>
0
)
return
r
2
;
return
float
.
na
n
;
}
<SENTENCE_END/>
%END%
%END%
(8.83e-01)
float
(2.23e-02)
2
(1.29e-02)
d
(3.84e-03)
rad
(3.19e-03)
1
(2.88e-03)
sqrt
(2.48e-03)
r
(2.27e-03)
a
(2.15e-03)
%UNK%
(2.14e-03)
<SENTENCE_START>
{
float
det
=
b
*
b
-
4
*
a
*
c
;
if
(
det
<
0
)
return
float
.
na
n
;
float
sqrt
d
=
(
float
)
math
.
sqrt
(
det
)
;
float
inv
a
=
1
/
(
2
*
a
)
;
float
r
1
=
(
-
b
-
sqrt
d
)
*
inv
a
;
float
r
2
=
(
-
b
+
sqrt
d
)
*
inv
a
;
if
(
r
1
>
r
2
)
{
float
tmp
=
r
2
;
r
2
=
r
1
;
r
1
=
tmp
;
}
if
(
r
1
>
0
)
return
r
1
;
if
(
r
2
>
0
)
return
r
2
;
return
float
.
na
n
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
det
=
b
*
b
-
4
*
a
*
c
;
if
(
det
<
0
)
return
float
.
na
n
;
float
sqrt
d
=
(
float
)
math
.
sqrt
(
det
)
;
float
inv
a
=
1
/
(
2
*
a
)
;
float
r
1
=
(
-
b
-
sqrt
d
)
*
inv
a
;
float
r
2
=
(
-
b
+
sqrt
d
)
*
inv
a
;
if
(
r
1
>
r
2
)
{
float
tmp
=
r
2
;
r
2
=
r
1
;
r
1
=
tmp
;
}
if
(
r
1
>
0
)
return
r
1
;
if
(
r
2
>
0
)
return
r
2
;
return
float
.
na
n
;
}
<SENTENCE_END/>
colinear
colinear
invert
(1.17e-01)
set
(1.10e-01)
solve
(9.00e-02)
%UNK%
(8.24e-02)
intersect
(5.93e-02)
dst
(3.84e-02)
to
(3.53e-02)
det
(2.79e-02)
conjugate
(2.14e-02)
cross
(1.68e-02)
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
return
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
return
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
;
}
<SENTENCE_END/>
%END%
%END%
(4.05e-01)
%UNK%
(4.70e-02)
2
(4.46e-02)
to
(2.53e-02)
square
(1.98e-02)
dx
(1.97e-02)
x
(1.90e-02)
dst
(1.69e-02)
ray
(1.67e-02)
lines
(1.57e-02)
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
return
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
return
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
;
}
<SENTENCE_END/>
triangle,centroid
triangle
get
(2.56e-01)
set
(2.07e-01)
add
(4.66e-02)
%UNK%
(4.66e-02)
to
(3.66e-02)
mouse
(2.10e-02)
draw
(1.44e-02)
print
(1.11e-02)
read
(1.06e-02)
is
(1.04e-02)
<SENTENCE_START>
{
centroid
.
x
=
(
x
1
+
x
2
+
x
3
)
/
3
;
centroid
.
y
=
(
y
1
+
y
2
+
y
3
)
/
3
;
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
centroid
.
x
=
(
x
1
+
x
2
+
x
3
)
/
3
;
centroid
.
y
=
(
y
1
+
y
2
+
y
3
)
/
3
;
return
centroid
;
}
<SENTENCE_END/>
centroid
%END%
(1.75e-01)
2
(7.15e-02)
x
(6.47e-02)
to
(5.31e-02)
%UNK%
(4.38e-02)
y
(4.05e-02)
3
(2.40e-02)
centroid
(2.05e-02)
line
(1.70e-02)
4
(1.58e-02)
<SENTENCE_START>
{
centroid
.
x
=
(
x
1
+
x
2
+
x
3
)
/
3
;
centroid
.
y
=
(
y
1
+
y
2
+
y
3
)
/
3
;
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
centroid
.
x
=
(
x
1
+
x
2
+
x
3
)
/
3
;
centroid
.
y
=
(
y
1
+
y
2
+
y
3
)
/
3
;
return
centroid
;
}
<SENTENCE_END/>
%END%
%END%
(4.83e-01)
2
(8.94e-02)
3
(4.45e-02)
x
(3.04e-02)
%UNK%
(2.23e-02)
to
(2.00e-02)
y
(1.98e-02)
4
(1.39e-02)
ray
(8.91e-03)
line
(8.69e-03)
<SENTENCE_START>
{
centroid
.
x
=
(
x
1
+
x
2
+
x
3
)
/
3
;
centroid
.
y
=
(
y
1
+
y
2
+
y
3
)
/
3
;
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
centroid
.
x
=
(
x
1
+
x
2
+
x
3
)
/
3
;
centroid
.
y
=
(
y
1
+
y
2
+
y
3
)
/
3
;
return
centroid
;
}
<SENTENCE_END/>
triangle,circumcenter
triangle
set
(1.37e-01)
%UNK%
(1.36e-01)
dst
(4.07e-02)
%END%
(3.42e-02)
intersect
(2.84e-02)
dot
(2.58e-02)
2
(2.58e-02)
solve
(1.91e-02)
det
(1.89e-02)
to
(1.83e-02)
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
dx
13
=
x
1
-
x
3
,
dy
13
=
y
1
-
y
3
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
if
(
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
)
throw
new
illegal
argument
exception
(
"Triangle points must not be colinear."
)
;
det
*=
2
;
float
sqr
1
=
x
1
*
x
1
+
y
1
*
y
1
,
sqr
2
=
x
2
*
x
2
+
y
2
*
y
2
,
sqr
3
=
x
3
*
x
3
+
y
3
*
y
3
;
circumcenter
.
set
(
(
sqr
1
*
dy
32
+
sqr
2
*
dy
13
+
sqr
3
*
dy
21
)
/
det
,
-
(
sqr
1
*
dx
32
+
sqr
2
*
dx
13
+
sqr
3
*
dx
21
)
/
det
)
;
return
circumcenter
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
dx
13
=
x
1
-
x
3
,
dy
13
=
y
1
-
y
3
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
if
(
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
)
throw
new
illegal
argument
exception
(
"Triangle points must not be colinear."
)
;
det
*=
2
;
float
sqr
1
=
x
1
*
x
1
+
y
1
*
y
1
,
sqr
2
=
x
2
*
x
2
+
y
2
*
y
2
,
sqr
3
=
x
3
*
x
3
+
y
3
*
y
3
;
circumcenter
.
set
(
(
sqr
1
*
dy
32
+
sqr
2
*
dy
13
+
sqr
3
*
dy
21
)
/
det
,
-
(
sqr
1
*
dx
32
+
sqr
2
*
dx
13
+
sqr
3
*
dx
21
)
/
det
)
;
return
circumcenter
;
}
<SENTENCE_END/>
circumcenter
%END%
(3.69e-01)
2
(9.17e-02)
%UNK%
(6.48e-02)
ray
(2.12e-02)
dst
(1.81e-02)
3
(1.77e-02)
x
(1.56e-02)
to
(1.33e-02)
dot
(1.30e-02)
pick
(1.13e-02)
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
dx
13
=
x
1
-
x
3
,
dy
13
=
y
1
-
y
3
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
if
(
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
)
throw
new
illegal
argument
exception
(
"Triangle points must not be colinear."
)
;
det
*=
2
;
float
sqr
1
=
x
1
*
x
1
+
y
1
*
y
1
,
sqr
2
=
x
2
*
x
2
+
y
2
*
y
2
,
sqr
3
=
x
3
*
x
3
+
y
3
*
y
3
;
circumcenter
.
set
(
(
sqr
1
*
dy
32
+
sqr
2
*
dy
13
+
sqr
3
*
dy
21
)
/
det
,
-
(
sqr
1
*
dx
32
+
sqr
2
*
dx
13
+
sqr
3
*
dx
21
)
/
det
)
;
return
circumcenter
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
dx
13
=
x
1
-
x
3
,
dy
13
=
y
1
-
y
3
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
if
(
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
)
throw
new
illegal
argument
exception
(
"Triangle points must not be colinear."
)
;
det
*=
2
;
float
sqr
1
=
x
1
*
x
1
+
y
1
*
y
1
,
sqr
2
=
x
2
*
x
2
+
y
2
*
y
2
,
sqr
3
=
x
3
*
x
3
+
y
3
*
y
3
;
circumcenter
.
set
(
(
sqr
1
*
dy
32
+
sqr
2
*
dy
13
+
sqr
3
*
dy
21
)
/
det
,
-
(
sqr
1
*
dx
32
+
sqr
2
*
dx
13
+
sqr
3
*
dx
21
)
/
det
)
;
return
circumcenter
;
}
<SENTENCE_END/>
%END%
%END%
(5.04e-01)
2
(8.88e-02)
%UNK%
(3.81e-02)
3
(1.73e-02)
ray
(1.38e-02)
x
(1.32e-02)
dst
(1.13e-02)
32
(9.07e-03)
to
(9.04e-03)
lines
(8.62e-03)
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
dx
13
=
x
1
-
x
3
,
dy
13
=
y
1
-
y
3
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
if
(
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
)
throw
new
illegal
argument
exception
(
"Triangle points must not be colinear."
)
;
det
*=
2
;
float
sqr
1
=
x
1
*
x
1
+
y
1
*
y
1
,
sqr
2
=
x
2
*
x
2
+
y
2
*
y
2
,
sqr
3
=
x
3
*
x
3
+
y
3
*
y
3
;
circumcenter
.
set
(
(
sqr
1
*
dy
32
+
sqr
2
*
dy
13
+
sqr
3
*
dy
21
)
/
det
,
-
(
sqr
1
*
dx
32
+
sqr
2
*
dx
13
+
sqr
3
*
dx
21
)
/
det
)
;
return
circumcenter
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
dx
21
=
x
2
-
x
1
,
dy
21
=
y
2
-
y
1
;
float
dx
32
=
x
3
-
x
2
,
dy
32
=
y
3
-
y
2
;
float
dx
13
=
x
1
-
x
3
,
dy
13
=
y
1
-
y
3
;
float
det
=
dx
32
*
dy
21
-
dx
21
*
dy
32
;
if
(
math
.
abs
(
det
)
<
math
utils
.
float
rounding
error
)
throw
new
illegal
argument
exception
(
"Triangle points must not be colinear."
)
;
det
*=
2
;
float
sqr
1
=
x
1
*
x
1
+
y
1
*
y
1
,
sqr
2
=
x
2
*
x
2
+
y
2
*
y
2
,
sqr
3
=
x
3
*
x
3
+
y
3
*
y
3
;
circumcenter
.
set
(
(
sqr
1
*
dy
32
+
sqr
2
*
dy
13
+
sqr
3
*
dy
21
)
/
det
,
-
(
sqr
1
*
dx
32
+
sqr
2
*
dx
13
+
sqr
3
*
dx
21
)
/
det
)
;
return
circumcenter
;
}
<SENTENCE_END/>
triangle,area
triangle
abs
(1.79e-01)
%UNK%
(1.24e-01)
contains
(6.49e-02)
mouse
(4.95e-02)
sub
(4.37e-02)
get
(3.15e-02)
negate
(3.03e-02)
to
(2.77e-02)
fast
(2.22e-02)
randomize
(2.09e-02)
<SENTENCE_START>
{
return
math
.
abs
(
(
x
1
-
x
3
)
*
(
y
2
-
y
1
)
-
(
x
1
-
x
2
)
*
(
y
3
-
y
1
)
)
*
0.5f
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
math
.
abs
(
(
x
1
-
x
3
)
*
(
y
2
-
y
1
)
-
(
x
1
-
x
2
)
*
(
y
3
-
y
1
)
)
*
0.5f
;
}
<SENTENCE_END/>
area
%END%
(2.93e-01)
2
(9.67e-02)
%UNK%
(5.75e-02)
in
(3.00e-02)
x
(2.58e-02)
segments
(2.34e-02)
point
(2.08e-02)
y
(1.60e-02)
pick
(1.59e-02)
to
(1.57e-02)
<SENTENCE_START>
{
return
math
.
abs
(
(
x
1
-
x
3
)
*
(
y
2
-
y
1
)
-
(
x
1
-
x
2
)
*
(
y
3
-
y
1
)
)
*
0.5f
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
math
.
abs
(
(
x
1
-
x
3
)
*
(
y
2
-
y
1
)
-
(
x
1
-
x
2
)
*
(
y
3
-
y
1
)
)
*
0.5f
;
}
<SENTENCE_END/>
%END%
%END%
(5.84e-01)
2
(7.22e-02)
%UNK%
(2.60e-02)
in
(2.02e-02)
segments
(1.39e-02)
at
(1.36e-02)
3
(1.23e-02)
x
(1.23e-02)
lines
(1.00e-02)
point
(9.27e-03)
<SENTENCE_START>
{
return
math
.
abs
(
(
x
1
-
x
3
)
*
(
y
2
-
y
1
)
-
(
x
1
-
x
2
)
*
(
y
3
-
y
1
)
)
*
0.5f
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
math
.
abs
(
(
x
1
-
x
3
)
*
(
y
2
-
y
1
)
-
(
x
1
-
x
2
)
*
(
y
3
-
y
1
)
)
*
0.5f
;
}
<SENTENCE_END/>
quadrilateral,centroid
quadrilateral
avg
(4.87e-01)
get
(9.32e-02)
intersect
(5.95e-02)
slerp
(4.37e-02)
set
(1.54e-02)
rotate
(1.31e-02)
fast
(1.22e-02)
mul
(1.08e-02)
distance
(1.02e-02)
lerp
(1.01e-02)
<SENTENCE_START>
{
float
avg
x
1
=
(
x
1
+
x
2
+
x
3
)
/
3
;
float
avg
y
1
=
(
y
1
+
y
2
+
y
3
)
/
3
;
float
avg
x
2
=
(
x
1
+
x
4
+
x
3
)
/
3
;
float
avg
y
2
=
(
y
1
+
y
4
+
y
3
)
/
3
;
centroid
.
x
=
avg
x
1
-
(
avg
x
1
-
avg
x
2
)
/
2
;
centroid
.
y
=
avg
y
1
-
(
avg
y
1
-
avg
y
2
)
/
2
;
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
avg
x
1
=
(
x
1
+
x
2
+
x
3
)
/
3
;
float
avg
y
1
=
(
y
1
+
y
2
+
y
3
)
/
3
;
float
avg
x
2
=
(
x
1
+
x
4
+
x
3
)
/
3
;
float
avg
y
2
=
(
y
1
+
y
4
+
y
3
)
/
3
;
centroid
.
x
=
avg
x
1
-
(
avg
x
1
-
avg
x
2
)
/
2
;
centroid
.
y
=
avg
y
1
-
(
avg
y
1
-
avg
y
2
)
/
2
;
return
centroid
;
}
<SENTENCE_END/>
centroid
2
(1.15e-01)
x
(6.28e-02)
y
(4.38e-02)
%END%
(3.28e-02)
ray
(3.12e-02)
%UNK%
(2.96e-02)
segment
(2.75e-02)
fast
(2.74e-02)
intersect
(2.63e-02)
4
(2.34e-02)
<SENTENCE_START>
{
float
avg
x
1
=
(
x
1
+
x
2
+
x
3
)
/
3
;
float
avg
y
1
=
(
y
1
+
y
2
+
y
3
)
/
3
;
float
avg
x
2
=
(
x
1
+
x
4
+
x
3
)
/
3
;
float
avg
y
2
=
(
y
1
+
y
4
+
y
3
)
/
3
;
centroid
.
x
=
avg
x
1
-
(
avg
x
1
-
avg
x
2
)
/
2
;
centroid
.
y
=
avg
y
1
-
(
avg
y
1
-
avg
y
2
)
/
2
;
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
avg
x
1
=
(
x
1
+
x
2
+
x
3
)
/
3
;
float
avg
y
1
=
(
y
1
+
y
2
+
y
3
)
/
3
;
float
avg
x
2
=
(
x
1
+
x
4
+
x
3
)
/
3
;
float
avg
y
2
=
(
y
1
+
y
4
+
y
3
)
/
3
;
centroid
.
x
=
avg
x
1
-
(
avg
x
1
-
avg
x
2
)
/
2
;
centroid
.
y
=
avg
y
1
-
(
avg
y
1
-
avg
y
2
)
/
2
;
return
centroid
;
}
<SENTENCE_END/>
%END%
2
(1.45e-01)
%END%
(7.23e-02)
x
(5.03e-02)
y
(3.53e-02)
4
(2.98e-02)
ray
(2.74e-02)
%UNK%
(2.68e-02)
3
(2.53e-02)
segment
(2.41e-02)
line
(2.22e-02)
<SENTENCE_START>
{
float
avg
x
1
=
(
x
1
+
x
2
+
x
3
)
/
3
;
float
avg
y
1
=
(
y
1
+
y
2
+
y
3
)
/
3
;
float
avg
x
2
=
(
x
1
+
x
4
+
x
3
)
/
3
;
float
avg
y
2
=
(
y
1
+
y
4
+
y
3
)
/
3
;
centroid
.
x
=
avg
x
1
-
(
avg
x
1
-
avg
x
2
)
/
2
;
centroid
.
y
=
avg
y
1
-
(
avg
y
1
-
avg
y
2
)
/
2
;
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
avg
x
1
=
(
x
1
+
x
2
+
x
3
)
/
3
;
float
avg
y
1
=
(
y
1
+
y
2
+
y
3
)
/
3
;
float
avg
x
2
=
(
x
1
+
x
4
+
x
3
)
/
3
;
float
avg
y
2
=
(
y
1
+
y
4
+
y
3
)
/
3
;
centroid
.
x
=
avg
x
1
-
(
avg
x
1
-
avg
x
2
)
/
2
;
centroid
.
y
=
avg
y
1
-
(
avg
y
1
-
avg
y
2
)
/
2
;
return
centroid
;
}
<SENTENCE_END/>
polygon,centroid
polygon
%UNK%
(9.80e-02)
compute
(6.23e-02)
polygon
(3.63e-02)
add
(3.37e-02)
x
(3.30e-02)
calculate
(3.09e-02)
intersect
(2.51e-02)
fast
(2.36e-02)
scale
(2.34e-02)
fill
(1.97e-02)
<SENTENCE_START>
{
if
(
count
<
6
)
throw
new
illegal
argument
exception
(
"A polygon must have 3 or more coordinate pairs."
)
;
float
x
=
0
,
y
=
0
;
float
signed
area
=
0
;
int
i
=
offset
;
for
(
int
n
=
offset
+
count
-
2
;
i
<
n
;
i
+=
2
)
{
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
i
+
2
]
;
float
y
1
=
polygon
[
i
+
3
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
}
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
offset
]
;
float
y
1
=
polygon
[
offset
+
1
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
if
(
signed
area
==
0
)
{
centroid
.
x
=
0
;
centroid
.
y
=
0
;
}
else
{
signed
area
*=
0.5f
;
centroid
.
x
=
x
/
(
6
*
signed
area
)
;
centroid
.
y
=
y
/
(
6
*
signed
area
)
;
}
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
count
<
6
)
throw
new
illegal
argument
exception
(
"A polygon must have 3 or more coordinate pairs."
)
;
float
x
=
0
,
y
=
0
;
float
signed
area
=
0
;
int
i
=
offset
;
for
(
int
n
=
offset
+
count
-
2
;
i
<
n
;
i
+=
2
)
{
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
i
+
2
]
;
float
y
1
=
polygon
[
i
+
3
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
}
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
offset
]
;
float
y
1
=
polygon
[
offset
+
1
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
if
(
signed
area
==
0
)
{
centroid
.
x
=
0
;
centroid
.
y
=
0
;
}
else
{
signed
area
*=
0.5f
;
centroid
.
x
=
x
/
(
6
*
signed
area
)
;
centroid
.
y
=
y
/
(
6
*
signed
area
)
;
}
return
centroid
;
}
<SENTENCE_END/>
centroid
%END%
(4.76e-01)
%UNK%
(3.38e-02)
polygon
(2.89e-02)
x
(2.27e-02)
to
(1.80e-02)
2
(9.83e-03)
0
(9.72e-03)
fast
(8.23e-03)
in
(8.17e-03)
segment
(8.16e-03)
<SENTENCE_START>
{
if
(
count
<
6
)
throw
new
illegal
argument
exception
(
"A polygon must have 3 or more coordinate pairs."
)
;
float
x
=
0
,
y
=
0
;
float
signed
area
=
0
;
int
i
=
offset
;
for
(
int
n
=
offset
+
count
-
2
;
i
<
n
;
i
+=
2
)
{
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
i
+
2
]
;
float
y
1
=
polygon
[
i
+
3
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
}
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
offset
]
;
float
y
1
=
polygon
[
offset
+
1
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
if
(
signed
area
==
0
)
{
centroid
.
x
=
0
;
centroid
.
y
=
0
;
}
else
{
signed
area
*=
0.5f
;
centroid
.
x
=
x
/
(
6
*
signed
area
)
;
centroid
.
y
=
y
/
(
6
*
signed
area
)
;
}
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
count
<
6
)
throw
new
illegal
argument
exception
(
"A polygon must have 3 or more coordinate pairs."
)
;
float
x
=
0
,
y
=
0
;
float
signed
area
=
0
;
int
i
=
offset
;
for
(
int
n
=
offset
+
count
-
2
;
i
<
n
;
i
+=
2
)
{
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
i
+
2
]
;
float
y
1
=
polygon
[
i
+
3
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
}
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
offset
]
;
float
y
1
=
polygon
[
offset
+
1
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
if
(
signed
area
==
0
)
{
centroid
.
x
=
0
;
centroid
.
y
=
0
;
}
else
{
signed
area
*=
0.5f
;
centroid
.
x
=
x
/
(
6
*
signed
area
)
;
centroid
.
y
=
y
/
(
6
*
signed
area
)
;
}
return
centroid
;
}
<SENTENCE_END/>
%END%
%END%
(7.08e-01)
%UNK%
(1.54e-02)
polygon
(1.28e-02)
x
(1.28e-02)
to
(1.08e-02)
2
(6.94e-03)
0
(5.88e-03)
y
(5.64e-03)
in
(5.51e-03)
segment
(4.53e-03)
<SENTENCE_START>
{
if
(
count
<
6
)
throw
new
illegal
argument
exception
(
"A polygon must have 3 or more coordinate pairs."
)
;
float
x
=
0
,
y
=
0
;
float
signed
area
=
0
;
int
i
=
offset
;
for
(
int
n
=
offset
+
count
-
2
;
i
<
n
;
i
+=
2
)
{
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
i
+
2
]
;
float
y
1
=
polygon
[
i
+
3
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
}
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
offset
]
;
float
y
1
=
polygon
[
offset
+
1
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
if
(
signed
area
==
0
)
{
centroid
.
x
=
0
;
centroid
.
y
=
0
;
}
else
{
signed
area
*=
0.5f
;
centroid
.
x
=
x
/
(
6
*
signed
area
)
;
centroid
.
y
=
y
/
(
6
*
signed
area
)
;
}
return
centroid
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
count
<
6
)
throw
new
illegal
argument
exception
(
"A polygon must have 3 or more coordinate pairs."
)
;
float
x
=
0
,
y
=
0
;
float
signed
area
=
0
;
int
i
=
offset
;
for
(
int
n
=
offset
+
count
-
2
;
i
<
n
;
i
+=
2
)
{
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
i
+
2
]
;
float
y
1
=
polygon
[
i
+
3
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
}
float
x
0
=
polygon
[
i
]
;
float
y
0
=
polygon
[
i
+
1
]
;
float
x
1
=
polygon
[
offset
]
;
float
y
1
=
polygon
[
offset
+
1
]
;
float
a
=
x
0
*
y
1
-
x
1
*
y
0
;
signed
area
+=
a
;
x
+=
(
x
0
+
x
1
)
*
a
;
y
+=
(
y
0
+
y
1
)
*
a
;
if
(
signed
area
==
0
)
{
centroid
.
x
=
0
;
centroid
.
y
=
0
;
}
else
{
signed
area
*=
0.5f
;
centroid
.
x
=
x
/
(
6
*
signed
area
)
;
centroid
.
y
=
y
/
(
6
*
signed
area
)
;
}
return
centroid
;
}
<SENTENCE_END/>
polygon,area
polygon
calculate
(1.49e-01)
%UNK%
(1.17e-01)
compute
(4.76e-02)
create
(4.59e-02)
add
(3.72e-02)
polygon
(3.52e-02)
transform
(1.62e-02)
x
(1.52e-02)
area
(1.49e-02)
fast
(1.40e-02)
<SENTENCE_START>
{
float
area
=
0
;
for
(
int
i
=
offset
,
n
=
offset
+
count
;
i
<
n
;
i
+=
2
)
{
int
x
1
=
i
;
int
y
1
=
i
+
1
;
int
x
2
=
(
i
+
2
)
%
n
;
if
(
x
2
<
offset
)
x
2
+=
offset
;
int
y
2
=
(
i
+
3
)
%
n
;
if
(
y
2
<
offset
)
y
2
+=
offset
;
area
+=
polygon
[
x
1
]
*
polygon
[
y
2
]
;
area
-=
polygon
[
x
2
]
*
polygon
[
y
1
]
;
}
area
*=
0.5f
;
return
area
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
area
=
0
;
for
(
int
i
=
offset
,
n
=
offset
+
count
;
i
<
n
;
i
+=
2
)
{
int
x
1
=
i
;
int
y
1
=
i
+
1
;
int
x
2
=
(
i
+
2
)
%
n
;
if
(
x
2
<
offset
)
x
2
+=
offset
;
int
y
2
=
(
i
+
3
)
%
n
;
if
(
y
2
<
offset
)
y
2
+=
offset
;
area
+=
polygon
[
x
1
]
*
polygon
[
y
2
]
;
area
-=
polygon
[
x
2
]
*
polygon
[
y
1
]
;
}
area
*=
0.5f
;
return
area
;
}
<SENTENCE_END/>
area
%END%
(4.91e-01)
polygon
(2.54e-02)
of
(2.44e-02)
2
(2.03e-02)
%UNK%
(1.66e-02)
x
(1.63e-02)
4
(1.56e-02)
array
(1.33e-02)
int
(8.49e-03)
y
(7.31e-03)
<SENTENCE_START>
{
float
area
=
0
;
for
(
int
i
=
offset
,
n
=
offset
+
count
;
i
<
n
;
i
+=
2
)
{
int
x
1
=
i
;
int
y
1
=
i
+
1
;
int
x
2
=
(
i
+
2
)
%
n
;
if
(
x
2
<
offset
)
x
2
+=
offset
;
int
y
2
=
(
i
+
3
)
%
n
;
if
(
y
2
<
offset
)
y
2
+=
offset
;
area
+=
polygon
[
x
1
]
*
polygon
[
y
2
]
;
area
-=
polygon
[
x
2
]
*
polygon
[
y
1
]
;
}
area
*=
0.5f
;
return
area
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
area
=
0
;
for
(
int
i
=
offset
,
n
=
offset
+
count
;
i
<
n
;
i
+=
2
)
{
int
x
1
=
i
;
int
y
1
=
i
+
1
;
int
x
2
=
(
i
+
2
)
%
n
;
if
(
x
2
<
offset
)
x
2
+=
offset
;
int
y
2
=
(
i
+
3
)
%
n
;
if
(
y
2
<
offset
)
y
2
+=
offset
;
area
+=
polygon
[
x
1
]
*
polygon
[
y
2
]
;
area
-=
polygon
[
x
2
]
*
polygon
[
y
1
]
;
}
area
*=
0.5f
;
return
area
;
}
<SENTENCE_END/>
%END%
%END%
(7.84e-01)
2
(1.50e-02)
of
(1.02e-02)
x
(7.80e-03)
array
(6.75e-03)
4
(6.46e-03)
polygon
(6.41e-03)
y
(5.93e-03)
area
(5.36e-03)
1
(4.60e-03)
<SENTENCE_START>
{
float
area
=
0
;
for
(
int
i
=
offset
,
n
=
offset
+
count
;
i
<
n
;
i
+=
2
)
{
int
x
1
=
i
;
int
y
1
=
i
+
1
;
int
x
2
=
(
i
+
2
)
%
n
;
if
(
x
2
<
offset
)
x
2
+=
offset
;
int
y
2
=
(
i
+
3
)
%
n
;
if
(
y
2
<
offset
)
y
2
+=
offset
;
area
+=
polygon
[
x
1
]
*
polygon
[
y
2
]
;
area
-=
polygon
[
x
2
]
*
polygon
[
y
1
]
;
}
area
*=
0.5f
;
return
area
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
area
=
0
;
for
(
int
i
=
offset
,
n
=
offset
+
count
;
i
<
n
;
i
+=
2
)
{
int
x
1
=
i
;
int
y
1
=
i
+
1
;
int
x
2
=
(
i
+
2
)
%
n
;
if
(
x
2
<
offset
)
x
2
+=
offset
;
int
y
2
=
(
i
+
3
)
%
n
;
if
(
y
2
<
offset
)
y
2
+=
offset
;
area
+=
polygon
[
x
1
]
*
polygon
[
y
2
]
;
area
-=
polygon
[
x
2
]
*
polygon
[
y
1
]
;
}
area
*=
0.5f
;
return
area
;
}
<SENTENCE_END/>
ensure,ccw
ensure
set
(2.08e-01)
compute
(4.67e-02)
merge
(3.73e-02)
%UNK%
(3.56e-02)
add
(2.82e-02)
create
(2.62e-02)
polygon
(2.32e-02)
classify
(2.25e-02)
translate
(2.03e-02)
intersect
(1.96e-02)
<SENTENCE_START>
{
if
(
!
are
vertices
clockwise
(
polygon
,
0
,
polygon
.
length
)
)
return
;
int
last
x
=
polygon
.
length
-
2
;
for
(
int
i
=
0
,
n
=
polygon
.
length
/
2
;
i
<
n
;
i
+=
2
)
{
int
other
=
last
x
-
i
;
float
x
=
polygon
[
i
]
;
float
y
=
polygon
[
i
+
1
]
;
polygon
[
i
]
=
polygon
[
other
]
;
polygon
[
i
+
1
]
=
polygon
[
other
+
1
]
;
polygon
[
other
]
=
x
;
polygon
[
other
+
1
]
=
y
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
!
are
vertices
clockwise
(
polygon
,
0
,
polygon
.
length
)
)
return
;
int
last
x
=
polygon
.
length
-
2
;
for
(
int
i
=
0
,
n
=
polygon
.
length
/
2
;
i
<
n
;
i
+=
2
)
{
int
other
=
last
x
-
i
;
float
x
=
polygon
[
i
]
;
float
y
=
polygon
[
i
+
1
]
;
polygon
[
i
]
=
polygon
[
other
]
;
polygon
[
i
+
1
]
=
polygon
[
other
+
1
]
;
polygon
[
other
]
=
x
;
polygon
[
other
+
1
]
=
y
;
}
}
<SENTENCE_END/>
ccw
%END%
(5.71e-01)
polygon
(9.91e-02)
compute
(1.12e-02)
%UNK%
(9.40e-03)
triangles
(9.27e-03)
index
(8.91e-03)
chain
(8.64e-03)
x
(7.40e-03)
of
(7.30e-03)
vertices
(6.71e-03)
<SENTENCE_START>
{
if
(
!
are
vertices
clockwise
(
polygon
,
0
,
polygon
.
length
)
)
return
;
int
last
x
=
polygon
.
length
-
2
;
for
(
int
i
=
0
,
n
=
polygon
.
length
/
2
;
i
<
n
;
i
+=
2
)
{
int
other
=
last
x
-
i
;
float
x
=
polygon
[
i
]
;
float
y
=
polygon
[
i
+
1
]
;
polygon
[
i
]
=
polygon
[
other
]
;
polygon
[
i
+
1
]
=
polygon
[
other
+
1
]
;
polygon
[
other
]
=
x
;
polygon
[
other
+
1
]
=
y
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
!
are
vertices
clockwise
(
polygon
,
0
,
polygon
.
length
)
)
return
;
int
last
x
=
polygon
.
length
-
2
;
for
(
int
i
=
0
,
n
=
polygon
.
length
/
2
;
i
<
n
;
i
+=
2
)
{
int
other
=
last
x
-
i
;
float
x
=
polygon
[
i
]
;
float
y
=
polygon
[
i
+
1
]
;
polygon
[
i
]
=
polygon
[
other
]
;
polygon
[
i
+
1
]
=
polygon
[
other
+
1
]
;
polygon
[
other
]
=
x
;
polygon
[
other
+
1
]
=
y
;
}
}
<SENTENCE_END/>
%END%
%END%
(8.87e-01)
polygon
(1.42e-02)
x
(3.61e-03)
of
(3.16e-03)
triangles
(3.00e-03)
index
(2.47e-03)
and
(2.17e-03)
%UNK%
(2.09e-03)
i
(2.02e-03)
chain
(1.67e-03)
<SENTENCE_START>
{
if
(
!
are
vertices
clockwise
(
polygon
,
0
,
polygon
.
length
)
)
return
;
int
last
x
=
polygon
.
length
-
2
;
for
(
int
i
=
0
,
n
=
polygon
.
length
/
2
;
i
<
n
;
i
+=
2
)
{
int
other
=
last
x
-
i
;
float
x
=
polygon
[
i
]
;
float
y
=
polygon
[
i
+
1
]
;
polygon
[
i
]
=
polygon
[
other
]
;
polygon
[
i
+
1
]
=
polygon
[
other
+
1
]
;
polygon
[
other
]
=
x
;
polygon
[
other
+
1
]
=
y
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
!
are
vertices
clockwise
(
polygon
,
0
,
polygon
.
length
)
)
return
;
int
last
x
=
polygon
.
length
-
2
;
for
(
int
i
=
0
,
n
=
polygon
.
length
/
2
;
i
<
n
;
i
+=
2
)
{
int
other
=
last
x
-
i
;
float
x
=
polygon
[
i
]
;
float
y
=
polygon
[
i
+
1
]
;
polygon
[
i
]
=
polygon
[
other
]
;
polygon
[
i
+
1
]
=
polygon
[
other
+
1
]
;
polygon
[
other
]
=
x
;
polygon
[
other
+
1
]
=
y
;
}
}
<SENTENCE_END/>
are,vertices,clockwise
are
%UNK%
(1.21e-01)
ccw
(7.23e-02)
x
(5.89e-02)
polygon
(5.42e-02)
compute
(5.17e-02)
intersect
(3.09e-02)
p
(2.78e-02)
calculate
(2.59e-02)
line
(2.48e-02)
rect
(1.87e-02)
<SENTENCE_START>
{
if
(
count
<=
2
)
return
false
;
float
area
=
0
,
p
1
x
,
p
1
y
,
p
2
x
,
p
2
y
;
for
(
int
i
=
offset
,
n
=
offset
+
count
-
3
;
i
<
n
;
i
+=
2
)
{
p
1
x
=
polygon
[
i
]
;
p
1
y
=
polygon
[
i
+
1
]
;
p
2
x
=
polygon
[
i
+
2
]
;
p
2
y
=
polygon
[
i
+
3
]
;
area
+=
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
;
}
p
1
x
=
polygon
[
count
-
2
]
;
p
1
y
=
polygon
[
count
-
1
]
;
p
2
x
=
polygon
[
0
]
;
p
2
y
=
polygon
[
1
]
;
return
area
+
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
<
0
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
count
<=
2
)
return
false
;
float
area
=
0
,
p
1
x
,
p
1
y
,
p
2
x
,
p
2
y
;
for
(
int
i
=
offset
,
n
=
offset
+
count
-
3
;
i
<
n
;
i
+=
2
)
{
p
1
x
=
polygon
[
i
]
;
p
1
y
=
polygon
[
i
+
1
]
;
p
2
x
=
polygon
[
i
+
2
]
;
p
2
y
=
polygon
[
i
+
3
]
;
area
+=
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
;
}
p
1
x
=
polygon
[
count
-
2
]
;
p
1
y
=
polygon
[
count
-
1
]
;
p
2
x
=
polygon
[
0
]
;
p
2
y
=
polygon
[
1
]
;
return
area
+
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
<
0
;
}
<SENTENCE_END/>
vertices
%END%
(1.63e-01)
polygon
(9.24e-02)
x
(6.51e-02)
2
(5.53e-02)
%UNK%
(5.51e-02)
line
(2.25e-02)
ccw
(2.10e-02)
p
(1.37e-02)
polygons
(1.35e-02)
triangle
(1.32e-02)
<SENTENCE_START>
{
if
(
count
<=
2
)
return
false
;
float
area
=
0
,
p
1
x
,
p
1
y
,
p
2
x
,
p
2
y
;
for
(
int
i
=
offset
,
n
=
offset
+
count
-
3
;
i
<
n
;
i
+=
2
)
{
p
1
x
=
polygon
[
i
]
;
p
1
y
=
polygon
[
i
+
1
]
;
p
2
x
=
polygon
[
i
+
2
]
;
p
2
y
=
polygon
[
i
+
3
]
;
area
+=
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
;
}
p
1
x
=
polygon
[
count
-
2
]
;
p
1
y
=
polygon
[
count
-
1
]
;
p
2
x
=
polygon
[
0
]
;
p
2
y
=
polygon
[
1
]
;
return
area
+
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
<
0
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
count
<=
2
)
return
false
;
float
area
=
0
,
p
1
x
,
p
1
y
,
p
2
x
,
p
2
y
;
for
(
int
i
=
offset
,
n
=
offset
+
count
-
3
;
i
<
n
;
i
+=
2
)
{
p
1
x
=
polygon
[
i
]
;
p
1
y
=
polygon
[
i
+
1
]
;
p
2
x
=
polygon
[
i
+
2
]
;
p
2
y
=
polygon
[
i
+
3
]
;
area
+=
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
;
}
p
1
x
=
polygon
[
count
-
2
]
;
p
1
y
=
polygon
[
count
-
1
]
;
p
2
x
=
polygon
[
0
]
;
p
2
y
=
polygon
[
1
]
;
return
area
+
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
<
0
;
}
<SENTENCE_END/>
clockwise
%END%
(3.05e-01)
polygon
(6.77e-02)
2
(5.90e-02)
x
(5.22e-02)
%UNK%
(4.06e-02)
line
(1.52e-02)
of
(1.43e-02)
4
(1.29e-02)
1
(1.26e-02)
triangle
(1.15e-02)
<SENTENCE_START>
{
if
(
count
<=
2
)
return
false
;
float
area
=
0
,
p
1
x
,
p
1
y
,
p
2
x
,
p
2
y
;
for
(
int
i
=
offset
,
n
=
offset
+
count
-
3
;
i
<
n
;
i
+=
2
)
{
p
1
x
=
polygon
[
i
]
;
p
1
y
=
polygon
[
i
+
1
]
;
p
2
x
=
polygon
[
i
+
2
]
;
p
2
y
=
polygon
[
i
+
3
]
;
area
+=
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
;
}
p
1
x
=
polygon
[
count
-
2
]
;
p
1
y
=
polygon
[
count
-
1
]
;
p
2
x
=
polygon
[
0
]
;
p
2
y
=
polygon
[
1
]
;
return
area
+
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
<
0
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
count
<=
2
)
return
false
;
float
area
=
0
,
p
1
x
,
p
1
y
,
p
2
x
,
p
2
y
;
for
(
int
i
=
offset
,
n
=
offset
+
count
-
3
;
i
<
n
;
i
+=
2
)
{
p
1
x
=
polygon
[
i
]
;
p
1
y
=
polygon
[
i
+
1
]
;
p
2
x
=
polygon
[
i
+
2
]
;
p
2
y
=
polygon
[
i
+
3
]
;
area
+=
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
;
}
p
1
x
=
polygon
[
count
-
2
]
;
p
1
y
=
polygon
[
count
-
1
]
;
p
2
x
=
polygon
[
0
]
;
p
2
y
=
polygon
[
1
]
;
return
area
+
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
<
0
;
}
<SENTENCE_END/>
%END%
%END%
(4.67e-01)
2
(5.79e-02)
polygon
(3.99e-02)
x
(3.76e-02)
%UNK%
(2.67e-02)
of
(1.43e-02)
4
(1.34e-02)
1
(1.08e-02)
line
(9.45e-03)
triangle
(8.50e-03)
<SENTENCE_START>
{
if
(
count
<=
2
)
return
false
;
float
area
=
0
,
p
1
x
,
p
1
y
,
p
2
x
,
p
2
y
;
for
(
int
i
=
offset
,
n
=
offset
+
count
-
3
;
i
<
n
;
i
+=
2
)
{
p
1
x
=
polygon
[
i
]
;
p
1
y
=
polygon
[
i
+
1
]
;
p
2
x
=
polygon
[
i
+
2
]
;
p
2
y
=
polygon
[
i
+
3
]
;
area
+=
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
;
}
p
1
x
=
polygon
[
count
-
2
]
;
p
1
y
=
polygon
[
count
-
1
]
;
p
2
x
=
polygon
[
0
]
;
p
2
y
=
polygon
[
1
]
;
return
area
+
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
<
0
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
count
<=
2
)
return
false
;
float
area
=
0
,
p
1
x
,
p
1
y
,
p
2
x
,
p
2
y
;
for
(
int
i
=
offset
,
n
=
offset
+
count
-
3
;
i
<
n
;
i
+=
2
)
{
p
1
x
=
polygon
[
i
]
;
p
1
y
=
polygon
[
i
+
1
]
;
p
2
x
=
polygon
[
i
+
2
]
;
p
2
y
=
polygon
[
i
+
3
]
;
area
+=
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
;
}
p
1
x
=
polygon
[
count
-
2
]
;
p
1
y
=
polygon
[
count
-
1
]
;
p
2
x
=
polygon
[
0
]
;
p
2
y
=
polygon
[
1
]
;
return
area
+
p
1
x
*
p
2
y
-
p
2
x
*
p
1
y
<
0
;
}
<SENTENCE_END/>
process
process
process
(3.09e-01)
file
(1.08e-01)
load
(8.94e-02)
main
(7.87e-02)
new
(6.61e-02)
%END%
(6.49e-02)
directory
(3.67e-02)
save
(2.87e-02)
write
(2.20e-02)
%UNK%
(1.44e-02)
<SENTENCE_START>
{
header
file
processor
processor
=
new
header
file
processor
(
)
;
processor
.
%SELF%
(
new
file
(
directory
)
,
new
file
(
directory
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
header
file
processor
processor
=
new
header
file
processor
(
)
;
processor
.
%SELF%
(
new
file
(
directory
)
,
new
file
(
directory
)
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.56e-01)
processor
(1.60e-02)
file
(9.37e-03)
directory
(5.75e-03)
header
(2.04e-03)
new
(9.47e-04)
performed
(4.25e-04)
bytes
(2.00e-04)
string
(1.32e-04)
process
(1.30e-04)
<SENTENCE_START>
{
header
file
processor
processor
=
new
header
file
processor
(
)
;
processor
.
%SELF%
(
new
file
(
directory
)
,
new
file
(
directory
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
header
file
processor
processor
=
new
header
file
processor
(
)
;
processor
.
%SELF%
(
new
file
(
directory
)
,
new
file
(
directory
)
)
;
}
<SENTENCE_END/>
main
main
main
(6.17e-01)
%UNK%
(7.78e-02)
parse
(7.76e-02)
process
(5.18e-02)
build
(2.09e-02)
save
(1.65e-02)
run
(1.24e-02)
args
(9.07e-03)
print
(8.86e-03)
write
(6.18e-03)
<SENTENCE_START>
{
if
(
args
.
length
!=
1
)
{
header
fixer
.
process
(
"../../gdx/"
)
;
header
fixer
.
process
(
"../../backends/"
)
;
header
fixer
.
process
(
"../../tests/"
)
;
header
fixer
.
process
(
"../../extensions/"
)
;
}
else
{
header
fixer
.
process
(
args
[
0
]
)
;
}
system
.
out
.
println
(
"Changed "
+
files
changed
+
" / "
+
files
scanned
+
" files."
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
args
.
length
!=
1
)
{
header
fixer
.
process
(
"../../gdx/"
)
;
header
fixer
.
process
(
"../../backends/"
)
;
header
fixer
.
process
(
"../../tests/"
)
;
header
fixer
.
process
(
"../../extensions/"
)
;
}
else
{
header
fixer
.
process
(
args
[
0
]
)
;
}
system
.
out
.
println
(
"Changed "
+
files
changed
+
" / "
+
files
scanned
+
" files."
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.00e-01)
%UNK%
(1.14e-01)
args
(2.28e-02)
main
(1.71e-02)
header
(1.02e-02)
file
(9.27e-03)
fixer
(7.38e-03)
parse
(6.64e-03)
process
(6.06e-03)
save
(4.21e-03)
<SENTENCE_START>
{
if
(
args
.
length
!=
1
)
{
header
fixer
.
process
(
"../../gdx/"
)
;
header
fixer
.
process
(
"../../backends/"
)
;
header
fixer
.
process
(
"../../tests/"
)
;
header
fixer
.
process
(
"../../extensions/"
)
;
}
else
{
header
fixer
.
process
(
args
[
0
]
)
;
}
system
.
out
.
println
(
"Changed "
+
files
changed
+
" / "
+
files
scanned
+
" files."
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
args
.
length
!=
1
)
{
header
fixer
.
process
(
"../../gdx/"
)
;
header
fixer
.
process
(
"../../backends/"
)
;
header
fixer
.
process
(
"../../tests/"
)
;
header
fixer
.
process
(
"../../extensions/"
)
;
}
else
{
header
fixer
.
process
(
args
[
0
]
)
;
}
system
.
out
.
println
(
"Changed "
+
files
changed
+
" / "
+
files
scanned
+
" files."
)
;
}
<SENTENCE_END/>
get,dependencies
get
get
(9.89e-01)
is
(2.61e-03)
sub
(1.36e-03)
dependency
(9.32e-04)
contains
(7.08e-04)
return
(6.30e-04)
to
(6.10e-04)
map
(5.11e-04)
type
(2.55e-04)
%UNK%
(1.81e-04)
<SENTENCE_START>
{
return
sub
dependency
map
.
get
(
type
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
sub
dependency
map
.
get
(
type
)
;
}
<SENTENCE_END/>
dependencies
%UNK%
(1.57e-01)
%END%
(1.18e-01)
to
(1.06e-01)
get
(4.77e-02)
string
(2.83e-02)
type
(2.11e-02)
value
(1.95e-02)
sub
(1.90e-02)
dependency
(1.40e-02)
of
(1.14e-02)
<SENTENCE_START>
{
return
sub
dependency
map
.
get
(
type
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
sub
dependency
map
.
get
(
type
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.76e-01)
map
(1.91e-02)
%UNK%
(1.91e-02)
value
(1.54e-02)
type
(1.09e-02)
to
(8.85e-03)
string
(8.36e-03)
dependency
(7.52e-03)
down
(2.67e-03)
array
(2.60e-03)
<SENTENCE_START>
{
return
sub
dependency
map
.
get
(
type
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
sub
dependency
map
.
get
(
type
)
;
}
<SENTENCE_END/>
get,incompatibilities
get
get
(4.05e-01)
to
(1.43e-01)
%UNK%
(7.08e-02)
is
(4.23e-02)
add
(2.91e-02)
read
(1.74e-02)
has
(1.53e-02)
append
(1.08e-02)
parse
(1.04e-02)
string
(7.87e-03)
<SENTENCE_START>
{
list
<
string
>
incompat
=
new
array
list
<
string
>
(
)
;
string
[
]
sub
array
=
sub
dependency
map
.
get
(
type
)
;
if
(
sub
array
==
null
)
{
incompat
.
add
(
"Dependency "
+
name
+
" is not compatible with sub module "
+
type
.
get
name
(
)
.
to
upper
case
(
)
)
;
}
return
incompat
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
list
<
string
>
incompat
=
new
array
list
<
string
>
(
)
;
string
[
]
sub
array
=
sub
dependency
map
.
get
(
type
)
;
if
(
sub
array
==
null
)
{
incompat
.
add
(
"Dependency "
+
name
+
" is not compatible with sub module "
+
type
.
get
name
(
)
.
to
upper
case
(
)
)
;
}
return
incompat
;
}
<SENTENCE_END/>
incompatibilities
%END%
(3.17e-01)
to
(1.40e-01)
string
(8.41e-02)
%UNK%
(5.46e-02)
dependency
(5.37e-02)
incompat
(3.78e-02)
sub
(2.90e-02)
array
(9.57e-03)
get
(8.11e-03)
name
(7.32e-03)
<SENTENCE_START>
{
list
<
string
>
incompat
=
new
array
list
<
string
>
(
)
;
string
[
]
sub
array
=
sub
dependency
map
.
get
(
type
)
;
if
(
sub
array
==
null
)
{
incompat
.
add
(
"Dependency "
+
name
+
" is not compatible with sub module "
+
type
.
get
name
(
)
.
to
upper
case
(
)
)
;
}
return
incompat
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
list
<
string
>
incompat
=
new
array
list
<
string
>
(
)
;
string
[
]
sub
array
=
sub
dependency
map
.
get
(
type
)
;
if
(
sub
array
==
null
)
{
incompat
.
add
(
"Dependency "
+
name
+
" is not compatible with sub module "
+
type
.
get
name
(
)
.
to
upper
case
(
)
)
;
}
return
incompat
;
}
<SENTENCE_END/>
%END%
%END%
(6.37e-01)
to
(5.62e-02)
string
(5.32e-02)
incompat
(2.24e-02)
map
(2.22e-02)
%UNK%
(1.90e-02)
array
(1.11e-02)
dependency
(9.88e-03)
sub
(6.76e-03)
type
(6.50e-03)
<SENTENCE_START>
{
list
<
string
>
incompat
=
new
array
list
<
string
>
(
)
;
string
[
]
sub
array
=
sub
dependency
map
.
get
(
type
)
;
if
(
sub
array
==
null
)
{
incompat
.
add
(
"Dependency "
+
name
+
" is not compatible with sub module "
+
type
.
get
name
(
)
.
to
upper
case
(
)
)
;
}
return
incompat
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
list
<
string
>
incompat
=
new
array
list
<
string
>
(
)
;
string
[
]
sub
array
=
sub
dependency
map
.
get
(
type
)
;
if
(
sub
array
==
null
)
{
incompat
.
add
(
"Dependency "
+
name
+
" is not compatible with sub module "
+
type
.
get
name
(
)
.
to
upper
case
(
)
)
;
}
return
incompat
;
}
<SENTENCE_END/>
get,gwt,inherits
get
get
(9.84e-01)
is
(4.75e-03)
gwt
(4.13e-03)
return
(2.18e-03)
inherits
(7.47e-04)
as
(6.16e-04)
iterator
(1.53e-04)
protected
(1.32e-04)
needs
(1.19e-04)
parse
(1.07e-04)
<SENTENCE_START>
{
return
gwt
inherits
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gwt
inherits
;
}
<SENTENCE_END/>
gwt
gwt
(9.80e-01)
inherits
(1.61e-02)
parse
(3.29e-03)
return
(1.81e-04)
load
(6.47e-06)
get
(5.48e-06)
%START%
(3.83e-06)
find
(3.63e-06)
debug
(3.13e-06)
keyframe
(2.52e-06)
<SENTENCE_START>
{
return
gwt
inherits
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gwt
inherits
;
}
<SENTENCE_END/>
inherits
inherits
(9.93e-01)
%END%
(3.05e-03)
gwt
(2.97e-03)
value
(2.73e-05)
buffer
(2.01e-05)
egl
(1.70e-05)
%UNK%
(1.61e-05)
double
(1.43e-05)
texture
(1.39e-05)
array
(1.16e-05)
<SENTENCE_START>
{
return
gwt
inherits
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gwt
inherits
;
}
<SENTENCE_END/>
%END%
%END%
(9.27e-01)
inherits
(1.60e-02)
value
(7.65e-03)
only
(2.75e-03)
20
(2.33e-03)
offset
(1.76e-03)
buffer
(1.60e-03)
array
(1.26e-03)
double
(1.24e-03)
display
(1.11e-03)
<SENTENCE_START>
{
return
gwt
inherits
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
gwt
inherits
;
}
<SENTENCE_END/>
get,name
get
get
(9.90e-01)
is
(3.93e-03)
protected
(1.18e-03)
name
(1.12e-03)
return
(1.12e-03)
iterator
(3.72e-04)
needs
(1.34e-04)
last
(6.23e-05)
list
(3.52e-05)
has
(3.45e-05)
<SENTENCE_START>
{
return
name
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
;
}
<SENTENCE_END/>
name
name
(9.95e-01)
return
(1.52e-03)
get
(1.09e-03)
attribute
(7.38e-04)
%END%
(3.37e-04)
declared
(2.66e-04)
atlas
(6.83e-05)
protected
(5.35e-05)
list
(5.00e-05)
element
(4.49e-05)
<SENTENCE_START>
{
return
name
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
;
}
<SENTENCE_END/>
%END%
%END%
(9.40e-01)
name
(1.10e-02)
value
(8.53e-03)
20
(2.35e-03)
array
(1.98e-03)
header
(1.61e-03)
only
(1.45e-03)
accessible
(1.30e-03)
offset
(1.08e-03)
file
(1.08e-03)
<SENTENCE_START>
{
return
name
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
;
}
<SENTENCE_END/>
do,sort
do
sort
(8.53e-01)
merge
(7.00e-02)
insert
(8.90e-03)
lo
(4.71e-03)
push
(3.66e-03)
run
(3.10e-03)
n
(2.72e-03)
remaining
(2.58e-03)
add
(2.35e-03)
binary
(1.76e-03)
<SENTENCE_START>
{
stack
size
=
0
;
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
this
.
a
=
a
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
push
run
(
lo
,
run
len
)
;
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
merge
force
collapse
(
)
;
if
(
debug
)
assert
stack
size
==
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
stack
size
=
0
;
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
this
.
a
=
a
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
push
run
(
lo
,
run
len
)
;
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
merge
force
collapse
(
)
;
if
(
debug
)
assert
stack
size
==
1
;
}
<SENTENCE_END/>
sort
%END%
(3.70e-01)
sort
(2.83e-01)
merge
(4.91e-02)
range
(2.02e-02)
insert
(1.86e-02)
lo
(1.29e-02)
all
(8.84e-03)
add
(8.45e-03)
push
(8.17e-03)
and
(7.85e-03)
<SENTENCE_START>
{
stack
size
=
0
;
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
this
.
a
=
a
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
push
run
(
lo
,
run
len
)
;
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
merge
force
collapse
(
)
;
if
(
debug
)
assert
stack
size
==
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
stack
size
=
0
;
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
this
.
a
=
a
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
push
run
(
lo
,
run
len
)
;
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
merge
force
collapse
(
)
;
if
(
debug
)
assert
stack
size
==
1
;
}
<SENTENCE_END/>
%END%
%END%
(7.90e-01)
sort
(4.68e-02)
all
(8.94e-03)
merge
(8.68e-03)
range
(8.62e-03)
and
(6.31e-03)
lo
(6.15e-03)
run
(4.41e-03)
insert
(4.34e-03)
at
(3.19e-03)
<SENTENCE_START>
{
stack
size
=
0
;
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
this
.
a
=
a
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
push
run
(
lo
,
run
len
)
;
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
merge
force
collapse
(
)
;
if
(
debug
)
assert
stack
size
==
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
stack
size
=
0
;
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
this
.
a
=
a
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
push
run
(
lo
,
run
len
)
;
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
merge
force
collapse
(
)
;
if
(
debug
)
assert
stack
size
==
1
;
}
<SENTENCE_END/>
sort
sort
sort
(7.89e-01)
add
(4.49e-02)
a
(2.34e-02)
insert
(1.65e-02)
to
(9.72e-03)
0
(9.67e-03)
compute
(9.64e-03)
%UNK%
(6.75e-03)
mul
(6.03e-03)
init
(4.51e-03)
<SENTENCE_START>
{
%SELF%
(
a
,
0
,
a
.
length
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
%SELF%
(
a
,
0
,
a
.
length
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.76e-01)
0
(2.75e-03)
fully
(2.44e-03)
all
(2.01e-03)
to
(1.91e-03)
%UNK%
(1.04e-03)
zero
(7.29e-04)
sort
(4.87e-04)
a
(4.60e-04)
string
(3.63e-04)
<SENTENCE_START>
{
%SELF%
(
a
,
0
,
a
.
length
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
%SELF%
(
a
,
0
,
a
.
length
)
;
}
<SENTENCE_END/>
sort
sort
sort
(8.87e-01)
merge
(4.21e-02)
insert
(7.47e-03)
lo
(3.97e-03)
run
(3.18e-03)
push
(2.90e-03)
n
(2.57e-03)
remaining
(2.53e-03)
add
(2.16e-03)
binary
(1.61e-03)
<SENTENCE_START>
{
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
comparable
tim
sort
ts
=
new
comparable
tim
sort
(
a
)
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
ts
.
push
run
(
lo
,
run
len
)
;
ts
.
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
ts
.
merge
force
collapse
(
)
;
if
(
debug
)
assert
ts
.
stack
size
==
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
comparable
tim
sort
ts
=
new
comparable
tim
sort
(
a
)
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
ts
.
push
run
(
lo
,
run
len
)
;
ts
.
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
ts
.
merge
force
collapse
(
)
;
if
(
debug
)
assert
ts
.
stack
size
==
1
;
}
<SENTENCE_END/>
%END%
%END%
(3.96e-01)
sort
(2.97e-01)
merge
(3.26e-02)
insert
(1.60e-02)
range
(1.57e-02)
lo
(1.02e-02)
%UNK%
(8.89e-03)
add
(8.29e-03)
all
(7.81e-03)
run
(7.56e-03)
<SENTENCE_START>
{
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
comparable
tim
sort
ts
=
new
comparable
tim
sort
(
a
)
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
ts
.
push
run
(
lo
,
run
len
)
;
ts
.
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
ts
.
merge
force
collapse
(
)
;
if
(
debug
)
assert
ts
.
stack
size
==
1
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
range
check
(
a
.
length
,
lo
,
hi
)
;
int
n
remaining
=
hi
-
lo
;
if
(
n
remaining
<
2
)
return
;
if
(
n
remaining
<
min
merge
)
{
int
init
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
binary
sort
(
a
,
lo
,
hi
,
lo
+
init
run
len
)
;
return
;
}
comparable
tim
sort
ts
=
new
comparable
tim
sort
(
a
)
;
int
min
run
=
min
run
length
(
n
remaining
)
;
do
{
int
run
len
=
count
run
and
make
ascending
(
a
,
lo
,
hi
)
;
if
(
run
len
<
min
run
)
{
int
force
=
n
remaining
<=
min
run
?
n
remaining
:
min
run
;
binary
sort
(
a
,
lo
,
lo
+
force
,
lo
+
run
len
)
;
run
len
=
force
;
}
ts
.
push
run
(
lo
,
run
len
)
;
ts
.
merge
collapse
(
)
;
lo
+=
run
len
;
n
remaining
-=
run
len
;
}
while
(
n
remaining
!=
0
)
;
if
(
debug
)
assert
lo
==
hi
;
ts
.
merge
force
collapse
(
)
;
if
(
debug
)
assert
ts
.
stack
size
==
1
;
}
<SENTENCE_END/>
binary,sort
binary
binary
(3.23e-01)
%UNK%
(1.48e-01)
sort
(5.23e-02)
merge
(4.57e-02)
swap
(2.66e-02)
gallop
(2.00e-02)
reverse
(1.52e-02)
init
(1.41e-02)
partition
(1.11e-02)
compute
(8.98e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<=
start
&&
start
<=
hi
;
if
(
start
==
lo
)
start
++
;
for
(
;
start
<
hi
;
start
++
)
{
@
suppress
warnings
(
"unchecked"
)
comparable
<
object
>
pivot
=
(
comparable
)
a
[
start
]
;
int
left
=
lo
;
int
right
=
start
;
if
(
debug
)
assert
left
<=
right
;
while
(
left
<
right
)
{
int
mid
=
(
left
+
right
)
>>>
1
;
if
(
pivot
.
compare
to
(
a
[
mid
]
)
<
0
)
right
=
mid
;
else
left
=
mid
+
1
;
}
if
(
debug
)
assert
left
==
right
;
int
n
=
start
-
left
;
switch
(
n
)
{
case
2
:
a
[
left
+
2
]
=
a
[
left
+
1
]
;
case
1
:
a
[
left
+
1
]
=
a
[
left
]
;
break
;
default
:
system
.
arraycopy
(
a
,
left
,
a
,
left
+
1
,
n
)
;
}
a
[
left
]
=
pivot
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<=
start
&&
start
<=
hi
;
if
(
start
==
lo
)
start
++
;
for
(
;
start
<
hi
;
start
++
)
{
@
suppress
warnings
(
"unchecked"
)
comparable
<
object
>
pivot
=
(
comparable
)
a
[
start
]
;
int
left
=
lo
;
int
right
=
start
;
if
(
debug
)
assert
left
<=
right
;
while
(
left
<
right
)
{
int
mid
=
(
left
+
right
)
>>>
1
;
if
(
pivot
.
compare
to
(
a
[
mid
]
)
<
0
)
right
=
mid
;
else
left
=
mid
+
1
;
}
if
(
debug
)
assert
left
==
right
;
int
n
=
start
-
left
;
switch
(
n
)
{
case
2
:
a
[
left
+
2
]
=
a
[
left
+
1
]
;
case
1
:
a
[
left
+
1
]
=
a
[
left
]
;
break
;
default
:
system
.
arraycopy
(
a
,
left
,
a
,
left
+
1
,
n
)
;
}
a
[
left
]
=
pivot
;
}
}
<SENTENCE_END/>
sort
%END%
(3.99e-01)
%UNK%
(1.01e-01)
left
(2.30e-02)
range
(1.62e-02)
right
(1.60e-02)
to
(1.49e-02)
and
(1.39e-02)
merge
(1.16e-02)
binary
(1.15e-02)
index
(1.12e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<=
start
&&
start
<=
hi
;
if
(
start
==
lo
)
start
++
;
for
(
;
start
<
hi
;
start
++
)
{
@
suppress
warnings
(
"unchecked"
)
comparable
<
object
>
pivot
=
(
comparable
)
a
[
start
]
;
int
left
=
lo
;
int
right
=
start
;
if
(
debug
)
assert
left
<=
right
;
while
(
left
<
right
)
{
int
mid
=
(
left
+
right
)
>>>
1
;
if
(
pivot
.
compare
to
(
a
[
mid
]
)
<
0
)
right
=
mid
;
else
left
=
mid
+
1
;
}
if
(
debug
)
assert
left
==
right
;
int
n
=
start
-
left
;
switch
(
n
)
{
case
2
:
a
[
left
+
2
]
=
a
[
left
+
1
]
;
case
1
:
a
[
left
+
1
]
=
a
[
left
]
;
break
;
default
:
system
.
arraycopy
(
a
,
left
,
a
,
left
+
1
,
n
)
;
}
a
[
left
]
=
pivot
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<=
start
&&
start
<=
hi
;
if
(
start
==
lo
)
start
++
;
for
(
;
start
<
hi
;
start
++
)
{
@
suppress
warnings
(
"unchecked"
)
comparable
<
object
>
pivot
=
(
comparable
)
a
[
start
]
;
int
left
=
lo
;
int
right
=
start
;
if
(
debug
)
assert
left
<=
right
;
while
(
left
<
right
)
{
int
mid
=
(
left
+
right
)
>>>
1
;
if
(
pivot
.
compare
to
(
a
[
mid
]
)
<
0
)
right
=
mid
;
else
left
=
mid
+
1
;
}
if
(
debug
)
assert
left
==
right
;
int
n
=
start
-
left
;
switch
(
n
)
{
case
2
:
a
[
left
+
2
]
=
a
[
left
+
1
]
;
case
1
:
a
[
left
+
1
]
=
a
[
left
]
;
break
;
default
:
system
.
arraycopy
(
a
,
left
,
a
,
left
+
1
,
n
)
;
}
a
[
left
]
=
pivot
;
}
}
<SENTENCE_END/>
%END%
%END%
(8.35e-01)
%UNK%
(1.70e-02)
left
(9.12e-03)
and
(7.40e-03)
right
(5.10e-03)
to
(4.52e-03)
range
(4.32e-03)
index
(3.19e-03)
value
(2.72e-03)
at
(2.48e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<=
start
&&
start
<=
hi
;
if
(
start
==
lo
)
start
++
;
for
(
;
start
<
hi
;
start
++
)
{
@
suppress
warnings
(
"unchecked"
)
comparable
<
object
>
pivot
=
(
comparable
)
a
[
start
]
;
int
left
=
lo
;
int
right
=
start
;
if
(
debug
)
assert
left
<=
right
;
while
(
left
<
right
)
{
int
mid
=
(
left
+
right
)
>>>
1
;
if
(
pivot
.
compare
to
(
a
[
mid
]
)
<
0
)
right
=
mid
;
else
left
=
mid
+
1
;
}
if
(
debug
)
assert
left
==
right
;
int
n
=
start
-
left
;
switch
(
n
)
{
case
2
:
a
[
left
+
2
]
=
a
[
left
+
1
]
;
case
1
:
a
[
left
+
1
]
=
a
[
left
]
;
break
;
default
:
system
.
arraycopy
(
a
,
left
,
a
,
left
+
1
,
n
)
;
}
a
[
left
]
=
pivot
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<=
start
&&
start
<=
hi
;
if
(
start
==
lo
)
start
++
;
for
(
;
start
<
hi
;
start
++
)
{
@
suppress
warnings
(
"unchecked"
)
comparable
<
object
>
pivot
=
(
comparable
)
a
[
start
]
;
int
left
=
lo
;
int
right
=
start
;
if
(
debug
)
assert
left
<=
right
;
while
(
left
<
right
)
{
int
mid
=
(
left
+
right
)
>>>
1
;
if
(
pivot
.
compare
to
(
a
[
mid
]
)
<
0
)
right
=
mid
;
else
left
=
mid
+
1
;
}
if
(
debug
)
assert
left
==
right
;
int
n
=
start
-
left
;
switch
(
n
)
{
case
2
:
a
[
left
+
2
]
=
a
[
left
+
1
]
;
case
1
:
a
[
left
+
1
]
=
a
[
left
]
;
break
;
default
:
system
.
arraycopy
(
a
,
left
,
a
,
left
+
1
,
n
)
;
}
a
[
left
]
=
pivot
;
}
}
<SENTENCE_END/>
count,run,and,make,ascending
count
sort
(2.85e-01)
merge
(6.99e-02)
hi
(6.87e-02)
lo
(5.78e-02)
range
(5.78e-02)
reverse
(4.60e-02)
%UNK%
(2.91e-02)
push
(2.77e-02)
decode
(2.18e-02)
to
(1.83e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
run
%END%
(8.76e-02)
%UNK%
(8.53e-02)
range
(6.82e-02)
sort
(6.63e-02)
lo
(4.45e-02)
hi
(4.30e-02)
1
(3.25e-02)
to
(3.20e-02)
ascending
(3.01e-02)
and
(2.88e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
and
%END%
(3.60e-01)
%UNK%
(7.41e-02)
and
(3.90e-02)
range
(3.37e-02)
to
(2.73e-02)
1
(2.34e-02)
ascending
(2.25e-02)
sort
(2.15e-02)
lo
(1.96e-02)
hi
(1.87e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
make
%END%
(5.99e-01)
%UNK%
(4.48e-02)
and
(3.42e-02)
range
(1.85e-02)
to
(1.61e-02)
at
(1.55e-02)
1
(1.41e-02)
ascending
(1.39e-02)
0
(1.06e-02)
lo
(1.05e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
ascending
%END%
(6.38e-01)
%UNK%
(4.09e-02)
and
(3.16e-02)
range
(1.56e-02)
to
(1.44e-02)
at
(1.42e-02)
1
(1.22e-02)
ascending
(1.20e-02)
hi
(9.02e-03)
0
(9.01e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
%END%
%END%
(6.24e-01)
%UNK%
(4.33e-02)
and
(3.23e-02)
range
(1.61e-02)
to
(1.49e-02)
at
(1.44e-02)
1
(1.28e-02)
ascending
(1.27e-02)
0
(9.37e-03)
hi
(9.19e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
lo
<
hi
;
int
run
hi
=
lo
+
1
;
if
(
run
hi
==
hi
)
return
1
;
if
(
(
(
comparable
)
a
[
run
hi
++
]
)
.
compare
to
(
a
[
lo
]
)
<
0
)
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
<
0
)
run
hi
++
;
reverse
range
(
a
,
lo
,
run
hi
)
;
}
else
{
while
(
run
hi
<
hi
&&
(
(
comparable
)
a
[
run
hi
]
)
.
compare
to
(
a
[
run
hi
-
1
]
)
>=
0
)
run
hi
++
;
}
return
run
hi
-
lo
;
}
<SENTENCE_END/>
reverse,range
reverse
reverse
(5.63e-01)
sort
(8.89e-02)
range
(7.71e-02)
merge
(4.81e-02)
pop
(4.74e-02)
lo
(2.60e-02)
binary
(1.50e-02)
remove
(1.38e-02)
shuffle
(1.35e-02)
--
(1.32e-02)
<SENTENCE_START>
{
hi
--
;
while
(
lo
<
hi
)
{
object
t
=
a
[
lo
]
;
a
[
lo
++
]
=
a
[
hi
]
;
a
[
hi
--
]
=
t
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
hi
--
;
while
(
lo
<
hi
)
{
object
t
=
a
[
lo
]
;
a
[
lo
++
]
=
a
[
hi
]
;
a
[
hi
--
]
=
t
;
}
}
<SENTENCE_END/>
range
%END%
(2.85e-01)
range
(2.19e-01)
reverse
(6.22e-02)
lo
(5.65e-02)
sort
(3.66e-02)
hi
(3.53e-02)
%UNK%
(1.97e-02)
swap
(1.45e-02)
index
(1.44e-02)
to
(1.39e-02)
<SENTENCE_START>
{
hi
--
;
while
(
lo
<
hi
)
{
object
t
=
a
[
lo
]
;
a
[
lo
++
]
=
a
[
hi
]
;
a
[
hi
--
]
=
t
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
hi
--
;
while
(
lo
<
hi
)
{
object
t
=
a
[
lo
]
;
a
[
lo
++
]
=
a
[
hi
]
;
a
[
hi
--
]
=
t
;
}
}
<SENTENCE_END/>
%END%
%END%
(9.41e-01)
range
(8.81e-03)
and
(3.50e-03)
lo
(3.24e-03)
%UNK%
(2.30e-03)
hi
(1.97e-03)
to
(1.82e-03)
of
(1.76e-03)
value
(1.32e-03)
index
(1.27e-03)
<SENTENCE_START>
{
hi
--
;
while
(
lo
<
hi
)
{
object
t
=
a
[
lo
]
;
a
[
lo
++
]
=
a
[
hi
]
;
a
[
hi
--
]
=
t
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
hi
--
;
while
(
lo
<
hi
)
{
object
t
=
a
[
lo
]
;
a
[
lo
++
]
=
a
[
hi
]
;
a
[
hi
--
]
=
t
;
}
}
<SENTENCE_END/>
min,run,length
min
merge
(2.70e-01)
min
(6.86e-02)
next
(5.81e-02)
n
(5.40e-02)
equals
(4.89e-02)
find
(3.88e-02)
ensure
(3.78e-02)
contains
(3.23e-02)
of
(2.34e-02)
collapse
(2.16e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
n
>=
0
;
int
r
=
0
;
while
(
n
>=
min
merge
)
{
r
|=
(
n
&
1
)
;
n
>>=
1
;
}
return
n
+
r
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
n
>=
0
;
int
r
=
0
;
while
(
n
>=
min
merge
)
{
r
|=
(
n
&
1
)
;
n
>>=
1
;
}
return
n
+
r
;
}
<SENTENCE_END/>
run
%END%
(7.02e-01)
of
(3.23e-02)
next
(1.84e-02)
at
(1.31e-02)
all
(8.99e-03)
equals
(7.59e-03)
index
(7.18e-03)
n
(6.39e-03)
array
(6.07e-03)
string
(6.06e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
n
>=
0
;
int
r
=
0
;
while
(
n
>=
min
merge
)
{
r
|=
(
n
&
1
)
;
n
>>=
1
;
}
return
n
+
r
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
n
>=
0
;
int
r
=
0
;
while
(
n
>=
min
merge
)
{
r
|=
(
n
&
1
)
;
n
>>=
1
;
}
return
n
+
r
;
}
<SENTENCE_END/>
length
%END%
(8.85e-01)
r
(1.65e-02)
at
(5.69e-03)
n
(5.33e-03)
of
(4.71e-03)
all
(4.13e-03)
assert
(2.62e-03)
next
(2.50e-03)
1
(1.92e-03)
int
(1.87e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
n
>=
0
;
int
r
=
0
;
while
(
n
>=
min
merge
)
{
r
|=
(
n
&
1
)
;
n
>>=
1
;
}
return
n
+
r
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
n
>=
0
;
int
r
=
0
;
while
(
n
>=
min
merge
)
{
r
|=
(
n
&
1
)
;
n
>>=
1
;
}
return
n
+
r
;
}
<SENTENCE_END/>
%END%
%END%
(9.33e-01)
r
(1.19e-02)
n
(3.78e-03)
at
(3.39e-03)
all
(2.68e-03)
assert
(1.88e-03)
of
(1.73e-03)
while
(1.71e-03)
return
(1.42e-03)
1
(1.05e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
n
>=
0
;
int
r
=
0
;
while
(
n
>=
min
merge
)
{
r
|=
(
n
&
1
)
;
n
>>=
1
;
}
return
n
+
r
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
n
>=
0
;
int
r
=
0
;
while
(
n
>=
min
merge
)
{
r
|=
(
n
&
1
)
;
n
>>=
1
;
}
return
n
+
r
;
}
<SENTENCE_END/>
push,run
push
run
(2.70e-01)
size
(1.60e-01)
resize
(1.22e-01)
push
(1.17e-01)
truncate
(6.30e-02)
clear
(5.28e-02)
sort
(2.13e-02)
put
(1.95e-02)
add
(1.93e-02)
create
(1.71e-02)
<SENTENCE_START>
{
this
.
run
base
[
stack
size
]
=
run
base
;
this
.
run
len
[
stack
size
]
=
run
len
;
stack
size
++
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
run
base
[
stack
size
]
=
run
base
;
this
.
run
len
[
stack
size
]
=
run
len
;
stack
size
++
;
}
<SENTENCE_END/>
run
%END%
(5.63e-01)
run
(7.95e-02)
size
(4.26e-02)
push
(3.13e-02)
resize
(2.49e-02)
create
(1.17e-02)
put
(1.08e-02)
base
(8.28e-03)
add
(6.76e-03)
sort
(6.64e-03)
<SENTENCE_START>
{
this
.
run
base
[
stack
size
]
=
run
base
;
this
.
run
len
[
stack
size
]
=
run
len
;
stack
size
++
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
run
base
[
stack
size
]
=
run
base
;
this
.
run
len
[
stack
size
]
=
run
len
;
stack
size
++
;
}
<SENTENCE_END/>
%END%
%END%
(9.64e-01)
size
(5.96e-03)
run
(2.35e-03)
base
(1.53e-03)
width
(8.13e-04)
stack
(6.66e-04)
height
(5.85e-04)
at
(4.76e-04)
value
(4.56e-04)
left
(4.54e-04)
<SENTENCE_START>
{
this
.
run
base
[
stack
size
]
=
run
base
;
this
.
run
len
[
stack
size
]
=
run
len
;
stack
size
++
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
run
base
[
stack
size
]
=
run
base
;
this
.
run
len
[
stack
size
]
=
run
len
;
stack
size
++
;
}
<SENTENCE_END/>
merge,collapse
merge
merge
(7.53e-01)
collapse
(3.49e-02)
insert
(1.70e-02)
push
(1.45e-02)
find
(1.29e-02)
sort
(1.28e-02)
remove
(1.15e-02)
contains
(7.26e-03)
derivative
(7.25e-03)
n
(6.22e-03)
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<=
run
len
[
n
]
+
run
len
[
n
+
1
]
)
{
if
(
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
else
if
(
run
len
[
n
]
<=
run
len
[
n
+
1
]
)
{
merge
at
(
n
)
;
}
else
{
break
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<=
run
len
[
n
]
+
run
len
[
n
+
1
]
)
{
if
(
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
else
if
(
run
len
[
n
]
<=
run
len
[
n
+
1
]
)
{
merge
at
(
n
)
;
}
else
{
break
;
}
}
}
<SENTENCE_END/>
collapse
%END%
(4.14e-01)
merge
(7.78e-02)
at
(5.94e-02)
index
(3.25e-02)
next
(3.02e-02)
of
(2.81e-02)
collapse
(2.78e-02)
range
(1.39e-02)
len
(1.21e-02)
n
(8.92e-03)
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<=
run
len
[
n
]
+
run
len
[
n
+
1
]
)
{
if
(
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
else
if
(
run
len
[
n
]
<=
run
len
[
n
+
1
]
)
{
merge
at
(
n
)
;
}
else
{
break
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<=
run
len
[
n
]
+
run
len
[
n
+
1
]
)
{
if
(
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
else
if
(
run
len
[
n
]
<=
run
len
[
n
+
1
]
)
{
merge
at
(
n
)
;
}
else
{
break
;
}
}
}
<SENTENCE_END/>
%END%
%END%
(8.21e-01)
at
(3.21e-02)
of
(9.92e-03)
next
(9.65e-03)
index
(9.50e-03)
merge
(8.60e-03)
range
(4.21e-03)
collapse
(3.63e-03)
all
(3.39e-03)
and
(3.11e-03)
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<=
run
len
[
n
]
+
run
len
[
n
+
1
]
)
{
if
(
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
else
if
(
run
len
[
n
]
<=
run
len
[
n
+
1
]
)
{
merge
at
(
n
)
;
}
else
{
break
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<=
run
len
[
n
]
+
run
len
[
n
+
1
]
)
{
if
(
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
else
if
(
run
len
[
n
]
<=
run
len
[
n
+
1
]
)
{
merge
at
(
n
)
;
}
else
{
break
;
}
}
}
<SENTENCE_END/>
merge,force,collapse
merge
merge
(5.27e-01)
sort
(6.06e-02)
collapse
(4.59e-02)
remove
(4.18e-02)
contains
(3.22e-02)
find
(2.42e-02)
insert
(2.33e-02)
pop
(1.57e-02)
index
(1.38e-02)
derivative
(1.22e-02)
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
}
<SENTENCE_END/>
force
%END%
(4.86e-01)
of
(8.02e-02)
at
(5.61e-02)
index
(3.37e-02)
next
(2.59e-02)
merge
(2.43e-02)
all
(1.29e-02)
collapse
(1.16e-02)
range
(9.92e-03)
n
(8.78e-03)
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
}
<SENTENCE_END/>
collapse
%END%
(8.99e-01)
at
(2.32e-02)
of
(8.53e-03)
size
(6.03e-03)
index
(3.54e-03)
all
(3.45e-03)
next
(2.95e-03)
n
(2.34e-03)
and
(2.13e-03)
run
(1.92e-03)
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(9.10e-01)
at
(1.59e-02)
size
(1.12e-02)
n
(5.10e-03)
run
(4.87e-03)
of
(3.99e-03)
all
(2.06e-03)
index
(1.76e-03)
next
(1.52e-03)
stack
(1.49e-03)
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
size
>
1
)
{
int
n
=
stack
size
-
2
;
if
(
n
>
0
&&
run
len
[
n
-
1
]
<
run
len
[
n
+
1
]
)
n
--
;
merge
at
(
n
)
;
}
}
<SENTENCE_END/>
merge,at
merge
merge
(6.23e-01)
sort
(2.37e-02)
len
(1.41e-02)
1
(1.23e-02)
range
(1.10e-02)
check
(1.09e-02)
add
(9.36e-03)
push
(8.14e-03)
lo
(7.47e-03)
%UNK%
(7.26e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
stack
size
>=
2
;
if
(
debug
)
assert
i
>=
0
;
if
(
debug
)
assert
i
==
stack
size
-
2
||
i
==
stack
size
-
3
;
int
base
1
=
run
base
[
i
]
;
int
len
1
=
run
len
[
i
]
;
int
base
2
=
run
base
[
i
+
1
]
;
int
len
2
=
run
len
[
i
+
1
]
;
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
;
if
(
debug
)
assert
base
1
+
len
1
==
base
2
;
run
len
[
i
]
=
len
1
+
len
2
;
if
(
i
==
stack
size
-
3
)
{
run
base
[
i
+
1
]
=
run
base
[
i
+
2
]
;
run
len
[
i
+
1
]
=
run
len
[
i
+
2
]
;
}
stack
size
--
;
int
k
=
gallop
right
(
(
comparable
<
object
>
)
a
[
base
2
]
,
a
,
base
1
,
len
1
,
0
)
;
if
(
debug
)
assert
k
>=
0
;
base
1
+=
k
;
len
1
-=
k
;
if
(
len
1
==
0
)
return
;
len
2
=
gallop
left
(
(
comparable
<
object
>
)
a
[
base
1
+
len
1
-
1
]
,
a
,
base
2
,
len
2
,
len
2
-
1
)
;
if
(
debug
)
assert
len
2
>=
0
;
if
(
len
2
==
0
)
return
;
if
(
len
1
<=
len
2
)
merge
lo
(
base
1
,
len
1
,
base
2
,
len
2
)
;
else
merge
hi
(
base
1
,
len
1
,
base
2
,
len
2
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
stack
size
>=
2
;
if
(
debug
)
assert
i
>=
0
;
if
(
debug
)
assert
i
==
stack
size
-
2
||
i
==
stack
size
-
3
;
int
base
1
=
run
base
[
i
]
;
int
len
1
=
run
len
[
i
]
;
int
base
2
=
run
base
[
i
+
1
]
;
int
len
2
=
run
len
[
i
+
1
]
;
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
;
if
(
debug
)
assert
base
1
+
len
1
==
base
2
;
run
len
[
i
]
=
len
1
+
len
2
;
if
(
i
==
stack
size
-
3
)
{
run
base
[
i
+
1
]
=
run
base
[
i
+
2
]
;
run
len
[
i
+
1
]
=
run
len
[
i
+
2
]
;
}
stack
size
--
;
int
k
=
gallop
right
(
(
comparable
<
object
>
)
a
[
base
2
]
,
a
,
base
1
,
len
1
,
0
)
;
if
(
debug
)
assert
k
>=
0
;
base
1
+=
k
;
len
1
-=
k
;
if
(
len
1
==
0
)
return
;
len
2
=
gallop
left
(
(
comparable
<
object
>
)
a
[
base
1
+
len
1
-
1
]
,
a
,
base
2
,
len
2
,
len
2
-
1
)
;
if
(
debug
)
assert
len
2
>=
0
;
if
(
len
2
==
0
)
return
;
if
(
len
1
<=
len
2
)
merge
lo
(
base
1
,
len
1
,
base
2
,
len
2
)
;
else
merge
hi
(
base
1
,
len
1
,
base
2
,
len
2
)
;
}
<SENTENCE_END/>
at
%END%
(3.84e-01)
merge
(6.86e-02)
1
(2.38e-02)
test
(1.88e-02)
%UNK%
(1.86e-02)
range
(1.56e-02)
of
(1.32e-02)
len
(1.30e-02)
4
(1.25e-02)
at
(1.07e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
stack
size
>=
2
;
if
(
debug
)
assert
i
>=
0
;
if
(
debug
)
assert
i
==
stack
size
-
2
||
i
==
stack
size
-
3
;
int
base
1
=
run
base
[
i
]
;
int
len
1
=
run
len
[
i
]
;
int
base
2
=
run
base
[
i
+
1
]
;
int
len
2
=
run
len
[
i
+
1
]
;
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
;
if
(
debug
)
assert
base
1
+
len
1
==
base
2
;
run
len
[
i
]
=
len
1
+
len
2
;
if
(
i
==
stack
size
-
3
)
{
run
base
[
i
+
1
]
=
run
base
[
i
+
2
]
;
run
len
[
i
+
1
]
=
run
len
[
i
+
2
]
;
}
stack
size
--
;
int
k
=
gallop
right
(
(
comparable
<
object
>
)
a
[
base
2
]
,
a
,
base
1
,
len
1
,
0
)
;
if
(
debug
)
assert
k
>=
0
;
base
1
+=
k
;
len
1
-=
k
;
if
(
len
1
==
0
)
return
;
len
2
=
gallop
left
(
(
comparable
<
object
>
)
a
[
base
1
+
len
1
-
1
]
,
a
,
base
2
,
len
2
,
len
2
-
1
)
;
if
(
debug
)
assert
len
2
>=
0
;
if
(
len
2
==
0
)
return
;
if
(
len
1
<=
len
2
)
merge
lo
(
base
1
,
len
1
,
base
2
,
len
2
)
;
else
merge
hi
(
base
1
,
len
1
,
base
2
,
len
2
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
stack
size
>=
2
;
if
(
debug
)
assert
i
>=
0
;
if
(
debug
)
assert
i
==
stack
size
-
2
||
i
==
stack
size
-
3
;
int
base
1
=
run
base
[
i
]
;
int
len
1
=
run
len
[
i
]
;
int
base
2
=
run
base
[
i
+
1
]
;
int
len
2
=
run
len
[
i
+
1
]
;
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
;
if
(
debug
)
assert
base
1
+
len
1
==
base
2
;
run
len
[
i
]
=
len
1
+
len
2
;
if
(
i
==
stack
size
-
3
)
{
run
base
[
i
+
1
]
=
run
base
[
i
+
2
]
;
run
len
[
i
+
1
]
=
run
len
[
i
+
2
]
;
}
stack
size
--
;
int
k
=
gallop
right
(
(
comparable
<
object
>
)
a
[
base
2
]
,
a
,
base
1
,
len
1
,
0
)
;
if
(
debug
)
assert
k
>=
0
;
base
1
+=
k
;
len
1
-=
k
;
if
(
len
1
==
0
)
return
;
len
2
=
gallop
left
(
(
comparable
<
object
>
)
a
[
base
1
+
len
1
-
1
]
,
a
,
base
2
,
len
2
,
len
2
-
1
)
;
if
(
debug
)
assert
len
2
>=
0
;
if
(
len
2
==
0
)
return
;
if
(
len
1
<=
len
2
)
merge
lo
(
base
1
,
len
1
,
base
2
,
len
2
)
;
else
merge
hi
(
base
1
,
len
1
,
base
2
,
len
2
)
;
}
<SENTENCE_END/>
%END%
%END%
(6.54e-01)
merge
(2.00e-02)
1
(1.49e-02)
of
(1.04e-02)
test
(1.00e-02)
%UNK%
(9.49e-03)
at
(9.22e-03)
4
(8.78e-03)
range
(8.78e-03)
2
(8.61e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
stack
size
>=
2
;
if
(
debug
)
assert
i
>=
0
;
if
(
debug
)
assert
i
==
stack
size
-
2
||
i
==
stack
size
-
3
;
int
base
1
=
run
base
[
i
]
;
int
len
1
=
run
len
[
i
]
;
int
base
2
=
run
base
[
i
+
1
]
;
int
len
2
=
run
len
[
i
+
1
]
;
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
;
if
(
debug
)
assert
base
1
+
len
1
==
base
2
;
run
len
[
i
]
=
len
1
+
len
2
;
if
(
i
==
stack
size
-
3
)
{
run
base
[
i
+
1
]
=
run
base
[
i
+
2
]
;
run
len
[
i
+
1
]
=
run
len
[
i
+
2
]
;
}
stack
size
--
;
int
k
=
gallop
right
(
(
comparable
<
object
>
)
a
[
base
2
]
,
a
,
base
1
,
len
1
,
0
)
;
if
(
debug
)
assert
k
>=
0
;
base
1
+=
k
;
len
1
-=
k
;
if
(
len
1
==
0
)
return
;
len
2
=
gallop
left
(
(
comparable
<
object
>
)
a
[
base
1
+
len
1
-
1
]
,
a
,
base
2
,
len
2
,
len
2
-
1
)
;
if
(
debug
)
assert
len
2
>=
0
;
if
(
len
2
==
0
)
return
;
if
(
len
1
<=
len
2
)
merge
lo
(
base
1
,
len
1
,
base
2
,
len
2
)
;
else
merge
hi
(
base
1
,
len
1
,
base
2
,
len
2
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
stack
size
>=
2
;
if
(
debug
)
assert
i
>=
0
;
if
(
debug
)
assert
i
==
stack
size
-
2
||
i
==
stack
size
-
3
;
int
base
1
=
run
base
[
i
]
;
int
len
1
=
run
len
[
i
]
;
int
base
2
=
run
base
[
i
+
1
]
;
int
len
2
=
run
len
[
i
+
1
]
;
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
;
if
(
debug
)
assert
base
1
+
len
1
==
base
2
;
run
len
[
i
]
=
len
1
+
len
2
;
if
(
i
==
stack
size
-
3
)
{
run
base
[
i
+
1
]
=
run
base
[
i
+
2
]
;
run
len
[
i
+
1
]
=
run
len
[
i
+
2
]
;
}
stack
size
--
;
int
k
=
gallop
right
(
(
comparable
<
object
>
)
a
[
base
2
]
,
a
,
base
1
,
len
1
,
0
)
;
if
(
debug
)
assert
k
>=
0
;
base
1
+=
k
;
len
1
-=
k
;
if
(
len
1
==
0
)
return
;
len
2
=
gallop
left
(
(
comparable
<
object
>
)
a
[
base
1
+
len
1
-
1
]
,
a
,
base
2
,
len
2
,
len
2
-
1
)
;
if
(
debug
)
assert
len
2
>=
0
;
if
(
len
2
==
0
)
return
;
if
(
len
1
<=
len
2
)
merge
lo
(
base
1
,
len
1
,
base
2
,
len
2
)
;
else
merge
hi
(
base
1
,
len
1
,
base
2
,
len
2
)
;
}
<SENTENCE_END/>
gallop,left
gallop
gallop
(7.99e-01)
left
(6.09e-02)
right
(4.22e-02)
ofs
(2.16e-02)
merge
(1.28e-02)
binary
(6.26e-03)
last
(4.07e-03)
max
(2.73e-03)
top
(2.11e-03)
bottom
(1.74e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
last
ofs
=
0
;
int
ofs
=
1
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
>
0
)
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
else
{
final
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
>
0
)
last
ofs
=
m
+
1
;
else
ofs
=
m
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
last
ofs
=
0
;
int
ofs
=
1
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
>
0
)
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
else
{
final
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
>
0
)
last
ofs
=
m
+
1
;
else
ofs
=
m
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
left
left
(2.62e-01)
%END%
(2.23e-01)
gallop
(1.69e-01)
right
(1.65e-01)
ofs
(2.89e-02)
top
(1.50e-02)
merge
(1.37e-02)
bottom
(1.15e-02)
binary
(5.64e-03)
max
(5.20e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
last
ofs
=
0
;
int
ofs
=
1
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
>
0
)
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
else
{
final
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
>
0
)
last
ofs
=
m
+
1
;
else
ofs
=
m
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
last
ofs
=
0
;
int
ofs
=
1
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
>
0
)
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
else
{
final
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
>
0
)
last
ofs
=
m
+
1
;
else
ofs
=
m
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
%END%
%END%
(6.16e-01)
left
(1.26e-01)
right
(7.92e-02)
gallop
(2.27e-02)
ofs
(1.56e-02)
top
(1.06e-02)
bottom
(8.11e-03)
merge
(6.44e-03)
and
(5.23e-03)
to
(3.23e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
last
ofs
=
0
;
int
ofs
=
1
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
>
0
)
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
else
{
final
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
>
0
)
last
ofs
=
m
+
1
;
else
ofs
=
m
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
last
ofs
=
0
;
int
ofs
=
1
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
>
0
)
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
else
{
final
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
>
0
)
last
ofs
=
m
+
1
;
else
ofs
=
m
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
gallop,right
gallop
gallop
(7.97e-01)
left
(6.32e-02)
right
(4.22e-02)
ofs
(1.97e-02)
merge
(1.41e-02)
binary
(6.60e-03)
last
(3.86e-03)
max
(2.54e-03)
top
(2.21e-03)
bottom
(1.81e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
ofs
=
1
;
int
last
ofs
=
0
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
<
0
)
{
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
else
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
<
0
)
ofs
=
m
;
else
last
ofs
=
m
+
1
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
ofs
=
1
;
int
last
ofs
=
0
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
<
0
)
{
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
else
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
<
0
)
ofs
=
m
;
else
last
ofs
=
m
+
1
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
right
left
(2.59e-01)
%END%
(2.30e-01)
gallop
(1.69e-01)
right
(1.57e-01)
ofs
(3.11e-02)
top
(1.45e-02)
merge
(1.37e-02)
bottom
(1.10e-02)
binary
(5.45e-03)
max
(5.40e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
ofs
=
1
;
int
last
ofs
=
0
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
<
0
)
{
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
else
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
<
0
)
ofs
=
m
;
else
last
ofs
=
m
+
1
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
ofs
=
1
;
int
last
ofs
=
0
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
<
0
)
{
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
else
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
<
0
)
ofs
=
m
;
else
last
ofs
=
m
+
1
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
%END%
%END%
(6.32e-01)
left
(1.23e-01)
right
(7.36e-02)
gallop
(2.22e-02)
ofs
(1.53e-02)
top
(1.00e-02)
bottom
(7.58e-03)
merge
(6.31e-03)
and
(4.66e-03)
to
(3.09e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
ofs
=
1
;
int
last
ofs
=
0
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
<
0
)
{
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
else
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
<
0
)
ofs
=
m
;
else
last
ofs
=
m
+
1
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
>
0
&&
hint
>=
0
&&
hint
<
len
;
int
ofs
=
1
;
int
last
ofs
=
0
;
if
(
key
.
compare
to
(
a
[
base
+
hint
]
)
<
0
)
{
int
max
ofs
=
hint
+
1
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
-
ofs
]
)
<
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
int
tmp
=
last
ofs
;
last
ofs
=
hint
-
ofs
;
ofs
=
hint
-
tmp
;
}
else
{
int
max
ofs
=
len
-
hint
;
while
(
ofs
<
max
ofs
&&
key
.
compare
to
(
a
[
base
+
hint
+
ofs
]
)
>=
0
)
{
last
ofs
=
ofs
;
ofs
=
(
ofs
<<
1
)
+
1
;
if
(
ofs
<=
0
)
ofs
=
max
ofs
;
}
if
(
ofs
>
max
ofs
)
ofs
=
max
ofs
;
last
ofs
+=
hint
;
ofs
+=
hint
;
}
if
(
debug
)
assert
-
1
<=
last
ofs
&&
last
ofs
<
ofs
&&
ofs
<=
len
;
last
ofs
++
;
while
(
last
ofs
<
ofs
)
{
int
m
=
last
ofs
+
(
(
ofs
-
last
ofs
)
>>>
1
)
;
if
(
key
.
compare
to
(
a
[
base
+
m
]
)
<
0
)
ofs
=
m
;
else
last
ofs
=
m
+
1
;
}
if
(
debug
)
assert
last
ofs
==
ofs
;
return
ofs
;
}
<SENTENCE_END/>
merge,lo
merge
merge
(3.18e-01)
sort
(4.21e-02)
add
(3.30e-02)
insert
(2.98e-02)
%UNK%
(2.67e-02)
%END%
(2.54e-02)
to
(2.39e-02)
range
(1.96e-02)
lo
(1.78e-02)
gallop
(1.46e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
1
)
;
system
.
arraycopy
(
a
,
base
1
,
tmp
,
0
,
len
1
)
;
int
cursor
1
=
0
;
int
cursor
2
=
base
2
;
int
dest
=
base
1
;
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
return
;
}
if
(
len
1
==
1
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
if
(
(
(
comparable
)
a
[
cursor
2
]
)
.
compare
to
(
tmp
[
cursor
1
]
)
<
0
)
{
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
0
)
break
outer
;
}
else
{
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
count
1
=
gallop
right
(
(
comparable
)
a
[
cursor
2
]
,
tmp
,
cursor
1
,
len
1
,
0
)
;
if
(
count
1
!=
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
count
1
)
;
dest
+=
count
1
;
cursor
1
+=
count
1
;
len
1
-=
count
1
;
if
(
len
1
<=
1
)
break
outer
;
}
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
break
outer
;
count
2
=
gallop
left
(
(
comparable
)
tmp
[
cursor
1
]
,
a
,
cursor
2
,
len
2
,
0
)
;
if
(
count
2
!=
0
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
count
2
)
;
dest
+=
count
2
;
cursor
2
+=
count
2
;
len
2
-=
count
2
;
if
(
len
2
==
0
)
break
outer
;
}
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
if
(
--
len
1
==
1
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
1
==
1
)
{
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
}
else
if
(
len
1
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
2
==
0
;
if
(
debug
)
assert
len
1
>
1
;
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
1
)
;
system
.
arraycopy
(
a
,
base
1
,
tmp
,
0
,
len
1
)
;
int
cursor
1
=
0
;
int
cursor
2
=
base
2
;
int
dest
=
base
1
;
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
return
;
}
if
(
len
1
==
1
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
if
(
(
(
comparable
)
a
[
cursor
2
]
)
.
compare
to
(
tmp
[
cursor
1
]
)
<
0
)
{
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
0
)
break
outer
;
}
else
{
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
count
1
=
gallop
right
(
(
comparable
)
a
[
cursor
2
]
,
tmp
,
cursor
1
,
len
1
,
0
)
;
if
(
count
1
!=
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
count
1
)
;
dest
+=
count
1
;
cursor
1
+=
count
1
;
len
1
-=
count
1
;
if
(
len
1
<=
1
)
break
outer
;
}
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
break
outer
;
count
2
=
gallop
left
(
(
comparable
)
tmp
[
cursor
1
]
,
a
,
cursor
2
,
len
2
,
0
)
;
if
(
count
2
!=
0
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
count
2
)
;
dest
+=
count
2
;
cursor
2
+=
count
2
;
len
2
-=
count
2
;
if
(
len
2
==
0
)
break
outer
;
}
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
if
(
--
len
1
==
1
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
1
==
1
)
{
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
}
else
if
(
len
1
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
2
==
0
;
if
(
debug
)
assert
len
1
>
1
;
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
}
}
<SENTENCE_END/>
lo
%END%
(5.14e-01)
to
(2.87e-02)
%UNK%
(2.73e-02)
merge
(2.31e-02)
0
(1.56e-02)
1
(1.37e-02)
range
(1.35e-02)
of
(1.07e-02)
index
(9.05e-03)
add
(8.53e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
1
)
;
system
.
arraycopy
(
a
,
base
1
,
tmp
,
0
,
len
1
)
;
int
cursor
1
=
0
;
int
cursor
2
=
base
2
;
int
dest
=
base
1
;
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
return
;
}
if
(
len
1
==
1
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
if
(
(
(
comparable
)
a
[
cursor
2
]
)
.
compare
to
(
tmp
[
cursor
1
]
)
<
0
)
{
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
0
)
break
outer
;
}
else
{
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
count
1
=
gallop
right
(
(
comparable
)
a
[
cursor
2
]
,
tmp
,
cursor
1
,
len
1
,
0
)
;
if
(
count
1
!=
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
count
1
)
;
dest
+=
count
1
;
cursor
1
+=
count
1
;
len
1
-=
count
1
;
if
(
len
1
<=
1
)
break
outer
;
}
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
break
outer
;
count
2
=
gallop
left
(
(
comparable
)
tmp
[
cursor
1
]
,
a
,
cursor
2
,
len
2
,
0
)
;
if
(
count
2
!=
0
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
count
2
)
;
dest
+=
count
2
;
cursor
2
+=
count
2
;
len
2
-=
count
2
;
if
(
len
2
==
0
)
break
outer
;
}
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
if
(
--
len
1
==
1
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
1
==
1
)
{
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
}
else
if
(
len
1
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
2
==
0
;
if
(
debug
)
assert
len
1
>
1
;
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
1
)
;
system
.
arraycopy
(
a
,
base
1
,
tmp
,
0
,
len
1
)
;
int
cursor
1
=
0
;
int
cursor
2
=
base
2
;
int
dest
=
base
1
;
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
return
;
}
if
(
len
1
==
1
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
if
(
(
(
comparable
)
a
[
cursor
2
]
)
.
compare
to
(
tmp
[
cursor
1
]
)
<
0
)
{
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
0
)
break
outer
;
}
else
{
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
count
1
=
gallop
right
(
(
comparable
)
a
[
cursor
2
]
,
tmp
,
cursor
1
,
len
1
,
0
)
;
if
(
count
1
!=
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
count
1
)
;
dest
+=
count
1
;
cursor
1
+=
count
1
;
len
1
-=
count
1
;
if
(
len
1
<=
1
)
break
outer
;
}
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
break
outer
;
count
2
=
gallop
left
(
(
comparable
)
tmp
[
cursor
1
]
,
a
,
cursor
2
,
len
2
,
0
)
;
if
(
count
2
!=
0
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
count
2
)
;
dest
+=
count
2
;
cursor
2
+=
count
2
;
len
2
-=
count
2
;
if
(
len
2
==
0
)
break
outer
;
}
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
if
(
--
len
1
==
1
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
1
==
1
)
{
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
}
else
if
(
len
1
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
2
==
0
;
if
(
debug
)
assert
len
1
>
1
;
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(7.27e-01)
to
(1.58e-02)
%UNK%
(1.40e-02)
1
(9.08e-03)
0
(8.77e-03)
of
(6.78e-03)
merge
(6.72e-03)
range
(6.65e-03)
at
(5.71e-03)
2
(5.30e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
1
)
;
system
.
arraycopy
(
a
,
base
1
,
tmp
,
0
,
len
1
)
;
int
cursor
1
=
0
;
int
cursor
2
=
base
2
;
int
dest
=
base
1
;
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
return
;
}
if
(
len
1
==
1
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
if
(
(
(
comparable
)
a
[
cursor
2
]
)
.
compare
to
(
tmp
[
cursor
1
]
)
<
0
)
{
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
0
)
break
outer
;
}
else
{
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
count
1
=
gallop
right
(
(
comparable
)
a
[
cursor
2
]
,
tmp
,
cursor
1
,
len
1
,
0
)
;
if
(
count
1
!=
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
count
1
)
;
dest
+=
count
1
;
cursor
1
+=
count
1
;
len
1
-=
count
1
;
if
(
len
1
<=
1
)
break
outer
;
}
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
break
outer
;
count
2
=
gallop
left
(
(
comparable
)
tmp
[
cursor
1
]
,
a
,
cursor
2
,
len
2
,
0
)
;
if
(
count
2
!=
0
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
count
2
)
;
dest
+=
count
2
;
cursor
2
+=
count
2
;
len
2
-=
count
2
;
if
(
len
2
==
0
)
break
outer
;
}
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
if
(
--
len
1
==
1
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
1
==
1
)
{
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
}
else
if
(
len
1
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
2
==
0
;
if
(
debug
)
assert
len
1
>
1
;
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
1
)
;
system
.
arraycopy
(
a
,
base
1
,
tmp
,
0
,
len
1
)
;
int
cursor
1
=
0
;
int
cursor
2
=
base
2
;
int
dest
=
base
1
;
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
return
;
}
if
(
len
1
==
1
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
if
(
(
(
comparable
)
a
[
cursor
2
]
)
.
compare
to
(
tmp
[
cursor
1
]
)
<
0
)
{
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
0
)
break
outer
;
}
else
{
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
1
&&
len
2
>
0
;
count
1
=
gallop
right
(
(
comparable
)
a
[
cursor
2
]
,
tmp
,
cursor
1
,
len
1
,
0
)
;
if
(
count
1
!=
0
)
{
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
count
1
)
;
dest
+=
count
1
;
cursor
1
+=
count
1
;
len
1
-=
count
1
;
if
(
len
1
<=
1
)
break
outer
;
}
a
[
dest
++
]
=
a
[
cursor
2
++
]
;
if
(
--
len
2
==
0
)
break
outer
;
count
2
=
gallop
left
(
(
comparable
)
tmp
[
cursor
1
]
,
a
,
cursor
2
,
len
2
,
0
)
;
if
(
count
2
!=
0
)
{
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
count
2
)
;
dest
+=
count
2
;
cursor
2
+=
count
2
;
len
2
-=
count
2
;
if
(
len
2
==
0
)
break
outer
;
}
a
[
dest
++
]
=
tmp
[
cursor
1
++
]
;
if
(
--
len
1
==
1
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
1
==
1
)
{
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
a
,
cursor
2
,
a
,
dest
,
len
2
)
;
a
[
dest
+
len
2
]
=
tmp
[
cursor
1
]
;
}
else
if
(
len
1
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
2
==
0
;
if
(
debug
)
assert
len
1
>
1
;
system
.
arraycopy
(
tmp
,
cursor
1
,
a
,
dest
,
len
1
)
;
}
}
<SENTENCE_END/>
merge,hi
merge
merge
(3.35e-01)
%UNK%
(3.24e-02)
sort
(2.92e-02)
range
(2.50e-02)
%END%
(2.43e-02)
to
(2.24e-02)
add
(1.69e-02)
insert
(1.65e-02)
lo
(1.48e-02)
1
(1.33e-02)
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
2
)
;
system
.
arraycopy
(
a
,
base
2
,
tmp
,
0
,
len
2
)
;
int
cursor
1
=
base
1
+
len
1
-
1
;
int
cursor
2
=
len
2
-
1
;
int
dest
=
base
2
+
len
2
-
1
;
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
{
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
return
;
}
if
(
len
2
==
1
)
{
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
if
(
(
(
comparable
)
tmp
[
cursor
2
]
)
.
compare
to
(
a
[
cursor
1
]
)
<
0
)
{
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
0
)
break
outer
;
}
else
{
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
count
1
=
len
1
-
gallop
right
(
(
comparable
)
tmp
[
cursor
2
]
,
a
,
base
1
,
len
1
,
len
1
-
1
)
;
if
(
count
1
!=
0
)
{
dest
-=
count
1
;
cursor
1
-=
count
1
;
len
1
-=
count
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
count
1
)
;
if
(
len
1
==
0
)
break
outer
;
}
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
if
(
--
len
2
==
1
)
break
outer
;
count
2
=
len
2
-
gallop
left
(
(
comparable
)
a
[
cursor
1
]
,
tmp
,
0
,
len
2
,
len
2
-
1
)
;
if
(
count
2
!=
0
)
{
dest
-=
count
2
;
cursor
2
-=
count
2
;
len
2
-=
count
2
;
system
.
arraycopy
(
tmp
,
cursor
2
+
1
,
a
,
dest
+
1
,
count
2
)
;
if
(
len
2
<=
1
)
break
outer
;
}
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
2
==
1
)
{
if
(
debug
)
assert
len
1
>
0
;
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
}
else
if
(
len
2
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
1
==
0
;
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
2
)
;
system
.
arraycopy
(
a
,
base
2
,
tmp
,
0
,
len
2
)
;
int
cursor
1
=
base
1
+
len
1
-
1
;
int
cursor
2
=
len
2
-
1
;
int
dest
=
base
2
+
len
2
-
1
;
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
{
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
return
;
}
if
(
len
2
==
1
)
{
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
if
(
(
(
comparable
)
tmp
[
cursor
2
]
)
.
compare
to
(
a
[
cursor
1
]
)
<
0
)
{
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
0
)
break
outer
;
}
else
{
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
count
1
=
len
1
-
gallop
right
(
(
comparable
)
tmp
[
cursor
2
]
,
a
,
base
1
,
len
1
,
len
1
-
1
)
;
if
(
count
1
!=
0
)
{
dest
-=
count
1
;
cursor
1
-=
count
1
;
len
1
-=
count
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
count
1
)
;
if
(
len
1
==
0
)
break
outer
;
}
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
if
(
--
len
2
==
1
)
break
outer
;
count
2
=
len
2
-
gallop
left
(
(
comparable
)
a
[
cursor
1
]
,
tmp
,
0
,
len
2
,
len
2
-
1
)
;
if
(
count
2
!=
0
)
{
dest
-=
count
2
;
cursor
2
-=
count
2
;
len
2
-=
count
2
;
system
.
arraycopy
(
tmp
,
cursor
2
+
1
,
a
,
dest
+
1
,
count
2
)
;
if
(
len
2
<=
1
)
break
outer
;
}
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
2
==
1
)
{
if
(
debug
)
assert
len
1
>
0
;
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
}
else
if
(
len
2
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
1
==
0
;
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
}
}
<SENTENCE_END/>
hi
%END%
(4.47e-01)
merge
(3.57e-02)
%UNK%
(3.23e-02)
to
(2.76e-02)
1
(1.97e-02)
range
(1.92e-02)
of
(1.50e-02)
0
(1.49e-02)
index
(1.22e-02)
at
(9.12e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
2
)
;
system
.
arraycopy
(
a
,
base
2
,
tmp
,
0
,
len
2
)
;
int
cursor
1
=
base
1
+
len
1
-
1
;
int
cursor
2
=
len
2
-
1
;
int
dest
=
base
2
+
len
2
-
1
;
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
{
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
return
;
}
if
(
len
2
==
1
)
{
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
if
(
(
(
comparable
)
tmp
[
cursor
2
]
)
.
compare
to
(
a
[
cursor
1
]
)
<
0
)
{
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
0
)
break
outer
;
}
else
{
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
count
1
=
len
1
-
gallop
right
(
(
comparable
)
tmp
[
cursor
2
]
,
a
,
base
1
,
len
1
,
len
1
-
1
)
;
if
(
count
1
!=
0
)
{
dest
-=
count
1
;
cursor
1
-=
count
1
;
len
1
-=
count
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
count
1
)
;
if
(
len
1
==
0
)
break
outer
;
}
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
if
(
--
len
2
==
1
)
break
outer
;
count
2
=
len
2
-
gallop
left
(
(
comparable
)
a
[
cursor
1
]
,
tmp
,
0
,
len
2
,
len
2
-
1
)
;
if
(
count
2
!=
0
)
{
dest
-=
count
2
;
cursor
2
-=
count
2
;
len
2
-=
count
2
;
system
.
arraycopy
(
tmp
,
cursor
2
+
1
,
a
,
dest
+
1
,
count
2
)
;
if
(
len
2
<=
1
)
break
outer
;
}
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
2
==
1
)
{
if
(
debug
)
assert
len
1
>
0
;
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
}
else
if
(
len
2
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
1
==
0
;
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
2
)
;
system
.
arraycopy
(
a
,
base
2
,
tmp
,
0
,
len
2
)
;
int
cursor
1
=
base
1
+
len
1
-
1
;
int
cursor
2
=
len
2
-
1
;
int
dest
=
base
2
+
len
2
-
1
;
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
{
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
return
;
}
if
(
len
2
==
1
)
{
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
if
(
(
(
comparable
)
tmp
[
cursor
2
]
)
.
compare
to
(
a
[
cursor
1
]
)
<
0
)
{
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
0
)
break
outer
;
}
else
{
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
count
1
=
len
1
-
gallop
right
(
(
comparable
)
tmp
[
cursor
2
]
,
a
,
base
1
,
len
1
,
len
1
-
1
)
;
if
(
count
1
!=
0
)
{
dest
-=
count
1
;
cursor
1
-=
count
1
;
len
1
-=
count
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
count
1
)
;
if
(
len
1
==
0
)
break
outer
;
}
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
if
(
--
len
2
==
1
)
break
outer
;
count
2
=
len
2
-
gallop
left
(
(
comparable
)
a
[
cursor
1
]
,
tmp
,
0
,
len
2
,
len
2
-
1
)
;
if
(
count
2
!=
0
)
{
dest
-=
count
2
;
cursor
2
-=
count
2
;
len
2
-=
count
2
;
system
.
arraycopy
(
tmp
,
cursor
2
+
1
,
a
,
dest
+
1
,
count
2
)
;
if
(
len
2
<=
1
)
break
outer
;
}
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
2
==
1
)
{
if
(
debug
)
assert
len
1
>
0
;
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
}
else
if
(
len
2
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
1
==
0
;
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(6.53e-01)
%UNK%
(1.86e-02)
to
(1.74e-02)
1
(1.44e-02)
merge
(1.30e-02)
range
(1.11e-02)
of
(1.06e-02)
0
(9.86e-03)
at
(7.92e-03)
index
(7.46e-03)
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
2
)
;
system
.
arraycopy
(
a
,
base
2
,
tmp
,
0
,
len
2
)
;
int
cursor
1
=
base
1
+
len
1
-
1
;
int
cursor
2
=
len
2
-
1
;
int
dest
=
base
2
+
len
2
-
1
;
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
{
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
return
;
}
if
(
len
2
==
1
)
{
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
if
(
(
(
comparable
)
tmp
[
cursor
2
]
)
.
compare
to
(
a
[
cursor
1
]
)
<
0
)
{
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
0
)
break
outer
;
}
else
{
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
count
1
=
len
1
-
gallop
right
(
(
comparable
)
tmp
[
cursor
2
]
,
a
,
base
1
,
len
1
,
len
1
-
1
)
;
if
(
count
1
!=
0
)
{
dest
-=
count
1
;
cursor
1
-=
count
1
;
len
1
-=
count
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
count
1
)
;
if
(
len
1
==
0
)
break
outer
;
}
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
if
(
--
len
2
==
1
)
break
outer
;
count
2
=
len
2
-
gallop
left
(
(
comparable
)
a
[
cursor
1
]
,
tmp
,
0
,
len
2
,
len
2
-
1
)
;
if
(
count
2
!=
0
)
{
dest
-=
count
2
;
cursor
2
-=
count
2
;
len
2
-=
count
2
;
system
.
arraycopy
(
tmp
,
cursor
2
+
1
,
a
,
dest
+
1
,
count
2
)
;
if
(
len
2
<=
1
)
break
outer
;
}
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
2
==
1
)
{
if
(
debug
)
assert
len
1
>
0
;
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
}
else
if
(
len
2
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
1
==
0
;
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
0
&&
base
1
+
len
1
==
base
2
;
object
[
]
a
=
this
.
a
;
object
[
]
tmp
=
ensure
capacity
(
len
2
)
;
system
.
arraycopy
(
a
,
base
2
,
tmp
,
0
,
len
2
)
;
int
cursor
1
=
base
1
+
len
1
-
1
;
int
cursor
2
=
len
2
-
1
;
int
dest
=
base
2
+
len
2
-
1
;
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
{
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
return
;
}
if
(
len
2
==
1
)
{
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
return
;
}
int
min
gallop
=
this
.
min
gallop
;
outer
:
while
(
true
)
{
int
count
1
=
0
;
int
count
2
=
0
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
if
(
(
(
comparable
)
tmp
[
cursor
2
]
)
.
compare
to
(
a
[
cursor
1
]
)
<
0
)
{
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
count
1
++
;
count
2
=
0
;
if
(
--
len
1
==
0
)
break
outer
;
}
else
{
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
count
2
++
;
count
1
=
0
;
if
(
--
len
2
==
1
)
break
outer
;
}
}
while
(
(
count
1
|
count
2
)
<
min
gallop
)
;
do
{
if
(
debug
)
assert
len
1
>
0
&&
len
2
>
1
;
count
1
=
len
1
-
gallop
right
(
(
comparable
)
tmp
[
cursor
2
]
,
a
,
base
1
,
len
1
,
len
1
-
1
)
;
if
(
count
1
!=
0
)
{
dest
-=
count
1
;
cursor
1
-=
count
1
;
len
1
-=
count
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
count
1
)
;
if
(
len
1
==
0
)
break
outer
;
}
a
[
dest
--
]
=
tmp
[
cursor
2
--
]
;
if
(
--
len
2
==
1
)
break
outer
;
count
2
=
len
2
-
gallop
left
(
(
comparable
)
a
[
cursor
1
]
,
tmp
,
0
,
len
2
,
len
2
-
1
)
;
if
(
count
2
!=
0
)
{
dest
-=
count
2
;
cursor
2
-=
count
2
;
len
2
-=
count
2
;
system
.
arraycopy
(
tmp
,
cursor
2
+
1
,
a
,
dest
+
1
,
count
2
)
;
if
(
len
2
<=
1
)
break
outer
;
}
a
[
dest
--
]
=
a
[
cursor
1
--
]
;
if
(
--
len
1
==
0
)
break
outer
;
min
gallop
--
;
}
while
(
count
1
>=
min
gallop
|
count
2
>=
min
gallop
)
;
if
(
min
gallop
<
0
)
min
gallop
=
0
;
min
gallop
+=
2
;
}
this
.
min
gallop
=
min
gallop
<
1
?
1
:
min
gallop
;
if
(
len
2
==
1
)
{
if
(
debug
)
assert
len
1
>
0
;
dest
-=
len
1
;
cursor
1
-=
len
1
;
system
.
arraycopy
(
a
,
cursor
1
+
1
,
a
,
dest
+
1
,
len
1
)
;
a
[
dest
]
=
tmp
[
cursor
2
]
;
}
else
if
(
len
2
==
0
)
{
throw
new
illegal
argument
exception
(
"Comparison method violates its general contract!"
)
;
}
else
{
if
(
debug
)
assert
len
1
==
0
;
if
(
debug
)
assert
len
2
>
0
;
system
.
arraycopy
(
tmp
,
0
,
a
,
dest
-
(
len
2
-
1
)
,
len
2
)
;
}
}
<SENTENCE_END/>
ensure,capacity
ensure
ensure
(4.02e-01)
truncate
(1.33e-01)
size
(1.13e-01)
new
(7.48e-02)
allocate
(5.16e-02)
resize
(2.86e-02)
shrink
(2.07e-02)
add
(2.06e-02)
capacity
(1.65e-02)
put
(1.08e-02)
<SENTENCE_START>
{
if
(
tmp
.
length
<
min
capacity
)
{
int
new
size
=
min
capacity
;
new
size
|=
new
size
>>
1
;
new
size
|=
new
size
>>
2
;
new
size
|=
new
size
>>
4
;
new
size
|=
new
size
>>
8
;
new
size
|=
new
size
>>
16
;
new
size
++
;
if
(
new
size
<
0
)
new
size
=
min
capacity
;
else
new
size
=
math
.
min
(
new
size
,
a
.
length
>>>
1
)
;
object
[
]
new
array
=
new
object
[
new
size
]
;
tmp
=
new
array
;
}
return
tmp
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
tmp
.
length
<
min
capacity
)
{
int
new
size
=
min
capacity
;
new
size
|=
new
size
>>
1
;
new
size
|=
new
size
>>
2
;
new
size
|=
new
size
>>
4
;
new
size
|=
new
size
>>
8
;
new
size
|=
new
size
>>
16
;
new
size
++
;
if
(
new
size
<
0
)
new
size
=
min
capacity
;
else
new
size
=
math
.
min
(
new
size
,
a
.
length
>>>
1
)
;
object
[
]
new
array
=
new
object
[
new
size
]
;
tmp
=
new
array
;
}
return
tmp
;
}
<SENTENCE_END/>
capacity
new
(3.98e-01)
%END%
(1.66e-01)
size
(7.47e-02)
truncate
(6.49e-02)
capacity
(6.17e-02)
resize
(3.39e-02)
allocate
(2.46e-02)
ensure
(2.41e-02)
instance
(1.39e-02)
add
(9.21e-03)
<SENTENCE_START>
{
if
(
tmp
.
length
<
min
capacity
)
{
int
new
size
=
min
capacity
;
new
size
|=
new
size
>>
1
;
new
size
|=
new
size
>>
2
;
new
size
|=
new
size
>>
4
;
new
size
|=
new
size
>>
8
;
new
size
|=
new
size
>>
16
;
new
size
++
;
if
(
new
size
<
0
)
new
size
=
min
capacity
;
else
new
size
=
math
.
min
(
new
size
,
a
.
length
>>>
1
)
;
object
[
]
new
array
=
new
object
[
new
size
]
;
tmp
=
new
array
;
}
return
tmp
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
tmp
.
length
<
min
capacity
)
{
int
new
size
=
min
capacity
;
new
size
|=
new
size
>>
1
;
new
size
|=
new
size
>>
2
;
new
size
|=
new
size
>>
4
;
new
size
|=
new
size
>>
8
;
new
size
|=
new
size
>>
16
;
new
size
++
;
if
(
new
size
<
0
)
new
size
=
min
capacity
;
else
new
size
=
math
.
min
(
new
size
,
a
.
length
>>>
1
)
;
object
[
]
new
array
=
new
object
[
new
size
]
;
tmp
=
new
array
;
}
return
tmp
;
}
<SENTENCE_END/>
%END%
%END%
(6.93e-01)
new
(1.65e-01)
capacity
(3.16e-02)
size
(1.96e-02)
truncate
(8.23e-03)
instance
(7.98e-03)
resize
(7.70e-03)
array
(7.05e-03)
to
(4.40e-03)
with
(4.33e-03)
<SENTENCE_START>
{
if
(
tmp
.
length
<
min
capacity
)
{
int
new
size
=
min
capacity
;
new
size
|=
new
size
>>
1
;
new
size
|=
new
size
>>
2
;
new
size
|=
new
size
>>
4
;
new
size
|=
new
size
>>
8
;
new
size
|=
new
size
>>
16
;
new
size
++
;
if
(
new
size
<
0
)
new
size
=
min
capacity
;
else
new
size
=
math
.
min
(
new
size
,
a
.
length
>>>
1
)
;
object
[
]
new
array
=
new
object
[
new
size
]
;
tmp
=
new
array
;
}
return
tmp
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
tmp
.
length
<
min
capacity
)
{
int
new
size
=
min
capacity
;
new
size
|=
new
size
>>
1
;
new
size
|=
new
size
>>
2
;
new
size
|=
new
size
>>
4
;
new
size
|=
new
size
>>
8
;
new
size
|=
new
size
>>
16
;
new
size
++
;
if
(
new
size
<
0
)
new
size
=
min
capacity
;
else
new
size
=
math
.
min
(
new
size
,
a
.
length
>>>
1
)
;
object
[
]
new
array
=
new
object
[
new
size
]
;
tmp
=
new
array
;
}
return
tmp
;
}
<SENTENCE_END/>
range,check
range
put
(1.65e-01)
insert
(1.35e-01)
range
(1.25e-01)
index
(9.26e-02)
get
(4.92e-02)
to
(3.33e-02)
remove
(3.16e-02)
next
(2.41e-02)
of
(2.10e-02)
add
(1.68e-02)
<SENTENCE_START>
{
if
(
from
index
>
to
index
)
throw
new
illegal
argument
exception
(
"fromIndex("
+
from
index
+
") > toIndex("
+
to
index
+
")"
)
;
if
(
from
index
<
0
)
throw
new
array
index
out
of
bounds
exception
(
from
index
)
;
if
(
to
index
>
array
len
)
throw
new
array
index
out
of
bounds
exception
(
to
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
from
index
>
to
index
)
throw
new
illegal
argument
exception
(
"fromIndex("
+
from
index
+
") > toIndex("
+
to
index
+
")"
)
;
if
(
from
index
<
0
)
throw
new
array
index
out
of
bounds
exception
(
from
index
)
;
if
(
to
index
>
array
len
)
throw
new
array
index
out
of
bounds
exception
(
to
index
)
;
}
<SENTENCE_END/>
check
%END%
(5.08e-01)
at
(9.61e-02)
index
(6.41e-02)
to
(4.06e-02)
of
(3.20e-02)
range
(3.05e-02)
from
(2.15e-02)
string
(1.90e-02)
next
(1.29e-02)
value
(8.82e-03)
<SENTENCE_START>
{
if
(
from
index
>
to
index
)
throw
new
illegal
argument
exception
(
"fromIndex("
+
from
index
+
") > toIndex("
+
to
index
+
")"
)
;
if
(
from
index
<
0
)
throw
new
array
index
out
of
bounds
exception
(
from
index
)
;
if
(
to
index
>
array
len
)
throw
new
array
index
out
of
bounds
exception
(
to
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
from
index
>
to
index
)
throw
new
illegal
argument
exception
(
"fromIndex("
+
from
index
+
") > toIndex("
+
to
index
+
")"
)
;
if
(
from
index
<
0
)
throw
new
array
index
out
of
bounds
exception
(
from
index
)
;
if
(
to
index
>
array
len
)
throw
new
array
index
out
of
bounds
exception
(
to
index
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.19e-01)
at
(1.58e-02)
index
(1.12e-02)
exception
(4.31e-03)
to
(4.10e-03)
bounds
(2.68e-03)
of
(2.64e-03)
from
(2.62e-03)
string
(2.61e-03)
array
(2.37e-03)
<SENTENCE_START>
{
if
(
from
index
>
to
index
)
throw
new
illegal
argument
exception
(
"fromIndex("
+
from
index
+
") > toIndex("
+
to
index
+
")"
)
;
if
(
from
index
<
0
)
throw
new
array
index
out
of
bounds
exception
(
from
index
)
;
if
(
to
index
>
array
len
)
throw
new
array
index
out
of
bounds
exception
(
to
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
from
index
>
to
index
)
throw
new
illegal
argument
exception
(
"fromIndex("
+
from
index
+
") > toIndex("
+
to
index
+
")"
)
;
if
(
from
index
<
0
)
throw
new
array
index
out
of
bounds
exception
(
from
index
)
;
if
(
to
index
>
array
len
)
throw
new
array
index
out
of
bounds
exception
(
to
index
)
;
}
<SENTENCE_END/>
read
read
length
(6.16e-01)
get
(1.00e-01)
read
(5.16e-02)
len
(1.22e-02)
is
(1.19e-02)
encode
(1.09e-02)
skip
(9.09e-03)
0
(7.36e-03)
%UNK%
(7.32e-03)
substring
(5.33e-03)
<SENTENCE_START>
{
if
(
length
>
in
.
length
(
)
-
position
)
{
length
=
in
.
length
(
)
-
position
;
if
(
length
<=
0
)
{
return
-
1
;
}
}
in
.
get
chars
(
position
,
position
+
length
,
b
,
offset
)
;
position
+=
length
;
return
length
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
length
>
in
.
length
(
)
-
position
)
{
length
=
in
.
length
(
)
-
position
;
if
(
length
<=
0
)
{
return
-
1
;
}
}
in
.
get
chars
(
position
,
position
+
length
,
b
,
offset
)
;
position
+=
length
;
return
length
;
}
<SENTENCE_END/>
%END%
%END%
(8.74e-01)
length
(2.04e-02)
position
(1.05e-02)
in
(8.51e-03)
at
(4.54e-03)
string
(3.30e-03)
%UNK%
(3.00e-03)
point
(2.95e-03)
to
(2.35e-03)
read
(2.28e-03)
<SENTENCE_START>
{
if
(
length
>
in
.
length
(
)
-
position
)
{
length
=
in
.
length
(
)
-
position
;
if
(
length
<=
0
)
{
return
-
1
;
}
}
in
.
get
chars
(
position
,
position
+
length
,
b
,
offset
)
;
position
+=
length
;
return
length
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
length
>
in
.
length
(
)
-
position
)
{
length
=
in
.
length
(
)
-
position
;
if
(
length
<=
0
)
{
return
-
1
;
}
}
in
.
get
chars
(
position
,
position
+
length
,
b
,
offset
)
;
position
+=
length
;
return
length
;
}
<SENTENCE_END/>
close
close
start
(9.21e-02)
paint
(6.27e-02)
set
(6.27e-02)
update
(5.55e-02)
flush
(4.55e-02)
drag
(4.00e-02)
init
(3.97e-02)
%UNK%
(3.86e-02)
end
(3.82e-02)
close
(3.42e-02)
<SENTENCE_START>
{
}
<SENTENCE_END/>
<SENTENCE_START>
{
}
<SENTENCE_END/>
%END%
%END%
(7.10e-01)
%UNK%
(2.03e-02)
title
(1.16e-02)
value
(9.48e-03)
only
(8.73e-03)
accessible
(7.33e-03)
layout
(5.44e-03)
array
(4.77e-03)
changed
(4.73e-03)
count
(4.54e-03)
<SENTENCE_START>
{
}
<SENTENCE_END/>
<SENTENCE_START>
{
}
<SENTENCE_END/>
create,default,shader
create
create
(5.06e-01)
default
(1.66e-01)
get
(4.00e-02)
usage
(2.73e-02)
save
(2.49e-02)
%UNK%
(2.21e-02)
distance
(1.75e-02)
clicked
(1.60e-02)
vertex
(1.22e-02)
%END%
(9.86e-03)
<SENTENCE_START>
{
string
vertex
shader
=
"attribute vec4 "
+
shader
program
.
position
attribute
+
"; "
+
"attribute vec4 "
+
shader
program
.
color
attribute
+
"; "
+
"attribute vec2 "
+
shader
program
.
texcoord
attribute
+
"0; "
+
"uniform mat4 u_projTrans; "
+
"varying vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
" "
+
"void main() "
+
"{ "
+
" v_color = "
+
shader
program
.
color
attribute
+
"; "
+
" v_color.a = v_color.a * (255.0/254.0); "
+
" v_texCoords = "
+
shader
program
.
texcoord
attribute
+
"0; "
+
" gl_Position = u_projTrans * "
+
shader
program
.
position
attribute
+
"; "
+
"} "
;
string
fragment
shader
=
"#ifdef GL_ES "
+
"#define LOWP lowp "
+
"precision mediump float; "
+
"#else "
+
"#define LOWP "
+
"#endif "
+
"varying LOWP vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
"uniform sampler2D u_texture; "
+
"void main() "
+
"{ "
+
" gl_FragColor = v_color * texture2D(u_texture, v_texCoords); "
+
"}"
;
shader
program
shader
=
new
shader
program
(
vertex
shader
,
fragment
shader
)
;
if
(
shader
.
is
compiled
(
)
==
false
)
throw
new
illegal
argument
exception
(
"Error compiling shader: "
+
shader
.
get
log
(
)
)
;
return
shader
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
vertex
shader
=
"attribute vec4 "
+
shader
program
.
position
attribute
+
"; "
+
"attribute vec4 "
+
shader
program
.
color
attribute
+
"; "
+
"attribute vec2 "
+
shader
program
.
texcoord
attribute
+
"0; "
+
"uniform mat4 u_projTrans; "
+
"varying vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
" "
+
"void main() "
+
"{ "
+
" v_color = "
+
shader
program
.
color
attribute
+
"; "
+
" v_color.a = v_color.a * (255.0/254.0); "
+
" v_texCoords = "
+
shader
program
.
texcoord
attribute
+
"0; "
+
" gl_Position = u_projTrans * "
+
shader
program
.
position
attribute
+
"; "
+
"} "
;
string
fragment
shader
=
"#ifdef GL_ES "
+
"#define LOWP lowp "
+
"precision mediump float; "
+
"#else "
+
"#define LOWP "
+
"#endif "
+
"varying LOWP vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
"uniform sampler2D u_texture; "
+
"void main() "
+
"{ "
+
" gl_FragColor = v_color * texture2D(u_texture, v_texCoords); "
+
"}"
;
shader
program
shader
=
new
shader
program
(
vertex
shader
,
fragment
shader
)
;
if
(
shader
.
is
compiled
(
)
==
false
)
throw
new
illegal
argument
exception
(
"Error compiling shader: "
+
shader
.
get
log
(
)
)
;
return
shader
;
}
<SENTENCE_END/>
default
default
(1.97e-01)
create
(1.47e-01)
%END%
(1.18e-01)
vertex
(7.45e-02)
shader
(5.36e-02)
usage
(2.42e-02)
%UNK%
(2.39e-02)
string
(2.18e-02)
save
(2.04e-02)
clicked
(1.84e-02)
<SENTENCE_START>
{
string
vertex
shader
=
"attribute vec4 "
+
shader
program
.
position
attribute
+
"; "
+
"attribute vec4 "
+
shader
program
.
color
attribute
+
"; "
+
"attribute vec2 "
+
shader
program
.
texcoord
attribute
+
"0; "
+
"uniform mat4 u_projTrans; "
+
"varying vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
" "
+
"void main() "
+
"{ "
+
" v_color = "
+
shader
program
.
color
attribute
+
"; "
+
" v_color.a = v_color.a * (255.0/254.0); "
+
" v_texCoords = "
+
shader
program
.
texcoord
attribute
+
"0; "
+
" gl_Position = u_projTrans * "
+
shader
program
.
position
attribute
+
"; "
+
"} "
;
string
fragment
shader
=
"#ifdef GL_ES "
+
"#define LOWP lowp "
+
"precision mediump float; "
+
"#else "
+
"#define LOWP "
+
"#endif "
+
"varying LOWP vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
"uniform sampler2D u_texture; "
+
"void main() "
+
"{ "
+
" gl_FragColor = v_color * texture2D(u_texture, v_texCoords); "
+
"}"
;
shader
program
shader
=
new
shader
program
(
vertex
shader
,
fragment
shader
)
;
if
(
shader
.
is
compiled
(
)
==
false
)
throw
new
illegal
argument
exception
(
"Error compiling shader: "
+
shader
.
get
log
(
)
)
;
return
shader
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
vertex
shader
=
"attribute vec4 "
+
shader
program
.
position
attribute
+
"; "
+
"attribute vec4 "
+
shader
program
.
color
attribute
+
"; "
+
"attribute vec2 "
+
shader
program
.
texcoord
attribute
+
"0; "
+
"uniform mat4 u_projTrans; "
+
"varying vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
" "
+
"void main() "
+
"{ "
+
" v_color = "
+
shader
program
.
color
attribute
+
"; "
+
" v_color.a = v_color.a * (255.0/254.0); "
+
" v_texCoords = "
+
shader
program
.
texcoord
attribute
+
"0; "
+
" gl_Position = u_projTrans * "
+
shader
program
.
position
attribute
+
"; "
+
"} "
;
string
fragment
shader
=
"#ifdef GL_ES "
+
"#define LOWP lowp "
+
"precision mediump float; "
+
"#else "
+
"#define LOWP "
+
"#endif "
+
"varying LOWP vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
"uniform sampler2D u_texture; "
+
"void main() "
+
"{ "
+
" gl_FragColor = v_color * texture2D(u_texture, v_texCoords); "
+
"}"
;
shader
program
shader
=
new
shader
program
(
vertex
shader
,
fragment
shader
)
;
if
(
shader
.
is
compiled
(
)
==
false
)
throw
new
illegal
argument
exception
(
"Error compiling shader: "
+
shader
.
get
log
(
)
)
;
return
shader
;
}
<SENTENCE_END/>
shader
%END%
(2.94e-01)
default
(1.15e-01)
shader
(9.60e-02)
create
(7.83e-02)
%UNK%
(2.62e-02)
vertex
(2.46e-02)
usage
(2.10e-02)
fragment
(2.06e-02)
save
(2.01e-02)
clicked
(1.83e-02)
<SENTENCE_START>
{
string
vertex
shader
=
"attribute vec4 "
+
shader
program
.
position
attribute
+
"; "
+
"attribute vec4 "
+
shader
program
.
color
attribute
+
"; "
+
"attribute vec2 "
+
shader
program
.
texcoord
attribute
+
"0; "
+
"uniform mat4 u_projTrans; "
+
"varying vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
" "
+
"void main() "
+
"{ "
+
" v_color = "
+
shader
program
.
color
attribute
+
"; "
+
" v_color.a = v_color.a * (255.0/254.0); "
+
" v_texCoords = "
+
shader
program
.
texcoord
attribute
+
"0; "
+
" gl_Position = u_projTrans * "
+
shader
program
.
position
attribute
+
"; "
+
"} "
;
string
fragment
shader
=
"#ifdef GL_ES "
+
"#define LOWP lowp "
+
"precision mediump float; "
+
"#else "
+
"#define LOWP "
+
"#endif "
+
"varying LOWP vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
"uniform sampler2D u_texture; "
+
"void main() "
+
"{ "
+
" gl_FragColor = v_color * texture2D(u_texture, v_texCoords); "
+
"}"
;
shader
program
shader
=
new
shader
program
(
vertex
shader
,
fragment
shader
)
;
if
(
shader
.
is
compiled
(
)
==
false
)
throw
new
illegal
argument
exception
(
"Error compiling shader: "
+
shader
.
get
log
(
)
)
;
return
shader
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
vertex
shader
=
"attribute vec4 "
+
shader
program
.
position
attribute
+
"; "
+
"attribute vec4 "
+
shader
program
.
color
attribute
+
"; "
+
"attribute vec2 "
+
shader
program
.
texcoord
attribute
+
"0; "
+
"uniform mat4 u_projTrans; "
+
"varying vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
" "
+
"void main() "
+
"{ "
+
" v_color = "
+
shader
program
.
color
attribute
+
"; "
+
" v_color.a = v_color.a * (255.0/254.0); "
+
" v_texCoords = "
+
shader
program
.
texcoord
attribute
+
"0; "
+
" gl_Position = u_projTrans * "
+
shader
program
.
position
attribute
+
"; "
+
"} "
;
string
fragment
shader
=
"#ifdef GL_ES "
+
"#define LOWP lowp "
+
"precision mediump float; "
+
"#else "
+
"#define LOWP "
+
"#endif "
+
"varying LOWP vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
"uniform sampler2D u_texture; "
+
"void main() "
+
"{ "
+
" gl_FragColor = v_color * texture2D(u_texture, v_texCoords); "
+
"}"
;
shader
program
shader
=
new
shader
program
(
vertex
shader
,
fragment
shader
)
;
if
(
shader
.
is
compiled
(
)
==
false
)
throw
new
illegal
argument
exception
(
"Error compiling shader: "
+
shader
.
get
log
(
)
)
;
return
shader
;
}
<SENTENCE_END/>
%END%
%END%
(4.13e-01)
default
(1.14e-01)
create
(7.65e-02)
shader
(5.51e-02)
%UNK%
(2.96e-02)
usage
(2.51e-02)
save
(2.37e-02)
attribute
(2.04e-02)
clicked
(2.00e-02)
get
(1.03e-02)
<SENTENCE_START>
{
string
vertex
shader
=
"attribute vec4 "
+
shader
program
.
position
attribute
+
"; "
+
"attribute vec4 "
+
shader
program
.
color
attribute
+
"; "
+
"attribute vec2 "
+
shader
program
.
texcoord
attribute
+
"0; "
+
"uniform mat4 u_projTrans; "
+
"varying vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
" "
+
"void main() "
+
"{ "
+
" v_color = "
+
shader
program
.
color
attribute
+
"; "
+
" v_color.a = v_color.a * (255.0/254.0); "
+
" v_texCoords = "
+
shader
program
.
texcoord
attribute
+
"0; "
+
" gl_Position = u_projTrans * "
+
shader
program
.
position
attribute
+
"; "
+
"} "
;
string
fragment
shader
=
"#ifdef GL_ES "
+
"#define LOWP lowp "
+
"precision mediump float; "
+
"#else "
+
"#define LOWP "
+
"#endif "
+
"varying LOWP vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
"uniform sampler2D u_texture; "
+
"void main() "
+
"{ "
+
" gl_FragColor = v_color * texture2D(u_texture, v_texCoords); "
+
"}"
;
shader
program
shader
=
new
shader
program
(
vertex
shader
,
fragment
shader
)
;
if
(
shader
.
is
compiled
(
)
==
false
)
throw
new
illegal
argument
exception
(
"Error compiling shader: "
+
shader
.
get
log
(
)
)
;
return
shader
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
string
vertex
shader
=
"attribute vec4 "
+
shader
program
.
position
attribute
+
"; "
+
"attribute vec4 "
+
shader
program
.
color
attribute
+
"; "
+
"attribute vec2 "
+
shader
program
.
texcoord
attribute
+
"0; "
+
"uniform mat4 u_projTrans; "
+
"varying vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
" "
+
"void main() "
+
"{ "
+
" v_color = "
+
shader
program
.
color
attribute
+
"; "
+
" v_color.a = v_color.a * (255.0/254.0); "
+
" v_texCoords = "
+
shader
program
.
texcoord
attribute
+
"0; "
+
" gl_Position = u_projTrans * "
+
shader
program
.
position
attribute
+
"; "
+
"} "
;
string
fragment
shader
=
"#ifdef GL_ES "
+
"#define LOWP lowp "
+
"precision mediump float; "
+
"#else "
+
"#define LOWP "
+
"#endif "
+
"varying LOWP vec4 v_color; "
+
"varying vec2 v_texCoords; "
+
"uniform sampler2D u_texture; "
+
"void main() "
+
"{ "
+
" gl_FragColor = v_color * texture2D(u_texture, v_texCoords); "
+
"}"
;
shader
program
shader
=
new
shader
program
(
vertex
shader
,
fragment
shader
)
;
if
(
shader
.
is
compiled
(
)
==
false
)
throw
new
illegal
argument
exception
(
"Error compiling shader: "
+
shader
.
get
log
(
)
)
;
return
shader
;
}
<SENTENCE_END/>
setup,matrices
setup
setup
(3.70e-01)
begin
(2.06e-01)
render
(6.11e-02)
set
(5.86e-02)
init
(5.80e-02)
%UNK%
(2.97e-02)
end
(2.36e-02)
bind
(1.77e-02)
update
(1.44e-02)
flush
(9.92e-03)
<SENTENCE_START>
{
combined
matrix
.
set
(
projection
matrix
)
.
mul
(
transform
matrix
)
;
if
(
custom
shader
!=
null
)
{
custom
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
custom
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
else
{
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
combined
matrix
.
set
(
projection
matrix
)
.
mul
(
transform
matrix
)
;
if
(
custom
shader
!=
null
)
{
custom
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
custom
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
else
{
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
}
<SENTENCE_END/>
matrices
%END%
(4.57e-01)
combined
(1.02e-01)
%UNK%
(5.35e-02)
shader
(4.93e-02)
setup
(3.80e-02)
render
(2.25e-02)
begin
(1.73e-02)
matrix
(1.65e-02)
custom
(1.05e-02)
end
(9.75e-03)
<SENTENCE_START>
{
combined
matrix
.
set
(
projection
matrix
)
.
mul
(
transform
matrix
)
;
if
(
custom
shader
!=
null
)
{
custom
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
custom
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
else
{
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
combined
matrix
.
set
(
projection
matrix
)
.
mul
(
transform
matrix
)
;
if
(
custom
shader
!=
null
)
{
custom
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
custom
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
else
{
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(8.69e-01)
matrix
(3.47e-02)
shader
(1.39e-02)
combined
(7.09e-03)
%UNK%
(5.03e-03)
set
(2.71e-03)
custom
(1.98e-03)
uniform
(1.89e-03)
mul
(1.63e-03)
uniformi
(1.05e-03)
<SENTENCE_START>
{
combined
matrix
.
set
(
projection
matrix
)
.
mul
(
transform
matrix
)
;
if
(
custom
shader
!=
null
)
{
custom
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
custom
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
else
{
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
combined
matrix
.
set
(
projection
matrix
)
.
mul
(
transform
matrix
)
;
if
(
custom
shader
!=
null
)
{
custom
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
custom
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
else
{
shader
.
set
uniform
matrix
(
"u_projTrans"
,
combined
matrix
)
;
shader
.
set
uniformi
(
"u_texture"
,
0
)
;
}
}
<SENTENCE_END/>
switch,texture
switch
set
(7.33e-01)
switch
(1.99e-01)
touch
(6.30e-03)
texture
(4.94e-03)
get
(4.18e-03)
reset
(3.95e-03)
apply
(3.65e-03)
invalidate
(3.34e-03)
update
(2.91e-03)
1.0f
(2.82e-03)
<SENTENCE_START>
{
flush
(
)
;
last
texture
=
texture
;
inv
tex
width
=
1.0f
/
texture
.
get
width
(
)
;
inv
tex
height
=
1.0f
/
texture
.
get
height
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
flush
(
)
;
last
texture
=
texture
;
inv
tex
width
=
1.0f
/
texture
.
get
width
(
)
;
inv
tex
height
=
1.0f
/
texture
.
get
height
(
)
;
}
<SENTENCE_END/>
texture
texture
(6.15e-01)
set
(8.35e-02)
last
(3.30e-02)
region
(2.60e-02)
tex
(1.89e-02)
inv
(1.67e-02)
width
(1.31e-02)
1.0f
(1.22e-02)
height
(1.22e-02)
%END%
(9.08e-03)
<SENTENCE_START>
{
flush
(
)
;
last
texture
=
texture
;
inv
tex
width
=
1.0f
/
texture
.
get
width
(
)
;
inv
tex
height
=
1.0f
/
texture
.
get
height
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
flush
(
)
;
last
texture
=
texture
;
inv
tex
width
=
1.0f
/
texture
.
get
width
(
)
;
inv
tex
height
=
1.0f
/
texture
.
get
height
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.89e-01)
texture
(4.45e-02)
region
(2.09e-02)
atlas
(8.73e-03)
height
(6.72e-03)
width
(5.19e-03)
%UNK%
(3.78e-03)
down
(3.68e-03)
set
(3.46e-03)
bounds
(3.33e-03)
<SENTENCE_START>
{
flush
(
)
;
last
texture
=
texture
;
inv
tex
width
=
1.0f
/
texture
.
get
width
(
)
;
inv
tex
height
=
1.0f
/
texture
.
get
height
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
flush
(
)
;
last
texture
=
texture
;
inv
tex
width
=
1.0f
/
texture
.
get
width
(
)
;
inv
tex
height
=
1.0f
/
texture
.
get
height
(
)
;
}
<SENTENCE_END/>
is,drawing
is
get
(8.46e-01)
is
(1.24e-01)
needs
(7.04e-03)
protected
(5.70e-03)
iterator
(3.56e-03)
has
(2.05e-03)
owns
(1.19e-03)
drawing
(1.03e-03)
return
(9.59e-04)
available
(7.72e-04)
<SENTENCE_START>
{
return
drawing
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
drawing
;
}
<SENTENCE_END/>
drawing
drawing
(9.89e-01)
return
(7.51e-03)
type
(1.01e-03)
object
(9.14e-05)
%END%
(6.20e-05)
has
(5.21e-05)
shape
(4.02e-05)
gl
(3.92e-05)
end
(3.81e-05)
available
(2.14e-05)
<SENTENCE_START>
{
return
drawing
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
drawing
;
}
<SENTENCE_END/>
%END%
%END%
(9.49e-01)
drawing
(1.27e-02)
20
(6.13e-03)
value
(4.55e-03)
only
(3.30e-03)
array
(1.14e-03)
offset
(1.11e-03)
object
(9.57e-04)
count
(7.51e-04)
buffer
(6.63e-04)
<SENTENCE_START>
{
return
drawing
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
drawing
;
}
<SENTENCE_END/>
object
object
check
(1.37e-01)
%UNK%
(8.10e-02)
remove
(3.76e-02)
start
(3.11e-02)
set
(2.87e-02)
reset
(2.45e-02)
run
(2.40e-02)
close
(2.27e-02)
action
(2.26e-02)
delete
(2.22e-02)
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
stack
.
add
(
current
=
new
json
object
(
false
)
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
stack
.
add
(
current
=
new
json
object
(
false
)
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.96e-01)
current
(1.01e-02)
%UNK%
(6.62e-03)
json
(3.43e-03)
value
(2.40e-03)
object
(2.38e-03)
directory
(2.06e-03)
file
(1.97e-03)
and
(1.67e-03)
test
(1.65e-03)
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
stack
.
add
(
current
=
new
json
object
(
false
)
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
stack
.
add
(
current
=
new
json
object
(
false
)
)
;
return
this
;
}
<SENTENCE_END/>
object
object
name
(5.78e-01)
element
(5.37e-02)
add
(2.79e-02)
get
(2.74e-02)
attribute
(2.26e-02)
set
(1.78e-02)
size
(1.37e-02)
to
(1.29e-02)
list
(1.29e-02)
remove
(7.96e-03)
<SENTENCE_START>
{
name
(
name
)
.
%SELF%
(
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
name
(
name
)
.
%SELF%
(
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(9.70e-01)
name
(5.67e-03)
this
(1.25e-03)
fv
(7.41e-04)
value
(7.33e-04)
array
(7.14e-04)
all
(6.69e-04)
string
(5.39e-04)
attribute
(5.14e-04)
element
(4.92e-04)
<SENTENCE_START>
{
name
(
name
)
.
%SELF%
(
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
name
(
name
)
.
%SELF%
(
)
;
return
this
;
}
<SENTENCE_END/>
array
array
check
(1.45e-01)
%UNK%
(8.02e-02)
remove
(3.75e-02)
start
(3.43e-02)
set
(2.79e-02)
action
(2.47e-02)
run
(2.23e-02)
reset
(2.18e-02)
delete
(2.15e-02)
close
(2.12e-02)
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
%SELF%
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
stack
.
add
(
current
=
new
json
object
(
true
)
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
%SELF%
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
stack
.
add
(
current
=
new
json
object
(
true
)
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.77e-01)
current
(1.03e-02)
%UNK%
(8.14e-03)
json
(6.16e-03)
object
(3.69e-03)
value
(3.46e-03)
file
(2.59e-03)
directory
(2.04e-03)
test
(1.88e-03)
string
(1.74e-03)
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
%SELF%
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
stack
.
add
(
current
=
new
json
object
(
true
)
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
%SELF%
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
stack
.
add
(
current
=
new
json
object
(
true
)
)
;
return
this
;
}
<SENTENCE_END/>
array
array
name
(5.78e-01)
element
(5.37e-02)
add
(2.79e-02)
get
(2.74e-02)
attribute
(2.26e-02)
set
(1.78e-02)
size
(1.37e-02)
to
(1.29e-02)
list
(1.29e-02)
remove
(7.96e-03)
<SENTENCE_START>
{
name
(
name
)
.
%SELF%
(
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
name
(
name
)
.
%SELF%
(
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(9.70e-01)
name
(5.67e-03)
this
(1.25e-03)
fv
(7.41e-04)
value
(7.33e-04)
array
(7.14e-04)
all
(6.69e-04)
string
(5.39e-04)
attribute
(5.14e-04)
element
(4.92e-04)
<SENTENCE_START>
{
name
(
name
)
.
%SELF%
(
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
name
(
name
)
.
%SELF%
(
)
;
return
this
;
}
<SENTENCE_END/>
name
name
load
(3.05e-01)
read
(1.32e-01)
write
(1.04e-01)
bytes
(7.78e-02)
to
(4.92e-02)
parse
(4.60e-02)
get
(3.12e-02)
out
(1.67e-02)
encode
(1.51e-02)
new
(1.16e-02)
<SENTENCE_START>
{
if
(
current
==
null
||
current
.
array
)
throw
new
illegal
state
exception
(
"Current item must be an object."
)
;
byte
[
]
bytes
=
%SELF%
.
get
bytes
(
"UTF-8"
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
named
=
true
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
==
null
||
current
.
array
)
throw
new
illegal
state
exception
(
"Current item must be an object."
)
;
byte
[
]
bytes
=
%SELF%
.
get
bytes
(
"UTF-8"
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
named
=
true
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.12e-01)
bytes
(4.21e-02)
to
(1.37e-02)
string
(1.28e-02)
byte
(1.03e-02)
write
(6.95e-03)
out
(5.29e-03)
read
(4.58e-03)
load
(3.66e-03)
short
(3.47e-03)
<SENTENCE_START>
{
if
(
current
==
null
||
current
.
array
)
throw
new
illegal
state
exception
(
"Current item must be an object."
)
;
byte
[
]
bytes
=
%SELF%
.
get
bytes
(
"UTF-8"
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
named
=
true
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
==
null
||
current
.
array
)
throw
new
illegal
state
exception
(
"Current item must be an object."
)
;
byte
[
]
bytes
=
%SELF%
.
get
bytes
(
"UTF-8"
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
named
=
true
;
return
this
;
}
<SENTENCE_END/>
value
value
write
(1.77e-01)
get
(1.73e-01)
to
(1.35e-01)
out
(4.65e-02)
load
(4.39e-02)
read
(4.28e-02)
%UNK%
(3.95e-02)
print
(2.97e-02)
new
(2.81e-02)
check
(2.44e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.53e-01)
to
(4.00e-02)
byte
(1.26e-02)
out
(1.04e-02)
string
(6.95e-03)
unsafe
(6.07e-03)
%UNK%
(4.51e-03)
bytes
(3.13e-03)
array
(2.55e-03)
value
(2.54e-03)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
value
value
write
(1.67e-01)
get
(1.63e-01)
check
(6.43e-02)
to
(5.91e-02)
read
(5.73e-02)
load
(5.60e-02)
%UNK%
(4.02e-02)
new
(3.36e-02)
print
(2.73e-02)
out
(1.78e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.33e-01)
to
(2.99e-02)
out
(1.23e-02)
string
(1.10e-02)
unsafe
(7.65e-03)
byte
(7.50e-03)
short
(7.26e-03)
%UNK%
(4.86e-03)
bytes
(3.44e-03)
value
(3.22e-03)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
value
value
get
(2.12e-01)
write
(1.53e-01)
to
(7.19e-02)
check
(6.75e-02)
load
(4.17e-02)
%UNK%
(3.90e-02)
read
(3.41e-02)
new
(3.28e-02)
print
(2.60e-02)
out
(2.58e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(5.94e-01)
to
(1.11e-01)
out
(5.48e-02)
string
(2.61e-02)
unsafe
(1.53e-02)
%UNK%
(1.35e-02)
byte
(1.05e-02)
value
(6.37e-03)
bytes
(6.11e-03)
array
(6.00e-03)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
value
value
get
(2.88e-01)
write
(1.05e-01)
to
(8.47e-02)
check
(4.43e-02)
load
(4.02e-02)
%UNK%
(3.70e-02)
read
(3.63e-02)
new
(3.12e-02)
print
(2.61e-02)
out
(2.30e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'L'
)
;
out
.
write
long
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'L'
)
;
out
.
write
long
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(7.98e-01)
to
(5.12e-02)
out
(1.85e-02)
string
(1.32e-02)
unsafe
(8.53e-03)
byte
(5.79e-03)
%UNK%
(5.38e-03)
long
(4.81e-03)
array
(3.87e-03)
bytes
(3.58e-03)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'L'
)
;
out
.
write
long
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'L'
)
;
out
.
write
long
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
value
value
get
(1.78e-01)
write
(1.64e-01)
to
(1.07e-01)
check
(5.41e-02)
%UNK%
(5.40e-02)
out
(3.23e-02)
new
(3.20e-02)
load
(2.90e-02)
read
(2.88e-02)
print
(2.52e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
float
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
float
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(7.41e-01)
to
(6.96e-02)
out
(2.22e-02)
string
(1.99e-02)
%UNK%
(1.14e-02)
unsafe
(1.08e-02)
float
(9.12e-03)
byte
(4.33e-03)
array
(3.82e-03)
buffer
(3.37e-03)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
float
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
float
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
value
value
get
(1.90e-01)
write
(1.51e-01)
to
(9.88e-02)
check
(7.18e-02)
%UNK%
(4.54e-02)
load
(3.49e-02)
new
(3.41e-02)
read
(2.94e-02)
out
(2.65e-02)
print
(2.39e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'D'
)
;
out
.
write
double
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'D'
)
;
out
.
write
double
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.28e-01)
to
(4.33e-02)
string
(1.53e-02)
out
(1.41e-02)
unsafe
(8.53e-03)
%UNK%
(4.90e-03)
byte
(4.36e-03)
double
(3.23e-03)
array
(2.65e-03)
bytes
(2.62e-03)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'D'
)
;
out
.
write
double
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'D'
)
;
out
.
write
double
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
value
value
get
(5.00e-01)
to
(6.53e-02)
%UNK%
(4.68e-02)
write
(4.50e-02)
check
(3.62e-02)
set
(3.01e-02)
load
(1.88e-02)
create
(1.68e-02)
new
(1.67e-02)
out
(1.55e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
%SELF%
?
'T'
:
'F'
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
%SELF%
?
'T'
:
'F'
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(9.41e-01)
to
(7.86e-03)
%UNK%
(5.91e-03)
string
(4.38e-03)
out
(2.87e-03)
unsafe
(1.06e-03)
this
(9.92e-04)
value
(9.33e-04)
at
(7.87e-04)
byte
(6.50e-04)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
%SELF%
?
'T'
:
'F'
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
%SELF%
?
'T'
:
'F'
)
;
return
this
;
}
<SENTENCE_END/>
value
value
write
(1.33e-01)
to
(1.30e-01)
read
(1.25e-01)
get
(1.08e-01)
load
(4.81e-02)
%UNK%
(4.63e-02)
out
(4.32e-02)
print
(3.87e-02)
new
(2.88e-02)
check
(1.99e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
char
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
char
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(6.64e-01)
to
(8.44e-02)
string
(5.08e-02)
out
(2.14e-02)
%UNK%
(1.57e-02)
char
(1.07e-02)
unsafe
(9.78e-03)
bytes
(9.44e-03)
byte
(7.27e-03)
read
(4.81e-03)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
char
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
char
(
%SELF%
)
;
return
this
;
}
<SENTENCE_END/>
value
value
load
(2.81e-01)
read
(1.40e-01)
write
(1.21e-01)
bytes
(1.17e-01)
to
(4.98e-02)
parse
(3.63e-02)
get
(2.34e-02)
out
(2.17e-02)
encode
(1.85e-02)
new
(1.14e-02)
<SENTENCE_START>
{
check
name
(
)
;
byte
[
]
bytes
=
%SELF%
.
get
bytes
(
"UTF-8"
)
;
out
.
write
byte
(
'S'
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
byte
[
]
bytes
=
%SELF%
.
get
bytes
(
"UTF-8"
)
;
out
.
write
byte
(
'S'
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(7.46e-01)
bytes
(8.10e-02)
to
(1.94e-02)
string
(1.90e-02)
byte
(1.64e-02)
write
(9.69e-03)
out
(9.52e-03)
unsafe
(5.93e-03)
read
(4.75e-03)
load
(4.48e-03)
<SENTENCE_START>
{
check
name
(
)
;
byte
[
]
bytes
=
%SELF%
.
get
bytes
(
"UTF-8"
)
;
out
.
write
byte
(
'S'
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
byte
[
]
bytes
=
%SELF%
.
get
bytes
(
"UTF-8"
)
;
out
.
write
byte
(
'S'
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
return
this
;
}
<SENTENCE_END/>
value
value
add
(1.44e-01)
pop
(1.36e-01)
%UNK%
(8.13e-02)
to
(7.99e-02)
get
(6.10e-02)
write
(3.36e-02)
remove
(2.55e-02)
close
(1.73e-02)
clear
(1.35e-02)
extend
(1.25e-02)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
byte
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
byte
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.21e-01)
to
(2.82e-02)
all
(1.54e-02)
%UNK%
(1.16e-02)
array
(7.39e-03)
byte
(5.88e-03)
string
(5.51e-03)
out
(4.54e-03)
value
(3.50e-03)
write
(2.41e-03)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
byte
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
byte
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
value
value
add
(1.53e-01)
pop
(1.49e-01)
%UNK%
(7.84e-02)
to
(6.61e-02)
get
(6.21e-02)
remove
(2.93e-02)
write
(2.89e-02)
close
(1.50e-02)
clear
(1.42e-02)
copy
(1.32e-02)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
short
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
short
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.11e-01)
to
(2.50e-02)
all
(1.40e-02)
%UNK%
(1.18e-02)
array
(7.92e-03)
string
(6.04e-03)
out
(4.87e-03)
byte
(4.77e-03)
value
(3.82e-03)
write
(2.73e-03)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
short
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
short
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
value
value
add
(1.44e-01)
pop
(1.33e-01)
%UNK%
(8.21e-02)
to
(7.27e-02)
get
(6.69e-02)
write
(3.01e-02)
remove
(2.65e-02)
close
(1.51e-02)
extend
(1.45e-02)
clear
(1.39e-02)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'l'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
int
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'l'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
int
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(7.63e-01)
to
(3.50e-02)
all
(1.85e-02)
%UNK%
(1.57e-02)
array
(1.02e-02)
string
(7.90e-03)
out
(6.35e-03)
value
(4.97e-03)
byte
(4.88e-03)
int
(3.32e-03)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'l'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
int
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'l'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
int
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
value
value
pop
(1.66e-01)
add
(1.51e-01)
%UNK%
(7.30e-02)
get
(7.07e-02)
to
(6.62e-02)
remove
(2.96e-02)
write
(2.56e-02)
clear
(1.52e-02)
close
(1.45e-02)
copy
(1.18e-02)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
long
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
long
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(7.96e-01)
to
(3.04e-02)
all
(1.55e-02)
%UNK%
(1.27e-02)
array
(8.78e-03)
string
(6.58e-03)
out
(5.24e-03)
byte
(4.49e-03)
value
(4.01e-03)
write
(2.50e-03)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
long
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
long
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
value
value
add
(1.51e-01)
pop
(1.35e-01)
%UNK%
(8.79e-02)
to
(7.50e-02)
get
(6.05e-02)
write
(3.02e-02)
remove
(2.49e-02)
close
(1.55e-02)
clear
(1.34e-02)
copy
(1.25e-02)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
float
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
float
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(7.88e-01)
to
(3.43e-02)
%UNK%
(1.57e-02)
all
(1.48e-02)
array
(8.88e-03)
string
(7.36e-03)
out
(5.54e-03)
byte
(3.92e-03)
value
(3.69e-03)
write
(2.87e-03)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
float
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
float
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
value
value
add
(1.46e-01)
pop
(1.15e-01)
%UNK%
(9.07e-02)
to
(8.30e-02)
get
(6.39e-02)
write
(3.01e-02)
remove
(2.49e-02)
close
(1.43e-02)
clear
(1.37e-02)
copy
(1.31e-02)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
double
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
double
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(8.06e-01)
to
(2.97e-02)
all
(1.37e-02)
%UNK%
(1.28e-02)
array
(8.02e-03)
string
(6.85e-03)
out
(5.05e-03)
byte
(4.09e-03)
value
(3.68e-03)
write
(2.71e-03)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
double
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'd'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
double
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
value
value
pop
(2.76e-01)
get
(1.50e-01)
add
(9.01e-02)
%UNK%
(5.86e-02)
to
(3.25e-02)
remove
(2.92e-02)
size
(1.80e-02)
clear
(1.62e-02)
update
(9.76e-03)
find
(8.90e-03)
<SENTENCE_START>
{
array
(
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
byte
(
values
[
i
]
?
'T'
:
'F'
)
;
}
pop
(
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
byte
(
values
[
i
]
?
'T'
:
'F'
)
;
}
pop
(
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(9.26e-01)
all
(6.81e-03)
%UNK%
(3.40e-03)
byte
(3.36e-03)
of
(2.63e-03)
array
(2.38e-03)
to
(2.09e-03)
value
(1.83e-03)
string
(1.58e-03)
this
(1.34e-03)
<SENTENCE_START>
{
array
(
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
byte
(
values
[
i
]
?
'T'
:
'F'
)
;
}
pop
(
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
byte
(
values
[
i
]
?
'T'
:
'F'
)
;
}
pop
(
)
;
return
this
;
}
<SENTENCE_END/>
value
value
pop
(1.55e-01)
add
(1.01e-01)
%UNK%
(9.19e-02)
to
(8.17e-02)
get
(6.26e-02)
write
(3.34e-02)
remove
(2.62e-02)
close
(1.88e-02)
read
(1.49e-02)
copy
(1.29e-02)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
char
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
char
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(7.77e-01)
to
(3.66e-02)
%UNK%
(1.72e-02)
all
(1.28e-02)
string
(9.95e-03)
array
(7.98e-03)
out
(5.90e-03)
byte
(4.85e-03)
value
(4.29e-03)
write
(2.93e-03)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
char
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'I'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
out
.
write
char
(
values
[
i
]
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
value
value
load
(1.65e-01)
write
(1.38e-01)
to
(1.10e-01)
read
(9.36e-02)
get
(4.16e-02)
bytes
(4.04e-02)
parse
(3.65e-02)
out
(2.96e-02)
%UNK%
(2.39e-02)
encode
(1.54e-02)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'S'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
byte
[
]
bytes
=
values
[
i
]
.
get
bytes
(
"UTF-8"
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'S'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
byte
[
]
bytes
=
values
[
i
]
.
get
bytes
(
"UTF-8"
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(7.66e-01)
bytes
(3.23e-02)
to
(2.66e-02)
string
(1.51e-02)
byte
(1.24e-02)
out
(9.89e-03)
write
(9.11e-03)
%UNK%
(5.56e-03)
read
(3.40e-03)
value
(3.34e-03)
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'S'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
byte
[
]
bytes
=
values
[
i
]
.
get
bytes
(
"UTF-8"
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
(
)
;
out
.
write
byte
(
'$'
)
;
out
.
write
byte
(
'S'
)
;
out
.
write
byte
(
'#'
)
;
%SELF%
(
values
.
length
)
;
for
(
int
i
=
0
,
n
=
values
.
length
;
i
<
n
;
i
++
)
{
byte
[
]
bytes
=
values
[
i
]
.
get
bytes
(
"UTF-8"
)
;
if
(
bytes
.
length
<=
byte
.
max
value
)
{
out
.
write
byte
(
'i'
)
;
out
.
write
byte
(
bytes
.
length
)
;
}
else
if
(
bytes
.
length
<=
short
.
max
value
)
{
out
.
write
byte
(
'I'
)
;
out
.
write
short
(
bytes
.
length
)
;
}
else
{
out
.
write
byte
(
'l'
)
;
out
.
write
int
(
bytes
.
length
)
;
}
out
.
write
(
bytes
)
;
}
pop
(
true
)
;
return
this
;
}
<SENTENCE_END/>
value
value
remove
(6.13e-02)
to
(5.57e-02)
end
(3.37e-02)
%UNK%
(3.12e-02)
is
(2.69e-02)
element
(2.57e-02)
child
(2.52e-02)
close
(2.50e-02)
add
(2.32e-02)
%END%
(1.95e-02)
<SENTENCE_START>
{
if
(
%SELF%
.
is
object
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
object
(
%SELF%
.
name
)
;
else
object
(
)
;
for
(
json
value
child
=
%SELF%
.
child
;
child
!=
null
;
child
=
child
.
next
)
%SELF%
(
child
)
;
pop
(
)
;
}
else
if
(
%SELF%
.
is
array
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
array
(
%SELF%
.
name
)
;
else
array
(
)
;
for
(
json
value
child
=
%SELF%
.
child
;
child
!=
null
;
child
=
child
.
next
)
%SELF%
(
child
)
;
pop
(
)
;
}
else
if
(
%SELF%
.
is
boolean
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
boolean
(
)
)
;
}
else
if
(
%SELF%
.
is
double
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
double
(
)
)
;
}
else
if
(
%SELF%
.
is
long
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
long
(
)
)
;
}
else
if
(
%SELF%
.
is
string
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
string
(
)
)
;
}
else
if
(
%SELF%
.
is
null
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
)
;
}
else
{
throw
new
io
exception
(
"Unhandled JsonValue type"
)
;
}
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
%SELF%
.
is
object
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
object
(
%SELF%
.
name
)
;
else
object
(
)
;
for
(
json
value
child
=
%SELF%
.
child
;
child
!=
null
;
child
=
child
.
next
)
%SELF%
(
child
)
;
pop
(
)
;
}
else
if
(
%SELF%
.
is
array
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
array
(
%SELF%
.
name
)
;
else
array
(
)
;
for
(
json
value
child
=
%SELF%
.
child
;
child
!=
null
;
child
=
child
.
next
)
%SELF%
(
child
)
;
pop
(
)
;
}
else
if
(
%SELF%
.
is
boolean
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
boolean
(
)
)
;
}
else
if
(
%SELF%
.
is
double
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
double
(
)
)
;
}
else
if
(
%SELF%
.
is
long
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
long
(
)
)
;
}
else
if
(
%SELF%
.
is
string
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
string
(
)
)
;
}
else
if
(
%SELF%
.
is
null
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
)
;
}
else
{
throw
new
io
exception
(
"Unhandled JsonValue type"
)
;
}
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(6.56e-01)
to
(1.74e-02)
string
(1.70e-02)
child
(1.33e-02)
element
(1.19e-02)
name
(1.18e-02)
%UNK%
(8.98e-03)
all
(8.17e-03)
by
(7.97e-03)
value
(5.35e-03)
<SENTENCE_START>
{
if
(
%SELF%
.
is
object
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
object
(
%SELF%
.
name
)
;
else
object
(
)
;
for
(
json
value
child
=
%SELF%
.
child
;
child
!=
null
;
child
=
child
.
next
)
%SELF%
(
child
)
;
pop
(
)
;
}
else
if
(
%SELF%
.
is
array
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
array
(
%SELF%
.
name
)
;
else
array
(
)
;
for
(
json
value
child
=
%SELF%
.
child
;
child
!=
null
;
child
=
child
.
next
)
%SELF%
(
child
)
;
pop
(
)
;
}
else
if
(
%SELF%
.
is
boolean
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
boolean
(
)
)
;
}
else
if
(
%SELF%
.
is
double
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
double
(
)
)
;
}
else
if
(
%SELF%
.
is
long
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
long
(
)
)
;
}
else
if
(
%SELF%
.
is
string
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
string
(
)
)
;
}
else
if
(
%SELF%
.
is
null
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
)
;
}
else
{
throw
new
io
exception
(
"Unhandled JsonValue type"
)
;
}
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
%SELF%
.
is
object
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
object
(
%SELF%
.
name
)
;
else
object
(
)
;
for
(
json
value
child
=
%SELF%
.
child
;
child
!=
null
;
child
=
child
.
next
)
%SELF%
(
child
)
;
pop
(
)
;
}
else
if
(
%SELF%
.
is
array
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
array
(
%SELF%
.
name
)
;
else
array
(
)
;
for
(
json
value
child
=
%SELF%
.
child
;
child
!=
null
;
child
=
child
.
next
)
%SELF%
(
child
)
;
pop
(
)
;
}
else
if
(
%SELF%
.
is
boolean
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
boolean
(
)
)
;
}
else
if
(
%SELF%
.
is
double
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
double
(
)
)
;
}
else
if
(
%SELF%
.
is
long
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
long
(
)
)
;
}
else
if
(
%SELF%
.
is
string
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
%SELF%
.
as
string
(
)
)
;
}
else
if
(
%SELF%
.
is
null
(
)
)
{
if
(
%SELF%
.
name
!=
null
)
name
(
%SELF%
.
name
)
;
%SELF%
(
)
;
}
else
{
throw
new
io
exception
(
"Unhandled JsonValue type"
)
;
}
return
this
;
}
<SENTENCE_END/>
value
value
get
(1.24e-01)
read
(1.03e-01)
value
(6.30e-02)
to
(5.46e-02)
state
(4.85e-02)
append
(4.72e-02)
is
(3.14e-02)
object
(2.41e-02)
%UNK%
(2.32e-02)
number
(2.23e-02)
<SENTENCE_START>
{
if
(
object
==
null
)
{
return
%SELF%
(
)
;
}
else
if
(
object
instanceof
number
)
{
number
number
=
(
number
)
object
;
if
(
object
instanceof
byte
)
return
%SELF%
(
number
.
byte
value
(
)
)
;
if
(
object
instanceof
short
)
return
%SELF%
(
number
.
short
value
(
)
)
;
if
(
object
instanceof
integer
)
return
%SELF%
(
number
.
int
value
(
)
)
;
if
(
object
instanceof
long
)
return
%SELF%
(
number
.
long
value
(
)
)
;
if
(
object
instanceof
float
)
return
%SELF%
(
number
.
float
value
(
)
)
;
if
(
object
instanceof
double
)
return
%SELF%
(
number
.
double
value
(
)
)
;
}
else
if
(
object
instanceof
character
)
{
return
%SELF%
(
(
(
character
)
object
)
.
char
value
(
)
)
;
}
else
if
(
object
instanceof
char
sequence
)
{
return
%SELF%
(
object
.
to
string
(
)
)
;
}
else
throw
new
io
exception
(
"Unknown object type."
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
object
==
null
)
{
return
%SELF%
(
)
;
}
else
if
(
object
instanceof
number
)
{
number
number
=
(
number
)
object
;
if
(
object
instanceof
byte
)
return
%SELF%
(
number
.
byte
value
(
)
)
;
if
(
object
instanceof
short
)
return
%SELF%
(
number
.
short
value
(
)
)
;
if
(
object
instanceof
integer
)
return
%SELF%
(
number
.
int
value
(
)
)
;
if
(
object
instanceof
long
)
return
%SELF%
(
number
.
long
value
(
)
)
;
if
(
object
instanceof
float
)
return
%SELF%
(
number
.
float
value
(
)
)
;
if
(
object
instanceof
double
)
return
%SELF%
(
number
.
double
value
(
)
)
;
}
else
if
(
object
instanceof
character
)
{
return
%SELF%
(
(
(
character
)
object
)
.
char
value
(
)
)
;
}
else
if
(
object
instanceof
char
sequence
)
{
return
%SELF%
(
object
.
to
string
(
)
)
;
}
else
throw
new
io
exception
(
"Unknown object type."
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(2.90e-01)
value
(1.21e-01)
object
(8.59e-02)
string
(5.53e-02)
number
(2.31e-02)
to
(2.17e-02)
changed
(1.37e-02)
%UNK%
(1.26e-02)
int
(1.21e-02)
instanceof
(1.10e-02)
<SENTENCE_START>
{
if
(
object
==
null
)
{
return
%SELF%
(
)
;
}
else
if
(
object
instanceof
number
)
{
number
number
=
(
number
)
object
;
if
(
object
instanceof
byte
)
return
%SELF%
(
number
.
byte
value
(
)
)
;
if
(
object
instanceof
short
)
return
%SELF%
(
number
.
short
value
(
)
)
;
if
(
object
instanceof
integer
)
return
%SELF%
(
number
.
int
value
(
)
)
;
if
(
object
instanceof
long
)
return
%SELF%
(
number
.
long
value
(
)
)
;
if
(
object
instanceof
float
)
return
%SELF%
(
number
.
float
value
(
)
)
;
if
(
object
instanceof
double
)
return
%SELF%
(
number
.
double
value
(
)
)
;
}
else
if
(
object
instanceof
character
)
{
return
%SELF%
(
(
(
character
)
object
)
.
char
value
(
)
)
;
}
else
if
(
object
instanceof
char
sequence
)
{
return
%SELF%
(
object
.
to
string
(
)
)
;
}
else
throw
new
io
exception
(
"Unknown object type."
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
object
==
null
)
{
return
%SELF%
(
)
;
}
else
if
(
object
instanceof
number
)
{
number
number
=
(
number
)
object
;
if
(
object
instanceof
byte
)
return
%SELF%
(
number
.
byte
value
(
)
)
;
if
(
object
instanceof
short
)
return
%SELF%
(
number
.
short
value
(
)
)
;
if
(
object
instanceof
integer
)
return
%SELF%
(
number
.
int
value
(
)
)
;
if
(
object
instanceof
long
)
return
%SELF%
(
number
.
long
value
(
)
)
;
if
(
object
instanceof
float
)
return
%SELF%
(
number
.
float
value
(
)
)
;
if
(
object
instanceof
double
)
return
%SELF%
(
number
.
double
value
(
)
)
;
}
else
if
(
object
instanceof
character
)
{
return
%SELF%
(
(
(
character
)
object
)
.
char
value
(
)
)
;
}
else
if
(
object
instanceof
char
sequence
)
{
return
%SELF%
(
object
.
to
string
(
)
)
;
}
else
throw
new
io
exception
(
"Unknown object type."
)
;
return
this
;
}
<SENTENCE_END/>
value
value
check
(3.87e-01)
get
(1.94e-01)
write
(5.33e-02)
create
(3.36e-02)
%UNK%
(3.16e-02)
set
(2.58e-02)
new
(2.45e-02)
to
(2.27e-02)
load
(1.43e-02)
add
(1.33e-02)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'Z'
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'Z'
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(9.07e-01)
to
(1.85e-02)
byte
(6.72e-03)
string
(4.87e-03)
%UNK%
(4.35e-03)
out
(3.47e-03)
unsafe
(3.10e-03)
value
(2.38e-03)
array
(2.09e-03)
bytes
(1.77e-03)
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'Z'
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
check
name
(
)
;
out
.
write
byte
(
'Z'
)
;
return
this
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(5.79e-01)
name
(1.97e-01)
attribute
(5.41e-02)
value
(1.95e-02)
load
(1.43e-02)
invoke
(1.08e-02)
element
(9.85e-03)
number
(7.71e-03)
state
(6.68e-03)
compare
(6.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.39e-01)
value
(8.54e-02)
name
(2.67e-02)
attribute
(1.99e-02)
object
(2.39e-03)
changed
(2.15e-03)
string
(1.79e-03)
header
(1.02e-03)
status
(9.64e-04)
element
(9.39e-04)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
value
)
;
}
<SENTENCE_END/>
set
set
get
(4.24e-01)
name
(4.22e-01)
attribute
(4.68e-02)
element
(9.96e-03)
invoke
(9.89e-03)
value
(5.61e-03)
load
(5.35e-03)
compare
(4.78e-03)
number
(4.16e-03)
to
(3.46e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.95e-01)
name
(9.72e-02)
value
(3.09e-02)
attribute
(2.67e-02)
string
(3.28e-03)
element
(2.80e-03)
object
(2.08e-03)
changed
(2.02e-03)
file
(1.76e-03)
actor
(1.42e-03)
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
name
(
name
)
.
value
(
)
;
}
<SENTENCE_END/>
check,name
check
check
(2.63e-01)
%UNK%
(5.87e-02)
remove
(5.05e-02)
set
(2.92e-02)
update
(2.86e-02)
action
(2.58e-02)
start
(2.30e-02)
stop
(2.28e-02)
dispose
(2.26e-02)
state
(2.13e-02)
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
}
<SENTENCE_END/>
name
%END%
(9.31e-01)
current
(1.54e-02)
%UNK%
(3.32e-03)
named
(1.87e-03)
value
(1.37e-03)
file
(1.31e-03)
and
(1.09e-03)
if
(1.02e-03)
directory
(9.30e-04)
actor
(8.70e-04)
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
}
<SENTENCE_END/>
%END%
%END%
(9.84e-01)
current
(2.18e-03)
named
(1.73e-03)
if
(5.60e-04)
illegal
(3.66e-04)
exception
(2.97e-04)
value
(2.87e-04)
and
(2.77e-04)
state
(2.47e-04)
at
(2.23e-04)
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
current
!=
null
)
{
if
(
!
current
.
array
)
{
if
(
!
named
)
throw
new
illegal
state
exception
(
"Name must be set."
)
;
named
=
false
;
}
}
}
<SENTENCE_END/>
pop
pop
is
(3.20e-01)
read
(1.15e-01)
mark
(7.60e-02)
hide
(3.28e-02)
needs
(3.08e-02)
has
(3.07e-02)
scrolled
(2.79e-02)
close
(2.30e-02)
protected
(1.82e-02)
can
(1.79e-02)
<SENTENCE_START>
{
return
%SELF%
(
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(2.72e-01)
array
(4.83e-02)
%UNK%
(3.71e-02)
typed
(2.36e-02)
gl
(2.12e-02)
up
(2.06e-02)
only
(1.93e-02)
20
(1.66e-02)
down
(1.58e-02)
layout
(1.54e-02)
<SENTENCE_START>
{
return
%SELF%
(
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
false
)
;
}
<SENTENCE_END/>
pop
pop
close
(1.55e-01)
pop
(6.88e-02)
sort
(6.49e-02)
first
(5.62e-02)
state
(5.38e-02)
remove
(4.76e-02)
size
(3.02e-02)
delete
(2.39e-02)
insert
(2.09e-02)
space
(1.87e-02)
<SENTENCE_START>
{
if
(
named
)
throw
new
illegal
state
exception
(
"Expected an object, array, or value since a name was set."
)
;
if
(
silent
)
stack
.
%SELF%
(
)
;
else
stack
.
%SELF%
(
)
.
close
(
)
;
current
=
stack
.
size
==
0
?
null
:
stack
.
peek
(
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
named
)
throw
new
illegal
state
exception
(
"Expected an object, array, or value since a name was set."
)
;
if
(
silent
)
stack
.
%SELF%
(
)
;
else
stack
.
%SELF%
(
)
.
close
(
)
;
current
=
stack
.
size
==
0
?
null
:
stack
.
peek
(
)
;
return
this
;
}
<SENTENCE_END/>
%END%
%END%
(9.14e-01)
%UNK%
(3.91e-03)
at
(3.56e-03)
close
(2.82e-03)
size
(2.33e-03)
value
(2.12e-03)
stack
(1.81e-03)
string
(1.63e-03)
this
(1.13e-03)
to
(1.12e-03)
<SENTENCE_START>
{
if
(
named
)
throw
new
illegal
state
exception
(
"Expected an object, array, or value since a name was set."
)
;
if
(
silent
)
stack
.
%SELF%
(
)
;
else
stack
.
%SELF%
(
)
.
close
(
)
;
current
=
stack
.
size
==
0
?
null
:
stack
.
peek
(
)
;
return
this
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
named
)
throw
new
illegal
state
exception
(
"Expected an object, array, or value since a name was set."
)
;
if
(
silent
)
stack
.
%SELF%
(
)
;
else
stack
.
%SELF%
(
)
.
close
(
)
;
current
=
stack
.
size
==
0
?
null
:
stack
.
peek
(
)
;
return
this
;
}
<SENTENCE_END/>
flush
flush
out
(4.40e-01)
to
(1.19e-01)
extend
(7.67e-02)
get
(2.83e-02)
%UNK%
(2.76e-02)
calculate
(2.61e-02)
result
(2.17e-02)
abs
(2.03e-02)
flush
(2.02e-02)
close
(1.75e-02)
<SENTENCE_START>
{
out
.
%SELF%
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
out
.
%SELF%
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(4.78e-01)
to
(7.22e-02)
out
(6.33e-02)
%UNK%
(2.99e-02)
unsafe
(1.83e-02)
string
(1.68e-02)
box
(8.50e-03)
array
(6.29e-03)
at
(6.11e-03)
value
(6.04e-03)
<SENTENCE_START>
{
out
.
%SELF%
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
out
.
%SELF%
(
)
;
}
<SENTENCE_END/>
close
close
close
(2.90e-01)
sort
(1.30e-01)
to
(1.23e-01)
pop
(6.14e-02)
abs
(3.12e-02)
contains
(1.99e-02)
insert
(1.35e-02)
size
(1.32e-02)
%UNK%
(9.48e-03)
shrink
(9.14e-03)
<SENTENCE_START>
{
while
(
stack
.
size
>
0
)
pop
(
)
;
out
.
%SELF%
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
.
size
>
0
)
pop
(
)
;
out
.
%SELF%
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(4.77e-01)
to
(1.31e-01)
close
(3.23e-02)
string
(2.22e-02)
all
(2.12e-02)
out
(1.91e-02)
%UNK%
(1.70e-02)
0
(1.26e-02)
size
(9.11e-03)
array
(6.83e-03)
<SENTENCE_START>
{
while
(
stack
.
size
>
0
)
pop
(
)
;
out
.
%SELF%
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
while
(
stack
.
size
>
0
)
pop
(
)
;
out
.
%SELF%
(
)
;
}
<SENTENCE_END/>
close
close
out
(3.97e-01)
to
(2.94e-01)
get
(1.52e-01)
write
(1.48e-02)
extend
(1.43e-02)
load
(1.18e-02)
wrap
(1.12e-02)
send
(1.10e-02)
print
(9.50e-03)
%UNK%
(7.33e-03)
<SENTENCE_START>
{
out
.
write
byte
(
array
?
']'
:
'}'
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
out
.
write
byte
(
array
?
']'
:
'}'
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.52e-01)
to
(9.41e-03)
byte
(5.64e-03)
array
(3.88e-03)
out
(2.09e-03)
all
(1.93e-03)
unsafe
(1.37e-03)
string
(1.31e-03)
bytes
(7.78e-04)
buffer
(5.84e-04)
<SENTENCE_START>
{
out
.
write
byte
(
array
?
']'
:
'}'
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
out
.
write
byte
(
array
?
']'
:
'}'
)
;
}
<SENTENCE_END/>
create,config
create
create
(4.09e-01)
initialize
(3.39e-01)
run
(6.72e-02)
main
(5.63e-02)
%UNK%
(1.24e-02)
setup
(1.04e-02)
set
(8.53e-03)
notify
(7.52e-03)
ui
(5.16e-03)
config
(4.74e-03)
<SENTENCE_START>
{
lwjgl
application
configuration
config
=
new
lwjgl
application
configuration
(
)
;
config
.
title
=
title
;
config
.
width
=
width
;
config
.
height
=
height
;
config
.
v
sync
enabled
=
true
;
return
config
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
lwjgl
application
configuration
config
=
new
lwjgl
application
configuration
(
)
;
config
.
title
=
title
;
config
.
width
=
width
;
config
.
height
=
height
;
config
.
v
sync
enabled
=
true
;
return
config
;
}
<SENTENCE_END/>
config
%END%
(4.61e-01)
%UNK%
(6.37e-02)
create
(4.73e-02)
title
(4.09e-02)
initialize
(3.65e-02)
config
(2.39e-02)
run
(1.75e-02)
notify
(1.41e-02)
main
(1.20e-02)
finish
(1.01e-02)
<SENTENCE_START>
{
lwjgl
application
configuration
config
=
new
lwjgl
application
configuration
(
)
;
config
.
title
=
title
;
config
.
width
=
width
;
config
.
height
=
height
;
config
.
v
sync
enabled
=
true
;
return
config
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
lwjgl
application
configuration
config
=
new
lwjgl
application
configuration
(
)
;
config
.
title
=
title
;
config
.
width
=
width
;
config
.
height
=
height
;
config
.
v
sync
enabled
=
true
;
return
config
;
}
<SENTENCE_END/>
%END%
%END%
(8.49e-01)
%UNK%
(1.77e-02)
config
(9.29e-03)
enabled
(7.57e-03)
title
(5.10e-03)
notify
(4.23e-03)
create
(3.96e-03)
width
(3.85e-03)
sync
(3.06e-03)
initialize
(2.75e-03)
<SENTENCE_START>
{
lwjgl
application
configuration
config
=
new
lwjgl
application
configuration
(
)
;
config
.
title
=
title
;
config
.
width
=
width
;
config
.
height
=
height
;
config
.
v
sync
enabled
=
true
;
return
config
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
lwjgl
application
configuration
config
=
new
lwjgl
application
configuration
(
)
;
config
.
title
=
title
;
config
.
width
=
width
;
config
.
height
=
height
;
config
.
v
sync
enabled
=
true
;
return
config
;
}
<SENTENCE_END/>
initialize
initialize
run
(5.53e-01)
main
(1.44e-01)
create
(5.88e-02)
%UNK%
(2.33e-02)
initialize
(2.09e-02)
setup
(1.77e-02)
set
(1.49e-02)
on
(1.48e-02)
window
(1.38e-02)
init
(1.27e-02)
<SENTENCE_START>
{
main
loop
thread
=
new
thread
(
"LWJGL Application"
)
{
@
override
public
void
run
(
)
{
graphics
.
set
v
sync
(
graphics
.
config
.
v
sync
enabled
)
;
try
{
lwjgl
application
.
this
.
main
loop
(
)
;
}
catch
(
throwable
t
)
{
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
gdx
.
input
.
set
cursor
catched
(
false
)
;
if
(
t
instanceof
runtime
exception
)
throw
(
runtime
exception
)
t
;
else
throw
new
gdx
runtime
exception
(
t
)
;
}
}
}
;
main
loop
thread
.
start
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
main
loop
thread
=
new
thread
(
"LWJGL Application"
)
{
@
override
public
void
run
(
)
{
graphics
.
set
v
sync
(
graphics
.
config
.
v
sync
enabled
)
;
try
{
lwjgl
application
.
this
.
main
loop
(
)
;
}
catch
(
throwable
t
)
{
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
gdx
.
input
.
set
cursor
catched
(
false
)
;
if
(
t
instanceof
runtime
exception
)
throw
(
runtime
exception
)
t
;
else
throw
new
gdx
runtime
exception
(
t
)
;
}
}
}
;
main
loop
thread
.
start
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(4.06e-01)
%UNK%
(7.95e-02)
run
(6.03e-02)
main
(5.15e-02)
cursor
(2.06e-02)
loop
(1.40e-02)
create
(1.29e-02)
test
(1.20e-02)
window
(8.98e-03)
start
(8.41e-03)
<SENTENCE_START>
{
main
loop
thread
=
new
thread
(
"LWJGL Application"
)
{
@
override
public
void
run
(
)
{
graphics
.
set
v
sync
(
graphics
.
config
.
v
sync
enabled
)
;
try
{
lwjgl
application
.
this
.
main
loop
(
)
;
}
catch
(
throwable
t
)
{
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
gdx
.
input
.
set
cursor
catched
(
false
)
;
if
(
t
instanceof
runtime
exception
)
throw
(
runtime
exception
)
t
;
else
throw
new
gdx
runtime
exception
(
t
)
;
}
}
}
;
main
loop
thread
.
start
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
main
loop
thread
=
new
thread
(
"LWJGL Application"
)
{
@
override
public
void
run
(
)
{
graphics
.
set
v
sync
(
graphics
.
config
.
v
sync
enabled
)
;
try
{
lwjgl
application
.
this
.
main
loop
(
)
;
}
catch
(
throwable
t
)
{
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
gdx
.
input
.
set
cursor
catched
(
false
)
;
if
(
t
instanceof
runtime
exception
)
throw
(
runtime
exception
)
t
;
else
throw
new
gdx
runtime
exception
(
t
)
;
}
}
}
;
main
loop
thread
.
start
(
)
;
}
<SENTENCE_END/>
main,loop
main
%UNK%
(1.16e-01)
render
(6.71e-02)
run
(6.67e-02)
%END%
(5.94e-02)
end
(4.76e-02)
update
(3.02e-02)
setup
(2.56e-02)
window
(2.51e-02)
initialize
(2.34e-02)
set
(2.20e-02)
<SENTENCE_START>
{
array
<
lifecycle
listener
>
lifecycle
listeners
=
this
.
lifecycle
listeners
;
try
{
graphics
.
setup
display
(
)
;
}
catch
(
lwjgl
exception
e
)
{
throw
new
gdx
runtime
exception
(
e
)
;
}
listener
.
create
(
)
;
graphics
.
resize
=
true
;
int
last
width
=
graphics
.
get
width
(
)
;
int
last
height
=
graphics
.
get
height
(
)
;
graphics
.
last
time
=
system
.
nano
time
(
)
;
boolean
was
active
=
true
;
while
(
running
)
{
display
.
process
messages
(
)
;
if
(
display
.
is
close
requested
(
)
)
exit
(
)
;
boolean
is
active
=
display
.
is
active
(
)
;
if
(
was
active
&&
!
is
active
)
{
was
active
=
false
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
pause
(
)
;
}
listener
.
pause
(
)
;
}
if
(
!
was
active
&&
is
active
)
{
was
active
=
true
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
resume
(
)
;
}
listener
.
resume
(
)
;
}
boolean
should
render
=
false
;
if
(
graphics
.
canvas
!=
null
)
{
int
width
=
graphics
.
canvas
.
get
width
(
)
;
int
height
=
graphics
.
canvas
.
get
height
(
)
;
if
(
last
width
!=
width
||
last
height
!=
height
)
{
last
width
=
width
;
last
height
=
height
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
last
width
,
last
height
)
;
listener
.
resize
(
last
width
,
last
height
)
;
should
render
=
true
;
}
}
else
{
graphics
.
config
.
x
=
display
.
get
x
(
)
;
graphics
.
config
.
y
=
display
.
get
y
(
)
;
if
(
graphics
.
resize
||
display
.
was
resized
(
)
||
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
width
||
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
height
)
{
graphics
.
resize
=
false
;
graphics
.
config
.
width
=
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
graphics
.
config
.
height
=
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
if
(
listener
!=
null
)
listener
.
resize
(
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
graphics
.
request
rendering
(
)
;
}
}
if
(
execute
runnables
(
)
)
should
render
=
true
;
if
(
!
running
)
break
;
input
.
update
(
)
;
should
render
|=
graphics
.
should
render
(
)
;
input
.
process
events
(
)
;
if
(
audio
!=
null
)
audio
.
update
(
)
;
if
(
!
is
active
&&
graphics
.
config
.
background
fps
==
-
1
)
should
render
=
false
;
int
frame
rate
=
is
active
?
graphics
.
config
.
foreground
fps
:
graphics
.
config
.
background
fps
;
if
(
should
render
)
{
graphics
.
update
time
(
)
;
graphics
.
frame
id
++
;
listener
.
render
(
)
;
display
.
update
(
false
)
;
}
else
{
if
(
frame
rate
==
-
1
)
frame
rate
=
10
;
if
(
frame
rate
==
0
)
frame
rate
=
graphics
.
config
.
background
fps
;
if
(
frame
rate
==
0
)
frame
rate
=
30
;
}
if
(
frame
rate
>
0
)
display
.
sync
(
frame
rate
)
;
}
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
{
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
}
}
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
display
.
destroy
(
)
;
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
if
(
graphics
.
config
.
force
exit
)
system
.
exit
(
-
1
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
<
lifecycle
listener
>
lifecycle
listeners
=
this
.
lifecycle
listeners
;
try
{
graphics
.
setup
display
(
)
;
}
catch
(
lwjgl
exception
e
)
{
throw
new
gdx
runtime
exception
(
e
)
;
}
listener
.
create
(
)
;
graphics
.
resize
=
true
;
int
last
width
=
graphics
.
get
width
(
)
;
int
last
height
=
graphics
.
get
height
(
)
;
graphics
.
last
time
=
system
.
nano
time
(
)
;
boolean
was
active
=
true
;
while
(
running
)
{
display
.
process
messages
(
)
;
if
(
display
.
is
close
requested
(
)
)
exit
(
)
;
boolean
is
active
=
display
.
is
active
(
)
;
if
(
was
active
&&
!
is
active
)
{
was
active
=
false
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
pause
(
)
;
}
listener
.
pause
(
)
;
}
if
(
!
was
active
&&
is
active
)
{
was
active
=
true
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
resume
(
)
;
}
listener
.
resume
(
)
;
}
boolean
should
render
=
false
;
if
(
graphics
.
canvas
!=
null
)
{
int
width
=
graphics
.
canvas
.
get
width
(
)
;
int
height
=
graphics
.
canvas
.
get
height
(
)
;
if
(
last
width
!=
width
||
last
height
!=
height
)
{
last
width
=
width
;
last
height
=
height
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
last
width
,
last
height
)
;
listener
.
resize
(
last
width
,
last
height
)
;
should
render
=
true
;
}
}
else
{
graphics
.
config
.
x
=
display
.
get
x
(
)
;
graphics
.
config
.
y
=
display
.
get
y
(
)
;
if
(
graphics
.
resize
||
display
.
was
resized
(
)
||
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
width
||
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
height
)
{
graphics
.
resize
=
false
;
graphics
.
config
.
width
=
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
graphics
.
config
.
height
=
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
if
(
listener
!=
null
)
listener
.
resize
(
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
graphics
.
request
rendering
(
)
;
}
}
if
(
execute
runnables
(
)
)
should
render
=
true
;
if
(
!
running
)
break
;
input
.
update
(
)
;
should
render
|=
graphics
.
should
render
(
)
;
input
.
process
events
(
)
;
if
(
audio
!=
null
)
audio
.
update
(
)
;
if
(
!
is
active
&&
graphics
.
config
.
background
fps
==
-
1
)
should
render
=
false
;
int
frame
rate
=
is
active
?
graphics
.
config
.
foreground
fps
:
graphics
.
config
.
background
fps
;
if
(
should
render
)
{
graphics
.
update
time
(
)
;
graphics
.
frame
id
++
;
listener
.
render
(
)
;
display
.
update
(
false
)
;
}
else
{
if
(
frame
rate
==
-
1
)
frame
rate
=
10
;
if
(
frame
rate
==
0
)
frame
rate
=
graphics
.
config
.
background
fps
;
if
(
frame
rate
==
0
)
frame
rate
=
30
;
}
if
(
frame
rate
>
0
)
display
.
sync
(
frame
rate
)
;
}
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
{
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
}
}
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
display
.
destroy
(
)
;
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
if
(
graphics
.
config
.
force
exit
)
system
.
exit
(
-
1
)
;
}
<SENTENCE_END/>
loop
%END%
(5.85e-01)
%UNK%
(5.20e-02)
render
(1.48e-02)
end
(1.14e-02)
run
(1.09e-02)
update
(8.22e-03)
down
(8.17e-03)
changed
(7.36e-03)
window
(5.90e-03)
frame
(5.46e-03)
<SENTENCE_START>
{
array
<
lifecycle
listener
>
lifecycle
listeners
=
this
.
lifecycle
listeners
;
try
{
graphics
.
setup
display
(
)
;
}
catch
(
lwjgl
exception
e
)
{
throw
new
gdx
runtime
exception
(
e
)
;
}
listener
.
create
(
)
;
graphics
.
resize
=
true
;
int
last
width
=
graphics
.
get
width
(
)
;
int
last
height
=
graphics
.
get
height
(
)
;
graphics
.
last
time
=
system
.
nano
time
(
)
;
boolean
was
active
=
true
;
while
(
running
)
{
display
.
process
messages
(
)
;
if
(
display
.
is
close
requested
(
)
)
exit
(
)
;
boolean
is
active
=
display
.
is
active
(
)
;
if
(
was
active
&&
!
is
active
)
{
was
active
=
false
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
pause
(
)
;
}
listener
.
pause
(
)
;
}
if
(
!
was
active
&&
is
active
)
{
was
active
=
true
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
resume
(
)
;
}
listener
.
resume
(
)
;
}
boolean
should
render
=
false
;
if
(
graphics
.
canvas
!=
null
)
{
int
width
=
graphics
.
canvas
.
get
width
(
)
;
int
height
=
graphics
.
canvas
.
get
height
(
)
;
if
(
last
width
!=
width
||
last
height
!=
height
)
{
last
width
=
width
;
last
height
=
height
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
last
width
,
last
height
)
;
listener
.
resize
(
last
width
,
last
height
)
;
should
render
=
true
;
}
}
else
{
graphics
.
config
.
x
=
display
.
get
x
(
)
;
graphics
.
config
.
y
=
display
.
get
y
(
)
;
if
(
graphics
.
resize
||
display
.
was
resized
(
)
||
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
width
||
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
height
)
{
graphics
.
resize
=
false
;
graphics
.
config
.
width
=
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
graphics
.
config
.
height
=
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
if
(
listener
!=
null
)
listener
.
resize
(
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
graphics
.
request
rendering
(
)
;
}
}
if
(
execute
runnables
(
)
)
should
render
=
true
;
if
(
!
running
)
break
;
input
.
update
(
)
;
should
render
|=
graphics
.
should
render
(
)
;
input
.
process
events
(
)
;
if
(
audio
!=
null
)
audio
.
update
(
)
;
if
(
!
is
active
&&
graphics
.
config
.
background
fps
==
-
1
)
should
render
=
false
;
int
frame
rate
=
is
active
?
graphics
.
config
.
foreground
fps
:
graphics
.
config
.
background
fps
;
if
(
should
render
)
{
graphics
.
update
time
(
)
;
graphics
.
frame
id
++
;
listener
.
render
(
)
;
display
.
update
(
false
)
;
}
else
{
if
(
frame
rate
==
-
1
)
frame
rate
=
10
;
if
(
frame
rate
==
0
)
frame
rate
=
graphics
.
config
.
background
fps
;
if
(
frame
rate
==
0
)
frame
rate
=
30
;
}
if
(
frame
rate
>
0
)
display
.
sync
(
frame
rate
)
;
}
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
{
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
}
}
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
display
.
destroy
(
)
;
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
if
(
graphics
.
config
.
force
exit
)
system
.
exit
(
-
1
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
<
lifecycle
listener
>
lifecycle
listeners
=
this
.
lifecycle
listeners
;
try
{
graphics
.
setup
display
(
)
;
}
catch
(
lwjgl
exception
e
)
{
throw
new
gdx
runtime
exception
(
e
)
;
}
listener
.
create
(
)
;
graphics
.
resize
=
true
;
int
last
width
=
graphics
.
get
width
(
)
;
int
last
height
=
graphics
.
get
height
(
)
;
graphics
.
last
time
=
system
.
nano
time
(
)
;
boolean
was
active
=
true
;
while
(
running
)
{
display
.
process
messages
(
)
;
if
(
display
.
is
close
requested
(
)
)
exit
(
)
;
boolean
is
active
=
display
.
is
active
(
)
;
if
(
was
active
&&
!
is
active
)
{
was
active
=
false
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
pause
(
)
;
}
listener
.
pause
(
)
;
}
if
(
!
was
active
&&
is
active
)
{
was
active
=
true
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
resume
(
)
;
}
listener
.
resume
(
)
;
}
boolean
should
render
=
false
;
if
(
graphics
.
canvas
!=
null
)
{
int
width
=
graphics
.
canvas
.
get
width
(
)
;
int
height
=
graphics
.
canvas
.
get
height
(
)
;
if
(
last
width
!=
width
||
last
height
!=
height
)
{
last
width
=
width
;
last
height
=
height
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
last
width
,
last
height
)
;
listener
.
resize
(
last
width
,
last
height
)
;
should
render
=
true
;
}
}
else
{
graphics
.
config
.
x
=
display
.
get
x
(
)
;
graphics
.
config
.
y
=
display
.
get
y
(
)
;
if
(
graphics
.
resize
||
display
.
was
resized
(
)
||
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
width
||
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
height
)
{
graphics
.
resize
=
false
;
graphics
.
config
.
width
=
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
graphics
.
config
.
height
=
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
if
(
listener
!=
null
)
listener
.
resize
(
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
graphics
.
request
rendering
(
)
;
}
}
if
(
execute
runnables
(
)
)
should
render
=
true
;
if
(
!
running
)
break
;
input
.
update
(
)
;
should
render
|=
graphics
.
should
render
(
)
;
input
.
process
events
(
)
;
if
(
audio
!=
null
)
audio
.
update
(
)
;
if
(
!
is
active
&&
graphics
.
config
.
background
fps
==
-
1
)
should
render
=
false
;
int
frame
rate
=
is
active
?
graphics
.
config
.
foreground
fps
:
graphics
.
config
.
background
fps
;
if
(
should
render
)
{
graphics
.
update
time
(
)
;
graphics
.
frame
id
++
;
listener
.
render
(
)
;
display
.
update
(
false
)
;
}
else
{
if
(
frame
rate
==
-
1
)
frame
rate
=
10
;
if
(
frame
rate
==
0
)
frame
rate
=
graphics
.
config
.
background
fps
;
if
(
frame
rate
==
0
)
frame
rate
=
30
;
}
if
(
frame
rate
>
0
)
display
.
sync
(
frame
rate
)
;
}
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
{
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
}
}
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
display
.
destroy
(
)
;
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
if
(
graphics
.
config
.
force
exit
)
system
.
exit
(
-
1
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.45e-01)
%UNK%
(2.76e-02)
render
(6.64e-03)
down
(6.09e-03)
end
(5.09e-03)
changed
(4.24e-03)
run
(4.02e-03)
update
(3.90e-03)
frame
(3.43e-03)
pressed
(3.01e-03)
<SENTENCE_START>
{
array
<
lifecycle
listener
>
lifecycle
listeners
=
this
.
lifecycle
listeners
;
try
{
graphics
.
setup
display
(
)
;
}
catch
(
lwjgl
exception
e
)
{
throw
new
gdx
runtime
exception
(
e
)
;
}
listener
.
create
(
)
;
graphics
.
resize
=
true
;
int
last
width
=
graphics
.
get
width
(
)
;
int
last
height
=
graphics
.
get
height
(
)
;
graphics
.
last
time
=
system
.
nano
time
(
)
;
boolean
was
active
=
true
;
while
(
running
)
{
display
.
process
messages
(
)
;
if
(
display
.
is
close
requested
(
)
)
exit
(
)
;
boolean
is
active
=
display
.
is
active
(
)
;
if
(
was
active
&&
!
is
active
)
{
was
active
=
false
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
pause
(
)
;
}
listener
.
pause
(
)
;
}
if
(
!
was
active
&&
is
active
)
{
was
active
=
true
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
resume
(
)
;
}
listener
.
resume
(
)
;
}
boolean
should
render
=
false
;
if
(
graphics
.
canvas
!=
null
)
{
int
width
=
graphics
.
canvas
.
get
width
(
)
;
int
height
=
graphics
.
canvas
.
get
height
(
)
;
if
(
last
width
!=
width
||
last
height
!=
height
)
{
last
width
=
width
;
last
height
=
height
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
last
width
,
last
height
)
;
listener
.
resize
(
last
width
,
last
height
)
;
should
render
=
true
;
}
}
else
{
graphics
.
config
.
x
=
display
.
get
x
(
)
;
graphics
.
config
.
y
=
display
.
get
y
(
)
;
if
(
graphics
.
resize
||
display
.
was
resized
(
)
||
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
width
||
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
height
)
{
graphics
.
resize
=
false
;
graphics
.
config
.
width
=
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
graphics
.
config
.
height
=
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
if
(
listener
!=
null
)
listener
.
resize
(
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
graphics
.
request
rendering
(
)
;
}
}
if
(
execute
runnables
(
)
)
should
render
=
true
;
if
(
!
running
)
break
;
input
.
update
(
)
;
should
render
|=
graphics
.
should
render
(
)
;
input
.
process
events
(
)
;
if
(
audio
!=
null
)
audio
.
update
(
)
;
if
(
!
is
active
&&
graphics
.
config
.
background
fps
==
-
1
)
should
render
=
false
;
int
frame
rate
=
is
active
?
graphics
.
config
.
foreground
fps
:
graphics
.
config
.
background
fps
;
if
(
should
render
)
{
graphics
.
update
time
(
)
;
graphics
.
frame
id
++
;
listener
.
render
(
)
;
display
.
update
(
false
)
;
}
else
{
if
(
frame
rate
==
-
1
)
frame
rate
=
10
;
if
(
frame
rate
==
0
)
frame
rate
=
graphics
.
config
.
background
fps
;
if
(
frame
rate
==
0
)
frame
rate
=
30
;
}
if
(
frame
rate
>
0
)
display
.
sync
(
frame
rate
)
;
}
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
{
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
}
}
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
display
.
destroy
(
)
;
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
if
(
graphics
.
config
.
force
exit
)
system
.
exit
(
-
1
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
<
lifecycle
listener
>
lifecycle
listeners
=
this
.
lifecycle
listeners
;
try
{
graphics
.
setup
display
(
)
;
}
catch
(
lwjgl
exception
e
)
{
throw
new
gdx
runtime
exception
(
e
)
;
}
listener
.
create
(
)
;
graphics
.
resize
=
true
;
int
last
width
=
graphics
.
get
width
(
)
;
int
last
height
=
graphics
.
get
height
(
)
;
graphics
.
last
time
=
system
.
nano
time
(
)
;
boolean
was
active
=
true
;
while
(
running
)
{
display
.
process
messages
(
)
;
if
(
display
.
is
close
requested
(
)
)
exit
(
)
;
boolean
is
active
=
display
.
is
active
(
)
;
if
(
was
active
&&
!
is
active
)
{
was
active
=
false
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
pause
(
)
;
}
listener
.
pause
(
)
;
}
if
(
!
was
active
&&
is
active
)
{
was
active
=
true
;
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
listener
.
resume
(
)
;
}
listener
.
resume
(
)
;
}
boolean
should
render
=
false
;
if
(
graphics
.
canvas
!=
null
)
{
int
width
=
graphics
.
canvas
.
get
width
(
)
;
int
height
=
graphics
.
canvas
.
get
height
(
)
;
if
(
last
width
!=
width
||
last
height
!=
height
)
{
last
width
=
width
;
last
height
=
height
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
last
width
,
last
height
)
;
listener
.
resize
(
last
width
,
last
height
)
;
should
render
=
true
;
}
}
else
{
graphics
.
config
.
x
=
display
.
get
x
(
)
;
graphics
.
config
.
y
=
display
.
get
y
(
)
;
if
(
graphics
.
resize
||
display
.
was
resized
(
)
||
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
width
||
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
!=
graphics
.
config
.
height
)
{
graphics
.
resize
=
false
;
graphics
.
config
.
width
=
(
int
)
(
display
.
get
width
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
graphics
.
config
.
height
=
(
int
)
(
display
.
get
height
(
)
*
display
.
get
pixel
scale
factor
(
)
)
;
gdx
.
gl
.
gl
viewport
(
0
,
0
,
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
if
(
listener
!=
null
)
listener
.
resize
(
graphics
.
config
.
width
,
graphics
.
config
.
height
)
;
graphics
.
request
rendering
(
)
;
}
}
if
(
execute
runnables
(
)
)
should
render
=
true
;
if
(
!
running
)
break
;
input
.
update
(
)
;
should
render
|=
graphics
.
should
render
(
)
;
input
.
process
events
(
)
;
if
(
audio
!=
null
)
audio
.
update
(
)
;
if
(
!
is
active
&&
graphics
.
config
.
background
fps
==
-
1
)
should
render
=
false
;
int
frame
rate
=
is
active
?
graphics
.
config
.
foreground
fps
:
graphics
.
config
.
background
fps
;
if
(
should
render
)
{
graphics
.
update
time
(
)
;
graphics
.
frame
id
++
;
listener
.
render
(
)
;
display
.
update
(
false
)
;
}
else
{
if
(
frame
rate
==
-
1
)
frame
rate
=
10
;
if
(
frame
rate
==
0
)
frame
rate
=
graphics
.
config
.
background
fps
;
if
(
frame
rate
==
0
)
frame
rate
=
30
;
}
if
(
frame
rate
>
0
)
display
.
sync
(
frame
rate
)
;
}
synchronized
(
lifecycle
listeners
)
{
for
(
lifecycle
listener
listener
:
lifecycle
listeners
)
{
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
}
}
listener
.
pause
(
)
;
listener
.
dispose
(
)
;
display
.
destroy
(
)
;
if
(
audio
!=
null
)
audio
.
dispose
(
)
;
if
(
graphics
.
config
.
force
exit
)
system
.
exit
(
-
1
)
;
}
<SENTENCE_END/>
execute,runnables
execute
execute
(8.22e-01)
process
(7.47e-02)
runnables
(3.33e-02)
main
(1.83e-02)
executed
(1.24e-02)
i
(1.37e-03)
size
(1.28e-03)
while
(1.06e-03)
get
(8.08e-04)
run
(8.04e-04)
<SENTENCE_START>
{
synchronized
(
runnables
)
{
for
(
int
i
=
runnables
.
size
-
1
;
i
>=
0
;
i
--
)
executed
runnables
.
add
(
runnables
.
get
(
i
)
)
;
runnables
.
clear
(
)
;
}
if
(
executed
runnables
.
size
==
0
)
return
false
;
do
executed
runnables
.
pop
(
)
.
run
(
)
;
while
(
executed
runnables
.
size
>
0
)
;
return
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
synchronized
(
runnables
)
{
for
(
int
i
=
runnables
.
size
-
1
;
i
>=
0
;
i
--
)
executed
runnables
.
add
(
runnables
.
get
(
i
)
)
;
runnables
.
clear
(
)
;
}
if
(
executed
runnables
.
size
==
0
)
return
false
;
do
executed
runnables
.
pop
(
)
.
run
(
)
;
while
(
executed
runnables
.
size
>
0
)
;
return
true
;
}
<SENTENCE_END/>
runnables
runnables
(4.17e-01)
execute
(2.38e-01)
%END%
(2.04e-01)
executed
(2.05e-02)
process
(1.60e-02)
main
(4.37e-03)
and
(3.52e-03)
%UNK%
(2.80e-03)
all
(2.34e-03)
i
(2.31e-03)
<SENTENCE_START>
{
synchronized
(
runnables
)
{
for
(
int
i
=
runnables
.
size
-
1
;
i
>=
0
;
i
--
)
executed
runnables
.
add
(
runnables
.
get
(
i
)
)
;
runnables
.
clear
(
)
;
}
if
(
executed
runnables
.
size
==
0
)
return
false
;
do
executed
runnables
.
pop
(
)
.
run
(
)
;
while
(
executed
runnables
.
size
>
0
)
;
return
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
synchronized
(
runnables
)
{
for
(
int
i
=
runnables
.
size
-
1
;
i
>=
0
;
i
--
)
executed
runnables
.
add
(
runnables
.
get
(
i
)
)
;
runnables
.
clear
(
)
;
}
if
(
executed
runnables
.
size
==
0
)
return
false
;
do
executed
runnables
.
pop
(
)
.
run
(
)
;
while
(
executed
runnables
.
size
>
0
)
;
return
true
;
}
<SENTENCE_END/>
%END%
%END%
(9.04e-01)
runnables
(1.67e-02)
all
(4.45e-03)
execute
(2.97e-03)
and
(2.52e-03)
size
(2.50e-03)
get
(1.53e-03)
string
(1.06e-03)
executed
(9.62e-04)
%UNK%
(8.94e-04)
<SENTENCE_START>
{
synchronized
(
runnables
)
{
for
(
int
i
=
runnables
.
size
-
1
;
i
>=
0
;
i
--
)
executed
runnables
.
add
(
runnables
.
get
(
i
)
)
;
runnables
.
clear
(
)
;
}
if
(
executed
runnables
.
size
==
0
)
return
false
;
do
executed
runnables
.
pop
(
)
.
run
(
)
;
while
(
executed
runnables
.
size
>
0
)
;
return
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
synchronized
(
runnables
)
{
for
(
int
i
=
runnables
.
size
-
1
;
i
>=
0
;
i
--
)
executed
runnables
.
add
(
runnables
.
get
(
i
)
)
;
runnables
.
clear
(
)
;
}
if
(
executed
runnables
.
size
==
0
)
return
false
;
do
executed
runnables
.
pop
(
)
.
run
(
)
;
while
(
executed
runnables
.
size
>
0
)
;
return
true
;
}
<SENTENCE_END/>
stop
stop
run
(8.07e-01)
main
(1.49e-01)
create
(1.35e-02)
reset
(7.91e-03)
set
(3.21e-03)
loop
(3.00e-03)
setup
(2.19e-03)
thread
(1.09e-03)
catch
(8.86e-04)
running
(7.54e-04)
<SENTENCE_START>
{
running
=
false
;
try
{
main
loop
thread
.
join
(
)
;
}
catch
(
exception
ex
)
{
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
running
=
false
;
try
{
main
loop
thread
.
join
(
)
;
}
catch
(
exception
ex
)
{
}
}
<SENTENCE_END/>
%END%
%END%
(9.07e-01)
run
(1.76e-02)
main
(5.88e-03)
%UNK%
(4.03e-03)
loop
(4.00e-03)
changed
(3.52e-03)
thread
(1.95e-03)
try
(1.95e-03)
pixels
(1.54e-03)
test
(1.53e-03)
<SENTENCE_START>
{
running
=
false
;
try
{
main
loop
thread
.
join
(
)
;
}
catch
(
exception
ex
)
{
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
running
=
false
;
try
{
main
loop
thread
.
join
(
)
;
}
catch
(
exception
ex
)
{
}
}
<SENTENCE_END/>
get,c,ptr
get
get
(9.83e-01)
c
(4.72e-03)
obj
(1.88e-03)
swig
(1.36e-03)
is
(8.93e-04)
return
(8.85e-04)
ptr
(5.54e-04)
0
(3.63e-04)
null
(3.14e-04)
obtain
(2.82e-04)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
c
c
(9.96e-01)
ptr
(2.00e-03)
get
(1.04e-03)
%END%
(8.72e-04)
swig
(1.90e-04)
instance
(1.07e-04)
overlaps
(3.51e-05)
derived
(2.62e-05)
match
(7.06e-06)
is
(6.12e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
ptr
ptr
(9.96e-01)
c
(2.15e-03)
%END%
(1.61e-03)
obj
(1.88e-05)
0
(6.12e-06)
get
(6.07e-06)
return
(5.61e-06)
string
(2.74e-06)
instance
(2.57e-06)
swig
(2.31e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
%END%
%END%
(9.61e-01)
ptr
(3.23e-02)
obj
(8.25e-04)
c
(4.05e-04)
return
(2.33e-04)
string
(2.06e-04)
double
(1.33e-04)
at
(1.02e-04)
0
(9.89e-05)
swig
(5.39e-05)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
sort,islands
sort
sort
(9.61e-01)
find
(2.95e-02)
islands
(4.30e-03)
union
(4.28e-03)
bt
(2.49e-04)
collision
(8.91e-05)
jni
(6.34e-05)
c
(5.31e-05)
ptr
(4.25e-05)
swig
(4.09e-05)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
sort
islands
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
sort
islands
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
islands
sort
(9.45e-01)
islands
(4.70e-02)
%END%
(6.44e-03)
find
(1.03e-03)
union
(8.06e-06)
all
(6.91e-06)
this
(5.86e-06)
c
(3.96e-06)
lo
(3.27e-06)
triangles
(2.95e-06)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
sort
islands
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
sort
islands
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.54e-01)
islands
(2.30e-01)
sort
(1.58e-02)
find
(4.81e-05)
valid
(3.86e-05)
bt
(3.76e-05)
%UNK%
(2.78e-05)
fv
(2.61e-05)
all
(2.15e-05)
endian
(1.99e-05)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
sort
islands
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
sort
islands
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
reset
reset
reset
(9.33e-01)
find
(5.51e-02)
union
(8.30e-03)
bt
(6.79e-04)
collision
(3.84e-04)
jni
(2.50e-04)
n
(2.29e-04)
this
(1.48e-04)
c
(1.21e-04)
ptr
(1.02e-04)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
reset
(
swig
c
ptr
,
this
,
n
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
reset
(
swig
c
ptr
,
this
,
n
)
;
}
<SENTENCE_END/>
%END%
%END%
(5.88e-01)
reset
(3.51e-01)
find
(3.75e-02)
n
(2.09e-03)
set
(1.73e-03)
get
(9.47e-04)
%UNK%
(8.11e-04)
union
(7.88e-04)
swig
(6.16e-04)
next
(5.46e-04)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
reset
(
swig
c
ptr
,
this
,
n
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
reset
(
swig
c
ptr
,
this
,
n
)
;
}
<SENTENCE_END/>
get,num,elements
get
get
(9.85e-01)
find
(7.73e-03)
num
(3.78e-03)
union
(1.27e-03)
elements
(8.38e-04)
c
(1.84e-04)
bt
(1.67e-04)
swig
(1.64e-04)
return
(1.46e-04)
collision
(1.42e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
get
num
elements
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
get
num
elements
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
num
num
(9.85e-01)
get
(1.28e-02)
elements
(1.28e-03)
%END%
(9.21e-04)
instance
(2.66e-05)
find
(2.00e-05)
available
(9.15e-06)
c
(6.80e-06)
ptr
(6.04e-06)
floats
(5.55e-06)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
get
num
elements
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
get
num
elements
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
elements
elements
(9.85e-01)
num
(1.21e-02)
%END%
(3.18e-03)
get
(1.34e-05)
find
(6.92e-06)
ptr
(4.50e-06)
collision
(3.82e-06)
this
(3.80e-06)
jni
(3.58e-06)
c
(3.57e-06)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
get
num
elements
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
get
num
elements
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(8.53e-01)
elements
(1.40e-01)
num
(1.77e-04)
bt
(1.36e-04)
find
(1.28e-04)
%UNK%
(1.12e-04)
endian
(9.90e-05)
valid
(5.07e-05)
c
(4.44e-05)
2
(4.30e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
get
num
elements
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
get
num
elements
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
is,root
is
is
(9.65e-01)
find
(1.88e-02)
root
(1.05e-02)
union
(3.04e-03)
bt
(2.91e-04)
collision
(2.71e-04)
c
(1.99e-04)
return
(1.87e-04)
this
(1.83e-04)
x
(1.47e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
is
root
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
is
root
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
root
root
(9.48e-01)
is
(4.43e-02)
find
(1.52e-03)
get
(1.12e-03)
add
(1.09e-03)
%END%
(1.07e-03)
hit
(1.77e-04)
%UNK%
(1.27e-04)
capture
(7.74e-05)
set
(7.56e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
is
root
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
is
root
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.42e-01)
root
(5.17e-02)
bt
(3.80e-04)
%UNK%
(3.63e-04)
is
(2.21e-04)
valid
(1.26e-04)
rad
(1.06e-04)
2
(1.03e-04)
c
(8.09e-05)
endian
(7.95e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
is
root
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
is
root
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
get,element
get
get
(9.70e-01)
find
(1.06e-02)
element
(1.02e-02)
union
(2.51e-03)
0
(6.43e-04)
bt
(5.86e-04)
swig
(5.68e-04)
collision
(3.81e-04)
new
(3.71e-04)
return
(3.36e-04)
<SENTENCE_START>
{
return
new
bt
element
(
collision
jni
.
bt
union
find
get
element
swig
0
(
swig
c
ptr
,
this
,
index
)
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
bt
element
(
collision
jni
.
bt
union
find
get
element
swig
0
(
swig
c
ptr
,
this
,
index
)
,
false
)
;
}
<SENTENCE_END/>
element
element
(9.87e-01)
get
(1.10e-02)
%END%
(9.50e-04)
%UNK%
(1.26e-04)
instance
(8.29e-05)
by
(7.39e-05)
string
(2.59e-05)
set
(2.34e-05)
attribute
(1.72e-05)
match
(1.71e-05)
<SENTENCE_START>
{
return
new
bt
element
(
collision
jni
.
bt
union
find
get
element
swig
0
(
swig
c
ptr
,
this
,
index
)
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
bt
element
(
collision
jni
.
bt
union
find
get
element
swig
0
(
swig
c
ptr
,
this
,
index
)
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(6.94e-01)
element
(2.23e-01)
%UNK%
(2.48e-03)
get
(2.12e-03)
swig
(1.95e-03)
0
(1.76e-03)
bt
(1.02e-03)
union
(9.93e-04)
collision
(8.28e-04)
instance
(7.40e-04)
<SENTENCE_START>
{
return
new
bt
element
(
collision
jni
.
bt
union
find
get
element
swig
0
(
swig
c
ptr
,
this
,
index
)
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
bt
element
(
collision
jni
.
bt
union
find
get
element
swig
0
(
swig
c
ptr
,
this
,
index
)
,
false
)
;
}
<SENTENCE_END/>
allocate
allocate
allocate
(9.37e-01)
find
(5.00e-02)
union
(8.71e-03)
bt
(6.15e-04)
collision
(4.24e-04)
jni
(3.06e-04)
n
(2.59e-04)
this
(1.42e-04)
c
(1.38e-04)
ptr
(1.21e-04)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
allocate
(
swig
c
ptr
,
this
,
n
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
allocate
(
swig
c
ptr
,
this
,
n
)
;
}
<SENTENCE_END/>
%END%
allocate
(5.96e-01)
%END%
(3.73e-01)
find
(1.60e-02)
n
(1.65e-03)
union
(4.12e-04)
capacity
(4.05e-04)
c
(2.74e-04)
swig
(2.32e-04)
get
(1.47e-04)
%UNK%
(1.21e-04)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
allocate
(
swig
c
ptr
,
this
,
n
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
allocate
(
swig
c
ptr
,
this
,
n
)
;
}
<SENTENCE_END/>
free
free
find
(9.61e-01)
free
(2.99e-02)
union
(6.45e-03)
bt
(4.13e-04)
collision
(2.62e-04)
jni
(1.39e-04)
ptr
(1.08e-04)
c
(1.05e-04)
this
(8.17e-05)
swig
(6.30e-05)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
free
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
free
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
free
(8.80e-01)
%END%
(9.21e-02)
find
(1.90e-02)
%UNK%
(1.06e-03)
set
(6.54e-04)
release
(3.01e-04)
ref
(2.64e-04)
obtain
(2.22e-04)
reset
(1.88e-04)
get
(1.68e-04)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
free
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
free
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
find
find
find
(9.87e-01)
union
(7.21e-03)
bt
(6.59e-04)
p
(3.60e-04)
collision
(3.54e-04)
swig
(2.66e-04)
return
(2.60e-04)
0
(2.47e-04)
q
(2.32e-04)
jni
(1.99e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
find
swig
0
(
swig
c
ptr
,
this
,
p
,
q
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
find
swig
0
(
swig
c
ptr
,
this
,
p
,
q
)
;
}
<SENTENCE_END/>
%END%
find
(9.31e-01)
%END%
(5.27e-02)
get
(4.11e-03)
(7.26e-04)
swig
(4.50e-04)
set
(3.23e-04)
%UNK%
(2.43e-04)
parse
(1.79e-04)
create
(1.58e-04)
union
(1.14e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
find
swig
0
(
swig
c
ptr
,
this
,
p
,
q
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
find
swig
0
(
swig
c
ptr
,
this
,
p
,
q
)
;
}
<SENTENCE_END/>
unite
unite
find
(9.24e-01)
unite
(4.91e-02)
union
(1.69e-02)
bt
(1.55e-03)
p
(1.21e-03)
q
(5.85e-04)
collision
(5.42e-04)
this
(3.40e-04)
jni
(3.20e-04)
ptr
(2.04e-04)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
unite
(
swig
c
ptr
,
this
,
p
,
q
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
unite
(
swig
c
ptr
,
this
,
p
,
q
)
;
}
<SENTENCE_END/>
%END%
unite
(7.62e-01)
%END%
(1.42e-01)
%UNK%
(4.14e-02)
find
(2.41e-02)
set
(3.34e-03)
get
(9.58e-04)
test
(7.56e-04)
to
(5.89e-04)
print
(5.41e-04)
create
(5.40e-04)
<SENTENCE_START>
{
collision
jni
.
bt
union
find
unite
(
swig
c
ptr
,
this
,
p
,
q
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
union
find
unite
(
swig
c
ptr
,
this
,
p
,
q
)
;
}
<SENTENCE_END/>
find
find
find
(9.89e-01)
union
(7.40e-03)
bt
(5.45e-04)
collision
(2.39e-04)
swig
(2.00e-04)
return
(1.82e-04)
1
(1.60e-04)
c
(1.41e-04)
jni
(1.36e-04)
x
(8.98e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
find
swig
1
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
find
swig
1
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
%END%
find
(9.75e-01)
%END%
(1.51e-02)
get
(1.50e-03)
swig
(2.44e-04)
(1.36e-04)
x
(5.75e-05)
union
(5.25e-05)
set
(4.57e-05)
%UNK%
(3.64e-05)
create
(3.04e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
find
swig
1
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
union
find
find
swig
1
(
swig
c
ptr
,
this
,
x
)
;
}
<SENTENCE_END/>
get,c,ptr
get
get
(9.83e-01)
c
(4.72e-03)
obj
(1.88e-03)
swig
(1.36e-03)
is
(8.93e-04)
return
(8.85e-04)
ptr
(5.54e-04)
0
(3.63e-04)
null
(3.14e-04)
obtain
(2.82e-04)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
c
c
(9.96e-01)
ptr
(2.00e-03)
get
(1.04e-03)
%END%
(8.72e-04)
swig
(1.90e-04)
instance
(1.07e-04)
overlaps
(3.51e-05)
derived
(2.62e-05)
match
(7.06e-06)
is
(6.12e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
ptr
ptr
(9.96e-01)
c
(2.15e-03)
%END%
(1.61e-03)
obj
(1.88e-05)
0
(6.12e-06)
get
(6.07e-06)
return
(5.61e-06)
string
(2.74e-06)
instance
(2.57e-06)
swig
(2.31e-06)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
%END%
%END%
(9.61e-01)
ptr
(3.23e-02)
obj
(8.25e-04)
c
(4.05e-04)
return
(2.33e-04)
string
(2.06e-04)
double
(1.33e-04)
at
(1.02e-04)
0
(9.89e-05)
swig
(5.39e-05)
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
obj
==
null
)
?
0
:
obj
.
swig
c
ptr
;
}
<SENTENCE_END/>
get,radius
get
get
(9.79e-01)
radius
(1.22e-02)
shape
(5.39e-03)
cone
(5.68e-04)
collision
(3.86e-04)
return
(3.35e-04)
jni
(1.92e-04)
c
(1.81e-04)
ptr
(1.50e-04)
bt
(1.40e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
radius
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
radius
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
radius
radius
(9.98e-01)
get
(1.79e-03)
circle
(1.68e-04)
%END%
(1.27e-04)
calculate
(1.68e-05)
center
(1.01e-05)
collision
(3.45e-06)
set
(3.36e-06)
draw
(1.67e-06)
transform
(1.07e-06)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
radius
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
radius
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.89e-01)
radius
(2.52e-03)
jni
(5.46e-04)
collision
(4.65e-04)
c
(3.42e-04)
ptr
(2.76e-04)
swig
(2.41e-04)
this
(2.07e-04)
rad
(1.86e-04)
2
(1.55e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
radius
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
radius
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
get,height
get
get
(9.82e-01)
height
(1.03e-02)
shape
(4.10e-03)
cone
(5.42e-04)
collision
(3.85e-04)
return
(3.34e-04)
c
(2.26e-04)
jni
(1.98e-04)
ptr
(1.84e-04)
bt
(1.50e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
height
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
height
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
height
height
(9.95e-01)
%END%
(2.01e-03)
get
(1.68e-03)
size
(5.29e-04)
set
(2.43e-04)
width
(2.22e-04)
max
(4.34e-05)
pack
(2.16e-05)
bounds
(1.60e-05)
min
(1.60e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
height
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
height
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.84e-01)
height
(5.02e-03)
jni
(5.55e-04)
collision
(4.27e-04)
c
(3.85e-04)
ptr
(3.34e-04)
swig
(3.05e-04)
this
(2.39e-04)
2
(1.86e-04)
bt
(1.84e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
height
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
height
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
set,cone,up,index
set
set
(9.72e-01)
cone
(1.68e-02)
shape
(4.09e-03)
up
(3.03e-03)
index
(1.34e-03)
collision
(2.33e-04)
swig
(1.90e-04)
c
(1.88e-04)
bt
(1.39e-04)
ptr
(1.38e-04)
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
cone
cone
(9.85e-01)
up
(9.52e-03)
%END%
(4.13e-03)
set
(6.42e-04)
circle
(6.07e-05)
draw
(4.52e-05)
%UNK%
(2.21e-05)
radius
(1.19e-05)
triangle
(1.09e-05)
rad
(1.01e-05)
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
up
up
(9.69e-01)
index
(2.74e-02)
cone
(2.54e-03)
%END%
(1.27e-03)
ptr
(5.99e-06)
bt
(5.41e-06)
jni
(5.26e-06)
collision
(4.57e-06)
set
(4.01e-06)
this
(3.23e-06)
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
index
index
(8.29e-01)
%END%
(1.28e-01)
up
(3.91e-02)
cone
(8.28e-05)
shape
(5.83e-05)
%UNK%
(3.61e-05)
set
(3.48e-05)
at
(2.86e-05)
collision
(2.32e-05)
jni
(2.27e-05)
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.33e-01)
index
(5.90e-02)
up
(4.07e-04)
%UNK%
(2.15e-04)
at
(2.12e-04)
shape
(1.05e-04)
set
(1.01e-04)
rad
(9.39e-05)
bt
(5.51e-05)
performed
(5.07e-05)
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
collision
jni
.
bt
cone
shape
set
cone
up
index
(
swig
c
ptr
,
this
,
up
index
)
;
}
<SENTENCE_END/>
get,cone,up,index
get
get
(9.79e-01)
cone
(1.18e-02)
shape
(3.53e-03)
up
(1.77e-03)
index
(1.06e-03)
return
(2.67e-04)
collision
(2.51e-04)
bt
(1.79e-04)
swig
(1.79e-04)
c
(1.60e-04)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
cone
cone
(9.92e-01)
up
(3.94e-03)
%END%
(2.39e-03)
get
(5.49e-04)
circle
(1.19e-04)
set
(4.91e-05)
draw
(4.31e-05)
%UNK%
(2.69e-05)
rad
(2.29e-05)
triangle
(2.25e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
up
up
(9.80e-01)
index
(1.62e-02)
cone
(3.40e-03)
%END%
(6.93e-04)
jni
(4.48e-06)
ptr
(4.48e-06)
this
(3.42e-06)
bt
(3.21e-06)
collision
(2.70e-06)
get
(2.63e-06)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
index
index
(8.51e-01)
%END%
(9.32e-02)
up
(5.35e-02)
cone
(8.97e-05)
shape
(5.09e-05)
%UNK%
(3.83e-05)
bt
(3.53e-05)
jni
(2.44e-05)
rad
(2.28e-05)
ptr
(2.10e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.32e-01)
index
(6.03e-02)
up
(4.30e-04)
%UNK%
(2.99e-04)
rad
(1.78e-04)
bt
(1.59e-04)
2
(1.32e-04)
shape
(9.72e-05)
endian
(9.54e-05)
at
(7.22e-05)
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
collision
jni
.
bt
cone
shape
get
cone
up
index
(
swig
c
ptr
,
this
)
;
}
<SENTENCE_END/>
get,amount
get
get
(9.31e-01)
is
(5.74e-02)
iterator
(2.46e-03)
return
(1.69e-03)
amount
(9.34e-04)
owns
(7.24e-04)
needs
(6.90e-04)
scrolled
(6.15e-04)
size
(3.93e-04)
touch
(1.51e-04)
<SENTENCE_START>
{
return
amount
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
amount
;
}
<SENTENCE_END/>
amount
amount
(9.13e-01)
by
(5.63e-02)
scroll
(2.32e-02)
%END%
(1.73e-03)
return
(1.62e-03)
relative
(1.04e-03)
bar
(4.21e-04)
scale
(3.92e-04)
update
(3.15e-04)
percent
(2.45e-04)
<SENTENCE_START>
{
return
amount
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
amount
;
}
<SENTENCE_END/>
%END%
%END%
(9.35e-01)
amount
(1.61e-02)
value
(4.27e-03)
height
(2.23e-03)
by
(1.73e-03)
only
(1.62e-03)
width
(1.38e-03)
mode
(1.11e-03)
display
(8.46e-04)
animation
(8.44e-04)
<SENTENCE_START>
{
return
amount
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
amount
;
}
<SENTENCE_END/>
set,amount
set
set
(9.67e-01)
rotate
(2.24e-02)
amount
(2.51e-03)
rotation
(1.29e-03)
translate
(8.18e-04)
update
(6.20e-04)
clear
(4.01e-04)
scroll
(2.88e-04)
apply
(2.47e-04)
cancel
(1.69e-04)
<SENTENCE_START>
{
amount
=
rotation
amount
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
amount
=
rotation
amount
;
}
<SENTENCE_END/>
amount
amount
(5.35e-01)
rotation
(2.84e-01)
scroll
(8.27e-02)
by
(7.55e-02)
relative
(3.27e-03)
%END%
(2.92e-03)
rotate
(2.78e-03)
update
(1.31e-03)
scale
(1.24e-03)
bar
(9.93e-04)
<SENTENCE_START>
{
amount
=
rotation
amount
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
amount
=
rotation
amount
;
}
<SENTENCE_END/>
%END%
%END%
(8.36e-01)
amount
(1.31e-01)
rotation
(3.31e-03)
value
(1.37e-03)
display
(1.27e-03)
performed
(1.07e-03)
by
(9.53e-04)
height
(9.00e-04)
positions
(8.73e-04)
animation
(7.77e-04)
<SENTENCE_START>
{
amount
=
rotation
amount
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
amount
=
rotation
amount
;
}
<SENTENCE_END/>
get,child,edge
get
set
(5.57e-01)
%END%
(5.34e-02)
get
(3.42e-02)
add
(2.60e-02)
vertex
(2.26e-02)
%UNK%
(2.05e-02)
reset
(1.64e-02)
compute
(1.40e-02)
draw
(1.29e-02)
translate
(9.64e-03)
<SENTENCE_START>
{
assert
(
0
<=
index
&&
index
<
m
count
-
1
)
;
edge
.
m
radius
=
m
radius
;
final
vec
2
v
0
=
m
vertices
[
index
+
0
]
;
final
vec
2
v
1
=
m
vertices
[
index
+
1
]
;
edge
.
m
vertex
1
.
x
=
v
0
.
x
;
edge
.
m
vertex
1
.
y
=
v
0
.
y
;
edge
.
m
vertex
2
.
x
=
v
1
.
x
;
edge
.
m
vertex
2
.
y
=
v
1
.
y
;
if
(
index
>
0
)
{
vec
2
v
=
m
vertices
[
index
-
1
]
;
edge
.
m
vertex
0
.
x
=
v
.
x
;
edge
.
m
vertex
0
.
y
=
v
.
y
;
edge
.
m
has
vertex
0
=
true
;
}
else
{
edge
.
m
vertex
0
.
x
=
m
prev
vertex
.
x
;
edge
.
m
vertex
0
.
y
=
m
prev
vertex
.
y
;
edge
.
m
has
vertex
0
=
m
has
prev
vertex
;
}
if
(
index
<
m
count
-
2
)
{
vec
2
v
=
m
vertices
[
index
+
2
]
;
edge
.
m
vertex
3
.
x
=
v
.
x
;
edge
.
m
vertex
3
.
y
=
v
.
y
;
edge
.
m
has
vertex
3
=
true
;
}
else
{
edge
.
m
vertex
3
.
x
=
m
next
vertex
.
x
;
edge
.
m
vertex
3
.
y
=
m
next
vertex
.
y
;
edge
.
m
has
vertex
3
=
m
has
next
vertex
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
0
<=
index
&&
index
<
m
count
-
1
)
;
edge
.
m
radius
=
m
radius
;
final
vec
2
v
0
=
m
vertices
[
index
+
0
]
;
final
vec
2
v
1
=
m
vertices
[
index
+
1
]
;
edge
.
m
vertex
1
.
x
=
v
0
.
x
;
edge
.
m
vertex
1
.
y
=
v
0
.
y
;
edge
.
m
vertex
2
.
x
=
v
1
.
x
;
edge
.
m
vertex
2
.
y
=
v
1
.
y
;
if
(
index
>
0
)
{
vec
2
v
=
m
vertices
[
index
-
1
]
;
edge
.
m
vertex
0
.
x
=
v
.
x
;
edge
.
m
vertex
0
.
y
=
v
.
y
;
edge
.
m
has
vertex
0
=
true
;
}
else
{
edge
.
m
vertex
0
.
x
=
m
prev
vertex
.
x
;
edge
.
m
vertex
0
.
y
=
m
prev
vertex
.
y
;
edge
.
m
has
vertex
0
=
m
has
prev
vertex
;
}
if
(
index
<
m
count
-
2
)
{
vec
2
v
=
m
vertices
[
index
+
2
]
;
edge
.
m
vertex
3
.
x
=
v
.
x
;
edge
.
m
vertex
3
.
y
=
v
.
y
;
edge
.
m
has
vertex
3
=
true
;
}
else
{
edge
.
m
vertex
3
.
x
=
m
next
vertex
.
x
;
edge
.
m
vertex
3
.
y
=
m
next
vertex
.
y
;
edge
.
m
has
vertex
3
=
m
has
next
vertex
;
}
}
<SENTENCE_END/>
child
%END%
(5.94e-01)
vertex
(5.52e-02)
set
(3.51e-02)
%UNK%
(1.38e-02)
edge
(1.29e-02)
prev
(1.23e-02)
m
(1.13e-02)
vertices
(9.52e-03)
get
(9.47e-03)
next
(8.77e-03)
<SENTENCE_START>
{
assert
(
0
<=
index
&&
index
<
m
count
-
1
)
;
edge
.
m
radius
=
m
radius
;
final
vec
2
v
0
=
m
vertices
[
index
+
0
]
;
final
vec
2
v
1
=
m
vertices
[
index
+
1
]
;
edge
.
m
vertex
1
.
x
=
v
0
.
x
;
edge
.
m
vertex
1
.
y
=
v
0
.
y
;
edge
.
m
vertex
2
.
x
=
v
1
.
x
;
edge
.
m
vertex
2
.
y
=
v
1
.
y
;
if
(
index
>
0
)
{
vec
2
v
=
m
vertices
[
index
-
1
]
;
edge
.
m
vertex
0
.
x
=
v
.
x
;
edge
.
m
vertex
0
.
y
=
v
.
y
;
edge
.
m
has
vertex
0
=
true
;
}
else
{
edge
.
m
vertex
0
.
x
=
m
prev
vertex
.
x
;
edge
.
m
vertex
0
.
y
=
m
prev
vertex
.
y
;
edge
.
m
has
vertex
0
=
m
has
prev
vertex
;
}
if
(
index
<
m
count
-
2
)
{
vec
2
v
=
m
vertices
[
index
+
2
]
;
edge
.
m
vertex
3
.
x
=
v
.
x
;
edge
.
m
vertex
3
.
y
=
v
.
y
;
edge
.
m
has
vertex
3
=
true
;
}
else
{
edge
.
m
vertex
3
.
x
=
m
next
vertex
.
x
;
edge
.
m
vertex
3
.
y
=
m
next
vertex
.
y
;
edge
.
m
has
vertex
3
=
m
has
next
vertex
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
0
<=
index
&&
index
<
m
count
-
1
)
;
edge
.
m
radius
=
m
radius
;
final
vec
2
v
0
=
m
vertices
[
index
+
0
]
;
final
vec
2
v
1
=
m
vertices
[
index
+
1
]
;
edge
.
m
vertex
1
.
x
=
v
0
.
x
;
edge
.
m
vertex
1
.
y
=
v
0
.
y
;
edge
.
m
vertex
2
.
x
=
v
1
.
x
;
edge
.
m
vertex
2
.
y
=
v
1
.
y
;
if
(
index
>
0
)
{
vec
2
v
=
m
vertices
[
index
-
1
]
;
edge
.
m
vertex
0
.
x
=
v
.
x
;
edge
.
m
vertex
0
.
y
=
v
.
y
;
edge
.
m
has
vertex
0
=
true
;
}
else
{
edge
.
m
vertex
0
.
x
=
m
prev
vertex
.
x
;
edge
.
m
vertex
0
.
y
=
m
prev
vertex
.
y
;
edge
.
m
has
vertex
0
=
m
has
prev
vertex
;
}
if
(
index
<
m
count
-
2
)
{
vec
2
v
=
m
vertices
[
index
+
2
]
;
edge
.
m
vertex
3
.
x
=
v
.
x
;
edge
.
m
vertex
3
.
y
=
v
.
y
;
edge
.
m
has
vertex
3
=
true
;
}
else
{
edge
.
m
vertex
3
.
x
=
m
next
vertex
.
x
;
edge
.
m
vertex
3
.
y
=
m
next
vertex
.
y
;
edge
.
m
has
vertex
3
=
m
has
next
vertex
;
}
}
<SENTENCE_END/>
edge
%END%
(6.38e-01)
vertex
(5.27e-02)
set
(1.82e-02)
3
(1.40e-02)
0
(1.34e-02)
edge
(1.16e-02)
%UNK%
(1.15e-02)
m
(1.05e-02)
y
(7.83e-03)
x
(7.29e-03)
<SENTENCE_START>
{
assert
(
0
<=
index
&&
index
<
m
count
-
1
)
;
edge
.
m
radius
=
m
radius
;
final
vec
2
v
0
=
m
vertices
[
index
+
0
]
;
final
vec
2
v
1
=
m
vertices
[
index
+
1
]
;
edge
.
m
vertex
1
.
x
=
v
0
.
x
;
edge
.
m
vertex
1
.
y
=
v
0
.
y
;
edge
.
m
vertex
2
.
x
=
v
1
.
x
;
edge
.
m
vertex
2
.
y
=
v
1
.
y
;
if
(
index
>
0
)
{
vec
2
v
=
m
vertices
[
index
-
1
]
;
edge
.
m
vertex
0
.
x
=
v
.
x
;
edge
.
m
vertex
0
.
y
=
v
.
y
;
edge
.
m
has
vertex
0
=
true
;
}
else
{
edge
.
m
vertex
0
.
x
=
m
prev
vertex
.
x
;
edge
.
m
vertex
0
.
y
=
m
prev
vertex
.
y
;
edge
.
m
has
vertex
0
=
m
has
prev
vertex
;
}
if
(
index
<
m
count
-
2
)
{
vec
2
v
=
m
vertices
[
index
+
2
]
;
edge
.
m
vertex
3
.
x
=
v
.
x
;
edge
.
m
vertex
3
.
y
=
v
.
y
;
edge
.
m
has
vertex
3
=
true
;
}
else
{
edge
.
m
vertex
3
.
x
=
m
next
vertex
.
x
;
edge
.
m
vertex
3
.
y
=
m
next
vertex
.
y
;
edge
.
m
has
vertex
3
=
m
has
next
vertex
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
0
<=
index
&&
index
<
m
count
-
1
)
;
edge
.
m
radius
=
m
radius
;
final
vec
2
v
0
=
m
vertices
[
index
+
0
]
;
final
vec
2
v
1
=
m
vertices
[
index
+
1
]
;
edge
.
m
vertex
1
.
x
=
v
0
.
x
;
edge
.
m
vertex
1
.
y
=
v
0
.
y
;
edge
.
m
vertex
2
.
x
=
v
1
.
x
;
edge
.
m
vertex
2
.
y
=
v
1
.
y
;
if
(
index
>
0
)
{
vec
2
v
=
m
vertices
[
index
-
1
]
;
edge
.
m
vertex
0
.
x
=
v
.
x
;
edge
.
m
vertex
0
.
y
=
v
.
y
;
edge
.
m
has
vertex
0
=
true
;
}
else
{
edge
.
m
vertex
0
.
x
=
m
prev
vertex
.
x
;
edge
.
m
vertex
0
.
y
=
m
prev
vertex
.
y
;
edge
.
m
has
vertex
0
=
m
has
prev
vertex
;
}
if
(
index
<
m
count
-
2
)
{
vec
2
v
=
m
vertices
[
index
+
2
]
;
edge
.
m
vertex
3
.
x
=
v
.
x
;
edge
.
m
vertex
3
.
y
=
v
.
y
;
edge
.
m
has
vertex
3
=
true
;
}
else
{
edge
.
m
vertex
3
.
x
=
m
next
vertex
.
x
;
edge
.
m
vertex
3
.
y
=
m
next
vertex
.
y
;
edge
.
m
has
vertex
3
=
m
has
next
vertex
;
}
}
<SENTENCE_END/>
%END%
%END%
(7.99e-01)
vertex
(1.65e-02)
%UNK%
(8.25e-03)
set
(7.69e-03)
edge
(7.07e-03)
m
(6.61e-03)
0
(5.55e-03)
3
(4.77e-03)
x
(4.58e-03)
y
(4.42e-03)
<SENTENCE_START>
{
assert
(
0
<=
index
&&
index
<
m
count
-
1
)
;
edge
.
m
radius
=
m
radius
;
final
vec
2
v
0
=
m
vertices
[
index
+
0
]
;
final
vec
2
v
1
=
m
vertices
[
index
+
1
]
;
edge
.
m
vertex
1
.
x
=
v
0
.
x
;
edge
.
m
vertex
1
.
y
=
v
0
.
y
;
edge
.
m
vertex
2
.
x
=
v
1
.
x
;
edge
.
m
vertex
2
.
y
=
v
1
.
y
;
if
(
index
>
0
)
{
vec
2
v
=
m
vertices
[
index
-
1
]
;
edge
.
m
vertex
0
.
x
=
v
.
x
;
edge
.
m
vertex
0
.
y
=
v
.
y
;
edge
.
m
has
vertex
0
=
true
;
}
else
{
edge
.
m
vertex
0
.
x
=
m
prev
vertex
.
x
;
edge
.
m
vertex
0
.
y
=
m
prev
vertex
.
y
;
edge
.
m
has
vertex
0
=
m
has
prev
vertex
;
}
if
(
index
<
m
count
-
2
)
{
vec
2
v
=
m
vertices
[
index
+
2
]
;
edge
.
m
vertex
3
.
x
=
v
.
x
;
edge
.
m
vertex
3
.
y
=
v
.
y
;
edge
.
m
has
vertex
3
=
true
;
}
else
{
edge
.
m
vertex
3
.
x
=
m
next
vertex
.
x
;
edge
.
m
vertex
3
.
y
=
m
next
vertex
.
y
;
edge
.
m
has
vertex
3
=
m
has
next
vertex
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
0
<=
index
&&
index
<
m
count
-
1
)
;
edge
.
m
radius
=
m
radius
;
final
vec
2
v
0
=
m
vertices
[
index
+
0
]
;
final
vec
2
v
1
=
m
vertices
[
index
+
1
]
;
edge
.
m
vertex
1
.
x
=
v
0
.
x
;
edge
.
m
vertex
1
.
y
=
v
0
.
y
;
edge
.
m
vertex
2
.
x
=
v
1
.
x
;
edge
.
m
vertex
2
.
y
=
v
1
.
y
;
if
(
index
>
0
)
{
vec
2
v
=
m
vertices
[
index
-
1
]
;
edge
.
m
vertex
0
.
x
=
v
.
x
;
edge
.
m
vertex
0
.
y
=
v
.
y
;
edge
.
m
has
vertex
0
=
true
;
}
else
{
edge
.
m
vertex
0
.
x
=
m
prev
vertex
.
x
;
edge
.
m
vertex
0
.
y
=
m
prev
vertex
.
y
;
edge
.
m
has
vertex
0
=
m
has
prev
vertex
;
}
if
(
index
<
m
count
-
2
)
{
vec
2
v
=
m
vertices
[
index
+
2
]
;
edge
.
m
vertex
3
.
x
=
v
.
x
;
edge
.
m
vertex
3
.
y
=
v
.
y
;
edge
.
m
has
vertex
3
=
true
;
}
else
{
edge
.
m
vertex
3
.
x
=
m
next
vertex
.
x
;
edge
.
m
vertex
3
.
y
=
m
next
vertex
.
y
;
edge
.
m
has
vertex
3
=
m
has
next
vertex
;
}
}
<SENTENCE_END/>
create,loop
create
set
(2.49e-01)
get
(1.21e-01)
add
(9.46e-02)
%UNK%
(6.41e-02)
%END%
(3.70e-02)
vertex
(2.11e-02)
create
(1.92e-02)
update
(1.70e-02)
find
(1.57e-02)
clear
(1.19e-02)
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
3
)
;
m
count
=
count
+
1
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
vertices
[
count
]
=
new
vec
2
(
m
vertices
[
0
]
)
;
m
prev
vertex
.
set
(
m
vertices
[
m
count
-
2
]
)
;
m
next
vertex
.
set
(
m
vertices
[
1
]
)
;
m
has
prev
vertex
=
true
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
3
)
;
m
count
=
count
+
1
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
vertices
[
count
]
=
new
vec
2
(
m
vertices
[
0
]
)
;
m
prev
vertex
.
set
(
m
vertices
[
m
count
-
2
]
)
;
m
next
vertex
.
set
(
m
vertices
[
1
]
)
;
m
has
prev
vertex
=
true
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
loop
%END%
(5.11e-01)
prev
(6.83e-02)
vertex
(5.04e-02)
%UNK%
(2.29e-02)
vertices
(1.90e-02)
m
(1.38e-02)
2
(1.03e-02)
next
(1.02e-02)
count
(9.78e-03)
get
(8.05e-03)
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
3
)
;
m
count
=
count
+
1
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
vertices
[
count
]
=
new
vec
2
(
m
vertices
[
0
]
)
;
m
prev
vertex
.
set
(
m
vertices
[
m
count
-
2
]
)
;
m
next
vertex
.
set
(
m
vertices
[
1
]
)
;
m
has
prev
vertex
=
true
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
3
)
;
m
count
=
count
+
1
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
vertices
[
count
]
=
new
vec
2
(
m
vertices
[
0
]
)
;
m
prev
vertex
.
set
(
m
vertices
[
m
count
-
2
]
)
;
m
next
vertex
.
set
(
m
vertices
[
1
]
)
;
m
has
prev
vertex
=
true
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
%END%
%END%
(7.00e-01)
vertex
(6.38e-02)
%UNK%
(1.12e-02)
vertices
(9.64e-03)
count
(8.92e-03)
2
(8.47e-03)
prev
(7.46e-03)
i
(6.67e-03)
m
(6.40e-03)
1
(5.69e-03)
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
3
)
;
m
count
=
count
+
1
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
vertices
[
count
]
=
new
vec
2
(
m
vertices
[
0
]
)
;
m
prev
vertex
.
set
(
m
vertices
[
m
count
-
2
]
)
;
m
next
vertex
.
set
(
m
vertices
[
1
]
)
;
m
has
prev
vertex
=
true
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
3
)
;
m
count
=
count
+
1
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
vertices
[
count
]
=
new
vec
2
(
m
vertices
[
0
]
)
;
m
prev
vertex
.
set
(
m
vertices
[
m
count
-
2
]
)
;
m
next
vertex
.
set
(
m
vertices
[
1
]
)
;
m
has
prev
vertex
=
true
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
create,chain
create
set
(3.09e-01)
get
(1.39e-01)
add
(5.62e-02)
%UNK%
(4.99e-02)
%END%
(2.70e-02)
find
(1.99e-02)
create
(1.54e-02)
clear
(1.53e-02)
vertex
(1.40e-02)
update
(1.39e-02)
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
2
)
;
m
count
=
count
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
m
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
m
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
has
prev
vertex
=
false
;
m
has
next
vertex
=
false
;
m
prev
vertex
.
set
zero
(
)
;
m
next
vertex
.
set
zero
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
2
)
;
m
count
=
count
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
m
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
m
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
has
prev
vertex
=
false
;
m
has
next
vertex
=
false
;
m
prev
vertex
.
set
zero
(
)
;
m
next
vertex
.
set
zero
(
)
;
}
<SENTENCE_END/>
chain
%END%
(5.46e-01)
prev
(5.61e-02)
vertex
(4.26e-02)
next
(2.96e-02)
%UNK%
(1.74e-02)
vertices
(1.29e-02)
m
(1.22e-02)
v
(9.52e-03)
2
(9.42e-03)
count
(8.37e-03)
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
2
)
;
m
count
=
count
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
m
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
m
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
has
prev
vertex
=
false
;
m
has
next
vertex
=
false
;
m
prev
vertex
.
set
zero
(
)
;
m
next
vertex
.
set
zero
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
2
)
;
m
count
=
count
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
m
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
m
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
has
prev
vertex
=
false
;
m
has
next
vertex
=
false
;
m
prev
vertex
.
set
zero
(
)
;
m
next
vertex
.
set
zero
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(6.40e-01)
vertex
(1.05e-01)
prev
(1.96e-02)
count
(9.59e-03)
i
(9.51e-03)
m
(9.35e-03)
2
(8.61e-03)
%UNK%
(7.46e-03)
vertices
(7.26e-03)
1
(6.85e-03)
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
2
)
;
m
count
=
count
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
m
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
m
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
has
prev
vertex
=
false
;
m
has
next
vertex
=
false
;
m
prev
vertex
.
set
zero
(
)
;
m
next
vertex
.
set
zero
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
vertices
==
null
&&
m
count
==
0
)
;
assert
(
count
>=
2
)
;
m
count
=
count
;
m
vertices
=
new
vec
2
[
m
count
]
;
for
(
int
i
=
1
;
i
<
m
count
;
i
++
)
{
vec
2
v
1
=
vertices
[
i
-
1
]
;
vec
2
v
2
=
vertices
[
i
]
;
if
(
math
utils
.
distance
squared
(
v
1
,
v
2
)
<
settings
.
linear
slop
*
settings
.
linear
slop
)
{
throw
new
runtime
exception
(
"Vertices of chain shape are too close together"
)
;
}
}
for
(
int
i
=
0
;
i
<
m
count
;
i
++
)
{
m
vertices
[
i
]
=
new
vec
2
(
vertices
[
i
]
)
;
}
m
has
prev
vertex
=
false
;
m
has
next
vertex
=
false
;
m
prev
vertex
.
set
zero
(
)
;
m
next
vertex
.
set
zero
(
)
;
}
<SENTENCE_END/>
set,prev,vertex
set
set
(9.83e-01)
prev
(5.41e-03)
vertex
(2.68e-03)
m
(2.28e-03)
has
(1.51e-03)
get
(3.17e-04)
add
(2.79e-04)
load
(1.07e-04)
true
(1.05e-04)
reset
(8.20e-05)
<SENTENCE_START>
{
m
prev
vertex
.
set
(
prev
vertex
)
;
m
has
prev
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
m
prev
vertex
.
set
(
prev
vertex
)
;
m
has
prev
vertex
=
true
;
}
<SENTENCE_END/>
prev
prev
(8.17e-01)
vertex
(1.65e-01)
%END%
(9.11e-03)
set
(6.20e-03)
has
(8.23e-04)
m
(7.31e-04)
particles
(4.47e-05)
data
(3.98e-05)
vertices
(3.83e-05)
next
(3.61e-05)
<SENTENCE_START>
{
m
prev
vertex
.
set
(
prev
vertex
)
;
m
has
prev
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
m
prev
vertex
.
set
(
prev
vertex
)
;
m
has
prev
vertex
=
true
;
}
<SENTENCE_END/>
vertex
vertex
(9.14e-01)
%END%
(2.93e-02)
prev
(1.47e-02)
set
(3.04e-04)
has
(7.41e-05)
m
(5.65e-05)
true
(3.35e-05)
%UNK%
(1.63e-05)
data
(1.33e-05)
actor
(1.01e-05)
<SENTENCE_START>
{
m
prev
vertex
.
set
(
prev
vertex
)
;
m
has
prev
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
m
prev
vertex
.
set
(
prev
vertex
)
;
m
has
prev
vertex
=
true
;
}
<SENTENCE_END/>
%END%
%END%
(9.31e-01)
vertex
(3.43e-02)
set
(2.72e-03)
prev
(4.32e-04)
true
(2.17e-04)
value
(1.29e-04)
all
(9.70e-05)
m
(9.59e-05)
count
(8.11e-05)
performed
(7.67e-05)
<SENTENCE_START>
{
m
prev
vertex
.
set
(
prev
vertex
)
;
m
has
prev
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
m
prev
vertex
.
set
(
prev
vertex
)
;
m
has
prev
vertex
=
true
;
}
<SENTENCE_END/>
set,next,vertex
set
set
(9.23e-01)
reset
(3.01e-02)
next
(1.86e-02)
find
(8.55e-03)
vertex
(5.06e-03)
clear
(1.97e-03)
has
(1.81e-03)
get
(1.80e-03)
draw
(1.43e-03)
m
(1.31e-03)
<SENTENCE_START>
{
m
next
vertex
.
set
(
next
vertex
)
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
m
next
vertex
.
set
(
next
vertex
)
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
next
next
(5.28e-01)
vertex
(4.68e-01)
%END%
(1.81e-03)
m
(3.26e-04)
find
(2.91e-04)
has
(1.80e-04)
right
(4.56e-05)
reset
(4.35e-05)
vertices
(3.91e-05)
under
(3.62e-05)
<SENTENCE_START>
{
m
next
vertex
.
set
(
next
vertex
)
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
m
next
vertex
.
set
(
next
vertex
)
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
vertex
vertex
(8.15e-01)
%END%
(8.60e-02)
next
(3.11e-02)
set
(4.08e-04)
has
(2.27e-04)
token
(1.68e-04)
valid
(8.33e-05)
down
(8.09e-05)
true
(7.46e-05)
count
(7.38e-05)
<SENTENCE_START>
{
m
next
vertex
.
set
(
next
vertex
)
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
m
next
vertex
.
set
(
next
vertex
)
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
%END%
%END%
(9.31e-01)
vertex
(3.06e-02)
next
(8.06e-03)
set
(2.12e-03)
token
(2.73e-04)
valid
(2.53e-04)
array
(2.48e-04)
value
(2.16e-04)
true
(1.95e-04)
count
(1.84e-04)
<SENTENCE_START>
{
m
next
vertex
.
set
(
next
vertex
)
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
m
next
vertex
.
set
(
next
vertex
)
;
m
has
next
vertex
=
true
;
}
<SENTENCE_END/>
get
get
get
(8.54e-01)
length
(2.21e-02)
add
(1.55e-02)
to
(1.46e-02)
random
(9.40e-03)
ensure
(6.64e-03)
append
(6.63e-03)
wrap
(4.39e-03)
is
(4.22e-03)
put
(3.97e-03)
<SENTENCE_START>
{
assert
(
arg
length
>
0
)
;
if
(
!
map
.
contains
key
(
arg
length
)
)
{
map
.
put
(
arg
length
,
get
initialized
array
(
arg
length
)
)
;
}
assert
(
map
.
%SELF%
(
arg
length
)
.
length
==
arg
length
)
:
"Array not built of correct length"
;
return
map
.
%SELF%
(
arg
length
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
arg
length
>
0
)
;
if
(
!
map
.
contains
key
(
arg
length
)
)
{
map
.
put
(
arg
length
,
get
initialized
array
(
arg
length
)
)
;
}
assert
(
map
.
%SELF%
(
arg
length
)
.
length
==
arg
length
)
:
"Array not built of correct length"
;
return
map
.
%SELF%
(
arg
length
)
;
}
<SENTENCE_END/>
%END%
%END%
(3.63e-01)
initialized
(1.10e-01)
to
(1.08e-01)
length
(9.75e-02)
get
(2.24e-02)
all
(2.16e-02)
array
(2.12e-02)
map
(1.28e-02)
string
(9.84e-03)
arg
(8.39e-03)
<SENTENCE_START>
{
assert
(
arg
length
>
0
)
;
if
(
!
map
.
contains
key
(
arg
length
)
)
{
map
.
put
(
arg
length
,
get
initialized
array
(
arg
length
)
)
;
}
assert
(
map
.
%SELF%
(
arg
length
)
.
length
==
arg
length
)
:
"Array not built of correct length"
;
return
map
.
%SELF%
(
arg
length
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
arg
length
>
0
)
;
if
(
!
map
.
contains
key
(
arg
length
)
)
{
map
.
put
(
arg
length
,
get
initialized
array
(
arg
length
)
)
;
}
assert
(
map
.
%SELF%
(
arg
length
)
.
length
==
arg
length
)
:
"Array not built of correct length"
;
return
map
.
%SELF%
(
arg
length
)
;
}
<SENTENCE_END/>
get,initialized,array
get
get
(8.20e-01)
new
(5.90e-02)
length
(3.35e-02)
append
(1.63e-02)
random
(1.28e-02)
put
(9.35e-03)
declared
(6.25e-03)
peek
(4.06e-03)
as
(3.27e-03)
ensure
(3.25e-03)
<SENTENCE_START>
{
return
new
int
[
arg
length
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
int
[
arg
length
]
;
}
<SENTENCE_END/>
initialized
%END%
(8.18e-01)
value
(2.25e-02)
int
(1.28e-02)
array
(1.16e-02)
buffer
(9.24e-03)
length
(6.37e-03)
byte
(5.86e-03)
new
(4.86e-03)
bytes
(4.48e-03)
string
(4.39e-03)
<SENTENCE_START>
{
return
new
int
[
arg
length
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
int
[
arg
length
]
;
}
<SENTENCE_END/>
array
%END%
(9.07e-01)
value
(1.55e-02)
length
(6.94e-03)
int
(6.08e-03)
array
(5.41e-03)
buffer
(4.76e-03)
byte
(2.90e-03)
double
(2.43e-03)
float
(2.05e-03)
string
(1.83e-03)
<SENTENCE_START>
{
return
new
int
[
arg
length
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
int
[
arg
length
]
;
}
<SENTENCE_END/>
%END%
%END%
(9.64e-01)
value
(8.41e-03)
length
(3.35e-03)
array
(1.52e-03)
buffer
(1.21e-03)
int
(1.02e-03)
20
(9.77e-04)
only
(8.72e-04)
byte
(8.61e-04)
double
(7.68e-04)
<SENTENCE_START>
{
return
new
int
[
arg
length
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
new
int
[
arg
length
]
;
}
<SENTENCE_END/>
is
is
is
(9.60e-01)
get
(7.95e-03)
type
(6.08e-03)
%END%
(1.88e-03)
enable
(1.41e-03)
assignable
(1.37e-03)
mask
(1.21e-03)
default
(1.12e-03)
equals
(1.09e-03)
instance
(1.03e-03)
<SENTENCE_START>
{
return
(
mask
&
type
)
==
mask
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
mask
&
type
)
==
mask
;
}
<SENTENCE_END/>
%END%
%END%
(9.74e-01)
type
(8.48e-03)
mask
(4.66e-03)
and
(5.79e-04)
by
(4.32e-04)
object
(3.53e-04)
array
(3.20e-04)
is
(2.36e-04)
string
(2.09e-04)
of
(1.92e-04)
<SENTENCE_START>
{
return
(
mask
&
type
)
==
mask
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
(
mask
&
type
)
==
mask
;
}
<SENTENCE_END/>
send,down,up,key,event,for,backward,compatibility
send
touch
(1.74e-01)
key
(9.44e-02)
post
(8.31e-02)
event
(8.03e-02)
initialize
(6.76e-02)
setup
(6.10e-02)
down
(5.80e-02)
cancel
(3.27e-02)
zoom
(2.69e-02)
update
(2.10e-02)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
down
%END%
(1.57e-01)
down
(1.31e-01)
key
(1.28e-01)
event
(6.79e-02)
touch
(4.83e-02)
initialize
(3.52e-02)
setup
(2.98e-02)
%UNK%
(2.89e-02)
pressed
(1.90e-02)
cancel
(1.57e-02)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
up
%END%
(4.07e-01)
event
(1.49e-01)
key
(6.92e-02)
down
(4.94e-02)
%UNK%
(2.14e-02)
time
(1.90e-02)
touch
(1.45e-02)
initialize
(1.09e-02)
setup
(9.13e-03)
millis
(8.97e-03)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
key
%END%
(7.34e-01)
key
(3.35e-02)
down
(3.08e-02)
event
(2.24e-02)
%UNK%
(1.58e-02)
pressed
(5.59e-03)
components
(5.58e-03)
millis
(5.04e-03)
initialize
(4.90e-03)
time
(4.33e-03)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
event
%END%
(7.42e-01)
key
(3.38e-02)
down
(3.10e-02)
event
(1.88e-02)
%UNK%
(1.54e-02)
pressed
(5.60e-03)
components
(5.49e-03)
initialize
(4.77e-03)
millis
(4.14e-03)
setup
(3.81e-03)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
for
%END%
(7.43e-01)
key
(3.37e-02)
down
(3.10e-02)
event
(1.88e-02)
%UNK%
(1.54e-02)
pressed
(5.60e-03)
components
(5.49e-03)
initialize
(4.76e-03)
millis
(4.14e-03)
setup
(3.81e-03)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
backward
%END%
(7.42e-01)
key
(3.38e-02)
down
(3.10e-02)
event
(1.88e-02)
%UNK%
(1.54e-02)
pressed
(5.61e-03)
components
(5.49e-03)
initialize
(4.76e-03)
millis
(4.15e-03)
setup
(3.81e-03)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
compatibility
%END%
(7.41e-01)
key
(3.41e-02)
down
(3.14e-02)
event
(1.87e-02)
%UNK%
(1.55e-02)
pressed
(5.66e-03)
components
(5.52e-03)
initialize
(4.84e-03)
millis
(4.10e-03)
setup
(3.87e-03)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.40e-01)
key
(3.41e-02)
down
(3.13e-02)
event
(1.89e-02)
%UNK%
(1.55e-02)
pressed
(5.65e-03)
components
(5.52e-03)
initialize
(4.84e-03)
millis
(4.19e-03)
setup
(3.88e-03)
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
long
event
time
=
system
clock
.
uptime
millis
(
)
;
super
.
send
key
event
(
new
key
event
(
event
time
,
event
time
,
key
event
.
action
down
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
super
.
send
key
event
(
new
key
event
(
system
clock
.
uptime
millis
(
)
,
event
time
,
key
event
.
action
up
,
code
,
0
,
0
,
key
character
map
.
virtual
keyboard
,
0
,
key
event
.
flag
soft
keyboard
|
key
event
.
flag
keep
touch
mode
)
)
;
}
<SENTENCE_END/>
init
init
init
(5.95e-01)
set
(2.64e-01)
initialize
(1.48e-02)
setup
(1.44e-02)
create
(9.77e-03)
main
(7.13e-03)
%UNK%
(6.14e-03)
config
(5.59e-03)
print
(4.00e-03)
load
(3.96e-03)
<SENTENCE_START>
{
if
(
translucent
)
{
this
.
get
holder
(
)
.
set
format
(
pixel
format
.
translucent
)
;
}
set
egl
context
factory
(
new
context
factory
(
)
)
;
set
egl
config
chooser
(
translucent
?
new
config
chooser
(
8
,
8
,
8
,
8
,
depth
,
stencil
)
:
new
config
chooser
(
5
,
6
,
5
,
0
,
depth
,
stencil
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
translucent
)
{
this
.
get
holder
(
)
.
set
format
(
pixel
format
.
translucent
)
;
}
set
egl
context
factory
(
new
context
factory
(
)
)
;
set
egl
config
chooser
(
translucent
?
new
config
chooser
(
8
,
8
,
8
,
8
,
depth
,
stencil
)
:
new
config
chooser
(
5
,
6
,
5
,
0
,
depth
,
stencil
)
)
;
}
<SENTENCE_END/>
%END%
%END%
(5.34e-01)
egl
(1.46e-01)
config
(4.76e-02)
%UNK%
(3.58e-02)
init
(1.99e-02)
context
(1.27e-02)
main
(9.31e-03)
set
(8.01e-03)
holder
(7.82e-03)
create
(6.72e-03)
<SENTENCE_START>
{
if
(
translucent
)
{
this
.
get
holder
(
)
.
set
format
(
pixel
format
.
translucent
)
;
}
set
egl
context
factory
(
new
context
factory
(
)
)
;
set
egl
config
chooser
(
translucent
?
new
config
chooser
(
8
,
8
,
8
,
8
,
depth
,
stencil
)
:
new
config
chooser
(
5
,
6
,
5
,
0
,
depth
,
stencil
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
translucent
)
{
this
.
get
holder
(
)
.
set
format
(
pixel
format
.
translucent
)
;
}
set
egl
context
factory
(
new
context
factory
(
)
)
;
set
egl
config
chooser
(
translucent
?
new
config
chooser
(
8
,
8
,
8
,
8
,
depth
,
stencil
)
:
new
config
chooser
(
5
,
6
,
5
,
0
,
depth
,
stencil
)
)
;
}
<SENTENCE_END/>
create,context
create
create
(8.66e-01)
context
(3.36e-02)
egl
(2.23e-02)
run
(1.18e-02)
make
(6.50e-03)
attrib
(3.34e-03)
set
(3.09e-03)
check
(2.81e-03)
list
(2.50e-03)
main
(2.31e-03)
<SENTENCE_START>
{
log
.
w
(
tag
,
"creating OpenGL ES 2.0 context"
)
;
check
egl
error
(
"Before eglCreateContext"
,
egl
)
;
int
[
]
attrib
list
=
{
egl
context
client
version
,
2
,
egl
10
.
egl
none
}
;
egl
context
context
=
egl
.
egl
create
context
(
display
,
egl
config
,
egl
10
.
egl
no
context
,
attrib
list
)
;
check
egl
error
(
"After eglCreateContext"
,
egl
)
;
return
context
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
log
.
w
(
tag
,
"creating OpenGL ES 2.0 context"
)
;
check
egl
error
(
"Before eglCreateContext"
,
egl
)
;
int
[
]
attrib
list
=
{
egl
context
client
version
,
2
,
egl
10
.
egl
none
}
;
egl
context
context
=
egl
.
egl
create
context
(
display
,
egl
config
,
egl
10
.
egl
no
context
,
attrib
list
)
;
check
egl
error
(
"After eglCreateContext"
,
egl
)
;
return
context
;
}
<SENTENCE_END/>
context
context
(5.94e-01)
%END%
(1.82e-01)
egl
(8.47e-02)
create
(2.34e-02)
attrib
(9.59e-03)
display
(6.78e-03)
list
(2.86e-03)
client
(2.83e-03)
10
(2.79e-03)
no
(2.18e-03)
<SENTENCE_START>
{
log
.
w
(
tag
,
"creating OpenGL ES 2.0 context"
)
;
check
egl
error
(
"Before eglCreateContext"
,
egl
)
;
int
[
]
attrib
list
=
{
egl
context
client
version
,
2
,
egl
10
.
egl
none
}
;
egl
context
context
=
egl
.
egl
create
context
(
display
,
egl
config
,
egl
10
.
egl
no
context
,
attrib
list
)
;
check
egl
error
(
"After eglCreateContext"
,
egl
)
;
return
context
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
log
.
w
(
tag
,
"creating OpenGL ES 2.0 context"
)
;
check
egl
error
(
"Before eglCreateContext"
,
egl
)
;
int
[
]
attrib
list
=
{
egl
context
client
version
,
2
,
egl
10
.
egl
none
}
;
egl
context
context
=
egl
.
egl
create
context
(
display
,
egl
config
,
egl
10
.
egl
no
context
,
attrib
list
)
;
check
egl
error
(
"After eglCreateContext"
,
egl
)
;
return
context
;
}
<SENTENCE_END/>
%END%
%END%
(7.10e-01)
context
(1.57e-01)
egl
(3.86e-02)
list
(1.51e-02)
error
(9.17e-03)
create
(7.92e-03)
attrib
(7.33e-03)
client
(6.95e-03)
display
(4.62e-03)
10
(3.79e-03)
<SENTENCE_START>
{
log
.
w
(
tag
,
"creating OpenGL ES 2.0 context"
)
;
check
egl
error
(
"Before eglCreateContext"
,
egl
)
;
int
[
]
attrib
list
=
{
egl
context
client
version
,
2
,
egl
10
.
egl
none
}
;
egl
context
context
=
egl
.
egl
create
context
(
display
,
egl
config
,
egl
10
.
egl
no
context
,
attrib
list
)
;
check
egl
error
(
"After eglCreateContext"
,
egl
)
;
return
context
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
log
.
w
(
tag
,
"creating OpenGL ES 2.0 context"
)
;
check
egl
error
(
"Before eglCreateContext"
,
egl
)
;
int
[
]
attrib
list
=
{
egl
context
client
version
,
2
,
egl
10
.
egl
none
}
;
egl
context
context
=
egl
.
egl
create
context
(
display
,
egl
config
,
egl
10
.
egl
no
context
,
attrib
list
)
;
check
egl
error
(
"After eglCreateContext"
,
egl
)
;
return
context
;
}
<SENTENCE_END/>
destroy,context
destroy
destroy
(9.62e-01)
context
(2.15e-02)
egl
(7.93e-03)
display
(1.25e-03)
window
(1.51e-04)
create
(1.11e-04)
finish
(6.49e-05)
on
(5.63e-05)
stop
(4.48e-05)
fixture
(3.95e-05)
<SENTENCE_START>
{
egl
.
egl
destroy
context
(
display
,
context
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
egl
.
egl
destroy
context
(
display
,
context
)
;
}
<SENTENCE_END/>
context
context
(9.56e-01)
%END%
(1.43e-02)
destroy
(1.40e-02)
egl
(1.36e-03)
locked
(4.92e-04)
display
(4.25e-04)
finish
(1.33e-04)
imp
(9.72e-05)
fixture
(2.33e-05)
lock
(2.07e-05)
<SENTENCE_START>
{
egl
.
egl
destroy
context
(
display
,
context
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
egl
.
egl
destroy
context
(
display
,
context
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.53e-01)
context
(2.48e-02)
egl
(1.24e-02)
locked
(2.13e-03)
display
(1.21e-03)
destroy
(3.51e-04)
imp
(1.43e-04)
fv
(6.16e-05)
and
(3.19e-05)
try
(2.80e-05)
<SENTENCE_START>
{
egl
.
egl
destroy
context
(
display
,
context
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
egl
.
egl
destroy
context
(
display
,
context
)
;
}
<SENTENCE_END/>
check,egl,error
check
check
(6.56e-01)
print
(1.25e-01)
error
(5.10e-02)
egl
(2.54e-02)
run
(2.13e-02)
create
(1.64e-02)
log
(1.56e-02)
set
(9.39e-03)
%UNK%
(7.57e-03)
get
(4.21e-03)
<SENTENCE_START>
{
int
error
;
while
(
(
error
=
egl
.
egl
get
error
(
)
)
!=
egl
10
.
egl
success
)
{
log
.
e
(
tag
,
string
.
format
(
"%s: EGL error: 0x%x"
,
prompt
,
error
)
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
error
;
while
(
(
error
=
egl
.
egl
get
error
(
)
)
!=
egl
10
.
egl
success
)
{
log
.
e
(
tag
,
string
.
format
(
"%s: EGL error: 0x%x"
,
prompt
,
error
)
)
;
}
}
<SENTENCE_END/>
egl
%END%
(5.40e-01)
egl
(1.58e-01)
log
(3.74e-02)
check
(3.14e-02)
error
(2.84e-02)
%UNK%
(2.29e-02)
print
(2.02e-02)
equal
(1.55e-02)
unsafe
(5.27e-03)
string
(5.05e-03)
<SENTENCE_START>
{
int
error
;
while
(
(
error
=
egl
.
egl
get
error
(
)
)
!=
egl
10
.
egl
success
)
{
log
.
e
(
tag
,
string
.
format
(
"%s: EGL error: 0x%x"
,
prompt
,
error
)
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
error
;
while
(
(
error
=
egl
.
egl
get
error
(
)
)
!=
egl
10
.
egl
success
)
{
log
.
e
(
tag
,
string
.
format
(
"%s: EGL error: 0x%x"
,
prompt
,
error
)
)
;
}
}
<SENTENCE_END/>
error
%END%
(9.07e-01)
error
(3.26e-02)
egl
(9.29e-03)
get
(5.83e-03)
while
(5.26e-03)
equal
(2.99e-03)
log
(2.71e-03)
%UNK%
(2.35e-03)
string
(1.80e-03)
and
(1.23e-03)
<SENTENCE_START>
{
int
error
;
while
(
(
error
=
egl
.
egl
get
error
(
)
)
!=
egl
10
.
egl
success
)
{
log
.
e
(
tag
,
string
.
format
(
"%s: EGL error: 0x%x"
,
prompt
,
error
)
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
error
;
while
(
(
error
=
egl
.
egl
get
error
(
)
)
!=
egl
10
.
egl
success
)
{
log
.
e
(
tag
,
string
.
format
(
"%s: EGL error: 0x%x"
,
prompt
,
error
)
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(9.40e-01)
error
(2.48e-02)
get
(5.84e-03)
egl
(4.06e-03)
while
(2.20e-03)
equal
(1.63e-03)
log
(1.30e-03)
string
(1.05e-03)
%UNK%
(9.50e-04)
at
(8.06e-04)
<SENTENCE_START>
{
int
error
;
while
(
(
error
=
egl
.
egl
get
error
(
)
)
!=
egl
10
.
egl
success
)
{
log
.
e
(
tag
,
string
.
format
(
"%s: EGL error: 0x%x"
,
prompt
,
error
)
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
error
;
while
(
(
error
=
egl
.
egl
get
error
(
)
)
!=
egl
10
.
egl
success
)
{
log
.
e
(
tag
,
string
.
format
(
"%s: EGL error: 0x%x"
,
prompt
,
error
)
)
;
}
}
<SENTENCE_END/>
choose,config
choose
choose
(9.00e-01)
egl
(2.47e-02)
config
(1.66e-02)
configs
(9.53e-03)
num
(5.15e-03)
print
(2.99e-03)
display
(2.67e-03)
attribs
(1.42e-03)
s
(1.24e-03)
new
(1.23e-03)
<SENTENCE_START>
{
int
[
]
num
config
=
new
int
[
1
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
null
,
0
,
num
config
)
;
int
num
configs
=
num
config
[
0
]
;
if
(
num
configs
<=
0
)
{
throw
new
illegal
argument
exception
(
"No configs match configSpec"
)
;
}
egl
config
[
]
configs
=
new
egl
config
[
num
configs
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
configs
,
num
configs
,
num
config
)
;
if
(
debug
)
{
print
configs
(
egl
,
display
,
configs
)
;
}
return
%SELF%
(
egl
,
display
,
configs
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
[
]
num
config
=
new
int
[
1
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
null
,
0
,
num
config
)
;
int
num
configs
=
num
config
[
0
]
;
if
(
num
configs
<=
0
)
{
throw
new
illegal
argument
exception
(
"No configs match configSpec"
)
;
}
egl
config
[
]
configs
=
new
egl
config
[
num
configs
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
configs
,
num
configs
,
num
config
)
;
if
(
debug
)
{
print
configs
(
egl
,
display
,
configs
)
;
}
return
%SELF%
(
egl
,
display
,
configs
)
;
}
<SENTENCE_END/>
config
%END%
(3.11e-01)
config
(2.08e-01)
choose
(1.92e-01)
configs
(1.05e-01)
egl
(4.08e-02)
num
(1.63e-02)
print
(1.24e-02)
display
(9.97e-03)
debug
(3.07e-03)
%UNK%
(2.47e-03)
<SENTENCE_START>
{
int
[
]
num
config
=
new
int
[
1
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
null
,
0
,
num
config
)
;
int
num
configs
=
num
config
[
0
]
;
if
(
num
configs
<=
0
)
{
throw
new
illegal
argument
exception
(
"No configs match configSpec"
)
;
}
egl
config
[
]
configs
=
new
egl
config
[
num
configs
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
configs
,
num
configs
,
num
config
)
;
if
(
debug
)
{
print
configs
(
egl
,
display
,
configs
)
;
}
return
%SELF%
(
egl
,
display
,
configs
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
[
]
num
config
=
new
int
[
1
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
null
,
0
,
num
config
)
;
int
num
configs
=
num
config
[
0
]
;
if
(
num
configs
<=
0
)
{
throw
new
illegal
argument
exception
(
"No configs match configSpec"
)
;
}
egl
config
[
]
configs
=
new
egl
config
[
num
configs
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
configs
,
num
configs
,
num
config
)
;
if
(
debug
)
{
print
configs
(
egl
,
display
,
configs
)
;
}
return
%SELF%
(
egl
,
display
,
configs
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.16e-01)
config
(3.36e-02)
choose
(9.31e-03)
configs
(7.49e-03)
egl
(2.65e-03)
display
(2.50e-03)
num
(1.74e-03)
string
(1.02e-03)
%UNK%
(7.58e-04)
and
(6.87e-04)
<SENTENCE_START>
{
int
[
]
num
config
=
new
int
[
1
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
null
,
0
,
num
config
)
;
int
num
configs
=
num
config
[
0
]
;
if
(
num
configs
<=
0
)
{
throw
new
illegal
argument
exception
(
"No configs match configSpec"
)
;
}
egl
config
[
]
configs
=
new
egl
config
[
num
configs
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
configs
,
num
configs
,
num
config
)
;
if
(
debug
)
{
print
configs
(
egl
,
display
,
configs
)
;
}
return
%SELF%
(
egl
,
display
,
configs
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
[
]
num
config
=
new
int
[
1
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
null
,
0
,
num
config
)
;
int
num
configs
=
num
config
[
0
]
;
if
(
num
configs
<=
0
)
{
throw
new
illegal
argument
exception
(
"No configs match configSpec"
)
;
}
egl
config
[
]
configs
=
new
egl
config
[
num
configs
]
;
egl
.
egl
choose
config
(
display
,
s
config
attribs
2
,
configs
,
num
configs
,
num
config
)
;
if
(
debug
)
{
print
configs
(
egl
,
display
,
configs
)
;
}
return
%SELF%
(
egl
,
display
,
configs
)
;
}
<SENTENCE_END/>
choose,config
choose
find
(5.29e-01)
choose
(4.05e-01)
config
(1.40e-02)
egl
(6.48e-03)
attrib
(5.14e-03)
size
(1.85e-03)
display
(1.66e-03)
create
(1.65e-03)
%UNK%
(1.40e-03)
10
(1.28e-03)
<SENTENCE_START>
{
for
(
egl
config
config
:
configs
)
{
int
d
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
depth
size
,
0
)
;
int
s
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
stencil
size
,
0
)
;
if
(
d
<
m
depth
size
||
s
<
m
stencil
size
)
continue
;
int
r
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
red
size
,
0
)
;
int
g
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
green
size
,
0
)
;
int
b
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
blue
size
,
0
)
;
int
a
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
alpha
size
,
0
)
;
if
(
r
==
m
red
size
&&
g
==
m
green
size
&&
b
==
m
blue
size
&&
a
==
m
alpha
size
)
return
config
;
}
return
null
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
egl
config
config
:
configs
)
{
int
d
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
depth
size
,
0
)
;
int
s
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
stencil
size
,
0
)
;
if
(
d
<
m
depth
size
||
s
<
m
stencil
size
)
continue
;
int
r
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
red
size
,
0
)
;
int
g
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
green
size
,
0
)
;
int
b
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
blue
size
,
0
)
;
int
a
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
alpha
size
,
0
)
;
if
(
r
==
m
red
size
&&
g
==
m
green
size
&&
b
==
m
blue
size
&&
a
==
m
alpha
size
)
return
config
;
}
return
null
;
}
<SENTENCE_END/>
config
config
(3.71e-01)
%END%
(2.37e-01)
choose
(8.26e-02)
attrib
(4.87e-02)
find
(3.40e-02)
egl
(2.53e-02)
%UNK%
(2.28e-02)
display
(8.13e-03)
size
(5.95e-03)
create
(4.48e-03)
<SENTENCE_START>
{
for
(
egl
config
config
:
configs
)
{
int
d
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
depth
size
,
0
)
;
int
s
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
stencil
size
,
0
)
;
if
(
d
<
m
depth
size
||
s
<
m
stencil
size
)
continue
;
int
r
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
red
size
,
0
)
;
int
g
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
green
size
,
0
)
;
int
b
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
blue
size
,
0
)
;
int
a
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
alpha
size
,
0
)
;
if
(
r
==
m
red
size
&&
g
==
m
green
size
&&
b
==
m
blue
size
&&
a
==
m
alpha
size
)
return
config
;
}
return
null
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
egl
config
config
:
configs
)
{
int
d
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
depth
size
,
0
)
;
int
s
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
stencil
size
,
0
)
;
if
(
d
<
m
depth
size
||
s
<
m
stencil
size
)
continue
;
int
r
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
red
size
,
0
)
;
int
g
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
green
size
,
0
)
;
int
b
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
blue
size
,
0
)
;
int
a
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
alpha
size
,
0
)
;
if
(
r
==
m
red
size
&&
g
==
m
green
size
&&
b
==
m
blue
size
&&
a
==
m
alpha
size
)
return
config
;
}
return
null
;
}
<SENTENCE_END/>
%END%
%END%
(6.49e-01)
attrib
(1.42e-01)
config
(4.29e-02)
egl
(1.58e-02)
choose
(1.07e-02)
%UNK%
(9.66e-03)
size
(6.81e-03)
find
(3.53e-03)
display
(2.56e-03)
10
(2.24e-03)
<SENTENCE_START>
{
for
(
egl
config
config
:
configs
)
{
int
d
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
depth
size
,
0
)
;
int
s
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
stencil
size
,
0
)
;
if
(
d
<
m
depth
size
||
s
<
m
stencil
size
)
continue
;
int
r
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
red
size
,
0
)
;
int
g
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
green
size
,
0
)
;
int
b
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
blue
size
,
0
)
;
int
a
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
alpha
size
,
0
)
;
if
(
r
==
m
red
size
&&
g
==
m
green
size
&&
b
==
m
blue
size
&&
a
==
m
alpha
size
)
return
config
;
}
return
null
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
egl
config
config
:
configs
)
{
int
d
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
depth
size
,
0
)
;
int
s
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
stencil
size
,
0
)
;
if
(
d
<
m
depth
size
||
s
<
m
stencil
size
)
continue
;
int
r
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
red
size
,
0
)
;
int
g
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
green
size
,
0
)
;
int
b
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
blue
size
,
0
)
;
int
a
=
find
config
attrib
(
egl
,
display
,
config
,
egl
10
.
egl
alpha
size
,
0
)
;
if
(
r
==
m
red
size
&&
g
==
m
green
size
&&
b
==
m
blue
size
&&
a
==
m
alpha
size
)
return
config
;
}
return
null
;
}
<SENTENCE_END/>
find,config,attrib
find
get
(9.20e-01)
config
(3.74e-02)
find
(2.28e-02)
attrib
(5.48e-03)
egl
(3.18e-03)
return
(1.99e-03)
default
(8.80e-04)
display
(6.85e-04)
m
(4.86e-04)
value
(3.56e-04)
<SENTENCE_START>
{
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
m
value
)
)
{
return
m
value
[
0
]
;
}
return
default
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
m
value
)
)
{
return
m
value
[
0
]
;
}
return
default
value
;
}
<SENTENCE_END/>
config
config
(9.72e-01)
attrib
(2.49e-02)
%END%
(2.25e-03)
%UNK%
(1.65e-04)
get
(1.61e-04)
find
(1.33e-04)
value
(1.01e-04)
choose
(8.11e-05)
default
(5.83e-05)
attribute
(3.75e-05)
<SENTENCE_START>
{
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
m
value
)
)
{
return
m
value
[
0
]
;
}
return
default
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
m
value
)
)
{
return
m
value
[
0
]
;
}
return
default
value
;
}
<SENTENCE_END/>
attrib
attrib
(9.52e-01)
%END%
(4.14e-02)
config
(1.94e-03)
value
(1.38e-04)
display
(4.70e-05)
default
(2.40e-05)
attribute
(2.20e-05)
%UNK%
(1.99e-05)
egl
(1.95e-05)
string
(1.33e-05)
<SENTENCE_START>
{
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
m
value
)
)
{
return
m
value
[
0
]
;
}
return
default
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
m
value
)
)
{
return
m
value
[
0
]
;
}
return
default
value
;
}
<SENTENCE_END/>
%END%
%END%
(7.92e-01)
attrib
(1.91e-01)
value
(1.01e-03)
config
(4.12e-04)
display
(3.01e-04)
attribute
(1.91e-04)
%UNK%
(1.89e-04)
string
(1.61e-04)
and
(1.32e-04)
egl
(9.98e-05)
<SENTENCE_START>
{
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
m
value
)
)
{
return
m
value
[
0
]
;
}
return
default
value
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
m
value
)
)
{
return
m
value
[
0
]
;
}
return
default
value
;
}
<SENTENCE_END/>
print,configs
print
print
(5.43e-01)
%UNK%
(6.31e-02)
set
(4.78e-02)
create
(3.40e-02)
setup
(2.14e-02)
load
(1.94e-02)
get
(1.94e-02)
convert
(1.48e-02)
init
(1.29e-02)
main
(1.08e-02)
<SENTENCE_START>
{
int
num
configs
=
configs
.
length
;
log
.
w
(
tag
,
string
.
format
(
"%d configurations"
,
num
configs
)
)
;
for
(
int
i
=
0
;
i
<
num
configs
;
i
++
)
{
log
.
w
(
tag
,
string
.
format
(
"Configuration %d: "
,
i
)
)
;
print
config
(
egl
,
display
,
configs
[
i
]
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
num
configs
=
configs
.
length
;
log
.
w
(
tag
,
string
.
format
(
"%d configurations"
,
num
configs
)
)
;
for
(
int
i
=
0
;
i
<
num
configs
;
i
++
)
{
log
.
w
(
tag
,
string
.
format
(
"Configuration %d: "
,
i
)
)
;
print
config
(
egl
,
display
,
configs
[
i
]
)
;
}
}
<SENTENCE_END/>
configs
configs
(6.76e-01)
%END%
(1.53e-01)
num
(5.14e-02)
egl
(8.78e-03)
tag
(6.19e-03)
string
(4.87e-03)
display
(4.87e-03)
%UNK%
(3.12e-03)
log
(2.27e-03)
print
(1.60e-03)
<SENTENCE_START>
{
int
num
configs
=
configs
.
length
;
log
.
w
(
tag
,
string
.
format
(
"%d configurations"
,
num
configs
)
)
;
for
(
int
i
=
0
;
i
<
num
configs
;
i
++
)
{
log
.
w
(
tag
,
string
.
format
(
"Configuration %d: "
,
i
)
)
;
print
config
(
egl
,
display
,
configs
[
i
]
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
num
configs
=
configs
.
length
;
log
.
w
(
tag
,
string
.
format
(
"%d configurations"
,
num
configs
)
)
;
for
(
int
i
=
0
;
i
<
num
configs
;
i
++
)
{
log
.
w
(
tag
,
string
.
format
(
"Configuration %d: "
,
i
)
)
;
print
config
(
egl
,
display
,
configs
[
i
]
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(8.96e-01)
configs
(2.09e-02)
string
(7.57e-03)
display
(3.59e-03)
%UNK%
(2.41e-03)
format
(2.13e-03)
num
(1.88e-03)
i
(1.73e-03)
at
(1.68e-03)
all
(1.61e-03)
<SENTENCE_START>
{
int
num
configs
=
configs
.
length
;
log
.
w
(
tag
,
string
.
format
(
"%d configurations"
,
num
configs
)
)
;
for
(
int
i
=
0
;
i
<
num
configs
;
i
++
)
{
log
.
w
(
tag
,
string
.
format
(
"Configuration %d: "
,
i
)
)
;
print
config
(
egl
,
display
,
configs
[
i
]
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
num
configs
=
configs
.
length
;
log
.
w
(
tag
,
string
.
format
(
"%d configurations"
,
num
configs
)
)
;
for
(
int
i
=
0
;
i
<
num
configs
;
i
++
)
{
log
.
w
(
tag
,
string
.
format
(
"Configuration %d: "
,
i
)
)
;
print
config
(
egl
,
display
,
configs
[
i
]
)
;
}
}
<SENTENCE_END/>
print,config
print
print
(3.95e-01)
%UNK%
(2.37e-01)
set
(4.63e-02)
egl
(2.09e-02)
create
(1.61e-02)
get
(1.51e-02)
%END%
(1.38e-02)
check
(1.15e-02)
main
(9.08e-03)
setup
(8.20e-03)
<SENTENCE_START>
{
int
[
]
attributes
=
{
egl
10
.
egl
buffer
size
,
egl
10
.
egl
alpha
size
,
egl
10
.
egl
blue
size
,
egl
10
.
egl
green
size
,
egl
10
.
egl
red
size
,
egl
10
.
egl
depth
size
,
egl
10
.
egl
stencil
size
,
egl
10
.
egl
config
caveat
,
egl
10
.
egl
config
id
,
egl
10
.
egl
level
,
egl
10
.
egl
max
pbuffer
height
,
egl
10
.
egl
max
pbuffer
pixels
,
egl
10
.
egl
max
pbuffer
width
,
egl
10
.
egl
native
renderable
,
egl
10
.
egl
native
visual
id
,
egl
10
.
egl
native
visual
type
,
0x3030
,
egl
10
.
egl
samples
,
egl
10
.
egl
sample
buffers
,
egl
10
.
egl
surface
type
,
egl
10
.
egl
transparent
type
,
egl
10
.
egl
transparent
red
value
,
egl
10
.
egl
transparent
green
value
,
egl
10
.
egl
transparent
blue
value
,
0x3039
,
0x303A
,
0x303B
,
0x303C
,
egl
10
.
egl
luminance
size
,
egl
10
.
egl
alpha
mask
size
,
egl
10
.
egl
color
buffer
type
,
egl
10
.
egl
renderable
type
,
0x3042
}
;
string
[
]
names
=
{
"EGL_BUFFER_SIZE"
,
"EGL_ALPHA_SIZE"
,
"EGL_BLUE_SIZE"
,
"EGL_GREEN_SIZE"
,
"EGL_RED_SIZE"
,
"EGL_DEPTH_SIZE"
,
"EGL_STENCIL_SIZE"
,
"EGL_CONFIG_CAVEAT"
,
"EGL_CONFIG_ID"
,
"EGL_LEVEL"
,
"EGL_MAX_PBUFFER_HEIGHT"
,
"EGL_MAX_PBUFFER_PIXELS"
,
"EGL_MAX_PBUFFER_WIDTH"
,
"EGL_NATIVE_RENDERABLE"
,
"EGL_NATIVE_VISUAL_ID"
,
"EGL_NATIVE_VISUAL_TYPE"
,
"EGL_PRESERVED_RESOURCES"
,
"EGL_SAMPLES"
,
"EGL_SAMPLE_BUFFERS"
,
"EGL_SURFACE_TYPE"
,
"EGL_TRANSPARENT_TYPE"
,
"EGL_TRANSPARENT_RED_VALUE"
,
"EGL_TRANSPARENT_GREEN_VALUE"
,
"EGL_TRANSPARENT_BLUE_VALUE"
,
"EGL_BIND_TO_TEXTURE_RGB"
,
"EGL_BIND_TO_TEXTURE_RGBA"
,
"EGL_MIN_SWAP_INTERVAL"
,
"EGL_MAX_SWAP_INTERVAL"
,
"EGL_LUMINANCE_SIZE"
,
"EGL_ALPHA_MASK_SIZE"
,
"EGL_COLOR_BUFFER_TYPE"
,
"EGL_RENDERABLE_TYPE"
,
"EGL_CONFORMANT"
}
;
int
[
]
value
=
new
int
[
1
]
;
for
(
int
i
=
0
;
i
<
attributes
.
length
;
i
++
)
{
int
attribute
=
attributes
[
i
]
;
string
name
=
names
[
i
]
;
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
value
)
)
{
log
.
w
(
tag
,
string
.
format
(
" %s: %d "
,
name
,
value
[
0
]
)
)
;
}
else
{
while
(
egl
.
egl
get
error
(
)
!=
egl
10
.
egl
success
)
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
[
]
attributes
=
{
egl
10
.
egl
buffer
size
,
egl
10
.
egl
alpha
size
,
egl
10
.
egl
blue
size
,
egl
10
.
egl
green
size
,
egl
10
.
egl
red
size
,
egl
10
.
egl
depth
size
,
egl
10
.
egl
stencil
size
,
egl
10
.
egl
config
caveat
,
egl
10
.
egl
config
id
,
egl
10
.
egl
level
,
egl
10
.
egl
max
pbuffer
height
,
egl
10
.
egl
max
pbuffer
pixels
,
egl
10
.
egl
max
pbuffer
width
,
egl
10
.
egl
native
renderable
,
egl
10
.
egl
native
visual
id
,
egl
10
.
egl
native
visual
type
,
0x3030
,
egl
10
.
egl
samples
,
egl
10
.
egl
sample
buffers
,
egl
10
.
egl
surface
type
,
egl
10
.
egl
transparent
type
,
egl
10
.
egl
transparent
red
value
,
egl
10
.
egl
transparent
green
value
,
egl
10
.
egl
transparent
blue
value
,
0x3039
,
0x303A
,
0x303B
,
0x303C
,
egl
10
.
egl
luminance
size
,
egl
10
.
egl
alpha
mask
size
,
egl
10
.
egl
color
buffer
type
,
egl
10
.
egl
renderable
type
,
0x3042
}
;
string
[
]
names
=
{
"EGL_BUFFER_SIZE"
,
"EGL_ALPHA_SIZE"
,
"EGL_BLUE_SIZE"
,
"EGL_GREEN_SIZE"
,
"EGL_RED_SIZE"
,
"EGL_DEPTH_SIZE"
,
"EGL_STENCIL_SIZE"
,
"EGL_CONFIG_CAVEAT"
,
"EGL_CONFIG_ID"
,
"EGL_LEVEL"
,
"EGL_MAX_PBUFFER_HEIGHT"
,
"EGL_MAX_PBUFFER_PIXELS"
,
"EGL_MAX_PBUFFER_WIDTH"
,
"EGL_NATIVE_RENDERABLE"
,
"EGL_NATIVE_VISUAL_ID"
,
"EGL_NATIVE_VISUAL_TYPE"
,
"EGL_PRESERVED_RESOURCES"
,
"EGL_SAMPLES"
,
"EGL_SAMPLE_BUFFERS"
,
"EGL_SURFACE_TYPE"
,
"EGL_TRANSPARENT_TYPE"
,
"EGL_TRANSPARENT_RED_VALUE"
,
"EGL_TRANSPARENT_GREEN_VALUE"
,
"EGL_TRANSPARENT_BLUE_VALUE"
,
"EGL_BIND_TO_TEXTURE_RGB"
,
"EGL_BIND_TO_TEXTURE_RGBA"
,
"EGL_MIN_SWAP_INTERVAL"
,
"EGL_MAX_SWAP_INTERVAL"
,
"EGL_LUMINANCE_SIZE"
,
"EGL_ALPHA_MASK_SIZE"
,
"EGL_COLOR_BUFFER_TYPE"
,
"EGL_RENDERABLE_TYPE"
,
"EGL_CONFORMANT"
}
;
int
[
]
value
=
new
int
[
1
]
;
for
(
int
i
=
0
;
i
<
attributes
.
length
;
i
++
)
{
int
attribute
=
attributes
[
i
]
;
string
name
=
names
[
i
]
;
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
value
)
)
{
log
.
w
(
tag
,
string
.
format
(
" %s: %d "
,
name
,
value
[
0
]
)
)
;
}
else
{
while
(
egl
.
egl
get
error
(
)
!=
egl
10
.
egl
success
)
;
}
}
}
<SENTENCE_END/>
config
config
(4.94e-01)
egl
(6.13e-02)
%END%
(5.84e-02)
attrib
(5.19e-02)
%UNK%
(4.76e-02)
visual
(3.75e-02)
print
(2.15e-02)
id
(1.75e-02)
10
(1.65e-02)
type
(9.71e-03)
<SENTENCE_START>
{
int
[
]
attributes
=
{
egl
10
.
egl
buffer
size
,
egl
10
.
egl
alpha
size
,
egl
10
.
egl
blue
size
,
egl
10
.
egl
green
size
,
egl
10
.
egl
red
size
,
egl
10
.
egl
depth
size
,
egl
10
.
egl
stencil
size
,
egl
10
.
egl
config
caveat
,
egl
10
.
egl
config
id
,
egl
10
.
egl
level
,
egl
10
.
egl
max
pbuffer
height
,
egl
10
.
egl
max
pbuffer
pixels
,
egl
10
.
egl
max
pbuffer
width
,
egl
10
.
egl
native
renderable
,
egl
10
.
egl
native
visual
id
,
egl
10
.
egl
native
visual
type
,
0x3030
,
egl
10
.
egl
samples
,
egl
10
.
egl
sample
buffers
,
egl
10
.
egl
surface
type
,
egl
10
.
egl
transparent
type
,
egl
10
.
egl
transparent
red
value
,
egl
10
.
egl
transparent
green
value
,
egl
10
.
egl
transparent
blue
value
,
0x3039
,
0x303A
,
0x303B
,
0x303C
,
egl
10
.
egl
luminance
size
,
egl
10
.
egl
alpha
mask
size
,
egl
10
.
egl
color
buffer
type
,
egl
10
.
egl
renderable
type
,
0x3042
}
;
string
[
]
names
=
{
"EGL_BUFFER_SIZE"
,
"EGL_ALPHA_SIZE"
,
"EGL_BLUE_SIZE"
,
"EGL_GREEN_SIZE"
,
"EGL_RED_SIZE"
,
"EGL_DEPTH_SIZE"
,
"EGL_STENCIL_SIZE"
,
"EGL_CONFIG_CAVEAT"
,
"EGL_CONFIG_ID"
,
"EGL_LEVEL"
,
"EGL_MAX_PBUFFER_HEIGHT"
,
"EGL_MAX_PBUFFER_PIXELS"
,
"EGL_MAX_PBUFFER_WIDTH"
,
"EGL_NATIVE_RENDERABLE"
,
"EGL_NATIVE_VISUAL_ID"
,
"EGL_NATIVE_VISUAL_TYPE"
,
"EGL_PRESERVED_RESOURCES"
,
"EGL_SAMPLES"
,
"EGL_SAMPLE_BUFFERS"
,
"EGL_SURFACE_TYPE"
,
"EGL_TRANSPARENT_TYPE"
,
"EGL_TRANSPARENT_RED_VALUE"
,
"EGL_TRANSPARENT_GREEN_VALUE"
,
"EGL_TRANSPARENT_BLUE_VALUE"
,
"EGL_BIND_TO_TEXTURE_RGB"
,
"EGL_BIND_TO_TEXTURE_RGBA"
,
"EGL_MIN_SWAP_INTERVAL"
,
"EGL_MAX_SWAP_INTERVAL"
,
"EGL_LUMINANCE_SIZE"
,
"EGL_ALPHA_MASK_SIZE"
,
"EGL_COLOR_BUFFER_TYPE"
,
"EGL_RENDERABLE_TYPE"
,
"EGL_CONFORMANT"
}
;
int
[
]
value
=
new
int
[
1
]
;
for
(
int
i
=
0
;
i
<
attributes
.
length
;
i
++
)
{
int
attribute
=
attributes
[
i
]
;
string
name
=
names
[
i
]
;
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
value
)
)
{
log
.
w
(
tag
,
string
.
format
(
" %s: %d "
,
name
,
value
[
0
]
)
)
;
}
else
{
while
(
egl
.
egl
get
error
(
)
!=
egl
10
.
egl
success
)
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
[
]
attributes
=
{
egl
10
.
egl
buffer
size
,
egl
10
.
egl
alpha
size
,
egl
10
.
egl
blue
size
,
egl
10
.
egl
green
size
,
egl
10
.
egl
red
size
,
egl
10
.
egl
depth
size
,
egl
10
.
egl
stencil
size
,
egl
10
.
egl
config
caveat
,
egl
10
.
egl
config
id
,
egl
10
.
egl
level
,
egl
10
.
egl
max
pbuffer
height
,
egl
10
.
egl
max
pbuffer
pixels
,
egl
10
.
egl
max
pbuffer
width
,
egl
10
.
egl
native
renderable
,
egl
10
.
egl
native
visual
id
,
egl
10
.
egl
native
visual
type
,
0x3030
,
egl
10
.
egl
samples
,
egl
10
.
egl
sample
buffers
,
egl
10
.
egl
surface
type
,
egl
10
.
egl
transparent
type
,
egl
10
.
egl
transparent
red
value
,
egl
10
.
egl
transparent
green
value
,
egl
10
.
egl
transparent
blue
value
,
0x3039
,
0x303A
,
0x303B
,
0x303C
,
egl
10
.
egl
luminance
size
,
egl
10
.
egl
alpha
mask
size
,
egl
10
.
egl
color
buffer
type
,
egl
10
.
egl
renderable
type
,
0x3042
}
;
string
[
]
names
=
{
"EGL_BUFFER_SIZE"
,
"EGL_ALPHA_SIZE"
,
"EGL_BLUE_SIZE"
,
"EGL_GREEN_SIZE"
,
"EGL_RED_SIZE"
,
"EGL_DEPTH_SIZE"
,
"EGL_STENCIL_SIZE"
,
"EGL_CONFIG_CAVEAT"
,
"EGL_CONFIG_ID"
,
"EGL_LEVEL"
,
"EGL_MAX_PBUFFER_HEIGHT"
,
"EGL_MAX_PBUFFER_PIXELS"
,
"EGL_MAX_PBUFFER_WIDTH"
,
"EGL_NATIVE_RENDERABLE"
,
"EGL_NATIVE_VISUAL_ID"
,
"EGL_NATIVE_VISUAL_TYPE"
,
"EGL_PRESERVED_RESOURCES"
,
"EGL_SAMPLES"
,
"EGL_SAMPLE_BUFFERS"
,
"EGL_SURFACE_TYPE"
,
"EGL_TRANSPARENT_TYPE"
,
"EGL_TRANSPARENT_RED_VALUE"
,
"EGL_TRANSPARENT_GREEN_VALUE"
,
"EGL_TRANSPARENT_BLUE_VALUE"
,
"EGL_BIND_TO_TEXTURE_RGB"
,
"EGL_BIND_TO_TEXTURE_RGBA"
,
"EGL_MIN_SWAP_INTERVAL"
,
"EGL_MAX_SWAP_INTERVAL"
,
"EGL_LUMINANCE_SIZE"
,
"EGL_ALPHA_MASK_SIZE"
,
"EGL_COLOR_BUFFER_TYPE"
,
"EGL_RENDERABLE_TYPE"
,
"EGL_CONFORMANT"
}
;
int
[
]
value
=
new
int
[
1
]
;
for
(
int
i
=
0
;
i
<
attributes
.
length
;
i
++
)
{
int
attribute
=
attributes
[
i
]
;
string
name
=
names
[
i
]
;
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
value
)
)
{
log
.
w
(
tag
,
string
.
format
(
" %s: %d "
,
name
,
value
[
0
]
)
)
;
}
else
{
while
(
egl
.
egl
get
error
(
)
!=
egl
10
.
egl
success
)
;
}
}
}
<SENTENCE_END/>
%END%
%END%
(2.93e-01)
attrib
(1.84e-01)
%UNK%
(8.01e-02)
egl
(7.81e-02)
10
(2.43e-02)
print
(2.41e-02)
config
(1.73e-02)
type
(9.77e-03)
id
(6.43e-03)
create
(5.63e-03)
<SENTENCE_START>
{
int
[
]
attributes
=
{
egl
10
.
egl
buffer
size
,
egl
10
.
egl
alpha
size
,
egl
10
.
egl
blue
size
,
egl
10
.
egl
green
size
,
egl
10
.
egl
red
size
,
egl
10
.
egl
depth
size
,
egl
10
.
egl
stencil
size
,
egl
10
.
egl
config
caveat
,
egl
10
.
egl
config
id
,
egl
10
.
egl
level
,
egl
10
.
egl
max
pbuffer
height
,
egl
10
.
egl
max
pbuffer
pixels
,
egl
10
.
egl
max
pbuffer
width
,
egl
10
.
egl
native
renderable
,
egl
10
.
egl
native
visual
id
,
egl
10
.
egl
native
visual
type
,
0x3030
,
egl
10
.
egl
samples
,
egl
10
.
egl
sample
buffers
,
egl
10
.
egl
surface
type
,
egl
10
.
egl
transparent
type
,
egl
10
.
egl
transparent
red
value
,
egl
10
.
egl
transparent
green
value
,
egl
10
.
egl
transparent
blue
value
,
0x3039
,
0x303A
,
0x303B
,
0x303C
,
egl
10
.
egl
luminance
size
,
egl
10
.
egl
alpha
mask
size
,
egl
10
.
egl
color
buffer
type
,
egl
10
.
egl
renderable
type
,
0x3042
}
;
string
[
]
names
=
{
"EGL_BUFFER_SIZE"
,
"EGL_ALPHA_SIZE"
,
"EGL_BLUE_SIZE"
,
"EGL_GREEN_SIZE"
,
"EGL_RED_SIZE"
,
"EGL_DEPTH_SIZE"
,
"EGL_STENCIL_SIZE"
,
"EGL_CONFIG_CAVEAT"
,
"EGL_CONFIG_ID"
,
"EGL_LEVEL"
,
"EGL_MAX_PBUFFER_HEIGHT"
,
"EGL_MAX_PBUFFER_PIXELS"
,
"EGL_MAX_PBUFFER_WIDTH"
,
"EGL_NATIVE_RENDERABLE"
,
"EGL_NATIVE_VISUAL_ID"
,
"EGL_NATIVE_VISUAL_TYPE"
,
"EGL_PRESERVED_RESOURCES"
,
"EGL_SAMPLES"
,
"EGL_SAMPLE_BUFFERS"
,
"EGL_SURFACE_TYPE"
,
"EGL_TRANSPARENT_TYPE"
,
"EGL_TRANSPARENT_RED_VALUE"
,
"EGL_TRANSPARENT_GREEN_VALUE"
,
"EGL_TRANSPARENT_BLUE_VALUE"
,
"EGL_BIND_TO_TEXTURE_RGB"
,
"EGL_BIND_TO_TEXTURE_RGBA"
,
"EGL_MIN_SWAP_INTERVAL"
,
"EGL_MAX_SWAP_INTERVAL"
,
"EGL_LUMINANCE_SIZE"
,
"EGL_ALPHA_MASK_SIZE"
,
"EGL_COLOR_BUFFER_TYPE"
,
"EGL_RENDERABLE_TYPE"
,
"EGL_CONFORMANT"
}
;
int
[
]
value
=
new
int
[
1
]
;
for
(
int
i
=
0
;
i
<
attributes
.
length
;
i
++
)
{
int
attribute
=
attributes
[
i
]
;
string
name
=
names
[
i
]
;
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
value
)
)
{
log
.
w
(
tag
,
string
.
format
(
" %s: %d "
,
name
,
value
[
0
]
)
)
;
}
else
{
while
(
egl
.
egl
get
error
(
)
!=
egl
10
.
egl
success
)
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
[
]
attributes
=
{
egl
10
.
egl
buffer
size
,
egl
10
.
egl
alpha
size
,
egl
10
.
egl
blue
size
,
egl
10
.
egl
green
size
,
egl
10
.
egl
red
size
,
egl
10
.
egl
depth
size
,
egl
10
.
egl
stencil
size
,
egl
10
.
egl
config
caveat
,
egl
10
.
egl
config
id
,
egl
10
.
egl
level
,
egl
10
.
egl
max
pbuffer
height
,
egl
10
.
egl
max
pbuffer
pixels
,
egl
10
.
egl
max
pbuffer
width
,
egl
10
.
egl
native
renderable
,
egl
10
.
egl
native
visual
id
,
egl
10
.
egl
native
visual
type
,
0x3030
,
egl
10
.
egl
samples
,
egl
10
.
egl
sample
buffers
,
egl
10
.
egl
surface
type
,
egl
10
.
egl
transparent
type
,
egl
10
.
egl
transparent
red
value
,
egl
10
.
egl
transparent
green
value
,
egl
10
.
egl
transparent
blue
value
,
0x3039
,
0x303A
,
0x303B
,
0x303C
,
egl
10
.
egl
luminance
size
,
egl
10
.
egl
alpha
mask
size
,
egl
10
.
egl
color
buffer
type
,
egl
10
.
egl
renderable
type
,
0x3042
}
;
string
[
]
names
=
{
"EGL_BUFFER_SIZE"
,
"EGL_ALPHA_SIZE"
,
"EGL_BLUE_SIZE"
,
"EGL_GREEN_SIZE"
,
"EGL_RED_SIZE"
,
"EGL_DEPTH_SIZE"
,
"EGL_STENCIL_SIZE"
,
"EGL_CONFIG_CAVEAT"
,
"EGL_CONFIG_ID"
,
"EGL_LEVEL"
,
"EGL_MAX_PBUFFER_HEIGHT"
,
"EGL_MAX_PBUFFER_PIXELS"
,
"EGL_MAX_PBUFFER_WIDTH"
,
"EGL_NATIVE_RENDERABLE"
,
"EGL_NATIVE_VISUAL_ID"
,
"EGL_NATIVE_VISUAL_TYPE"
,
"EGL_PRESERVED_RESOURCES"
,
"EGL_SAMPLES"
,
"EGL_SAMPLE_BUFFERS"
,
"EGL_SURFACE_TYPE"
,
"EGL_TRANSPARENT_TYPE"
,
"EGL_TRANSPARENT_RED_VALUE"
,
"EGL_TRANSPARENT_GREEN_VALUE"
,
"EGL_TRANSPARENT_BLUE_VALUE"
,
"EGL_BIND_TO_TEXTURE_RGB"
,
"EGL_BIND_TO_TEXTURE_RGBA"
,
"EGL_MIN_SWAP_INTERVAL"
,
"EGL_MAX_SWAP_INTERVAL"
,
"EGL_LUMINANCE_SIZE"
,
"EGL_ALPHA_MASK_SIZE"
,
"EGL_COLOR_BUFFER_TYPE"
,
"EGL_RENDERABLE_TYPE"
,
"EGL_CONFORMANT"
}
;
int
[
]
value
=
new
int
[
1
]
;
for
(
int
i
=
0
;
i
<
attributes
.
length
;
i
++
)
{
int
attribute
=
attributes
[
i
]
;
string
name
=
names
[
i
]
;
if
(
egl
.
egl
get
config
attrib
(
display
,
config
,
attribute
,
value
)
)
{
log
.
w
(
tag
,
string
.
format
(
" %s: %d "
,
name
,
value
[
0
]
)
)
;
}
else
{
while
(
egl
.
egl
get
error
(
)
!=
egl
10
.
egl
success
)
;
}
}
}
<SENTENCE_END/>
set,position
set
set
(4.69e-01)
translate
(3.25e-01)
x
(2.82e-02)
sub
(2.47e-02)
add
(1.68e-02)
rotate
(1.53e-02)
%UNK%
(1.09e-02)
position
(1.02e-02)
conjugate
(5.73e-03)
ccw
(4.25e-03)
<SENTENCE_START>
{
translate
(
x
-
this
.
x
,
y
-
this
.
y
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
translate
(
x
-
this
.
x
,
y
-
this
.
y
)
;
}
<SENTENCE_END/>
position
%END%
(6.01e-01)
x
(9.64e-02)
y
(8.12e-02)
position
(6.08e-02)
to
(1.81e-02)
moved
(9.78e-03)
bounds
(9.76e-03)
dragged
(6.16e-03)
local
(5.65e-03)
segment
(5.19e-03)
<SENTENCE_START>
{
translate
(
x
-
this
.
x
,
y
-
this
.
y
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
translate
(
x
-
this
.
x
,
y
-
this
.
y
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.99e-01)
position
(3.57e-02)
x
(3.32e-02)
y
(2.43e-02)
to
(8.35e-03)
bounds
(7.51e-03)
%UNK%
(6.15e-03)
at
(4.16e-03)
moved
(3.86e-03)
2
(3.79e-03)
<SENTENCE_START>
{
translate
(
x
-
this
.
x
,
y
-
this
.
y
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
translate
(
x
-
this
.
x
,
y
-
this
.
y
)
;
}
<SENTENCE_END/>
translate
translate
translate
(1.56e-01)
scale
(1.00e-01)
update
(6.18e-02)
%UNK%
(5.22e-02)
x
(3.46e-02)
add
(3.21e-02)
touch
(1.91e-02)
set
(1.88e-02)
draw
(1.81e-02)
fill
(1.72e-02)
<SENTENCE_START>
{
if
(
x
amount
==
0
&&
y
amount
==
0
)
return
;
if
(
integer
)
{
x
amount
=
math
.
round
(
x
amount
)
;
y
amount
=
math
.
round
(
y
amount
)
;
}
x
+=
x
amount
;
y
+=
y
amount
;
float
[
]
[
]
page
vertices
=
this
.
page
vertices
;
for
(
int
i
=
0
,
n
=
page
vertices
.
length
;
i
<
n
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
for
(
int
ii
=
0
,
nn
=
idx
[
i
]
;
ii
<
nn
;
ii
+=
5
)
{
vertices
[
ii
]
+=
x
amount
;
vertices
[
ii
+
1
]
+=
y
amount
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
x
amount
==
0
&&
y
amount
==
0
)
return
;
if
(
integer
)
{
x
amount
=
math
.
round
(
x
amount
)
;
y
amount
=
math
.
round
(
y
amount
)
;
}
x
+=
x
amount
;
y
+=
y
amount
;
float
[
]
[
]
page
vertices
=
this
.
page
vertices
;
for
(
int
i
=
0
,
n
=
page
vertices
.
length
;
i
<
n
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
for
(
int
ii
=
0
,
nn
=
idx
[
i
]
;
ii
<
nn
;
ii
+=
5
)
{
vertices
[
ii
]
+=
x
amount
;
vertices
[
ii
+
1
]
+=
y
amount
;
}
}
}
<SENTENCE_END/>
%END%
%END%
(5.61e-01)
vertices
(3.49e-02)
x
(1.95e-02)
scale
(1.52e-02)
update
(1.23e-02)
amount
(1.18e-02)
page
(1.17e-02)
%UNK%
(1.06e-02)
y
(9.84e-03)
by
(8.91e-03)
<SENTENCE_START>
{
if
(
x
amount
==
0
&&
y
amount
==
0
)
return
;
if
(
integer
)
{
x
amount
=
math
.
round
(
x
amount
)
;
y
amount
=
math
.
round
(
y
amount
)
;
}
x
+=
x
amount
;
y
+=
y
amount
;
float
[
]
[
]
page
vertices
=
this
.
page
vertices
;
for
(
int
i
=
0
,
n
=
page
vertices
.
length
;
i
<
n
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
for
(
int
ii
=
0
,
nn
=
idx
[
i
]
;
ii
<
nn
;
ii
+=
5
)
{
vertices
[
ii
]
+=
x
amount
;
vertices
[
ii
+
1
]
+=
y
amount
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
x
amount
==
0
&&
y
amount
==
0
)
return
;
if
(
integer
)
{
x
amount
=
math
.
round
(
x
amount
)
;
y
amount
=
math
.
round
(
y
amount
)
;
}
x
+=
x
amount
;
y
+=
y
amount
;
float
[
]
[
]
page
vertices
=
this
.
page
vertices
;
for
(
int
i
=
0
,
n
=
page
vertices
.
length
;
i
<
n
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
for
(
int
ii
=
0
,
nn
=
idx
[
i
]
;
ii
<
nn
;
ii
+=
5
)
{
vertices
[
ii
]
+=
x
amount
;
vertices
[
ii
+
1
]
+=
y
amount
;
}
}
}
<SENTENCE_END/>
tint
tint
set
(1.50e-01)
create
(9.46e-02)
get
(6.10e-02)
draw
(5.22e-02)
%UNK%
(4.79e-02)
add
(4.77e-02)
load
(4.10e-02)
reset
(3.10e-02)
generate
(2.71e-02)
update
(1.97e-02)
<SENTENCE_START>
{
float
new
tint
=
%SELF%
.
to
float
bits
(
)
;
if
(
current
tint
==
new
tint
)
return
;
current
tint
=
new
tint
;
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layouts
.
size
;
i
<
n
;
i
++
)
{
glyph
layout
layout
=
layouts
.
get
(
i
)
;
for
(
int
ii
=
0
,
nn
=
layout
.
runs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
ii
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
color
float
=
temp
color
.
set
(
run
.
color
)
.
mul
(
%SELF%
)
.
to
float
bits
(
)
;
for
(
int
iii
=
0
,
nnn
=
glyphs
.
size
;
iii
<
nnn
;
iii
++
)
{
glyph
glyph
=
glyphs
.
get
(
iii
)
;
int
page
=
glyph
.
page
;
int
offset
=
temp
glyph
count
[
page
]
*
20
+
2
;
temp
glyph
count
[
page
]
++
;
float
[
]
vertices
=
page
vertices
[
page
]
;
for
(
int
v
=
0
;
v
<
20
;
v
+=
5
)
vertices
[
offset
+
v
]
=
color
float
;
}
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
new
tint
=
%SELF%
.
to
float
bits
(
)
;
if
(
current
tint
==
new
tint
)
return
;
current
tint
=
new
tint
;
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layouts
.
size
;
i
<
n
;
i
++
)
{
glyph
layout
layout
=
layouts
.
get
(
i
)
;
for
(
int
ii
=
0
,
nn
=
layout
.
runs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
ii
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
color
float
=
temp
color
.
set
(
run
.
color
)
.
mul
(
%SELF%
)
.
to
float
bits
(
)
;
for
(
int
iii
=
0
,
nnn
=
glyphs
.
size
;
iii
<
nnn
;
iii
++
)
{
glyph
glyph
=
glyphs
.
get
(
iii
)
;
int
page
=
glyph
.
page
;
int
offset
=
temp
glyph
count
[
page
]
*
20
+
2
;
temp
glyph
count
[
page
]
++
;
float
[
]
vertices
=
page
vertices
[
page
]
;
for
(
int
v
=
0
;
v
<
20
;
v
+=
5
)
vertices
[
offset
+
v
]
=
color
float
;
}
}
}
}
<SENTENCE_END/>
%END%
%END%
(4.19e-01)
glyph
(3.31e-02)
%UNK%
(3.15e-02)
current
(2.28e-02)
get
(1.48e-02)
tint
(1.24e-02)
temp
(1.24e-02)
draw
(1.09e-02)
create
(1.06e-02)
vertices
(8.49e-03)
<SENTENCE_START>
{
float
new
tint
=
%SELF%
.
to
float
bits
(
)
;
if
(
current
tint
==
new
tint
)
return
;
current
tint
=
new
tint
;
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layouts
.
size
;
i
<
n
;
i
++
)
{
glyph
layout
layout
=
layouts
.
get
(
i
)
;
for
(
int
ii
=
0
,
nn
=
layout
.
runs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
ii
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
color
float
=
temp
color
.
set
(
run
.
color
)
.
mul
(
%SELF%
)
.
to
float
bits
(
)
;
for
(
int
iii
=
0
,
nnn
=
glyphs
.
size
;
iii
<
nnn
;
iii
++
)
{
glyph
glyph
=
glyphs
.
get
(
iii
)
;
int
page
=
glyph
.
page
;
int
offset
=
temp
glyph
count
[
page
]
*
20
+
2
;
temp
glyph
count
[
page
]
++
;
float
[
]
vertices
=
page
vertices
[
page
]
;
for
(
int
v
=
0
;
v
<
20
;
v
+=
5
)
vertices
[
offset
+
v
]
=
color
float
;
}
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
float
new
tint
=
%SELF%
.
to
float
bits
(
)
;
if
(
current
tint
==
new
tint
)
return
;
current
tint
=
new
tint
;
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layouts
.
size
;
i
<
n
;
i
++
)
{
glyph
layout
layout
=
layouts
.
get
(
i
)
;
for
(
int
ii
=
0
,
nn
=
layout
.
runs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
ii
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
color
float
=
temp
color
.
set
(
run
.
color
)
.
mul
(
%SELF%
)
.
to
float
bits
(
)
;
for
(
int
iii
=
0
,
nnn
=
glyphs
.
size
;
iii
<
nnn
;
iii
++
)
{
glyph
glyph
=
glyphs
.
get
(
iii
)
;
int
page
=
glyph
.
page
;
int
offset
=
temp
glyph
count
[
page
]
*
20
+
2
;
temp
glyph
count
[
page
]
++
;
float
[
]
vertices
=
page
vertices
[
page
]
;
for
(
int
v
=
0
;
v
<
20
;
v
+=
5
)
vertices
[
offset
+
v
]
=
color
float
;
}
}
}
}
<SENTENCE_END/>
set,alphas
set
set
(3.73e-01)
create
(8.48e-02)
get
(4.46e-02)
reset
(3.75e-02)
%UNK%
(3.15e-02)
draw
(2.36e-02)
load
(1.95e-02)
init
(1.88e-02)
generate
(1.66e-02)
add
(1.39e-02)
<SENTENCE_START>
{
int
alpha
bits
=
(
(
int
)
(
254
*
alpha
)
)
<<
24
;
float
prev
=
0
,
new
color
=
0
;
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
{
float
c
=
vertices
[
i
]
;
if
(
c
==
prev
&&
i
!=
2
)
{
vertices
[
i
]
=
new
color
;
}
else
{
prev
=
c
;
int
rgba
=
number
utils
.
float
to
int
color
(
c
)
;
rgba
=
(
rgba
&
0x00FFFFFF
)
|
alpha
bits
;
new
color
=
number
utils
.
int
to
float
color
(
rgba
)
;
vertices
[
i
]
=
new
color
;
}
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
alpha
bits
=
(
(
int
)
(
254
*
alpha
)
)
<<
24
;
float
prev
=
0
,
new
color
=
0
;
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
{
float
c
=
vertices
[
i
]
;
if
(
c
==
prev
&&
i
!=
2
)
{
vertices
[
i
]
=
new
color
;
}
else
{
prev
=
c
;
int
rgba
=
number
utils
.
float
to
int
color
(
c
)
;
rgba
=
(
rgba
&
0x00FFFFFF
)
|
alpha
bits
;
new
color
=
number
utils
.
int
to
float
color
(
rgba
)
;
vertices
[
i
]
=
new
color
;
}
}
}
}
<SENTENCE_END/>
alphas
%END%
(5.53e-01)
color
(4.20e-02)
int
(2.78e-02)
%UNK%
(2.10e-02)
vertices
(2.05e-02)
new
(1.40e-02)
prev
(1.34e-02)
rgba
(9.87e-03)
get
(9.21e-03)
float
(8.97e-03)
<SENTENCE_START>
{
int
alpha
bits
=
(
(
int
)
(
254
*
alpha
)
)
<<
24
;
float
prev
=
0
,
new
color
=
0
;
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
{
float
c
=
vertices
[
i
]
;
if
(
c
==
prev
&&
i
!=
2
)
{
vertices
[
i
]
=
new
color
;
}
else
{
prev
=
c
;
int
rgba
=
number
utils
.
float
to
int
color
(
c
)
;
rgba
=
(
rgba
&
0x00FFFFFF
)
|
alpha
bits
;
new
color
=
number
utils
.
int
to
float
color
(
rgba
)
;
vertices
[
i
]
=
new
color
;
}
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
alpha
bits
=
(
(
int
)
(
254
*
alpha
)
)
<<
24
;
float
prev
=
0
,
new
color
=
0
;
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
{
float
c
=
vertices
[
i
]
;
if
(
c
==
prev
&&
i
!=
2
)
{
vertices
[
i
]
=
new
color
;
}
else
{
prev
=
c
;
int
rgba
=
number
utils
.
float
to
int
color
(
c
)
;
rgba
=
(
rgba
&
0x00FFFFFF
)
|
alpha
bits
;
new
color
=
number
utils
.
int
to
float
color
(
rgba
)
;
vertices
[
i
]
=
new
color
;
}
}
}
}
<SENTENCE_END/>
%END%
%END%
(7.82e-01)
%UNK%
(1.59e-02)
color
(8.07e-03)
int
(7.89e-03)
rgba
(3.95e-03)
vertices
(3.85e-03)
get
(3.83e-03)
and
(3.81e-03)
to
(3.27e-03)
create
(3.00e-03)
<SENTENCE_START>
{
int
alpha
bits
=
(
(
int
)
(
254
*
alpha
)
)
<<
24
;
float
prev
=
0
,
new
color
=
0
;
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
{
float
c
=
vertices
[
i
]
;
if
(
c
==
prev
&&
i
!=
2
)
{
vertices
[
i
]
=
new
color
;
}
else
{
prev
=
c
;
int
rgba
=
number
utils
.
float
to
int
color
(
c
)
;
rgba
=
(
rgba
&
0x00FFFFFF
)
|
alpha
bits
;
new
color
=
number
utils
.
int
to
float
color
(
rgba
)
;
vertices
[
i
]
=
new
color
;
}
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
alpha
bits
=
(
(
int
)
(
254
*
alpha
)
)
<<
24
;
float
prev
=
0
,
new
color
=
0
;
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
{
float
c
=
vertices
[
i
]
;
if
(
c
==
prev
&&
i
!=
2
)
{
vertices
[
i
]
=
new
color
;
}
else
{
prev
=
c
;
int
rgba
=
number
utils
.
float
to
int
color
(
c
)
;
rgba
=
(
rgba
&
0x00FFFFFF
)
|
alpha
bits
;
new
color
=
number
utils
.
int
to
float
color
(
rgba
)
;
vertices
[
i
]
=
new
color
;
}
}
}
}
<SENTENCE_END/>
set,colors
set
create
(1.79e-01)
generate
(1.08e-01)
init
(4.73e-02)
%UNK%
(4.61e-02)
reset
(4.19e-02)
update
(4.00e-02)
calculate
(3.09e-02)
bind
(2.29e-02)
set
(2.22e-02)
get
(2.02e-02)
<SENTENCE_START>
{
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
}
}
<SENTENCE_END/>
colors
%END%
(5.23e-01)
vertices
(1.44e-01)
color
(3.68e-02)
%UNK%
(1.32e-02)
vertex
(9.02e-03)
create
(7.85e-03)
generate
(7.35e-03)
update
(6.93e-03)
bounding
(6.88e-03)
page
(6.82e-03)
<SENTENCE_START>
{
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
}
}
<SENTENCE_END/>
%END%
%END%
(7.86e-01)
%UNK%
(1.59e-02)
vertices
(8.84e-03)
of
(5.37e-03)
index
(4.86e-03)
bounding
(4.22e-03)
vertex
(4.17e-03)
generate
(4.16e-03)
create
(3.85e-03)
update
(3.49e-03)
<SENTENCE_START>
{
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
for
(
int
j
=
0
,
length
=
page
vertices
.
length
;
j
<
length
;
j
++
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
for
(
int
i
=
2
,
n
=
idx
[
j
]
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
}
}
<SENTENCE_END/>
set,colors
set
set
(8.15e-01)
clear
(4.90e-02)
begin
(1.64e-02)
end
(1.06e-02)
add
(8.80e-03)
flush
(4.51e-03)
write
(4.10e-03)
size
(3.67e-03)
update
(3.36e-03)
on
(2.83e-03)
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
)
;
}
<SENTENCE_END/>
colors
%END%
(9.45e-01)
tint
(6.51e-03)
all
(4.79e-03)
changed
(3.12e-03)
float
(2.82e-03)
bits
(1.99e-03)
and
(1.50e-03)
fv
(1.20e-03)
rad
(1.01e-03)
%UNK%
(8.63e-04)
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.84e-01)
float
(2.32e-03)
all
(1.17e-03)
fv
(9.50e-04)
tint
(5.09e-04)
bits
(4.79e-04)
rad
(4.77e-04)
array
(4.49e-04)
performed
(3.98e-04)
changed
(3.88e-04)
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
)
;
}
<SENTENCE_END/>
set,colors
set
set
(8.76e-01)
get
(1.29e-02)
load
(1.13e-02)
init
(5.07e-03)
on
(3.65e-03)
add
(3.58e-03)
check
(3.47e-03)
%UNK%
(3.41e-03)
read
(2.96e-03)
update
(2.68e-03)
<SENTENCE_START>
{
int
int
bits
=
(
(
int
)
(
255
*
a
)
<<
24
)
|
(
(
int
)
(
255
*
b
)
<<
16
)
|
(
(
int
)
(
255
*
g
)
<<
8
)
|
(
(
int
)
(
255
*
r
)
)
;
%SELF%
(
number
utils
.
int
to
float
color
(
int
bits
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
int
bits
=
(
(
int
)
(
255
*
a
)
<<
24
)
|
(
(
int
)
(
255
*
b
)
<<
16
)
|
(
(
int
)
(
255
*
g
)
<<
8
)
|
(
(
int
)
(
255
*
r
)
)
;
%SELF%
(
number
utils
.
int
to
float
color
(
int
bits
)
)
;
}
<SENTENCE_END/>
colors
%END%
(3.99e-01)
int
(7.89e-02)
number
(5.06e-02)
endian
(2.83e-02)
float
(2.04e-02)
short
(1.79e-02)
%UNK%
(1.51e-02)
at
(1.02e-02)
and
(9.18e-03)
255
(9.00e-03)
<SENTENCE_START>
{
int
int
bits
=
(
(
int
)
(
255
*
a
)
<<
24
)
|
(
(
int
)
(
255
*
b
)
<<
16
)
|
(
(
int
)
(
255
*
g
)
<<
8
)
|
(
(
int
)
(
255
*
r
)
)
;
%SELF%
(
number
utils
.
int
to
float
color
(
int
bits
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
int
bits
=
(
(
int
)
(
255
*
a
)
<<
24
)
|
(
(
int
)
(
255
*
b
)
<<
16
)
|
(
(
int
)
(
255
*
g
)
<<
8
)
|
(
(
int
)
(
255
*
r
)
)
;
%SELF%
(
number
utils
.
int
to
float
color
(
int
bits
)
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.98e-01)
int
(3.29e-02)
endian
(1.52e-02)
short
(1.18e-02)
and
(9.64e-03)
float
(7.85e-03)
at
(6.43e-03)
all
(5.36e-03)
equal
(5.06e-03)
string
(3.59e-03)
<SENTENCE_START>
{
int
int
bits
=
(
(
int
)
(
255
*
a
)
<<
24
)
|
(
(
int
)
(
255
*
b
)
<<
16
)
|
(
(
int
)
(
255
*
g
)
<<
8
)
|
(
(
int
)
(
255
*
r
)
)
;
%SELF%
(
number
utils
.
int
to
float
color
(
int
bits
)
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
int
bits
=
(
(
int
)
(
255
*
a
)
<<
24
)
|
(
(
int
)
(
255
*
b
)
<<
16
)
|
(
(
int
)
(
255
*
g
)
<<
8
)
|
(
(
int
)
(
255
*
r
)
)
;
%SELF%
(
number
utils
.
int
to
float
color
(
int
bits
)
)
;
}
<SENTENCE_END/>
set,colors
set
set
(7.24e-01)
end
(4.45e-02)
begin
(3.12e-02)
add
(2.09e-02)
clear
(1.97e-02)
start
(1.20e-02)
update
(8.39e-03)
flush
(6.64e-03)
apply
(6.35e-03)
draw
(5.97e-03)
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
,
start
,
end
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
,
start
,
end
)
;
}
<SENTENCE_END/>
colors
%END%
(9.17e-01)
tint
(4.28e-02)
changed
(2.16e-03)
all
(2.01e-03)
%UNK%
(1.30e-03)
end
(1.03e-03)
performed
(5.02e-04)
float
(4.79e-04)
to
(4.25e-04)
buffer
(4.15e-04)
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
,
start
,
end
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
,
start
,
end
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.80e-01)
all
(1.52e-03)
tint
(1.07e-03)
float
(8.41e-04)
start
(7.45e-04)
%UNK%
(7.19e-04)
changed
(6.33e-04)
performed
(5.88e-04)
at
(4.33e-04)
string
(3.24e-04)
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
,
start
,
end
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
%SELF%
(
tint
.
to
float
bits
(
)
,
start
,
end
)
;
}
<SENTENCE_END/>
set,colors
set
get
(1.10e-01)
%END%
(7.99e-02)
draw
(6.90e-02)
set
(5.75e-02)
generate
(4.10e-02)
update
(3.89e-02)
load
(3.85e-02)
create
(2.55e-02)
reset
(2.43e-02)
calculate
(2.41e-02)
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
float
[
]
vertices
=
page
vertices
[
0
]
;
for
(
int
i
=
start
*
20
+
2
,
n
=
end
*
20
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
return
;
}
int
page
count
=
page
vertices
.
length
;
for
(
int
i
=
0
;
i
<
page
count
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
j
=
0
,
n
=
glyph
indices
.
size
;
j
<
n
;
j
++
)
{
int
glyph
index
=
glyph
indices
.
items
[
j
]
;
if
(
glyph
index
>=
end
)
break
;
if
(
glyph
index
>=
start
)
{
for
(
int
off
=
0
;
off
<
20
;
off
+=
5
)
vertices
[
off
+
(
j
*
20
+
2
)
]
=
color
;
}
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
float
[
]
vertices
=
page
vertices
[
0
]
;
for
(
int
i
=
start
*
20
+
2
,
n
=
end
*
20
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
return
;
}
int
page
count
=
page
vertices
.
length
;
for
(
int
i
=
0
;
i
<
page
count
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
j
=
0
,
n
=
glyph
indices
.
size
;
j
<
n
;
j
++
)
{
int
glyph
index
=
glyph
indices
.
items
[
j
]
;
if
(
glyph
index
>=
end
)
break
;
if
(
glyph
index
>=
start
)
{
for
(
int
off
=
0
;
off
<
20
;
off
+=
5
)
vertices
[
off
+
(
j
*
20
+
2
)
]
=
color
;
}
}
}
}
<SENTENCE_END/>
colors
%END%
(4.00e-01)
glyph
(1.95e-01)
indices
(1.23e-01)
vertices
(4.79e-02)
page
(2.20e-02)
int
(9.06e-03)
color
(7.21e-03)
count
(6.11e-03)
i
(5.76e-03)
index
(4.91e-03)
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
float
[
]
vertices
=
page
vertices
[
0
]
;
for
(
int
i
=
start
*
20
+
2
,
n
=
end
*
20
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
return
;
}
int
page
count
=
page
vertices
.
length
;
for
(
int
i
=
0
;
i
<
page
count
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
j
=
0
,
n
=
glyph
indices
.
size
;
j
<
n
;
j
++
)
{
int
glyph
index
=
glyph
indices
.
items
[
j
]
;
if
(
glyph
index
>=
end
)
break
;
if
(
glyph
index
>=
start
)
{
for
(
int
off
=
0
;
off
<
20
;
off
+=
5
)
vertices
[
off
+
(
j
*
20
+
2
)
]
=
color
;
}
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
float
[
]
vertices
=
page
vertices
[
0
]
;
for
(
int
i
=
start
*
20
+
2
,
n
=
end
*
20
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
return
;
}
int
page
count
=
page
vertices
.
length
;
for
(
int
i
=
0
;
i
<
page
count
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
j
=
0
,
n
=
glyph
indices
.
size
;
j
<
n
;
j
++
)
{
int
glyph
index
=
glyph
indices
.
items
[
j
]
;
if
(
glyph
index
>=
end
)
break
;
if
(
glyph
index
>=
start
)
{
for
(
int
off
=
0
;
off
<
20
;
off
+=
5
)
vertices
[
off
+
(
j
*
20
+
2
)
]
=
color
;
}
}
}
}
<SENTENCE_END/>
%END%
%END%
(8.21e-01)
indices
(1.58e-02)
vertices
(1.07e-02)
glyph
(7.83e-03)
index
(5.51e-03)
i
(4.72e-03)
int
(4.29e-03)
page
(4.28e-03)
count
(2.98e-03)
%UNK%
(2.46e-03)
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
float
[
]
vertices
=
page
vertices
[
0
]
;
for
(
int
i
=
start
*
20
+
2
,
n
=
end
*
20
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
return
;
}
int
page
count
=
page
vertices
.
length
;
for
(
int
i
=
0
;
i
<
page
count
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
j
=
0
,
n
=
glyph
indices
.
size
;
j
<
n
;
j
++
)
{
int
glyph
index
=
glyph
indices
.
items
[
j
]
;
if
(
glyph
index
>=
end
)
break
;
if
(
glyph
index
>=
start
)
{
for
(
int
off
=
0
;
off
<
20
;
off
+=
5
)
vertices
[
off
+
(
j
*
20
+
2
)
]
=
color
;
}
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
float
[
]
vertices
=
page
vertices
[
0
]
;
for
(
int
i
=
start
*
20
+
2
,
n
=
end
*
20
;
i
<
n
;
i
+=
5
)
vertices
[
i
]
=
color
;
return
;
}
int
page
count
=
page
vertices
.
length
;
for
(
int
i
=
0
;
i
<
page
count
;
i
++
)
{
float
[
]
vertices
=
page
vertices
[
i
]
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
j
=
0
,
n
=
glyph
indices
.
size
;
j
<
n
;
j
++
)
{
int
glyph
index
=
glyph
indices
.
items
[
j
]
;
if
(
glyph
index
>=
end
)
break
;
if
(
glyph
index
>=
start
)
{
for
(
int
off
=
0
;
off
<
20
;
off
+=
5
)
vertices
[
off
+
(
j
*
20
+
2
)
]
=
color
;
}
}
}
}
<SENTENCE_END/>
get,color
get
get
(9.75e-01)
is
(1.60e-02)
color
(2.99e-03)
return
(1.22e-03)
append
(1.14e-03)
protected
(3.06e-04)
needs
(1.99e-04)
iterator
(1.49e-04)
owns
(1.32e-04)
duration
(1.22e-04)
<SENTENCE_START>
{
return
color
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
color
;
}
<SENTENCE_END/>
color
color
(9.98e-01)
return
(1.73e-03)
draw
(2.83e-05)
line
(1.31e-05)
rectangle
(8.84e-06)
%END%
(7.28e-06)
rect
(4.28e-06)
percent
(3.43e-06)
depth
(3.27e-06)
circle
(2.93e-06)
<SENTENCE_START>
{
return
color
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
color
;
}
<SENTENCE_END/>
%END%
%END%
(9.18e-01)
color
(1.52e-02)
value
(9.61e-03)
only
(2.45e-03)
buffer
(2.35e-03)
offset
(1.75e-03)
height
(1.70e-03)
width
(1.51e-03)
array
(1.40e-03)
20
(1.40e-03)
<SENTENCE_START>
{
return
color
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
color
;
}
<SENTENCE_END/>
set,color
set
set
(9.90e-01)
color
(4.01e-03)
this
(5.61e-04)
draw
(6.78e-05)
reset
(7.93e-06)
end
(7.76e-06)
begin
(5.12e-06)
get
(4.53e-06)
ext
(3.35e-06)
translate
(2.44e-06)
<SENTENCE_START>
{
this
.
color
.
set
(
color
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
color
.
set
(
color
)
;
}
<SENTENCE_END/>
color
color
(9.97e-01)
draw
(1.35e-05)
set
(8.11e-06)
this
(1.66e-06)
line
(1.55e-06)
rect
(1.47e-06)
circle
(1.37e-06)
triangle
(3.27e-07)
rectangle
(2.15e-07)
%END%
(2.13e-07)
<SENTENCE_START>
{
this
.
color
.
set
(
color
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
color
.
set
(
color
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.33e-01)
color
(2.24e-02)
set
(8.94e-04)
circle
(5.65e-04)
value
(5.17e-04)
%UNK%
(4.66e-04)
line
(4.03e-04)
2
(3.31e-04)
performed
(3.06e-04)
float
(2.83e-04)
<SENTENCE_START>
{
this
.
color
.
set
(
color
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
color
.
set
(
color
)
;
}
<SENTENCE_END/>
set,color
set
set
(9.45e-01)
color
(1.72e-02)
draw
(1.59e-02)
rect
(1.07e-03)
%UNK%
(7.28e-04)
render
(6.77e-04)
fill
(6.57e-04)
b
(5.10e-04)
ext
(4.85e-04)
triangle
(4.76e-04)
<SENTENCE_START>
{
color
.
set
(
r
,
g
,
b
,
a
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
color
.
set
(
r
,
g
,
b
,
a
)
;
}
<SENTENCE_END/>
color
color
(6.54e-01)
%END%
(2.34e-01)
set
(1.30e-02)
line
(9.58e-03)
rect
(9.56e-03)
draw
(8.25e-03)
triangle
(6.45e-03)
circle
(4.47e-03)
component
(2.92e-03)
%UNK%
(2.70e-03)
<SENTENCE_START>
{
color
.
set
(
r
,
g
,
b
,
a
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
color
.
set
(
r
,
g
,
b
,
a
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.87e-01)
color
(1.46e-03)
from
(4.74e-04)
%UNK%
(4.24e-04)
b
(4.22e-04)
a
(3.63e-04)
line
(2.23e-04)
set
(2.02e-04)
circle
(1.99e-04)
2
(1.86e-04)
<SENTENCE_START>
{
color
.
set
(
r
,
g
,
b
,
a
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
color
.
set
(
r
,
g
,
b
,
a
)
;
}
<SENTENCE_END/>
draw
draw
generate
(2.17e-01)
create
(1.79e-01)
set
(7.25e-02)
draw
(4.74e-02)
%UNK%
(4.37e-02)
find
(3.74e-02)
add
(3.05e-02)
get
(2.91e-02)
update
(2.80e-02)
calculate
(2.60e-02)
<SENTENCE_START>
{
array
<
texture
region
>
regions
=
font
.
get
regions
(
)
;
for
(
int
j
=
0
,
n
=
page
vertices
.
length
;
j
<
n
;
j
++
)
{
if
(
idx
[
j
]
>
0
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
sprite
batch
.
%SELF%
(
regions
.
get
(
j
)
.
get
texture
(
)
,
vertices
,
0
,
idx
[
j
]
)
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
<
texture
region
>
regions
=
font
.
get
regions
(
)
;
for
(
int
j
=
0
,
n
=
page
vertices
.
length
;
j
<
n
;
j
++
)
{
if
(
idx
[
j
]
>
0
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
sprite
batch
.
%SELF%
(
regions
.
get
(
j
)
.
get
texture
(
)
,
vertices
,
0
,
idx
[
j
]
)
;
}
}
}
<SENTENCE_END/>
%END%
%END%
(5.99e-01)
%UNK%
(4.49e-02)
vertices
(3.56e-02)
texture
(3.28e-02)
generate
(1.89e-02)
create
(1.66e-02)
region
(1.44e-02)
regions
(1.42e-02)
j
(6.26e-03)
draw
(6.04e-03)
<SENTENCE_START>
{
array
<
texture
region
>
regions
=
font
.
get
regions
(
)
;
for
(
int
j
=
0
,
n
=
page
vertices
.
length
;
j
<
n
;
j
++
)
{
if
(
idx
[
j
]
>
0
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
sprite
batch
.
%SELF%
(
regions
.
get
(
j
)
.
get
texture
(
)
,
vertices
,
0
,
idx
[
j
]
)
;
}
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
array
<
texture
region
>
regions
=
font
.
get
regions
(
)
;
for
(
int
j
=
0
,
n
=
page
vertices
.
length
;
j
<
n
;
j
++
)
{
if
(
idx
[
j
]
>
0
)
{
float
[
]
vertices
=
page
vertices
[
j
]
;
sprite
batch
.
%SELF%
(
regions
.
get
(
j
)
.
get
texture
(
)
,
vertices
,
0
,
idx
[
j
]
)
;
}
}
}
<SENTENCE_END/>
draw
draw
draw
(1.02e-01)
set
(9.94e-02)
%END%
(7.85e-02)
get
(7.23e-02)
update
(3.69e-02)
load
(3.08e-02)
reset
(1.96e-02)
bind
(1.87e-02)
%UNK%
(1.86e-02)
calculate
(1.67e-02)
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
sprite
batch
.
%SELF%
(
font
.
get
region
(
)
.
get
texture
(
)
,
page
vertices
[
0
]
,
start
*
20
,
(
end
-
start
)
*
20
)
;
return
;
}
array
<
texture
region
>
regions
=
font
.
get
regions
(
)
;
for
(
int
i
=
0
,
page
count
=
page
vertices
.
length
;
i
<
page
count
;
i
++
)
{
int
offset
=
-
1
,
count
=
0
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
ii
=
0
,
n
=
glyph
indices
.
size
;
ii
<
n
;
ii
++
)
{
int
glyph
index
=
glyph
indices
.
get
(
ii
)
;
if
(
glyph
index
>=
end
)
break
;
if
(
offset
==
-
1
&&
glyph
index
>=
start
)
offset
=
ii
;
if
(
glyph
index
>=
start
)
count
++
;
}
if
(
offset
==
-
1
||
count
==
0
)
continue
;
sprite
batch
.
%SELF%
(
regions
.
get
(
i
)
.
get
texture
(
)
,
page
vertices
[
i
]
,
offset
*
20
,
count
*
20
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
sprite
batch
.
%SELF%
(
font
.
get
region
(
)
.
get
texture
(
)
,
page
vertices
[
0
]
,
start
*
20
,
(
end
-
start
)
*
20
)
;
return
;
}
array
<
texture
region
>
regions
=
font
.
get
regions
(
)
;
for
(
int
i
=
0
,
page
count
=
page
vertices
.
length
;
i
<
page
count
;
i
++
)
{
int
offset
=
-
1
,
count
=
0
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
ii
=
0
,
n
=
glyph
indices
.
size
;
ii
<
n
;
ii
++
)
{
int
glyph
index
=
glyph
indices
.
get
(
ii
)
;
if
(
glyph
index
>=
end
)
break
;
if
(
offset
==
-
1
&&
glyph
index
>=
start
)
offset
=
ii
;
if
(
glyph
index
>=
start
)
count
++
;
}
if
(
offset
==
-
1
||
count
==
0
)
continue
;
sprite
batch
.
%SELF%
(
regions
.
get
(
i
)
.
get
texture
(
)
,
page
vertices
[
i
]
,
offset
*
20
,
count
*
20
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(5.13e-01)
glyph
(8.00e-02)
indices
(5.99e-02)
page
(1.29e-02)
texture
(9.96e-03)
vertices
(8.97e-03)
index
(8.89e-03)
draw
(8.57e-03)
count
(7.33e-03)
get
(7.25e-03)
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
sprite
batch
.
%SELF%
(
font
.
get
region
(
)
.
get
texture
(
)
,
page
vertices
[
0
]
,
start
*
20
,
(
end
-
start
)
*
20
)
;
return
;
}
array
<
texture
region
>
regions
=
font
.
get
regions
(
)
;
for
(
int
i
=
0
,
page
count
=
page
vertices
.
length
;
i
<
page
count
;
i
++
)
{
int
offset
=
-
1
,
count
=
0
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
ii
=
0
,
n
=
glyph
indices
.
size
;
ii
<
n
;
ii
++
)
{
int
glyph
index
=
glyph
indices
.
get
(
ii
)
;
if
(
glyph
index
>=
end
)
break
;
if
(
offset
==
-
1
&&
glyph
index
>=
start
)
offset
=
ii
;
if
(
glyph
index
>=
start
)
count
++
;
}
if
(
offset
==
-
1
||
count
==
0
)
continue
;
sprite
batch
.
%SELF%
(
regions
.
get
(
i
)
.
get
texture
(
)
,
page
vertices
[
i
]
,
offset
*
20
,
count
*
20
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
sprite
batch
.
%SELF%
(
font
.
get
region
(
)
.
get
texture
(
)
,
page
vertices
[
0
]
,
start
*
20
,
(
end
-
start
)
*
20
)
;
return
;
}
array
<
texture
region
>
regions
=
font
.
get
regions
(
)
;
for
(
int
i
=
0
,
page
count
=
page
vertices
.
length
;
i
<
page
count
;
i
++
)
{
int
offset
=
-
1
,
count
=
0
;
int
array
glyph
indices
=
page
glyph
indices
[
i
]
;
for
(
int
ii
=
0
,
n
=
glyph
indices
.
size
;
ii
<
n
;
ii
++
)
{
int
glyph
index
=
glyph
indices
.
get
(
ii
)
;
if
(
glyph
index
>=
end
)
break
;
if
(
offset
==
-
1
&&
glyph
index
>=
start
)
offset
=
ii
;
if
(
glyph
index
>=
start
)
count
++
;
}
if
(
offset
==
-
1
||
count
==
0
)
continue
;
sprite
batch
.
%SELF%
(
regions
.
get
(
i
)
.
get
texture
(
)
,
page
vertices
[
i
]
,
offset
*
20
,
count
*
20
)
;
}
}
<SENTENCE_END/>
draw
draw
draw
(6.09e-01)
set
(1.60e-01)
reset
(5.94e-02)
color
(3.62e-02)
render
(2.14e-02)
begin
(1.78e-02)
end
(5.25e-03)
bind
(4.54e-03)
apply
(4.14e-03)
alpha
(3.47e-03)
<SENTENCE_START>
{
if
(
alpha
modulation
==
1
)
{
%SELF%
(
sprite
batch
)
;
return
;
}
color
color
=
get
color
(
)
;
float
old
alpha
=
color
.
a
;
color
.
a
*=
alpha
modulation
;
set
colors
(
color
)
;
%SELF%
(
sprite
batch
)
;
color
.
a
=
old
alpha
;
set
colors
(
color
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
alpha
modulation
==
1
)
{
%SELF%
(
sprite
batch
)
;
return
;
}
color
color
=
get
color
(
)
;
float
old
alpha
=
color
.
a
;
color
.
a
*=
alpha
modulation
;
set
colors
(
color
)
;
%SELF%
(
sprite
batch
)
;
color
.
a
=
old
alpha
;
set
colors
(
color
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.29e-01)
color
(9.24e-02)
draw
(3.75e-02)
alpha
(2.12e-02)
sprite
(9.83e-03)
render
(6.67e-03)
batch
(5.38e-03)
%UNK%
(5.27e-03)
circle
(3.53e-03)
old
(3.30e-03)
<SENTENCE_START>
{
if
(
alpha
modulation
==
1
)
{
%SELF%
(
sprite
batch
)
;
return
;
}
color
color
=
get
color
(
)
;
float
old
alpha
=
color
.
a
;
color
.
a
*=
alpha
modulation
;
set
colors
(
color
)
;
%SELF%
(
sprite
batch
)
;
color
.
a
=
old
alpha
;
set
colors
(
color
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
alpha
modulation
==
1
)
{
%SELF%
(
sprite
batch
)
;
return
;
}
color
color
=
get
color
(
)
;
float
old
alpha
=
color
.
a
;
color
.
a
*=
alpha
modulation
;
set
colors
(
color
)
;
%SELF%
(
sprite
batch
)
;
color
.
a
=
old
alpha
;
set
colors
(
color
)
;
}
<SENTENCE_END/>
clear
clear
set
(2.11e-01)
draw
(9.01e-02)
%UNK%
(8.11e-02)
load
(5.99e-02)
update
(3.42e-02)
clear
(2.77e-02)
calculate
(2.55e-02)
get
(2.04e-02)
reset
(1.91e-02)
compute
(1.75e-02)
<SENTENCE_START>
{
x
=
0
;
y
=
0
;
pools
.
free
all
(
pooled
layouts
,
true
)
;
pooled
layouts
.
%SELF%
(
)
;
layouts
.
%SELF%
(
)
;
for
(
int
i
=
0
,
n
=
idx
.
length
;
i
<
n
;
i
++
)
{
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
i
]
.
%SELF%
(
)
;
idx
[
i
]
=
0
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
x
=
0
;
y
=
0
;
pools
.
free
all
(
pooled
layouts
,
true
)
;
pooled
layouts
.
%SELF%
(
)
;
layouts
.
%SELF%
(
)
;
for
(
int
i
=
0
,
n
=
idx
.
length
;
i
<
n
;
i
++
)
{
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
i
]
.
%SELF%
(
)
;
idx
[
i
]
=
0
;
}
}
<SENTENCE_END/>
%END%
glyph
(4.39e-01)
%END%
(2.74e-01)
indices
(1.60e-01)
page
(6.47e-02)
%UNK%
(3.87e-03)
all
(2.69e-03)
0
(2.13e-03)
null
(1.90e-03)
i
(1.38e-03)
idx
(1.00e-03)
<SENTENCE_START>
{
x
=
0
;
y
=
0
;
pools
.
free
all
(
pooled
layouts
,
true
)
;
pooled
layouts
.
%SELF%
(
)
;
layouts
.
%SELF%
(
)
;
for
(
int
i
=
0
,
n
=
idx
.
length
;
i
<
n
;
i
++
)
{
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
i
]
.
%SELF%
(
)
;
idx
[
i
]
=
0
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
x
=
0
;
y
=
0
;
pools
.
free
all
(
pooled
layouts
,
true
)
;
pooled
layouts
.
%SELF%
(
)
;
layouts
.
%SELF%
(
)
;
for
(
int
i
=
0
,
n
=
idx
.
length
;
i
<
n
;
i
++
)
{
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
i
]
.
%SELF%
(
)
;
idx
[
i
]
=
0
;
}
}
<SENTENCE_END/>
require,glyphs
require
draw
(8.85e-02)
get
(5.70e-02)
add
(5.07e-02)
clear
(3.36e-02)
invalidate
(3.34e-02)
%UNK%
(3.33e-02)
find
(2.46e-02)
reset
(2.37e-02)
update
(2.31e-02)
load
(2.25e-02)
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
int
new
glyph
count
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
new
glyph
count
+=
layout
.
runs
.
get
(
i
)
.
glyphs
.
size
;
require
page
glyphs
(
0
,
new
glyph
count
)
;
}
else
{
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
array
<
glyph
>
glyphs
=
layout
.
runs
.
get
(
i
)
.
glyphs
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
temp
glyph
count
[
glyphs
.
get
(
ii
)
.
page
]
++
;
}
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
require
page
glyphs
(
i
,
temp
glyph
count
[
i
]
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
int
new
glyph
count
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
new
glyph
count
+=
layout
.
runs
.
get
(
i
)
.
glyphs
.
size
;
require
page
glyphs
(
0
,
new
glyph
count
)
;
}
else
{
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
array
<
glyph
>
glyphs
=
layout
.
runs
.
get
(
i
)
.
glyphs
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
temp
glyph
count
[
glyphs
.
get
(
ii
)
.
page
]
++
;
}
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
require
page
glyphs
(
i
,
temp
glyph
count
[
i
]
)
;
}
}
<SENTENCE_END/>
glyphs
%END%
(1.90e-01)
glyph
(4.95e-02)
%UNK%
(2.58e-02)
all
(2.49e-02)
index
(2.44e-02)
bounding
(2.31e-02)
of
(2.15e-02)
get
(2.07e-02)
count
(2.05e-02)
draw
(1.98e-02)
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
int
new
glyph
count
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
new
glyph
count
+=
layout
.
runs
.
get
(
i
)
.
glyphs
.
size
;
require
page
glyphs
(
0
,
new
glyph
count
)
;
}
else
{
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
array
<
glyph
>
glyphs
=
layout
.
runs
.
get
(
i
)
.
glyphs
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
temp
glyph
count
[
glyphs
.
get
(
ii
)
.
page
]
++
;
}
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
require
page
glyphs
(
i
,
temp
glyph
count
[
i
]
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
int
new
glyph
count
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
new
glyph
count
+=
layout
.
runs
.
get
(
i
)
.
glyphs
.
size
;
require
page
glyphs
(
0
,
new
glyph
count
)
;
}
else
{
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
array
<
glyph
>
glyphs
=
layout
.
runs
.
get
(
i
)
.
glyphs
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
temp
glyph
count
[
glyphs
.
get
(
ii
)
.
page
]
++
;
}
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
require
page
glyphs
(
i
,
temp
glyph
count
[
i
]
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(4.02e-01)
all
(3.46e-02)
count
(2.23e-02)
index
(2.18e-02)
of
(2.11e-02)
%UNK%
(1.91e-02)
bounding
(1.72e-02)
glyph
(1.50e-02)
get
(1.07e-02)
for
(9.67e-03)
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
int
new
glyph
count
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
new
glyph
count
+=
layout
.
runs
.
get
(
i
)
.
glyphs
.
size
;
require
page
glyphs
(
0
,
new
glyph
count
)
;
}
else
{
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
array
<
glyph
>
glyphs
=
layout
.
runs
.
get
(
i
)
.
glyphs
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
temp
glyph
count
[
glyphs
.
get
(
ii
)
.
page
]
++
;
}
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
require
page
glyphs
(
i
,
temp
glyph
count
[
i
]
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
vertices
.
length
==
1
)
{
int
new
glyph
count
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
new
glyph
count
+=
layout
.
runs
.
get
(
i
)
.
glyphs
.
size
;
require
page
glyphs
(
0
,
new
glyph
count
)
;
}
else
{
int
[
]
temp
glyph
count
=
this
.
temp
glyph
count
;
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
temp
glyph
count
[
i
]
=
0
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
array
<
glyph
>
glyphs
=
layout
.
runs
.
get
(
i
)
.
glyphs
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
temp
glyph
count
[
glyphs
.
get
(
ii
)
.
page
]
++
;
}
for
(
int
i
=
0
,
n
=
temp
glyph
count
.
length
;
i
<
n
;
i
++
)
require
page
glyphs
(
i
,
temp
glyph
count
[
i
]
)
;
}
}
<SENTENCE_END/>
require,page,glyphs
require
set
(1.33e-01)
get
(1.04e-01)
draw
(8.75e-02)
update
(5.48e-02)
load
(5.46e-02)
vertex
(4.95e-02)
%END%
(4.87e-02)
generate
(3.35e-02)
calculate
(2.51e-02)
vertices
(2.09e-02)
<SENTENCE_START>
{
if
(
page
glyph
indices
!=
null
)
{
if
(
glyph
count
>
page
glyph
indices
[
page
]
.
items
.
length
)
page
glyph
indices
[
page
]
.
ensure
capacity
(
glyph
count
-
page
glyph
indices
[
page
]
.
items
.
length
)
;
}
int
vertex
count
=
idx
[
page
]
+
glyph
count
*
20
;
float
[
]
vertices
=
page
vertices
[
page
]
;
if
(
vertices
==
null
)
{
page
vertices
[
page
]
=
new
float
[
vertex
count
]
;
}
else
if
(
vertices
.
length
<
vertex
count
)
{
float
[
]
new
vertices
=
new
float
[
vertex
count
]
;
system
.
arraycopy
(
vertices
,
0
,
new
vertices
,
0
,
idx
[
page
]
)
;
page
vertices
[
page
]
=
new
vertices
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
glyph
indices
!=
null
)
{
if
(
glyph
count
>
page
glyph
indices
[
page
]
.
items
.
length
)
page
glyph
indices
[
page
]
.
ensure
capacity
(
glyph
count
-
page
glyph
indices
[
page
]
.
items
.
length
)
;
}
int
vertex
count
=
idx
[
page
]
+
glyph
count
*
20
;
float
[
]
vertices
=
page
vertices
[
page
]
;
if
(
vertices
==
null
)
{
page
vertices
[
page
]
=
new
float
[
vertex
count
]
;
}
else
if
(
vertices
.
length
<
vertex
count
)
{
float
[
]
new
vertices
=
new
float
[
vertex
count
]
;
system
.
arraycopy
(
vertices
,
0
,
new
vertices
,
0
,
idx
[
page
]
)
;
page
vertices
[
page
]
=
new
vertices
;
}
}
<SENTENCE_END/>
page
glyph
(3.76e-01)
%END%
(3.18e-01)
page
(5.31e-02)
vertices
(4.19e-02)
indices
(3.88e-02)
count
(2.55e-02)
vertex
(1.76e-02)
new
(6.89e-03)
items
(2.97e-03)
update
(2.36e-03)
<SENTENCE_START>
{
if
(
page
glyph
indices
!=
null
)
{
if
(
glyph
count
>
page
glyph
indices
[
page
]
.
items
.
length
)
page
glyph
indices
[
page
]
.
ensure
capacity
(
glyph
count
-
page
glyph
indices
[
page
]
.
items
.
length
)
;
}
int
vertex
count
=
idx
[
page
]
+
glyph
count
*
20
;
float
[
]
vertices
=
page
vertices
[
page
]
;
if
(
vertices
==
null
)
{
page
vertices
[
page
]
=
new
float
[
vertex
count
]
;
}
else
if
(
vertices
.
length
<
vertex
count
)
{
float
[
]
new
vertices
=
new
float
[
vertex
count
]
;
system
.
arraycopy
(
vertices
,
0
,
new
vertices
,
0
,
idx
[
page
]
)
;
page
vertices
[
page
]
=
new
vertices
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
glyph
indices
!=
null
)
{
if
(
glyph
count
>
page
glyph
indices
[
page
]
.
items
.
length
)
page
glyph
indices
[
page
]
.
ensure
capacity
(
glyph
count
-
page
glyph
indices
[
page
]
.
items
.
length
)
;
}
int
vertex
count
=
idx
[
page
]
+
glyph
count
*
20
;
float
[
]
vertices
=
page
vertices
[
page
]
;
if
(
vertices
==
null
)
{
page
vertices
[
page
]
=
new
float
[
vertex
count
]
;
}
else
if
(
vertices
.
length
<
vertex
count
)
{
float
[
]
new
vertices
=
new
float
[
vertex
count
]
;
system
.
arraycopy
(
vertices
,
0
,
new
vertices
,
0
,
idx
[
page
]
)
;
page
vertices
[
page
]
=
new
vertices
;
}
}
<SENTENCE_END/>
glyphs
%END%
(6.68e-01)
count
(6.84e-02)
indices
(6.79e-02)
glyph
(5.36e-02)
vertices
(2.25e-02)
page
(1.44e-02)
vertex
(7.85e-03)
new
(3.32e-03)
items
(3.32e-03)
length
(1.97e-03)
<SENTENCE_START>
{
if
(
page
glyph
indices
!=
null
)
{
if
(
glyph
count
>
page
glyph
indices
[
page
]
.
items
.
length
)
page
glyph
indices
[
page
]
.
ensure
capacity
(
glyph
count
-
page
glyph
indices
[
page
]
.
items
.
length
)
;
}
int
vertex
count
=
idx
[
page
]
+
glyph
count
*
20
;
float
[
]
vertices
=
page
vertices
[
page
]
;
if
(
vertices
==
null
)
{
page
vertices
[
page
]
=
new
float
[
vertex
count
]
;
}
else
if
(
vertices
.
length
<
vertex
count
)
{
float
[
]
new
vertices
=
new
float
[
vertex
count
]
;
system
.
arraycopy
(
vertices
,
0
,
new
vertices
,
0
,
idx
[
page
]
)
;
page
vertices
[
page
]
=
new
vertices
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
glyph
indices
!=
null
)
{
if
(
glyph
count
>
page
glyph
indices
[
page
]
.
items
.
length
)
page
glyph
indices
[
page
]
.
ensure
capacity
(
glyph
count
-
page
glyph
indices
[
page
]
.
items
.
length
)
;
}
int
vertex
count
=
idx
[
page
]
+
glyph
count
*
20
;
float
[
]
vertices
=
page
vertices
[
page
]
;
if
(
vertices
==
null
)
{
page
vertices
[
page
]
=
new
float
[
vertex
count
]
;
}
else
if
(
vertices
.
length
<
vertex
count
)
{
float
[
]
new
vertices
=
new
float
[
vertex
count
]
;
system
.
arraycopy
(
vertices
,
0
,
new
vertices
,
0
,
idx
[
page
]
)
;
page
vertices
[
page
]
=
new
vertices
;
}
}
<SENTENCE_END/>
%END%
%END%
(9.46e-01)
vertices
(5.53e-03)
indices
(4.75e-03)
count
(4.61e-03)
page
(2.79e-03)
glyph
(2.56e-03)
vertex
(1.67e-03)
new
(8.93e-04)
%UNK%
(6.71e-04)
particles
(5.36e-04)
<SENTENCE_START>
{
if
(
page
glyph
indices
!=
null
)
{
if
(
glyph
count
>
page
glyph
indices
[
page
]
.
items
.
length
)
page
glyph
indices
[
page
]
.
ensure
capacity
(
glyph
count
-
page
glyph
indices
[
page
]
.
items
.
length
)
;
}
int
vertex
count
=
idx
[
page
]
+
glyph
count
*
20
;
float
[
]
vertices
=
page
vertices
[
page
]
;
if
(
vertices
==
null
)
{
page
vertices
[
page
]
=
new
float
[
vertex
count
]
;
}
else
if
(
vertices
.
length
<
vertex
count
)
{
float
[
]
new
vertices
=
new
float
[
vertex
count
]
;
system
.
arraycopy
(
vertices
,
0
,
new
vertices
,
0
,
idx
[
page
]
)
;
page
vertices
[
page
]
=
new
vertices
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
page
glyph
indices
!=
null
)
{
if
(
glyph
count
>
page
glyph
indices
[
page
]
.
items
.
length
)
page
glyph
indices
[
page
]
.
ensure
capacity
(
glyph
count
-
page
glyph
indices
[
page
]
.
items
.
length
)
;
}
int
vertex
count
=
idx
[
page
]
+
glyph
count
*
20
;
float
[
]
vertices
=
page
vertices
[
page
]
;
if
(
vertices
==
null
)
{
page
vertices
[
page
]
=
new
float
[
vertex
count
]
;
}
else
if
(
vertices
.
length
<
vertex
count
)
{
float
[
]
new
vertices
=
new
float
[
vertex
count
]
;
system
.
arraycopy
(
vertices
,
0
,
new
vertices
,
0
,
idx
[
page
]
)
;
page
vertices
[
page
]
=
new
vertices
;
}
}
<SENTENCE_END/>
add,to,cache
add
set
(1.71e-01)
load
(1.26e-01)
get
(8.45e-02)
draw
(5.86e-02)
%END%
(5.73e-02)
create
(4.23e-02)
generate
(3.36e-02)
%UNK%
(2.46e-02)
add
(2.19e-02)
calculate
(1.59e-02)
<SENTENCE_START>
{
int
page
count
=
font
.
regions
.
size
;
if
(
page
vertices
.
length
<
page
count
)
{
float
[
]
[
]
new
page
vertices
=
new
float
[
page
count
]
[
]
;
system
.
arraycopy
(
page
vertices
,
0
,
new
page
vertices
,
0
,
page
vertices
.
length
)
;
page
vertices
=
new
page
vertices
;
int
[
]
new
idx
=
new
int
[
page
count
]
;
system
.
arraycopy
(
idx
,
0
,
new
idx
,
0
,
idx
.
length
)
;
idx
=
new
idx
;
int
array
[
]
new
page
glyph
indices
=
new
int
array
[
page
count
]
;
int
page
glyph
indices
length
=
0
;
if
(
page
glyph
indices
!=
null
)
{
page
glyph
indices
length
=
page
glyph
indices
.
length
;
system
.
arraycopy
(
page
glyph
indices
,
0
,
new
page
glyph
indices
,
0
,
page
glyph
indices
.
length
)
;
}
for
(
int
i
=
page
glyph
indices
length
;
i
<
page
count
;
i
++
)
new
page
glyph
indices
[
i
]
=
new
int
array
(
)
;
page
glyph
indices
=
new
page
glyph
indices
;
temp
glyph
count
=
new
int
[
page
count
]
;
}
layouts
.
add
(
layout
)
;
require
glyphs
(
layout
)
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
i
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
array
x
advances
=
run
.
x
advances
;
float
color
=
run
.
color
.
to
float
bits
(
)
;
float
gx
=
x
+
run
.
x
,
gy
=
y
+
run
.
y
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
glyph
=
glyphs
.
get
(
ii
)
;
gx
+=
x
advances
.
get
(
ii
)
;
add
glyph
(
glyph
,
gx
,
gy
,
color
)
;
}
}
current
tint
=
white
tint
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
page
count
=
font
.
regions
.
size
;
if
(
page
vertices
.
length
<
page
count
)
{
float
[
]
[
]
new
page
vertices
=
new
float
[
page
count
]
[
]
;
system
.
arraycopy
(
page
vertices
,
0
,
new
page
vertices
,
0
,
page
vertices
.
length
)
;
page
vertices
=
new
page
vertices
;
int
[
]
new
idx
=
new
int
[
page
count
]
;
system
.
arraycopy
(
idx
,
0
,
new
idx
,
0
,
idx
.
length
)
;
idx
=
new
idx
;
int
array
[
]
new
page
glyph
indices
=
new
int
array
[
page
count
]
;
int
page
glyph
indices
length
=
0
;
if
(
page
glyph
indices
!=
null
)
{
page
glyph
indices
length
=
page
glyph
indices
.
length
;
system
.
arraycopy
(
page
glyph
indices
,
0
,
new
page
glyph
indices
,
0
,
page
glyph
indices
.
length
)
;
}
for
(
int
i
=
page
glyph
indices
length
;
i
<
page
count
;
i
++
)
new
page
glyph
indices
[
i
]
=
new
int
array
(
)
;
page
glyph
indices
=
new
page
glyph
indices
;
temp
glyph
count
=
new
int
[
page
count
]
;
}
layouts
.
add
(
layout
)
;
require
glyphs
(
layout
)
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
i
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
array
x
advances
=
run
.
x
advances
;
float
color
=
run
.
color
.
to
float
bits
(
)
;
float
gx
=
x
+
run
.
x
,
gy
=
y
+
run
.
y
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
glyph
=
glyphs
.
get
(
ii
)
;
gx
+=
x
advances
.
get
(
ii
)
;
add
glyph
(
glyph
,
gx
,
gy
,
color
)
;
}
}
current
tint
=
white
tint
;
}
<SENTENCE_END/>
to
%END%
(4.32e-01)
glyph
(1.12e-01)
indices
(4.93e-02)
page
(3.57e-02)
get
(1.61e-02)
%UNK%
(1.46e-02)
load
(1.01e-02)
draw
(8.25e-03)
new
(7.90e-03)
vertices
(7.73e-03)
<SENTENCE_START>
{
int
page
count
=
font
.
regions
.
size
;
if
(
page
vertices
.
length
<
page
count
)
{
float
[
]
[
]
new
page
vertices
=
new
float
[
page
count
]
[
]
;
system
.
arraycopy
(
page
vertices
,
0
,
new
page
vertices
,
0
,
page
vertices
.
length
)
;
page
vertices
=
new
page
vertices
;
int
[
]
new
idx
=
new
int
[
page
count
]
;
system
.
arraycopy
(
idx
,
0
,
new
idx
,
0
,
idx
.
length
)
;
idx
=
new
idx
;
int
array
[
]
new
page
glyph
indices
=
new
int
array
[
page
count
]
;
int
page
glyph
indices
length
=
0
;
if
(
page
glyph
indices
!=
null
)
{
page
glyph
indices
length
=
page
glyph
indices
.
length
;
system
.
arraycopy
(
page
glyph
indices
,
0
,
new
page
glyph
indices
,
0
,
page
glyph
indices
.
length
)
;
}
for
(
int
i
=
page
glyph
indices
length
;
i
<
page
count
;
i
++
)
new
page
glyph
indices
[
i
]
=
new
int
array
(
)
;
page
glyph
indices
=
new
page
glyph
indices
;
temp
glyph
count
=
new
int
[
page
count
]
;
}
layouts
.
add
(
layout
)
;
require
glyphs
(
layout
)
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
i
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
array
x
advances
=
run
.
x
advances
;
float
color
=
run
.
color
.
to
float
bits
(
)
;
float
gx
=
x
+
run
.
x
,
gy
=
y
+
run
.
y
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
glyph
=
glyphs
.
get
(
ii
)
;
gx
+=
x
advances
.
get
(
ii
)
;
add
glyph
(
glyph
,
gx
,
gy
,
color
)
;
}
}
current
tint
=
white
tint
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
page
count
=
font
.
regions
.
size
;
if
(
page
vertices
.
length
<
page
count
)
{
float
[
]
[
]
new
page
vertices
=
new
float
[
page
count
]
[
]
;
system
.
arraycopy
(
page
vertices
,
0
,
new
page
vertices
,
0
,
page
vertices
.
length
)
;
page
vertices
=
new
page
vertices
;
int
[
]
new
idx
=
new
int
[
page
count
]
;
system
.
arraycopy
(
idx
,
0
,
new
idx
,
0
,
idx
.
length
)
;
idx
=
new
idx
;
int
array
[
]
new
page
glyph
indices
=
new
int
array
[
page
count
]
;
int
page
glyph
indices
length
=
0
;
if
(
page
glyph
indices
!=
null
)
{
page
glyph
indices
length
=
page
glyph
indices
.
length
;
system
.
arraycopy
(
page
glyph
indices
,
0
,
new
page
glyph
indices
,
0
,
page
glyph
indices
.
length
)
;
}
for
(
int
i
=
page
glyph
indices
length
;
i
<
page
count
;
i
++
)
new
page
glyph
indices
[
i
]
=
new
int
array
(
)
;
page
glyph
indices
=
new
page
glyph
indices
;
temp
glyph
count
=
new
int
[
page
count
]
;
}
layouts
.
add
(
layout
)
;
require
glyphs
(
layout
)
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
i
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
array
x
advances
=
run
.
x
advances
;
float
color
=
run
.
color
.
to
float
bits
(
)
;
float
gx
=
x
+
run
.
x
,
gy
=
y
+
run
.
y
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
glyph
=
glyphs
.
get
(
ii
)
;
gx
+=
x
advances
.
get
(
ii
)
;
add
glyph
(
glyph
,
gx
,
gy
,
color
)
;
}
}
current
tint
=
white
tint
;
}
<SENTENCE_END/>
cache
%END%
(6.20e-01)
indices
(5.55e-02)
glyph
(3.17e-02)
page
(1.35e-02)
length
(1.08e-02)
%UNK%
(1.03e-02)
count
(7.35e-03)
get
(6.50e-03)
vertices
(6.39e-03)
new
(6.19e-03)
<SENTENCE_START>
{
int
page
count
=
font
.
regions
.
size
;
if
(
page
vertices
.
length
<
page
count
)
{
float
[
]
[
]
new
page
vertices
=
new
float
[
page
count
]
[
]
;
system
.
arraycopy
(
page
vertices
,
0
,
new
page
vertices
,
0
,
page
vertices
.
length
)
;
page
vertices
=
new
page
vertices
;
int
[
]
new
idx
=
new
int
[
page
count
]
;
system
.
arraycopy
(
idx
,
0
,
new
idx
,
0
,
idx
.
length
)
;
idx
=
new
idx
;
int
array
[
]
new
page
glyph
indices
=
new
int
array
[
page
count
]
;
int
page
glyph
indices
length
=
0
;
if
(
page
glyph
indices
!=
null
)
{
page
glyph
indices
length
=
page
glyph
indices
.
length
;
system
.
arraycopy
(
page
glyph
indices
,
0
,
new
page
glyph
indices
,
0
,
page
glyph
indices
.
length
)
;
}
for
(
int
i
=
page
glyph
indices
length
;
i
<
page
count
;
i
++
)
new
page
glyph
indices
[
i
]
=
new
int
array
(
)
;
page
glyph
indices
=
new
page
glyph
indices
;
temp
glyph
count
=
new
int
[
page
count
]
;
}
layouts
.
add
(
layout
)
;
require
glyphs
(
layout
)
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
i
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
array
x
advances
=
run
.
x
advances
;
float
color
=
run
.
color
.
to
float
bits
(
)
;
float
gx
=
x
+
run
.
x
,
gy
=
y
+
run
.
y
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
glyph
=
glyphs
.
get
(
ii
)
;
gx
+=
x
advances
.
get
(
ii
)
;
add
glyph
(
glyph
,
gx
,
gy
,
color
)
;
}
}
current
tint
=
white
tint
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
page
count
=
font
.
regions
.
size
;
if
(
page
vertices
.
length
<
page
count
)
{
float
[
]
[
]
new
page
vertices
=
new
float
[
page
count
]
[
]
;
system
.
arraycopy
(
page
vertices
,
0
,
new
page
vertices
,
0
,
page
vertices
.
length
)
;
page
vertices
=
new
page
vertices
;
int
[
]
new
idx
=
new
int
[
page
count
]
;
system
.
arraycopy
(
idx
,
0
,
new
idx
,
0
,
idx
.
length
)
;
idx
=
new
idx
;
int
array
[
]
new
page
glyph
indices
=
new
int
array
[
page
count
]
;
int
page
glyph
indices
length
=
0
;
if
(
page
glyph
indices
!=
null
)
{
page
glyph
indices
length
=
page
glyph
indices
.
length
;
system
.
arraycopy
(
page
glyph
indices
,
0
,
new
page
glyph
indices
,
0
,
page
glyph
indices
.
length
)
;
}
for
(
int
i
=
page
glyph
indices
length
;
i
<
page
count
;
i
++
)
new
page
glyph
indices
[
i
]
=
new
int
array
(
)
;
page
glyph
indices
=
new
page
glyph
indices
;
temp
glyph
count
=
new
int
[
page
count
]
;
}
layouts
.
add
(
layout
)
;
require
glyphs
(
layout
)
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
i
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
array
x
advances
=
run
.
x
advances
;
float
color
=
run
.
color
.
to
float
bits
(
)
;
float
gx
=
x
+
run
.
x
,
gy
=
y
+
run
.
y
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
glyph
=
glyphs
.
get
(
ii
)
;
gx
+=
x
advances
.
get
(
ii
)
;
add
glyph
(
glyph
,
gx
,
gy
,
color
)
;
}
}
current
tint
=
white
tint
;
}
<SENTENCE_END/>
%END%
%END%
(8.48e-01)
%UNK%
(8.49e-03)
get
(4.32e-03)
indices
(4.13e-03)
all
(3.77e-03)
glyph
(3.29e-03)
to
(2.64e-03)
page
(2.48e-03)
create
(2.40e-03)
load
(2.27e-03)
<SENTENCE_START>
{
int
page
count
=
font
.
regions
.
size
;
if
(
page
vertices
.
length
<
page
count
)
{
float
[
]
[
]
new
page
vertices
=
new
float
[
page
count
]
[
]
;
system
.
arraycopy
(
page
vertices
,
0
,
new
page
vertices
,
0
,
page
vertices
.
length
)
;
page
vertices
=
new
page
vertices
;
int
[
]
new
idx
=
new
int
[
page
count
]
;
system
.
arraycopy
(
idx
,
0
,
new
idx
,
0
,
idx
.
length
)
;
idx
=
new
idx
;
int
array
[
]
new
page
glyph
indices
=
new
int
array
[
page
count
]
;
int
page
glyph
indices
length
=
0
;
if
(
page
glyph
indices
!=
null
)
{
page
glyph
indices
length
=
page
glyph
indices
.
length
;
system
.
arraycopy
(
page
glyph
indices
,
0
,
new
page
glyph
indices
,
0
,
page
glyph
indices
.
length
)
;
}
for
(
int
i
=
page
glyph
indices
length
;
i
<
page
count
;
i
++
)
new
page
glyph
indices
[
i
]
=
new
int
array
(
)
;
page
glyph
indices
=
new
page
glyph
indices
;
temp
glyph
count
=
new
int
[
page
count
]
;
}
layouts
.
add
(
layout
)
;
require
glyphs
(
layout
)
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
i
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
array
x
advances
=
run
.
x
advances
;
float
color
=
run
.
color
.
to
float
bits
(
)
;
float
gx
=
x
+
run
.
x
,
gy
=
y
+
run
.
y
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
glyph
=
glyphs
.
get
(
ii
)
;
gx
+=
x
advances
.
get
(
ii
)
;
add
glyph
(
glyph
,
gx
,
gy
,
color
)
;
}
}
current
tint
=
white
tint
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
int
page
count
=
font
.
regions
.
size
;
if
(
page
vertices
.
length
<
page
count
)
{
float
[
]
[
]
new
page
vertices
=
new
float
[
page
count
]
[
]
;
system
.
arraycopy
(
page
vertices
,
0
,
new
page
vertices
,
0
,
page
vertices
.
length
)
;
page
vertices
=
new
page
vertices
;
int
[
]
new
idx
=
new
int
[
page
count
]
;
system
.
arraycopy
(
idx
,
0
,
new
idx
,
0
,
idx
.
length
)
;
idx
=
new
idx
;
int
array
[
]
new
page
glyph
indices
=
new
int
array
[
page
count
]
;
int
page
glyph
indices
length
=
0
;
if
(
page
glyph
indices
!=
null
)
{
page
glyph
indices
length
=
page
glyph
indices
.
length
;
system
.
arraycopy
(
page
glyph
indices
,
0
,
new
page
glyph
indices
,
0
,
page
glyph
indices
.
length
)
;
}
for
(
int
i
=
page
glyph
indices
length
;
i
<
page
count
;
i
++
)
new
page
glyph
indices
[
i
]
=
new
int
array
(
)
;
page
glyph
indices
=
new
page
glyph
indices
;
temp
glyph
count
=
new
int
[
page
count
]
;
}
layouts
.
add
(
layout
)
;
require
glyphs
(
layout
)
;
for
(
int
i
=
0
,
n
=
layout
.
runs
.
size
;
i
<
n
;
i
++
)
{
glyph
run
run
=
layout
.
runs
.
get
(
i
)
;
array
<
glyph
>
glyphs
=
run
.
glyphs
;
float
array
x
advances
=
run
.
x
advances
;
float
color
=
run
.
color
.
to
float
bits
(
)
;
float
gx
=
x
+
run
.
x
,
gy
=
y
+
run
.
y
;
for
(
int
ii
=
0
,
nn
=
glyphs
.
size
;
ii
<
nn
;
ii
++
)
{
glyph
glyph
=
glyphs
.
get
(
ii
)
;
gx
+=
x
advances
.
get
(
ii
)
;
add
glyph
(
glyph
,
gx
,
gy
,
color
)
;
}
}
current
tint
=
white
tint
;
}
<SENTENCE_END/>
add,glyph
add
set
(3.06e-01)
add
(8.50e-02)
create
(7.71e-02)
translate
(5.63e-02)
draw
(5.53e-02)
scale
(2.88e-02)
calculate
(2.14e-02)
generate
(2.13e-02)
%UNK%
(1.99e-02)
bind
(1.76e-02)
<SENTENCE_START>
{
final
float
scale
x
=
font
.
data
.
scale
x
,
scale
y
=
font
.
data
.
scale
y
;
x
+=
glyph
.
xoffset
*
scale
x
;
y
+=
glyph
.
yoffset
*
scale
y
;
float
width
=
glyph
.
width
*
scale
x
,
height
=
glyph
.
height
*
scale
y
;
final
float
u
=
glyph
.
u
,
u
2
=
glyph
.
u
2
,
v
=
glyph
.
v
,
v
2
=
glyph
.
v
2
;
if
(
integer
)
{
x
=
math
.
round
(
x
)
;
y
=
math
.
round
(
y
)
;
width
=
math
.
round
(
width
)
;
height
=
math
.
round
(
height
)
;
}
final
float
x
2
=
x
+
width
,
y
2
=
y
+
height
;
final
int
page
=
glyph
.
page
;
int
idx
=
this
.
idx
[
page
]
;
this
.
idx
[
page
]
+=
20
;
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
page
]
.
add
(
glyph
count
++
)
;
final
float
[
]
vertices
=
page
vertices
[
page
]
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
]
=
v
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
float
scale
x
=
font
.
data
.
scale
x
,
scale
y
=
font
.
data
.
scale
y
;
x
+=
glyph
.
xoffset
*
scale
x
;
y
+=
glyph
.
yoffset
*
scale
y
;
float
width
=
glyph
.
width
*
scale
x
,
height
=
glyph
.
height
*
scale
y
;
final
float
u
=
glyph
.
u
,
u
2
=
glyph
.
u
2
,
v
=
glyph
.
v
,
v
2
=
glyph
.
v
2
;
if
(
integer
)
{
x
=
math
.
round
(
x
)
;
y
=
math
.
round
(
y
)
;
width
=
math
.
round
(
width
)
;
height
=
math
.
round
(
height
)
;
}
final
float
x
2
=
x
+
width
,
y
2
=
y
+
height
;
final
int
page
=
glyph
.
page
;
int
idx
=
this
.
idx
[
page
]
;
this
.
idx
[
page
]
+=
20
;
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
page
]
.
add
(
glyph
count
++
)
;
final
float
[
]
vertices
=
page
vertices
[
page
]
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
]
=
v
;
}
<SENTENCE_END/>
glyph
%END%
(6.95e-01)
vertices
(1.81e-02)
glyph
(1.73e-02)
scale
(1.25e-02)
page
(8.21e-03)
vertex
(7.89e-03)
x
(7.28e-03)
draw
(5.79e-03)
y
(5.22e-03)
%UNK%
(5.16e-03)
<SENTENCE_START>
{
final
float
scale
x
=
font
.
data
.
scale
x
,
scale
y
=
font
.
data
.
scale
y
;
x
+=
glyph
.
xoffset
*
scale
x
;
y
+=
glyph
.
yoffset
*
scale
y
;
float
width
=
glyph
.
width
*
scale
x
,
height
=
glyph
.
height
*
scale
y
;
final
float
u
=
glyph
.
u
,
u
2
=
glyph
.
u
2
,
v
=
glyph
.
v
,
v
2
=
glyph
.
v
2
;
if
(
integer
)
{
x
=
math
.
round
(
x
)
;
y
=
math
.
round
(
y
)
;
width
=
math
.
round
(
width
)
;
height
=
math
.
round
(
height
)
;
}
final
float
x
2
=
x
+
width
,
y
2
=
y
+
height
;
final
int
page
=
glyph
.
page
;
int
idx
=
this
.
idx
[
page
]
;
this
.
idx
[
page
]
+=
20
;
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
page
]
.
add
(
glyph
count
++
)
;
final
float
[
]
vertices
=
page
vertices
[
page
]
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
]
=
v
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
float
scale
x
=
font
.
data
.
scale
x
,
scale
y
=
font
.
data
.
scale
y
;
x
+=
glyph
.
xoffset
*
scale
x
;
y
+=
glyph
.
yoffset
*
scale
y
;
float
width
=
glyph
.
width
*
scale
x
,
height
=
glyph
.
height
*
scale
y
;
final
float
u
=
glyph
.
u
,
u
2
=
glyph
.
u
2
,
v
=
glyph
.
v
,
v
2
=
glyph
.
v
2
;
if
(
integer
)
{
x
=
math
.
round
(
x
)
;
y
=
math
.
round
(
y
)
;
width
=
math
.
round
(
width
)
;
height
=
math
.
round
(
height
)
;
}
final
float
x
2
=
x
+
width
,
y
2
=
y
+
height
;
final
int
page
=
glyph
.
page
;
int
idx
=
this
.
idx
[
page
]
;
this
.
idx
[
page
]
+=
20
;
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
page
]
.
add
(
glyph
count
++
)
;
final
float
[
]
vertices
=
page
vertices
[
page
]
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
]
=
v
;
}
<SENTENCE_END/>
%END%
%END%
(8.37e-01)
vertices
(7.52e-03)
scale
(7.15e-03)
vertex
(5.29e-03)
glyph
(3.92e-03)
x
(3.65e-03)
%UNK%
(3.61e-03)
polygon
(3.47e-03)
90
(2.90e-03)
transform
(2.88e-03)
<SENTENCE_START>
{
final
float
scale
x
=
font
.
data
.
scale
x
,
scale
y
=
font
.
data
.
scale
y
;
x
+=
glyph
.
xoffset
*
scale
x
;
y
+=
glyph
.
yoffset
*
scale
y
;
float
width
=
glyph
.
width
*
scale
x
,
height
=
glyph
.
height
*
scale
y
;
final
float
u
=
glyph
.
u
,
u
2
=
glyph
.
u
2
,
v
=
glyph
.
v
,
v
2
=
glyph
.
v
2
;
if
(
integer
)
{
x
=
math
.
round
(
x
)
;
y
=
math
.
round
(
y
)
;
width
=
math
.
round
(
width
)
;
height
=
math
.
round
(
height
)
;
}
final
float
x
2
=
x
+
width
,
y
2
=
y
+
height
;
final
int
page
=
glyph
.
page
;
int
idx
=
this
.
idx
[
page
]
;
this
.
idx
[
page
]
+=
20
;
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
page
]
.
add
(
glyph
count
++
)
;
final
float
[
]
vertices
=
page
vertices
[
page
]
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
]
=
v
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
final
float
scale
x
=
font
.
data
.
scale
x
,
scale
y
=
font
.
data
.
scale
y
;
x
+=
glyph
.
xoffset
*
scale
x
;
y
+=
glyph
.
yoffset
*
scale
y
;
float
width
=
glyph
.
width
*
scale
x
,
height
=
glyph
.
height
*
scale
y
;
final
float
u
=
glyph
.
u
,
u
2
=
glyph
.
u
2
,
v
=
glyph
.
v
,
v
2
=
glyph
.
v
2
;
if
(
integer
)
{
x
=
math
.
round
(
x
)
;
y
=
math
.
round
(
y
)
;
width
=
math
.
round
(
width
)
;
height
=
math
.
round
(
height
)
;
}
final
float
x
2
=
x
+
width
,
y
2
=
y
+
height
;
final
int
page
=
glyph
.
page
;
int
idx
=
this
.
idx
[
page
]
;
this
.
idx
[
page
]
+=
20
;
if
(
page
glyph
indices
!=
null
)
page
glyph
indices
[
page
]
.
add
(
glyph
count
++
)
;
final
float
[
]
vertices
=
page
vertices
[
page
]
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
;
vertices
[
idx
++
]
=
x
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
2
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
++
]
=
v
2
;
vertices
[
idx
++
]
=
x
2
;
vertices
[
idx
++
]
=
y
;
vertices
[
idx
++
]
=
color
;
vertices
[
idx
++
]
=
u
2
;
vertices
[
idx
]
=
v
;
}
<SENTENCE_END/>
set,text
set
add
(9.00e-01)
insert
(3.88e-02)
append
(1.26e-02)
draw
(1.05e-02)
put
(9.16e-03)
get
(3.25e-03)
text
(1.73e-03)
str
(1.65e-03)
return
(1.20e-03)
pack
(1.02e-03)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
)
;
}
<SENTENCE_END/>
text
%END%
(9.44e-01)
to
(4.18e-03)
insert
(2.79e-03)
all
(2.72e-03)
0
(2.35e-03)
at
(2.12e-03)
str
(1.96e-03)
text
(1.76e-03)
by
(1.63e-03)
add
(1.51e-03)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.72e-01)
all
(2.30e-03)
text
(1.57e-03)
to
(1.56e-03)
0
(1.24e-03)
at
(1.07e-03)
str
(8.43e-04)
by
(8.08e-04)
%UNK%
(6.81e-04)
triangles
(6.22e-04)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
)
;
}
<SENTENCE_END/>
set,text
set
add
(8.81e-01)
insert
(3.43e-02)
append
(2.09e-02)
put
(1.24e-02)
draw
(1.20e-02)
get
(8.86e-03)
pack
(1.98e-03)
text
(1.92e-03)
str
(1.78e-03)
return
(1.27e-03)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
text
%END%
(9.30e-01)
at
(8.52e-03)
to
(3.83e-03)
by
(2.78e-03)
insert
(2.49e-03)
%UNK%
(1.84e-03)
str
(1.49e-03)
wrap
(1.48e-03)
all
(1.45e-03)
draw
(1.41e-03)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.69e-01)
at
(3.33e-03)
all
(1.77e-03)
to
(1.49e-03)
text
(1.41e-03)
by
(1.34e-03)
%UNK%
(8.58e-04)
str
(8.45e-04)
width
(6.68e-04)
string
(6.51e-04)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
set,text
set
add
(8.43e-01)
insert
(3.48e-02)
draw
(3.19e-02)
put
(1.92e-02)
append
(1.92e-02)
get
(8.00e-03)
pack
(3.43e-03)
set
(2.52e-03)
text
(2.41e-03)
remove
(2.21e-03)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
text
%END%
(8.66e-01)
at
(8.97e-03)
%UNK%
(7.80e-03)
str
(6.05e-03)
to
(5.81e-03)
draw
(4.07e-03)
text
(3.91e-03)
by
(3.11e-03)
line
(2.70e-03)
insert
(2.63e-03)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.62e-01)
at
(2.56e-03)
%UNK%
(2.52e-03)
to
(1.40e-03)
by
(1.12e-03)
all
(1.10e-03)
text
(9.41e-04)
start
(9.13e-04)
width
(8.68e-04)
str
(6.96e-04)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
)
;
}
<SENTENCE_END/>
set,text
set
add
(8.50e-01)
insert
(3.46e-02)
draw
(2.72e-02)
put
(2.20e-02)
append
(1.54e-02)
get
(6.01e-03)
pack
(3.44e-03)
set
(2.54e-03)
text
(2.29e-03)
move
(2.11e-03)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
truncate
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
truncate
)
;
}
<SENTENCE_END/>
text
%END%
(8.69e-01)
str
(8.91e-03)
%UNK%
(7.61e-03)
at
(5.37e-03)
to
(4.14e-03)
text
(4.07e-03)
draw
(3.86e-03)
add
(2.88e-03)
insert
(2.79e-03)
start
(2.38e-03)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
truncate
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
truncate
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.58e-01)
%UNK%
(3.06e-03)
at
(1.76e-03)
all
(1.49e-03)
to
(1.30e-03)
start
(1.13e-03)
width
(1.10e-03)
by
(9.10e-04)
text
(9.05e-04)
str
(8.88e-04)
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
truncate
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
return
add
text
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
truncate
)
;
}
<SENTENCE_END/>
set,text
set
add
(8.15e-01)
clear
(9.30e-02)
draw
(2.83e-02)
set
(2.47e-02)
run
(6.26e-03)
text
(5.24e-03)
remove
(4.52e-03)
insert
(2.25e-03)
button
(1.72e-03)
translate
(1.38e-03)
<SENTENCE_START>
{
clear
(
)
;
add
text
(
layout
,
x
,
y
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
add
text
(
layout
,
x
,
y
)
;
}
<SENTENCE_END/>
text
%END%
(9.66e-01)
text
(6.02e-03)
all
(2.49e-03)
y
(1.87e-03)
x
(1.35e-03)
layout
(1.16e-03)
moved
(7.97e-04)
by
(6.35e-04)
performed
(5.32e-04)
changed
(5.20e-04)
<SENTENCE_START>
{
clear
(
)
;
add
text
(
layout
,
x
,
y
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
add
text
(
layout
,
x
,
y
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.90e-01)
y
(1.29e-03)
all
(9.41e-04)
x
(8.59e-04)
text
(6.26e-04)
layout
(4.11e-04)
clear
(1.97e-04)
performed
(1.49e-04)
add
(9.43e-05)
moved
(9.03e-05)
<SENTENCE_START>
{
clear
(
)
;
add
text
(
layout
,
x
,
y
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
clear
(
)
;
add
text
(
layout
,
x
,
y
)
;
}
<SENTENCE_END/>
add,text
add
put
(4.58e-01)
append
(1.70e-01)
insert
(1.42e-01)
draw
(5.63e-02)
move
(4.48e-02)
color
(1.19e-02)
%END%
(1.01e-02)
to
(5.94e-03)
encode
(5.08e-03)
rect
(4.24e-03)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
,
null
)
;
}
<SENTENCE_END/>
text
%END%
(9.24e-01)
0
(6.27e-03)
to
(5.54e-03)
insert
(4.47e-03)
by
(2.93e-03)
at
(2.48e-03)
triangles
(2.45e-03)
%UNK%
(1.80e-03)
all
(1.79e-03)
str
(1.70e-03)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
,
null
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.59e-01)
0
(3.54e-03)
to
(2.89e-03)
by
(1.73e-03)
at
(1.59e-03)
all
(1.57e-03)
triangles
(1.31e-03)
%UNK%
(1.30e-03)
insert
(1.08e-03)
string
(9.48e-04)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
0
,
align
.
left
,
false
,
null
)
;
}
<SENTENCE_END/>
add,text
add
put
(4.82e-01)
append
(2.29e-01)
insert
(8.74e-02)
draw
(5.17e-02)
move
(3.77e-02)
color
(1.64e-02)
encode
(6.95e-03)
%END%
(5.90e-03)
wrap
(5.49e-03)
rect
(3.82e-03)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
text
%END%
(8.55e-01)
at
(1.05e-02)
insert
(8.39e-03)
to
(8.17e-03)
by
(6.19e-03)
0
(5.58e-03)
put
(4.55e-03)
move
(4.44e-03)
color
(4.25e-03)
%UNK%
(4.15e-03)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.41e-01)
at
(5.42e-03)
to
(3.21e-03)
by
(3.18e-03)
0
(2.45e-03)
%UNK%
(2.34e-03)
string
(1.62e-03)
line
(1.34e-03)
triangles
(1.27e-03)
all
(1.21e-03)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
0
,
str
.
length
(
)
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
add,text
add
put
(5.68e-01)
append
(1.50e-01)
draw
(8.02e-02)
insert
(5.62e-02)
move
(4.61e-02)
color
(1.90e-02)
encode
(5.16e-03)
wrap
(4.29e-03)
rect
(3.58e-03)
fill
(2.90e-03)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
text
%END%
(7.42e-01)
%UNK%
(1.37e-02)
draw
(1.15e-02)
color
(1.14e-02)
at
(9.37e-03)
put
(9.20e-03)
insert
(8.76e-03)
move
(8.75e-03)
str
(7.29e-03)
to
(6.80e-03)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.10e-01)
%UNK%
(8.41e-03)
at
(4.09e-03)
animation
(4.00e-03)
to
(3.06e-03)
color
(2.86e-03)
by
(2.77e-03)
line
(2.54e-03)
aligned
(1.56e-03)
string
(1.19e-03)
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
str
,
x
,
y
,
start
,
end
,
target
width
,
halign
,
wrap
,
null
)
;
}
<SENTENCE_END/>
add,text
add
draw
(4.87e-01)
set
(3.02e-01)
reset
(1.19e-02)
add
(1.02e-02)
%UNK%
(9.43e-03)
translate
(7.74e-03)
update
(7.00e-03)
resize
(6.93e-03)
color
(6.77e-03)
render
(6.36e-03)
<SENTENCE_START>
{
glyph
layout
layout
=
pools
.
obtain
(
glyph
layout
.
class
)
;
pooled
layouts
.
add
(
layout
)
;
layout
.
set
text
(
font
,
str
,
start
,
end
,
color
,
target
width
,
halign
,
wrap
,
truncate
)
;
%SELF%
(
layout
,
x
,
y
)
;
return
layout
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
glyph
layout
layout
=
pools
.
obtain
(
glyph
layout
.
class
)
;
pooled
layouts
.
add
(
layout
)
;
layout
.
set
text
(
font
,
str
,
start
,
end
,
color
,
target
width
,
halign
,
wrap
,
truncate
)
;
%SELF%
(
layout
,
x
,
y
)
;
return
layout
;
}
<SENTENCE_END/>
text
%END%
(5.19e-01)
glyph
(2.38e-01)
layout
(6.26e-02)
draw
(2.76e-02)
str
(9.19e-03)
%UNK%
(8.80e-03)
text
(8.73e-03)
color
(5.91e-03)
font
(3.22e-03)
set
(2.94e-03)
<SENTENCE_START>
{
glyph
layout
layout
=
pools
.
obtain
(
glyph
layout
.
class
)
;
pooled
layouts
.
add
(
layout
)
;
layout
.
set
text
(
font
,
str
,
start
,
end
,
color
,
target
width
,
halign
,
wrap
,
truncate
)
;
%SELF%
(
layout
,
x
,
y
)
;
return
layout
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
glyph
layout
layout
=
pools
.
obtain
(
glyph
layout
.
class
)
;
pooled
layouts
.
add
(
layout
)
;
layout
.
set
text
(
font
,
str
,
start
,
end
,
color
,
target
width
,
halign
,
wrap
,
truncate
)
;
%SELF%
(
layout
,
x
,
y
)
;
return
layout
;
}
<SENTENCE_END/>
%END%
%END%
(7.05e-01)
layout
(1.74e-01)
glyph
(2.30e-02)
layouts
(6.96e-03)
text
(4.61e-03)
%UNK%
(4.37e-03)
str
(4.08e-03)
font
(2.07e-03)
color
(2.01e-03)
start
(1.97e-03)
<SENTENCE_START>
{
glyph
layout
layout
=
pools
.
obtain
(
glyph
layout
.
class
)
;
pooled
layouts
.
add
(
layout
)
;
layout
.
set
text
(
font
,
str
,
start
,
end
,
color
,
target
width
,
halign
,
wrap
,
truncate
)
;
%SELF%
(
layout
,
x
,
y
)
;
return
layout
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
glyph
layout
layout
=
pools
.
obtain
(
glyph
layout
.
class
)
;
pooled
layouts
.
add
(
layout
)
;
layout
.
set
text
(
font
,
str
,
start
,
end
,
color
,
target
width
,
halign
,
wrap
,
truncate
)
;
%SELF%
(
layout
,
x
,
y
)
;
return
layout
;
}
<SENTENCE_END/>
add,text
add
add
(6.02e-01)
draw
(2.69e-01)
set
(5.73e-02)
create
(9.75e-03)
translate
(5.66e-03)
to
(3.71e-03)
%UNK%
(2.84e-03)
get
(2.82e-03)
compute
(2.03e-03)
cache
(1.97e-03)
<SENTENCE_START>
{
add
to
cache
(
layout
,
x
,
y
+
font
.
data
.
ascent
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
add
to
cache
(
layout
,
x
,
y
+
font
.
data
.
ascent
)
;
}
<SENTENCE_END/>
text
%END%
(8.03e-01)
ascent
(5.81e-02)
draw
(2.18e-02)
layout
(1.66e-02)
font
(6.45e-03)
cache
(5.90e-03)
circle
(5.54e-03)
%UNK%
(4.33e-03)
to
(3.75e-03)
color
(3.24e-03)
<SENTENCE_START>
{
add
to
cache
(
layout
,
x
,
y
+
font
.
data
.
ascent
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
add
to
cache
(
layout
,
x
,
y
+
font
.
data
.
ascent
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.54e-01)
cache
(5.69e-03)
ascent
(4.61e-03)
layout
(4.24e-03)
font
(1.95e-03)
%UNK%
(1.53e-03)
to
(1.51e-03)
x
(7.10e-04)
2
(6.47e-04)
circle
(5.56e-04)
<SENTENCE_START>
{
add
to
cache
(
layout
,
x
,
y
+
font
.
data
.
ascent
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
add
to
cache
(
layout
,
x
,
y
+
font
.
data
.
ascent
)
;
}
<SENTENCE_END/>
get,x
get
get
(8.11e-01)
is
(1.56e-01)
iterator
(3.71e-03)
return
(3.22e-03)
length
(2.92e-03)
needs
(2.76e-03)
x
(2.40e-03)
protected
(2.09e-03)
size
(1.86e-03)
fast
(1.30e-03)
<SENTENCE_START>
{
return
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
x
;
}
<SENTENCE_END/>
x
x
(9.44e-01)
%END%
(6.30e-03)
y
(5.93e-03)
position
(4.92e-03)
return
(4.16e-03)
local
(2.61e-03)
pixel
(2.43e-03)
to
(2.07e-03)
size
(2.03e-03)
scrolling
(1.48e-03)
<SENTENCE_START>
{
return
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
x
;
}
<SENTENCE_END/>
%END%
%END%
(9.18e-01)
x
(2.36e-02)
value
(5.68e-03)
only
(3.42e-03)
20
(1.95e-03)
width
(1.89e-03)
array
(1.85e-03)
height
(1.84e-03)
2
(1.42e-03)
count
(1.31e-03)
<SENTENCE_START>
{
return
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
x
;
}
<SENTENCE_END/>
get,y
get
get
(8.79e-01)
is
(1.04e-01)
iterator
(2.48e-03)
return
(2.25e-03)
needs
(1.80e-03)
protected
(1.36e-03)
y
(8.93e-04)
to
(8.90e-04)
mouse
(5.17e-04)
fast
(4.93e-04)
<SENTENCE_START>
{
return
y
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
y
;
}
<SENTENCE_END/>
y
y
(9.72e-01)
moved
(6.80e-03)
local
(2.71e-03)
return
(2.60e-03)
to
(2.33e-03)
%END%
(1.61e-03)
position
(1.56e-03)
floor
(1.26e-03)
x
(1.21e-03)
ceil
(1.15e-03)
<SENTENCE_START>
{
return
y
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
y
;
}
<SENTENCE_END/>
%END%
%END%
(9.14e-01)
y
(2.97e-02)
value
(4.27e-03)
only
(2.91e-03)
20
(2.36e-03)
height
(1.71e-03)
array
(1.65e-03)
disabled
(1.52e-03)
mode
(1.49e-03)
gutter
(1.30e-03)
<SENTENCE_START>
{
return
y
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
y
;
}
<SENTENCE_END/>
get,font
get
get
(9.65e-01)
is
(2.79e-02)
return
(1.41e-03)
font
(7.16e-04)
protected
(5.00e-04)
iterator
(4.18e-04)
needs
(2.07e-04)
owns
(1.58e-04)
as
(1.54e-04)
%UNK%
(1.14e-04)
<SENTENCE_START>
{
return
font
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
font
;
}
<SENTENCE_END/>
font
font
(9.98e-01)
return
(1.98e-03)
%UNK%
(7.45e-05)
factor
(3.54e-05)
%END%
(2.23e-05)
declared
(1.79e-05)
generate
(1.35e-05)
data
(1.29e-05)
offsets
(6.89e-06)
type
(4.14e-06)
<SENTENCE_START>
{
return
font
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
font
;
}
<SENTENCE_END/>
%END%
%END%
(8.65e-01)
font
(6.09e-02)
value
(7.06e-03)
%UNK%
(3.09e-03)
offset
(2.19e-03)
20
(2.14e-03)
accessible
(1.93e-03)
only
(1.69e-03)
buffer
(1.61e-03)
2
(1.54e-03)
<SENTENCE_START>
{
return
font
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
font
;
}
<SENTENCE_END/>
set,use,integer,positions
set
set
(9.90e-01)
integer
(3.87e-03)
reset
(4.53e-04)
init
(4.35e-04)
stop
(3.18e-04)
this
(2.86e-04)
use
(2.81e-04)
cancel
(2.56e-04)
finish
(1.05e-04)
translate
(9.02e-05)
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
use
integer
(9.88e-01)
positions
(6.88e-03)
use
(1.06e-03)
%UNK%
(8.01e-04)
stop
(4.00e-04)
cancel
(1.70e-04)
mode
(6.34e-05)
vector
(6.20e-05)
press
(4.58e-05)
locked
(3.88e-05)
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
integer
%END%
(8.96e-01)
positions
(1.26e-02)
integer
(9.14e-03)
%UNK%
(8.28e-03)
fv
(3.40e-03)
mode
(2.65e-03)
2
(1.73e-03)
only
(1.60e-03)
position
(1.52e-03)
20
(1.50e-03)
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
positions
%END%
(9.74e-01)
fv
(1.76e-03)
integer
(1.37e-03)
positions
(1.36e-03)
%UNK%
(1.11e-03)
2
(8.24e-04)
value
(7.62e-04)
20
(5.90e-04)
only
(5.89e-04)
iv
(5.01e-04)
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
%END%
%END%
(9.64e-01)
integer
(9.06e-03)
use
(1.76e-03)
fv
(1.41e-03)
positions
(8.22e-04)
%UNK%
(7.79e-04)
value
(6.97e-04)
2
(6.89e-04)
20
(4.56e-04)
height
(4.37e-04)
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
integer
=
use
;
}
<SENTENCE_END/>
uses,integer,positions
uses
get
(3.46e-01)
is
(3.34e-01)
%UNK%
(7.21e-02)
needs
(2.64e-02)
iterator
(2.11e-02)
should
(2.07e-02)
touch
(1.53e-02)
protected
(1.49e-02)
owns
(1.33e-02)
last
(7.28e-03)
<SENTENCE_START>
{
return
integer
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
integer
;
}
<SENTENCE_END/>
integer
integer
(9.71e-01)
positions
(1.76e-02)
%UNK%
(4.39e-03)
return
(2.37e-03)
stop
(6.60e-04)
use
(4.35e-04)
mode
(2.13e-04)
press
(2.04e-04)
vector
(1.42e-04)
cancel
(1.31e-04)
<SENTENCE_START>
{
return
integer
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
integer
;
}
<SENTENCE_END/>
positions
%END%
(5.99e-01)
positions
(2.64e-02)
only
(2.56e-02)
20
(2.40e-02)
%UNK%
(1.91e-02)
value
(1.85e-02)
integer
(1.40e-02)
mode
(1.17e-02)
object
(7.90e-03)
count
(6.88e-03)
<SENTENCE_START>
{
return
integer
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
integer
;
}
<SENTENCE_END/>
%END%
%END%
(8.96e-01)
value
(1.38e-02)
20
(9.99e-03)
only
(9.65e-03)
offset
(2.80e-03)
integer
(2.61e-03)
array
(1.96e-03)
buffer
(1.91e-03)
count
(1.85e-03)
accessible
(1.61e-03)
<SENTENCE_START>
{
return
integer
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
integer
;
}
<SENTENCE_END/>
get,vertices
get
is
(2.19e-01)
length
(9.48e-02)
get
(5.98e-02)
read
(5.20e-02)
size
(4.75e-02)
append
(4.49e-02)
skip
(2.89e-02)
abs
(2.40e-02)
clear
(2.14e-02)
close
(2.13e-02)
<SENTENCE_START>
{
return
%SELF%
(
0
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
0
)
;
}
<SENTENCE_END/>
vertices
%END%
(6.61e-01)
0
(1.96e-02)
%UNK%
(1.22e-02)
value
(1.21e-02)
size
(1.20e-02)
all
(1.06e-02)
height
(8.37e-03)
width
(8.24e-03)
array
(7.45e-03)
count
(7.04e-03)
<SENTENCE_START>
{
return
%SELF%
(
0
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
0
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.62e-01)
value
(1.42e-02)
height
(7.17e-03)
%UNK%
(7.07e-03)
array
(7.07e-03)
width
(6.81e-03)
size
(6.28e-03)
count
(5.60e-03)
buffer
(5.52e-03)
all
(5.25e-03)
<SENTENCE_START>
{
return
%SELF%
(
0
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
%SELF%
(
0
)
;
}
<SENTENCE_END/>
get,vertices
get
get
(9.92e-01)
page
(2.45e-03)
return
(1.76e-03)
vertices
(9.17e-04)
is
(5.93e-05)
as
(7.46e-06)
last
(6.96e-06)
iterator
(6.39e-06)
declared
(5.60e-06)
owns
(1.73e-06)
<SENTENCE_START>
{
return
page
vertices
[
page
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
page
vertices
[
page
]
;
}
<SENTENCE_END/>
vertices
page
(9.47e-01)
vertices
(4.73e-02)
get
(3.01e-03)
update
(9.33e-04)
%END%
(6.31e-04)
return
(2.79e-04)
vertex
(2.45e-04)
scale
(1.08e-04)
bounding
(9.79e-05)
set
(9.32e-05)
<SENTENCE_START>
{
return
page
vertices
[
page
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
page
vertices
[
page
]
;
}
<SENTENCE_END/>
%END%
vertices
(8.99e-01)
%END%
(7.32e-02)
page
(7.43e-03)
value
(2.20e-04)
particles
(7.91e-05)
texture
(6.36e-05)
return
(5.76e-05)
vertex
(4.23e-05)
animation
(3.06e-05)
atlas
(2.80e-05)
<SENTENCE_START>
{
return
page
vertices
[
page
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
page
vertices
[
page
]
;
}
<SENTENCE_END/>
get,vertex,count
get
get
(9.28e-01)
is
(2.14e-02)
%UNK%
(4.87e-03)
fast
(3.52e-03)
last
(2.86e-03)
read
(2.22e-03)
available
(1.89e-03)
as
(1.70e-03)
iterator
(1.32e-03)
return
(1.10e-03)
<SENTENCE_START>
{
return
idx
[
page
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
idx
[
page
]
;
}
<SENTENCE_END/>
vertex
%END%
(8.32e-01)
page
(5.19e-02)
idx
(2.24e-02)
%UNK%
(1.12e-02)
value
(3.59e-03)
matrix
(3.21e-03)
count
(2.17e-03)
4
(2.00e-03)
fast
(1.93e-03)
vertex
(1.65e-03)
<SENTENCE_START>
{
return
idx
[
page
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
idx
[
page
]
;
}
<SENTENCE_END/>
count
%END%
(9.59e-01)
page
(1.03e-02)
idx
(2.88e-03)
value
(1.64e-03)
%UNK%
(8.14e-04)
count
(6.61e-04)
endian
(4.61e-04)
file
(3.82e-04)
matrix
(3.80e-04)
2
(3.80e-04)
<SENTENCE_START>
{
return
idx
[
page
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
idx
[
page
]
;
}
<SENTENCE_END/>
%END%
%END%
(9.89e-01)
page
(2.61e-03)
value
(8.27e-04)
idx
(1.47e-04)
endian
(1.46e-04)
count
(1.32e-04)
20
(1.21e-04)
fv
(9.45e-05)
file
(9.39e-05)
2
(9.03e-05)
<SENTENCE_START>
{
return
idx
[
page
]
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
idx
[
page
]
;
}
<SENTENCE_END/>
get,layouts
get
get
(8.43e-01)
is
(1.32e-01)
%UNK%
(8.38e-03)
iterator
(2.27e-03)
needs
(1.72e-03)
return
(1.54e-03)
protected
(1.06e-03)
can
(7.02e-04)
should
(6.51e-04)
un
(5.95e-04)
<SENTENCE_START>
{
return
layouts
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
layouts
;
}
<SENTENCE_END/>
layouts
%UNK%
(7.67e-01)
layouts
(2.13e-01)
%END%
(2.71e-03)
return
(1.68e-03)
start
(8.14e-04)
is
(4.48e-04)
get
(4.35e-04)
to
(4.02e-04)
offsets
(3.63e-04)
string
(3.21e-04)
<SENTENCE_START>
{
return
layouts
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
layouts
;
}
<SENTENCE_END/>
%END%
%END%
(8.81e-01)
%UNK%
(2.50e-02)
value
(9.21e-03)
layouts
(6.89e-03)
20
(3.42e-03)
buffer
(2.45e-03)
only
(2.30e-03)
array
(2.24e-03)
file
(2.03e-03)
count
(1.92e-03)
<SENTENCE_START>
{
return
layouts
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
layouts
;
}
<SENTENCE_END/>
create,fixture
create
fixture
(2.38e-01)
destroy
(1.63e-01)
init
(9.66e-02)
%UNK%
(8.96e-02)
create
(7.31e-02)
get
(4.18e-02)
report
(2.90e-02)
%END%
(9.67e-03)
render
(8.72e-03)
extract
(8.51e-03)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
null
;
}
fixture
fixture
=
new
fixture
(
)
;
fixture
.
create
(
this
,
def
)
;
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
create
proxies
(
broad
phase
,
m
xf
)
;
}
fixture
.
m
next
=
m
fixture
list
;
m
fixture
list
=
fixture
;
++
m
fixture
count
;
fixture
.
m
body
=
this
;
if
(
fixture
.
m
density
>
0.0f
)
{
reset
mass
data
(
)
;
}
m
world
.
m
flags
|=
world
.
new
fixture
;
return
fixture
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
null
;
}
fixture
fixture
=
new
fixture
(
)
;
fixture
.
create
(
this
,
def
)
;
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
create
proxies
(
broad
phase
,
m
xf
)
;
}
fixture
.
m
next
=
m
fixture
list
;
m
fixture
list
=
fixture
;
++
m
fixture
count
;
fixture
.
m
body
=
this
;
if
(
fixture
.
m
density
>
0.0f
)
{
reset
mass
data
(
)
;
}
m
world
.
m
flags
|=
world
.
new
fixture
;
return
fixture
;
}
<SENTENCE_END/>
fixture
%END%
(4.22e-01)
fixture
(2.12e-01)
%UNK%
(5.73e-02)
destroy
(2.40e-02)
m
(1.51e-02)
list
(1.18e-02)
locked
(9.47e-03)
create
(8.83e-03)
world
(7.84e-03)
phase
(7.20e-03)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
null
;
}
fixture
fixture
=
new
fixture
(
)
;
fixture
.
create
(
this
,
def
)
;
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
create
proxies
(
broad
phase
,
m
xf
)
;
}
fixture
.
m
next
=
m
fixture
list
;
m
fixture
list
=
fixture
;
++
m
fixture
count
;
fixture
.
m
body
=
this
;
if
(
fixture
.
m
density
>
0.0f
)
{
reset
mass
data
(
)
;
}
m
world
.
m
flags
|=
world
.
new
fixture
;
return
fixture
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
null
;
}
fixture
fixture
=
new
fixture
(
)
;
fixture
.
create
(
this
,
def
)
;
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
create
proxies
(
broad
phase
,
m
xf
)
;
}
fixture
.
m
next
=
m
fixture
list
;
m
fixture
list
=
fixture
;
++
m
fixture
count
;
fixture
.
m
body
=
this
;
if
(
fixture
.
m
density
>
0.0f
)
{
reset
mass
data
(
)
;
}
m
world
.
m
flags
|=
world
.
new
fixture
;
return
fixture
;
}
<SENTENCE_END/>
%END%
%END%
(8.21e-01)
%UNK%
(2.91e-02)
fixture
(2.19e-02)
phase
(4.73e-03)
locked
(4.54e-03)
m
(4.08e-03)
destroy
(3.88e-03)
world
(3.14e-03)
broad
(2.55e-03)
create
(2.54e-03)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
null
;
}
fixture
fixture
=
new
fixture
(
)
;
fixture
.
create
(
this
,
def
)
;
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
create
proxies
(
broad
phase
,
m
xf
)
;
}
fixture
.
m
next
=
m
fixture
list
;
m
fixture
list
=
fixture
;
++
m
fixture
count
;
fixture
.
m
body
=
this
;
if
(
fixture
.
m
density
>
0.0f
)
{
reset
mass
data
(
)
;
}
m
world
.
m
flags
|=
world
.
new
fixture
;
return
fixture
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
null
;
}
fixture
fixture
=
new
fixture
(
)
;
fixture
.
create
(
this
,
def
)
;
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
create
proxies
(
broad
phase
,
m
xf
)
;
}
fixture
.
m
next
=
m
fixture
list
;
m
fixture
list
=
fixture
;
++
m
fixture
count
;
fixture
.
m
body
=
this
;
if
(
fixture
.
m
density
>
0.0f
)
{
reset
mass
data
(
)
;
}
m
world
.
m
flags
|=
world
.
new
fixture
;
return
fixture
;
}
<SENTENCE_END/>
create,fixture
create
create
(7.92e-01)
%UNK%
(1.16e-01)
set
(1.84e-02)
alloc
(5.20e-03)
begin
(4.77e-03)
init
(4.23e-03)
add
(3.61e-03)
make
(2.84e-03)
fix
(2.53e-03)
write
(2.14e-03)
<SENTENCE_START>
{
fix
def
.
shape
=
shape
;
fix
def
.
density
=
density
;
return
%SELF%
(
fix
def
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
fix
def
.
shape
=
shape
;
fix
def
.
density
=
density
;
return
%SELF%
(
fix
def
)
;
}
<SENTENCE_END/>
fixture
%END%
(7.98e-01)
create
(1.24e-01)
%UNK%
(2.46e-02)
shape
(7.03e-03)
def
(5.14e-03)
fix
(4.05e-03)
density
(1.29e-03)
alloc
(1.11e-03)
new
(8.11e-04)
data
(7.21e-04)
<SENTENCE_START>
{
fix
def
.
shape
=
shape
;
fix
def
.
density
=
density
;
return
%SELF%
(
fix
def
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
fix
def
.
shape
=
shape
;
fix
def
.
density
=
density
;
return
%SELF%
(
fix
def
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.47e-01)
%UNK%
(8.16e-03)
shape
(6.77e-03)
def
(5.58e-03)
density
(3.37e-03)
fix
(2.46e-03)
create
(5.88e-04)
buffer
(5.11e-04)
data
(4.86e-04)
array
(4.25e-04)
<SENTENCE_START>
{
fix
def
.
shape
=
shape
;
fix
def
.
density
=
density
;
return
%SELF%
(
fix
def
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
fix
def
.
shape
=
shape
;
fix
def
.
density
=
density
;
return
%SELF%
(
fix
def
)
;
}
<SENTENCE_END/>
destroy,fixture
destroy
destroy
(1.16e-01)
%UNK%
(1.02e-01)
fixture
(9.23e-02)
get
(8.10e-02)
report
(7.69e-02)
init
(6.04e-02)
clear
(2.26e-02)
create
(1.93e-02)
find
(1.45e-02)
touch
(1.32e-02)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
assert
(
fixture
.
m
body
==
this
)
;
assert
(
m
fixture
count
>
0
)
;
fixture
node
=
m
fixture
list
;
fixture
last
=
null
;
boolean
found
=
false
;
while
(
node
!=
null
)
{
if
(
node
==
fixture
)
{
node
=
fixture
.
m
next
;
found
=
true
;
break
;
}
last
=
node
;
node
=
node
.
m
next
;
}
assert
(
found
)
;
if
(
last
==
null
)
{
m
fixture
list
=
fixture
.
m
next
;
}
else
{
last
.
m
next
=
fixture
.
m
next
;
}
contact
edge
edge
=
m
contact
list
;
while
(
edge
!=
null
)
{
contact
c
=
edge
.
contact
;
edge
=
edge
.
next
;
fixture
fixture
a
=
c
.
get
fixture
a
(
)
;
fixture
fixture
b
=
c
.
get
fixture
b
(
)
;
if
(
fixture
==
fixture
a
||
fixture
==
fixture
b
)
{
m
world
.
m
contact
manager
.
destroy
(
c
)
;
}
}
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
destroy
proxies
(
broad
phase
)
;
}
fixture
.
destroy
(
)
;
fixture
.
m
body
=
null
;
fixture
.
m
next
=
null
;
fixture
=
null
;
--
m
fixture
count
;
reset
mass
data
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
assert
(
fixture
.
m
body
==
this
)
;
assert
(
m
fixture
count
>
0
)
;
fixture
node
=
m
fixture
list
;
fixture
last
=
null
;
boolean
found
=
false
;
while
(
node
!=
null
)
{
if
(
node
==
fixture
)
{
node
=
fixture
.
m
next
;
found
=
true
;
break
;
}
last
=
node
;
node
=
node
.
m
next
;
}
assert
(
found
)
;
if
(
last
==
null
)
{
m
fixture
list
=
fixture
.
m
next
;
}
else
{
last
.
m
next
=
fixture
.
m
next
;
}
contact
edge
edge
=
m
contact
list
;
while
(
edge
!=
null
)
{
contact
c
=
edge
.
contact
;
edge
=
edge
.
next
;
fixture
fixture
a
=
c
.
get
fixture
a
(
)
;
fixture
fixture
b
=
c
.
get
fixture
b
(
)
;
if
(
fixture
==
fixture
a
||
fixture
==
fixture
b
)
{
m
world
.
m
contact
manager
.
destroy
(
c
)
;
}
}
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
destroy
proxies
(
broad
phase
)
;
}
fixture
.
destroy
(
)
;
fixture
.
m
body
=
null
;
fixture
.
m
next
=
null
;
fixture
=
null
;
--
m
fixture
count
;
reset
mass
data
(
)
;
}
<SENTENCE_END/>
fixture
%END%
(4.20e-01)
fixture
(1.35e-01)
%UNK%
(6.29e-02)
destroy
(1.95e-02)
m
(1.34e-02)
contact
(1.04e-02)
get
(9.70e-03)
report
(9.11e-03)
b
(6.35e-03)
next
(5.81e-03)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
assert
(
fixture
.
m
body
==
this
)
;
assert
(
m
fixture
count
>
0
)
;
fixture
node
=
m
fixture
list
;
fixture
last
=
null
;
boolean
found
=
false
;
while
(
node
!=
null
)
{
if
(
node
==
fixture
)
{
node
=
fixture
.
m
next
;
found
=
true
;
break
;
}
last
=
node
;
node
=
node
.
m
next
;
}
assert
(
found
)
;
if
(
last
==
null
)
{
m
fixture
list
=
fixture
.
m
next
;
}
else
{
last
.
m
next
=
fixture
.
m
next
;
}
contact
edge
edge
=
m
contact
list
;
while
(
edge
!=
null
)
{
contact
c
=
edge
.
contact
;
edge
=
edge
.
next
;
fixture
fixture
a
=
c
.
get
fixture
a
(
)
;
fixture
fixture
b
=
c
.
get
fixture
b
(
)
;
if
(
fixture
==
fixture
a
||
fixture
==
fixture
b
)
{
m
world
.
m
contact
manager
.
destroy
(
c
)
;
}
}
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
destroy
proxies
(
broad
phase
)
;
}
fixture
.
destroy
(
)
;
fixture
.
m
body
=
null
;
fixture
.
m
next
=
null
;
fixture
=
null
;
--
m
fixture
count
;
reset
mass
data
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
assert
(
fixture
.
m
body
==
this
)
;
assert
(
m
fixture
count
>
0
)
;
fixture
node
=
m
fixture
list
;
fixture
last
=
null
;
boolean
found
=
false
;
while
(
node
!=
null
)
{
if
(
node
==
fixture
)
{
node
=
fixture
.
m
next
;
found
=
true
;
break
;
}
last
=
node
;
node
=
node
.
m
next
;
}
assert
(
found
)
;
if
(
last
==
null
)
{
m
fixture
list
=
fixture
.
m
next
;
}
else
{
last
.
m
next
=
fixture
.
m
next
;
}
contact
edge
edge
=
m
contact
list
;
while
(
edge
!=
null
)
{
contact
c
=
edge
.
contact
;
edge
=
edge
.
next
;
fixture
fixture
a
=
c
.
get
fixture
a
(
)
;
fixture
fixture
b
=
c
.
get
fixture
b
(
)
;
if
(
fixture
==
fixture
a
||
fixture
==
fixture
b
)
{
m
world
.
m
contact
manager
.
destroy
(
c
)
;
}
}
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
destroy
proxies
(
broad
phase
)
;
}
fixture
.
destroy
(
)
;
fixture
.
m
body
=
null
;
fixture
.
m
next
=
null
;
fixture
=
null
;
--
m
fixture
count
;
reset
mass
data
(
)
;
}
<SENTENCE_END/>
%END%
%END%
(7.80e-01)
%UNK%
(2.46e-02)
fixture
(2.17e-02)
b
(4.77e-03)
m
(4.72e-03)
destroy
(4.01e-03)
down
(3.99e-03)
node
(3.25e-03)
contact
(2.63e-03)
a
(2.56e-03)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
assert
(
fixture
.
m
body
==
this
)
;
assert
(
m
fixture
count
>
0
)
;
fixture
node
=
m
fixture
list
;
fixture
last
=
null
;
boolean
found
=
false
;
while
(
node
!=
null
)
{
if
(
node
==
fixture
)
{
node
=
fixture
.
m
next
;
found
=
true
;
break
;
}
last
=
node
;
node
=
node
.
m
next
;
}
assert
(
found
)
;
if
(
last
==
null
)
{
m
fixture
list
=
fixture
.
m
next
;
}
else
{
last
.
m
next
=
fixture
.
m
next
;
}
contact
edge
edge
=
m
contact
list
;
while
(
edge
!=
null
)
{
contact
c
=
edge
.
contact
;
edge
=
edge
.
next
;
fixture
fixture
a
=
c
.
get
fixture
a
(
)
;
fixture
fixture
b
=
c
.
get
fixture
b
(
)
;
if
(
fixture
==
fixture
a
||
fixture
==
fixture
b
)
{
m
world
.
m
contact
manager
.
destroy
(
c
)
;
}
}
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
destroy
proxies
(
broad
phase
)
;
}
fixture
.
destroy
(
)
;
fixture
.
m
body
=
null
;
fixture
.
m
next
=
null
;
fixture
=
null
;
--
m
fixture
count
;
reset
mass
data
(
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
assert
(
fixture
.
m
body
==
this
)
;
assert
(
m
fixture
count
>
0
)
;
fixture
node
=
m
fixture
list
;
fixture
last
=
null
;
boolean
found
=
false
;
while
(
node
!=
null
)
{
if
(
node
==
fixture
)
{
node
=
fixture
.
m
next
;
found
=
true
;
break
;
}
last
=
node
;
node
=
node
.
m
next
;
}
assert
(
found
)
;
if
(
last
==
null
)
{
m
fixture
list
=
fixture
.
m
next
;
}
else
{
last
.
m
next
=
fixture
.
m
next
;
}
contact
edge
edge
=
m
contact
list
;
while
(
edge
!=
null
)
{
contact
c
=
edge
.
contact
;
edge
=
edge
.
next
;
fixture
fixture
a
=
c
.
get
fixture
a
(
)
;
fixture
fixture
b
=
c
.
get
fixture
b
(
)
;
if
(
fixture
==
fixture
a
||
fixture
==
fixture
b
)
{
m
world
.
m
contact
manager
.
destroy
(
c
)
;
}
}
if
(
(
m
flags
&
e
active
flag
)
==
e
active
flag
)
{
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
fixture
.
destroy
proxies
(
broad
phase
)
;
}
fixture
.
destroy
(
)
;
fixture
.
m
body
=
null
;
fixture
.
m
next
=
null
;
fixture
=
null
;
--
m
fixture
count
;
reset
mass
data
(
)
;
}
<SENTENCE_END/>
set,transform
set
set
(5.22e-01)
get
(1.82e-01)
%UNK%
(5.52e-02)
add
(1.49e-02)
m
(1.34e-02)
initialize
(1.15e-02)
solve
(9.45e-03)
report
(9.22e-03)
init
(8.84e-03)
render
(7.72e-03)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
m
xf
.
q
.
set
(
angle
)
;
m
xf
.
p
.
set
(
position
)
;
transform
.
mul
to
out
unsafe
(
m
xf
,
m
sweep
.
local
center
,
m
sweep
.
c
)
;
m
sweep
.
a
=
angle
;
m
sweep
.
c
0
.
set
(
m
sweep
.
c
)
;
m
sweep
.
a
0
=
m
sweep
.
a
;
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
for
(
fixture
f
=
m
fixture
list
;
f
!=
null
;
f
=
f
.
m
next
)
{
f
.
synchronize
(
broad
phase
,
m
xf
,
m
xf
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
m
xf
.
q
.
set
(
angle
)
;
m
xf
.
p
.
set
(
position
)
;
transform
.
mul
to
out
unsafe
(
m
xf
,
m
sweep
.
local
center
,
m
sweep
.
c
)
;
m
sweep
.
a
=
angle
;
m
sweep
.
c
0
.
set
(
m
sweep
.
c
)
;
m
sweep
.
a
0
=
m
sweep
.
a
;
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
for
(
fixture
f
=
m
fixture
list
;
f
!=
null
;
f
=
f
.
m
next
)
{
f
.
synchronize
(
broad
phase
,
m
xf
,
m
xf
)
;
}
}
<SENTENCE_END/>
transform
%END%
(4.82e-01)
%UNK%
(9.02e-02)
phase
(2.97e-02)
set
(2.84e-02)
sweep
(2.78e-02)
get
(2.52e-02)
m
(2.18e-02)
fixture
(1.98e-02)
broad
(1.46e-02)
xf
(1.31e-02)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
m
xf
.
q
.
set
(
angle
)
;
m
xf
.
p
.
set
(
position
)
;
transform
.
mul
to
out
unsafe
(
m
xf
,
m
sweep
.
local
center
,
m
sweep
.
c
)
;
m
sweep
.
a
=
angle
;
m
sweep
.
c
0
.
set
(
m
sweep
.
c
)
;
m
sweep
.
a
0
=
m
sweep
.
a
;
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
for
(
fixture
f
=
m
fixture
list
;
f
!=
null
;
f
=
f
.
m
next
)
{
f
.
synchronize
(
broad
phase
,
m
xf
,
m
xf
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
m
xf
.
q
.
set
(
angle
)
;
m
xf
.
p
.
set
(
position
)
;
transform
.
mul
to
out
unsafe
(
m
xf
,
m
sweep
.
local
center
,
m
sweep
.
c
)
;
m
sweep
.
a
=
angle
;
m
sweep
.
c
0
.
set
(
m
sweep
.
c
)
;
m
sweep
.
a
0
=
m
sweep
.
a
;
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
for
(
fixture
f
=
m
fixture
list
;
f
!=
null
;
f
=
f
.
m
next
)
{
f
.
synchronize
(
broad
phase
,
m
xf
,
m
xf
)
;
}
}
<SENTENCE_END/>
%END%
%END%
(7.37e-01)
%UNK%
(4.73e-02)
set
(8.90e-03)
get
(7.71e-03)
m
(7.20e-03)
to
(6.96e-03)
phase
(5.78e-03)
sweep
(5.74e-03)
f
(5.39e-03)
solve
(5.03e-03)
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
m
xf
.
q
.
set
(
angle
)
;
m
xf
.
p
.
set
(
position
)
;
transform
.
mul
to
out
unsafe
(
m
xf
,
m
sweep
.
local
center
,
m
sweep
.
c
)
;
m
sweep
.
a
=
angle
;
m
sweep
.
c
0
.
set
(
m
sweep
.
c
)
;
m
sweep
.
a
0
=
m
sweep
.
a
;
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
for
(
fixture
f
=
m
fixture
list
;
f
!=
null
;
f
=
f
.
m
next
)
{
f
.
synchronize
(
broad
phase
,
m
xf
,
m
xf
)
;
}
}
<SENTENCE_END/>
<SENTENCE_START>
{
assert
(
m
world
.
is
locked
(
)
==
false
)
;
if
(
m
world
.
is
locked
(
)
==
true
)
{
return
;
}
m
xf
.
q
.
set
(
angle
)
;
m
xf
.
p
.
set
(
position
)
;
transform
.
mul
to
out
unsafe
(
m
xf
,
m
sweep
.
local
center
,
m
sweep
.
c
)
;
m
sweep
.
a
=
angle
;
m
sweep
.
c
0
.
set
(
m
sweep
.
c
)
;
m
sweep
.
a
0
=
m
sweep
.
a
;
broad
phase
broad
phase
=
m
world
.
m
contact
manager
.
m
broad
phase
;
for
(
fixture
f
=
m
fixture
list
;
f
!=
null
;
f
=
f
.
m
next
)
{
f
.
synchronize
(
broad
phase
,
m
xf
,
m
xf
)
;
}
}
<SENTENCE_END/>
get,transform
get
get
(9.95e-01)
m
(1.30e-03)
return
(8.97e-04)
xf
(6.92e-04)
is
(6.10e-04)
iterator
(1.87e-04)
set
(1.13e-05)
as
(7.70e-06)
obtain
(4.66e-06)
owns
(2.11e-06)
<SENTENCE_START>
{
return
m
xf
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
xf
;
}
<SENTENCE_END/>
transform
xf
(9.37e-01)
m
(4.54e-02)
get
(1.47e-02)
set
(3.00e-03)
return
(9.32e-05)
initialize
(1.80e-05)
%END%
(1.75e-05)
iterator
(1.04e-05)
is
(4.45e-06)
%START%
(3.75e-06)
<SENTENCE_START>
{
return
m
xf
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
xf
;
}
<SENTENCE_END/>
%END%
%END%
(6.65e-01)
xf
(2.86e-01)
value
(5.49e-03)
m
(3.56e-03)
only
(1.98e-03)
20
(1.18e-03)
enabled
(1.08e-03)
buffer
(9.79e-04)
accessible
(8.88e-04)
count
(8.44e-04)
<SENTENCE_START>
{
return
m
xf
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
xf
;
}
<SENTENCE_END/>
get,position
get
get
(9.91e-01)
set
(2.89e-03)
xf
(1.39e-03)
m
(1.30e-03)
is
(8.77e-04)
return
(7.18e-04)
p
(2.09e-04)
obtain
(5.50e-05)
iterator
(5.50e-05)
initialize
(1.21e-05)
<SENTENCE_START>
{
return
m
xf
.
p
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
xf
.
p
;
}
<SENTENCE_END/>
position
get
(3.55e-01)
set
(2.85e-01)
xf
(1.86e-01)
p
(4.70e-02)
m
(1.90e-02)
%END%
(1.62e-02)
%UNK%
(3.18e-03)
is
(2.84e-03)
initialize
(1.64e-03)
touch
(1.05e-03)
<SENTENCE_START>
{
return
m
xf
.
p
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
xf
.
p
;
}
<SENTENCE_END/>
%END%
%END%
(8.06e-01)
p
(4.86e-02)
xf
(1.86e-02)
%UNK%
(8.31e-03)
value
(5.20e-03)
data
(2.99e-03)
2
(1.92e-03)
buffer
(1.55e-03)
position
(1.43e-03)
m
(1.39e-03)
<SENTENCE_START>
{
return
m
xf
.
p
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
xf
.
p
;
}
<SENTENCE_END/>
get,angle
get
get
(9.87e-01)
is
(6.86e-03)
m
(1.54e-03)
return
(1.09e-03)
sweep
(6.90e-04)
iterator
(1.25e-04)
a
(8.58e-05)
statistics
(8.28e-05)
empty
(4.07e-05)
%UNK%
(3.42e-05)
<SENTENCE_START>
{
return
m
sweep
.
a
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
a
;
}
<SENTENCE_END/>
angle
sweep
(8.19e-01)
%END%
(1.48e-01)
m
(1.47e-02)
solve
(1.30e-03)
%UNK%
(9.41e-04)
zero
(9.11e-04)
spring
(8.39e-04)
contact
(7.09e-04)
bt
(6.68e-04)
get
(6.18e-04)
<SENTENCE_START>
{
return
m
sweep
.
a
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
a
;
}
<SENTENCE_END/>
%END%
%END%
(8.85e-01)
a
(3.15e-02)
sweep
(1.17e-02)
%UNK%
(2.47e-03)
value
(1.17e-03)
m
(1.00e-03)
endian
(8.55e-04)
accessible
(4.67e-04)
20
(4.58e-04)
down
(4.32e-04)
<SENTENCE_START>
{
return
m
sweep
.
a
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
a
;
}
<SENTENCE_END/>
get,world,center
get
get
(9.89e-01)
is
(4.77e-03)
m
(1.40e-03)
return
(1.26e-03)
sweep
(6.68e-04)
c
(1.06e-04)
iterator
(9.55e-05)
statistics
(2.76e-05)
empty
(1.54e-05)
should
(1.12e-05)
<SENTENCE_START>
{
return
m
sweep
.
c
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
c
;
}
<SENTENCE_END/>
world
sweep
(8.84e-01)
%END%
(6.05e-02)
m
(3.71e-02)
get
(2.13e-03)
c
(5.76e-04)
solve
(4.83e-04)
spring
(4.43e-04)
contact
(4.40e-04)
%UNK%
(3.96e-04)
bt
(3.72e-04)
<SENTENCE_START>
{
return
m
sweep
.
c
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
c
;
}
<SENTENCE_END/>
center
%END%
(9.14e-01)
c
(2.12e-02)
sweep
(9.25e-03)
%UNK%
(2.26e-03)
m
(9.88e-04)
value
(9.79e-04)
accessible
(7.05e-04)
endian
(6.28e-04)
20
(4.81e-04)
down
(3.93e-04)
<SENTENCE_START>
{
return
m
sweep
.
c
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
c
;
}
<SENTENCE_END/>
%END%
%END%
(9.77e-01)
c
(8.76e-03)
value
(1.11e-03)
return
(8.19e-04)
20
(6.98e-04)
m
(5.60e-04)
sweep
(4.96e-04)
accessible
(3.58e-04)
%UNK%
(3.17e-04)
endian
(2.96e-04)
<SENTENCE_START>
{
return
m
sweep
.
c
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
c
;
}
<SENTENCE_END/>
get,local,center
get
get
(9.90e-01)
is
(3.22e-03)
m
(1.37e-03)
return
(1.03e-03)
local
(7.64e-04)
sweep
(6.97e-04)
center
(2.03e-04)
statistics
(1.99e-04)
iterator
(1.57e-04)
%UNK%
(3.21e-05)
<SENTENCE_START>
{
return
m
sweep
.
local
center
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
local
center
;
}
<SENTENCE_END/>
local
sweep
(7.46e-01)
%END%
(1.25e-01)
local
(5.69e-02)
m
(3.39e-02)
center
(2.23e-02)
solve
(1.29e-03)
get
(1.23e-03)
renderable
(5.08e-04)
spring
(3.91e-04)
statistics
(3.80e-04)
<SENTENCE_START>
{
return
m
sweep
.
local
center
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
local
center
;
}
<SENTENCE_END/>
center
%END%
(8.17e-01)
local
(8.49e-02)
center
(5.61e-02)
sweep
(1.09e-02)
%UNK%
(1.16e-03)
value
(7.50e-04)
m
(6.31e-04)
accessible
(4.88e-04)
renderable
(3.79e-04)
20
(3.60e-04)
<SENTENCE_START>
{
return
m
sweep
.
local
center
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
local
center
;
}
<SENTENCE_END/>
%END%
%END%
(9.44e-01)
center
(3.33e-02)
local
(1.08e-02)
value
(1.14e-03)
20
(6.34e-04)
sweep
(6.16e-04)
accessible
(3.04e-04)
m
(2.83e-04)
%UNK%
(2.61e-04)
only
(2.58e-04)
<SENTENCE_START>
{
return
m
sweep
.
local
center
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
sweep
.
local
center
;
}
<SENTENCE_END/>
set,linear,velocity
set
set
(6.14e-01)
get
(2.76e-01)
is
(3.50e-02)
%UNK%
(1.00e-02)
linear
(6.08e-03)
m
(2.96e-03)
type
(1.62e-03)
velocity
(1.56e-03)
on
(1.37e-03)
add
(1.23e-03)
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
vec
2
.
dot
(
v
,
v
)
>
0.0f
)
{
set
awake
(
true
)
;
}
m
linear
velocity
.
set
(
v
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
vec
2
.
dot
(
v
,
v
)
>
0.0f
)
{
set
awake
(
true
)
;
}
m
linear
velocity
.
set
(
v
)
;
}
<SENTENCE_END/>
linear
linear
(6.34e-01)
velocity
(1.37e-01)
%END%
(1.32e-01)
v
(1.08e-02)
%UNK%
(1.00e-02)
static
(3.64e-03)
type
(2.26e-03)
2
(2.24e-03)
vec
(2.07e-03)
awake
(1.84e-03)
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
vec
2
.
dot
(
v
,
v
)
>
0.0f
)
{
set
awake
(
true
)
;
}
m
linear
velocity
.
set
(
v
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
vec
2
.
dot
(
v
,
v
)
>
0.0f
)
{
set
awake
(
true
)
;
}
m
linear
velocity
.
set
(
v
)
;
}
<SENTENCE_END/>
velocity
velocity
(5.57e-01)
%END%
(3.00e-01)
v
(1.01e-02)
linear
(9.10e-03)
type
(6.91e-03)
body
(3.07e-03)
2
(2.88e-03)
vec
(2.82e-03)
%UNK%
(2.35e-03)
static
(2.10e-03)
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
vec
2
.
dot
(
v
,
v
)
>
0.0f
)
{
set
awake
(
true
)
;
}
m
linear
velocity
.
set
(
v
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
vec
2
.
dot
(
v
,
v
)
>
0.0f
)
{
set
awake
(
true
)
;
}
m
linear
velocity
.
set
(
v
)
;
}
<SENTENCE_END/>
%END%
%END%
(9.09e-01)
velocity
(1.68e-02)
set
(2.19e-03)
type
(1.67e-03)
v
(1.24e-03)
2
(1.09e-03)
%UNK%
(9.03e-04)
awake
(6.18e-04)
body
(5.67e-04)
vec
(5.00e-04)
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
vec
2
.
dot
(
v
,
v
)
>
0.0f
)
{
set
awake
(
true
)
;
}
m
linear
velocity
.
set
(
v
)
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
vec
2
.
dot
(
v
,
v
)
>
0.0f
)
{
set
awake
(
true
)
;
}
m
linear
velocity
.
set
(
v
)
;
}
<SENTENCE_END/>
get,linear,velocity
get
get
(9.82e-01)
is
(1.09e-02)
linear
(2.30e-03)
m
(1.72e-03)
return
(9.00e-04)
velocity
(5.00e-04)
iterator
(1.17e-04)
as
(7.18e-05)
%UNK%
(6.21e-05)
needs
(3.53e-05)
<SENTENCE_START>
{
return
m
linear
velocity
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
linear
velocity
;
}
<SENTENCE_END/>
linear
linear
(9.52e-01)
velocity
(1.80e-02)
m
(7.07e-03)
get
(6.42e-03)
%UNK%
(3.95e-03)
angular
(2.75e-03)
%START%
(1.05e-03)
is
(4.77e-04)
bt
(4.54e-04)
distance
(3.35e-04)
<SENTENCE_START>
{
return
m
linear
velocity
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
linear
velocity
;
}
<SENTENCE_END/>
velocity
velocity
(9.36e-01)
linear
(3.57e-02)
%END%
(2.11e-02)
%UNK%
(7.75e-04)
value
(2.82e-04)
only
(1.58e-04)
2
(1.42e-04)
endian
(1.36e-04)
count
(1.34e-04)
enabled
(1.13e-04)
<SENTENCE_START>
{
return
m
linear
velocity
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
linear
velocity
;
}
<SENTENCE_END/>
%END%
%END%
(8.00e-01)
velocity
(1.23e-01)
value
(7.95e-03)
only
(4.09e-03)
%UNK%
(2.91e-03)
20
(2.58e-03)
count
(1.94e-03)
endian
(1.78e-03)
accessible
(1.68e-03)
2
(1.67e-03)
<SENTENCE_START>
{
return
m
linear
velocity
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
linear
velocity
;
}
<SENTENCE_END/>
set,angular,velocity
set
get
(7.15e-01)
set
(2.40e-01)
is
(6.50e-03)
angular
(4.00e-03)
m
(3.09e-03)
velocity
(2.50e-03)
%UNK%
(1.54e-03)
w
(1.21e-03)
update
(9.14e-04)
add
(8.70e-04)
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
w
*
w
>
0f
)
{
set
awake
(
true
)
;
}
m
angular
velocity
=
w
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
w
*
w
>
0f
)
{
set
awake
(
true
)
;
}
m
angular
velocity
=
w
;
}
<SENTENCE_END/>
angular
angular
(8.93e-01)
velocity
(6.00e-02)
%END%
(3.09e-02)
get
(2.63e-03)
m
(1.44e-03)
%UNK%
(1.43e-03)
type
(6.46e-04)
static
(3.29e-04)
is
(3.14e-04)
set
(3.08e-04)
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
w
*
w
>
0f
)
{
set
awake
(
true
)
;
}
m
angular
velocity
=
w
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
w
*
w
>
0f
)
{
set
awake
(
true
)
;
}
m
angular
velocity
=
w
;
}
<SENTENCE_END/>
velocity
velocity
(5.67e-01)
%END%
(3.68e-01)
angular
(3.00e-02)
type
(3.38e-03)
body
(1.85e-03)
awake
(1.53e-03)
w
(1.24e-03)
m
(8.26e-04)
static
(7.39e-04)
%UNK%
(6.47e-04)
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
w
*
w
>
0f
)
{
set
awake
(
true
)
;
}
m
angular
velocity
=
w
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
w
*
w
>
0f
)
{
set
awake
(
true
)
;
}
m
angular
velocity
=
w
;
}
<SENTENCE_END/>
%END%
%END%
(9.64e-01)
velocity
(2.09e-02)
type
(3.79e-04)
%UNK%
(3.78e-04)
awake
(3.67e-04)
value
(3.55e-04)
angular
(3.44e-04)
and
(3.18e-04)
w
(2.74e-04)
all
(2.17e-04)
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
w
*
w
>
0f
)
{
set
awake
(
true
)
;
}
m
angular
velocity
=
w
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
==
body
type
.
static
)
{
return
;
}
if
(
w
*
w
>
0f
)
{
set
awake
(
true
)
;
}
m
angular
velocity
=
w
;
}
<SENTENCE_END/>
get,angular,velocity
get
get
(9.87e-01)
is
(5.82e-03)
angular
(1.89e-03)
m
(1.59e-03)
return
(1.10e-03)
velocity
(4.14e-04)
iterator
(1.20e-04)
needs
(2.29e-05)
as
(1.47e-05)
%UNK%
(9.98e-06)
<SENTENCE_START>
{
return
m
angular
velocity
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
angular
velocity
;
}
<SENTENCE_END/>
angular
angular
(9.45e-01)
velocity
(2.35e-02)
get
(1.64e-02)
m
(1.06e-02)
%UNK%
(1.84e-03)
is
(2.48e-04)
%START%
(1.87e-04)
%END%
(1.36e-04)
factor
(9.66e-05)
cluster
(9.17e-05)
<SENTENCE_START>
{
return
m
angular
velocity
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
angular
velocity
;
}
<SENTENCE_END/>
velocity
velocity
(9.36e-01)
angular
(3.76e-02)
%END%
(2.21e-02)
%UNK%
(4.77e-04)
value
(2.00e-04)
count
(8.19e-05)
enabled
(7.91e-05)
m
(7.61e-05)
only
(7.41e-05)
type
(6.43e-05)
<SENTENCE_START>
{
return
m
angular
velocity
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
angular
velocity
;
}
<SENTENCE_END/>
%END%
%END%
(8.56e-01)
velocity
(9.96e-02)
value
(5.57e-03)
20
(2.22e-03)
only
(2.13e-03)
%UNK%
(1.29e-03)
count
(1.10e-03)
angular
(1.02e-03)
accessible
(9.38e-04)
enabled
(8.06e-04)
<SENTENCE_START>
{
return
m
angular
velocity
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
angular
velocity
;
}
<SENTENCE_END/>
get,gravity,scale
get
get
(9.93e-01)
gravity
(2.06e-03)
m
(1.42e-03)
return
(9.94e-04)
is
(7.21e-04)
scale
(6.29e-04)
iterator
(7.76e-05)
obtain
(1.28e-05)
set
(7.04e-06)
append
(7.03e-06)
<SENTENCE_START>
{
return
m
gravity
scale
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
gravity
scale
;
}
<SENTENCE_END/>
gravity
gravity
(9.25e-01)
scale
(6.55e-02)
get
(6.45e-03)
m
(2.05e-03)
%END%
(8.41e-04)
set
(2.45e-04)
scaling
(1.24e-04)
padding
(2.83e-05)
indices
(2.76e-05)
update
(9.65e-06)
<SENTENCE_START>
{
return
m
gravity
scale
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
gravity
scale
;
}
<SENTENCE_END/>
scale
scale
(8.83e-01)
%END%
(7.92e-02)
gravity
(3.30e-02)
value
(3.81e-04)
%UNK%
(1.32e-04)
m
(1.17e-04)
data
(1.07e-04)
height
(9.46e-05)
buffer
(8.85e-05)
only
(8.04e-05)
<SENTENCE_START>
{
return
m
gravity
scale
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
gravity
scale
;
}
<SENTENCE_END/>
%END%
%END%
(9.68e-01)
scale
(9.57e-03)
value
(3.93e-03)
only
(1.30e-03)
20
(1.25e-03)
buffer
(4.76e-04)
offset
(4.66e-04)
accessible
(4.59e-04)
array
(4.16e-04)
count
(3.99e-04)
<SENTENCE_START>
{
return
m
gravity
scale
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
return
m
gravity
scale
;
}
<SENTENCE_END/>
set,gravity,scale
set
set
(9.89e-01)
scale
(3.51e-03)
gravity
(2.96e-03)
m
(1.03e-03)
this
(3.25e-04)
reset
(2.77e-04)
apply
(1.71e-04)
translate
(7.01e-05)
clear
(3.96e-05)
get
(3.66e-05)
<SENTENCE_START>
{
this
.
m
gravity
scale
=
gravity
scale
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
m
gravity
scale
=
gravity
scale
;
}
<SENTENCE_END/>
gravity
gravity
(9.72e-01)
scale
(1.80e-02)
m
(9.08e-03)
%END%
(4.00e-04)
set
(1.49e-04)
get
(7.84e-05)
scaling
(1.90e-05)
padding
(4.80e-06)
indices
(3.18e-06)
apply
(2.99e-06)
<SENTENCE_START>
{
this
.
m
gravity
scale
=
gravity
scale
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
m
gravity
scale
=
gravity
scale
;
}
<SENTENCE_END/>
scale
scale
(7.39e-01)
gravity
(1.34e-01)
%END%
(1.24e-01)
m
(3.73e-04)
value
(4.39e-05)
data
(3.77e-05)
%UNK%
(2.82e-05)
height
(2.81e-05)
2
(2.20e-05)
position
(1.83e-05)
<SENTENCE_START>
{
this
.
m
gravity
scale
=
gravity
scale
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
m
gravity
scale
=
gravity
scale
;
}
<SENTENCE_END/>
%END%
%END%
(9.76e-01)
scale
(1.83e-02)
value
(4.43e-04)
gravity
(3.84e-04)
2
(1.42e-04)
only
(1.26e-04)
20
(1.24e-04)
data
(1.10e-04)
fv
(1.09e-04)
%UNK%
(1.03e-04)
<SENTENCE_START>
{
this
.
m
gravity
scale
=
gravity
scale
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
this
.
m
gravity
scale
=
gravity
scale
;
}
<SENTENCE_END/>
apply,force
apply
set
(3.87e-01)
is
(1.24e-01)
%UNK%
(9.19e-02)
get
(5.91e-02)
touch
(3.82e-02)
add
(2.86e-02)
force
(1.06e-02)
render
(9.59e-03)
%END%
(8.27e-03)
solve
(8.00e-03)
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
m
torque
+=
(
point
.
x
-
m
sweep
.
c
.
x
)
*
force
.
y
-
(
point
.
y
-
m
sweep
.
c
.
y
)
*
force
.
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
m
torque
+=
(
point
.
x
-
m
sweep
.
c
.
x
)
*
force
.
y
-
(
point
.
y
-
m
sweep
.
c
.
y
)
*
force
.
x
;
}
<SENTENCE_END/>
force
%END%
(6.00e-01)
force
(1.07e-01)
%UNK%
(1.90e-02)
awake
(1.19e-02)
m
(1.09e-02)
is
(9.64e-03)
x
(8.79e-03)
torque
(8.44e-03)
down
(8.28e-03)
set
(8.11e-03)
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
m
torque
+=
(
point
.
x
-
m
sweep
.
c
.
x
)
*
force
.
y
-
(
point
.
y
-
m
sweep
.
c
.
y
)
*
force
.
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
m
torque
+=
(
point
.
x
-
m
sweep
.
c
.
x
)
*
force
.
y
-
(
point
.
y
-
m
sweep
.
c
.
y
)
*
force
.
x
;
}
<SENTENCE_END/>
%END%
%END%
(8.48e-01)
x
(1.62e-02)
force
(1.15e-02)
torque
(6.32e-03)
%UNK%
(5.74e-03)
awake
(4.99e-03)
y
(3.91e-03)
down
(3.60e-03)
m
(2.70e-03)
type
(2.64e-03)
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
m
torque
+=
(
point
.
x
-
m
sweep
.
c
.
x
)
*
force
.
y
-
(
point
.
y
-
m
sweep
.
c
.
y
)
*
force
.
x
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
m
torque
+=
(
point
.
x
-
m
sweep
.
c
.
x
)
*
force
.
y
-
(
point
.
y
-
m
sweep
.
c
.
y
)
*
force
.
x
;
}
<SENTENCE_END/>
apply,force,to,center
apply
set
(5.03e-01)
is
(2.44e-01)
add
(4.02e-02)
%UNK%
(3.15e-02)
get
(2.19e-02)
touch
(1.46e-02)
force
(1.17e-02)
render
(7.18e-03)
draw
(6.77e-03)
m
(4.27e-03)
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
force
force
(4.50e-01)
%END%
(2.62e-01)
is
(3.05e-02)
awake
(1.56e-02)
%UNK%
(1.35e-02)
down
(1.08e-02)
set
(1.03e-02)
dynamic
(8.68e-03)
type
(7.07e-03)
m
(6.37e-03)
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
to
%END%
(8.27e-01)
x
(2.89e-02)
force
(1.57e-02)
awake
(9.29e-03)
y
(4.87e-03)
down
(4.15e-03)
type
(3.92e-03)
set
(3.01e-03)
%UNK%
(2.69e-03)
is
(2.18e-03)
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
center
%END%
(9.17e-01)
x
(1.07e-02)
force
(5.59e-03)
awake
(5.38e-03)
y
(3.11e-03)
down
(2.31e-03)
type
(1.81e-03)
set
(1.68e-03)
%UNK%
(1.47e-03)
is
(1.37e-03)
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
%END%
%END%
(9.42e-01)
awake
(5.43e-03)
x
(3.83e-03)
force
(3.00e-03)
is
(1.88e-03)
y
(1.72e-03)
down
(1.65e-03)
set
(1.64e-03)
type
(1.29e-03)
m
(1.24e-03)
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>
<SENTENCE_START>
{
if
(
m
type
!=
body
type
.
dynamic
)
{
return
;
}
if
(
is
awake
(
)
==
false
)
{
set
awake
(
true
)
;
}
m
force
.
x
+=
force
.
x
;
m
force
.
y
+=
force
.
y
;
}
<SENTENCE_END/>