Copy+Attentional Convolutional


Original Name consistency,test

consistency

<SENTENCE_START> { verify = false ; dummy test = player . get ( 0 ) ; dummy last found = null ; all random ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { dummy found = test . get kth nearest enemy ( k ) ; if ( last found == null ) { last found = found ; } else { if ( ! ( last found . equals ( found ) ) ) { print ( "CONSISTENCY TEST FAILED" ) ; print ( "lastFound: " + last found ) ; print ( "justFound: " + found ) ; throw new gdx runtime exception ( "test failed" ) ; } } } } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { verify = false ; dummy test = player . get ( 0 ) ; dummy last found = null ; all random ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { dummy found = test . get kth nearest enemy ( k ) ; if ( last found == null ) { last found = found ; } else { if ( ! ( last found . equals ( found ) ) ) { print ( "CONSISTENCY TEST FAILED" ) ; print ( "lastFound: " + last found ) ; print ( "justFound: " + found ) ; throw new gdx runtime exception ( "test failed" ) ; } } } } <SENTENCE_END/>

test

<SENTENCE_START> { verify = false ; dummy test = player . get ( 0 ) ; dummy last found = null ; all random ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { dummy found = test . get kth nearest enemy ( k ) ; if ( last found == null ) { last found = found ; } else { if ( ! ( last found . equals ( found ) ) ) { print ( "CONSISTENCY TEST FAILED" ) ; print ( "lastFound: " + last found ) ; print ( "justFound: " + found ) ; throw new gdx runtime exception ( "test failed" ) ; } } } } <SENTENCE_END/>

(Copy Probability: 8.6%)

<SENTENCE_START> { verify = false ; dummy test = player . get ( 0 ) ; dummy last found = null ; all random ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { dummy found = test . get kth nearest enemy ( k ) ; if ( last found == null ) { last found = found ; } else { if ( ! ( last found . equals ( found ) ) ) { print ( "CONSISTENCY TEST FAILED" ) ; print ( "lastFound: " + last found ) ; print ( "justFound: " + found ) ; throw new gdx runtime exception ( "test failed" ) ; } } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { verify = false ; dummy test = player . get ( 0 ) ; dummy last found = null ; all random ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { dummy found = test . get kth nearest enemy ( k ) ; if ( last found == null ) { last found = found ; } else { if ( ! ( last found . equals ( found ) ) ) { print ( "CONSISTENCY TEST FAILED" ) ; print ( "lastFound: " + last found ) ; print ( "justFound: " + found ) ; throw new gdx runtime exception ( "test failed" ) ; } } } } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { verify = false ; dummy test = player . get ( 0 ) ; dummy last found = null ; all random ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { dummy found = test . get kth nearest enemy ( k ) ; if ( last found == null ) { last found = found ; } else { if ( ! ( last found . equals ( found ) ) ) { print ( "CONSISTENCY TEST FAILED" ) ; print ( "lastFound: " + last found ) ; print ( "justFound: " + found ) ; throw new gdx runtime exception ( "test failed" ) ; } } } } <SENTENCE_END/>


Original Name test,value,matches,index

test

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

(Copy Probability: 5.1%)

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

value

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

(Copy Probability: 29.8%)

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

matches

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

(Copy Probability: 6.5%)

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

index

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { verify = false ; for ( int i = 0 ; i < runs ; i ++ ) { all random ( ) ; player . shuffle ( ) ; enemy . shuffle ( ) ; origin dummy = player . random ( ) ; int idx = enemy . select ranked index ( dist comp , k ) ; dummy index dummy = enemy . get ( idx ) ; dummy value dummy = enemy . select ranked ( dist comp , k ) ; if ( ! ( index dummy . equals ( value dummy ) ) ) { throw new gdx runtime exception ( "results of selectRankedIndex and selectRanked do not return the same object " + "selectRankedIndex -> " + index dummy + " " + "selectRanked -> " + value dummy ) ; } } } <SENTENCE_END/>


Original Name test

test

<SENTENCE_START> { comparisons made = 0 ; perf . reset ( ) ; all perf . reset ( ) ; all random ( ) ; enemy . shuffle ( ) ; player . shuffle ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { get kth nearest enemy ( quiet , k ) ; } } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { comparisons made = 0 ; perf . reset ( ) ; all perf . reset ( ) ; all random ( ) ; enemy . shuffle ( ) ; player . shuffle ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { get kth nearest enemy ( quiet , k ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { comparisons made = 0 ; perf . reset ( ) ; all perf . reset ( ) ; all random ( ) ; enemy . shuffle ( ) ; player . shuffle ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { get kth nearest enemy ( quiet , k ) ; } } <SENTENCE_END/>

(Copy Probability: 16.6%)

<SENTENCE_START> { comparisons made = 0 ; perf . reset ( ) ; all perf . reset ( ) ; all random ( ) ; enemy . shuffle ( ) ; player . shuffle ( ) ; for ( int i = 0 ; i < runs ; i ++ ) { get kth nearest enemy ( quiet , k ) ; } } <SENTENCE_END/>


Original Name all,random

all

<SENTENCE_START> { for ( dummy d : player ) { d . set random pos ( ) ; } for ( dummy d : enemy ) { d . set random pos ( ) ; } } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { for ( dummy d : player ) { d . set random pos ( ) ; } for ( dummy d : enemy ) { d . set random pos ( ) ; } } <SENTENCE_END/>

random

<SENTENCE_START> { for ( dummy d : player ) { d . set random pos ( ) ; } for ( dummy d : enemy ) { d . set random pos ( ) ; } } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { for ( dummy d : player ) { d . set random pos ( ) ; } for ( dummy d : enemy ) { d . set random pos ( ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( dummy d : player ) { d . set random pos ( ) ; } for ( dummy d : enemy ) { d . set random pos ( ) ; } } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { for ( dummy d : player ) { d . set random pos ( ) ; } for ( dummy d : enemy ) { d . set random pos ( ) ; } } <SENTENCE_END/>


Original Name get,kth,nearest,enemy

get

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

kth

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

nearest

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

enemy

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { dummy kth dummy = null ; perf . reset ( ) ; all perf . start ( ) ; for ( dummy d : player ) { dummy found = d . %SELF% ( k ) ; } all perf . stop ( ) ; all perf . tick ( ) ; if ( silent ) return ; print ( string . format ( "found nearest. min: %.4f, max: %.4f, avg: %.4f, total: %.3f ms" , perf . time . min * 1000 , perf . time . max * 1000 , perf . time . average * 1000 , perf . time . total * 1000 ) ) ; } <SENTENCE_END/>


Original Name verify,correctness

verify

<SENTENCE_START> { enemy . sort ( dist comp ) ; int idx = enemy . index of ( d , true ) ; if ( enemy . get ( idx ) != enemy . get ( k - 1 ) ) { system . out . println ( "origin dummy: " + origin dummy ) ; system . out . println ( "TEST FAILURE: " + "idx: " + idx + " does not equal (k - 1): " + ( k - 1 ) ) ; throw new gdx runtime exception ( "test failed" ) ; } } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { enemy . sort ( dist comp ) ; int idx = enemy . index of ( d , true ) ; if ( enemy . get ( idx ) != enemy . get ( k - 1 ) ) { system . out . println ( "origin dummy: " + origin dummy ) ; system . out . println ( "TEST FAILURE: " + "idx: " + idx + " does not equal (k - 1): " + ( k - 1 ) ) ; throw new gdx runtime exception ( "test failed" ) ; } } <SENTENCE_END/>

correctness

<SENTENCE_START> { enemy . sort ( dist comp ) ; int idx = enemy . index of ( d , true ) ; if ( enemy . get ( idx ) != enemy . get ( k - 1 ) ) { system . out . println ( "origin dummy: " + origin dummy ) ; system . out . println ( "TEST FAILURE: " + "idx: " + idx + " does not equal (k - 1): " + ( k - 1 ) ) ; throw new gdx runtime exception ( "test failed" ) ; } } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { enemy . sort ( dist comp ) ; int idx = enemy . index of ( d , true ) ; if ( enemy . get ( idx ) != enemy . get ( k - 1 ) ) { system . out . println ( "origin dummy: " + origin dummy ) ; system . out . println ( "TEST FAILURE: " + "idx: " + idx + " does not equal (k - 1): " + ( k - 1 ) ) ; throw new gdx runtime exception ( "test failed" ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { enemy . sort ( dist comp ) ; int idx = enemy . index of ( d , true ) ; if ( enemy . get ( idx ) != enemy . get ( k - 1 ) ) { system . out . println ( "origin dummy: " + origin dummy ) ; system . out . println ( "TEST FAILURE: " + "idx: " + idx + " does not equal (k - 1): " + ( k - 1 ) ) ; throw new gdx runtime exception ( "test failed" ) ; } } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { enemy . sort ( dist comp ) ; int idx = enemy . index of ( d , true ) ; if ( enemy . get ( idx ) != enemy . get ( k - 1 ) ) { system . out . println ( "origin dummy: " + origin dummy ) ; system . out . println ( "TEST FAILURE: " + "idx: " + idx + " does not equal (k - 1): " + ( k - 1 ) ) ; throw new gdx runtime exception ( "test failed" ) ; } } <SENTENCE_END/>


Original Name get,kth,nearest,enemy

get

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

kth

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

(Copy Probability: 9.0%)

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

nearest

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

enemy

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { perf . start ( ) ; origin dummy = this ; dummy found = enemy . select ranked ( dist comp , k ) ; perf . stop ( ) ; perf . tick ( ) ; if ( verify ) { verify correctness ( found , k ) ; } return found ; } <SENTENCE_END/>


Original Name set,random,pos

set

<SENTENCE_START> { float max = 100 ; this . pos . x = - max + math utils . random ( max * 2 ) ; this . pos . y = - max + math utils . random ( max * 2 ) ; float x shift = 100 ; if ( player . contains ( this , true ) ) { this . pos . x -= x shift ; } else if ( enemy . contains ( this , true ) ) { this . pos . x += x shift ; } else { throw new runtime exception ( "unhandled" ) ; } } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { float max = 100 ; this . pos . x = - max + math utils . random ( max * 2 ) ; this . pos . y = - max + math utils . random ( max * 2 ) ; float x shift = 100 ; if ( player . contains ( this , true ) ) { this . pos . x -= x shift ; } else if ( enemy . contains ( this , true ) ) { this . pos . x += x shift ; } else { throw new runtime exception ( "unhandled" ) ; } } <SENTENCE_END/>

random

<SENTENCE_START> { float max = 100 ; this . pos . x = - max + math utils . random ( max * 2 ) ; this . pos . y = - max + math utils . random ( max * 2 ) ; float x shift = 100 ; if ( player . contains ( this , true ) ) { this . pos . x -= x shift ; } else if ( enemy . contains ( this , true ) ) { this . pos . x += x shift ; } else { throw new runtime exception ( "unhandled" ) ; } } <SENTENCE_END/>

(Copy Probability: 8.4%)

<SENTENCE_START> { float max = 100 ; this . pos . x = - max + math utils . random ( max * 2 ) ; this . pos . y = - max + math utils . random ( max * 2 ) ; float x shift = 100 ; if ( player . contains ( this , true ) ) { this . pos . x -= x shift ; } else if ( enemy . contains ( this , true ) ) { this . pos . x += x shift ; } else { throw new runtime exception ( "unhandled" ) ; } } <SENTENCE_END/>

pos

<SENTENCE_START> { float max = 100 ; this . pos . x = - max + math utils . random ( max * 2 ) ; this . pos . y = - max + math utils . random ( max * 2 ) ; float x shift = 100 ; if ( player . contains ( this , true ) ) { this . pos . x -= x shift ; } else if ( enemy . contains ( this , true ) ) { this . pos . x += x shift ; } else { throw new runtime exception ( "unhandled" ) ; } } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { float max = 100 ; this . pos . x = - max + math utils . random ( max * 2 ) ; this . pos . y = - max + math utils . random ( max * 2 ) ; float x shift = 100 ; if ( player . contains ( this , true ) ) { this . pos . x -= x shift ; } else if ( enemy . contains ( this , true ) ) { this . pos . x += x shift ; } else { throw new runtime exception ( "unhandled" ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { float max = 100 ; this . pos . x = - max + math utils . random ( max * 2 ) ; this . pos . y = - max + math utils . random ( max * 2 ) ; float x shift = 100 ; if ( player . contains ( this , true ) ) { this . pos . x -= x shift ; } else if ( enemy . contains ( this , true ) ) { this . pos . x += x shift ; } else { throw new runtime exception ( "unhandled" ) ; } } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { float max = 100 ; this . pos . x = - max + math utils . random ( max * 2 ) ; this . pos . y = - max + math utils . random ( max * 2 ) ; float x shift = 100 ; if ( player . contains ( this , true ) ) { this . pos . x -= x shift ; } else if ( enemy . contains ( this , true ) ) { this . pos . x += x shift ; } else { throw new runtime exception ( "unhandled" ) ; } } <SENTENCE_END/>


Original Name create,dummies

create

<SENTENCE_START> { float variance = 20 ; array < dummy > dummies = new array < dummy > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { dummy d = new dummy ( ) ; dummies . add ( d ) ; d . pos = new vector 2 ( ) ; d . id = next id ++ ; } return dummies ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { float variance = 20 ; array < dummy > dummies = new array < dummy > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { dummy d = new dummy ( ) ; dummies . add ( d ) ; d . pos = new vector 2 ( ) ; d . id = next id ++ ; } return dummies ; } <SENTENCE_END/>

dummies

<SENTENCE_START> { float variance = 20 ; array < dummy > dummies = new array < dummy > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { dummy d = new dummy ( ) ; dummies . add ( d ) ; d . pos = new vector 2 ( ) ; d . id = next id ++ ; } return dummies ; } <SENTENCE_END/>

(Copy Probability: 23.7%)

<SENTENCE_START> { float variance = 20 ; array < dummy > dummies = new array < dummy > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { dummy d = new dummy ( ) ; dummies . add ( d ) ; d . pos = new vector 2 ( ) ; d . id = next id ++ ; } return dummies ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float variance = 20 ; array < dummy > dummies = new array < dummy > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { dummy d = new dummy ( ) ; dummies . add ( d ) ; d . pos = new vector 2 ( ) ; d . id = next id ++ ; } return dummies ; } <SENTENCE_END/>

(Copy Probability: 11.8%)

<SENTENCE_START> { float variance = 20 ; array < dummy > dummies = new array < dummy > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { dummy d = new dummy ( ) ; dummies . add ( d ) ; d . pos = new vector 2 ( ) ; d . id = next id ++ ; } return dummies ; } <SENTENCE_END/>


Original Name print

print

<SENTENCE_START> { for ( object o : objs ) { system . out . %SELF% ( o ) ; } system . out . println ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { for ( object o : objs ) { system . out . %SELF% ( o ) ; } system . out . println ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( object o : objs ) { system . out . %SELF% ( o ) ; } system . out . println ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { for ( object o : objs ) { system . out . %SELF% ( o ) ; } system . out . println ( ) ; } <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,status

set

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results status set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results status set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

status

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results status set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 98.0%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results status set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results status set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 97.5%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results status set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,status

get

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results status get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results status get ( swig c ptr , this ) ; } <SENTENCE_END/>

status

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results status get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 97.3%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results status get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results status get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 97.6%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results status get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,witnesses

set

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results witnesses set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results witnesses set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

witnesses

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results witnesses set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results witnesses set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results witnesses set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results witnesses set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,witnesses

get

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results witnesses get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results witnesses get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

witnesses

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results witnesses get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results witnesses 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 gjk epa solver 2 s results witnesses get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 97.9%)

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results witnesses get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,normal

set

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results normal set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results normal set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

normal

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results normal set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results normal set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results normal set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 98.8%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results normal set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,normal

get

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results normal get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results normal get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

normal

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results normal get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 98.8%)

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results normal 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 gjk epa solver 2 s results normal get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 98.3%)

<SENTENCE_START> { long c ptr = collision jni . bt gjk epa solver 2 s results normal get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,distance

set

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results distance set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results distance set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

distance

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results distance set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results distance set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results distance set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { collision jni . bt gjk epa solver 2 s results distance set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,distance

get

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results distance get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results distance get ( swig c ptr , this ) ; } <SENTENCE_END/>

distance

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results distance get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results distance get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results distance get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 s results distance get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name stack,size,requirement

stack

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 stack size requirement ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 stack size requirement ( ) ; } <SENTENCE_END/>

size

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 stack size requirement ( ) ; } <SENTENCE_END/>

(Copy Probability: 95.1%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 stack size requirement ( ) ; } <SENTENCE_END/>

requirement

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 stack size requirement ( ) ; } <SENTENCE_END/>

(Copy Probability: 66.3%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 stack size requirement ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 stack size requirement ( ) ; } <SENTENCE_END/>

(Copy Probability: 68.4%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 stack size requirement ( ) ; } <SENTENCE_END/>


Original Name distance

distance

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 distance ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 distance ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 distance ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 94.5%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 distance ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>


Original Name penetration

penetration

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 penetration swig 0 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results , usemargins ) ; } <SENTENCE_END/>

(Copy Probability: 12.9%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 penetration swig 0 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results , usemargins ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 penetration swig 0 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results , usemargins ) ; } <SENTENCE_END/>

(Copy Probability: 93.3%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 penetration swig 0 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results , usemargins ) ; } <SENTENCE_END/>


Original Name penetration

penetration

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 penetration swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 13.0%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 penetration swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 penetration swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 95.3%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 penetration swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>


Original Name signed,distance

signed

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 0 ( position , margin , bt convex shape . get c ptr ( shape ) , shape , wtrs , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 28.5%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 0 ( position , margin , bt convex shape . get c ptr ( shape ) , shape , wtrs , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

distance

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 0 ( position , margin , bt convex shape . get c ptr ( shape ) , shape , wtrs , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 0 ( position , margin , bt convex shape . get c ptr ( shape ) , shape , wtrs , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 0 ( position , margin , bt convex shape . get c ptr ( shape ) , shape , wtrs , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 38.3%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 0 ( position , margin , bt convex shape . get c ptr ( shape ) , shape , wtrs , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>


Original Name signed,distance

signed

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 20.4%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

distance

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>

(Copy Probability: 73.6%)

<SENTENCE_START> { return collision jni . bt gjk epa solver 2 signed distance swig 1 ( bt convex shape . get c ptr ( shape 0 ) , shape 0 , wtrs 0 , bt convex shape . get c ptr ( shape 1 ) , shape 1 , wtrs 1 , guess , bt gjk epa solver 2 . s results . get c ptr ( results ) , results ) ; } <SENTENCE_END/>


Original Name send,http,request

send

<SENTENCE_START> { net java impl . %SELF% ( http request , http response listener ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { net java impl . %SELF% ( http request , http response listener ) ; } <SENTENCE_END/>

http

<SENTENCE_START> { net java impl . %SELF% ( http request , http response listener ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { net java impl . %SELF% ( http request , http response listener ) ; } <SENTENCE_END/>

request

<SENTENCE_START> { net java impl . %SELF% ( http request , http response listener ) ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { net java impl . %SELF% ( http request , http response listener ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { net java impl . %SELF% ( http request , http response listener ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { net java impl . %SELF% ( http request , http response listener ) ; } <SENTENCE_END/>


Original Name new,server,socket

new

<SENTENCE_START> { return new net java server socket impl ( protocol , port , hints ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return new net java server socket impl ( protocol , port , hints ) ; } <SENTENCE_END/>

server

<SENTENCE_START> { return new net java server socket impl ( protocol , port , hints ) ; } <SENTENCE_END/>

(Copy Probability: 42.9%)

<SENTENCE_START> { return new net java server socket impl ( protocol , port , hints ) ; } <SENTENCE_END/>

socket

<SENTENCE_START> { return new net java server socket impl ( protocol , port , hints ) ; } <SENTENCE_END/>

(Copy Probability: 10.1%)

<SENTENCE_START> { return new net java server socket impl ( protocol , port , hints ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new net java server socket impl ( protocol , port , hints ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { return new net java server socket impl ( protocol , port , hints ) ; } <SENTENCE_END/>


Original Name new,client,socket

new

<SENTENCE_START> { return new net java