Copy+Attentional Convolutional

Original Name get,ray,direction,inverse

get

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

ray

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

direction

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

inverse

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 53.1%)

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 7.1%)

<SENTENCE_START> { long c ptr = collision jni . bt broadphase ray callback ray direction inverse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

Original Name set,signs

set

<SENTENCE_START> { collision jni . bt broadphase ray callback signs set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { collision jni . bt broadphase ray callback signs set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

signs

<SENTENCE_START> { collision jni . bt broadphase ray callback signs set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { collision jni . bt broadphase ray callback signs set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt broadphase ray callback signs set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { collision jni . bt broadphase ray callback signs set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,signs

get

<SENTENCE_START> { return collision jni . bt broadphase ray callback signs get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return collision jni . bt broadphase ray callback signs get ( swig c ptr , this ) ; } <SENTENCE_END/>

signs

<SENTENCE_START> { return collision jni . bt broadphase ray callback signs get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return collision jni . bt broadphase ray callback signs get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt broadphase ray callback signs get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return collision jni . bt broadphase ray callback signs get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,lambda,max

set

<SENTENCE_START> { collision jni . bt broadphase ray callback lambda max set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { collision jni . bt broadphase ray callback lambda max set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

lambda

<SENTENCE_START> { collision jni . bt broadphase ray callback lambda max set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt broadphase ray callback lambda max set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

max

<SENTENCE_START> { collision jni . bt broadphase ray callback lambda max set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 96.0%)

<SENTENCE_START> { collision jni . bt broadphase ray callback lambda max set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt broadphase ray callback lambda max set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { collision jni . bt broadphase ray callback lambda max set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,lambda,max

get

<SENTENCE_START> { return collision jni . bt broadphase ray callback lambda max get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return collision jni . bt broadphase ray callback lambda max get ( swig c ptr , this ) ; } <SENTENCE_END/>

lambda

<SENTENCE_START> { return collision jni . bt broadphase ray callback lambda max get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt broadphase ray callback lambda max get ( swig c ptr , this ) ; } <SENTENCE_END/>

max

<SENTENCE_START> { return collision jni . bt broadphase ray callback lambda max get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 98.1%)

<SENTENCE_START> { return collision jni . bt broadphase ray callback lambda max get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt broadphase ray callback lambda max get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return collision jni . bt broadphase ray callback lambda max get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name buffer,changed

buffer

<SENTENCE_START> { if ( is bound ) { gdx . gl 20 . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( is bound ) { gdx . gl 20 . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

changed

<SENTENCE_START> { if ( is bound ) { gdx . gl 20 . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

(Copy Probability: 9.4%)

<SENTENCE_START> { if ( is bound ) { gdx . gl 20 . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( is bound ) { gdx . gl 20 . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

(Copy Probability: 9.4%)

<SENTENCE_START> { if ( is bound ) { gdx . gl 20 . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

Original Name bind,attributes

bind

<SENTENCE_START> { final gl 20 gl = gdx . gl 20 ; gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; final int num attributes = attributes . size ( ) ; if ( locations == null ) { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = shader . get attribute location ( attribute . alias ) ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } else { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = locations [ i ] ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { final gl 20 gl = gdx . gl 20 ; gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; final int num attributes = attributes . size ( ) ; if ( locations == null ) { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = shader . get attribute location ( attribute . alias ) ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } else { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = locations [ i ] ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } } <SENTENCE_END/>

attributes

<SENTENCE_START> { final gl 20 gl = gdx . gl 20 ; gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; final int num attributes = attributes . size ( ) ; if ( locations == null ) { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = shader . get attribute location ( attribute . alias ) ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } else { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = locations [ i ] ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } } <SENTENCE_END/>

(Copy Probability: 36.3%)

<SENTENCE_START> { final gl 20 gl = gdx . gl 20 ; gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; final int num attributes = attributes . size ( ) ; if ( locations == null ) { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = shader . get attribute location ( attribute . alias ) ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } else { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = locations [ i ] ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { final gl 20 gl = gdx . gl 20 ; gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; final int num attributes = attributes . size ( ) ; if ( locations == null ) { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = shader . get attribute location ( attribute . alias ) ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } else { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = locations [ i ] ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } } <SENTENCE_END/>

(Copy Probability: 6.2%)

<SENTENCE_START> { final gl 20 gl = gdx . gl 20 ; gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; final int num attributes = attributes . size ( ) ; if ( locations == null ) { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = shader . get attribute location ( attribute . alias ) ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } else { for ( int i = 0 ; i < num attributes ; i ++ ) { final vertex attribute attribute = attributes . get ( i ) ; final int location = locations [ i ] ; if ( location < 0 ) continue ; shader . enable vertex attribute ( location ) ; shader . set vertex attribute ( location , attribute . num components , attribute . type , attribute . normalized , attributes . vertex size , attribute . offset ) ; } } } <SENTENCE_END/>

Original Name bind,data

bind

<SENTENCE_START> { if ( is dirty ) { gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; byte buffer . limit ( buffer . limit ( ) * 4 ) ; gl . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { if ( is dirty ) { gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; byte buffer . limit ( buffer . limit ( ) * 4 ) ; gl . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

data

<SENTENCE_START> { if ( is dirty ) { gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; byte buffer . limit ( buffer . limit ( ) * 4 ) ; gl . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

(Copy Probability: 18.3%)

<SENTENCE_START> { if ( is dirty ) { gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; byte buffer . limit ( buffer . limit ( ) * 4 ) ; gl . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( is dirty ) { gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; byte buffer . limit ( buffer . limit ( ) * 4 ) ; gl . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

(Copy Probability: 8.4%)

<SENTENCE_START> { if ( is dirty ) { gl . gl bind buffer ( gl 20 . gl array buffer , buffer handle ) ; byte buffer . limit ( buffer . limit ( ) * 4 ) ; gl . gl buffer data ( gl 20 . gl array buffer , byte buffer . limit ( ) , byte buffer , usage ) ; is dirty = false ; } } <SENTENCE_END/>

Original Name get,c,ptr

get

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

c

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

ptr

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

Original Name set,floats

set

<SENTENCE_START> { linear math jni . bt vector 3 floats set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { linear math jni . bt vector 3 floats set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

floats

<SENTENCE_START> { linear math jni . bt vector 3 floats set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 95.5%)

<SENTENCE_START> { linear math jni . bt vector 3 floats set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 floats set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { linear math jni . bt vector 3 floats set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,floats

get

<SENTENCE_START> { return linear math jni . bt vector 3 floats get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return linear math jni . bt vector 3 floats get ( swig c ptr , this ) ; } <SENTENCE_END/>

floats

<SENTENCE_START> { return linear math jni . bt vector 3 floats get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 93.1%)

<SENTENCE_START> { return linear math jni . bt vector 3 floats get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 floats get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return linear math jni . bt vector 3 floats get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name dot

dot

<SENTENCE_START> { return linear math jni . bt vector 3 dot ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { return linear math jni . bt vector 3 dot ( swig c ptr , this , v ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 dot ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { return linear math jni . bt vector 3 dot ( swig c ptr , this , v ) ; } <SENTENCE_END/>

Original Name length,2

length

<SENTENCE_START> { return linear math jni . bt vector 3 length 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { return linear math jni . bt vector 3 length 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

2

<SENTENCE_START> { return linear math jni . bt vector 3 length 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 34.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 length 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 length 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 length 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name length

length

<SENTENCE_START> { return linear math jni . bt vector 3 length ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return linear math jni . bt vector 3 length ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 length ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 length ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name norm

norm

<SENTENCE_START> { return linear math jni . bt vector 3 norm ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 8.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 norm ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 norm ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 23.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 norm ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name distance,2

distance

<SENTENCE_START> { return linear math jni . bt vector 3 distance 2 ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 distance 2 ( swig c ptr , this , v ) ; } <SENTENCE_END/>

2

<SENTENCE_START> { return linear math jni . bt vector 3 distance 2 ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 49.1%)

<SENTENCE_START> { return linear math jni . bt vector 3 distance 2 ( swig c ptr , this , v ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 distance 2 ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 distance 2 ( swig c ptr , this , v ) ; } <SENTENCE_END/>

Original Name distance

distance

<SENTENCE_START> { return linear math jni . bt vector 3 distance ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 5.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 distance ( swig c ptr , this , v ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 distance ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 21.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 distance ( swig c ptr , this , v ) ; } <SENTENCE_END/>

Original Name safe,normalize

safe

<SENTENCE_START> { return linear math jni . bt vector 3 safe normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 safe normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

normalize

<SENTENCE_START> { return linear math jni . bt vector 3 safe normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 29.3%)

<SENTENCE_START> { return linear math jni . bt vector 3 safe normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 safe normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return linear math jni . bt vector 3 safe normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name normalize

normalize

<SENTENCE_START> { return linear math jni . bt vector 3 normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { return linear math jni . bt vector 3 normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { return linear math jni . bt vector 3 normalize ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name normalized

normalized

<SENTENCE_START> { return linear math jni . bt vector 3 normalized ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { return linear math jni . bt vector 3 normalized ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 normalized ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 11.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 normalized ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name rotate

rotate

<SENTENCE_START> { return linear math jni . bt vector 3 rotate ( swig c ptr , this , w axis , angle ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return linear math jni . bt vector 3 rotate ( swig c ptr , this , w axis , angle ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 rotate ( swig c ptr , this , w axis , angle ) ; } <SENTENCE_END/>

(Copy Probability: 7.1%)

<SENTENCE_START> { return linear math jni . bt vector 3 rotate ( swig c ptr , this , w axis , angle ) ; } <SENTENCE_END/>

Original Name angle

angle

<SENTENCE_START> { return linear math jni . bt vector 3 angle ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 6.5%)

<SENTENCE_START> { return linear math jni . bt vector 3 angle ( swig c ptr , this , v ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 angle ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 20.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 angle ( swig c ptr , this , v ) ; } <SENTENCE_END/>

Original Name absolute

absolute

<SENTENCE_START> { return linear math jni . bt vector 3 absolute ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { return linear math jni . bt vector 3 absolute ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 absolute ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 22.2%)

<SENTENCE_START> { return linear math jni . bt vector 3 absolute ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name cross

cross

<SENTENCE_START> { return linear math jni . bt vector 3 cross ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { return linear math jni . bt vector 3 cross ( swig c ptr , this , v ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 cross ( swig c ptr , this , v ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 cross ( swig c ptr , this , v ) ; } <SENTENCE_END/>

Original Name triple

triple

<SENTENCE_START> { return linear math jni . bt vector 3 triple ( swig c ptr , this , v 1 , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 7.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 triple ( swig c ptr , this , v 1 , v 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 triple ( swig c ptr , this , v 1 , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 18.4%)

<SENTENCE_START> { return linear math jni . bt vector 3 triple ( swig c ptr , this , v 1 , v 2 ) ; } <SENTENCE_END/>

Original Name min,axis

min

<SENTENCE_START> { return linear math jni . bt vector 3 min axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { return linear math jni . bt vector 3 min axis ( swig c ptr , this ) ; } <SENTENCE_END/>

axis

<SENTENCE_START> { return linear math jni . bt vector 3 min axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 88.2%)

<SENTENCE_START> { return linear math jni . bt vector 3 min axis ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 min axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 min axis ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name max,axis

max

<SENTENCE_START> { return linear math jni . bt vector 3 max axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { return linear math jni . bt vector 3 max axis ( swig c ptr , this ) ; } <SENTENCE_END/>

axis

<SENTENCE_START> { return linear math jni . bt vector 3 max axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 92.3%)

<SENTENCE_START> { return linear math jni . bt vector 3 max axis ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 max axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 max axis ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name furthest,axis

furthest

<SENTENCE_START> { return linear math jni . bt vector 3 furthest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { return linear math jni . bt vector 3 furthest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

axis

<SENTENCE_START> { return linear math jni . bt vector 3 furthest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 85.3%)

<SENTENCE_START> { return linear math jni . bt vector 3 furthest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 furthest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 furthest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name closest,axis

closest

<SENTENCE_START> { return linear math jni . bt vector 3 closest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { return linear math jni . bt vector 3 closest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

axis

<SENTENCE_START> { return linear math jni . bt vector 3 closest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 83.1%)

<SENTENCE_START> { return linear math jni . bt vector 3 closest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 closest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 closest axis ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,interpolate,3

set

<SENTENCE_START> { linear math jni . bt vector 3 set interpolate 3 ( swig c ptr , this , v 0 , v 1 , rt ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { linear math jni . bt vector 3 set interpolate 3 ( swig c ptr , this , v 0 , v 1 , rt ) ; } <SENTENCE_END/>

interpolate

<SENTENCE_START> { linear math jni . bt vector 3 set interpolate 3 ( swig c ptr , this , v 0 , v 1 , rt ) ; } <SENTENCE_END/>

(Copy Probability: 93.5%)

<SENTENCE_START> { linear math jni . bt vector 3 set interpolate 3 ( swig c ptr , this , v 0 , v 1 , rt ) ; } <SENTENCE_END/>

3

<SENTENCE_START> { linear math jni . bt vector 3 set interpolate 3 ( swig c ptr , this , v 0 , v 1 , rt ) ; } <SENTENCE_END/>

(Copy Probability: 52.7%)

<SENTENCE_START> { linear math jni . bt vector 3 set interpolate 3 ( swig c ptr , this , v 0 , v 1 , rt ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set interpolate 3 ( swig c ptr , this , v 0 , v 1 , rt ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { linear math jni . bt vector 3 set interpolate 3 ( swig c ptr , this , v 0 , v 1 , rt ) ; } <SENTENCE_END/>

Original Name lerp

lerp

<SENTENCE_START> { return linear math jni . bt vector 3 lerp ( swig c ptr , this , v , t ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 lerp ( swig c ptr , this , v , t ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 lerp ( swig c ptr , this , v , t ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { return linear math jni . bt vector 3 lerp ( swig c ptr , this , v , t ) ; } <SENTENCE_END/>

Original Name get,x

get

<SENTENCE_START> { return linear math jni . bt vector 3 get x ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 get x ( swig c ptr , this ) ; } <SENTENCE_END/>

x

<SENTENCE_START> { return linear math jni . bt vector 3 get x ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 98.3%)

<SENTENCE_START> { return linear math jni . bt vector 3 get x ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 get x ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 get x ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name get,y

get

<SENTENCE_START> { return linear math jni . bt vector 3 get y ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 get y ( swig c ptr , this ) ; } <SENTENCE_END/>

y

<SENTENCE_START> { return linear math jni . bt vector 3 get y ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 98.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 get y ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 get y ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 get y ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name get,z

get

<SENTENCE_START> { return linear math jni . bt vector 3 get z ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 get z ( swig c ptr , this ) ; } <SENTENCE_END/>

z

<SENTENCE_START> { return linear math jni . bt vector 3 get z ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { return linear math jni . bt vector 3 get z ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 get z ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 get z ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,x

set

<SENTENCE_START> { linear math jni . bt vector 3 set x ( swig c ptr , this , x ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { linear math jni . bt vector 3 set x ( swig c ptr , this , x ) ; } <SENTENCE_END/>

x

<SENTENCE_START> { linear math jni . bt vector 3 set x ( swig c ptr , this , x ) ; } <SENTENCE_END/>

(Copy Probability: 94.5%)

<SENTENCE_START> { linear math jni . bt vector 3 set x ( swig c ptr , this , x ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set x ( swig c ptr , this , x ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { linear math jni . bt vector 3 set x ( swig c ptr , this , x ) ; } <SENTENCE_END/>

Original Name set,y

set

<SENTENCE_START> { linear math jni . bt vector 3 set y ( swig c ptr , this , y ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { linear math jni . bt vector 3 set y ( swig c ptr , this , y ) ; } <SENTENCE_END/>

y

<SENTENCE_START> { linear math jni . bt vector 3 set y ( swig c ptr , this , y ) ; } <SENTENCE_END/>

(Copy Probability: 96.9%)

<SENTENCE_START> { linear math jni . bt vector 3 set y ( swig c ptr , this , y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set y ( swig c ptr , this , y ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { linear math jni . bt vector 3 set y ( swig c ptr , this , y ) ; } <SENTENCE_END/>

Original Name set,z

set

<SENTENCE_START> { linear math jni . bt vector 3 set z ( swig c ptr , this , z ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { linear math jni . bt vector 3 set z ( swig c ptr , this , z ) ; } <SENTENCE_END/>

z

<SENTENCE_START> { linear math jni . bt vector 3 set z ( swig c ptr , this , z ) ; } <SENTENCE_END/>

(Copy Probability: 98.0%)

<SENTENCE_START> { linear math jni . bt vector 3 set z ( swig c ptr , this , z ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set z ( swig c ptr , this , z ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { linear math jni . bt vector 3 set z ( swig c ptr , this , z ) ; } <SENTENCE_END/>

Original Name set,w

set

<SENTENCE_START> { linear math jni . bt vector 3 set w ( swig c ptr , this , w ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { linear math jni . bt vector 3 set w ( swig c ptr , this , w ) ; } <SENTENCE_END/>

w

<SENTENCE_START> { linear math jni . bt vector 3 set w ( swig c ptr , this , w ) ; } <SENTENCE_END/>

(Copy Probability: 83.8%)

<SENTENCE_START> { linear math jni . bt vector 3 set w ( swig c ptr , this , w ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set w ( swig c ptr , this , w ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { linear math jni . bt vector 3 set w ( swig c ptr , this , w ) ; } <SENTENCE_END/>

Original Name x

x

<SENTENCE_START> { return linear math jni . bt vector 3 x ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { return linear math jni . bt vector 3 x ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 x ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 8.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 x ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name y

y

<SENTENCE_START> { return linear math jni . bt vector 3 y ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { return linear math jni . bt vector 3 y ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 y ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 13.4%)

<SENTENCE_START> { return linear math jni . bt vector 3 y ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name z

z

<SENTENCE_START> { return linear math jni . bt vector 3 z ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 z ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 z ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 27.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 z ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name w

w

<SENTENCE_START> { return linear math jni . bt vector 3 w ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return linear math jni . bt vector 3 w ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 w ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { return linear math jni . bt vector 3 w ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,max

set

<SENTENCE_START> { linear math jni . bt vector 3 set max ( swig c ptr , this , other ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { linear math jni . bt vector 3 set max ( swig c ptr , this , other ) ; } <SENTENCE_END/>

max

<SENTENCE_START> { linear math jni . bt vector 3 set max ( swig c ptr , this , other ) ; } <SENTENCE_END/>

(Copy Probability: 97.9%)

<SENTENCE_START> { linear math jni . bt vector 3 set max ( swig c ptr , this , other ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set max ( swig c ptr , this , other ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { linear math jni . bt vector 3 set max ( swig c ptr , this , other ) ; } <SENTENCE_END/>

Original Name set,min

set

<SENTENCE_START> { linear math jni . bt vector 3 set min ( swig c ptr , this , other ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { linear math jni . bt vector 3 set min ( swig c ptr , this , other ) ; } <SENTENCE_END/>

min

<SENTENCE_START> { linear math jni . bt vector 3 set min ( swig c ptr , this , other ) ; } <SENTENCE_END/>

(Copy Probability: 95.3%)

<SENTENCE_START> { linear math jni . bt vector 3 set min ( swig c ptr , this , other ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set min ( swig c ptr , this , other ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { linear math jni . bt vector 3 set min ( swig c ptr , this , other ) ; } <SENTENCE_END/>

Original Name set,value

set

<SENTENCE_START> { linear math jni . bt vector 3 set value ( swig c ptr , this , x , y , z ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { linear math jni . bt vector 3 set value ( swig c ptr , this , x , y , z ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { linear math jni . bt vector 3 set value ( swig c ptr , this , x , y , z ) ; } <SENTENCE_END/>

(Copy Probability: 87.4%)

<SENTENCE_START> { linear math jni . bt vector 3 set value ( swig c ptr , this , x , y , z ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set value ( swig c ptr , this , x , y , z ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { linear math jni . bt vector 3 set value ( swig c ptr , this , x , y , z ) ; } <SENTENCE_END/>

Original Name get,skew,symmetric,matrix

get

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

skew

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

symmetric

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

matrix

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 68.7%)

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 8.3%)

<SENTENCE_START> { linear math jni . bt vector 3 get skew symmetric matrix ( swig c ptr , this , bt vector 3 . get c ptr ( v 0 ) , v 0 , bt vector 3 . get c ptr ( v 1 ) , v 1 , bt vector 3 . get c ptr ( v 2 ) , v 2 ) ; } <SENTENCE_END/>

Original Name set,zero

set

<SENTENCE_START> { linear math jni . bt vector 3 set zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { linear math jni . bt vector 3 set zero ( swig c ptr , this ) ; } <SENTENCE_END/>

zero

<SENTENCE_START> { linear math jni . bt vector 3 set zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 88.9%)

<SENTENCE_START> { linear math jni . bt vector 3 set zero ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 set zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { linear math jni . bt vector 3 set zero ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name is,zero

is

<SENTENCE_START> { return linear math jni . bt vector 3 is zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 is zero ( swig c ptr , this ) ; } <SENTENCE_END/>

zero

<SENTENCE_START> { return linear math jni . bt vector 3 is zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 82.5%)

<SENTENCE_START> { return linear math jni . bt vector 3 is zero ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 is zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 is zero ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name fuzzy,zero

fuzzy

<SENTENCE_START> { return linear math jni . bt vector 3 fuzzy zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 fuzzy zero ( swig c ptr , this ) ; } <SENTENCE_END/>

zero

<SENTENCE_START> { return linear math jni . bt vector 3 fuzzy zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 41.0%)

<SENTENCE_START> { return linear math jni . bt vector 3 fuzzy zero ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 fuzzy zero ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 fuzzy zero ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name serialize

serialize

<SENTENCE_START> { linear math jni . bt vector 3 serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { linear math jni . bt vector 3 serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

(Copy Probability: 8.0%)

<SENTENCE_START> { linear math jni . bt vector 3 serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

Original Name de,serialize

de

<SENTENCE_START> { linear math jni . bt vector 3 de serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 16.2%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

serialize

<SENTENCE_START> { linear math jni . bt vector 3 de serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 98.4%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 de serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

Original Name serialize,float

serialize

<SENTENCE_START> { linear math jni . bt vector 3 serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

(Copy Probability: 12.5%)

<SENTENCE_START> { linear math jni . bt vector 3 serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

float

<SENTENCE_START> { linear math jni . bt vector 3 serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

(Copy Probability: 82.8%)

<SENTENCE_START> { linear math jni . bt vector 3 serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { linear math jni . bt vector 3 serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

Original Name de,serialize,float

de

<SENTENCE_START> { linear math jni . bt vector 3 de serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 14.6%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

serialize

<SENTENCE_START> { linear math jni . bt vector 3 de serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

float

<SENTENCE_START> { linear math jni . bt vector 3 de serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 95.2%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 de serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize float ( swig c ptr , this , bt vector 3 float data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

Original Name serialize,double

serialize

<SENTENCE_START> { linear math jni . bt vector 3 serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

(Copy Probability: 11.0%)

<SENTENCE_START> { linear math jni . bt vector 3 serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

double

<SENTENCE_START> { linear math jni . bt vector 3 serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

(Copy Probability: 87.7%)

<SENTENCE_START> { linear math jni . bt vector 3 serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { linear math jni . bt vector 3 serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data out ) , data out ) ; } <SENTENCE_END/>

Original Name de,serialize,double

de

<SENTENCE_START> { linear math jni . bt vector 3 de serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 13.1%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

serialize

<SENTENCE_START> { linear math jni . bt vector 3 de serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

double

<SENTENCE_START> { linear math jni . bt vector 3 de serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 96.1%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { linear math jni . bt vector 3 de serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { linear math jni . bt vector 3 de serialize double ( swig c ptr , this , bt vector 3 double data . get c ptr ( data in ) , data in ) ; } <SENTENCE_END/>

Original Name max,dot

max

<SENTENCE_START> { return linear math jni . bt vector 3 max dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { return linear math jni . bt vector 3 max dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

dot

<SENTENCE_START> { return linear math jni . bt vector 3 max dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

(Copy Probability: 74.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 max dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 max dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { return linear math jni . bt vector 3 max dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

Original Name min,dot

min

<SENTENCE_START> { return linear math jni . bt vector 3 min dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 min dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

dot

<SENTENCE_START> { return linear math jni . bt vector 3 min dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

(Copy Probability: 64.6%)

<SENTENCE_START> { return linear math jni . bt vector 3 min dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 min dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { return linear math jni . bt vector 3 min dot ( swig c ptr , this , bt vector 3 . get c ptr ( array ) , array , array count , swigtype p float . get c ptr ( dot out ) ) ; } <SENTENCE_END/>

Original Name dot,3

dot

<SENTENCE_START> { return linear math jni . bt vector 3 dot 3 ( swig c ptr , this , v 0 , v 1 , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 6.5%)

<SENTENCE_START> { return linear math jni . bt vector 3 dot 3 ( swig c ptr , this , v 0 , v 1 , v 2 ) ; } <SENTENCE_END/>

3

<SENTENCE_START> { return linear math jni . bt vector 3 dot 3 ( swig c ptr , this , v 0 , v 1 , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 26.7%)

<SENTENCE_START> { return linear math jni . bt vector 3 dot 3 ( swig c ptr , this , v 0 , v 1 , v 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return linear math jni . bt vector 3 dot 3 ( swig c ptr , this , v 0 , v 1 , v 2 ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return linear math jni . bt vector 3 dot 3 ( swig c ptr , this , v 0 , v 1 , v 2 ) ; } <SENTENCE_END/>

Original Name on,click

on

<SENTENCE_START> { text input dialog box . this . on positive ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { text input dialog box . this . on positive ( ) ; } <SENTENCE_END/>

click

<SENTENCE_START> { text input dialog box . this . on positive ( ) ; } <SENTENCE_END/>

(Copy Probability: 22.5%)

<SENTENCE_START> { text input dialog box . this . on positive ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { text input dialog box . this . on positive ( ) ; } <SENTENCE_END/>

(Copy Probability: 6.7%)

<SENTENCE_START> { text input dialog box . this . on positive ( ) ; } <SENTENCE_END/>

Original Name on,click

on

<SENTENCE_START> { text input dialog box . this . on negative ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { text input dialog box . this . on negative ( ) ; } <SENTENCE_END/>

click

<SENTENCE_START> { text input dialog box . this . on negative ( ) ; } <SENTENCE_END/>

(Copy Probability: 31.0%)

<SENTENCE_START> { text input dialog box . this . on negative ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { text input dialog box . this . on negative ( ) ; } <SENTENCE_END/>

(Copy Probability: 9.8%)

<SENTENCE_START> { text input dialog box . this . on negative ( ) ; } <SENTENCE_END/>

Original Name on,positive

on

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( text box . get text ( ) ) ; } this . hide ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( text box . get text ( ) ) ; } this . hide ( ) ; } <SENTENCE_END/>

positive

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( text box . get text ( ) ) ; } this . hide ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( text box . get text ( ) ) ; } this . hide ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( text box . get text ( ) ) ; } this . hide ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( text box . get text ( ) ) ; } this . hide ( ) ; } <SENTENCE_END/>

Original Name on,negative

on

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( ) ; } this . hide ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( ) ; } this . hide ( ) ; } <SENTENCE_END/>

negative

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( ) ; } this . hide ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( ) ; } this . hide ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( ) ; } this . hide ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { if ( listener != null ) { listener . %SELF% ( ) ; } this . hide ( ) ; } <SENTENCE_END/>

Original Name set,listener

set

<SENTENCE_START> { this . listener = listener ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { this . listener = listener ; } <SENTENCE_END/>

listener

<SENTENCE_START> { this . listener = listener ; } <SENTENCE_END/>

(Copy Probability: 94.6%)

<SENTENCE_START> { this . listener = listener ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . listener = listener ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { this . listener = listener ; } <SENTENCE_END/>

Original Name set,text

set

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , font . get color ( ) , 0 , align . left , false , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , font . get color ( ) , 0 , align . left , false , null ) ; } <SENTENCE_END/>

text

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , font . get color ( ) , 0 , align . left , false , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , font . get color ( ) , 0 , align . left , false , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , font . get color ( ) , 0 , align . left , false , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , font . get color ( ) , 0 , align . left , false , null ) ; } <SENTENCE_END/>

Original Name set,text

set

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , color , target width , halign , wrap , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , color , target width , halign , wrap , null ) ; } <SENTENCE_END/>

text

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , color , target width , halign , wrap , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , color , target width , halign , wrap , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , color , target width , halign , wrap , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { %SELF% ( font , str , 0 , str . length ( ) , color , target width , halign , wrap , null ) ; } <SENTENCE_END/>

Original Name set,text

set

<SENTENCE_START> { if ( truncate != null ) wrap = true ; else if ( target width <= font . data . space width ) wrap = false ; bitmap font data font data = font . data ; boolean markup enabled = font data . markup enabled ; pool < glyph run > glyph run pool = pools . get ( glyph run . class ) ; array < glyph run > runs = this . runs ; glyph run pool . free all ( runs ) ; runs . clear ( ) ; float x = 0 , y = 0 , width = 0 ; int lines = 0 ; array < color > color stack = this . color stack ; color next color = color ; color stack . add ( color ) ; pool < color > color pool = pools . get ( color . class ) ; int run start = start ; outer : while ( true ) { int run end = - 1 ; boolean newline = false , color run = false ; if ( start == end ) { if ( run start == end ) break ; run end = end ; } else { switch ( str . char at ( start ++ ) ) { case '|n' : run end = start - 1 ; newline = true ; break ; case '[' : if ( markup enabled ) { int length = parse color markup ( str , start , end , color pool ) ; if ( length >= 0 ) { run end = start - 1 ; start += length + 1 ; next color = color stack . peek ( ) ; color run = true ; } } break ; } } if ( run end != - 1 ) { if ( run end != run start ) { glyph run run = glyph run pool . obtain ( ) ; run . color . set ( color ) ; run . x = x ; run . y = y ; font data . get glyphs ( run , str , run start , run end , color run ) ; if ( run . glyphs . size == 0 ) glyph run pool . free ( run ) ; else { runs . add ( run ) ; float [ ] x advances = run . x advances . items ; for ( int i = 0 , n = run . x advances . size ; i < n ; i ++ ) { float x advance = x advances [ i ] ; x += x advance ; if ( wrap && x > target width && i > 1 && x - x advance + ( run . glyphs . get ( i - 1 ) . xoffset + run . glyphs . get ( i - 1 ) . width ) * font data . scale x - 0.0001f > target width ) { if ( truncate != null ) { truncate ( font data , run , target width , truncate , i , glyph run pool ) ; x = run . x + run . width ; break outer ; } int wrap index = font data . get wrap index ( run . glyphs , i ) ; if ( ( run . x == 0 && wrap index == 0 ) || wrap index >= run . glyphs . size ) { wrap index = i - 1 ; } glyph run next = wrap ( font data , run , glyph run pool , wrap index , i ) ; runs . add ( next ) ; width = math . max ( width , run . x + run . width ) ; x = 0 ; y += font data . down ; lines ++ ; next . x = 0 ; next . y = y ; i = - 1 ; n = next . x advances . size ; x advances = next . x advances . items ; run = next ; } else run . width += x advance ; } } } if ( newline ) { width = math . max ( width , x ) ; x = 0 ; y += font data . down ; lines ++ ; } run start = start ; color = next color ; } } width = math . max ( width , x ) ; for ( int i = 1 , n = color stack . size ; i < n ; i ++ ) color pool . free ( color stack . get ( i ) ) ; color stack . clear ( ) ; if ( ( halign & align . left ) == 0 ) { boolean center = ( halign & align . center ) != 0 ; float line width = 0 , line y = integer . min value ; int line start = 0 , n = runs . size ; for ( int i = 0 ; i < n ; i ++ ) { glyph run run = runs . get ( i ) ; if ( run . y != line y ) { line y = run . y ; float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < i ) runs . get ( line start ++ ) . x += shift ; line width = 0 ; } line width += run . width ; } float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < n ) runs . get ( line start ++ ) . x += shift ; } this . width = width ; this . height = font data . cap height + lines * font data . line height ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( truncate != null ) wrap = true ; else if ( target width <= font . data . space width ) wrap = false ; bitmap font data font data = font . data ; boolean markup enabled = font data . markup enabled ; pool < glyph run > glyph run pool = pools . get ( glyph run . class ) ; array < glyph run > runs = this . runs ; glyph run pool . free all ( runs ) ; runs . clear ( ) ; float x = 0 , y = 0 , width = 0 ; int lines = 0 ; array < color > color stack = this . color stack ; color next color = color ; color stack . add ( color ) ; pool < color > color pool = pools . get ( color . class ) ; int run start = start ; outer : while ( true ) { int run end = - 1 ; boolean newline = false , color run = false ; if ( start == end ) { if ( run start == end ) break ; run end = end ; } else { switch ( str . char at ( start ++ ) ) { case '|n' : run end = start - 1 ; newline = true ; break ; case '[' : if ( markup enabled ) { int length = parse color markup ( str , start , end , color pool ) ; if ( length >= 0 ) { run end = start - 1 ; start += length + 1 ; next color = color stack . peek ( ) ; color run = true ; } } break ; } } if ( run end != - 1 ) { if ( run end != run start ) { glyph run run = glyph run pool . obtain ( ) ; run . color . set ( color ) ; run . x = x ; run . y = y ; font data . get glyphs ( run , str , run start , run end , color run ) ; if ( run . glyphs . size == 0 ) glyph run pool . free ( run ) ; else { runs . add ( run ) ; float [ ] x advances = run . x advances . items ; for ( int i = 0 , n = run . x advances . size ; i < n ; i ++ ) { float x advance = x advances [ i ] ; x += x advance ; if ( wrap && x > target width && i > 1 && x - x advance + ( run . glyphs . get ( i - 1 ) . xoffset + run . glyphs . get ( i - 1 ) . width ) * font data . scale x - 0.0001f > target width ) { if ( truncate != null ) { truncate ( font data , run , target width , truncate , i , glyph run pool ) ; x = run . x + run . width ; break outer ; } int wrap index = font data . get wrap index ( run . glyphs , i ) ; if ( ( run . x == 0 && wrap index == 0 ) || wrap index >= run . glyphs . size ) { wrap index = i - 1 ; } glyph run next = wrap ( font data , run , glyph run pool , wrap index , i ) ; runs . add ( next ) ; width = math . max ( width , run . x + run . width ) ; x = 0 ; y += font data . down ; lines ++ ; next . x = 0 ; next . y = y ; i = - 1 ; n = next . x advances . size ; x advances = next . x advances . items ; run = next ; } else run . width += x advance ; } } } if ( newline ) { width = math . max ( width , x ) ; x = 0 ; y += font data . down ; lines ++ ; } run start = start ; color = next color ; } } width = math . max ( width , x ) ; for ( int i = 1 , n = color stack . size ; i < n ; i ++ ) color pool . free ( color stack . get ( i ) ) ; color stack . clear ( ) ; if ( ( halign & align . left ) == 0 ) { boolean center = ( halign & align . center ) != 0 ; float line width = 0 , line y = integer . min value ; int line start = 0 , n = runs . size ; for ( int i = 0 ; i < n ; i ++ ) { glyph run run = runs . get ( i ) ; if ( run . y != line y ) { line y = run . y ; float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < i ) runs . get ( line start ++ ) . x += shift ; line width = 0 ; } line width += run . width ; } float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < n ) runs . get ( line start ++ ) . x += shift ; } this . width = width ; this . height = font data . cap height + lines * font data . line height ; } <SENTENCE_END/>

text

<SENTENCE_START> { if ( truncate != null ) wrap = true ; else if ( target width <= font . data . space width ) wrap = false ; bitmap font data font data = font . data ; boolean markup enabled = font data . markup enabled ; pool < glyph run > glyph run pool = pools . get ( glyph run . class ) ; array < glyph run > runs = this . runs ; glyph run pool . free all ( runs ) ; runs . clear ( ) ; float x = 0 , y = 0 , width = 0 ; int lines = 0 ; array < color > color stack = this . color stack ; color next color = color ; color stack . add ( color ) ; pool < color > color pool = pools . get ( color . class ) ; int run start = start ; outer : while ( true ) { int run end = - 1 ; boolean newline = false , color run = false ; if ( start == end ) { if ( run start == end ) break ; run end = end ; } else { switch ( str . char at ( start ++ ) ) { case '|n' : run end = start - 1 ; newline = true ; break ; case '[' : if ( markup enabled ) { int length = parse color markup ( str , start , end , color pool ) ; if ( length >= 0 ) { run end = start - 1 ; start += length + 1 ; next color = color stack . peek ( ) ; color run = true ; } } break ; } } if ( run end != - 1 ) { if ( run end != run start ) { glyph run run = glyph run pool . obtain ( ) ; run . color . set ( color ) ; run . x = x ; run . y = y ; font data . get glyphs ( run , str , run start , run end , color run ) ; if ( run . glyphs . size == 0 ) glyph run pool . free ( run ) ; else { runs . add ( run ) ; float [ ] x advances = run . x advances . items ; for ( int i = 0 , n = run . x advances . size ; i < n ; i ++ ) { float x advance = x advances [ i ] ; x += x advance ; if ( wrap && x > target width && i > 1 && x - x advance + ( run . glyphs . get ( i - 1 ) . xoffset + run . glyphs . get ( i - 1 ) . width ) * font data . scale x - 0.0001f > target width ) { if ( truncate != null ) { truncate ( font data , run , target width , truncate , i , glyph run pool ) ; x = run . x + run . width ; break outer ; } int wrap index = font data . get wrap index ( run . glyphs , i ) ; if ( ( run . x == 0 && wrap index == 0 ) || wrap index >= run . glyphs . size ) { wrap index = i - 1 ; } glyph run next = wrap ( font data , run , glyph run pool , wrap index , i ) ; runs . add ( next ) ; width = math . max ( width , run . x + run . width ) ; x = 0 ; y += font data . down ; lines ++ ; next . x = 0 ; next . y = y ; i = - 1 ; n = next . x advances . size ; x advances = next . x advances . items ; run = next ; } else run . width += x advance ; } } } if ( newline ) { width = math . max ( width , x ) ; x = 0 ; y += font data . down ; lines ++ ; } run start = start ; color = next color ; } } width = math . max ( width , x ) ; for ( int i = 1 , n = color stack . size ; i < n ; i ++ ) color pool . free ( color stack . get ( i ) ) ; color stack . clear ( ) ; if ( ( halign & align . left ) == 0 ) { boolean center = ( halign & align . center ) != 0 ; float line width = 0 , line y = integer . min value ; int line start = 0 , n = runs . size ; for ( int i = 0 ; i < n ; i ++ ) { glyph run run = runs . get ( i ) ; if ( run . y != line y ) { line y = run . y ; float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < i ) runs . get ( line start ++ ) . x += shift ; line width = 0 ; } line width += run . width ; } float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < n ) runs . get ( line start ++ ) . x += shift ; } this . width = width ; this . height = font data . cap height + lines * font data . line height ; } <SENTENCE_END/>

(Copy Probability: 10.8%)

<SENTENCE_START> { if ( truncate != null ) wrap = true ; else if ( target width <= font . data . space width ) wrap = false ; bitmap font data font data = font . data ; boolean markup enabled = font data . markup enabled ; pool < glyph run > glyph run pool = pools . get ( glyph run . class ) ; array < glyph run > runs = this . runs ; glyph run pool . free all ( runs ) ; runs . clear ( ) ; float x = 0 , y = 0 , width = 0 ; int lines = 0 ; array < color > color stack = this . color stack ; color next color = color ; color stack . add ( color ) ; pool < color > color pool = pools . get ( color . class ) ; int run start = start ; outer : while ( true ) { int run end = - 1 ; boolean newline = false , color run = false ; if ( start == end ) { if ( run start == end ) break ; run end = end ; } else { switch ( str . char at ( start ++ ) ) { case '|n' : run end = start - 1 ; newline = true ; break ; case '[' : if ( markup enabled ) { int length = parse color markup ( str , start , end , color pool ) ; if ( length >= 0 ) { run end = start - 1 ; start += length + 1 ; next color = color stack . peek ( ) ; color run = true ; } } break ; } } if ( run end != - 1 ) { if ( run end != run start ) { glyph run run = glyph run pool . obtain ( ) ; run . color . set ( color ) ; run . x = x ; run . y = y ; font data . get glyphs ( run , str , run start , run end , color run ) ; if ( run . glyphs . size == 0 ) glyph run pool . free ( run ) ; else { runs . add ( run ) ; float [ ] x advances = run . x advances . items ; for ( int i = 0 , n = run . x advances . size ; i < n ; i ++ ) { float x advance = x advances [ i ] ; x += x advance ; if ( wrap && x > target width && i > 1 && x - x advance + ( run . glyphs . get ( i - 1 ) . xoffset + run . glyphs . get ( i - 1 ) . width ) * font data . scale x - 0.0001f > target width ) { if ( truncate != null ) { truncate ( font data , run , target width , truncate , i , glyph run pool ) ; x = run . x + run . width ; break outer ; } int wrap index = font data . get wrap index ( run . glyphs , i ) ; if ( ( run . x == 0 && wrap index == 0 ) || wrap index >= run . glyphs . size ) { wrap index = i - 1 ; } glyph run next = wrap ( font data , run , glyph run pool , wrap index , i ) ; runs . add ( next ) ; width = math . max ( width , run . x + run . width ) ; x = 0 ; y += font data . down ; lines ++ ; next . x = 0 ; next . y = y ; i = - 1 ; n = next . x advances . size ; x advances = next . x advances . items ; run = next ; } else run . width += x advance ; } } } if ( newline ) { width = math . max ( width , x ) ; x = 0 ; y += font data . down ; lines ++ ; } run start = start ; color = next color ; } } width = math . max ( width , x ) ; for ( int i = 1 , n = color stack . size ; i < n ; i ++ ) color pool . free ( color stack . get ( i ) ) ; color stack . clear ( ) ; if ( ( halign & align . left ) == 0 ) { boolean center = ( halign & align . center ) != 0 ; float line width = 0 , line y = integer . min value ; int line start = 0 , n = runs . size ; for ( int i = 0 ; i < n ; i ++ ) { glyph run run = runs . get ( i ) ; if ( run . y != line y ) { line y = run . y ; float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < i ) runs . get ( line start ++ ) . x += shift ; line width = 0 ; } line width += run . width ; } float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < n ) runs . get ( line start ++ ) . x += shift ; } this . width = width ; this . height = font data . cap height + lines * font data . line height ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( truncate != null ) wrap = true ; else if ( target width <= font . data . space width ) wrap = false ; bitmap font data font data = font . data ; boolean markup enabled = font data . markup enabled ; pool < glyph run > glyph run pool = pools . get ( glyph run . class ) ; array < glyph run > runs = this . runs ; glyph run pool . free all ( runs ) ; runs . clear ( ) ; float x = 0 , y = 0 , width = 0 ; int lines = 0 ; array < color > color stack = this . color stack ; color next color = color ; color stack . add ( color ) ; pool < color > color pool = pools . get ( color . class ) ; int run start = start ; outer : while ( true ) { int run end = - 1 ; boolean newline = false , color run = false ; if ( start == end ) { if ( run start == end ) break ; run end = end ; } else { switch ( str . char at ( start ++ ) ) { case '|n' : run end = start - 1 ; newline = true ; break ; case '[' : if ( markup enabled ) { int length = parse color markup ( str , start , end , color pool ) ; if ( length >= 0 ) { run end = start - 1 ; start += length + 1 ; next color = color stack . peek ( ) ; color run = true ; } } break ; } } if ( run end != - 1 ) { if ( run end != run start ) { glyph run run = glyph run pool . obtain ( ) ; run . color . set ( color ) ; run . x = x ; run . y = y ; font data . get glyphs ( run , str , run start , run end , color run ) ; if ( run . glyphs . size == 0 ) glyph run pool . free ( run ) ; else { runs . add ( run ) ; float [ ] x advances = run . x advances . items ; for ( int i = 0 , n = run . x advances . size ; i < n ; i ++ ) { float x advance = x advances [ i ] ; x += x advance ; if ( wrap && x > target width && i > 1 && x - x advance + ( run . glyphs . get ( i - 1 ) . xoffset + run . glyphs . get ( i - 1 ) . width ) * font data . scale x - 0.0001f > target width ) { if ( truncate != null ) { truncate ( font data , run , target width , truncate , i , glyph run pool ) ; x = run . x + run . width ; break outer ; } int wrap index = font data . get wrap index ( run . glyphs , i ) ; if ( ( run . x == 0 && wrap index == 0 ) || wrap index >= run . glyphs . size ) { wrap index = i - 1 ; } glyph run next = wrap ( font data , run , glyph run pool , wrap index , i ) ; runs . add ( next ) ; width = math . max ( width , run . x + run . width ) ; x = 0 ; y += font data . down ; lines ++ ; next . x = 0 ; next . y = y ; i = - 1 ; n = next . x advances . size ; x advances = next . x advances . items ; run = next ; } else run . width += x advance ; } } } if ( newline ) { width = math . max ( width , x ) ; x = 0 ; y += font data . down ; lines ++ ; } run start = start ; color = next color ; } } width = math . max ( width , x ) ; for ( int i = 1 , n = color stack . size ; i < n ; i ++ ) color pool . free ( color stack . get ( i ) ) ; color stack . clear ( ) ; if ( ( halign & align . left ) == 0 ) { boolean center = ( halign & align . center ) != 0 ; float line width = 0 , line y = integer . min value ; int line start = 0 , n = runs . size ; for ( int i = 0 ; i < n ; i ++ ) { glyph run run = runs . get ( i ) ; if ( run . y != line y ) { line y = run . y ; float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < i ) runs . get ( line start ++ ) . x += shift ; line width = 0 ; } line width += run . width ; } float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < n ) runs . get ( line start ++ ) . x += shift ; } this . width = width ; this . height = font data . cap height + lines * font data . line height ; } <SENTENCE_END/>

(Copy Probability: 6.3%)

<SENTENCE_START> { if ( truncate != null ) wrap = true ; else if ( target width <= font . data . space width ) wrap = false ; bitmap font data font data = font . data ; boolean markup enabled = font data . markup enabled ; pool < glyph run > glyph run pool = pools . get ( glyph run . class ) ; array < glyph run > runs = this . runs ; glyph run pool . free all ( runs ) ; runs . clear ( ) ; float x = 0 , y = 0 , width = 0 ; int lines = 0 ; array < color > color stack = this . color stack ; color next color = color ; color stack . add ( color ) ; pool < color > color pool = pools . get ( color . class ) ; int run start = start ; outer : while ( true ) { int run end = - 1 ; boolean newline = false , color run = false ; if ( start == end ) { if ( run start == end ) break ; run end = end ; } else { switch ( str . char at ( start ++ ) ) { case '|n' : run end = start - 1 ; newline = true ; break ; case '[' : if ( markup enabled ) { int length = parse color markup ( str , start , end , color pool ) ; if ( length >= 0 ) { run end = start - 1 ; start += length + 1 ; next color = color stack . peek ( ) ; color run = true ; } } break ; } } if ( run end != - 1 ) { if ( run end != run start ) { glyph run run = glyph run pool . obtain ( ) ; run . color . set ( color ) ; run . x = x ; run . y = y ; font data . get glyphs ( run , str , run start , run end , color run ) ; if ( run . glyphs . size == 0 ) glyph run pool . free ( run ) ; else { runs . add ( run ) ; float [ ] x advances = run . x advances . items ; for ( int i = 0 , n = run . x advances . size ; i < n ; i ++ ) { float x advance = x advances [ i ] ; x += x advance ; if ( wrap && x > target width && i > 1 && x - x advance + ( run . glyphs . get ( i - 1 ) . xoffset + run . glyphs . get ( i - 1 ) . width ) * font data . scale x - 0.0001f > target width ) { if ( truncate != null ) { truncate ( font data , run , target width , truncate , i , glyph run pool ) ; x = run . x + run . width ; break outer ; } int wrap index = font data . get wrap index ( run . glyphs , i ) ; if ( ( run . x == 0 && wrap index == 0 ) || wrap index >= run . glyphs . size ) { wrap index = i - 1 ; } glyph run next = wrap ( font data , run , glyph run pool , wrap index , i ) ; runs . add ( next ) ; width = math . max ( width , run . x + run . width ) ; x = 0 ; y += font data . down ; lines ++ ; next . x = 0 ; next . y = y ; i = - 1 ; n = next . x advances . size ; x advances = next . x advances . items ; run = next ; } else run . width += x advance ; } } } if ( newline ) { width = math . max ( width , x ) ; x = 0 ; y += font data . down ; lines ++ ; } run start = start ; color = next color ; } } width = math . max ( width , x ) ; for ( int i = 1 , n = color stack . size ; i < n ; i ++ ) color pool . free ( color stack . get ( i ) ) ; color stack . clear ( ) ; if ( ( halign & align . left ) == 0 ) { boolean center = ( halign & align . center ) != 0 ; float line width = 0 , line y = integer . min value ; int line start = 0 , n = runs . size ; for ( int i = 0 ; i < n ; i ++ ) { glyph run run = runs . get ( i ) ; if ( run . y != line y ) { line y = run . y ; float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < i ) runs . get ( line start ++ ) . x += shift ; line width = 0 ; } line width += run . width ; } float shift = target width - line width ; if ( center ) shift /= 2 ; while ( line start < n ) runs . get ( line start ++ ) . x += shift ; } this . width = width ; this . height = font data . cap height + lines * font data . line height ; } <SENTENCE_END/>

Original Name truncate

truncate

<SENTENCE_START> { glyph run truncate run = glyph run pool . obtain ( ) ; font data . get glyphs ( truncate run , %SELF% , 0 , %SELF% . length ( ) , true ) ; float truncate width = 0 ; for ( int i = 1 , n = truncate run . x advances . size ; i < n ; i ++ ) truncate width += truncate run . x advances . get ( i ) ; target width -= truncate width ; int count = 0 ; float width = run . x ; while ( count < run . x advances . size ) { float x advance = run . x advances . get ( count ) ; width += x advance ; if ( width > target width ) { run . width = width - run . x - x advance ; break ; } count ++ ; } if ( count > 1 ) { run . glyphs . %SELF% ( count - 1 ) ; run . x advances . %SELF% ( count ) ; adjust last glyph ( font data , run ) ; if ( truncate run . x advances . size > 0 ) run . x advances . add all ( truncate run . x advances , 1 , truncate run . x advances . size - 1 ) ; } else { run . glyphs . clear ( ) ; run . x advances . clear ( ) ; run . x advances . add all ( truncate run . x advances ) ; if ( truncate run . x advances . size > 0 ) run . width += truncate run . x advances . get ( 0 ) ; } run . glyphs . add all ( truncate run . glyphs ) ; run . width += truncate width ; glyph run pool . free ( truncate run ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { glyph run truncate run = glyph run pool . obtain ( ) ; font data . get glyphs ( truncate run , %SELF% , 0 , %SELF% . length ( ) , true ) ; float truncate width = 0 ; for ( int i = 1 , n = truncate run . x advances . size ; i < n ; i ++ ) truncate width += truncate run . x advances . get ( i ) ; target width -= truncate width ; int count = 0 ; float width = run . x ; while ( count < run . x advances . size ) { float x advance = run . x advances . get ( count ) ; width += x advance ; if ( width > target width ) { run . width = width - run . x - x advance ; break ; } count ++ ; } if ( count > 1 ) { run . glyphs . %SELF% ( count - 1 ) ; run . x advances . %SELF% ( count ) ; adjust last glyph ( font data , run ) ; if ( truncate run . x advances . size > 0 ) run . x advances . add all ( truncate run . x advances , 1 , truncate run . x advances . size - 1 ) ; } else { run . glyphs . clear ( ) ; run . x advances . clear ( ) ; run . x advances . add all ( truncate run . x advances ) ; if ( truncate run . x advances . size > 0 ) run . width += truncate run . x advances . get ( 0 ) ; } run . glyphs . add all ( truncate run . glyphs ) ; run . width += truncate width ; glyph run pool . free ( truncate run ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { glyph run truncate run = glyph run pool . obtain ( ) ; font data . get glyphs ( truncate run , %SELF% , 0 , %SELF% . length ( ) , true ) ; float truncate width = 0 ; for ( int i = 1 , n = truncate run . x advances . size ; i < n ; i ++ ) truncate width += truncate run . x advances . get ( i ) ; target width -= truncate width ; int count = 0 ; float width = run . x ; while ( count < run . x advances . size ) { float x advance = run . x advances . get ( count ) ; width += x advance ; if ( width > target width ) { run . width = width - run . x - x advance ; break ; } count ++ ; } if ( count > 1 ) { run . glyphs . %SELF% ( count - 1 ) ; run . x advances . %SELF% ( count ) ; adjust last glyph ( font data , run ) ; if ( truncate run . x advances . size > 0 ) run . x advances . add all ( truncate run . x advances , 1 , truncate run . x advances . size - 1 ) ; } else { run . glyphs . clear ( ) ; run . x advances . clear ( ) ; run . x advances . add all ( truncate run . x advances ) ; if ( truncate run . x advances . size > 0 ) run . width += truncate run . x advances . get ( 0 ) ; } run . glyphs . add all ( truncate run . glyphs ) ; run . width += truncate width ; glyph run pool . free ( truncate run ) ; } <SENTENCE_END/>

(Copy Probability: 10.0%)

<SENTENCE_START> { glyph run truncate run = glyph run pool . obtain ( ) ; font data . get glyphs ( truncate run , %SELF% , 0 , %SELF% . length ( ) , true ) ; float truncate width = 0 ; for ( int i = 1 , n = truncate run . x advances . size ; i < n ; i ++ ) truncate width += truncate run . x advances . get ( i ) ; target width -= truncate width ; int count = 0 ; float width = run . x ; while ( count < run . x advances . size ) { float x advance = run . x advances . get ( count ) ; width += x advance ; if ( width > target width ) { run . width = width - run . x - x advance ; break ; } count ++ ; } if ( count > 1 ) { run . glyphs . %SELF% ( count - 1 ) ; run . x advances . %SELF% ( count ) ; adjust last glyph ( font data , run ) ; if ( truncate run . x advances . size > 0 ) run . x advances . add all ( truncate run . x advances , 1 , truncate run . x advances . size - 1 ) ; } else { run . glyphs . clear ( ) ; run . x advances . clear ( ) ; run . x advances . add all ( truncate run . x advances ) ; if ( truncate run . x advances . size > 0 ) run . width += truncate run . x advances . get ( 0 ) ; } run . glyphs . add all ( truncate run . glyphs ) ; run . width += truncate width ; glyph run pool . free ( truncate run ) ; } <SENTENCE_END/>

Original Name wrap

wrap

<SENTENCE_START> { glyph run second = glyph run pool . obtain ( ) ; second . color . set ( first . color ) ; int glyph count = first . glyphs . size ; while ( width index < wrap index ) first . width += first . x advances . get ( width index ++ ) ; while ( width index > wrap index + 1 ) first . width -= first . x advances . get ( -- width index ) ; if ( wrap index < glyph count ) { array < glyph > glyphs 1 = second . glyphs ; array < glyph > glyphs 2 = first . glyphs ; glyphs 1 . add all ( glyphs 2 , 0 , wrap index ) ; glyphs 2 . remove range ( 0 , wrap index - 1 ) ; first . glyphs = glyphs 1 ; second . glyphs = glyphs 2 ; float array x advances 1 = second . x advances ; float array x advances 2 = first . x advances ; x advances 1 . add all ( x advances 2 , 0 , wrap index + 1 ) ; x advances 2 . remove range ( 1 , wrap index ) ; x advances 2 . set ( 0 , - glyphs 2 . first ( ) . xoffset * font data . scale x - font data . pad left ) ; first . x advances = x advances 1 ; second . x advances = x advances 2 ; } if ( wrap index == 0 ) { glyph run pool . free ( first ) ; runs . pop ( ) ; } else adjust last glyph ( font data , first ) ; return second ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { glyph run second = glyph run pool . obtain ( ) ; second . color . set ( first . color ) ; int glyph count = first . glyphs . size ; while ( width index < wrap index ) first . width += first . x advances . get ( width index ++ ) ; while ( width index > wrap index + 1 ) first . width -= first . x advances . get ( -- width index ) ; if ( wrap index < glyph count ) { array < glyph > glyphs 1 = second . glyphs ; array < glyph > glyphs 2 = first . glyphs ; glyphs 1 . add all ( glyphs 2 , 0 , wrap index ) ; glyphs 2 . remove range ( 0 , wrap index - 1 ) ; first . glyphs = glyphs 1 ; second . glyphs = glyphs 2 ; float array x advances 1 = second . x advances ; float array x advances 2 = first . x advances ; x advances 1 . add all ( x advances 2 , 0 , wrap index + 1 ) ; x advances 2 . remove range ( 1 , wrap index ) ; x advances 2 . set ( 0 , - glyphs 2 . first ( ) . xoffset * font data . scale x - font data . pad left ) ; first . x advances = x advances 1 ; second . x advances = x advances 2 ; } if ( wrap index == 0 ) { glyph run pool . free ( first ) ; runs . pop ( ) ; } else adjust last glyph ( font data , first ) ; return second ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { glyph run second = glyph run pool . obtain ( ) ; second . color . set ( first . color ) ; int glyph count = first . glyphs . size ; while ( width index < wrap index ) first . width += first . x advances . get ( width index ++ ) ; while ( width index > wrap index + 1 ) first . width -= first . x advances . get ( -- width index ) ; if ( wrap index < glyph count ) { array < glyph > glyphs 1 = second . glyphs ; array < glyph > glyphs 2 = first . glyphs ; glyphs 1 . add all ( glyphs 2 , 0 , wrap index ) ; glyphs 2 . remove range ( 0 , wrap index - 1 ) ; first . glyphs = glyphs 1 ; second . glyphs = glyphs 2 ; float array x advances 1 = second . x advances ; float array x advances 2 = first . x advances ; x advances 1 . add all ( x advances 2 , 0 , wrap index + 1 ) ; x advances 2 . remove range ( 1 , wrap index ) ; x advances 2 . set ( 0 , - glyphs 2 . first ( ) . xoffset * font data . scale x - font data . pad left ) ; first . x advances = x advances 1 ; second . x advances = x advances 2 ; } if ( wrap index == 0 ) { glyph run pool . free ( first ) ; runs . pop ( ) ; } else adjust last glyph ( font data , first ) ; return second ; } <SENTENCE_END/>

(Copy Probability: 15.0%)

<SENTENCE_START> { glyph run second = glyph run pool . obtain ( ) ; second . color . set ( first . color ) ; int glyph count = first . glyphs . size ; while ( width index < wrap index ) first . width += first . x advances . get ( width index ++ ) ; while ( width index > wrap index + 1 ) first . width -= first . x advances . get ( -- width index ) ; if ( wrap index < glyph count ) { array < glyph > glyphs 1 = second . glyphs ; array < glyph > glyphs 2 = first . glyphs ; glyphs 1 . add all ( glyphs 2 , 0 , wrap index ) ; glyphs 2 . remove range ( 0 , wrap index - 1 ) ; first . glyphs = glyphs 1 ; second . glyphs = glyphs 2 ; float array x advances 1 = second . x advances ; float array x advances 2 = first . x advances ; x advances 1 . add all ( x advances 2 , 0 , wrap index + 1 ) ; x advances 2 . remove range ( 1 , wrap index ) ; x advances 2 . set ( 0 , - glyphs 2 . first ( ) . xoffset * font data . scale x - font data . pad left ) ; first . x advances = x advances 1 ; second . x advances = x advances 2 ; } if ( wrap index == 0 ) { glyph run pool . free ( first ) ; runs . pop ( ) ; } else adjust last glyph ( font data , first ) ; return second ; } <SENTENCE_END/>

Original Name adjust,last,glyph

adjust

<SENTENCE_START> { glyph last = run . glyphs . peek ( ) ; if ( font data . is whitespace ( ( char ) last . id ) ) return ; float width = ( last . xoffset + last . width ) * font data . scale x - font data . pad right ; run . width += width - run . x advances . peek ( ) ; run . x advances . set ( run . x advances . size - 1 , width ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { glyph last = run . glyphs . peek ( ) ; if ( font data . is whitespace ( ( char ) last . id ) ) return ; float width = ( last . xoffset + last . width ) * font data . scale x - font data . pad right ; run . width += width - run . x advances . peek ( ) ; run . x advances . set ( run . x advances . size - 1 , width ) ; } <SENTENCE_END/>

last

<SENTENCE_START> { glyph last = run . glyphs . peek ( ) ; if ( font data . is whitespace ( ( char ) last . id ) ) return ; float width = ( last . xoffset + last . width ) * font data . scale x - font data . pad right ; run . width += width - run . x advances . peek ( ) ; run . x advances . set ( run . x advances . size - 1 , width ) ; } <SENTENCE_END/>

(Copy Probability: 17.9%)

<SENTENCE_START> { glyph last = run . glyphs . peek ( ) ; if ( font data . is whitespace ( ( char ) last . id ) ) return ; float width = ( last . xoffset + last . width ) * font data . scale x - font data . pad right ; run . width += width - run . x advances . peek ( ) ; run . x advances . set ( run . x advances . size - 1 , width ) ; } <SENTENCE_END/>

glyph

<SENTENCE_START> { glyph last = run . glyphs . peek ( ) ; if ( font data . is whitespace ( ( char ) last . id ) ) return ; float width = ( last . xoffset + last . width ) * font data . scale x - font data . pad right ; run . width += width - run . x advances . peek ( ) ; run . x advances . set ( run . x advances . size - 1 , width ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { glyph last = run . glyphs . peek ( ) ; if ( font data . is whitespace ( ( char ) last . id ) ) return ; float width = ( last . xoffset + last . width ) * font data . scale x - font data . pad right ; run . width += width - run . x advances . peek ( ) ; run . x advances . set ( run . x advances . size - 1 , width ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { glyph last = run . glyphs . peek ( ) ; if ( font data . is whitespace ( ( char ) last . id ) ) return ; float width = ( last . xoffset + last . width ) * font data . scale x - font data . pad right ; run . width += width - run . x advances . peek ( ) ; run . x advances . set ( run . x advances . size - 1 , width ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { glyph last = run . glyphs . peek ( ) ; if ( font data . is whitespace ( ( char ) last . id ) ) return ; float width = ( last . xoffset + last . width ) * font data . scale x - font data . pad right ; run . width += width - run . x advances . peek ( ) ; run . x advances . set ( run . x advances . size - 1 , width ) ; } <SENTENCE_END/>

Original Name parse,color,markup

parse

<SENTENCE_START> { if ( start == end ) return - 1 ; switch ( str . char at ( start ) ) { case '#' : int color int = 0 ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch == ']' ) { if ( i < start + 2 || i > start + 9 ) break ; if ( i - start <= 7 ) { for ( int ii = 0 , nn = 9 - ( i - start ) ; ii < nn ; ii ++ ) color int = color int << 4 ; color int |= 0xff ; } color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . rgba 8888 to color ( color , color int ) ; return i - start ; } if ( ch >= '0' && ch <= '9' ) color int = color int * 16 + ( ch - '0' ) ; else if ( ch >= 'a' && ch <= 'f' ) color int = color int * 16 + ( ch - ( 'a' - 10 ) ) ; else if ( ch >= 'A' && ch <= 'F' ) color int = color int * 16 + ( ch - ( 'A' - 10 ) ) ; else break ; } return - 1 ; case '[' : return - 1 ; case ']' : if ( color stack . size > 1 ) color pool . free ( color stack . pop ( ) ) ; return 0 ; } int color start = start ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch != ']' ) continue ; color named color = colors . get ( str . sub sequence ( color start , i ) . to string ( ) ) ; if ( named color == null ) return - 1 ; color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . set ( named color ) ; return i - start ; } return - 1 ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { if ( start == end ) return - 1 ; switch ( str . char at ( start ) ) { case '#' : int color int = 0 ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch == ']' ) { if ( i < start + 2 || i > start + 9 ) break ; if ( i - start <= 7 ) { for ( int ii = 0 , nn = 9 - ( i - start ) ; ii < nn ; ii ++ ) color int = color int << 4 ; color int |= 0xff ; } color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . rgba 8888 to color ( color , color int ) ; return i - start ; } if ( ch >= '0' && ch <= '9' ) color int = color int * 16 + ( ch - '0' ) ; else if ( ch >= 'a' && ch <= 'f' ) color int = color int * 16 + ( ch - ( 'a' - 10 ) ) ; else if ( ch >= 'A' && ch <= 'F' ) color int = color int * 16 + ( ch - ( 'A' - 10 ) ) ; else break ; } return - 1 ; case '[' : return - 1 ; case ']' : if ( color stack . size > 1 ) color pool . free ( color stack . pop ( ) ) ; return 0 ; } int color start = start ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch != ']' ) continue ; color named color = colors . get ( str . sub sequence ( color start , i ) . to string ( ) ) ; if ( named color == null ) return - 1 ; color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . set ( named color ) ; return i - start ; } return - 1 ; } <SENTENCE_END/>

color

<SENTENCE_START> { if ( start == end ) return - 1 ; switch ( str . char at ( start ) ) { case '#' : int color int = 0 ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch == ']' ) { if ( i < start + 2 || i > start + 9 ) break ; if ( i - start <= 7 ) { for ( int ii = 0 , nn = 9 - ( i - start ) ; ii < nn ; ii ++ ) color int = color int << 4 ; color int |= 0xff ; } color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . rgba 8888 to color ( color , color int ) ; return i - start ; } if ( ch >= '0' && ch <= '9' ) color int = color int * 16 + ( ch - '0' ) ; else if ( ch >= 'a' && ch <= 'f' ) color int = color int * 16 + ( ch - ( 'a' - 10 ) ) ; else if ( ch >= 'A' && ch <= 'F' ) color int = color int * 16 + ( ch - ( 'A' - 10 ) ) ; else break ; } return - 1 ; case '[' : return - 1 ; case ']' : if ( color stack . size > 1 ) color pool . free ( color stack . pop ( ) ) ; return 0 ; } int color start = start ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch != ']' ) continue ; color named color = colors . get ( str . sub sequence ( color start , i ) . to string ( ) ) ; if ( named color == null ) return - 1 ; color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . set ( named color ) ; return i - start ; } return - 1 ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { if ( start == end ) return - 1 ; switch ( str . char at ( start ) ) { case '#' : int color int = 0 ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch == ']' ) { if ( i < start + 2 || i > start + 9 ) break ; if ( i - start <= 7 ) { for ( int ii = 0 , nn = 9 - ( i - start ) ; ii < nn ; ii ++ ) color int = color int << 4 ; color int |= 0xff ; } color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . rgba 8888 to color ( color , color int ) ; return i - start ; } if ( ch >= '0' && ch <= '9' ) color int = color int * 16 + ( ch - '0' ) ; else if ( ch >= 'a' && ch <= 'f' ) color int = color int * 16 + ( ch - ( 'a' - 10 ) ) ; else if ( ch >= 'A' && ch <= 'F' ) color int = color int * 16 + ( ch - ( 'A' - 10 ) ) ; else break ; } return - 1 ; case '[' : return - 1 ; case ']' : if ( color stack . size > 1 ) color pool . free ( color stack . pop ( ) ) ; return 0 ; } int color start = start ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch != ']' ) continue ; color named color = colors . get ( str . sub sequence ( color start , i ) . to string ( ) ) ; if ( named color == null ) return - 1 ; color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . set ( named color ) ; return i - start ; } return - 1 ; } <SENTENCE_END/>

markup

<SENTENCE_START> { if ( start == end ) return - 1 ; switch ( str . char at ( start ) ) { case '#' : int color int = 0 ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch == ']' ) { if ( i < start + 2 || i > start + 9 ) break ; if ( i - start <= 7 ) { for ( int ii = 0 , nn = 9 - ( i - start ) ; ii < nn ; ii ++ ) color int = color int << 4 ; color int |= 0xff ; } color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . rgba 8888 to color ( color , color int ) ; return i - start ; } if ( ch >= '0' && ch <= '9' ) color int = color int * 16 + ( ch - '0' ) ; else if ( ch >= 'a' && ch <= 'f' ) color int = color int * 16 + ( ch - ( 'a' - 10 ) ) ; else if ( ch >= 'A' && ch <= 'F' ) color int = color int * 16 + ( ch - ( 'A' - 10 ) ) ; else break ; } return - 1 ; case '[' : return - 1 ; case ']' : if ( color stack . size > 1 ) color pool . free ( color stack . pop ( ) ) ; return 0 ; } int color start = start ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch != ']' ) continue ; color named color = colors . get ( str . sub sequence ( color start , i ) . to string ( ) ) ; if ( named color == null ) return - 1 ; color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . set ( named color ) ; return i - start ; } return - 1 ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( start == end ) return - 1 ; switch ( str . char at ( start ) ) { case '#' : int color int = 0 ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch == ']' ) { if ( i < start + 2 || i > start + 9 ) break ; if ( i - start <= 7 ) { for ( int ii = 0 , nn = 9 - ( i - start ) ; ii < nn ; ii ++ ) color int = color int << 4 ; color int |= 0xff ; } color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . rgba 8888 to color ( color , color int ) ; return i - start ; } if ( ch >= '0' && ch <= '9' ) color int = color int * 16 + ( ch - '0' ) ; else if ( ch >= 'a' && ch <= 'f' ) color int = color int * 16 + ( ch - ( 'a' - 10 ) ) ; else if ( ch >= 'A' && ch <= 'F' ) color int = color int * 16 + ( ch - ( 'A' - 10 ) ) ; else break ; } return - 1 ; case '[' : return - 1 ; case ']' : if ( color stack . size > 1 ) color pool . free ( color stack . pop ( ) ) ; return 0 ; } int color start = start ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch != ']' ) continue ; color named color = colors . get ( str . sub sequence ( color start , i ) . to string ( ) ) ; if ( named color == null ) return - 1 ; color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . set ( named color ) ; return i - start ; } return - 1 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( start == end ) return - 1 ; switch ( str . char at ( start ) ) { case '#' : int color int = 0 ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch == ']' ) { if ( i < start + 2 || i > start + 9 ) break ; if ( i - start <= 7 ) { for ( int ii = 0 , nn = 9 - ( i - start ) ; ii < nn ; ii ++ ) color int = color int << 4 ; color int |= 0xff ; } color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . rgba 8888 to color ( color , color int ) ; return i - start ; } if ( ch >= '0' && ch <= '9' ) color int = color int * 16 + ( ch - '0' ) ; else if ( ch >= 'a' && ch <= 'f' ) color int = color int * 16 + ( ch - ( 'a' - 10 ) ) ; else if ( ch >= 'A' && ch <= 'F' ) color int = color int * 16 + ( ch - ( 'A' - 10 ) ) ; else break ; } return - 1 ; case '[' : return - 1 ; case ']' : if ( color stack . size > 1 ) color pool . free ( color stack . pop ( ) ) ; return 0 ; } int color start = start ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch != ']' ) continue ; color named color = colors . get ( str . sub sequence ( color start , i ) . to string ( ) ) ; if ( named color == null ) return - 1 ; color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . set ( named color ) ; return i - start ; } return - 1 ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( start == end ) return - 1 ; switch ( str . char at ( start ) ) { case '#' : int color int = 0 ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch == ']' ) { if ( i < start + 2 || i > start + 9 ) break ; if ( i - start <= 7 ) { for ( int ii = 0 , nn = 9 - ( i - start ) ; ii < nn ; ii ++ ) color int = color int << 4 ; color int |= 0xff ; } color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . rgba 8888 to color ( color , color int ) ; return i - start ; } if ( ch >= '0' && ch <= '9' ) color int = color int * 16 + ( ch - '0' ) ; else if ( ch >= 'a' && ch <= 'f' ) color int = color int * 16 + ( ch - ( 'a' - 10 ) ) ; else if ( ch >= 'A' && ch <= 'F' ) color int = color int * 16 + ( ch - ( 'A' - 10 ) ) ; else break ; } return - 1 ; case '[' : return - 1 ; case ']' : if ( color stack . size > 1 ) color pool . free ( color stack . pop ( ) ) ; return 0 ; } int color start = start ; for ( int i = start + 1 ; i < end ; i ++ ) { char ch = str . char at ( i ) ; if ( ch != ']' ) continue ; color named color = colors . get ( str . sub sequence ( color start , i ) . to string ( ) ) ; if ( named color == null ) return - 1 ; color color = color pool . obtain ( ) ; color stack . add ( color ) ; color . set ( named color ) ; return i - start ; } return - 1 ; } <SENTENCE_END/>

Original Name reset

reset

<SENTENCE_START> { pools . get ( glyph run . class ) . free all ( runs ) ; runs . clear ( ) ; width = 0 ; height = 0 ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { pools . get ( glyph run . class ) . free all ( runs ) ; runs . clear ( ) ; width = 0 ; height = 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { pools . get ( glyph run . class ) . free all ( runs ) ; runs . clear ( ) ; width = 0 ; height = 0 ; } <SENTENCE_END/>

(Copy Probability: 9.0%)

<SENTENCE_START> { pools . get ( glyph run . class ) . free all ( runs ) ; runs . clear ( ) ; width = 0 ; height = 0 ; } <SENTENCE_END/>

Original Name reset

reset

<SENTENCE_START> { glyphs . clear ( ) ; x advances . clear ( ) ; width = 0 ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { glyphs . clear ( ) ; x advances . clear ( ) ; width = 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { glyphs . clear ( ) ; x advances . clear ( ) ; width = 0 ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { glyphs . clear ( ) ; x advances . clear ( ) ; width = 0 ; } <SENTENCE_END/>

Original Name get,width

get

<SENTENCE_START> { return width ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return width ; } <SENTENCE_END/>

width

<SENTENCE_START> { return width ; } <SENTENCE_END/>

(Copy Probability: 37.3%)

<SENTENCE_START> { return width ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return width ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { return width ; } <SENTENCE_END/>

Original Name get,height

get

<SENTENCE_START> { return height ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return height ; } <SENTENCE_END/>

height

<SENTENCE_START> { return height ; } <SENTENCE_END/>

(Copy Probability: 52.4%)

<SENTENCE_START> { return height ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return height ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { return height ; } <SENTENCE_END/>

Original Name get,tile,width

get

<SENTENCE_START> { return tile width ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return tile width ; } <SENTENCE_END/>

tile

<SENTENCE_START> { return tile width ; } <SENTENCE_END/>

(Copy Probability: 98.1%)

<SENTENCE_START> { return tile width ; } <SENTENCE_END/>

width

<SENTENCE_START> { return tile width ; } <SENTENCE_END/>

(Copy Probability: 95.4%)

<SENTENCE_START> { return tile width ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return tile width ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { return tile width ; } <SENTENCE_END/>

Original Name get,tile,height

get

<SENTENCE_START> { return tile height ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return tile height ; } <SENTENCE_END/>

tile

<SENTENCE_START> { return tile height ; } <SENTENCE_END/>

(Copy Probability: 98.6%)

<SENTENCE_START> { return tile height ; } <SENTENCE_END/>

height

<SENTENCE_START> { return tile height ; } <SENTENCE_END/>

(Copy Probability: 97.1%)

<SENTENCE_START> { return tile height ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return tile height ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { return tile height ; } <SENTENCE_END/>

Original Name get,cell

get

<SENTENCE_START> { if ( x < 0 || x >= width ) return null ; if ( y < 0 || y >= height ) return null ; return cells [ x ] [ y ] ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { if ( x < 0 || x >= width ) return null ; if ( y < 0 || y >= height ) return null ; return cells [ x ] [ y ] ; } <SENTENCE_END/>

cell

<SENTENCE_START> { if ( x < 0 || x >= width ) return null ; if ( y < 0 || y >= height ) return null ; return cells [ x ] [ y ] ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { if ( x < 0 || x >= width ) return null ; if ( y < 0 || y >= height ) return null ; return cells [ x ] [ y ] ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( x < 0 || x >= width ) return null ; if ( y < 0 || y >= height ) return null ; return cells [ x ] [ y ] ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( x < 0 || x >= width ) return null ; if ( y < 0 || y >= height ) return null ; return cells [ x ] [ y ] ; } <SENTENCE_END/>

Original Name set,cell

set

<SENTENCE_START> { if ( x < 0 || x >= width ) return ; if ( y < 0 || y >= height ) return ; cells [ x ] [ y ] = cell ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { if ( x < 0 || x >= width ) return ; if ( y < 0 || y >= height ) return ; cells [ x ] [ y ] = cell ; } <SENTENCE_END/>

cell

<SENTENCE_START> { if ( x < 0 || x >= width ) return ; if ( y < 0 || y >= height ) return ; cells [ x ] [ y ] = cell ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( x < 0 || x >= width ) return ; if ( y < 0 || y >= height ) return ; cells [ x ] [ y ] = cell ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( x < 0 || x >= width ) return ; if ( y < 0 || y >= height ) return ; cells [ x ] [ y ] = cell ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { if ( x < 0 || x >= width ) return ; if ( y < 0 || y >= height ) return ; cells [ x ] [ y ] = cell ; } <SENTENCE_END/>

Original Name get,tile

get

<SENTENCE_START> { return tile ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return tile ; } <SENTENCE_END/>

tile

<SENTENCE_START> { return tile ; } <SENTENCE_END/>

(Copy Probability: 81.3%)

<SENTENCE_START> { return tile ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return tile ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return tile ; } <SENTENCE_END/>

Original Name set,tile

set

<SENTENCE_START> { this . tile = tile ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { this . tile = tile ; } <SENTENCE_END/>

tile

<SENTENCE_START> { this . tile = tile ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { this . tile = tile ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . tile = tile ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { this . tile = tile ; } <SENTENCE_END/>

Original Name get,flip,horizontally

get

<SENTENCE_START> { return flip horizontally ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return flip horizontally ; } <SENTENCE_END/>

flip

<SENTENCE_START> { return flip horizontally ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { return flip horizontally ; } <SENTENCE_END/>

horizontally

<SENTENCE_START> { return flip horizontally ; } <SENTENCE_END/>

(Copy Probability: 98.0%)

<SENTENCE_START> { return flip horizontally ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return flip horizontally ; } <SENTENCE_END/>

(Copy Probability: 9.0%)

<SENTENCE_START> { return flip horizontally ; } <SENTENCE_END/>

Original Name set,flip,horizontally

set

<SENTENCE_START> { this . flip horizontally = flip horizontally ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { this . flip horizontally = flip horizontally ; } <SENTENCE_END/>

flip

<SENTENCE_START> { this . flip horizontally = flip horizontally ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { this . flip horizontally = flip horizontally ; } <SENTENCE_END/>

horizontally

<SENTENCE_START> { this . flip horizontally = flip horizontally ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { this . flip horizontally = flip horizontally ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . flip horizontally = flip horizontally ; } <SENTENCE_END/>

(Copy Probability: 23.5%)

<SENTENCE_START> { this . flip horizontally = flip horizontally ; } <SENTENCE_END/>

Original Name get,flip,vertically

get

<SENTENCE_START> { return flip vertically ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return flip vertically ; } <SENTENCE_END/>

flip

<SENTENCE_START> { return flip vertically ; } <SENTENCE_END/>

(Copy Probability: 93.9%)

<SENTENCE_START> { return flip vertically ; } <SENTENCE_END/>

vertically

<SENTENCE_START> { return flip vertically ; } <SENTENCE_END/>

(Copy Probability: 84.6%)

<SENTENCE_START> { return flip vertically ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return flip vertically ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { return flip vertically ; } <SENTENCE_END/>

Original Name set,flip,vertically

set

<SENTENCE_START> { this . flip vertically = flip vertically ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { this . flip vertically = flip vertically ; } <SENTENCE_END/>

flip

<SENTENCE_START> { this . flip vertically = flip vertically ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { this . flip vertically = flip vertically ; } <SENTENCE_END/>

vertically

<SENTENCE_START> { this . flip vertically = flip vertically ; } <SENTENCE_END/>

(Copy Probability: 98.2%)

<SENTENCE_START> { this . flip vertically = flip vertically ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . flip vertically = flip vertically ; } <SENTENCE_END/>

(Copy Probability: 9.4%)

<SENTENCE_START> { this . flip vertically = flip vertically ; } <SENTENCE_END/>

Original Name get,rotation

get

<SENTENCE_START> { return rotation ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return rotation ; } <SENTENCE_END/>

rotation

<SENTENCE_START> { return rotation ; } <SENTENCE_END/>

(Copy Probability: 85.7%)

<SENTENCE_START> { return rotation ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return rotation ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return rotation ; } <SENTENCE_END/>

Original Name set,rotation

set

<SENTENCE_START> { this . rotation = rotation ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { this . rotation = rotation ; } <SENTENCE_END/>

rotation

<SENTENCE_START> { this . rotation = rotation ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { this . rotation = rotation ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . rotation = rotation ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { this . rotation = rotation ; } <SENTENCE_END/>

Original Name set

set

<SENTENCE_START> { vec 2 v = aabb . lower bound ; lower bound . x = v . x ; lower bound . y = v . y ; vec 2 v 1 = aabb . upper bound ; upper bound . x = v 1 . x ; upper bound . y = v 1 . y ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { vec 2 v = aabb . lower bound ; lower bound . x = v . x ; lower bound . y = v . y ; vec 2 v 1 = aabb . upper bound ; upper bound . x = v 1 . x ; upper bound . y = v 1 . y ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { vec 2 v = aabb . lower bound ; lower bound . x = v . x ; lower bound . y = v . y ; vec 2 v 1 = aabb . upper bound ; upper bound . x = v 1 . x ; upper bound . y = v 1 . y ; } <SENTENCE_END/>

(Copy Probability: 19.7%)

<SENTENCE_START> { vec 2 v = aabb . lower bound ; lower bound . x = v . x ; lower bound . y = v . y ; vec 2 v 1 = aabb . upper bound ; upper bound . x = v 1 . x ; upper bound . y = v 1 . y ; } <SENTENCE_END/>

Original Name is,valid

is

<SENTENCE_START> { final float dx = upper bound . x - lower bound . x ; if ( dx < 0f ) { return false ; } final float dy = upper bound . y - lower bound . y ; if ( dy < 0 ) { return false ; } return lower bound . %SELF% ( ) && upper bound . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { final float dx = upper bound . x - lower bound . x ; if ( dx < 0f ) { return false ; } final float dy = upper bound . y - lower bound . y ; if ( dy < 0 ) { return false ; } return lower bound . %SELF% ( ) && upper bound . %SELF% ( ) ; } <SENTENCE_END/>

valid

<SENTENCE_START> { final float dx = upper bound . x - lower bound . x ; if ( dx < 0f ) { return false ; } final float dy = upper bound . y - lower bound . y ; if ( dy < 0 ) { return false ; } return lower bound . %SELF% ( ) && upper bound . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { final float dx = upper bound . x - lower bound . x ; if ( dx < 0f ) { return false ; } final float dy = upper bound . y - lower bound . y ; if ( dy < 0 ) { return false ; } return lower bound . %SELF% ( ) && upper bound . %SELF% ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final float dx = upper bound . x - lower bound . x ; if ( dx < 0f ) { return false ; } final float dy = upper bound . y - lower bound . y ; if ( dy < 0 ) { return false ; } return lower bound . %SELF% ( ) && upper bound . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 7.0%)

<SENTENCE_START> { final float dx = upper bound . x - lower bound . x ; if ( dx < 0f ) { return false ; } final float dy = upper bound . y - lower bound . y ; if ( dy < 0 ) { return false ; } return lower bound . %SELF% ( ) && upper bound . %SELF% ( ) ; } <SENTENCE_END/>

Original Name get,center

get

<SENTENCE_START> { final vec 2 center = new vec 2 ( lower bound ) ; center . add local ( upper bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { final vec 2 center = new vec 2 ( lower bound ) ; center . add local ( upper bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

center

<SENTENCE_START> { final vec 2 center = new vec 2 ( lower bound ) ; center . add local ( upper bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

(Copy Probability: 22.9%)

<SENTENCE_START> { final vec 2 center = new vec 2 ( lower bound ) ; center . add local ( upper bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final vec 2 center = new vec 2 ( lower bound ) ; center . add local ( upper bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

(Copy Probability: 6.6%)

<SENTENCE_START> { final vec 2 center = new vec 2 ( lower bound ) ; center . add local ( upper bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

Original Name get,center,to,out

get

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

center

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

to

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

out

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { out . x = ( lower bound . x + upper bound . x ) * .5f ; out . y = ( lower bound . y + upper bound . y ) * .5f ; } <SENTENCE_END/>

Original Name get,extents

get

<SENTENCE_START> { final vec 2 center = new vec 2 ( upper bound ) ; center . sub local ( lower bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { final vec 2 center = new vec 2 ( upper bound ) ; center . sub local ( lower bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

extents

<SENTENCE_START> { final vec 2 center = new vec 2 ( upper bound ) ; center . sub local ( lower bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

(Copy Probability: 13.3%)

<SENTENCE_START> { final vec 2 center = new vec 2 ( upper bound ) ; center . sub local ( lower bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final vec 2 center = new vec 2 ( upper bound ) ; center . sub local ( lower bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { final vec 2 center = new vec 2 ( upper bound ) ; center . sub local ( lower bound ) ; center . mul local ( .5f ) ; return center ; } <SENTENCE_END/>

Original Name get,extents,to,out

get

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

extents

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

to

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

out

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { out . x = ( upper bound . x - lower bound . x ) * .5f ; out . y = ( upper bound . y - lower bound . y ) * .5f ; } <SENTENCE_END/>

Original Name get,vertices

get

<SENTENCE_START> { arg ray [ 0 ] . set ( lower bound ) ; arg ray [ 1 ] . set ( lower bound ) ; arg ray [ 1 ] . x += upper bound . x - lower bound . x ; arg ray [ 2 ] . set ( upper bound ) ; arg ray [ 3 ] . set ( upper bound ) ; arg ray [ 3 ] . x -= upper bound . x - lower bound . x ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { arg ray [ 0 ] . set ( lower bound ) ; arg ray [ 1 ] . set ( lower bound ) ; arg ray [ 1 ] . x += upper bound . x - lower bound . x ; arg ray [ 2 ] . set ( upper bound ) ; arg ray [ 3 ] . set ( upper bound ) ; arg ray [ 3 ] . x -= upper bound . x - lower bound . x ; } <SENTENCE_END/>

vertices

<SENTENCE_START> { arg ray [ 0 ] . set ( lower bound ) ; arg ray [ 1 ] . set ( lower bound ) ; arg ray [ 1 ] . x += upper bound . x - lower bound . x ; arg ray [ 2 ] . set ( upper bound ) ; arg ray [ 3 ] . set ( upper bound ) ; arg ray [ 3 ] . x -= upper bound . x - lower bound . x ; } <SENTENCE_END/>

(Copy Probability: 19.2%)

<SENTENCE_START> { arg ray [ 0 ] . set ( lower bound ) ; arg ray [ 1 ] . set ( lower bound ) ; arg ray [ 1 ] . x += upper bound . x - lower bound . x ; arg ray [ 2 ] . set ( upper bound ) ; arg ray [ 3 ] . set ( upper bound ) ; arg ray [ 3 ] . x -= upper bound . x - lower bound . x ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { arg ray [ 0 ] . set ( lower bound ) ; arg ray [ 1 ] . set ( lower bound ) ; arg ray [ 1 ] . x += upper bound . x - lower bound . x ; arg ray [ 2 ] . set ( upper bound ) ; arg ray [ 3 ] . set ( upper bound ) ; arg ray [ 3 ] . x -= upper bound . x - lower bound . x ; } <SENTENCE_END/>

(Copy Probability: 7.5%)

<SENTENCE_START> { arg ray [ 0 ] . set ( lower bound ) ; arg ray [ 1 ] . set ( lower bound ) ; arg ray [ 1 ] . x += upper bound . x - lower bound . x ; arg ray [ 2 ] . set ( upper bound ) ; arg ray [ 3 ] . set ( upper bound ) ; arg ray [ 3 ] . x -= upper bound . x - lower bound . x ; } <SENTENCE_END/>

Original Name combine

combine

<SENTENCE_START> { lower bound . x = aabb 1 . lower bound . x < aab . lower bound . x ? aabb 1 . lower bound . x : aab . lower bound . x ; lower bound . y = aabb 1 . lower bound . y < aab . lower bound . y ? aabb 1 . lower bound . y : aab . lower bound . y ; upper bound . x = aabb 1 . upper bound . x > aab . upper bound . x ? aabb 1 . upper bound . x : aab . upper bound . x ; upper bound . y = aabb 1 . upper bound . y > aab . upper bound . y ? aabb 1 . upper bound . y : aab . upper bound . y ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { lower bound . x = aabb 1 . lower bound . x < aab . lower bound . x ? aabb 1 . lower bound . x : aab . lower bound . x ; lower bound . y = aabb 1 . lower bound . y < aab . lower bound . y ? aabb 1 . lower bound . y : aab . lower bound . y ; upper bound . x = aabb 1 . upper bound . x > aab . upper bound . x ? aabb 1 . upper bound . x : aab . upper bound . x ; upper bound . y = aabb 1 . upper bound . y > aab . upper bound . y ? aabb 1 . upper bound . y : aab . upper bound . y ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { lower bound . x = aabb 1 . lower bound . x < aab . lower bound . x ? aabb 1 . lower bound . x : aab . lower bound . x ; lower bound . y = aabb 1 . lower bound . y < aab . lower bound . y ? aabb 1 . lower bound . y : aab . lower bound . y ; upper bound . x = aabb 1 . upper bound . x > aab . upper bound . x ? aabb 1 . upper bound . x : aab . upper bound . x ; upper bound . y = aabb 1 . upper bound . y > aab . upper bound . y ? aabb 1 . upper bound . y : aab . upper bound . y ; } <SENTENCE_END/>

(Copy Probability: 10.2%)

<SENTENCE_START> { lower bound . x = aabb 1 . lower bound . x < aab . lower bound . x ? aabb 1 . lower bound . x : aab . lower bound . x ; lower bound . y = aabb 1 . lower bound . y < aab . lower bound . y ? aabb 1 . lower bound . y : aab . lower bound . y ; upper bound . x = aabb 1 . upper bound . x > aab . upper bound . x ? aabb 1 . upper bound . x : aab . upper bound . x ; upper bound . y = aabb 1 . upper bound . y > aab . upper bound . y ? aabb 1 . upper bound . y : aab . upper bound . y ; } <SENTENCE_END/>

Original Name get,perimeter

get

<SENTENCE_START> { return 2.0f * ( upper bound . x - lower bound . x + upper bound . y - lower bound . y ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return 2.0f * ( upper bound . x - lower bound . x + upper bound . y - lower bound . y ) ; } <SENTENCE_END/>

perimeter

<SENTENCE_START> { return 2.0f * ( upper bound . x - lower bound . x + upper bound . y - lower bound . y ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return 2.0f * ( upper bound . x - lower bound . x + upper bound . y - lower bound . y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return 2.0f * ( upper bound . x - lower bound . x + upper bound . y - lower bound . y ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { return 2.0f * ( upper bound . x - lower bound . x + upper bound . y - lower bound . y ) ; } <SENTENCE_END/>

Original Name combine

combine

<SENTENCE_START> { lower bound . x = lower bound . x < aabb . lower bound . x ? lower bound . x : aabb . lower bound . x ; lower bound . y = lower bound . y < aabb . lower bound . y ? lower bound . y : aabb . lower bound . y ; upper bound . x = upper bound . x > aabb . upper bound . x ? upper bound . x : aabb . upper bound . x ; upper bound . y = upper bound . y > aabb . upper bound . y ? upper bound . y : aabb . upper bound . y ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { lower bound . x = lower bound . x < aabb . lower bound . x ? lower bound . x : aabb . lower bound . x ; lower bound . y = lower bound . y < aabb . lower bound . y ? lower bound . y : aabb . lower bound . y ; upper bound . x = upper bound . x > aabb . upper bound . x ? upper bound . x : aabb . upper bound . x ; upper bound . y = upper bound . y > aabb . upper bound . y ? upper bound . y : aabb . upper bound . y ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { lower bound . x = lower bound . x < aabb . lower bound . x ? lower bound . x : aabb . lower bound . x ; lower bound . y = lower bound . y < aabb . lower bound . y ? lower bound . y : aabb . lower bound . y ; upper bound . x = upper bound . x > aabb . upper bound . x ? upper bound . x : aabb . upper bound . x ; upper bound . y = upper bound . y > aabb . upper bound . y ? upper bound . y : aabb . upper bound . y ; } <SENTENCE_END/>

(Copy Probability: 15.5%)

<SENTENCE_START> { lower bound . x = lower bound . x < aabb . lower bound . x ? lower bound . x : aabb . lower bound . x ; lower bound . y = lower bound . y < aabb . lower bound . y ? lower bound . y : aabb . lower bound . y ; upper bound . x = upper bound . x > aabb . upper bound . x ? upper bound . x : aabb . upper bound . x ; upper bound . y = upper bound . y > aabb . upper bound . y ? upper bound . y : aabb . upper bound . y ; } <SENTENCE_END/>

Original Name contains

contains

<SENTENCE_START> { return lower bound . x <= aabb . lower bound . x && lower bound . y <= aabb . lower bound . y && aabb . upper bound . x <= upper bound . x && aabb . upper bound . y <= upper bound . y ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return lower bound . x <= aabb . lower bound . x && lower bound . y <= aabb . lower bound . y && aabb . upper bound . x <= upper bound . x && aabb . upper bound . y <= upper bound . y ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return lower bound . x <= aabb . lower bound . x && lower bound . y <= aabb . lower bound . y && aabb . upper bound . x <= upper bound . x && aabb . upper bound . y <= upper bound . y ; } <SENTENCE_END/>

(Copy Probability: 12.5%)

<SENTENCE_START> { return lower bound . x <= aabb . lower bound . x && lower bound . y <= aabb . lower bound . y && aabb . upper bound . x <= upper bound . x && aabb . upper bound . y <= upper bound . y ; } <SENTENCE_END/>

Original Name raycast

raycast

<SENTENCE_START> { return %SELF% ( output , input , new default world pool ( 4 , 4 ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return %SELF% ( output , input , new default world pool ( 4 , 4 ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( output , input , new default world pool ( 4 , 4 ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { return %SELF% ( output , input , new default world pool ( 4 , 4 ) ) ; } <SENTENCE_END/>

Original Name raycast

raycast

<SENTENCE_START> { float tmin = - float . max value ; float tmax = float . max value ; final vec 2 p = arg pool . pop vec 2 ( ) ; final vec 2 d = arg pool . pop vec 2 ( ) ; final vec 2 abs d = arg pool . pop vec 2 ( ) ; final vec 2 normal = arg pool . pop vec 2 ( ) ; p . set ( input . p 1 ) ; d . set ( input . p 2 ) . sub local ( input . p 1 ) ; vec 2 . abs to out ( d , abs d ) ; if ( abs d . x < settings . epsilon ) { if ( p . x < lower bound . x || upper bound . x < p . x ) { arg pool . push vec 2 ( 4 ) ; return false ; } } else { final float inv d = 1.0f / d . x ; float t 1 = ( lower bound . x - p . x ) * inv d ; float t 2 = ( upper bound . x - p . x ) * inv d ; float s = - 1.0f ; if ( t 1 > t 2 ) { final float temp = t 1 ; t 1 = t 2 ; t 2 = temp ; s = 1.0f ; } if ( t 1 > tmin ) { normal . set zero ( ) ; normal . x = s ; tmin = t 1 ; } tmax = math utils . min ( tmax , t 2 ) ; if ( tmin > tmax ) { arg pool . push vec 2 ( 4 ) ; return false ; } } if ( abs d . y < settings . epsilon ) { if ( p . y < lower bound . y || upper bound . y < p . y ) { arg pool . push vec 2 ( 4 ) ; return false ; } } else { final float inv d = 1.0f / d . y ; float t 1 = ( lower bound . y - p . y ) * inv d ; float t 2 = ( upper bound . y - p . y ) * inv d ; float s = - 1.0f ; if ( t 1 > t 2 ) { final float temp = t 1 ; t 1 = t 2 ; t 2 = temp ; s = 1.0f ; } if ( t 1 > tmin ) { normal . set zero ( ) ; normal . y = s ; tmin = t 1 ; } tmax = math utils . min ( tmax , t 2 ) ; if ( tmin > tmax ) { arg pool . push vec 2 ( 4 ) ; return false ; } } if ( tmin < 0.0f || input . max fraction < tmin ) { arg pool . push vec 2 ( 4 ) ; return false ; } output . fraction = tmin ; output . normal . x = normal . x ; output . normal . y = normal . y ; arg pool . push vec 2 ( 4 ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { float tmin = - float . max value ; float tmax = float . max value ; final vec 2 p = arg pool . pop vec 2 ( ) ; final vec 2 d = arg pool . pop vec 2 ( ) ; final vec 2 abs d = arg pool . pop vec 2 ( ) ; final vec 2 normal = arg pool . pop vec 2 ( ) ; p . set ( input . p 1 ) ; d . set ( input . p 2 ) . sub local ( input . p 1 ) ; vec 2 . abs to out ( d , abs d ) ; if ( abs d . x < settings . epsilon ) { if ( p . x < lower bound . x || upper bound . x < p . x ) { arg pool . push vec 2 ( 4 ) ; return false ; } } else { final float inv d = 1.0f / d . x ; float t 1 = ( lower bound . x - p . x ) * inv d ; float t 2 = ( upper bound . x - p . x ) * inv d ; float s = - 1.0f ; if ( t 1 > t 2 ) { final float temp = t 1 ; t 1 = t 2 ; t 2 = temp ; s = 1.0f ; } if ( t 1 > tmin ) { normal . set zero ( ) ; normal . x = s ; tmin = t 1 ; } tmax = math utils . min ( tmax , t 2 ) ; if ( tmin > tmax ) { arg pool . push vec 2 ( 4 ) ; return false ; } } if ( abs d . y < settings . epsilon ) { if ( p . y < lower bound . y || upper bound . y < p . y ) { arg pool . push vec 2 ( 4 ) ; return false ; } } else { final float inv d = 1.0f / d . y ; float t 1 = ( lower bound . y - p . y ) * inv d ; float t 2 = ( upper bound . y - p . y ) * inv d ; float s = - 1.0f ; if ( t 1 > t 2 ) { final float temp = t 1 ; t 1 = t 2 ; t 2 = temp ; s = 1.0f ; } if ( t 1 > tmin ) { normal . set zero ( ) ; normal . y = s ; tmin = t 1 ; } tmax = math utils . min ( tmax , t 2 ) ; if ( tmin > tmax ) { arg pool . push vec 2 ( 4 ) ; return false ; } } if ( tmin < 0.0f || input . max fraction < tmin ) { arg pool . push vec 2 ( 4 ) ; return false ; } output . fraction = tmin ; output . normal . x = normal . x ; output . normal . y = normal . y ; arg pool . push vec 2 ( 4 ) ; return true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float tmin = - float . max value ; float tmax = float . max value ; final vec 2 p = arg pool . pop vec 2 ( ) ; final vec 2 d = arg pool . pop vec 2 ( ) ; final vec 2 abs d = arg pool . pop vec 2 ( ) ; final vec 2 normal = arg pool . pop vec 2 ( ) ; p . set ( input . p 1 ) ; d . set ( input . p 2 ) . sub local ( input . p 1 ) ; vec 2 . abs to out ( d , abs d ) ; if ( abs d . x < settings . epsilon ) { if ( p . x < lower bound . x || upper bound . x < p . x ) { arg pool . push vec 2 ( 4 ) ; return false ; } } else { final float inv d = 1.0f / d . x ; float t 1 = ( lower bound . x - p . x ) * inv d ; float t 2 = ( upper bound . x - p . x ) * inv d ; float s = - 1.0f ; if ( t 1 > t 2 ) { final float temp = t 1 ; t 1 = t 2 ; t 2 = temp ; s = 1.0f ; } if ( t 1 > tmin ) { normal . set zero ( ) ; normal . x = s ; tmin = t 1 ; } tmax = math utils . min ( tmax , t 2 ) ; if ( tmin > tmax ) { arg pool . push vec 2 ( 4 ) ; return false ; } } if ( abs d . y < settings . epsilon ) { if ( p . y < lower bound . y || upper bound . y < p . y ) { arg pool . push vec 2 ( 4 ) ; return false ; } } else { final float inv d = 1.0f / d . y ; float t 1 = ( lower bound . y - p . y ) * inv d ; float t 2 = ( upper bound . y - p . y ) * inv d ; float s = - 1.0f ; if ( t 1 > t 2 ) { final float temp = t 1 ; t 1 = t 2 ; t 2 = temp ; s = 1.0f ; } if ( t 1 > tmin ) { normal . set zero ( ) ; normal . y = s ; tmin = t 1 ; } tmax = math utils . min ( tmax , t 2 ) ; if ( tmin > tmax ) { arg pool . push vec 2 ( 4 ) ; return false ; } } if ( tmin < 0.0f || input . max fraction < tmin ) { arg pool . push vec 2 ( 4 ) ; return false ; } output . fraction = tmin ; output . normal . x = normal . x ; output . normal . y = normal . y ; arg pool . push vec 2 ( 4 ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 8.6%)

<SENTENCE_START> { float tmin = - float . max value ; float tmax = float . max value ; final vec 2 p = arg pool . pop vec 2 ( ) ; final vec 2 d = arg pool . pop vec 2 ( ) ; final vec 2 abs d = arg pool . pop vec 2 ( ) ; final vec 2 normal = arg pool . pop vec 2 ( ) ; p . set ( input . p 1 ) ; d . set ( input . p 2 ) . sub local ( input . p 1 ) ; vec 2 . abs to out ( d , abs d ) ; if ( abs d . x < settings . epsilon ) { if ( p . x < lower bound . x || upper bound . x < p . x ) { arg pool . push vec 2 ( 4 ) ; return false ; } } else { final float inv d = 1.0f / d . x ; float t 1 = ( lower bound . x - p . x ) * inv d ; float t 2 = ( upper bound . x - p . x ) * inv d ; float s = - 1.0f ; if ( t 1 > t 2 ) { final float temp = t 1 ; t 1 = t 2 ; t 2 = temp ; s = 1.0f ; } if ( t 1 > tmin ) { normal . set zero ( ) ; normal . x = s ; tmin = t 1 ; } tmax = math utils . min ( tmax , t 2 ) ; if ( tmin > tmax ) { arg pool . push vec 2 ( 4 ) ; return false ; } } if ( abs d . y < settings . epsilon ) { if ( p . y < lower bound . y || upper bound . y < p . y ) { arg pool . push vec 2 ( 4 ) ; return false ; } } else { final float inv d = 1.0f / d . y ; float t 1 = ( lower bound . y - p . y ) * inv d ; float t 2 = ( upper bound . y - p . y ) * inv d ; float s = - 1.0f ; if ( t 1 > t 2 ) { final float temp = t 1 ; t 1 = t 2 ; t 2 = temp ; s = 1.0f ; } if ( t 1 > tmin ) { normal . set zero ( ) ; normal . y = s ; tmin = t 1 ; } tmax = math utils . min ( tmax , t 2 ) ; if ( tmin > tmax ) { arg pool . push vec 2 ( 4 ) ; return false ; } } if ( tmin < 0.0f || input . max fraction < tmin ) { arg pool . push vec 2 ( 4 ) ; return false ; } output . fraction = tmin ; output . normal . x = normal . x ; output . normal . y = normal . y ; arg pool . push vec 2 ( 4 ) ; return true ; } <SENTENCE_END/>

Original Name test,overlap

test

<SENTENCE_START> { if ( b . lower bound . x - a . upper bound . x > 0.0f || b . lower bound . y - a . upper bound . y > 0.0f ) { return false ; } if ( a . lower bound . x - b . upper bound . x > 0.0f || a . lower bound . y - b . upper bound . y > 0.0f ) { return false ; } return true ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { if ( b . lower bound . x - a . upper bound . x > 0.0f || b . lower bound . y - a . upper bound . y > 0.0f ) { return false ; } if ( a . lower bound . x - b . upper bound . x > 0.0f || a . lower bound . y - b . upper bound . y > 0.0f ) { return false ; } return true ; } <SENTENCE_END/>

overlap

<SENTENCE_START> { if ( b . lower bound . x - a . upper bound . x > 0.0f || b . lower bound . y - a . upper bound . y > 0.0f ) { return false ; } if ( a . lower bound . x - b . upper bound . x > 0.0f || a . lower bound . y - b . upper bound . y > 0.0f ) { return false ; } return true ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { if ( b . lower bound . x - a . upper bound . x > 0.0f || b . lower bound . y - a . upper bound . y > 0.0f ) { return false ; } if ( a . lower bound . x - b . upper bound . x > 0.0f || a . lower bound . y - b . upper bound . y > 0.0f ) { return false ; } return true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( b . lower bound . x - a . upper bound . x > 0.0f || b . lower bound . y - a . upper bound . y > 0.0f ) { return false ; } if ( a . lower bound . x - b . upper bound . x > 0.0f || a . lower bound . y - b . upper bound . y > 0.0f ) { return false ; } return true ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { if ( b . lower bound . x - a . upper bound . x > 0.0f || b . lower bound . y - a . upper bound . y > 0.0f ) { return false ; } if ( a . lower bound . x - b . upper bound . x > 0.0f || a . lower bound . y - b . upper bound . y > 0.0f ) { return false ; } return true ; } <SENTENCE_END/>

Original Name get,c,ptr

get

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

c

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

ptr

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

Original Name get,c,ptr

get

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

c

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

ptr

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

Original Name obtain

obtain

<SENTENCE_START> { ref count ++ ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { ref count ++ ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { ref count ++ ; } <SENTENCE_END/>

(Copy Probability: 69.0%)

<SENTENCE_START> { ref count ++ ; } <SENTENCE_END/>

Original Name release

release

<SENTENCE_START> { if ( -- ref count <= 0 && bullet . use ref counting ) dispose ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { if ( -- ref count <= 0 && bullet . use ref counting ) dispose ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( -- ref count <= 0 && bullet . use ref counting ) dispose ( ) ; } <SENTENCE_END/>

(Copy Probability: 18.1%)

<SENTENCE_START> { if ( -- ref count <= 0 && bullet . use ref counting ) dispose ( ) ; } <SENTENCE_END/>

Original Name is,obtained

is

<SENTENCE_START> { return ref count > 0 ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return ref count > 0 ; } <SENTENCE_END/>

obtained

<SENTENCE_START> { return ref count > 0 ; } <SENTENCE_END/>

(Copy Probability: 63.9%)

<SENTENCE_START> { return ref count > 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ref count > 0 ; } <SENTENCE_END/>

(Copy Probability: 60.1%)

<SENTENCE_START> { return ref count > 0 ; } <SENTENCE_END/>

Original Name construct

construct

<SENTENCE_START> { destroyed = false ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { destroyed = false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { destroyed = false ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { destroyed = false ; } <SENTENCE_END/>

Original Name reset

reset

<SENTENCE_START> { if ( ! destroyed ) destroy ( ) ; swig c mem own = c memory own ; c pointer = c ptr ; construct ( ) ; } <SENTENCE_END/>

(Copy Probability: 6.4%)

<SENTENCE_START> { if ( ! destroyed ) destroy ( ) ; swig c mem own = c memory own ; c pointer = c ptr ; construct ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! destroyed ) destroy ( ) ; swig c mem own = c memory own ; c pointer = c ptr ; construct ( ) ; } <SENTENCE_END/>

(Copy Probability: 17.1%)

<SENTENCE_START> { if ( ! destroyed ) destroy ( ) ; swig c mem own = c memory own ; c pointer = c ptr ; construct ( ) ; } <SENTENCE_END/>

Original Name get,c,pointer

get

<SENTENCE_START> { return c pointer ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return c pointer ; } <SENTENCE_END/>

c

<SENTENCE_START> { return c pointer ; } <SENTENCE_END/>

(Copy Probability: 93.7%)

<SENTENCE_START> { return c pointer ; } <SENTENCE_END/>

pointer

<SENTENCE_START> { return c pointer ; } <SENTENCE_END/>

(Copy Probability: 91.4%)

<SENTENCE_START> { return c pointer ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return c pointer ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { return c pointer ; } <SENTENCE_END/>

Original Name take,ownership

take

<SENTENCE_START> { swig c mem own = true ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { swig c mem own = true ; } <SENTENCE_END/>

ownership

<SENTENCE_START> { swig c mem own = true ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { swig c mem own = true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { swig c mem own = true ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { swig c mem own = true ; } <SENTENCE_END/>

Original Name release,ownership

release

<SENTENCE_START> { swig c mem own = false ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { swig c mem own = false ; } <SENTENCE_END/>

ownership

<SENTENCE_START> { swig c mem own = false ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { swig c mem own = false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { swig c mem own = false ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { swig c mem own = false ; } <SENTENCE_END/>

Original Name has,ownership

has

<SENTENCE_START> { return swig c mem own ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return swig c mem own ; } <SENTENCE_END/>

ownership

<SENTENCE_START> { return swig c mem own ; } <SENTENCE_END/>

(Copy Probability: 13.2%)

<SENTENCE_START> { return swig c mem own ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return swig c mem own ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return swig c mem own ; } <SENTENCE_END/>

Original Name delete

delete

<SENTENCE_START> { c pointer = 0 ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { c pointer = 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { c pointer = 0 ; } <SENTENCE_END/>

(Copy Probability: 6.8%)

<SENTENCE_START> { c pointer = 0 ; } <SENTENCE_END/>

Original Name is,disposed

is

<SENTENCE_START> { return disposed ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return disposed ; } <SENTENCE_END/>

disposed

<SENTENCE_START> { return disposed ; } <SENTENCE_END/>

(Copy Probability: 21.6%)

<SENTENCE_START> { return disposed ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return disposed ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return disposed ; } <SENTENCE_END/>

Original Name destroy

destroy

<SENTENCE_START> { try { if ( destroyed && bullet . enable logging ) gdx . app . error ( "Bullet" , "Already destroyed " + to string ( ) ) ; destroyed = true ; if ( swig c mem own && ! disposed ) { if ( bullet . enable logging ) gdx . app . error ( "Bullet" , "Disposing " + to string ( ) + " due to garbage collection." ) ; dispose ( ) ; } } catch ( throwable e ) { gdx . app . error ( "Bullet" , "Exception while destroying " + to string ( ) , e ) ; } } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { try { if ( destroyed && bullet . enable logging ) gdx . app . error ( "Bullet" , "Already destroyed " + to string ( ) ) ; destroyed = true ; if ( swig c mem own && ! disposed ) { if ( bullet . enable logging ) gdx . app . error ( "Bullet" , "Disposing " + to string ( ) + " due to garbage collection." ) ; dispose ( ) ; } } catch ( throwable e ) { gdx . app . error ( "Bullet" , "Exception while destroying " + to string ( ) , e ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { if ( destroyed && bullet . enable logging ) gdx . app . error ( "Bullet" , "Already destroyed " + to string ( ) ) ; destroyed = true ; if ( swig c mem own && ! disposed ) { if ( bullet . enable logging ) gdx . app . error ( "Bullet" , "Disposing " + to string ( ) + " due to garbage collection." ) ; dispose ( ) ; } } catch ( throwable e ) { gdx . app . error ( "Bullet" , "Exception while destroying " + to string ( ) , e ) ; } } <SENTENCE_END/>

(Copy Probability: 6.6%)

<SENTENCE_START> { try { if ( destroyed && bullet . enable logging ) gdx . app . error ( "Bullet" , "Already destroyed " + to string ( ) ) ; destroyed = true ; if ( swig c mem own && ! disposed ) { if ( bullet . enable logging ) gdx . app . error ( "Bullet" , "Disposing " + to string ( ) + " due to garbage collection." ) ; dispose ( ) ; } } catch ( throwable e ) { gdx . app . error ( "Bullet" , "Exception while destroying " + to string ( ) , e ) ; } } <SENTENCE_END/>

Original Name get,c,ptr

get

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

c

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

ptr

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

Original Name set

set

<SENTENCE_START> { this . r = color . r ; this . g = color . g ; this . b = color . b ; this . a = color . a ; return this ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { this . r = color . r ; this . g = color . g ; this . b = color . b ; this . a = color . a ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r = color . r ; this . g = color . g ; this . b = color . b ; this . a = color . a ; return this ; } <SENTENCE_END/>

(Copy Probability: 10.8%)

<SENTENCE_START> { this . r = color . r ; this . g = color . g ; this . b = color . b ; this . a = color . a ; return this ; } <SENTENCE_END/>

Original Name mul

mul

<SENTENCE_START> { this . r *= color . r ; this . g *= color . g ; this . b *= color . b ; this . a *= color . a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { this . r *= color . r ; this . g *= color . g ; this . b *= color . b ; this . a *= color . a ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r *= color . r ; this . g *= color . g ; this . b *= color . b ; this . a *= color . a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { this . r *= color . r ; this . g *= color . g ; this . b *= color . b ; this . a *= color . a ; return clamp ( ) ; } <SENTENCE_END/>

Original Name mul

mul

<SENTENCE_START> { this . r *= value ; this . g *= value ; this . b *= value ; this . a *= value ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { this . r *= value ; this . g *= value ; this . b *= value ; this . a *= value ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r *= value ; this . g *= value ; this . b *= value ; this . a *= value ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { this . r *= value ; this . g *= value ; this . b *= value ; this . a *= value ; return clamp ( ) ; } <SENTENCE_END/>

Original Name add

add

<SENTENCE_START> { this . r += color . r ; this . g += color . g ; this . b += color . b ; this . a += color . a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { this . r += color . r ; this . g += color . g ; this . b += color . b ; this . a += color . a ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r += color . r ; this . g += color . g ; this . b += color . b ; this . a += color . a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { this . r += color . r ; this . g += color . g ; this . b += color . b ; this . a += color . a ; return clamp ( ) ; } <SENTENCE_END/>

Original Name sub

sub

<SENTENCE_START> { this . r -= color . r ; this . g -= color . g ; this . b -= color . b ; this . a -= color . a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { this . r -= color . r ; this . g -= color . g ; this . b -= color . b ; this . a -= color . a ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r -= color . r ; this . g -= color . g ; this . b -= color . b ; this . a -= color . a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { this . r -= color . r ; this . g -= color . g ; this . b -= color . b ; this . a -= color . a ; return clamp ( ) ; } <SENTENCE_END/>

Original Name clamp

clamp

<SENTENCE_START> { if ( r < 0 ) r = 0 ; else if ( r > 1 ) r = 1 ; if ( g < 0 ) g = 0 ; else if ( g > 1 ) g = 1 ; if ( b < 0 ) b = 0 ; else if ( b > 1 ) b = 1 ; if ( a < 0 ) a = 0 ; else if ( a > 1 ) a = 1 ; return this ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { if ( r < 0 ) r = 0 ; else if ( r > 1 ) r = 1 ; if ( g < 0 ) g = 0 ; else if ( g > 1 ) g = 1 ; if ( b < 0 ) b = 0 ; else if ( b > 1 ) b = 1 ; if ( a < 0 ) a = 0 ; else if ( a > 1 ) a = 1 ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( r < 0 ) r = 0 ; else if ( r > 1 ) r = 1 ; if ( g < 0 ) g = 0 ; else if ( g > 1 ) g = 1 ; if ( b < 0 ) b = 0 ; else if ( b > 1 ) b = 1 ; if ( a < 0 ) a = 0 ; else if ( a > 1 ) a = 1 ; return this ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( r < 0 ) r = 0 ; else if ( r > 1 ) r = 1 ; if ( g < 0 ) g = 0 ; else if ( g > 1 ) g = 1 ; if ( b < 0 ) b = 0 ; else if ( b > 1 ) b = 1 ; if ( a < 0 ) a = 0 ; else if ( a > 1 ) a = 1 ; return this ; } <SENTENCE_END/>

Original Name set

set

<SENTENCE_START> { this . r = r ; this . g = g ; this . b = b ; this . a = a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { this . r = r ; this . g = g ; this . b = b ; this . a = a ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r = r ; this . g = g ; this . b = b ; this . a = a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { this . r = r ; this . g = g ; this . b = b ; this . a = a ; return clamp ( ) ; } <SENTENCE_END/>

Original Name set

set

<SENTENCE_START> { rgba 8888 to color ( this , rgba ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { rgba 8888 to color ( this , rgba ) ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { rgba 8888 to color ( this , rgba ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 25.3%)

<SENTENCE_START> { rgba 8888 to color ( this , rgba ) ; return this ; } <SENTENCE_END/>

Original Name add

add

<SENTENCE_START> { this . r += r ; this . g += g ; this . b += b ; this . a += a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { this . r += r ; this . g += g ; this . b += b ; this . a += a ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r += r ; this . g += g ; this . b += b ; this . a += a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { this . r += r ; this . g += g ; this . b += b ; this . a += a ; return clamp ( ) ; } <SENTENCE_END/>

Original Name sub

sub

<SENTENCE_START> { this . r -= r ; this . g -= g ; this . b -= b ; this . a -= a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { this . r -= r ; this . g -= g ; this . b -= b ; this . a -= a ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r -= r ; this . g -= g ; this . b -= b ; this . a -= a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { this . r -= r ; this . g -= g ; this . b -= b ; this . a -= a ; return clamp ( ) ; } <SENTENCE_END/>

Original Name mul

mul

<SENTENCE_START> { this . r *= r ; this . g *= g ; this . b *= b ; this . a *= a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { this . r *= r ; this . g *= g ; this . b *= b ; this . a *= a ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r *= r ; this . g *= g ; this . b *= b ; this . a *= a ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { this . r *= r ; this . g *= g ; this . b *= b ; this . a *= a ; return clamp ( ) ; } <SENTENCE_END/>

Original Name lerp

lerp

<SENTENCE_START> { this . r += t * ( target . r - this . r ) ; this . g += t * ( target . g - this . g ) ; this . b += t * ( target . b - this . b ) ; this . a += t * ( target . a - this . a ) ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { this . r += t * ( target . r - this . r ) ; this . g += t * ( target . g - this . g ) ; this . b += t * ( target . b - this . b ) ; this . a += t * ( target . a - this . a ) ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r += t * ( target . r - this . r ) ; this . g += t * ( target . g - this . g ) ; this . b += t * ( target . b - this . b ) ; this . a += t * ( target . a - this . a ) ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 5.8%)

<SENTENCE_START> { this . r += t * ( target . r - this . r ) ; this . g += t * ( target . g - this . g ) ; this . b += t * ( target . b - this . b ) ; this . a += t * ( target . a - this . a ) ; return clamp ( ) ; } <SENTENCE_END/>

Original Name lerp

lerp

<SENTENCE_START> { this . r += t * ( r - this . r ) ; this . g += t * ( g - this . g ) ; this . b += t * ( b - this . b ) ; this . a += t * ( a - this . a ) ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { this . r += t * ( r - this . r ) ; this . g += t * ( g - this . g ) ; this . b += t * ( b - this . b ) ; this . a += t * ( a - this . a ) ; return clamp ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . r += t * ( r - this . r ) ; this . g += t * ( g - this . g ) ; this . b += t * ( b - this . b ) ; this . a += t * ( a - this . a ) ; return clamp ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { this . r += t * ( r - this . r ) ; this . g += t * ( g - this . g ) ; this . b += t * ( b - this . b ) ; this . a += t * ( a - this . a ) ; return clamp ( ) ; } <SENTENCE_END/>

Original Name premultiply,alpha

premultiply

<SENTENCE_START> { r *= a ; g *= a ; b *= a ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { r *= a ; g *= a ; b *= a ; return this ; } <SENTENCE_END/>

alpha

<SENTENCE_START> { r *= a ; g *= a ; b *= a ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { r *= a ; g *= a ; b *= a ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { r *= a ; g *= a ; b *= a ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { r *= a ; g *= a ; b *= a ; return this ; } <SENTENCE_END/>

Original Name to,float,bits

to

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

float

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

(Copy Probability: 52.9%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

bits

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

Original Name to,int,bits

to

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return color ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return color ; } <SENTENCE_END/>

int

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return color ; } <SENTENCE_END/>

(Copy Probability: 73.3%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return color ; } <SENTENCE_END/>

bits

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return color ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return color ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return color ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return color ; } <SENTENCE_END/>

Original Name value,of

value

<SENTENCE_START> { hex = hex . char at ( 0 ) == '#' ? hex . substring ( 1 ) : hex ; int r = integer . %SELF% ( hex . substring ( 0 , 2 ) , 16 ) ; int g = integer . %SELF% ( hex . substring ( 2 , 4 ) , 16 ) ; int b = integer . %SELF% ( hex . substring ( 4 , 6 ) , 16 ) ; int a = hex . length ( ) != 8 ? 255 : integer . %SELF% ( hex . substring ( 6 , 8 ) , 16 ) ; return new color ( r / 255f , g / 255f , b / 255f , a / 255f ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { hex = hex . char at ( 0 ) == '#' ? hex . substring ( 1 ) : hex ; int r = integer . %SELF% ( hex . substring ( 0 , 2 ) , 16 ) ; int g = integer . %SELF% ( hex . substring ( 2 , 4 ) , 16 ) ; int b = integer . %SELF% ( hex . substring ( 4 , 6 ) , 16 ) ; int a = hex . length ( ) != 8 ? 255 : integer . %SELF% ( hex . substring ( 6 , 8 ) , 16 ) ; return new color ( r / 255f , g / 255f , b / 255f , a / 255f ) ; } <SENTENCE_END/>

of

<SENTENCE_START> { hex = hex . char at ( 0 ) == '#' ? hex . substring ( 1 ) : hex ; int r = integer . %SELF% ( hex . substring ( 0 , 2 ) , 16 ) ; int g = integer . %SELF% ( hex . substring ( 2 , 4 ) , 16 ) ; int b = integer . %SELF% ( hex . substring ( 4 , 6 ) , 16 ) ; int a = hex . length ( ) != 8 ? 255 : integer . %SELF% ( hex . substring ( 6 , 8 ) , 16 ) ; return new color ( r / 255f , g / 255f , b / 255f , a / 255f ) ; } <SENTENCE_END/>

(Copy Probability: 7.8%)

<SENTENCE_START> { hex = hex . char at ( 0 ) == '#' ? hex . substring ( 1 ) : hex ; int r = integer . %SELF% ( hex . substring ( 0 , 2 ) , 16 ) ; int g = integer . %SELF% ( hex . substring ( 2 , 4 ) , 16 ) ; int b = integer . %SELF% ( hex . substring ( 4 , 6 ) , 16 ) ; int a = hex . length ( ) != 8 ? 255 : integer . %SELF% ( hex . substring ( 6 , 8 ) , 16 ) ; return new color ( r / 255f , g / 255f , b / 255f , a / 255f ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { hex = hex . char at ( 0 ) == '#' ? hex . substring ( 1 ) : hex ; int r = integer . %SELF% ( hex . substring ( 0 , 2 ) , 16 ) ; int g = integer . %SELF% ( hex . substring ( 2 , 4 ) , 16 ) ; int b = integer . %SELF% ( hex . substring ( 4 , 6 ) , 16 ) ; int a = hex . length ( ) != 8 ? 255 : integer . %SELF% ( hex . substring ( 6 , 8 ) , 16 ) ; return new color ( r / 255f , g / 255f , b / 255f , a / 255f ) ; } <SENTENCE_END/>

(Copy Probability: 7.7%)

<SENTENCE_START> { hex = hex . char at ( 0 ) == '#' ? hex . substring ( 1 ) : hex ; int r = integer . %SELF% ( hex . substring ( 0 , 2 ) , 16 ) ; int g = integer . %SELF% ( hex . substring ( 2 , 4 ) , 16 ) ; int b = integer . %SELF% ( hex . substring ( 4 , 6 ) , 16 ) ; int a = hex . length ( ) != 8 ? 255 : integer . %SELF% ( hex . substring ( 6 , 8 ) , 16 ) ; return new color ( r / 255f , g / 255f , b / 255f , a / 255f ) ; } <SENTENCE_END/>

Original Name to,float,bits

to

<SENTENCE_START> { int color = ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; float float color = number utils . int to float color ( color ) ; return float color ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { int color = ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; float float color = number utils . int to float color ( color ) ; return float color ; } <SENTENCE_END/>

float

<SENTENCE_START> { int color = ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; float float color = number utils . int to float color ( color ) ; return float color ; } <SENTENCE_END/>

(Copy Probability: 82.5%)

<SENTENCE_START> { int color = ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; float float color = number utils . int to float color ( color ) ; return float color ; } <SENTENCE_END/>

bits

<SENTENCE_START> { int color = ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; float float color = number utils . int to float color ( color ) ; return float color ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { int color = ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; float float color = number utils . int to float color ( color ) ; return float color ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int color = ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; float float color = number utils . int to float color ( color ) ; return float color ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { int color = ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; float float color = number utils . int to float color ( color ) ; return float color ; } <SENTENCE_END/>

Original Name to,float,bits

to

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

float

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

(Copy Probability: 52.9%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

bits

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { int color = ( ( int ) ( 255 * a ) << 24 ) | ( ( int ) ( 255 * b ) << 16 ) | ( ( int ) ( 255 * g ) << 8 ) | ( ( int ) ( 255 * r ) ) ; return number utils . int to float color ( color ) ; } <SENTENCE_END/>

Original Name to,int,bits

to

<SENTENCE_START> { return ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; } <SENTENCE_END/>

int

<SENTENCE_START> { return ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { return ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; } <SENTENCE_END/>

bits

<SENTENCE_START> { return ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return ( a << 24 ) | ( b << 16 ) | ( g << 8 ) | r ; } <SENTENCE_END/>

Original Name alpha

alpha

<SENTENCE_START> { return ( int ) ( %SELF% * 255.0f ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return ( int ) ( %SELF% * 255.0f ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( int ) ( %SELF% * 255.0f ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { return ( int ) ( %SELF% * 255.0f ) ; } <SENTENCE_END/>

Original Name luminance,alpha

luminance

<SENTENCE_START> { return ( ( int ) ( luminance * 255.0f ) << 8 ) | ( int ) ( alpha * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return ( ( int ) ( luminance * 255.0f ) << 8 ) | ( int ) ( alpha * 255 ) ; } <SENTENCE_END/>

alpha

<SENTENCE_START> { return ( ( int ) ( luminance * 255.0f ) << 8 ) | ( int ) ( alpha * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { return ( ( int ) ( luminance * 255.0f ) << 8 ) | ( int ) ( alpha * 255 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( luminance * 255.0f ) << 8 ) | ( int ) ( alpha * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { return ( ( int ) ( luminance * 255.0f ) << 8 ) | ( int ) ( alpha * 255 ) ; } <SENTENCE_END/>

Original Name rgb,565

rgb

<SENTENCE_START> { return ( ( int ) ( r * 31 ) << 11 ) | ( ( int ) ( g * 63 ) << 5 ) | ( int ) ( b * 31 ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return ( ( int ) ( r * 31 ) << 11 ) | ( ( int ) ( g * 63 ) << 5 ) | ( int ) ( b * 31 ) ; } <SENTENCE_END/>

565

<SENTENCE_START> { return ( ( int ) ( r * 31 ) << 11 ) | ( ( int ) ( g * 63 ) << 5 ) | ( int ) ( b * 31 ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { return ( ( int ) ( r * 31 ) << 11 ) | ( ( int ) ( g * 63 ) << 5 ) | ( int ) ( b * 31 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( r * 31 ) << 11 ) | ( ( int ) ( g * 63 ) << 5 ) | ( int ) ( b * 31 ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { return ( ( int ) ( r * 31 ) << 11 ) | ( ( int ) ( g * 63 ) << 5 ) | ( int ) ( b * 31 ) ; } <SENTENCE_END/>

Original Name rgba,4444

rgba

<SENTENCE_START> { return ( ( int ) ( r * 15 ) << 12 ) | ( ( int ) ( g * 15 ) << 8 ) | ( ( int ) ( b * 15 ) << 4 ) | ( int ) ( a * 15 ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return ( ( int ) ( r * 15 ) << 12 ) | ( ( int ) ( g * 15 ) << 8 ) | ( ( int ) ( b * 15 ) << 4 ) | ( int ) ( a * 15 ) ; } <SENTENCE_END/>

4444

<SENTENCE_START> { return ( ( int ) ( r * 15 ) << 12 ) | ( ( int ) ( g * 15 ) << 8 ) | ( ( int ) ( b * 15 ) << 4 ) | ( int ) ( a * 15 ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { return ( ( int ) ( r * 15 ) << 12 ) | ( ( int ) ( g * 15 ) << 8 ) | ( ( int ) ( b * 15 ) << 4 ) | ( int ) ( a * 15 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( r * 15 ) << 12 ) | ( ( int ) ( g * 15 ) << 8 ) | ( ( int ) ( b * 15 ) << 4 ) | ( int ) ( a * 15 ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return ( ( int ) ( r * 15 ) << 12 ) | ( ( int ) ( g * 15 ) << 8 ) | ( ( int ) ( b * 15 ) << 4 ) | ( int ) ( a * 15 ) ; } <SENTENCE_END/>

Original Name rgb,888

rgb

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

888

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 7.7%)

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

Original Name rgba,8888

rgba

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 24 ) | ( ( int ) ( g * 255 ) << 16 ) | ( ( int ) ( b * 255 ) << 8 ) | ( int ) ( a * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 24 ) | ( ( int ) ( g * 255 ) << 16 ) | ( ( int ) ( b * 255 ) << 8 ) | ( int ) ( a * 255 ) ; } <SENTENCE_END/>

8888

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 24 ) | ( ( int ) ( g * 255 ) << 16 ) | ( ( int ) ( b * 255 ) << 8 ) | ( int ) ( a * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 18.3%)

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 24 ) | ( ( int ) ( g * 255 ) << 16 ) | ( ( int ) ( b * 255 ) << 8 ) | ( int ) ( a * 255 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 24 ) | ( ( int ) ( g * 255 ) << 16 ) | ( ( int ) ( b * 255 ) << 8 ) | ( int ) ( a * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { return ( ( int ) ( r * 255 ) << 24 ) | ( ( int ) ( g * 255 ) << 16 ) | ( ( int ) ( b * 255 ) << 8 ) | ( int ) ( a * 255 ) ; } <SENTENCE_END/>

Original Name argb,8888

argb

<SENTENCE_START> { return ( ( int ) ( a * 255 ) << 24 ) | ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return ( ( int ) ( a * 255 ) << 24 ) | ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

8888

<SENTENCE_START> { return ( ( int ) ( a * 255 ) << 24 ) | ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 14.1%)

<SENTENCE_START> { return ( ( int ) ( a * 255 ) << 24 ) | ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( a * 255 ) << 24 ) | ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return ( ( int ) ( a * 255 ) << 24 ) | ( ( int ) ( r * 255 ) << 16 ) | ( ( int ) ( g * 255 ) << 8 ) | ( int ) ( b * 255 ) ; } <SENTENCE_END/>

Original Name rgb,565

rgb

<SENTENCE_START> { return ( ( int ) ( color . r * 31 ) << 11 ) | ( ( int ) ( color . g * 63 ) << 5 ) | ( int ) ( color . b * 31 ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { return ( ( int ) ( color . r * 31 ) << 11 ) | ( ( int ) ( color . g * 63 ) << 5 ) | ( int ) ( color . b * 31 ) ; } <SENTENCE_END/>

565

<SENTENCE_START> { return ( ( int ) ( color . r * 31 ) << 11 ) | ( ( int ) ( color . g * 63 ) << 5 ) | ( int ) ( color . b * 31 ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { return ( ( int ) ( color . r * 31 ) << 11 ) | ( ( int ) ( color . g * 63 ) << 5 ) | ( int ) ( color . b * 31 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( color . r * 31 ) << 11 ) | ( ( int ) ( color . g * 63 ) << 5 ) | ( int ) ( color . b * 31 ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return ( ( int ) ( color . r * 31 ) << 11 ) | ( ( int ) ( color . g * 63 ) << 5 ) | ( int ) ( color . b * 31 ) ; } <SENTENCE_END/>

Original Name rgba,4444

rgba

<SENTENCE_START> { return ( ( int ) ( color . r * 15 ) << 12 ) | ( ( int ) ( color . g * 15 ) << 8 ) | ( ( int ) ( color . b * 15 ) << 4 ) | ( int ) ( color . a * 15 ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { return ( ( int ) ( color . r * 15 ) << 12 ) | ( ( int ) ( color . g * 15 ) << 8 ) | ( ( int ) ( color . b * 15 ) << 4 ) | ( int ) ( color . a * 15 ) ; } <SENTENCE_END/>

4444

<SENTENCE_START> { return ( ( int ) ( color . r * 15 ) << 12 ) | ( ( int ) ( color . g * 15 ) << 8 ) | ( ( int ) ( color . b * 15 ) << 4 ) | ( int ) ( color . a * 15 ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { return ( ( int ) ( color . r * 15 ) << 12 ) | ( ( int ) ( color . g * 15 ) << 8 ) | ( ( int ) ( color . b * 15 ) << 4 ) | ( int ) ( color . a * 15 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( color . r * 15 ) << 12 ) | ( ( int ) ( color . g * 15 ) << 8 ) | ( ( int ) ( color . b * 15 ) << 4 ) | ( int ) ( color . a * 15 ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { return ( ( int ) ( color . r * 15 ) << 12 ) | ( ( int ) ( color . g * 15 ) << 8 ) | ( ( int ) ( color . b * 15 ) << 4 ) | ( int ) ( color . a * 15 ) ; } <SENTENCE_END/>

Original Name rgb,888

rgb

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

888

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

Original Name rgba,8888

rgba

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 24 ) | ( ( int ) ( color . g * 255 ) << 16 ) | ( ( int ) ( color . b * 255 ) << 8 ) | ( int ) ( color . a * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 24 ) | ( ( int ) ( color . g * 255 ) << 16 ) | ( ( int ) ( color . b * 255 ) << 8 ) | ( int ) ( color . a * 255 ) ; } <SENTENCE_END/>

8888

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 24 ) | ( ( int ) ( color . g * 255 ) << 16 ) | ( ( int ) ( color . b * 255 ) << 8 ) | ( int ) ( color . a * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 24 ) | ( ( int ) ( color . g * 255 ) << 16 ) | ( ( int ) ( color . b * 255 ) << 8 ) | ( int ) ( color . a * 255 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 24 ) | ( ( int ) ( color . g * 255 ) << 16 ) | ( ( int ) ( color . b * 255 ) << 8 ) | ( int ) ( color . a * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { return ( ( int ) ( color . r * 255 ) << 24 ) | ( ( int ) ( color . g * 255 ) << 16 ) | ( ( int ) ( color . b * 255 ) << 8 ) | ( int ) ( color . a * 255 ) ; } <SENTENCE_END/>

Original Name argb,8888

argb

<SENTENCE_START> { return ( ( int ) ( color . a * 255 ) << 24 ) | ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { return ( ( int ) ( color . a * 255 ) << 24 ) | ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

8888

<SENTENCE_START> { return ( ( int ) ( color . a * 255 ) << 24 ) | ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 6.4%)

<SENTENCE_START> { return ( ( int ) ( color . a * 255 ) << 24 ) | ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( ( int ) ( color . a * 255 ) << 24 ) | ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return ( ( int ) ( color . a * 255 ) << 24 ) | ( ( int ) ( color . r * 255 ) << 16 ) | ( ( int ) ( color . g * 255 ) << 8 ) | ( int ) ( color . b * 255 ) ; } <SENTENCE_END/>

Original Name rgb,565,to,color

rgb

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

565

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

to

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

color

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { color . r = ( ( value & 0x0000F800 ) >>> 11 ) / 31f ; color . g = ( ( value & 0x000007E0 ) >>> 5 ) / 63f ; color . b = ( ( value & 0x0000001F ) >>> 0 ) / 31f ; } <SENTENCE_END/>

Original Name rgba,4444,to,color

rgba

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

4444

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

to

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

color

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { color . r = ( ( value & 0x0000f000 ) >>> 12 ) / 15f ; color . g = ( ( value & 0x00000f00 ) >>> 8 ) / 15f ; color . b = ( ( value & 0x000000f0 ) >>> 4 ) / 15f ; color . a = ( ( value & 0x0000000f ) ) / 15f ; } <SENTENCE_END/>

Original Name rgb,888,to,color

rgb

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

888

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 9.4%)

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

to

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

color

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

Original Name rgba,8888,to,color

rgba

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

8888

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 8.6%)

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

to

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

color

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { color . r = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . g = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . b = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . a = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

Original Name argb,8888,to,color

argb

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

8888

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 8.2%)

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

to

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

color

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { color . a = ( ( value & 0xff000000 ) >>> 24 ) / 255f ; color . r = ( ( value & 0x00ff0000 ) >>> 16 ) / 255f ; color . g = ( ( value & 0x0000ff00 ) >>> 8 ) / 255f ; color . b = ( ( value & 0x000000ff ) ) / 255f ; } <SENTENCE_END/>

Original Name cpy

cpy

<SENTENCE_START> { return new color ( this ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return new color ( this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new color ( this ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return new color ( this ) ; } <SENTENCE_END/>

Original Name get,c,ptr

get

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

c

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

ptr

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

Original Name get,c,ptr

get

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

c

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

ptr

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return ( obj == null ) ? 0 : obj . swig c ptr ; } <SENTENCE_END/>

Original Name set,margin

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager margin set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager margin set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

margin

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager margin set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager margin set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager margin set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager margin set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,margin

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager margin get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager margin get ( swig c ptr , this ) ; } <SENTENCE_END/>

margin

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager margin get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager margin get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager margin get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager margin get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,mesh,interface

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface set ( swig c ptr , this , bt striding mesh interface . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.4%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface set ( swig c ptr , this , bt striding mesh interface . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

mesh

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface set ( swig c ptr , this , bt striding mesh interface . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface set ( swig c ptr , this , bt striding mesh interface . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

interface

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface set ( swig c ptr , this , bt striding mesh interface . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface set ( swig c ptr , this , bt striding mesh interface . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface set ( swig c ptr , this , bt striding mesh interface . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 79.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface set ( swig c ptr , this , bt striding mesh interface . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

Original Name get,mesh,interface

get

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt striding mesh interface ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt striding mesh interface ( c ptr , false ) ; } <SENTENCE_END/>

mesh

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt striding mesh interface ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt striding mesh interface ( c ptr , false ) ; } <SENTENCE_END/>

interface

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt striding mesh interface ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt striding mesh interface ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt striding mesh interface ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 75.7%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager mesh interface get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt striding mesh interface ( c ptr , false ) ; } <SENTENCE_END/>

Original Name set,scale

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager scale set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager scale set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

scale

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager scale set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager scale set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager scale set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager scale set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

Original Name get,scale

get

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager scale get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager scale get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

scale

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager scale get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager scale get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager scale get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact mesh shape part trimesh primitive manager scale get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

Original Name set,part

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.1%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

part

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,part

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager part get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager part get ( swig c ptr , this ) ; } <SENTENCE_END/>

part

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager part get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager part get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager part get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager part get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,lock,count

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager lock count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.4%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager lock count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

lock

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager lock count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager lock count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

count

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager lock count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager lock count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager lock count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager lock count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,lock,count

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager lock count get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager lock count get ( swig c ptr , this ) ; } <SENTENCE_END/>

lock

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager lock count get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager lock count get ( swig c ptr , this ) ; } <SENTENCE_END/>

count

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager lock count get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager lock count get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager lock count get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager lock count get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,vertexbase

set

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

vertexbase

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

Original Name get,vertexbase

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

vertexbase

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager vertexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,numverts

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager numverts set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.1%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager numverts set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

numverts

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager numverts set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager numverts set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager numverts set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager numverts set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,numverts

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager numverts get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager numverts get ( swig c ptr , this ) ; } <SENTENCE_END/>

numverts

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager numverts get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager numverts get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager numverts get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager numverts get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,type

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager type set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager type set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

type

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager type set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager type set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager type set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager type set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,type

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager type get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager type get ( swig c ptr , this ) ; } <SENTENCE_END/>

type

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager type get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager type get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager type get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager type get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,stride

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager stride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager stride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

stride

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager stride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager stride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager stride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager stride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,stride

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager stride get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager stride get ( swig c ptr , this ) ; } <SENTENCE_END/>

stride

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager stride get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager stride get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager stride get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager stride get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,indexbase

set

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager indexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager indexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

indexbase

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager indexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager indexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager indexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { assert value . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt g impact mesh shape part trimesh primitive manager indexbase set ( swig c ptr , this , value ) ; } } <SENTENCE_END/>

Original Name get,indexbase

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

indexbase

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexbase get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,indexstride

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager indexstride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager indexstride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

indexstride

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager indexstride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager indexstride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager indexstride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager indexstride set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,indexstride

get

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexstride get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexstride get ( swig c ptr , this ) ; } <SENTENCE_END/>

indexstride

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexstride get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexstride get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexstride get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt g impact mesh shape part trimesh primitive manager indexstride get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,numfaces

set

<SENTENCE_START> { collision jni . bt g impact mesh shape part trimesh primitive manager numfaces set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START>