Copy+Attentional Convolutional

Original Name get,linear,upper,limit

get

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

linear

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

upper

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

(Copy Probability: 97.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

(Copy Probability: 12.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get linear upper limit ( swig c ptr , this , linear upper ) ; } <SENTENCE_END/>

Original Name set,angular,lower,limit

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

lower

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 95.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 10.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

Original Name set,angular,lower,limit,reversed

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

lower

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

reversed

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 24.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 33.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

Original Name get,angular,lower,limit

get

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

lower

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 97.3%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 12.3%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

Original Name get,angular,lower,limit,reversed

get

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

lower

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

reversed

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 25.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

(Copy Probability: 36.3%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular lower limit reversed ( swig c ptr , this , angular lower ) ; } <SENTENCE_END/>

Original Name set,angular,upper,limit

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

upper

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 95.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 11.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

Original Name set,angular,upper,limit,reversed

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

upper

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 98.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

reversed

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 25.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 34.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

Original Name get,angular,upper,limit

get

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

upper

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 97.5%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 13.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

Original Name get,angular,upper,limit,reversed

get

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

upper

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

reversed

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 26.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

(Copy Probability: 36.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint get angular upper limit reversed ( swig c ptr , this , angular upper ) ; } <SENTENCE_END/>

Original Name set,limit

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

Original Name set,limit,reversed

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit reversed ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit reversed ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit reversed ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit reversed ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

reversed

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit reversed ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit reversed ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit reversed ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set limit reversed ( swig c ptr , this , axis , lo , hi ) ; } <SENTENCE_END/>

Original Name is,limited

is

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

limited

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 97.2%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

Original Name set,rotation,order

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set rotation order ( swig c ptr , this , order ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set rotation order ( swig c ptr , this , order ) ; } <SENTENCE_END/>

rotation

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set rotation order ( swig c ptr , this , order ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set rotation order ( swig c ptr , this , order ) ; } <SENTENCE_END/>

order

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set rotation order ( swig c ptr , this , order ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set rotation order ( swig c ptr , this , order ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set rotation order ( swig c ptr , this , order ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set rotation order ( swig c ptr , this , order ) ; } <SENTENCE_END/>

Original Name get,rotation,order

get

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get rotation order ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get rotation order ( swig c ptr , this ) ; } <SENTENCE_END/>

rotation

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get rotation order ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get rotation order ( swig c ptr , this ) ; } <SENTENCE_END/>

order

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get rotation order ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get rotation order ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get rotation order ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get rotation order ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,axis

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set axis ( swig c ptr , this , axis 1 , axis 2 ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set axis ( swig c ptr , this , axis 1 , axis 2 ) ; } <SENTENCE_END/>

axis

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set axis ( swig c ptr , this , axis 1 , axis 2 ) ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set axis ( swig c ptr , this , axis 1 , axis 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set axis ( swig c ptr , this , axis 1 , axis 2 ) ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set axis ( swig c ptr , this , axis 1 , axis 2 ) ; } <SENTENCE_END/>

Original Name set,bounce

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set bounce ( swig c ptr , this , index , bounce ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set bounce ( swig c ptr , this , index , bounce ) ; } <SENTENCE_END/>

bounce

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set bounce ( swig c ptr , this , index , bounce ) ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set bounce ( swig c ptr , this , index , bounce ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set bounce ( swig c ptr , this , index , bounce ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set bounce ( swig c ptr , this , index , bounce ) ; } <SENTENCE_END/>

Original Name enable,motor

enable

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable motor ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 12.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable motor ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable motor ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable motor ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable motor ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 5.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable motor ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

Original Name set,servo

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

servo

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 20.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

Original Name set,target,velocity

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set target velocity ( swig c ptr , this , index , velocity ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set target velocity ( swig c ptr , this , index , velocity ) ; } <SENTENCE_END/>

target

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set target velocity ( swig c ptr , this , index , velocity ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set target velocity ( swig c ptr , this , index , velocity ) ; } <SENTENCE_END/>

velocity

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set target velocity ( swig c ptr , this , index , velocity ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set target velocity ( swig c ptr , this , index , velocity ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set target velocity ( swig c ptr , this , index , velocity ) ; } <SENTENCE_END/>

(Copy Probability: 16.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set target velocity ( swig c ptr , this , index , velocity ) ; } <SENTENCE_END/>

Original Name set,servo,target

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo target ( swig c ptr , this , index , target ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo target ( swig c ptr , this , index , target ) ; } <SENTENCE_END/>

servo

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo target ( swig c ptr , this , index , target ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo target ( swig c ptr , this , index , target ) ; } <SENTENCE_END/>

target

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo target ( swig c ptr , this , index , target ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo target ( swig c ptr , this , index , target ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo target ( swig c ptr , this , index , target ) ; } <SENTENCE_END/>

(Copy Probability: 5.1%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set servo target ( swig c ptr , this , index , target ) ; } <SENTENCE_END/>

Original Name set,max,motor,force

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

max

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

force

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

(Copy Probability: 97.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

(Copy Probability: 12.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set max motor force ( swig c ptr , this , index , force ) ; } <SENTENCE_END/>

Original Name enable,spring

enable

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable spring ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 12.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable spring ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

spring

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable spring ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable spring ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable spring ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint enable spring ( swig c ptr , this , index , on off ) ; } <SENTENCE_END/>

Original Name set,stiffness

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 0 ( swig c ptr , this , index , stiffness , limit if needed ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 0 ( swig c ptr , this , index , stiffness , limit if needed ) ; } <SENTENCE_END/>

stiffness

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 0 ( swig c ptr , this , index , stiffness , limit if needed ) ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 0 ( swig c ptr , this , index , stiffness , limit if needed ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 0 ( swig c ptr , this , index , stiffness , limit if needed ) ; } <SENTENCE_END/>

(Copy Probability: 34.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 0 ( swig c ptr , this , index , stiffness , limit if needed ) ; } <SENTENCE_END/>

Original Name set,stiffness

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 1 ( swig c ptr , this , index , stiffness ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 1 ( swig c ptr , this , index , stiffness ) ; } <SENTENCE_END/>

stiffness

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 1 ( swig c ptr , this , index , stiffness ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 1 ( swig c ptr , this , index , stiffness ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 1 ( swig c ptr , this , index , stiffness ) ; } <SENTENCE_END/>

(Copy Probability: 52.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set stiffness swig 1 ( swig c ptr , this , index , stiffness ) ; } <SENTENCE_END/>

Original Name set,damping

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 0 ( swig c ptr , this , index , damping , limit if needed ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 0 ( swig c ptr , this , index , damping , limit if needed ) ; } <SENTENCE_END/>

damping

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 0 ( swig c ptr , this , index , damping , limit if needed ) ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 0 ( swig c ptr , this , index , damping , limit if needed ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 0 ( swig c ptr , this , index , damping , limit if needed ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 0 ( swig c ptr , this , index , damping , limit if needed ) ; } <SENTENCE_END/>

Original Name set,damping

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 1 ( swig c ptr , this , index , damping ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 1 ( swig c ptr , this , index , damping ) ; } <SENTENCE_END/>

damping

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 1 ( swig c ptr , this , index , damping ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 1 ( swig c ptr , this , index , damping ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 1 ( swig c ptr , this , index , damping ) ; } <SENTENCE_END/>

(Copy Probability: 8.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set damping swig 1 ( swig c ptr , this , index , damping ) ; } <SENTENCE_END/>

Original Name set,equilibrium,point

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 0 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 0 ( swig c ptr , this ) ; } <SENTENCE_END/>

equilibrium

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 0 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 0 ( swig c ptr , this ) ; } <SENTENCE_END/>

point

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 0 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 0 ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 0 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 0 ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,equilibrium,point

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 1 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 1 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

equilibrium

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 1 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 1 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

point

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 1 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 1 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 1 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 1 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

Original Name set,equilibrium,point

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 2 ( swig c ptr , this , index , val ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 2 ( swig c ptr , this , index , val ) ; } <SENTENCE_END/>

equilibrium

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 2 ( swig c ptr , this , index , val ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 2 ( swig c ptr , this , index , val ) ; } <SENTENCE_END/>

point

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 2 ( swig c ptr , this , index , val ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 2 ( swig c ptr , this , index , val ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 2 ( swig c ptr , this , index , val ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set equilibrium point swig 2 ( swig c ptr , this , index , val ) ; } <SENTENCE_END/>

Original Name set,param

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

param

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

(Copy Probability: 95.7%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

Original Name set,param

set

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

param

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

(Copy Probability: 97.5%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { dynamics jni . bt generic 6 dof spring 2 constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

Original Name get,param

get

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

param

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

(Copy Probability: 98.3%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

Original Name get,param

get

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

param

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { return dynamics jni . bt generic 6 dof spring 2 constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

Original Name set

set

<SENTENCE_START> { %SELF% ( v 1 . x , v 1 . y , v 2 . x , v 2 . y ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { %SELF% ( v 1 . x , v 1 . y , v 2 . x , v 2 . y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( v 1 . x , v 1 . y , v 2 . x , v 2 . y ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { %SELF% ( v 1 . x , v 1 . y , v 2 . x , v 2 . y ) ; } <SENTENCE_END/>

Original Name set

set

<SENTENCE_START> { jni set ( addr , v 1 x , v 1 y , v 2 x , v 2 y ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { jni set ( addr , v 1 x , v 1 y , v 2 x , v 2 y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni set ( addr , v 1 x , v 1 y , v 2 x , v 2 y ) ; } <SENTENCE_END/>

(Copy Probability: 23.3%)

<SENTENCE_START> { jni set ( addr , v 1 x , v 1 y , v 2 x , v 2 y ) ; } <SENTENCE_END/>

Original Name get,vertex,1

get

<SENTENCE_START> { jni get vertex 1 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { jni get vertex 1 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni get vertex 1 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { jni get vertex 1 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

1

<SENTENCE_START> { jni get vertex 1 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { jni get vertex 1 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni get vertex 1 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { jni get vertex 1 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

Original Name get,vertex,2

get

<SENTENCE_START> { jni get vertex 2 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { jni get vertex 2 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni get vertex 2 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { jni get vertex 2 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

2

<SENTENCE_START> { jni get vertex 2 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { jni get vertex 2 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni get vertex 2 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { jni get vertex 2 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

Original Name get,vertex,0

get

<SENTENCE_START> { jni get vertex 0 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { jni get vertex 0 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni get vertex 0 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { jni get vertex 0 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

0

<SENTENCE_START> { jni get vertex 0 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { jni get vertex 0 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni get vertex 0 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { jni get vertex 0 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

Original Name set,vertex,0

set

<SENTENCE_START> { jni set vertex 0 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { jni set vertex 0 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni set vertex 0 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { jni set vertex 0 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

0

<SENTENCE_START> { jni set vertex 0 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

(Copy Probability: 96.5%)

<SENTENCE_START> { jni set vertex 0 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni set vertex 0 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { jni set vertex 0 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

Original Name set,vertex,0

set

<SENTENCE_START> { jni set vertex 0 ( addr , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { jni set vertex 0 ( addr , x , y ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni set vertex 0 ( addr , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { jni set vertex 0 ( addr , x , y ) ; } <SENTENCE_END/>

0

<SENTENCE_START> { jni set vertex 0 ( addr , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 94.1%)

<SENTENCE_START> { jni set vertex 0 ( addr , x , y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni set vertex 0 ( addr , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { jni set vertex 0 ( addr , x , y ) ; } <SENTENCE_END/>

Original Name get,vertex,3

get

<SENTENCE_START> { jni get vertex 3 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { jni get vertex 3 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni get vertex 3 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { jni get vertex 3 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

3

<SENTENCE_START> { jni get vertex 3 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { jni get vertex 3 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni get vertex 3 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { jni get vertex 3 ( addr , vertex ) ; vec . x = vertex [ 0 ] ; vec . y = vertex [ 1 ] ; } <SENTENCE_END/>

Original Name set,vertex,3

set

<SENTENCE_START> { jni set vertex 3 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { jni set vertex 3 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni set vertex 3 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { jni set vertex 3 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

3

<SENTENCE_START> { jni set vertex 3 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

(Copy Probability: 96.0%)

<SENTENCE_START> { jni set vertex 3 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni set vertex 3 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { jni set vertex 3 ( addr , vec . x , vec . y ) ; } <SENTENCE_END/>

Original Name set,vertex,3

set

<SENTENCE_START> { jni set vertex 3 ( addr , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { jni set vertex 3 ( addr , x , y ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni set vertex 3 ( addr , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { jni set vertex 3 ( addr , x , y ) ; } <SENTENCE_END/>

3

<SENTENCE_START> { jni set vertex 3 ( addr , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 96.0%)

<SENTENCE_START> { jni set vertex 3 ( addr , x , y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni set vertex 3 ( addr , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { jni set vertex 3 ( addr , x , y ) ; } <SENTENCE_END/>

Original Name has,vertex,0

has

<SENTENCE_START> { return jni has vertex 0 ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return jni has vertex 0 ( addr ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { return jni has vertex 0 ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 96.1%)

<SENTENCE_START> { return jni has vertex 0 ( addr ) ; } <SENTENCE_END/>

0

<SENTENCE_START> { return jni has vertex 0 ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 80.7%)

<SENTENCE_START> { return jni has vertex 0 ( addr ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return jni has vertex 0 ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { return jni has vertex 0 ( addr ) ; } <SENTENCE_END/>

Original Name set,has,vertex,0

set

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

has

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

(Copy Probability: 96.3%)

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

0

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

(Copy Probability: 59.8%)

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

(Copy Probability: 5.9%)

<SENTENCE_START> { jni set has vertex 0 ( addr , has vertex 0 ) ; } <SENTENCE_END/>

Original Name has,vertex,3

has

<SENTENCE_START> { return jni has vertex 3 ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return jni has vertex 3 ( addr ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { return jni has vertex 3 ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 98.5%)

<SENTENCE_START> { return jni has vertex 3 ( addr ) ; } <SENTENCE_END/>

3

<SENTENCE_START> { return jni has vertex 3 ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 80.6%)

<SENTENCE_START> { return jni has vertex 3 ( addr ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return jni has vertex 3 ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { return jni has vertex 3 ( addr ) ; } <SENTENCE_END/>

Original Name set,has,vertex,3

set

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

has

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

(Copy Probability: 98.6%)

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

3

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

(Copy Probability: 62.0%)

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { jni set has vertex 3 ( addr , has vertex 3 ) ; } <SENTENCE_END/>

Original Name flush,and,sync,transform,matrix

flush

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

and

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

(Copy Probability: 31.2%)

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

sync

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

(Copy Probability: 19.1%)

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

transform

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

(Copy Probability: 6.4%)

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

matrix

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { flush ( ) ; if ( adjust needed ) { have identity real matrix = check idt ( virtual matrix ) ; if ( ! have identity real matrix && virtual matrix . det ( ) == 0 ) throw new gdx runtime exception ( "Transform matrix is singular, can't sync" ) ; adjust needed = false ; super . set transform matrix ( virtual matrix ) ; } } <SENTENCE_END/>

Original Name set,transform,matrix

set

<SENTENCE_START> { matrix 4 real matrix = super . get transform matrix ( ) ; if ( check equal ( real matrix , transform ) ) { adjust needed = false ; } else { virtual matrix . set as affine ( transform ) ; if ( is drawing ( ) ) { adjust needed = true ; if ( have identity real matrix ) { adjust affine . set ( transform ) ; } else { adjust affine . set ( real matrix ) . inv ( ) . mul ( transform ) ; } } else { real matrix . set as affine ( transform ) ; have identity real matrix = check idt ( real matrix ) ; } } } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { matrix 4 real matrix = super . get transform matrix ( ) ; if ( check equal ( real matrix , transform ) ) { adjust needed = false ; } else { virtual matrix . set as affine ( transform ) ; if ( is drawing ( ) ) { adjust needed = true ; if ( have identity real matrix ) { adjust affine . set ( transform ) ; } else { adjust affine . set ( real matrix ) . inv ( ) . mul ( transform ) ; } } else { real matrix . set as affine ( transform ) ; have identity real matrix = check idt ( real matrix ) ; } } } <SENTENCE_END/>

transform

<SENTENCE_START> { matrix 4 real matrix = super . get transform matrix ( ) ; if ( check equal ( real matrix , transform ) ) { adjust needed = false ; } else { virtual matrix . set as affine ( transform ) ; if ( is drawing ( ) ) { adjust needed = true ; if ( have identity real matrix ) { adjust affine . set ( transform ) ; } else { adjust affine . set ( real matrix ) . inv ( ) . mul ( transform ) ; } } else { real matrix . set as affine ( transform ) ; have identity real matrix = check idt ( real matrix ) ; } } } <SENTENCE_END/>

(Copy Probability: 23.6%)

<SENTENCE_START> { matrix 4 real matrix = super . get transform matrix ( ) ; if ( check equal ( real matrix , transform ) ) { adjust needed = false ; } else { virtual matrix . set as affine ( transform ) ; if ( is drawing ( ) ) { adjust needed = true ; if ( have identity real matrix ) { adjust affine . set ( transform ) ; } else { adjust affine . set ( real matrix ) . inv ( ) . mul ( transform ) ; } } else { real matrix . set as affine ( transform ) ; have identity real matrix = check idt ( real matrix ) ; } } } <SENTENCE_END/>

matrix

<SENTENCE_START> { matrix 4 real matrix = super . get transform matrix ( ) ; if ( check equal ( real matrix , transform ) ) { adjust needed = false ; } else { virtual matrix . set as affine ( transform ) ; if ( is drawing ( ) ) { adjust needed = true ; if ( have identity real matrix ) { adjust affine . set ( transform ) ; } else { adjust affine . set ( real matrix ) . inv ( ) . mul ( transform ) ; } } else { real matrix . set as affine ( transform ) ; have identity real matrix = check idt ( real matrix ) ; } } } <SENTENCE_END/>

(Copy Probability: 10.4%)

<SENTENCE_START> { matrix 4 real matrix = super . get transform matrix ( ) ; if ( check equal ( real matrix , transform ) ) { adjust needed = false ; } else { virtual matrix . set as affine ( transform ) ; if ( is drawing ( ) ) { adjust needed = true ; if ( have identity real matrix ) { adjust affine . set ( transform ) ; } else { adjust affine . set ( real matrix ) . inv ( ) . mul ( transform ) ; } } else { real matrix . set as affine ( transform ) ; have identity real matrix = check idt ( real matrix ) ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { matrix 4 real matrix = super . get transform matrix ( ) ; if ( check equal ( real matrix , transform ) ) { adjust needed = false ; } else { virtual matrix . set as affine ( transform ) ; if ( is drawing ( ) ) { adjust needed = true ; if ( have identity real matrix ) { adjust affine . set ( transform ) ; } else { adjust affine . set ( real matrix ) . inv ( ) . mul ( transform ) ; } } else { real matrix . set as affine ( transform ) ; have identity real matrix = check idt ( real matrix ) ; } } } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { matrix 4 real matrix = super . get transform matrix ( ) ; if ( check equal ( real matrix , transform ) ) { adjust needed = false ; } else { virtual matrix . set as affine ( transform ) ; if ( is drawing ( ) ) { adjust needed = true ; if ( have identity real matrix ) { adjust affine . set ( transform ) ; } else { adjust affine . set ( real matrix ) . inv ( ) . mul ( transform ) ; } } else { real matrix . set as affine ( transform ) ; have identity real matrix = check idt ( real matrix ) ; } } } <SENTENCE_END/>

Original Name draw,adjusted

draw

<SENTENCE_START> { draw adjusted uv ( region . texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , region . u , region . v 2 , region . u 2 , region . v , false , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { draw adjusted uv ( region . texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , region . u , region . v 2 , region . u 2 , region . v , false , false ) ; } <SENTENCE_END/>

adjusted

<SENTENCE_START> { draw adjusted uv ( region . texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , region . u , region . v 2 , region . u 2 , region . v , false , false ) ; } <SENTENCE_END/>

(Copy Probability: 80.2%)

<SENTENCE_START> { draw adjusted uv ( region . texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , region . u , region . v 2 , region . u 2 , region . v , false , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { draw adjusted uv ( region . texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , region . u , region . v 2 , region . u 2 , region . v , false , false ) ; } <SENTENCE_END/>

(Copy Probability: 17.8%)

<SENTENCE_START> { draw adjusted uv ( region . texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , region . u , region . v 2 , region . u 2 , region . v , false , false ) ; } <SENTENCE_END/>

Original Name draw,adjusted

draw

<SENTENCE_START> { float inv tex width = 1.0f / texture . get width ( ) ; float inv tex height = 1.0f / texture . get height ( ) ; float u = src x * inv tex width ; float v = ( src y + src height ) * inv tex height ; float u 2 = ( src x + src width ) * inv tex width ; float v 2 = src y * inv tex height ; draw adjusted uv ( texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , u , v , u 2 , v 2 , flip x , flip y ) ; } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { float inv tex width = 1.0f / texture . get width ( ) ; float inv tex height = 1.0f / texture . get height ( ) ; float u = src x * inv tex width ; float v = ( src y + src height ) * inv tex height ; float u 2 = ( src x + src width ) * inv tex width ; float v 2 = src y * inv tex height ; draw adjusted uv ( texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , u , v , u 2 , v 2 , flip x , flip y ) ; } <SENTENCE_END/>

adjusted

<SENTENCE_START> { float inv tex width = 1.0f / texture . get width ( ) ; float inv tex height = 1.0f / texture . get height ( ) ; float u = src x * inv tex width ; float v = ( src y + src height ) * inv tex height ; float u 2 = ( src x + src width ) * inv tex width ; float v 2 = src y * inv tex height ; draw adjusted uv ( texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , u , v , u 2 , v 2 , flip x , flip y ) ; } <SENTENCE_END/>

(Copy Probability: 55.8%)

<SENTENCE_START> { float inv tex width = 1.0f / texture . get width ( ) ; float inv tex height = 1.0f / texture . get height ( ) ; float u = src x * inv tex width ; float v = ( src y + src height ) * inv tex height ; float u 2 = ( src x + src width ) * inv tex width ; float v 2 = src y * inv tex height ; draw adjusted uv ( texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , u , v , u 2 , v 2 , flip x , flip y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float inv tex width = 1.0f / texture . get width ( ) ; float inv tex height = 1.0f / texture . get height ( ) ; float u = src x * inv tex width ; float v = ( src y + src height ) * inv tex height ; float u 2 = ( src x + src width ) * inv tex width ; float v 2 = src y * inv tex height ; draw adjusted uv ( texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , u , v , u 2 , v 2 , flip x , flip y ) ; } <SENTENCE_END/>

(Copy Probability: 15.3%)

<SENTENCE_START> { float inv tex width = 1.0f / texture . get width ( ) ; float inv tex height = 1.0f / texture . get height ( ) ; float u = src x * inv tex width ; float v = ( src y + src height ) * inv tex height ; float u 2 = ( src x + src width ) * inv tex width ; float v 2 = src y * inv tex height ; draw adjusted uv ( texture , x , y , origin x , origin y , width , height , scale x , scale y , rotation , u , v , u 2 , v 2 , flip x , flip y ) ; } <SENTENCE_END/>

Original Name draw,adjusted,uv

draw

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; if ( flip x ) { float tmp = u ; u = u 2 ; u 2 = tmp ; } if ( flip y ) { float tmp = v ; v = v 2 ; v 2 = tmp ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; if ( flip x ) { float tmp = u ; u = u 2 ; u 2 = tmp ; } if ( flip y ) { float tmp = v ; v = v 2 ; v 2 = tmp ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

adjusted

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; if ( flip x ) { float tmp = u ; u = u 2 ; u 2 = tmp ; } if ( flip y ) { float tmp = v ; v = v 2 ; v 2 = tmp ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 5.8%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; if ( flip x ) { float tmp = u ; u = u 2 ; u 2 = tmp ; } if ( flip y ) { float tmp = v ; v = v 2 ; v 2 = tmp ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

uv

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; if ( flip x ) { float tmp = u ; u = u 2 ; u 2 = tmp ; } if ( flip y ) { float tmp = v ; v = v 2 ; v 2 = tmp ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; if ( flip x ) { float tmp = u ; u = u 2 ; u 2 = tmp ; } if ( flip y ) { float tmp = v ; v = v 2 ; v 2 = tmp ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; if ( flip x ) { float tmp = u ; u = u 2 ; u 2 = tmp ; } if ( flip y ) { float tmp = v ; v = v 2 ; v 2 = tmp ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; if ( flip x ) { float tmp = u ; u = u 2 ; u 2 = tmp ; } if ( flip y ) { float tmp = v ; v = v 2 ; v 2 = tmp ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

Original Name draw,adjusted

draw

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; float u 1 , v 1 , u 2 , v 2 , u 3 , v 3 , u 4 , v 4 ; if ( clockwise ) { u 1 = region . u 2 ; v 1 = region . v 2 ; u 2 = region . u ; v 2 = region . v 2 ; u 3 = region . u ; v 3 = region . v ; u 4 = region . u 2 ; v 4 = region . v ; } else { u 1 = region . u ; v 1 = region . v ; u 2 = region . u 2 ; v 2 = region . v ; u 3 = region . u 2 ; v 3 = region . v 2 ; u 4 = region . u ; v 4 = region . v 2 ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u 1 ; vertices [ idx + 4 ] = v 1 ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u 2 ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 3 ; vertices [ idx + 14 ] = v 3 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 4 ; vertices [ idx + 19 ] = v 4 ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; float u 1 , v 1 , u 2 , v 2 , u 3 , v 3 , u 4 , v 4 ; if ( clockwise ) { u 1 = region . u 2 ; v 1 = region . v 2 ; u 2 = region . u ; v 2 = region . v 2 ; u 3 = region . u ; v 3 = region . v ; u 4 = region . u 2 ; v 4 = region . v ; } else { u 1 = region . u ; v 1 = region . v ; u 2 = region . u 2 ; v 2 = region . v ; u 3 = region . u 2 ; v 3 = region . v 2 ; u 4 = region . u ; v 4 = region . v 2 ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u 1 ; vertices [ idx + 4 ] = v 1 ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u 2 ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 3 ; vertices [ idx + 14 ] = v 3 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 4 ; vertices [ idx + 19 ] = v 4 ; idx += sprite . sprite size ; } <SENTENCE_END/>

adjusted

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; float u 1 , v 1 , u 2 , v 2 , u 3 , v 3 , u 4 , v 4 ; if ( clockwise ) { u 1 = region . u 2 ; v 1 = region . v 2 ; u 2 = region . u ; v 2 = region . v 2 ; u 3 = region . u ; v 3 = region . v ; u 4 = region . u 2 ; v 4 = region . v ; } else { u 1 = region . u ; v 1 = region . v ; u 2 = region . u 2 ; v 2 = region . v ; u 3 = region . u 2 ; v 3 = region . v 2 ; u 4 = region . u ; v 4 = region . v 2 ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u 1 ; vertices [ idx + 4 ] = v 1 ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u 2 ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 3 ; vertices [ idx + 14 ] = v 3 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 4 ; vertices [ idx + 19 ] = v 4 ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; float u 1 , v 1 , u 2 , v 2 , u 3 , v 3 , u 4 , v 4 ; if ( clockwise ) { u 1 = region . u 2 ; v 1 = region . v 2 ; u 2 = region . u ; v 2 = region . v 2 ; u 3 = region . u ; v 3 = region . v ; u 4 = region . u 2 ; v 4 = region . v ; } else { u 1 = region . u ; v 1 = region . v ; u 2 = region . u 2 ; v 2 = region . v ; u 3 = region . u 2 ; v 3 = region . v 2 ; u 4 = region . u ; v 4 = region . v 2 ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u 1 ; vertices [ idx + 4 ] = v 1 ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u 2 ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 3 ; vertices [ idx + 14 ] = v 3 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 4 ; vertices [ idx + 19 ] = v 4 ; idx += sprite . sprite size ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; float u 1 , v 1 , u 2 , v 2 , u 3 , v 3 , u 4 , v 4 ; if ( clockwise ) { u 1 = region . u 2 ; v 1 = region . v 2 ; u 2 = region . u ; v 2 = region . v 2 ; u 3 = region . u ; v 3 = region . v ; u 4 = region . u 2 ; v 4 = region . v ; } else { u 1 = region . u ; v 1 = region . v ; u 2 = region . u 2 ; v 2 = region . v ; u 3 = region . u 2 ; v 3 = region . v 2 ; u 4 = region . u ; v 4 = region . v 2 ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u 1 ; vertices [ idx + 4 ] = v 1 ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u 2 ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 3 ; vertices [ idx + 14 ] = v 3 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 4 ; vertices [ idx + 19 ] = v 4 ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; final float world origin x = x + origin x ; final float world origin y = y + origin y ; float fx = - origin x ; float fy = - origin y ; float fx 2 = width - origin x ; float fy 2 = height - origin y ; if ( scale x != 1 || scale y != 1 ) { fx *= scale x ; fy *= scale y ; fx 2 *= scale x ; fy 2 *= scale y ; } final float p 1 x = fx ; final float p 1 y = fy ; final float p 2 x = fx ; final float p 2 y = fy 2 ; final float p 3 x = fx 2 ; final float p 3 y = fy 2 ; final float p 4 x = fx 2 ; final float p 4 y = fy ; float x 1 ; float y 1 ; float x 2 ; float y 2 ; float x 3 ; float y 3 ; float x 4 ; float y 4 ; if ( rotation != 0 ) { final float cos = math utils . cos deg ( rotation ) ; final float sin = math utils . sin deg ( rotation ) ; x 1 = cos * p 1 x - sin * p 1 y ; y 1 = sin * p 1 x + cos * p 1 y ; x 2 = cos * p 2 x - sin * p 2 y ; y 2 = sin * p 2 x + cos * p 2 y ; x 3 = cos * p 3 x - sin * p 3 y ; y 3 = sin * p 3 x + cos * p 3 y ; x 4 = x 1 + ( x 3 - x 2 ) ; y 4 = y 3 - ( y 2 - y 1 ) ; } else { x 1 = p 1 x ; y 1 = p 1 y ; x 2 = p 2 x ; y 2 = p 2 y ; x 3 = p 3 x ; y 3 = p 3 y ; x 4 = p 4 x ; y 4 = p 4 y ; } x 1 += world origin x ; y 1 += world origin y ; x 2 += world origin x ; y 2 += world origin y ; x 3 += world origin x ; y 3 += world origin y ; x 4 += world origin x ; y 4 += world origin y ; float u 1 , v 1 , u 2 , v 2 , u 3 , v 3 , u 4 , v 4 ; if ( clockwise ) { u 1 = region . u 2 ; v 1 = region . v 2 ; u 2 = region . u ; v 2 = region . v 2 ; u 3 = region . u ; v 3 = region . v ; u 4 = region . u 2 ; v 4 = region . v ; } else { u 1 = region . u ; v 1 = region . v ; u 2 = region . u 2 ; v 2 = region . v ; u 3 = region . u 2 ; v 3 = region . v 2 ; u 4 = region . u ; v 4 = region . v 2 ; } affine 2 t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u 1 ; vertices [ idx + 4 ] = v 1 ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u 2 ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 3 ; vertices [ idx + 14 ] = v 3 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 4 ; vertices [ idx + 19 ] = v 4 ; idx += sprite . sprite size ; } <SENTENCE_END/>

Original Name draw,adjusted

draw

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; affine 2 t = transform ; float x 1 = t . m 02 ; float y 1 = t . m 12 ; float x 2 = t . m 01 * height + t . m 02 ; float y 2 = t . m 11 * height + t . m 12 ; float x 3 = t . m 00 * width + t . m 01 * height + t . m 02 ; float y 3 = t . m 10 * width + t . m 11 * height + t . m 12 ; float x 4 = t . m 00 * width + t . m 02 ; float y 4 = t . m 10 * width + t . m 12 ; float u = region . u ; float v = region . v 2 ; float u 2 = region . u 2 ; float v 2 = region . v ; t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; affine 2 t = transform ; float x 1 = t . m 02 ; float y 1 = t . m 12 ; float x 2 = t . m 01 * height + t . m 02 ; float y 2 = t . m 11 * height + t . m 12 ; float x 3 = t . m 00 * width + t . m 01 * height + t . m 02 ; float y 3 = t . m 10 * width + t . m 11 * height + t . m 12 ; float x 4 = t . m 00 * width + t . m 02 ; float y 4 = t . m 10 * width + t . m 12 ; float u = region . u ; float v = region . v 2 ; float u 2 = region . u 2 ; float v 2 = region . v ; t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

adjusted

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; affine 2 t = transform ; float x 1 = t . m 02 ; float y 1 = t . m 12 ; float x 2 = t . m 01 * height + t . m 02 ; float y 2 = t . m 11 * height + t . m 12 ; float x 3 = t . m 00 * width + t . m 01 * height + t . m 02 ; float y 3 = t . m 10 * width + t . m 11 * height + t . m 12 ; float x 4 = t . m 00 * width + t . m 02 ; float y 4 = t . m 10 * width + t . m 12 ; float u = region . u ; float v = region . v 2 ; float u 2 = region . u 2 ; float v 2 = region . v ; t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 6.4%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; affine 2 t = transform ; float x 1 = t . m 02 ; float y 1 = t . m 12 ; float x 2 = t . m 01 * height + t . m 02 ; float y 2 = t . m 11 * height + t . m 12 ; float x 3 = t . m 00 * width + t . m 01 * height + t . m 02 ; float y 3 = t . m 10 * width + t . m 11 * height + t . m 12 ; float x 4 = t . m 00 * width + t . m 02 ; float y 4 = t . m 10 * width + t . m 12 ; float u = region . u ; float v = region . v 2 ; float u 2 = region . u 2 ; float v 2 = region . v ; t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; affine 2 t = transform ; float x 1 = t . m 02 ; float y 1 = t . m 12 ; float x 2 = t . m 01 * height + t . m 02 ; float y 2 = t . m 11 * height + t . m 12 ; float x 3 = t . m 00 * width + t . m 01 * height + t . m 02 ; float y 3 = t . m 10 * width + t . m 11 * height + t . m 12 ; float x 4 = t . m 00 * width + t . m 02 ; float y 4 = t . m 10 * width + t . m 12 ; float u = region . u ; float v = region . v 2 ; float u 2 = region . u 2 ; float v 2 = region . v ; t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( region . texture != last texture ) switch texture ( region . texture ) ; else if ( idx == vertices . length ) super . flush ( ) ; affine 2 t = transform ; float x 1 = t . m 02 ; float y 1 = t . m 12 ; float x 2 = t . m 01 * height + t . m 02 ; float y 2 = t . m 11 * height + t . m 12 ; float x 3 = t . m 00 * width + t . m 01 * height + t . m 02 ; float y 3 = t . m 10 * width + t . m 11 * height + t . m 12 ; float x 4 = t . m 00 * width + t . m 02 ; float y 4 = t . m 10 * width + t . m 12 ; float u = region . u ; float v = region . v 2 ; float u 2 = region . u 2 ; float v 2 = region . v ; t = adjust affine ; vertices [ idx + 0 ] = t . m 00 * x 1 + t . m 01 * y 1 + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x 1 + t . m 11 * y 1 + t . m 12 ; vertices [ idx + 2 ] = color ; vertices [ idx + 3 ] = u ; vertices [ idx + 4 ] = v ; vertices [ idx + 5 ] = t . m 00 * x 2 + t . m 01 * y 2 + t . m 02 ; vertices [ idx + 6 ] = t . m 10 * x 2 + t . m 11 * y 2 + t . m 12 ; vertices [ idx + 7 ] = color ; vertices [ idx + 8 ] = u ; vertices [ idx + 9 ] = v 2 ; vertices [ idx + 10 ] = t . m 00 * x 3 + t . m 01 * y 3 + t . m 02 ; vertices [ idx + 11 ] = t . m 10 * x 3 + t . m 11 * y 3 + t . m 12 ; vertices [ idx + 12 ] = color ; vertices [ idx + 13 ] = u 2 ; vertices [ idx + 14 ] = v 2 ; vertices [ idx + 15 ] = t . m 00 * x 4 + t . m 01 * y 4 + t . m 02 ; vertices [ idx + 16 ] = t . m 10 * x 4 + t . m 11 * y 4 + t . m 12 ; vertices [ idx + 17 ] = color ; vertices [ idx + 18 ] = u 2 ; vertices [ idx + 19 ] = v ; idx += sprite . sprite size ; } <SENTENCE_END/>

Original Name draw,adjusted

draw

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; affine 2 t = adjust affine ; int copy count = math . min ( vertices . length - idx , count ) ; do { count -= copy count ; while ( copy count > 0 ) { float x = sprite vertices [ offset ] ; float y = sprite vertices [ offset + 1 ] ; vertices [ idx ] = t . m 00 * x + t . m 01 * y + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x + t . m 11 * y + t . m 12 ; vertices [ idx + 2 ] = sprite vertices [ offset + 2 ] ; vertices [ idx + 3 ] = sprite vertices [ offset + 3 ] ; vertices [ idx + 4 ] = sprite vertices [ offset + 4 ] ; idx += sprite . vertex size ; offset += sprite . vertex size ; copy count -= sprite . vertex size ; } if ( count > 0 ) { super . flush ( ) ; copy count = math . min ( vertices . length , count ) ; } } while ( count > 0 ) ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; affine 2 t = adjust affine ; int copy count = math . min ( vertices . length - idx , count ) ; do { count -= copy count ; while ( copy count > 0 ) { float x = sprite vertices [ offset ] ; float y = sprite vertices [ offset + 1 ] ; vertices [ idx ] = t . m 00 * x + t . m 01 * y + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x + t . m 11 * y + t . m 12 ; vertices [ idx + 2 ] = sprite vertices [ offset + 2 ] ; vertices [ idx + 3 ] = sprite vertices [ offset + 3 ] ; vertices [ idx + 4 ] = sprite vertices [ offset + 4 ] ; idx += sprite . vertex size ; offset += sprite . vertex size ; copy count -= sprite . vertex size ; } if ( count > 0 ) { super . flush ( ) ; copy count = math . min ( vertices . length , count ) ; } } while ( count > 0 ) ; } <SENTENCE_END/>

adjusted

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; affine 2 t = adjust affine ; int copy count = math . min ( vertices . length - idx , count ) ; do { count -= copy count ; while ( copy count > 0 ) { float x = sprite vertices [ offset ] ; float y = sprite vertices [ offset + 1 ] ; vertices [ idx ] = t . m 00 * x + t . m 01 * y + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x + t . m 11 * y + t . m 12 ; vertices [ idx + 2 ] = sprite vertices [ offset + 2 ] ; vertices [ idx + 3 ] = sprite vertices [ offset + 3 ] ; vertices [ idx + 4 ] = sprite vertices [ offset + 4 ] ; idx += sprite . vertex size ; offset += sprite . vertex size ; copy count -= sprite . vertex size ; } if ( count > 0 ) { super . flush ( ) ; copy count = math . min ( vertices . length , count ) ; } } while ( count > 0 ) ; } <SENTENCE_END/>

(Copy Probability: 12.8%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; affine 2 t = adjust affine ; int copy count = math . min ( vertices . length - idx , count ) ; do { count -= copy count ; while ( copy count > 0 ) { float x = sprite vertices [ offset ] ; float y = sprite vertices [ offset + 1 ] ; vertices [ idx ] = t . m 00 * x + t . m 01 * y + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x + t . m 11 * y + t . m 12 ; vertices [ idx + 2 ] = sprite vertices [ offset + 2 ] ; vertices [ idx + 3 ] = sprite vertices [ offset + 3 ] ; vertices [ idx + 4 ] = sprite vertices [ offset + 4 ] ; idx += sprite . vertex size ; offset += sprite . vertex size ; copy count -= sprite . vertex size ; } if ( count > 0 ) { super . flush ( ) ; copy count = math . min ( vertices . length , count ) ; } } while ( count > 0 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; affine 2 t = adjust affine ; int copy count = math . min ( vertices . length - idx , count ) ; do { count -= copy count ; while ( copy count > 0 ) { float x = sprite vertices [ offset ] ; float y = sprite vertices [ offset + 1 ] ; vertices [ idx ] = t . m 00 * x + t . m 01 * y + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x + t . m 11 * y + t . m 12 ; vertices [ idx + 2 ] = sprite vertices [ offset + 2 ] ; vertices [ idx + 3 ] = sprite vertices [ offset + 3 ] ; vertices [ idx + 4 ] = sprite vertices [ offset + 4 ] ; idx += sprite . vertex size ; offset += sprite . vertex size ; copy count -= sprite . vertex size ; } if ( count > 0 ) { super . flush ( ) ; copy count = math . min ( vertices . length , count ) ; } } while ( count > 0 ) ; } <SENTENCE_END/>

(Copy Probability: 7.8%)

<SENTENCE_START> { if ( ! drawing ) throw new illegal state exception ( "CpuSpriteBatch.begin must be called before draw." ) ; if ( texture != last texture ) switch texture ( texture ) ; affine 2 t = adjust affine ; int copy count = math . min ( vertices . length - idx , count ) ; do { count -= copy count ; while ( copy count > 0 ) { float x = sprite vertices [ offset ] ; float y = sprite vertices [ offset + 1 ] ; vertices [ idx ] = t . m 00 * x + t . m 01 * y + t . m 02 ; vertices [ idx + 1 ] = t . m 10 * x + t . m 11 * y + t . m 12 ; vertices [ idx + 2 ] = sprite vertices [ offset + 2 ] ; vertices [ idx + 3 ] = sprite vertices [ offset + 3 ] ; vertices [ idx + 4 ] = sprite vertices [ offset + 4 ] ; idx += sprite . vertex size ; offset += sprite . vertex size ; copy count -= sprite . vertex size ; } if ( count > 0 ) { super . flush ( ) ; copy count = math . min ( vertices . length , count ) ; } } while ( count > 0 ) ; } <SENTENCE_END/>

Original Name check,equal

check

<SENTENCE_START> { if ( a == b ) return true ; return ( a . val [ matrix 4 . m 00 ] == b . val [ matrix 4 . m 00 ] && a . val [ matrix 4 . m 10 ] == b . val [ matrix 4 . m 10 ] && a . val [ matrix 4 . m 01 ] == b . val [ matrix 4 . m 01 ] && a . val [ matrix 4 . m 11 ] == b . val [ matrix 4 . m 11 ] && a . val [ matrix 4 . m 03 ] == b . val [ matrix 4 . m 03 ] && a . val [ matrix 4 . m 13 ] == b . val [ matrix 4 . m 13 ] ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { if ( a == b ) return true ; return ( a . val [ matrix 4 . m 00 ] == b . val [ matrix 4 . m 00 ] && a . val [ matrix 4 . m 10 ] == b . val [ matrix 4 . m 10 ] && a . val [ matrix 4 . m 01 ] == b . val [ matrix 4 . m 01 ] && a . val [ matrix 4 . m 11 ] == b . val [ matrix 4 . m 11 ] && a . val [ matrix 4 . m 03 ] == b . val [ matrix 4 . m 03 ] && a . val [ matrix 4 . m 13 ] == b . val [ matrix 4 . m 13 ] ) ; } <SENTENCE_END/>

equal

<SENTENCE_START> { if ( a == b ) return true ; return ( a . val [ matrix 4 . m 00 ] == b . val [ matrix 4 . m 00 ] && a . val [ matrix 4 . m 10 ] == b . val [ matrix 4 . m 10 ] && a . val [ matrix 4 . m 01 ] == b . val [ matrix 4 . m 01 ] && a . val [ matrix 4 . m 11 ] == b . val [ matrix 4 . m 11 ] && a . val [ matrix 4 . m 03 ] == b . val [ matrix 4 . m 03 ] && a . val [ matrix 4 . m 13 ] == b . val [ matrix 4 . m 13 ] ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( a == b ) return true ; return ( a . val [ matrix 4 . m 00 ] == b . val [ matrix 4 . m 00 ] && a . val [ matrix 4 . m 10 ] == b . val [ matrix 4 . m 10 ] && a . val [ matrix 4 . m 01 ] == b . val [ matrix 4 . m 01 ] && a . val [ matrix 4 . m 11 ] == b . val [ matrix 4 . m 11 ] && a . val [ matrix 4 . m 03 ] == b . val [ matrix 4 . m 03 ] && a . val [ matrix 4 . m 13 ] == b . val [ matrix 4 . m 13 ] ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( a == b ) return true ; return ( a . val [ matrix 4 . m 00 ] == b . val [ matrix 4 . m 00 ] && a . val [ matrix 4 . m 10 ] == b . val [ matrix 4 . m 10 ] && a . val [ matrix 4 . m 01 ] == b . val [ matrix 4 . m 01 ] && a . val [ matrix 4 . m 11 ] == b . val [ matrix 4 . m 11 ] && a . val [ matrix 4 . m 03 ] == b . val [ matrix 4 . m 03 ] && a . val [ matrix 4 . m 13 ] == b . val [ matrix 4 . m 13 ] ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { if ( a == b ) return true ; return ( a . val [ matrix 4 . m 00 ] == b . val [ matrix 4 . m 00 ] && a . val [ matrix 4 . m 10 ] == b . val [ matrix 4 . m 10 ] && a . val [ matrix 4 . m 01 ] == b . val [ matrix 4 . m 01 ] && a . val [ matrix 4 . m 11 ] == b . val [ matrix 4 . m 11 ] && a . val [ matrix 4 . m 03 ] == b . val [ matrix 4 . m 03 ] && a . val [ matrix 4 . m 13 ] == b . val [ matrix 4 . m 13 ] ) ; } <SENTENCE_END/>

Original Name check,equal

check

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == affine . m 00 && val [ matrix 4 . m 10 ] == affine . m 10 && val [ matrix 4 . m 01 ] == affine . m 01 && val [ matrix 4 . m 11 ] == affine . m 11 && val [ matrix 4 . m 03 ] == affine . m 02 && val [ matrix 4 . m 13 ] == affine . m 12 ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == affine . m 00 && val [ matrix 4 . m 10 ] == affine . m 10 && val [ matrix 4 . m 01 ] == affine . m 01 && val [ matrix 4 . m 11 ] == affine . m 11 && val [ matrix 4 . m 03 ] == affine . m 02 && val [ matrix 4 . m 13 ] == affine . m 12 ) ; } <SENTENCE_END/>

equal

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == affine . m 00 && val [ matrix 4 . m 10 ] == affine . m 10 && val [ matrix 4 . m 01 ] == affine . m 01 && val [ matrix 4 . m 11 ] == affine . m 11 && val [ matrix 4 . m 03 ] == affine . m 02 && val [ matrix 4 . m 13 ] == affine . m 12 ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == affine . m 00 && val [ matrix 4 . m 10 ] == affine . m 10 && val [ matrix 4 . m 01 ] == affine . m 01 && val [ matrix 4 . m 11 ] == affine . m 11 && val [ matrix 4 . m 03 ] == affine . m 02 && val [ matrix 4 . m 13 ] == affine . m 12 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == affine . m 00 && val [ matrix 4 . m 10 ] == affine . m 10 && val [ matrix 4 . m 01 ] == affine . m 01 && val [ matrix 4 . m 11 ] == affine . m 11 && val [ matrix 4 . m 03 ] == affine . m 02 && val [ matrix 4 . m 13 ] == affine . m 12 ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == affine . m 00 && val [ matrix 4 . m 10 ] == affine . m 10 && val [ matrix 4 . m 01 ] == affine . m 01 && val [ matrix 4 . m 11 ] == affine . m 11 && val [ matrix 4 . m 03 ] == affine . m 02 && val [ matrix 4 . m 13 ] == affine . m 12 ) ; } <SENTENCE_END/>

Original Name check,idt

check

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == 1 && val [ matrix 4 . m 10 ] == 0 && val [ matrix 4 . m 01 ] == 0 && val [ matrix 4 . m 11 ] == 1 && val [ matrix 4 . m 03 ] == 0 && val [ matrix 4 . m 13 ] == 0 ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == 1 && val [ matrix 4 . m 10 ] == 0 && val [ matrix 4 . m 01 ] == 0 && val [ matrix 4 . m 11 ] == 1 && val [ matrix 4 . m 03 ] == 0 && val [ matrix 4 . m 13 ] == 0 ) ; } <SENTENCE_END/>

idt

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == 1 && val [ matrix 4 . m 10 ] == 0 && val [ matrix 4 . m 01 ] == 0 && val [ matrix 4 . m 11 ] == 1 && val [ matrix 4 . m 03 ] == 0 && val [ matrix 4 . m 13 ] == 0 ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == 1 && val [ matrix 4 . m 10 ] == 0 && val [ matrix 4 . m 01 ] == 0 && val [ matrix 4 . m 11 ] == 1 && val [ matrix 4 . m 03 ] == 0 && val [ matrix 4 . m 13 ] == 0 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == 1 && val [ matrix 4 . m 10 ] == 0 && val [ matrix 4 . m 01 ] == 0 && val [ matrix 4 . m 11 ] == 1 && val [ matrix 4 . m 03 ] == 0 && val [ matrix 4 . m 13 ] == 0 ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { final float [ ] val = matrix . get values ( ) ; return ( val [ matrix 4 . m 00 ] == 1 && val [ matrix 4 . m 10 ] == 0 && val [ matrix 4 . m 01 ] == 0 && val [ matrix 4 . m 11 ] == 1 && val [ matrix 4 . m 03 ] == 0 && val [ matrix 4 . m 13 ] == 0 ) ; } <SENTENCE_END/>

Original Name buffer,move

buffer

<SENTENCE_START> { if ( m move count == m move capacity ) { int [ ] old = m move buffer ; m move capacity *= 2 ; m move buffer = new int [ m move capacity ] ; system . arraycopy ( old , 0 , m move buffer , 0 , old . length ) ; } m move buffer [ m move count ] = proxy id ; ++ m move count ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { if ( m move count == m move capacity ) { int [ ] old = m move buffer ; m move capacity *= 2 ; m move buffer = new int [ m move capacity ] ; system . arraycopy ( old , 0 , m move buffer , 0 , old . length ) ; } m move buffer [ m move count ] = proxy id ; ++ m move count ; } <SENTENCE_END/>

move

<SENTENCE_START> { if ( m move count == m move capacity ) { int [ ] old = m move buffer ; m move capacity *= 2 ; m move buffer = new int [ m move capacity ] ; system . arraycopy ( old , 0 , m move buffer , 0 , old . length ) ; } m move buffer [ m move count ] = proxy id ; ++ m move count ; } <SENTENCE_END/>

(Copy Probability: 15.4%)

<SENTENCE_START> { if ( m move count == m move capacity ) { int [ ] old = m move buffer ; m move capacity *= 2 ; m move buffer = new int [ m move capacity ] ; system . arraycopy ( old , 0 , m move buffer , 0 , old . length ) ; } m move buffer [ m move count ] = proxy id ; ++ m move count ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( m move count == m move capacity ) { int [ ] old = m move buffer ; m move capacity *= 2 ; m move buffer = new int [ m move capacity ] ; system . arraycopy ( old , 0 , m move buffer , 0 , old . length ) ; } m move buffer [ m move count ] = proxy id ; ++ m move count ; } <SENTENCE_END/>

(Copy Probability: 5.6%)

<SENTENCE_START> { if ( m move count == m move capacity ) { int [ ] old = m move buffer ; m move capacity *= 2 ; m move buffer = new int [ m move capacity ] ; system . arraycopy ( old , 0 , m move buffer , 0 , old . length ) ; } m move buffer [ m move count ] = proxy id ; ++ m move count ; } <SENTENCE_END/>

Original Name unbuffer,move

unbuffer

<SENTENCE_START> { for ( int i = 0 ; i < m move count ; i ++ ) { if ( m move buffer [ i ] == proxy id ) { m move buffer [ i ] = null proxy ; } } } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { for ( int i = 0 ; i < m move count ; i ++ ) { if ( m move buffer [ i ] == proxy id ) { m move buffer [ i ] = null proxy ; } } } <SENTENCE_END/>

move

<SENTENCE_START> { for ( int i = 0 ; i < m move count ; i ++ ) { if ( m move buffer [ i ] == proxy id ) { m move buffer [ i ] = null proxy ; } } } <SENTENCE_END/>

(Copy Probability: 10.0%)

<SENTENCE_START> { for ( int i = 0 ; i < m move count ; i ++ ) { if ( m move buffer [ i ] == proxy id ) { m move buffer [ i ] = null proxy ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int i = 0 ; i < m move count ; i ++ ) { if ( m move buffer [ i ] == proxy id ) { m move buffer [ i ] = null proxy ; } } } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { for ( int i = 0 ; i < m move count ; i ++ ) { if ( m move buffer [ i ] == proxy id ) { m move buffer [ i ] = null proxy ; } } } <SENTENCE_END/>

Original Name tree,callback

tree

<SENTENCE_START> { if ( proxy id == m query proxy id ) { return true ; } if ( m pair count == m pair capacity ) { pair [ ] old buffer = m pair buffer ; m pair capacity *= 2 ; m pair buffer = new pair [ m pair capacity ] ; system . arraycopy ( old buffer , 0 , m pair buffer , 0 , old buffer . length ) ; for ( int i = old buffer . length ; i < m pair capacity ; i ++ ) { m pair buffer [ i ] = new pair ( ) ; } } if ( proxy id < m query proxy id ) { m pair buffer [ m pair count ] . proxy id a = proxy id ; m pair buffer [ m pair count ] . proxy id b = m query proxy id ; } else { m pair buffer [ m pair count ] . proxy id a = m query proxy id ; m pair buffer [ m pair count ] . proxy id b = proxy id ; } ++ m pair count ; return true ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { if ( proxy id == m query proxy id ) { return true ; } if ( m pair count == m pair capacity ) { pair [ ] old buffer = m pair buffer ; m pair capacity *= 2 ; m pair buffer = new pair [ m pair capacity ] ; system . arraycopy ( old buffer , 0 , m pair buffer , 0 , old buffer . length ) ; for ( int i = old buffer . length ; i < m pair capacity ; i ++ ) { m pair buffer [ i ] = new pair ( ) ; } } if ( proxy id < m query proxy id ) { m pair buffer [ m pair count ] . proxy id a = proxy id ; m pair buffer [ m pair count ] . proxy id b = m query proxy id ; } else { m pair buffer [ m pair count ] . proxy id a = m query proxy id ; m pair buffer [ m pair count ] . proxy id b = proxy id ; } ++ m pair count ; return true ; } <SENTENCE_END/>

callback

<SENTENCE_START> { if ( proxy id == m query proxy id ) { return true ; } if ( m pair count == m pair capacity ) { pair [ ] old buffer = m pair buffer ; m pair capacity *= 2 ; m pair buffer = new pair [ m pair capacity ] ; system . arraycopy ( old buffer , 0 , m pair buffer , 0 , old buffer . length ) ; for ( int i = old buffer . length ; i < m pair capacity ; i ++ ) { m pair buffer [ i ] = new pair ( ) ; } } if ( proxy id < m query proxy id ) { m pair buffer [ m pair count ] . proxy id a = proxy id ; m pair buffer [ m pair count ] . proxy id b = m query proxy id ; } else { m pair buffer [ m pair count ] . proxy id a = m query proxy id ; m pair buffer [ m pair count ] . proxy id b = proxy id ; } ++ m pair count ; return true ; } <SENTENCE_END/>

(Copy Probability: 25.4%)

<SENTENCE_START> { if ( proxy id == m query proxy id ) { return true ; } if ( m pair count == m pair capacity ) { pair [ ] old buffer = m pair buffer ; m pair capacity *= 2 ; m pair buffer = new pair [ m pair capacity ] ; system . arraycopy ( old buffer , 0 , m pair buffer , 0 , old buffer . length ) ; for ( int i = old buffer . length ; i < m pair capacity ; i ++ ) { m pair buffer [ i ] = new pair ( ) ; } } if ( proxy id < m query proxy id ) { m pair buffer [ m pair count ] . proxy id a = proxy id ; m pair buffer [ m pair count ] . proxy id b = m query proxy id ; } else { m pair buffer [ m pair count ] . proxy id a = m query proxy id ; m pair buffer [ m pair count ] . proxy id b = proxy id ; } ++ m pair count ; return true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( proxy id == m query proxy id ) { return true ; } if ( m pair count == m pair capacity ) { pair [ ] old buffer = m pair buffer ; m pair capacity *= 2 ; m pair buffer = new pair [ m pair capacity ] ; system . arraycopy ( old buffer , 0 , m pair buffer , 0 , old buffer . length ) ; for ( int i = old buffer . length ; i < m pair capacity ; i ++ ) { m pair buffer [ i ] = new pair ( ) ; } } if ( proxy id < m query proxy id ) { m pair buffer [ m pair count ] . proxy id a = proxy id ; m pair buffer [ m pair count ] . proxy id b = m query proxy id ; } else { m pair buffer [ m pair count ] . proxy id a = m query proxy id ; m pair buffer [ m pair count ] . proxy id b = proxy id ; } ++ m pair count ; return true ; } <SENTENCE_END/>

(Copy Probability: 13.2%)

<SENTENCE_START> { if ( proxy id == m query proxy id ) { return true ; } if ( m pair count == m pair capacity ) { pair [ ] old buffer = m pair buffer ; m pair capacity *= 2 ; m pair buffer = new pair [ m pair capacity ] ; system . arraycopy ( old buffer , 0 , m pair buffer , 0 , old buffer . length ) ; for ( int i = old buffer . length ; i < m pair capacity ; i ++ ) { m pair buffer [ i ] = new pair ( ) ; } } if ( proxy id < m query proxy id ) { m pair buffer [ m pair count ] . proxy id a = proxy id ; m pair buffer [ m pair count ] . proxy id b = m query proxy id ; } else { m pair buffer [ m pair count ] . proxy id a = m query proxy id ; m pair buffer [ m pair count ] . proxy id b = proxy id ; } ++ m pair count ; 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 convex,sweep,test

convex

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 0 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback , allowed ccd penetration ) ; } <SENTENCE_END/>

(Copy Probability: 10.0%)

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 0 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback , allowed ccd penetration ) ; } <SENTENCE_END/>

sweep

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 0 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback , allowed ccd penetration ) ; } <SENTENCE_END/>

(Copy Probability: 95.2%)

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 0 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback , allowed ccd penetration ) ; } <SENTENCE_END/>

test

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 0 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback , allowed ccd penetration ) ; } <SENTENCE_END/>

(Copy Probability: 74.8%)

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 0 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback , allowed ccd penetration ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 0 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback , allowed ccd penetration ) ; } <SENTENCE_END/>

(Copy Probability: 5.7%)

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 0 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback , allowed ccd penetration ) ; } <SENTENCE_END/>

Original Name convex,sweep,test

convex

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 1 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

(Copy Probability: 11.1%)

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 1 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

sweep

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 1 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

(Copy Probability: 96.7%)

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 1 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

test

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 1 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

(Copy Probability: 85.6%)

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 1 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 1 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

(Copy Probability: 5.6%)

<SENTENCE_START> { collision jni . bt ghost object convex sweep test swig 1 ( swig c ptr , this , bt convex shape . get c ptr ( cast shape ) , cast shape , convex from world , convex to world , convex result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

Original Name ray,test

ray

<SENTENCE_START> { collision jni . bt ghost object ray test ( swig c ptr , this , ray from world , ray to world , ray result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

(Copy Probability: 26.4%)

<SENTENCE_START> { collision jni . bt ghost object ray test ( swig c ptr , this , ray from world , ray to world , ray result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

test

<SENTENCE_START> { collision jni . bt ghost object ray test ( swig c ptr , this , ray from world , ray to world , ray result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

(Copy Probability: 95.6%)

<SENTENCE_START> { collision jni . bt ghost object ray test ( swig c ptr , this , ray from world , ray to world , ray result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt ghost object ray test ( swig c ptr , this , ray from world , ray to world , ray result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

(Copy Probability: 7.7%)

<SENTENCE_START> { collision jni . bt ghost object ray test ( swig c ptr , this , ray from world , ray to world , ray result callback . get c ptr ( result callback ) , result callback ) ; } <SENTENCE_END/>

Original Name add,overlapping,object,internal

add

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 13.3%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

overlapping

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

object

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

internal

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 91.2%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 8.7%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

Original Name add,overlapping,object,internal

add

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

(Copy Probability: 13.2%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

overlapping

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

object

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

internal

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

(Copy Probability: 92.8%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

(Copy Probability: 9.5%)

<SENTENCE_START> { collision jni . bt ghost object add overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy ) ; } <SENTENCE_END/>

Original Name remove,overlapping,object,internal

remove

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 13.2%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

overlapping

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

object

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

internal

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 82.4%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

(Copy Probability: 6.7%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 0 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher , bt broadphase proxy . get c ptr ( this proxy ) , this proxy ) ; } <SENTENCE_END/>

Original Name remove,overlapping,object,internal

remove

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

(Copy Probability: 13.0%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

overlapping

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

object

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

internal

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

(Copy Probability: 85.9%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

(Copy Probability: 7.4%)

<SENTENCE_START> { collision jni . bt ghost object remove overlapping object internal swig 1 ( swig c ptr , this , bt broadphase proxy . get c ptr ( other proxy ) , other proxy , bt dispatcher . get c ptr ( dispatcher ) , dispatcher ) ; } <SENTENCE_END/>

Original Name get,num,overlapping,objects

get

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

num

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

overlapping

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

objects

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 89.9%)

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 8.0%)

<SENTENCE_START> { return collision jni . bt ghost object get num overlapping objects ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name get,overlapping,object

get

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt ghost object get overlapping object swig 0 ( swig c ptr , this , index ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 8.4%)

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt ghost object get overlapping object swig 0 ( swig c ptr , this , index ) , false ) ; } <SENTENCE_END/>

overlapping

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt ghost object get overlapping object swig 0 ( swig c ptr , this , index ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt ghost object get overlapping object swig 0 ( swig c ptr , this , index ) , false ) ; } <SENTENCE_END/>

object

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt ghost object get overlapping object swig 0 ( swig c ptr , this , index ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt ghost object get overlapping object swig 0 ( swig c ptr , this , index ) , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt ghost object get overlapping object swig 0 ( swig c ptr , this , index ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 43.3%)

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt ghost object get overlapping object swig 0 ( swig c ptr , this , index ) , false ) ; } <SENTENCE_END/>

Original Name get,overlapping,pairs

get

<SENTENCE_START> { return new bt collision object array ( collision jni . bt ghost object get overlapping pairs swig 0 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 12.5%)

<SENTENCE_START> { return new bt collision object array ( collision jni . bt ghost object get overlapping pairs swig 0 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

overlapping

<SENTENCE_START> { return new bt collision object array ( collision jni . bt ghost object get overlapping pairs swig 0 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return new bt collision object array ( collision jni . bt ghost object get overlapping pairs swig 0 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

pairs

<SENTENCE_START> { return new bt collision object array ( collision jni . bt ghost object get overlapping pairs swig 0 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return new bt collision object array ( collision jni . bt ghost object get overlapping pairs swig 0 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new bt collision object array ( collision jni . bt ghost object get overlapping pairs swig 0 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 55.6%)

<SENTENCE_START> { return new bt collision object array ( collision jni . bt ghost object get overlapping pairs swig 0 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

Original Name upcast

upcast

<SENTENCE_START> { long c ptr = collision jni . bt ghost object upcast swig 0 ( bt collision object . get c ptr ( col obj ) , col obj ) ; return ( c ptr == 0 ) ? null : new bt ghost object ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 13.4%)

<SENTENCE_START> { long c ptr = collision jni . bt ghost object upcast swig 0 ( bt collision object . get c ptr ( col obj ) , col obj ) ; return ( c ptr == 0 ) ? null : new bt ghost object ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt ghost object upcast swig 0 ( bt collision object . get c ptr ( col obj ) , col obj ) ; return ( c ptr == 0 ) ? null : new bt ghost object ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 53.8%)

<SENTENCE_START> { long c ptr = collision jni . bt ghost object upcast swig 0 ( bt collision object . get c ptr ( col obj ) , col obj ) ; return ( c ptr == 0 ) ? null : new bt ghost object ( c ptr , 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,volume

set

<SENTENCE_START> { collision jni . bt dbvt node volume set ( swig c ptr , this , bt dbvt aabb mm . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { collision jni . bt dbvt node volume set ( swig c ptr , this , bt dbvt aabb mm . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

volume

<SENTENCE_START> { collision jni . bt dbvt node volume set ( swig c ptr , this , bt dbvt aabb mm . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 98.3%)

<SENTENCE_START> { collision jni . bt dbvt node volume set ( swig c ptr , this , bt dbvt aabb mm . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt dbvt node volume set ( swig c ptr , this , bt dbvt aabb mm . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { collision jni . bt dbvt node volume set ( swig c ptr , this , bt dbvt aabb mm . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

Original Name get,volume

get

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node volume get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt aabb mm ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node volume get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt aabb mm ( c ptr , false ) ; } <SENTENCE_END/>

volume

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node volume get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt aabb mm ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 98.5%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node volume get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt aabb mm ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node volume get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt aabb mm ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 8.6%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node volume get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt aabb mm ( c ptr , false ) ; } <SENTENCE_END/>

Original Name set,parent

set

<SENTENCE_START> { collision jni . bt dbvt node parent set ( swig c ptr , this , bt dbvt node . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { collision jni . bt dbvt node parent set ( swig c ptr , this , bt dbvt node . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

parent

<SENTENCE_START> { collision jni . bt dbvt node parent set ( swig c ptr , this , bt dbvt node . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { collision jni . bt dbvt node parent set ( swig c ptr , this , bt dbvt node . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt dbvt node parent set ( swig c ptr , this , bt dbvt node . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { collision jni . bt dbvt node parent set ( swig c ptr , this , bt dbvt node . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

Original Name get,parent

get

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node parent get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node parent get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

parent

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node parent get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node parent get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node parent get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node parent get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

Original Name isleaf

isleaf

<SENTENCE_START> { return collision jni . bt dbvt node isleaf ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { return collision jni . bt dbvt node isleaf ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt dbvt node isleaf ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 37.0%)

<SENTENCE_START> { return collision jni . bt dbvt node isleaf ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name isinternal

isinternal

<SENTENCE_START> { return collision jni . bt dbvt node isinternal ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { return collision jni . bt dbvt node isinternal ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt dbvt node isinternal ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 37.0%)

<SENTENCE_START> { return collision jni . bt dbvt node isinternal ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,childs

set

<SENTENCE_START> { collision jni . bt dbvt node childs set ( swig c ptr , this , swigtype p p bt dbvt node . get c ptr ( value ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { collision jni . bt dbvt node childs set ( swig c ptr , this , swigtype p p bt dbvt node . get c ptr ( value ) ) ; } <SENTENCE_END/>

childs

<SENTENCE_START> { collision jni . bt dbvt node childs set ( swig c ptr , this , swigtype p p bt dbvt node . get c ptr ( value ) ) ; } <SENTENCE_END/>

(Copy Probability: 97.4%)

<SENTENCE_START> { collision jni . bt dbvt node childs set ( swig c ptr , this , swigtype p p bt dbvt node . get c ptr ( value ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt dbvt node childs set ( swig c ptr , this , swigtype p p bt dbvt node . get c ptr ( value ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { collision jni . bt dbvt node childs set ( swig c ptr , this , swigtype p p bt dbvt node . get c ptr ( value ) ) ; } <SENTENCE_END/>

Original Name get,childs

get

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node childs get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node childs get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

childs

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node childs get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 97.5%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node childs get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node childs get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node childs get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

Original Name set,data

set

<SENTENCE_START> { collision jni . bt dbvt node data set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { collision jni . bt dbvt node data set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

data

<SENTENCE_START> { collision jni . bt dbvt node data set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 86.7%)

<SENTENCE_START> { collision jni . bt dbvt node data set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt dbvt node data set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { collision jni . bt dbvt node data set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,data

get

<SENTENCE_START> { return collision jni . bt dbvt node data get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return collision jni . bt dbvt node data get ( swig c ptr , this ) ; } <SENTENCE_END/>

data

<SENTENCE_START> { return collision jni . bt dbvt node data get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 94.7%)

<SENTENCE_START> { return collision jni . bt dbvt node data get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt dbvt node data get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return collision jni . bt dbvt node data get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name set,data,as,int

set

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

data

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

as

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 90.1%)

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

int

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { collision jni . bt dbvt node data as int set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,data,as,int

get

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

data

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

as

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 94.5%)

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

int

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { return collision jni . bt dbvt node data as int get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name get,child

get

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

Original Name get,child,0

get

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 0 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 0 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 0 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 0 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

0

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 0 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 75.3%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 0 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 0 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 0 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

Original Name get,child,1

get

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 1 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 1 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 1 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 1 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

1

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 1 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 89.8%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 1 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 1 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { long c ptr = collision jni . bt dbvt node get child 1 ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt dbvt node ( c ptr , 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 push,pair

push

<SENTENCE_START> { collision jni . bt pair set push pair ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { collision jni . bt pair set push pair ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

pair

<SENTENCE_START> { collision jni . bt pair set push pair ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

(Copy Probability: 98.4%)

<SENTENCE_START> { collision jni . bt pair set push pair ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt pair set push pair ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

(Copy Probability: 6.5%)

<SENTENCE_START> { collision jni . bt pair set push pair ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

Original Name push,pair,inv

push

<SENTENCE_START> { collision jni . bt pair set push pair inv ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

(Copy Probability: 5.7%)

<SENTENCE_START> { collision jni . bt pair set push pair inv ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

pair

<SENTENCE_START> { collision jni . bt pair set push pair inv ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { collision jni . bt pair set push pair inv ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

inv

<SENTENCE_START> { collision jni . bt pair set push pair inv ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

(Copy Probability: 95.2%)

<SENTENCE_START> { collision jni . bt pair set push pair inv ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt pair set push pair inv ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

(Copy Probability: 15.6%)

<SENTENCE_START> { collision jni . bt pair set push pair inv ( swig c ptr , this , index 1 , index 2 ) ; } <SENTENCE_END/>

Original Name set

set

<SENTENCE_START> { value . load ( scale influencer . value ) ; value channel descriptor = scale influencer . value channel descriptor ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { value . load ( scale influencer . value ) ; value channel descriptor = scale influencer . value channel descriptor ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { value . load ( scale influencer . value ) ; value channel descriptor = scale influencer . value channel descriptor ; } <SENTENCE_END/>

(Copy Probability: 65.8%)

<SENTENCE_START> { value . load ( scale influencer . value ) ; value channel descriptor = scale influencer . value channel descriptor ; } <SENTENCE_END/>

Original Name get,normal,impulses

get

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { normal impulses [ i ] = impulse . normal impulses [ i ] ; } return normal impulses ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { normal impulses [ i ] = impulse . normal impulses [ i ] ; } return normal impulses ; } <SENTENCE_END/>

normal

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { normal impulses [ i ] = impulse . normal impulses [ i ] ; } return normal impulses ; } <SENTENCE_END/>

(Copy Probability: 53.4%)

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { normal impulses [ i ] = impulse . normal impulses [ i ] ; } return normal impulses ; } <SENTENCE_END/>

impulses

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { normal impulses [ i ] = impulse . normal impulses [ i ] ; } return normal impulses ; } <SENTENCE_END/>

(Copy Probability: 8.8%)

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { normal impulses [ i ] = impulse . normal impulses [ i ] ; } return normal impulses ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { normal impulses [ i ] = impulse . normal impulses [ i ] ; } return normal impulses ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { normal impulses [ i ] = impulse . normal impulses [ i ] ; } return normal impulses ; } <SENTENCE_END/>

Original Name get,tangent,impulses

get

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { tangent impulses [ i ] = impulse . tangent impulses [ i ] ; } return tangent impulses ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { tangent impulses [ i ] = impulse . tangent impulses [ i ] ; } return tangent impulses ; } <SENTENCE_END/>

tangent

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { tangent impulses [ i ] = impulse . tangent impulses [ i ] ; } return tangent impulses ; } <SENTENCE_END/>

(Copy Probability: 61.0%)

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { tangent impulses [ i ] = impulse . tangent impulses [ i ] ; } return tangent impulses ; } <SENTENCE_END/>

impulses

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { tangent impulses [ i ] = impulse . tangent impulses [ i ] ; } return tangent impulses ; } <SENTENCE_END/>

(Copy Probability: 22.3%)

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { tangent impulses [ i ] = impulse . tangent impulses [ i ] ; } return tangent impulses ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { tangent impulses [ i ] = impulse . tangent impulses [ i ] ; } return tangent impulses ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { for ( int i = 0 ; i < impulse . count ; i ++ ) { tangent impulses [ i ] = impulse . tangent impulses [ i ] ; } return tangent impulses ; } <SENTENCE_END/>

Original Name get,count

get

<SENTENCE_START> { return impulse . count ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return impulse . count ; } <SENTENCE_END/>

count

<SENTENCE_START> { return impulse . count ; } <SENTENCE_END/>

(Copy Probability: 25.5%)

<SENTENCE_START> { return impulse . count ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return impulse . count ; } <SENTENCE_END/>

(Copy Probability: 21.7%)

<SENTENCE_START> { return impulse . count ; } <SENTENCE_END/>

Original Name get,texture

get

<SENTENCE_START> { return this . %SELF% ( first pass ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return this . %SELF% ( first pass ) ; } <SENTENCE_END/>

texture

<SENTENCE_START> { return this . %SELF% ( first pass ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return this . %SELF% ( first pass ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return this . %SELF% ( first pass ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return this . %SELF% ( first pass ) ; } <SENTENCE_END/>

Original Name is

is

<SENTENCE_START> { return ( mask & type ) == mask ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return ( mask & type ) == mask ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( mask & type ) == mask ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return ( mask & type ) == mask ; } <SENTENCE_END/>

Original Name get,display,modes

get

<SENTENCE_START> { graphics device device = graphics environment . get local graphics environment ( ) . get default screen device ( ) ; java . awt . display mode desktop mode = device . get display mode ( ) ; java . awt . display mode [ ] display modes = device . %SELF% ( ) ; array < display mode > modes = new array ( ) ; outer : for ( java . awt . display mode mode : display modes ) { for ( display mode other : modes ) if ( other . width == mode . get width ( ) && other . height == mode . get height ( ) && other . bits per pixel == mode . get bit depth ( ) ) continue outer ; if ( mode . get bit depth ( ) != desktop mode . get bit depth ( ) ) continue ; modes . add ( new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ) ; } return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { graphics device device = graphics environment . get local graphics environment ( ) . get default screen device ( ) ; java . awt . display mode desktop mode = device . get display mode ( ) ; java . awt . display mode [ ] display modes = device . %SELF% ( ) ; array < display mode > modes = new array ( ) ; outer : for ( java . awt . display mode mode : display modes ) { for ( display mode other : modes ) if ( other . width == mode . get width ( ) && other . height == mode . get height ( ) && other . bits per pixel == mode . get bit depth ( ) ) continue outer ; if ( mode . get bit depth ( ) != desktop mode . get bit depth ( ) ) continue ; modes . add ( new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ) ; } return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

display

<SENTENCE_START> { graphics device device = graphics environment . get local graphics environment ( ) . get default screen device ( ) ; java . awt . display mode desktop mode = device . get display mode ( ) ; java . awt . display mode [ ] display modes = device . %SELF% ( ) ; array < display mode > modes = new array ( ) ; outer : for ( java . awt . display mode mode : display modes ) { for ( display mode other : modes ) if ( other . width == mode . get width ( ) && other . height == mode . get height ( ) && other . bits per pixel == mode . get bit depth ( ) ) continue outer ; if ( mode . get bit depth ( ) != desktop mode . get bit depth ( ) ) continue ; modes . add ( new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ) ; } return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

(Copy Probability: 26.4%)

<SENTENCE_START> { graphics device device = graphics environment . get local graphics environment ( ) . get default screen device ( ) ; java . awt . display mode desktop mode = device . get display mode ( ) ; java . awt . display mode [ ] display modes = device . %SELF% ( ) ; array < display mode > modes = new array ( ) ; outer : for ( java . awt . display mode mode : display modes ) { for ( display mode other : modes ) if ( other . width == mode . get width ( ) && other . height == mode . get height ( ) && other . bits per pixel == mode . get bit depth ( ) ) continue outer ; if ( mode . get bit depth ( ) != desktop mode . get bit depth ( ) ) continue ; modes . add ( new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ) ; } return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

modes

<SENTENCE_START> { graphics device device = graphics environment . get local graphics environment ( ) . get default screen device ( ) ; java . awt . display mode desktop mode = device . get display mode ( ) ; java . awt . display mode [ ] display modes = device . %SELF% ( ) ; array < display mode > modes = new array ( ) ; outer : for ( java . awt . display mode mode : display modes ) { for ( display mode other : modes ) if ( other . width == mode . get width ( ) && other . height == mode . get height ( ) && other . bits per pixel == mode . get bit depth ( ) ) continue outer ; if ( mode . get bit depth ( ) != desktop mode . get bit depth ( ) ) continue ; modes . add ( new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ) ; } return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

(Copy Probability: 34.3%)

<SENTENCE_START> { graphics device device = graphics environment . get local graphics environment ( ) . get default screen device ( ) ; java . awt . display mode desktop mode = device . get display mode ( ) ; java . awt . display mode [ ] display modes = device . %SELF% ( ) ; array < display mode > modes = new array ( ) ; outer : for ( java . awt . display mode mode : display modes ) { for ( display mode other : modes ) if ( other . width == mode . get width ( ) && other . height == mode . get height ( ) && other . bits per pixel == mode . get bit depth ( ) ) continue outer ; if ( mode . get bit depth ( ) != desktop mode . get bit depth ( ) ) continue ; modes . add ( new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ) ; } return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { graphics device device = graphics environment . get local graphics environment ( ) . get default screen device ( ) ; java . awt . display mode desktop mode = device . get display mode ( ) ; java . awt . display mode [ ] display modes = device . %SELF% ( ) ; array < display mode > modes = new array ( ) ; outer : for ( java . awt . display mode mode : display modes ) { for ( display mode other : modes ) if ( other . width == mode . get width ( ) && other . height == mode . get height ( ) && other . bits per pixel == mode . get bit depth ( ) ) continue outer ; if ( mode . get bit depth ( ) != desktop mode . get bit depth ( ) ) continue ; modes . add ( new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ) ; } return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

(Copy Probability: 7.9%)

<SENTENCE_START> { graphics device device = graphics environment . get local graphics environment ( ) . get default screen device ( ) ; java . awt . display mode desktop mode = device . get display mode ( ) ; java . awt . display mode [ ] display modes = device . %SELF% ( ) ; array < display mode > modes = new array ( ) ; outer : for ( java . awt . display mode mode : display modes ) { for ( display mode other : modes ) if ( other . width == mode . get width ( ) && other . height == mode . get height ( ) && other . bits per pixel == mode . get bit depth ( ) ) continue outer ; if ( mode . get bit depth ( ) != desktop mode . get bit depth ( ) ) continue ; modes . add ( new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ) ; } return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

Original Name get,desktop,display,mode

get

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

desktop

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 51.6%)

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

display

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 67.8%)

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

mode

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 20.6%)

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { java . awt . display mode mode = graphics environment . get local graphics environment ( ) . get default screen device ( ) . get display mode ( ) ; return new jglfw display mode ( mode . get width ( ) , mode . get height ( ) , mode . get refresh rate ( ) , mode . get bit depth ( ) ) ; } <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 size

size

<SENTENCE_START> { return collision jni . bt collision object array size ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { return collision jni . bt collision object array size ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt collision object array size ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 15.1%)

<SENTENCE_START> { return collision jni . bt collision object array size ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name at

at

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt collision object array at swig 0 ( swig c ptr , this , n ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 13.8%)

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt collision object array at swig 0 ( swig c ptr , this , n ) , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt collision object array at swig 0 ( swig c ptr , this , n ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 74.3%)

<SENTENCE_START> { return bt collision object . get instance ( collision jni . bt collision object array at swig 0 ( swig c ptr , this , n ) , false ) ; } <SENTENCE_END/>

Original Name clear

clear

<SENTENCE_START> { collision jni . bt collision object array clear ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { collision jni . bt collision object array clear ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array clear ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 14.7%)

<SENTENCE_START> { collision jni . bt collision object array clear ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name pop,back

pop

<SENTENCE_START> { collision jni . bt collision object array pop back ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 18.0%)

<SENTENCE_START> { collision jni . bt collision object array pop back ( swig c ptr , this ) ; } <SENTENCE_END/>

back

<SENTENCE_START> { collision jni . bt collision object array pop back ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 98.2%)

<SENTENCE_START> { collision jni . bt collision object array pop back ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array pop back ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 9.5%)

<SENTENCE_START> { collision jni . bt collision object array pop back ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name resize,no,initialize

resize

<SENTENCE_START> { collision jni . bt collision object array resize no initialize ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

(Copy Probability: 5.9%)

<SENTENCE_START> { collision jni . bt collision object array resize no initialize ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

no

<SENTENCE_START> { collision jni . bt collision object array resize no initialize ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { collision jni . bt collision object array resize no initialize ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

initialize

<SENTENCE_START> { collision jni . bt collision object array resize no initialize ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

(Copy Probability: 98.4%)

<SENTENCE_START> { collision jni . bt collision object array resize no initialize ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array resize no initialize ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

(Copy Probability: 5.7%)

<SENTENCE_START> { collision jni . bt collision object array resize no initialize ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

Original Name resize

resize

<SENTENCE_START> { collision jni . bt collision object array resize swig 0 ( swig c ptr , this , newsize , bt collision object . get c ptr ( fill data ) , fill data ) ; } <SENTENCE_END/>

(Copy Probability: 12.2%)

<SENTENCE_START> { collision jni . bt collision object array resize swig 0 ( swig c ptr , this , newsize , bt collision object . get c ptr ( fill data ) , fill data ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array resize swig 0 ( swig c ptr , this , newsize , bt collision object . get c ptr ( fill data ) , fill data ) ; } <SENTENCE_END/>

(Copy Probability: 33.3%)

<SENTENCE_START> { collision jni . bt collision object array resize swig 0 ( swig c ptr , this , newsize , bt collision object . get c ptr ( fill data ) , fill data ) ; } <SENTENCE_END/>

Original Name resize

resize

<SENTENCE_START> { collision jni . bt collision object array resize swig 1 ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

(Copy Probability: 13.5%)

<SENTENCE_START> { collision jni . bt collision object array resize swig 1 ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array resize swig 1 ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

(Copy Probability: 29.1%)

<SENTENCE_START> { collision jni . bt collision object array resize swig 1 ( swig c ptr , this , newsize ) ; } <SENTENCE_END/>

Original Name expand,non,initializing

expand

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand non initializing ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 18.2%)

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand non initializing ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

non

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand non initializing ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand non initializing ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

initializing

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand non initializing ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 98.3%)

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand non initializing ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand non initializing ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 7.8%)

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand non initializing ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

Original Name expand

expand

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand swig 0 ( swig c ptr , this , bt collision object . get c ptr ( fill value ) , fill value ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 17.4%)

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand swig 0 ( swig c ptr , this , bt collision object . get c ptr ( fill value ) , fill value ) , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand swig 0 ( swig c ptr , this , bt collision object . get c ptr ( fill value ) , fill value ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 34.8%)

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand swig 0 ( swig c ptr , this , bt collision object . get c ptr ( fill value ) , fill value ) , false ) ; } <SENTENCE_END/>

Original Name expand

expand

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand swig 1 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 20.5%)

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand swig 1 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand swig 1 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 30.4%)

<SENTENCE_START> { return new swigtype p p bt collision object ( collision jni . bt collision object array expand swig 1 ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

Original Name push,back

push

<SENTENCE_START> { collision jni . bt collision object array push back ( swig c ptr , this , bt collision object . get c ptr ( val ) , val ) ; } <SENTENCE_END/>

(Copy Probability: 22.8%)

<SENTENCE_START> { collision jni . bt collision object array push back ( swig c ptr , this , bt collision object . get c ptr ( val ) , val ) ; } <SENTENCE_END/>

back

<SENTENCE_START> { collision jni . bt collision object array push back ( swig c ptr , this , bt collision object . get c ptr ( val ) , val ) ; } <SENTENCE_END/>

(Copy Probability: 98.6%)

<SENTENCE_START> { collision jni . bt collision object array push back ( swig c ptr , this , bt collision object . get c ptr ( val ) , val ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array push back ( swig c ptr , this , bt collision object . get c ptr ( val ) , val ) ; } <SENTENCE_END/>

(Copy Probability: 7.3%)

<SENTENCE_START> { collision jni . bt collision object array push back ( swig c ptr , this , bt collision object . get c ptr ( val ) , val ) ; } <SENTENCE_END/>

Original Name capacity

capacity

<SENTENCE_START> { return collision jni . bt collision object array capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 6.6%)

<SENTENCE_START> { return collision jni . bt collision object array capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt collision object array capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 26.0%)

<SENTENCE_START> { return collision jni . bt collision object array capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name reserve

reserve

<SENTENCE_START> { collision jni . bt collision object array reserve ( swig c ptr , this , count ) ; } <SENTENCE_END/>

(Copy Probability: 21.3%)

<SENTENCE_START> { collision jni . bt collision object array reserve ( swig c ptr , this , count ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array reserve ( swig c ptr , this , count ) ; } <SENTENCE_END/>

(Copy Probability: 13.4%)

<SENTENCE_START> { collision jni . bt collision object array reserve ( swig c ptr , this , count ) ; } <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 swap

swap

<SENTENCE_START> { collision jni . bt collision object array swap ( swig c ptr , this , index 0 , index 1 ) ; } <SENTENCE_END/>

(Copy Probability: 9.7%)

<SENTENCE_START> { collision jni . bt collision object array swap ( swig c ptr , this , index 0 , index 1 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array swap ( swig c ptr , this , index 0 , index 1 ) ; } <SENTENCE_END/>

(Copy Probability: 25.3%)

<SENTENCE_START> { collision jni . bt collision object array swap ( swig c ptr , this , index 0 , index 1 ) ; } <SENTENCE_END/>

Original Name find,binary,search

find

<SENTENCE_START> { return collision jni . bt collision object array find binary search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 12.5%)

<SENTENCE_START> { return collision jni . bt collision object array find binary search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

binary

<SENTENCE_START> { return collision jni . bt collision object array find binary search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt collision object array find binary search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

search

<SENTENCE_START> { return collision jni . bt collision object array find binary search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { return collision jni . bt collision object array find binary search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt collision object array find binary search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 10.5%)

<SENTENCE_START> { return collision jni . bt collision object array find binary search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

Original Name find,linear,search

find

<SENTENCE_START> { return collision jni . bt collision object array find linear search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 11.2%)

<SENTENCE_START> { return collision jni . bt collision object array find linear search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

linear

<SENTENCE_START> { return collision jni . bt collision object array find linear search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt collision object array find linear search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

search

<SENTENCE_START> { return collision jni . bt collision object array find linear search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { return collision jni . bt collision object array find linear search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt collision object array find linear search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 38.0%)

<SENTENCE_START> { return collision jni . bt collision object array find linear search ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

Original Name remove

remove

<SENTENCE_START> { collision jni . bt collision object array remove ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 9.2%)

<SENTENCE_START> { collision jni . bt collision object array remove ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array remove ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

(Copy Probability: 21.8%)

<SENTENCE_START> { collision jni . bt collision object array remove ( swig c ptr , this , bt collision object . get c ptr ( key ) , key ) ; } <SENTENCE_END/>

Original Name initialize,from,buffer

initialize

<SENTENCE_START> { collision jni . bt collision object array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

(Copy Probability: 6.3%)

<SENTENCE_START> { collision jni . bt collision object array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

from

<SENTENCE_START> { collision jni . bt collision object array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt collision object array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

buffer

<SENTENCE_START> { collision jni . bt collision object array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { collision jni . bt collision object array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

(Copy Probability: 34.0%)

<SENTENCE_START> { collision jni . bt collision object array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

Original Name copy,from,array

copy

<SENTENCE_START> { collision jni . bt collision object array copy from array ( swig c ptr , this , bt collision object array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

(Copy Probability: 6.2%)

<SENTENCE_START> { collision jni . bt collision object array copy from array ( swig c ptr , this , bt collision object array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

from

<SENTENCE_START> { collision jni . bt collision object array copy from array ( swig c ptr , this , bt collision object array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { collision jni . bt collision object array copy from array ( swig c ptr , this , bt collision object array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { collision jni . bt collision object array copy from array ( swig c ptr , this , bt collision object array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { collision jni . bt collision object array copy from array ( swig c ptr , this , bt collision object array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object array copy from array ( swig c ptr , this , bt collision object array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

(Copy Probability: 24.9%)

<SENTENCE_START> { collision jni . bt collision object array copy from array ( swig c ptr , this , bt collision object array . get c ptr ( other array ) , other array ) ; } <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 create,window

create

<SENTENCE_START> { if ( fullscreen && fullscreen monitor == 0 ) fullscreen monitor = get window monitor ( ) ; glfw window hint ( glfw visible , 0 ) ; glfw window hint ( glfw resizable , resizable ? 1 : 0 ) ; glfw window hint ( glfw undecorated , undecorated ? 1 : 0 ) ; glfw window hint ( glfw red bits , buffer format . r ) ; glfw window hint ( glfw green bits , buffer format . g ) ; glfw window hint ( glfw blue bits , buffer format . b ) ; glfw window hint ( glfw alpha bits , buffer format . a ) ; glfw window hint ( glfw depth bits , buffer format . depth ) ; glfw window hint ( glfw stencil bits , buffer format . stencil ) ; glfw window hint ( glfw samples , buffer format . samples ) ; boolean mouse captured = window != 0 && glfw get input mode ( window , glfw cursor mode ) == glfw cursor captured ; long old window = window ; long new window = glfw create window ( width , height , title , fullscreen ? fullscreen monitor : 0 , old window ) ; if ( new window == 0 ) return false ; if ( old window != 0 ) glfw destroy window ( old window ) ; window = new window ; this . width = math . max ( 1 , width ) ; this . height = math . max ( 1 , height ) ; this . fullscreen = fullscreen ; if ( ! fullscreen ) { if ( x == - 1 || y == - 1 ) { display mode mode = get desktop display mode ( ) ; x = ( mode . width - width ) / 2 ; y = ( mode . height - height ) / 2 ; } glfw set window pos ( window , x , y ) ; } if ( ! mouse captured ) glfw set input mode ( window , glfw cursor mode , glfw cursor normal ) ; glfw make context current ( new window ) ; set v sync ( v sync ) ; if ( visible ) glfw show window ( window ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { if ( fullscreen && fullscreen monitor == 0 ) fullscreen monitor = get window monitor ( ) ; glfw window hint ( glfw visible , 0 ) ; glfw window hint ( glfw resizable , resizable ? 1 : 0 ) ; glfw window hint ( glfw undecorated , undecorated ? 1 : 0 ) ; glfw window hint ( glfw red bits , buffer format . r ) ; glfw window hint ( glfw green bits , buffer format . g ) ; glfw window hint ( glfw blue bits , buffer format . b ) ; glfw window hint ( glfw alpha bits , buffer format . a ) ; glfw window hint ( glfw depth bits , buffer format . depth ) ; glfw window hint ( glfw stencil bits , buffer format . stencil ) ; glfw window hint ( glfw samples , buffer format . samples ) ; boolean mouse captured = window != 0 && glfw get input mode ( window , glfw cursor mode ) == glfw cursor captured ; long old window = window ; long new window = glfw create window ( width , height , title , fullscreen ? fullscreen monitor : 0 , old window ) ; if ( new window == 0 ) return false ; if ( old window != 0 ) glfw destroy window ( old window ) ; window = new window ; this . width = math . max ( 1 , width ) ; this . height = math . max ( 1 , height ) ; this . fullscreen = fullscreen ; if ( ! fullscreen ) { if ( x == - 1 || y == - 1 ) { display mode mode = get desktop display mode ( ) ; x = ( mode . width - width ) / 2 ; y = ( mode . height - height ) / 2 ; } glfw set window pos ( window , x , y ) ; } if ( ! mouse captured ) glfw set input mode ( window , glfw cursor mode , glfw cursor normal ) ; glfw make context current ( new window ) ; set v sync ( v sync ) ; if ( visible ) glfw show window ( window ) ; return true ; } <SENTENCE_END/>

window

<SENTENCE_START> { if ( fullscreen && fullscreen monitor == 0 ) fullscreen monitor = get window monitor ( ) ; glfw window hint ( glfw visible , 0 ) ; glfw window hint ( glfw resizable , resizable ? 1 : 0 ) ; glfw window hint ( glfw undecorated , undecorated ? 1 : 0 ) ; glfw window hint ( glfw red bits , buffer format . r ) ; glfw window hint ( glfw green bits , buffer format . g ) ; glfw window hint ( glfw blue bits , buffer format . b ) ; glfw window hint ( glfw alpha bits , buffer format . a ) ; glfw window hint ( glfw depth bits , buffer format . depth ) ; glfw window hint ( glfw stencil bits , buffer format . stencil ) ; glfw window hint ( glfw samples , buffer format . samples ) ; boolean mouse captured = window != 0 && glfw get input mode ( window , glfw cursor mode ) == glfw cursor captured ; long old window = window ; long new window = glfw create window ( width , height , title , fullscreen ? fullscreen monitor : 0 , old window ) ; if ( new window == 0 ) return false ; if ( old window != 0 ) glfw destroy window ( old window ) ; window = new window ; this . width = math . max ( 1 , width ) ; this . height = math . max ( 1 , height ) ; this . fullscreen = fullscreen ; if ( ! fullscreen ) { if ( x == - 1 || y == - 1 ) { display mode mode = get desktop display mode ( ) ; x = ( mode . width - width ) / 2 ; y = ( mode . height - height ) / 2 ; } glfw set window pos ( window , x , y ) ; } if ( ! mouse captured ) glfw set input mode ( window , glfw cursor mode , glfw cursor normal ) ; glfw make context current ( new window ) ; set v sync ( v sync ) ; if ( visible ) glfw show window ( window ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 18.1%)

<SENTENCE_START> { if ( fullscreen && fullscreen monitor == 0 ) fullscreen monitor = get window monitor ( ) ; glfw window hint ( glfw visible , 0 ) ; glfw window hint ( glfw resizable , resizable ? 1 : 0 ) ; glfw window hint ( glfw undecorated , undecorated ? 1 : 0 ) ; glfw window hint ( glfw red bits , buffer format . r ) ; glfw window hint ( glfw green bits , buffer format . g ) ; glfw window hint ( glfw blue bits , buffer format . b ) ; glfw window hint ( glfw alpha bits , buffer format . a ) ; glfw window hint ( glfw depth bits , buffer format . depth ) ; glfw window hint ( glfw stencil bits , buffer format . stencil ) ; glfw window hint ( glfw samples , buffer format . samples ) ; boolean mouse captured = window != 0 && glfw get input mode ( window , glfw cursor mode ) == glfw cursor captured ; long old window = window ; long new window = glfw create window ( width , height , title , fullscreen ? fullscreen monitor : 0 , old window ) ; if ( new window == 0 ) return false ; if ( old window != 0 ) glfw destroy window ( old window ) ; window = new window ; this . width = math . max ( 1 , width ) ; this . height = math . max ( 1 , height ) ; this . fullscreen = fullscreen ; if ( ! fullscreen ) { if ( x == - 1 || y == - 1 ) { display mode mode = get desktop display mode ( ) ; x = ( mode . width - width ) / 2 ; y = ( mode . height - height ) / 2 ; } glfw set window pos ( window , x , y ) ; } if ( ! mouse captured ) glfw set input mode ( window , glfw cursor mode , glfw cursor normal ) ; glfw make context current ( new window ) ; set v sync ( v sync ) ; if ( visible ) glfw show window ( window ) ; return true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( fullscreen && fullscreen monitor == 0 ) fullscreen monitor = get window monitor ( ) ; glfw window hint ( glfw visible , 0 ) ; glfw window hint ( glfw resizable , resizable ? 1 : 0 ) ; glfw window hint ( glfw undecorated , undecorated ? 1 : 0 ) ; glfw window hint ( glfw red bits , buffer format . r ) ; glfw window hint ( glfw green bits , buffer format . g ) ; glfw window hint ( glfw blue bits , buffer format . b ) ; glfw window hint ( glfw alpha bits , buffer format . a ) ; glfw window hint ( glfw depth bits , buffer format . depth ) ; glfw window hint ( glfw stencil bits , buffer format . stencil ) ; glfw window hint ( glfw samples , buffer format . samples ) ; boolean mouse captured = window != 0 && glfw get input mode ( window , glfw cursor mode ) == glfw cursor captured ; long old window = window ; long new window = glfw create window ( width , height , title , fullscreen ? fullscreen monitor : 0 , old window ) ; if ( new window == 0 ) return false ; if ( old window != 0 ) glfw destroy window ( old window ) ; window = new window ; this . width = math . max ( 1 , width ) ; this . height = math . max ( 1 , height ) ; this . fullscreen = fullscreen ; if ( ! fullscreen ) { if ( x == - 1 || y == - 1 ) { display mode mode = get desktop display mode ( ) ; x = ( mode . width - width ) / 2 ; y = ( mode . height - height ) / 2 ; } glfw set window pos ( window , x , y ) ; } if ( ! mouse captured ) glfw set input mode ( window , glfw cursor mode , glfw cursor normal ) ; glfw make context current ( new window ) ; set v sync ( v sync ) ; if ( visible ) glfw show window ( window ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 21.9%)

<SENTENCE_START> { if ( fullscreen && fullscreen monitor == 0 ) fullscreen monitor = get window monitor ( ) ; glfw window hint ( glfw visible , 0 ) ; glfw window hint ( glfw resizable , resizable ? 1 : 0 ) ; glfw window hint ( glfw undecorated , undecorated ? 1 : 0 ) ; glfw window hint ( glfw red bits , buffer format . r ) ; glfw window hint ( glfw green bits , buffer format . g ) ; glfw window hint ( glfw blue bits , buffer format . b ) ; glfw window hint ( glfw alpha bits , buffer format . a ) ; glfw window hint ( glfw depth bits , buffer format . depth ) ; glfw window hint ( glfw stencil bits , buffer format . stencil ) ; glfw window hint ( glfw samples , buffer format . samples ) ; boolean mouse captured = window != 0 && glfw get input mode ( window , glfw cursor mode ) == glfw cursor captured ; long old window = window ; long new window = glfw create window ( width , height , title , fullscreen ? fullscreen monitor : 0 , old window ) ; if ( new window == 0 ) return false ; if ( old window != 0 ) glfw destroy window ( old window ) ; window = new window ; this . width = math . max ( 1 , width ) ; this . height = math . max ( 1 , height ) ; this . fullscreen = fullscreen ; if ( ! fullscreen ) { if ( x == - 1 || y == - 1 ) { display mode mode = get desktop display mode ( ) ; x = ( mode . width - width ) / 2 ; y = ( mode . height - height ) / 2 ; } glfw set window pos ( window , x , y ) ; } if ( ! mouse captured ) glfw set input mode ( window , glfw cursor mode , glfw cursor normal ) ; glfw make context current ( new window ) ; set v sync ( v sync ) ; if ( visible ) glfw show window ( window ) ; return true ; } <SENTENCE_END/>

Original Name frame,start

frame

<SENTENCE_START> { if ( last time == - 1 ) last time = time ; delta time = ( time - last time ) / 1000000000.0f ; last time = time ; if ( time - %SELF% >= 1000000000 ) { fps = frames ; frames = 0 ; %SELF% = time ; } frames ++ ; frame id ++ ; } <SENTENCE_END/>

(Copy Probability: 6.3%)

<SENTENCE_START> { if ( last time == - 1 ) last time = time ; delta time = ( time - last time ) / 1000000000.0f ; last time = time ; if ( time - %SELF% >= 1000000000 ) { fps = frames ; frames = 0 ; %SELF% = time ; } frames ++ ; frame id ++ ; } <SENTENCE_END/>

start

<SENTENCE_START> { if ( last time == - 1 ) last time = time ; delta time = ( time - last time ) / 1000000000.0f ; last time = time ; if ( time - %SELF% >= 1000000000 ) { fps = frames ; frames = 0 ; %SELF% = time ; } frames ++ ; frame id ++ ; } <SENTENCE_END/>

(Copy Probability: 21.3%)

<SENTENCE_START> { if ( last time == - 1 ) last time = time ; delta time = ( time - last time ) / 1000000000.0f ; last time = time ; if ( time - %SELF% >= 1000000000 ) { fps = frames ; frames = 0 ; %SELF% = time ; } frames ++ ; frame id ++ ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( last time == - 1 ) last time = time ; delta time = ( time - last time ) / 1000000000.0f ; last time = time ; if ( time - %SELF% >= 1000000000 ) { fps = frames ; frames = 0 ; %SELF% = time ; } frames ++ ; frame id ++ ; } <SENTENCE_END/>

(Copy Probability: 7.3%)

<SENTENCE_START> { if ( last time == - 1 ) last time = time ; delta time = ( time - last time ) / 1000000000.0f ; last time = time ; if ( time - %SELF% >= 1000000000 ) { fps = frames ; frames = 0 ; %SELF% = time ; } frames ++ ; frame id ++ ; } <SENTENCE_END/>

Original Name size,changed

size

<SENTENCE_START> { if ( is mac ) { glfw show window ( window ) ; } width = math . max ( 1 , width ) ; height = math . max ( 1 , height ) ; this . width = width ; this . height = height ; gdx . gl . gl viewport ( 0 , 0 , width , height ) ; application listener listener = gdx . app . get application listener ( ) ; if ( listener != null ) listener . resize ( width , height ) ; request rendering ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( is mac ) { glfw show window ( window ) ; } width = math . max ( 1 , width ) ; height = math . max ( 1 , height ) ; this . width = width ; this . height = height ; gdx . gl . gl viewport ( 0 , 0 , width , height ) ; application listener listener = gdx . app . get application listener ( ) ; if ( listener != null ) listener . resize ( width , height ) ; request rendering ( ) ; } <SENTENCE_END/>

changed

<SENTENCE_START> { if ( is mac ) { glfw show window ( window ) ; } width = math . max ( 1 , width ) ; height = math . max ( 1 , height ) ; this . width = width ; this . height = height ; gdx . gl . gl viewport ( 0 , 0 , width , height ) ; application listener listener = gdx . app . get application listener ( ) ; if ( listener != null ) listener . resize ( width , height ) ; request rendering ( ) ; } <SENTENCE_END/>

(Copy Probability: 5.8%)

<SENTENCE_START> { if ( is mac ) { glfw show window ( window ) ; } width = math . max ( 1 , width ) ; height = math . max ( 1 , height ) ; this . width = width ; this . height = height ; gdx . gl . gl viewport ( 0 , 0 , width , height ) ; application listener listener = gdx . app . get application listener ( ) ; if ( listener != null ) listener . resize ( width , height ) ; request rendering ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( is mac ) { glfw show window ( window ) ; } width = math . max ( 1 , width ) ; height = math . max ( 1 , height ) ; this . width = width ; this . height = height ; gdx . gl . gl viewport ( 0 , 0 , width , height ) ; application listener listener = gdx . app . get application listener ( ) ; if ( listener != null ) listener . resize ( width , height ) ; request rendering ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { if ( is mac ) { glfw show window ( window ) ; } width = math . max ( 1 , width ) ; height = math . max ( 1 , height ) ; this . width = width ; this . height = height ; gdx . gl . gl viewport ( 0 , 0 , width , height ) ; application listener listener = gdx . app . get application listener ( ) ; if ( listener != null ) listener . resize ( width , height ) ; request rendering ( ) ; } <SENTENCE_END/>

Original Name position,changed

position

<SENTENCE_START> { this . x = x ; this . y = y ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { this . x = x ; this . y = y ; } <SENTENCE_END/>

changed

<SENTENCE_START> { this . x = x ; this . y = y ; } <SENTENCE_END/>

(Copy Probability: 10.2%)

<SENTENCE_START> { this . x = x ; this . y = y ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . x = x ; this . y = y ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { this . x = x ; this . y = y ; } <SENTENCE_END/>

Original Name is,gl,20,available

is

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

gl

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

20

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

available

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { return gl 20 != null ; } <SENTENCE_END/>

Original Name get,gl,20

get

<SENTENCE_START> { return gl 20 ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return gl 20 ; } <SENTENCE_END/>

gl

<SENTENCE_START> { return gl 20 ; } <SENTENCE_END/>

(Copy Probability: 14.4%)

<SENTENCE_START> { return gl 20 ; } <SENTENCE_END/>

20

<SENTENCE_START> { return gl 20 ; } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { return gl 20 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return gl 20 ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return gl 20 ; } <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,frame,id

get

<SENTENCE_START> { return frame id ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return frame id ; } <SENTENCE_END/>

frame

<SENTENCE_START> { return frame id ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { return frame id ; } <SENTENCE_END/>

id

<SENTENCE_START> { return frame id ; } <SENTENCE_END/>

(Copy Probability: 96.6%)

<SENTENCE_START> { return frame id ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return frame id ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { return frame id ; } <SENTENCE_END/>

Original Name get,delta,time

get

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

delta

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 97.6%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

time

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 96.0%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 10.5%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

Original Name get,raw,delta,time

get

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

raw

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 97.6%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

delta

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 96.0%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

time

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 21.1%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { return delta time ; } <SENTENCE_END/>

Original Name get,frames,per,second

get

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

(Copy Probability: 0.3%)

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

frames

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

(Copy Probability: 88.0%)

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

per

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

(Copy Probability: 1.9%)

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

second

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

(Copy Probability: 0.2%)

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

%END%

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

(Copy Probability: 1.9%)

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

Original Name get,type

get

<SENTENCE_START> { return graphics type . jglfw ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return graphics type . jglfw ; } <SENTENCE_END/>

type

<SENTENCE_START> { return graphics type . jglfw ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return graphics type . jglfw ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return graphics type . jglfw ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return graphics type . jglfw ; } <SENTENCE_END/>

Original Name get,ppi,x

get

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

ppi

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

(Copy Probability: 19.6%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

x

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

Original Name get,ppi,y

get

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

ppi

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

(Copy Probability: 19.6%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

y

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) ; } <SENTENCE_END/>

Original Name get,ppc,x

get

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

ppc

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

(Copy Probability: 8.1%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

x

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

Original Name get,ppc,y

get

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

ppc

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

(Copy Probability: 8.1%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

y

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 2.54f ; } <SENTENCE_END/>

Original Name get,density

get

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 160f ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 160f ; } <SENTENCE_END/>

density

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 160f ; } <SENTENCE_END/>

(Copy Probability: 8.1%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 160f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 160f ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return toolkit . get default toolkit ( ) . get screen resolution ( ) / 160f ; } <SENTENCE_END/>

Original Name supports,display,mode,change

supports

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

(Copy Probability: 0.2%)

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

display

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

(Copy Probability: 0.2%)

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

mode

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

(Copy Probability: 0.1%)

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

change

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

(Copy Probability: 0.3%)

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

%END%

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

(Copy Probability: 2.6%)

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

Original Name get,window,monitor

get

<SENTENCE_START> { if ( window != 0 ) { long monitor = glfw get window monitor ( window ) ; if ( monitor != 0 ) return monitor ; } return glfw get primary monitor ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { if ( window != 0 ) { long monitor = glfw get window monitor ( window ) ; if ( monitor != 0 ) return monitor ; } return glfw get primary monitor ( ) ; } <SENTENCE_END/>

window

<SENTENCE_START> { if ( window != 0 ) { long monitor = glfw get window monitor ( window ) ; if ( monitor != 0 ) return monitor ; } return glfw get primary monitor ( ) ; } <SENTENCE_END/>

(Copy Probability: 9.2%)

<SENTENCE_START> { if ( window != 0 ) { long monitor = glfw get window monitor ( window ) ; if ( monitor != 0 ) return monitor ; } return glfw get primary monitor ( ) ; } <SENTENCE_END/>

monitor

<SENTENCE_START> { if ( window != 0 ) { long monitor = glfw get window monitor ( window ) ; if ( monitor != 0 ) return monitor ; } return glfw get primary monitor ( ) ; } <SENTENCE_END/>

(Copy Probability: 7.0%)

<SENTENCE_START> { if ( window != 0 ) { long monitor = glfw get window monitor ( window ) ; if ( monitor != 0 ) return monitor ; } return glfw get primary monitor ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( window != 0 ) { long monitor = glfw get window monitor ( window ) ; if ( monitor != 0 ) return monitor ; } return glfw get primary monitor ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { if ( window != 0 ) { long monitor = glfw get window monitor ( window ) ; if ( monitor != 0 ) return monitor ; } return glfw get primary monitor ( ) ; } <SENTENCE_END/>

Original Name get,display,modes

get

<SENTENCE_START> { array < display mode > modes = new array ( ) ; for ( glfw video mode mode : glfw get video modes ( get window monitor ( ) ) ) modes . add ( new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ) ; return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { array < display mode > modes = new array ( ) ; for ( glfw video mode mode : glfw get video modes ( get window monitor ( ) ) ) modes . add ( new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ) ; return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

display

<SENTENCE_START> { array < display mode > modes = new array ( ) ; for ( glfw video mode mode : glfw get video modes ( get window monitor ( ) ) ) modes . add ( new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ) ; return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

(Copy Probability: 36.9%)

<SENTENCE_START> { array < display mode > modes = new array ( ) ; for ( glfw video mode mode : glfw get video modes ( get window monitor ( ) ) ) modes . add ( new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ) ; return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

modes

<SENTENCE_START> { array < display mode > modes = new array ( ) ; for ( glfw video mode mode : glfw get video modes ( get window monitor ( ) ) ) modes . add ( new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ) ; return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

(Copy Probability: 49.9%)

<SENTENCE_START> { array < display mode > modes = new array ( ) ; for ( glfw video mode mode : glfw get video modes ( get window monitor ( ) ) ) modes . add ( new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ) ; return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { array < display mode > modes = new array ( ) ; for ( glfw video mode mode : glfw get video modes ( get window monitor ( ) ) ) modes . add ( new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ) ; return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

(Copy Probability: 10.3%)

<SENTENCE_START> { array < display mode > modes = new array ( ) ; for ( glfw video mode mode : glfw get video modes ( get window monitor ( ) ) ) modes . add ( new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ) ; return modes . to array ( display mode . class ) ; } <SENTENCE_END/>

Original Name get,desktop,display,mode

get

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

desktop

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

(Copy Probability: 43.1%)

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

display

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

(Copy Probability: 85.0%)

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

mode

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

(Copy Probability: 47.6%)

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

(Copy Probability: 12.4%)

<SENTENCE_START> { glfw video mode mode = glfw get video mode ( get window monitor ( ) ) ; return new jglfw display mode ( mode . width , mode . height , 0 , mode . red bits + mode . green bits + mode . blue bits ) ; } <SENTENCE_END/>

Original Name set,display,mode

set

<SENTENCE_START> { buffer format = new buffer format ( display mode . bits per pixel == 16 ? 5 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , buffer format . a , buffer format . depth , buffer format . stencil , buffer format . samples , false ) ; boolean success = create window ( display mode . width , display mode . height , fullscreen ) ; if ( success && fullscreen ) size changed ( display mode . width , display mode . height ) ; return success ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { buffer format = new buffer format ( display mode . bits per pixel == 16 ? 5 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , buffer format . a , buffer format . depth , buffer format . stencil , buffer format . samples , false ) ; boolean success = create window ( display mode . width , display mode . height , fullscreen ) ; if ( success && fullscreen ) size changed ( display mode . width , display mode . height ) ; return success ; } <SENTENCE_END/>

display

<SENTENCE_START> { buffer format = new buffer format ( display mode . bits per pixel == 16 ? 5 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , buffer format . a , buffer format . depth , buffer format . stencil , buffer format . samples , false ) ; boolean success = create window ( display mode . width , display mode . height , fullscreen ) ; if ( success && fullscreen ) size changed ( display mode . width , display mode . height ) ; return success ; } <SENTENCE_END/>

(Copy Probability: 34.6%)

<SENTENCE_START> { buffer format = new buffer format ( display mode . bits per pixel == 16 ? 5 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , buffer format . a , buffer format . depth , buffer format . stencil , buffer format . samples , false ) ; boolean success = create window ( display mode . width , display mode . height , fullscreen ) ; if ( success && fullscreen ) size changed ( display mode . width , display mode . height ) ; return success ; } <SENTENCE_END/>

mode

<SENTENCE_START> { buffer format = new buffer format ( display mode . bits per pixel == 16 ? 5 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , buffer format . a , buffer format . depth , buffer format . stencil , buffer format . samples , false ) ; boolean success = create window ( display mode . width , display mode . height , fullscreen ) ; if ( success && fullscreen ) size changed ( display mode . width , display mode . height ) ; return success ; } <SENTENCE_END/>

(Copy Probability: 27.7%)

<SENTENCE_START> { buffer format = new buffer format ( display mode . bits per pixel == 16 ? 5 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , buffer format . a , buffer format . depth , buffer format . stencil , buffer format . samples , false ) ; boolean success = create window ( display mode . width , display mode . height , fullscreen ) ; if ( success && fullscreen ) size changed ( display mode . width , display mode . height ) ; return success ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { buffer format = new buffer format ( display mode . bits per pixel == 16 ? 5 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , buffer format . a , buffer format . depth , buffer format . stencil , buffer format . samples , false ) ; boolean success = create window ( display mode . width , display mode . height , fullscreen ) ; if ( success && fullscreen ) size changed ( display mode . width , display mode . height ) ; return success ; } <SENTENCE_END/>

(Copy Probability: 5.8%)

<SENTENCE_START> { buffer format = new buffer format ( display mode . bits per pixel == 16 ? 5 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , display mode . bits per pixel == 16 ? 6 : 8 , buffer format . a , buffer format . depth , buffer format . stencil , buffer format . samples , false ) ; boolean success = create window ( display mode . width , display mode . height , fullscreen ) ; if ( success && fullscreen ) size changed ( display mode . width , display mode . height ) ; return success ; } <SENTENCE_END/>

Original Name set,display,mode

set

<SENTENCE_START> { if ( fullscreen || this . fullscreen ) { boolean success = create window ( width , height , fullscreen ) ; if ( success && fullscreen ) size changed ( width , height ) ; return success ; } glfw set window size ( window , width , height ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { if ( fullscreen || this . fullscreen ) { boolean success = create window ( width , height , fullscreen ) ; if ( success && fullscreen ) size changed ( width , height ) ; return success ; } glfw set window size ( window , width , height ) ; return true ; } <SENTENCE_END/>

display

<SENTENCE_START> { if ( fullscreen || this . fullscreen ) { boolean success = create window ( width , height , fullscreen ) ; if ( success && fullscreen ) size changed ( width , height ) ; return success ; } glfw set window size ( window , width , height ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 78.7%)

<SENTENCE_START> { if ( fullscreen || this . fullscreen ) { boolean success = create window ( width , height , fullscreen ) ; if ( success && fullscreen ) size changed ( width , height ) ; return success ; } glfw set window size ( window , width , height ) ; return true ; } <SENTENCE_END/>

mode

<SENTENCE_START> { if ( fullscreen || this . fullscreen ) { boolean success = create window ( width , height , fullscreen ) ; if ( success && fullscreen ) size changed ( width , height ) ; return success ; } glfw set window size ( window , width , height ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 6.3%)

<SENTENCE_START> { if ( fullscreen || this . fullscreen ) { boolean success = create window ( width , height , fullscreen ) ; if ( success && fullscreen ) size changed ( width , height ) ; return success ; } glfw set window size ( window , width , height ) ; return true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( fullscreen || this . fullscreen ) { boolean success = create window ( width , height , fullscreen ) ; if ( success && fullscreen ) size changed ( width , height ) ; return success ; } glfw set window size ( window , width , height ) ; return true ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { if ( fullscreen || this . fullscreen ) { boolean success = create window ( width , height , fullscreen ) ; if ( success && fullscreen ) size changed ( width , height ) ; return success ; } glfw set window size ( window , width , height ) ; return true ; } <SENTENCE_END/>

Original Name set,title

set

<SENTENCE_START> { if ( title == null ) title = "" ; glfw set window title ( window , title ) ; this . title = title ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { if ( title == null ) title = "" ; glfw set window title ( window , title ) ; this . title = title ; } <SENTENCE_END/>

title

<SENTENCE_START> { if ( title == null ) title = "" ; glfw set window title ( window , title ) ; this . title = title ; } <SENTENCE_END/>

(Copy Probability: 97.6%)

<SENTENCE_START> { if ( title == null ) title = "" ; glfw set window title ( window , title ) ; this . title = title ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( title == null ) title = "" ; glfw set window title ( window , title ) ; this . title = title ; } <SENTENCE_END/>

(Copy Probability: 40.9%)

<SENTENCE_START> { if ( title == null ) title = "" ; glfw set window title ( window , title ) ; this . title = title ; } <SENTENCE_END/>

Original Name set,v,sync

set

<SENTENCE_START> { this . v sync = vsync ; glfw swap interval ( vsync ? 1 : 0 ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { this . v sync = vsync ; glfw swap interval ( vsync ? 1 : 0 ) ; } <SENTENCE_END/>

v

<SENTENCE_START> { this . v sync = vsync ; glfw swap interval ( vsync ? 1 : 0 ) ; } <SENTENCE_END/>

(Copy Probability: 92.7%)

<SENTENCE_START> { this . v sync = vsync ; glfw swap interval ( vsync ? 1 : 0 ) ; } <SENTENCE_END/>

sync

<SENTENCE_START> { this . v sync = vsync ; glfw swap interval ( vsync ? 1 : 0 ) ; } <SENTENCE_END/>

(Copy Probability: 28.3%)

<SENTENCE_START> { this . v sync = vsync ; glfw swap interval ( vsync ? 1 : 0 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . v sync = vsync ; glfw swap interval ( vsync ? 1 : 0 ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { this . v sync = vsync ; glfw swap interval ( vsync ? 1 : 0 ) ; } <SENTENCE_END/>

Original Name get,buffer,format

get

<SENTENCE_START> { return buffer format ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return buffer format ; } <SENTENCE_END/>

buffer

<SENTENCE_START> { return buffer format ; } <SENTENCE_END/>

(Copy Probability: 84.2%)

<SENTENCE_START> { return buffer format ; } <SENTENCE_END/>

format

<SENTENCE_START> { return buffer format ; } <SENTENCE_END/>

(Copy Probability: 89.0%)

<SENTENCE_START> { return buffer format ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return buffer format ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return buffer format ; } <SENTENCE_END/>

Original Name supports,extension

supports

<SENTENCE_START> { return glfw extension supported ( extension ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return glfw extension supported ( extension ) ; } <SENTENCE_END/>

extension

<SENTENCE_START> { return glfw extension supported ( extension ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { return glfw extension supported ( extension ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return glfw extension supported ( extension ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { return glfw extension supported ( extension ) ; } <SENTENCE_END/>

Original Name set,continuous,rendering

set

<SENTENCE_START> { this . is continuous = is continuous ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { this . is continuous = is continuous ; } <SENTENCE_END/>

continuous

<SENTENCE_START> { this . is continuous = is continuous ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { this . is continuous = is continuous ; } <SENTENCE_END/>

rendering

<SENTENCE_START> { this . is continuous = is continuous ; } <SENTENCE_END/>

(Copy Probability: 51.7%)

<SENTENCE_START> { this . is continuous = is continuous ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . is continuous = is continuous ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { this . is continuous = is continuous ; } <SENTENCE_END/>

Original Name is,continuous,rendering

is

<SENTENCE_START> { return is continuous ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return is continuous ; } <SENTENCE_END/>

continuous

<SENTENCE_START> { return is continuous ; } <SENTENCE_END/>

(Copy Probability: 90.6%)

<SENTENCE_START> { return is continuous ; } <SENTENCE_END/>

rendering

<SENTENCE_START> { return is continuous ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { return is continuous ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return is continuous ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return is continuous ; } <SENTENCE_END/>

Original Name request,rendering

request

<SENTENCE_START> { render requested = true ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { render requested = true ; } <SENTENCE_END/>

rendering

<SENTENCE_START> { render requested = true ; } <SENTENCE_END/>

(Copy Probability: 5.7%)

<SENTENCE_START> { render requested = true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { render requested = true ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { render requested = true ; } <SENTENCE_END/>

Original Name is,fullscreen

is

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

(Copy Probability: 0.5%)

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

fullscreen

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

(Copy Probability: 96.7%)

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

%END%

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

(Copy Probability: 10.7%)

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

Original Name get,window

get

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

(Copy Probability: 0.3%)

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

window

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

(Copy Probability: 37.6%)

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

%END%

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

(Copy Probability: 1.0%)

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

Original Name get,x

get

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

(Copy Probability: 0.3%)

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

x

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

(Copy Probability: 41.3%)

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

%END%

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

(Copy Probability: 2.3%)

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

Original Name get,y

get

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

(Copy Probability: 0.3%)

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

y

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

(Copy Probability: 62.2%)

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

%END%

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

(Copy Probability: 2.6%)

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

Original Name set,position

set

<SENTENCE_START> { glfw set window pos ( window , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { glfw set window pos ( window , x , y ) ; } <SENTENCE_END/>

position

<SENTENCE_START> { glfw set window pos ( window , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { glfw set window pos ( window , x , y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { glfw set window pos ( window , x , y ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { glfw set window pos ( window , x , y ) ; } <SENTENCE_END/>

Original Name hide

hide

<SENTENCE_START> { visible = false ; glfw hide window ( window ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { visible = false ; glfw hide window ( window ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { visible = false ; glfw hide window ( window ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { visible = false ; glfw hide window ( window ) ; } <SENTENCE_END/>

Original Name show

show

<SENTENCE_START> { visible = true ; glfw show window ( window ) ; gdx . gl . gl clear color ( initial background color . r , initial background color . g , initial background color . b , initial background color . a ) ; gdx . gl . gl clear ( gl 20 . gl color buffer bit ) ; glfw swap buffers ( window ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { visible = true ; glfw show window ( window ) ; gdx . gl . gl clear color ( initial background color . r , initial background color . g , initial background color . b , initial background color . a ) ; gdx . gl . gl clear ( gl 20 . gl color buffer bit ) ; glfw swap buffers ( window ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { visible = true ; glfw show window ( window ) ; gdx . gl . gl clear color ( initial background color . r , initial background color . g , initial background color . b , initial background color . a ) ; gdx . gl . gl clear ( gl 20 . gl color buffer bit ) ; glfw swap buffers ( window ) ; } <SENTENCE_END/>

(Copy Probability: 6.1%)

<SENTENCE_START> { visible = true ; glfw show window ( window ) ; gdx . gl . gl clear color ( initial background color . r , initial background color . g , initial background color . b , initial background color . a ) ; gdx . gl . gl clear ( gl 20 . gl color buffer bit ) ; glfw swap buffers ( window ) ; } <SENTENCE_END/>

Original Name is,hidden

is

<SENTENCE_START> { return ! visible ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return ! visible ; } <SENTENCE_END/>

hidden

<SENTENCE_START> { return ! visible ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { return ! visible ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ! visible ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { return ! visible ; } <SENTENCE_END/>

Original Name is,minimized

is

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

(Copy Probability: 0.3%)

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

minimized

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

(Copy Probability: 21.6%)

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

%END%

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

(Copy Probability: 0.4%)

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

Original Name is,foreground

is

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

(Copy Probability: 0.4%)

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

foreground

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

(Copy Probability: 75.2%)

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

%END%

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

(Copy Probability: 1.6%)

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

Original Name minimize

minimize

<SENTENCE_START> { glfw iconify window ( window ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { glfw iconify window ( window ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { glfw iconify window ( window ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { glfw iconify window ( window ) ; } <SENTENCE_END/>

Original Name restore

restore

<SENTENCE_START> { glfw restore window ( window ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { glfw restore window ( window ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { glfw restore window ( window ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { glfw restore window ( window ) ; } <SENTENCE_END/>

Original Name should,render

should

<SENTENCE_START> { try { return render requested || is continuous ; } finally { render requested = false ; } } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { try { return render requested || is continuous ; } finally { render requested = false ; } } <SENTENCE_END/>

render

<SENTENCE_START> { try { return render requested || is continuous ; } finally { render requested = false ; } } <SENTENCE_END/>

(Copy Probability: 83.5%)

<SENTENCE_START> { try { return render requested || is continuous ; } finally { render requested = false ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { return render requested || is continuous ; } finally { render requested = false ; } } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { try { return render requested || is continuous ; } finally { render requested = false ; } } <SENTENCE_END/>

Original Name as,read,only,buffer

as

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

(Copy Probability: 0.2%)

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

read

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

(Copy Probability: 0.5%)

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

only

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

(Copy Probability: 0.1%)

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

buffer

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

(Copy Probability: 0.1%)

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

%END%

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

(Copy Probability: 0.9%)

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

Original Name protected,array

protected

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

Original Name protected,array,offset

protected

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

offset

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

Original Name protected,has,array

protected

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

has

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

Original Name get,double

get

<SENTENCE_START> { return numbers . long bits to double ( get long ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return numbers . long bits to double ( get long ( ) ) ; } <SENTENCE_END/>

double

<SENTENCE_START> { return numbers . long bits to double ( get long ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 93.2%)

<SENTENCE_START> { return numbers . long bits to double ( get long ( ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return numbers . long bits to double ( get long ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { return numbers . long bits to double ( get long ( ) ) ; } <SENTENCE_END/>

Original Name get,double

get

<SENTENCE_START> { return numbers . long bits to double ( get long ( index ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return numbers . long bits to double ( get long ( index ) ) ; } <SENTENCE_END/>

double

<SENTENCE_START> { return numbers . long bits to double ( get long ( index ) ) ; } <SENTENCE_END/>

(Copy Probability: 92.7%)

<SENTENCE_START> { return numbers . long bits to double ( get long ( index ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return numbers . long bits to double ( get long ( index ) ) ; } <SENTENCE_END/>

(Copy Probability: 8.4%)

<SENTENCE_START> { return numbers . long bits to double ( get long ( index ) ) ; } <SENTENCE_END/>

Original Name get,float

get

<SENTENCE_START> { return numbers . int bits to float ( get int ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return numbers . int bits to float ( get int ( ) ) ; } <SENTENCE_END/>

float

<SENTENCE_START> { return numbers . int bits to float ( get int ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 94.3%)

<SENTENCE_START> { return numbers . int bits to float ( get int ( ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return numbers . int bits to float ( get int ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 8.0%)

<SENTENCE_START> { return numbers . int bits to float ( get int ( ) ) ; } <SENTENCE_END/>

Original Name get,float

get

<SENTENCE_START> { return numbers . int bits to float ( get int ( index ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return numbers . int bits to float ( get int ( index ) ) ; } <SENTENCE_END/>

float

<SENTENCE_START> { return numbers . int bits to float ( get int ( index ) ) ; } <SENTENCE_END/>

(Copy Probability: 95.7%)

<SENTENCE_START> { return numbers . int bits to float ( get int ( index ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return numbers . int bits to float ( get int ( index ) ) ; } <SENTENCE_END/>

(Copy Probability: 11.1%)

<SENTENCE_START> { return numbers . int bits to float ( get int ( index ) ) ; } <SENTENCE_END/>

Original Name get,int

get

<SENTENCE_START> { int new position = position + 4 ; int result = load int ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { int new position = position + 4 ; int result = load int ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

int

<SENTENCE_START> { int new position = position + 4 ; int result = load int ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

(Copy Probability: 18.0%)

<SENTENCE_START> { int new position = position + 4 ; int result = load int ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int new position = position + 4 ; int result = load int ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { int new position = position + 4 ; int result = load int ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

Original Name get,int

get

<SENTENCE_START> { return load int ( index ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return load int ( index ) ; } <SENTENCE_END/>

int

<SENTENCE_START> { return load int ( index ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { return load int ( index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return load int ( index ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return load int ( index ) ; } <SENTENCE_END/>

Original Name get,long

get

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

long

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

Original Name get,long

get

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

long

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new unsupported operation exception ( ) ; } <SENTENCE_END/>

Original Name get,short

get

<SENTENCE_START> { int new position = position + 2 ; short result = load short ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { int new position = position + 2 ; short result = load short ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

short

<SENTENCE_START> { int new position = position + 2 ; short result = load short ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

(Copy Probability: 51.0%)

<SENTENCE_START> { int new position = position + 2 ; short result = load short ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int new position = position + 2 ; short result = load short ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { int new position = position + 2 ; short result = load short ( position ) ; position = new position ; return result ; } <SENTENCE_END/>

Original Name get,short

get

<SENTENCE_START> { return load short ( index ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return load short ( index ) ; } <SENTENCE_END/>

short

<SENTENCE_START> { return load short ( index ) ; } <SENTENCE_END/>

(Copy Probability: 18.9%)

<SENTENCE_START> { return load short ( index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return load short ( index ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return load short ( index ) ; } <SENTENCE_END/>

Original Name load,int

load

<SENTENCE_START> { int bytes = 0 ; for ( int i = 3 ; i >= 0 ; i -- ) { bytes = bytes << 8 ; bytes = bytes | ( get ( base offset + i ) & 0xFF ) ; } return bytes ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { int bytes = 0 ; for ( int i = 3 ; i >= 0 ; i -- ) { bytes = bytes << 8 ; bytes = bytes | ( get ( base offset + i ) & 0xFF ) ; } return bytes ; } <SENTENCE_END/>

int

<SENTENCE_START> { int bytes = 0 ; for ( int i = 3 ; i >= 0 ; i -- ) { bytes = bytes << 8 ; bytes = bytes | ( get ( base offset + i ) & 0xFF ) ; } return bytes ; } <SENTENCE_END/>

(Copy Probability: 12.0%)

<SENTENCE_START> { int bytes = 0 ; for ( int i = 3 ; i >= 0 ; i -- ) { bytes = bytes << 8 ; bytes = bytes | ( get ( base offset + i ) & 0xFF ) ; } return bytes ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int bytes = 0 ; for ( int i = 3 ; i >= 0 ; i -- ) { bytes = bytes << 8 ; bytes = bytes | ( get ( base offset + i ) & 0xFF ) ; } return bytes ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { int bytes = 0 ; for ( int i = 3 ; i >= 0 ; i -- ) { bytes = bytes << 8 ; bytes = bytes | ( get ( base offset + i ) & 0xFF ) ; } return bytes ; } <SENTENCE_END/>

Original Name load,short

load

<SENTENCE_START> { short bytes = 0 ; bytes = ( short ) ( get ( base offset + 1 ) << 8 ) ; bytes |= ( get ( base offset ) & 0xFF ) ; return bytes ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { short bytes = 0 ; bytes = ( short ) ( get ( base offset + 1 ) << 8 ) ; bytes |= ( get ( base offset ) & 0xFF ) ; return bytes ; } <SENTENCE_END/>

short

<SENTENCE_START> { short bytes = 0 ; bytes = ( short ) ( get ( base offset + 1 ) << 8 ) ; bytes |= ( get ( base offset ) & 0xFF ) ; return bytes ; } <SENTENCE_END/>

(Copy Probability: 8.3%)

<SENTENCE_START> { short bytes = 0 ; bytes = ( short ) ( get ( base offset + 1 ) << 8 ) ; bytes |= ( get ( base offset ) & 0xFF ) ; return bytes ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { short bytes = 0 ; bytes = ( short ) ( get ( base offset + 1 ) << 8 ) ; bytes |= ( get ( base offset ) & 0xFF ) ; return bytes ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { short bytes = 0 ; bytes = ( short ) ( get ( base offset + 1 ) << 8 ) ; bytes |= ( get ( base offset ) & 0xFF ) ; return bytes ; } <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,base,resolver

set

<SENTENCE_START> { this . base resolver = base resolver ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { this . base resolver = base resolver ; } <SENTENCE_END/>

base

<SENTENCE_START> { this . base resolver = base resolver ; } <SENTENCE_END/>

(Copy Probability: 71.7%)

<SENTENCE_START> { this . base resolver = base resolver ; } <SENTENCE_END/>

resolver

<SENTENCE_START> { this . base resolver = base resolver ; } <SENTENCE_END/>

(Copy Probability: 29.1%)

<SENTENCE_START> { this . base resolver = base resolver ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . base resolver = base resolver ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { this . base resolver = base resolver ; } <SENTENCE_END/>

Original Name get,base,resolver

get

<SENTENCE_START> { return base resolver ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return base resolver ; } <SENTENCE_END/>

base

<SENTENCE_START> { return base resolver ; } <SENTENCE_END/>

(Copy Probability: 48.7%)

<SENTENCE_START> { return base resolver ; } <SENTENCE_END/>

resolver

<SENTENCE_START> { return base resolver ; } <SENTENCE_END/>

(Copy Probability: 34.0%)

<SENTENCE_START> { return base resolver ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return base resolver ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return base resolver ; } <SENTENCE_END/>

Original Name set,prefix

set

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

(Copy Probability: 1.6%)

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

prefix

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

(Copy Probability: 99.4%)

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

%END%

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

(Copy Probability: 21.2%)

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

Original Name get,prefix

get

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

(Copy Probability: 0.5%)

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

prefix

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

(Copy Probability: 97.7%)

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

%END%

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

(Copy Probability: 15.5%)

<SENTENCE_START> { return prefix ; } <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 swig,constructbt,triangle,index,vertex,material,array

swig

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

(Copy Probability: 7.9%)

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

constructbt

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

(Copy Probability: 49.4%)

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

triangle

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

(Copy Probability: 61.8%)

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

index

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

(Copy Probability: 14.3%)

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

vertex

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

(Copy Probability: 6.1%)

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

material

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

(Copy Probability: 6.2%)

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

(Copy Probability: 6.6%)

<SENTENCE_START> { assert triangle index base . is direct ( ) : "Buffer must be allocated direct." ; assert vertex base . is direct ( ) : "Buffer must be allocated direct." ; assert material base . is direct ( ) : "Buffer must be allocated direct." ; assert triangle materials base . is direct ( ) : "Buffer must be allocated direct." ; return collision jni . new bt triangle index vertex material array swig 1 ( num triangles , triangle index base , triangle index stride , num vertices , vertex base , vertex stride , num materials , material base , material stride , triangle materials base , material index stride ) ; } <SENTENCE_END/>

Original Name add,material,properties

add

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 0 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat , triangle type ) ; } <SENTENCE_END/>

(Copy Probability: 5.9%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 0 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat , triangle type ) ; } <SENTENCE_END/>

material

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 0 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat , triangle type ) ; } <SENTENCE_END/>

(Copy Probability: 93.9%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 0 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat , triangle type ) ; } <SENTENCE_END/>

properties

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 0 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat , triangle type ) ; } <SENTENCE_END/>

(Copy Probability: 91.6%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 0 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat , triangle type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 0 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat , triangle type ) ; } <SENTENCE_END/>

(Copy Probability: 40.7%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 0 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat , triangle type ) ; } <SENTENCE_END/>

Original Name add,material,properties

add

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 1 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat ) ; } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 1 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat ) ; } <SENTENCE_END/>

material

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 1 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat ) ; } <SENTENCE_END/>

(Copy Probability: 95.3%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 1 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat ) ; } <SENTENCE_END/>

properties

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 1 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat ) ; } <SENTENCE_END/>

(Copy Probability: 93.6%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 1 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 1 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat ) ; } <SENTENCE_END/>

(Copy Probability: 44.9%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array add material properties swig 1 ( swig c ptr , this , bt material properties . get c ptr ( mat ) , mat ) ; } <SENTENCE_END/>

Original Name get,locked,material,base

get

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

locked

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 98.1%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

material

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

base

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 93.7%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 54.2%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

Original Name get,locked,material,base

get

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

locked

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 98.3%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

material

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

base

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 94.9%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 59.0%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

Original Name get,locked,read,only,material,base

get

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

locked

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 94.1%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

read

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 98.1%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

only

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 93.5%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

material

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 75.6%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

base

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 34.2%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

(Copy Probability: 38.6%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 0 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) , subpart ) ; } <SENTENCE_END/>

Original Name get,locked,read,only,material,base

get

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

locked

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 94.4%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

read

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 98.3%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

only

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 94.3%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

material

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 77.4%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

base

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 35.8%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <SENTENCE_END/>

(Copy Probability: 40.0%)

<SENTENCE_START> { collision jni . bt triangle index vertex material array get locked read only material base swig 1 ( swig c ptr , this , swigtype p p unsigned char . get c ptr ( material base ) , swigtype p int . get c ptr ( num materials ) , swigtype p phy scalar type . get c ptr ( material type ) , swigtype p int . get c ptr ( material stride ) , swigtype p p unsigned char . get c ptr ( triangle material base ) , swigtype p int . get c ptr ( num triangles ) , swigtype p int . get c ptr ( triangle material stride ) , swigtype p phy scalar type . get c ptr ( triangle type ) ) ; } <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,radius

get

<SENTENCE_START> { return jni get radius ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { return jni get radius ( addr ) ; } <SENTENCE_END/>

radius

<SENTENCE_START> { return jni get radius ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return jni get radius ( addr ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return jni get radius ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { return jni get radius ( addr ) ; } <SENTENCE_END/>

Original Name set,radius

set

<SENTENCE_START> { jni set radius ( addr , radius ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { jni set radius ( addr , radius ) ; } <SENTENCE_END/>

radius

<SENTENCE_START> { jni set radius ( addr , radius ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { jni set radius ( addr , radius ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni set radius ( addr , radius ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { jni set radius ( addr , radius ) ; } <SENTENCE_END/>

Original Name dispose

dispose

<SENTENCE_START> { jni dispose ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { jni dispose ( addr ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { jni dispose ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 12.0%)

<SENTENCE_START> { jni dispose ( addr ) ; } <SENTENCE_END/>

Original Name get,child,count

get

<SENTENCE_START> { return jni get child count ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { return jni get child count ( addr ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { return jni get child count ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return jni get child count ( addr ) ; } <SENTENCE_END/>

count

<SENTENCE_START> { return jni get child count ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { return jni get child count ( addr ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return jni get child count ( addr ) ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { return jni get child count ( addr ) ; } <SENTENCE_END/>

Original Name write,samples

write

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { short sample = samples [ i ] ; bytes [ ii ++ ] = ( byte ) ( sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { short sample = samples [ i ] ; bytes [ ii ++ ] = ( byte ) ( sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

samples

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { short sample = samples [ i ] ; bytes [ ii ++ ] = ( byte ) ( sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { short sample = samples [ i ] ; bytes [ ii ++ ] = ( byte ) ( sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { short sample = samples [ i ] ; bytes [ ii ++ ] = ( byte ) ( sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { short sample = samples [ i ] ; bytes [ ii ++ ] = ( byte ) ( sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

Original Name write,samples

write

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { float float sample = samples [ i ] ; float sample = math utils . clamp ( float sample , - 1f , 1f ) ; int int sample = ( int ) ( float sample * 32767 ) ; bytes [ ii ++ ] = ( byte ) ( int sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( int sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { float float sample = samples [ i ] ; float sample = math utils . clamp ( float sample , - 1f , 1f ) ; int int sample = ( int ) ( float sample * 32767 ) ; bytes [ ii ++ ] = ( byte ) ( int sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( int sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

samples

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { float float sample = samples [ i ] ; float sample = math utils . clamp ( float sample , - 1f , 1f ) ; int int sample = ( int ) ( float sample * 32767 ) ; bytes [ ii ++ ] = ( byte ) ( int sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( int sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { float float sample = samples [ i ] ; float sample = math utils . clamp ( float sample , - 1f , 1f ) ; int int sample = ( int ) ( float sample * 32767 ) ; bytes [ ii ++ ] = ( byte ) ( int sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( int sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { float float sample = samples [ i ] ; float sample = math utils . clamp ( float sample , - 1f , 1f ) ; int int sample = ( int ) ( float sample * 32767 ) ; bytes [ ii ++ ] = ( byte ) ( int sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( int sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { if ( bytes == null || bytes . length < num samples * 2 ) bytes = new byte [ num samples * 2 ] ; int end = math . min ( offset + num samples , samples . length ) ; for ( int i = offset , ii = 0 ; i < end ; i ++ ) { float float sample = samples [ i ] ; float sample = math utils . clamp ( float sample , - 1f , 1f ) ; int int sample = ( int ) ( float sample * 32767 ) ; bytes [ ii ++ ] = ( byte ) ( int sample & 0xFF ) ; bytes [ ii ++ ] = ( byte ) ( ( int sample >> 8 ) & 0xFF ) ; } %SELF% ( bytes , 0 , num samples * 2 ) ; } <SENTENCE_END/>

Original Name write,samples

write

<SENTENCE_START> { if ( length < 0 ) throw new illegal argument exception ( "length cannot be < 0." ) ; if ( source id == - 1 ) { source id = audio . obtain source ( true ) ; if ( source id == - 1 ) return ; if ( buffers == null ) { buffers = buffer utils . create int buffer ( buffer count ) ; al gen buffers ( buffers ) ; if ( al get error ( ) != al no error ) throw new gdx runtime exception ( "Unabe to allocate audio buffers." ) ; } al sourcei ( source id , al looping , al false ) ; al sourcef ( source id , al gain , volume ) ; int queued buffers = 0 ; for ( int i = 0 ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; int written = math . min ( buffer size , length ) ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; length -= written ; offset += written ; queued buffers ++ ; } temp buffer . clear ( ) . flip ( ) ; for ( int i = queued buffers ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; } al source play ( source id ) ; is playing = true ; } while ( length > 0 ) { int written = fill buffer ( data , offset , length ) ; length -= written ; offset += written ; } } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { if ( length < 0 ) throw new illegal argument exception ( "length cannot be < 0." ) ; if ( source id == - 1 ) { source id = audio . obtain source ( true ) ; if ( source id == - 1 ) return ; if ( buffers == null ) { buffers = buffer utils . create int buffer ( buffer count ) ; al gen buffers ( buffers ) ; if ( al get error ( ) != al no error ) throw new gdx runtime exception ( "Unabe to allocate audio buffers." ) ; } al sourcei ( source id , al looping , al false ) ; al sourcef ( source id , al gain , volume ) ; int queued buffers = 0 ; for ( int i = 0 ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; int written = math . min ( buffer size , length ) ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; length -= written ; offset += written ; queued buffers ++ ; } temp buffer . clear ( ) . flip ( ) ; for ( int i = queued buffers ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; } al source play ( source id ) ; is playing = true ; } while ( length > 0 ) { int written = fill buffer ( data , offset , length ) ; length -= written ; offset += written ; } } <SENTENCE_END/>

samples

<SENTENCE_START> { if ( length < 0 ) throw new illegal argument exception ( "length cannot be < 0." ) ; if ( source id == - 1 ) { source id = audio . obtain source ( true ) ; if ( source id == - 1 ) return ; if ( buffers == null ) { buffers = buffer utils . create int buffer ( buffer count ) ; al gen buffers ( buffers ) ; if ( al get error ( ) != al no error ) throw new gdx runtime exception ( "Unabe to allocate audio buffers." ) ; } al sourcei ( source id , al looping , al false ) ; al sourcef ( source id , al gain , volume ) ; int queued buffers = 0 ; for ( int i = 0 ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; int written = math . min ( buffer size , length ) ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; length -= written ; offset += written ; queued buffers ++ ; } temp buffer . clear ( ) . flip ( ) ; for ( int i = queued buffers ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; } al source play ( source id ) ; is playing = true ; } while ( length > 0 ) { int written = fill buffer ( data , offset , length ) ; length -= written ; offset += written ; } } <SENTENCE_END/>

(Copy Probability: 15.2%)

<SENTENCE_START> { if ( length < 0 ) throw new illegal argument exception ( "length cannot be < 0." ) ; if ( source id == - 1 ) { source id = audio . obtain source ( true ) ; if ( source id == - 1 ) return ; if ( buffers == null ) { buffers = buffer utils . create int buffer ( buffer count ) ; al gen buffers ( buffers ) ; if ( al get error ( ) != al no error ) throw new gdx runtime exception ( "Unabe to allocate audio buffers." ) ; } al sourcei ( source id , al looping , al false ) ; al sourcef ( source id , al gain , volume ) ; int queued buffers = 0 ; for ( int i = 0 ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; int written = math . min ( buffer size , length ) ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; length -= written ; offset += written ; queued buffers ++ ; } temp buffer . clear ( ) . flip ( ) ; for ( int i = queued buffers ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; } al source play ( source id ) ; is playing = true ; } while ( length > 0 ) { int written = fill buffer ( data , offset , length ) ; length -= written ; offset += written ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( length < 0 ) throw new illegal argument exception ( "length cannot be < 0." ) ; if ( source id == - 1 ) { source id = audio . obtain source ( true ) ; if ( source id == - 1 ) return ; if ( buffers == null ) { buffers = buffer utils . create int buffer ( buffer count ) ; al gen buffers ( buffers ) ; if ( al get error ( ) != al no error ) throw new gdx runtime exception ( "Unabe to allocate audio buffers." ) ; } al sourcei ( source id , al looping , al false ) ; al sourcef ( source id , al gain , volume ) ; int queued buffers = 0 ; for ( int i = 0 ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; int written = math . min ( buffer size , length ) ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; length -= written ; offset += written ; queued buffers ++ ; } temp buffer . clear ( ) . flip ( ) ; for ( int i = queued buffers ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; } al source play ( source id ) ; is playing = true ; } while ( length > 0 ) { int written = fill buffer ( data , offset , length ) ; length -= written ; offset += written ; } } <SENTENCE_END/>

(Copy Probability: 8.9%)

<SENTENCE_START> { if ( length < 0 ) throw new illegal argument exception ( "length cannot be < 0." ) ; if ( source id == - 1 ) { source id = audio . obtain source ( true ) ; if ( source id == - 1 ) return ; if ( buffers == null ) { buffers = buffer utils . create int buffer ( buffer count ) ; al gen buffers ( buffers ) ; if ( al get error ( ) != al no error ) throw new gdx runtime exception ( "Unabe to allocate audio buffers." ) ; } al sourcei ( source id , al looping , al false ) ; al sourcef ( source id , al gain , volume ) ; int queued buffers = 0 ; for ( int i = 0 ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; int written = math . min ( buffer size , length ) ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; length -= written ; offset += written ; queued buffers ++ ; } temp buffer . clear ( ) . flip ( ) ; for ( int i = queued buffers ; i < buffer count ; i ++ ) { int buffer id = buffers . get ( i ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; } al source play ( source id ) ; is playing = true ; } while ( length > 0 ) { int written = fill buffer ( data , offset , length ) ; length -= written ; offset += written ; } } <SENTENCE_END/>

Original Name fill,buffer

fill

<SENTENCE_START> { int written = math . min ( buffer size , length ) ; outer : while ( true ) { int buffers = al get sourcei ( source id , al buffers processed ) ; while ( buffers -- > 0 ) { int buffer id = al source unqueue buffers ( source id ) ; if ( buffer id == al invalid value ) break ; rendered seconds += seconds per buffer ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; break outer ; } try { thread . sleep ( ( long ) ( 1000 * seconds per buffer / buffer count ) ) ; } catch ( interrupted exception ignored ) { } } if ( ! is playing || al get sourcei ( source id , al source state ) != al playing ) { al source play ( source id ) ; is playing = true ; } return written ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { int written = math . min ( buffer size , length ) ; outer : while ( true ) { int buffers = al get sourcei ( source id , al buffers processed ) ; while ( buffers -- > 0 ) { int buffer id = al source unqueue buffers ( source id ) ; if ( buffer id == al invalid value ) break ; rendered seconds += seconds per buffer ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; break outer ; } try { thread . sleep ( ( long ) ( 1000 * seconds per buffer / buffer count ) ) ; } catch ( interrupted exception ignored ) { } } if ( ! is playing || al get sourcei ( source id , al source state ) != al playing ) { al source play ( source id ) ; is playing = true ; } return written ; } <SENTENCE_END/>

buffer

<SENTENCE_START> { int written = math . min ( buffer size , length ) ; outer : while ( true ) { int buffers = al get sourcei ( source id , al buffers processed ) ; while ( buffers -- > 0 ) { int buffer id = al source unqueue buffers ( source id ) ; if ( buffer id == al invalid value ) break ; rendered seconds += seconds per buffer ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; break outer ; } try { thread . sleep ( ( long ) ( 1000 * seconds per buffer / buffer count ) ) ; } catch ( interrupted exception ignored ) { } } if ( ! is playing || al get sourcei ( source id , al source state ) != al playing ) { al source play ( source id ) ; is playing = true ; } return written ; } <SENTENCE_END/>

(Copy Probability: 25.3%)

<SENTENCE_START> { int written = math . min ( buffer size , length ) ; outer : while ( true ) { int buffers = al get sourcei ( source id , al buffers processed ) ; while ( buffers -- > 0 ) { int buffer id = al source unqueue buffers ( source id ) ; if ( buffer id == al invalid value ) break ; rendered seconds += seconds per buffer ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; break outer ; } try { thread . sleep ( ( long ) ( 1000 * seconds per buffer / buffer count ) ) ; } catch ( interrupted exception ignored ) { } } if ( ! is playing || al get sourcei ( source id , al source state ) != al playing ) { al source play ( source id ) ; is playing = true ; } return written ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int written = math . min ( buffer size , length ) ; outer : while ( true ) { int buffers = al get sourcei ( source id , al buffers processed ) ; while ( buffers -- > 0 ) { int buffer id = al source unqueue buffers ( source id ) ; if ( buffer id == al invalid value ) break ; rendered seconds += seconds per buffer ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; break outer ; } try { thread . sleep ( ( long ) ( 1000 * seconds per buffer / buffer count ) ) ; } catch ( interrupted exception ignored ) { } } if ( ! is playing || al get sourcei ( source id , al source state ) != al playing ) { al source play ( source id ) ; is playing = true ; } return written ; } <SENTENCE_END/>

(Copy Probability: 7.2%)

<SENTENCE_START> { int written = math . min ( buffer size , length ) ; outer : while ( true ) { int buffers = al get sourcei ( source id , al buffers processed ) ; while ( buffers -- > 0 ) { int buffer id = al source unqueue buffers ( source id ) ; if ( buffer id == al invalid value ) break ; rendered seconds += seconds per buffer ; temp buffer . clear ( ) ; temp buffer . put ( data , offset , written ) . flip ( ) ; al buffer data ( buffer id , format , temp buffer , sample rate ) ; al source queue buffers ( source id , buffer id ) ; break outer ; } try { thread . sleep ( ( long ) ( 1000 * seconds per buffer / buffer count ) ) ; } catch ( interrupted exception ignored ) { } } if ( ! is playing || al get sourcei ( source id , al source state ) != al playing ) { al source play ( source id ) ; is playing = true ; } return written ; } <SENTENCE_END/>

Original Name stop

stop

<SENTENCE_START> { if ( source id == - 1 ) return ; audio . free source ( source id ) ; source id = - 1 ; rendered seconds = 0 ; is playing = false ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { if ( source id == - 1 ) return ; audio . free source ( source id ) ; source id = - 1 ; rendered seconds = 0 ; is playing = false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( source id == - 1 ) return ; audio . free source ( source id ) ; source id = - 1 ; rendered seconds = 0 ; is playing = false ; } <SENTENCE_END/>

(Copy Probability: 10.1%)

<SENTENCE_START> { if ( source id == - 1 ) return ; audio . free source ( source id ) ; source id = - 1 ; rendered seconds = 0 ; is playing = false ; } <SENTENCE_END/>

Original Name is,playing

is

<SENTENCE_START> { if ( source id == - 1 ) return false ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { if ( source id == - 1 ) return false ; return %SELF% ; } <SENTENCE_END/>

playing

<SENTENCE_START> { if ( source id == - 1 ) return false ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { if ( source id == - 1 ) return false ; return %SELF% ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( source id == - 1 ) return false ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { if ( source id == - 1 ) return false ; return %SELF% ; } <SENTENCE_END/>

Original Name set,volume

set

<SENTENCE_START> { this . volume = volume ; if ( source id != - 1 ) al sourcef ( source id , al gain , volume ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { this . volume = volume ; if ( source id != - 1 ) al sourcef ( source id , al gain , volume ) ; } <SENTENCE_END/>

volume

<SENTENCE_START> { this . volume = volume ; if ( source id != - 1 ) al sourcef ( source id , al gain , volume ) ; } <SENTENCE_END/>

(Copy Probability: 94.8%)

<SENTENCE_START> { this . volume = volume ; if ( source id != - 1 ) al sourcef ( source id , al gain , volume ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . volume = volume ; if ( source id != - 1 ) al sourcef ( source id , al gain , volume ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { this . volume = volume ; if ( source id != - 1 ) al sourcef ( source id , al gain , volume ) ; } <SENTENCE_END/>

Original Name get,position

get

<SENTENCE_START> { if ( source id == - 1 ) return 0 ; return rendered seconds + al get sourcef ( source id , al 11 . al sec offset ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { if ( source id == - 1 ) return 0 ; return rendered seconds + al get sourcef ( source id , al 11 . al sec offset ) ; } <SENTENCE_END/>

position

<SENTENCE_START> { if ( source id == - 1 ) return 0 ; return rendered seconds + al get sourcef ( source id , al 11 . al sec offset ) ; } <SENTENCE_END/>

(Copy Probability: 71.7%)

<SENTENCE_START> { if ( source id == - 1 ) return 0 ; return rendered seconds + al get sourcef ( source id , al 11 . al sec offset ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( source id == - 1 ) return 0 ; return rendered seconds + al get sourcef ( source id , al 11 . al sec offset ) ; } <SENTENCE_END/>

(Copy Probability: 58.5%)

<SENTENCE_START> { if ( source id == - 1 ) return 0 ; return rendered seconds + al get sourcef ( source id , al 11 . al sec offset ) ; } <SENTENCE_END/>

Original Name set,position

set

<SENTENCE_START> { rendered seconds = position ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { rendered seconds = position ; } <SENTENCE_END/>

position

<SENTENCE_START> { rendered seconds = position ; } <SENTENCE_END/>

(Copy Probability: 31.0%)

<SENTENCE_START> { rendered seconds = position ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { rendered seconds = position ; } <SENTENCE_END/>

(Copy Probability: 9.7%)

<SENTENCE_START> { rendered seconds = position ; } <SENTENCE_END/>

Original Name get,channels

get

<SENTENCE_START> { return format == al format stereo 16 ? 2 : 1 ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return format == al format stereo 16 ? 2 : 1 ; } <SENTENCE_END/>

channels

<SENTENCE_START> { return format == al format stereo 16 ? 2 : 1 ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return format == al format stereo 16 ? 2 : 1 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return format == al format stereo 16 ? 2 : 1 ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return format == al format stereo 16 ? 2 : 1 ; } <SENTENCE_END/>

Original Name get,rate

get

<SENTENCE_START> { return sample rate ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return sample rate ; } <SENTENCE_END/>

rate

<SENTENCE_START> { return sample rate ; } <SENTENCE_END/>

(Copy Probability: 92.1%)

<SENTENCE_START> { return sample rate ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return sample rate ; } <SENTENCE_END/>

(Copy Probability: 16.2%)

<SENTENCE_START> { return sample rate ; } <SENTENCE_END/>

Original Name dispose

dispose

<SENTENCE_START> { if ( buffers == null ) return ; if ( source id != - 1 ) { audio . free source ( source id ) ; source id = - 1 ; } al delete buffers ( buffers ) ; buffers = null ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { if ( buffers == null ) return ; if ( source id != - 1 ) { audio . free source ( source id ) ; source id = - 1 ; } al delete buffers ( buffers ) ; buffers = null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( buffers == null ) return ; if ( source id != - 1 ) { audio . free source ( source id ) ; source id = - 1 ; } al delete buffers ( buffers ) ; buffers = null ; } <SENTENCE_END/>

(Copy Probability: 14.4%)

<SENTENCE_START> { if ( buffers == null ) return ; if ( source id != - 1 ) { audio . free source ( source id ) ; source id = - 1 ; } al delete buffers ( buffers ) ; buffers = null ; } <SENTENCE_END/>

Original Name is,mono

is

<SENTENCE_START> { return channels == 1 ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return channels == 1 ; } <SENTENCE_END/>

mono

<SENTENCE_START> { return channels == 1 ; } <SENTENCE_END/>

(Copy Probability: 7.1%)

<SENTENCE_START> { return channels == 1 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return channels == 1 ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { return channels == 1 ; } <SENTENCE_END/>

Original Name get,latency

get

<SENTENCE_START> { return ( int ) ( seconds per buffer * buffer count * 1000 ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return ( int ) ( seconds per buffer * buffer count * 1000 ) ; } <SENTENCE_END/>

latency

<SENTENCE_START> { return ( int ) ( seconds per buffer * buffer count * 1000 ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return ( int ) ( seconds per buffer * buffer count * 1000 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( int ) ( seconds per buffer * buffer count * 1000 ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return ( int ) ( seconds per buffer * buffer count * 1000 ) ; } <SENTENCE_END/>

Original Name render,vector,at

render

<SENTENCE_START> { renderer . line ( x , y , x + v . x , y + v . y ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { renderer . line ( x , y , x + v . x , y + v . y ) ; } <SENTENCE_END/>

vector

<SENTENCE_START> { renderer . line ( x , y , x + v . x , y + v . y ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { renderer . line ( x , y , x + v . x , y + v . y ) ; } <SENTENCE_END/>

at

<SENTENCE_START> { renderer . line ( x , y , x + v . x , y + v . y ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { renderer . line ( x , y , x + v . x , y + v . y ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { renderer . line ( x , y , x + v . x , y + v . y ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { renderer . line ( x , y , x + v . x , y + v . y ) ; } <SENTENCE_END/>

Original Name allocate

allocate

<SENTENCE_START> { if ( capacity < 0 ) { throw new illegal argument exception ( ) ; } return buffer factory . new long buffer ( capacity ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { if ( capacity < 0 ) { throw new illegal argument exception ( ) ; } return buffer factory . new long buffer ( capacity ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( capacity < 0 ) { throw new illegal argument exception ( ) ; } return buffer factory . new long buffer ( capacity ) ; } <SENTENCE_END/>

(Copy Probability: 6.4%)

<SENTENCE_START> { if ( capacity < 0 ) { throw new illegal argument exception ( ) ; } return buffer factory . new long buffer ( capacity ) ; } <SENTENCE_END/>

Original Name wrap

wrap

<SENTENCE_START> { return %SELF% ( array , 0 , array . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return %SELF% ( array , 0 , array . length ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( array , 0 , array . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return %SELF% ( array , 0 , array . length ) ; } <SENTENCE_END/>

Original Name wrap

wrap

<SENTENCE_START> { if ( array == null ) { throw new null pointer exception ( ) ; } if ( start < 0 || len < 0 || ( long ) len + ( long ) start > array . length ) { throw new index out of bounds exception ( ) ; } long buffer buf = buffer factory . new long buffer ( array ) ; buf . position = start ; buf . limit = start + len ; return buf ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( array == null ) { throw new null pointer exception ( ) ; } if ( start < 0 || len < 0 || ( long ) len + ( long ) start > array . length ) { throw new index out of bounds exception ( ) ; } long buffer buf = buffer factory . new long buffer ( array ) ; buf . position = start ; buf . limit = start + len ; return buf ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( array == null ) { throw new null pointer exception ( ) ; } if ( start < 0 || len < 0 || ( long ) len + ( long ) start > array . length ) { throw new index out of bounds exception ( ) ; } long buffer buf = buffer factory . new long buffer ( array ) ; buf . position = start ; buf . limit = start + len ; return buf ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { if ( array == null ) { throw new null pointer exception ( ) ; } if ( start < 0 || len < 0 || ( long ) len + ( long ) start > array . length ) { throw new index out of bounds exception ( ) ; } long buffer buf = buffer factory . new long buffer ( array ) ; buf . position = start ; buf . limit = start + len ; return buf ; } <SENTENCE_END/>

Original Name array

array

<SENTENCE_START> { return protected array ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return protected array ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return protected array ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { return protected array ( ) ; } <SENTENCE_END/>

Original Name array,offset

array

<SENTENCE_START> { return protected array offset ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return protected array offset ( ) ; } <SENTENCE_END/>

offset

<SENTENCE_START> { return protected array offset ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return protected array offset ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return protected array offset ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { return protected array offset ( ) ; } <SENTENCE_END/>

Original Name compare,to

compare

<SENTENCE_START> { int compare remaining = ( remaining ( ) < other buffer . remaining ( ) ) ? remaining ( ) : other buffer . remaining ( ) ; int this pos = position ; int other pos = other buffer . position ; long this long , other long ; while ( compare remaining > 0 ) { this long = get ( this pos ) ; other long = other buffer . get ( other pos ) ; if ( this long != other long ) { return this long < other long ? - 1 : 1 ; } this pos ++ ; other pos ++ ; compare remaining -- ; } return remaining ( ) - other buffer . remaining ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { int compare remaining = ( remaining ( ) < other buffer . remaining ( ) ) ? remaining ( ) : other buffer . remaining ( ) ; int this pos = position ; int other pos = other buffer . position ; long this long , other long ; while ( compare remaining > 0 ) { this long = get ( this pos ) ; other long = other buffer . get ( other pos ) ; if ( this long != other long ) { return this long < other long ? - 1 : 1 ; } this pos ++ ; other pos ++ ; compare remaining -- ; } return remaining ( ) - other buffer . remaining ( ) ; } <SENTENCE_END/>

to

<SENTENCE_START> { int compare remaining = ( remaining ( ) < other buffer . remaining ( ) ) ? remaining ( ) : other buffer . remaining ( ) ; int this pos = position ; int other pos = other buffer . position ; long this long , other long ; while ( compare remaining > 0 ) { this long = get ( this pos ) ; other long = other buffer . get ( other pos ) ; if ( this long != other long ) { return this long < other long ? - 1 : 1 ; } this pos ++ ; other pos ++ ; compare remaining -- ; } return remaining ( ) - other buffer . remaining ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { int compare remaining = ( remaining ( ) < other buffer . remaining ( ) ) ? remaining ( ) : other buffer . remaining ( ) ; int this pos = position ; int other pos = other buffer . position ; long this long , other long ; while ( compare remaining > 0 ) { this long = get ( this pos ) ; other long = other buffer . get ( other pos ) ; if ( this long != other long ) { return this long < other long ? - 1 : 1 ; } this pos ++ ; other pos ++ ; compare remaining -- ; } return remaining ( ) - other buffer . remaining ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int compare remaining = ( remaining ( ) < other buffer . remaining ( ) ) ? remaining ( ) : other buffer . remaining ( ) ; int this pos = position ; int other pos = other buffer . position ; long this long , other long ; while ( compare remaining > 0 ) { this long = get ( this pos ) ; other long = other buffer . get ( other pos ) ; if ( this long != other long ) { return this long < other long ? - 1 : 1 ; } this pos ++ ; other pos ++ ; compare remaining -- ; } return remaining ( ) - other buffer . remaining ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { int compare remaining = ( remaining ( ) < other buffer . remaining ( ) ) ? remaining ( ) : other buffer . remaining ( ) ; int this pos = position ; int other pos = other buffer . position ; long this long , other long ; while ( compare remaining > 0 ) { this long = get ( this pos ) ; other long = other buffer . get ( other pos ) ; if ( this long != other long ) { return this long < other long ? - 1 : 1 ; } this pos ++ ; other pos ++ ; compare remaining -- ; } return remaining ( ) - other buffer . remaining ( ) ; } <SENTENCE_END/>

Original Name equals

equals

<SENTENCE_START> { if ( ! ( other instanceof long buffer ) ) { return false ; } long buffer other buffer = ( long buffer ) other ; if ( remaining ( ) != other buffer . remaining ( ) ) { return false ; } int my position = position ; int other position = other buffer . position ; boolean equal so far = true ; while ( equal so far && ( my position < limit ) ) { equal so far = get ( my position ++ ) == other buffer . get ( other position ++ ) ; } return equal so far ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { if ( ! ( other instanceof long buffer ) ) { return false ; } long buffer other buffer = ( long buffer ) other ; if ( remaining ( ) != other buffer . remaining ( ) ) { return false ; } int my position = position ; int other position = other buffer . position ; boolean equal so far = true ; while ( equal so far && ( my position < limit ) ) { equal so far = get ( my position ++ ) == other buffer . get ( other position ++ ) ; } return equal so far ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! ( other instanceof long buffer ) ) { return false ; } long buffer other buffer = ( long buffer ) other ; if ( remaining ( ) != other buffer . remaining ( ) ) { return false ; } int my position = position ; int other position = other buffer . position ; boolean equal so far = true ; while ( equal so far && ( my position < limit ) ) { equal so far = get ( my position ++ ) == other buffer . get ( other position ++ ) ; } return equal so far ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( ! ( other instanceof long buffer ) ) { return false ; } long buffer other buffer = ( long buffer ) other ; if ( remaining ( ) != other buffer . remaining ( ) ) { return false ; } int my position = position ; int other position = other buffer . position ; boolean equal so far = true ; while ( equal so far && ( my position < limit ) ) { equal so far = get ( my position ++ ) == other buffer . get ( other position ++ ) ; } return equal so far ; } <SENTENCE_END/>

Original Name get

get

<SENTENCE_START> { return %SELF% ( dest , 0 , dest . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return %SELF% ( dest , 0 , dest . length ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( dest , 0 , dest . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return %SELF% ( dest , 0 , dest . length ) ; } <SENTENCE_END/>

Original Name get

get

<SENTENCE_START> { int length = dest . length ; if ( off < 0 || len < 0 || ( long ) len + ( long ) off > length ) { throw new index out of bounds exception ( ) ; } if ( len > remaining ( ) ) { throw new buffer underflow exception ( ) ; } for ( int i = off ; i < off + len ; i ++ ) { dest [ i ] = %SELF% ( ) ; } return this ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { int length = dest . length ; if ( off < 0 || len < 0 || ( long ) len + ( long ) off > length ) { throw new index out of bounds exception ( ) ; } if ( len > remaining ( ) ) { throw new buffer underflow exception ( ) ; } for ( int i = off ; i < off + len ; i ++ ) { dest [ i ] = %SELF% ( ) ; } return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int length = dest . length ; if ( off < 0 || len < 0 || ( long ) len + ( long ) off > length ) { throw new index out of bounds exception ( ) ; } if ( len > remaining ( ) ) { throw new buffer underflow exception ( ) ; } for ( int i = off ; i < off + len ; i ++ ) { dest [ i ] = %SELF% ( ) ; } return this ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { int length = dest . length ; if ( off < 0 || len < 0 || ( long ) len + ( long ) off > length ) { throw new index out of bounds exception ( ) ; } if ( len > remaining ( ) ) { throw new buffer underflow exception ( ) ; } for ( int i = off ; i < off + len ; i ++ ) { dest [ i ] = %SELF% ( ) ; } return this ; } <SENTENCE_END/>

Original Name has,array

has

<SENTENCE_START> { return protected has array ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return protected has array ( ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { return protected has array ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { return protected has array ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return protected has array ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return protected has array ( ) ; } <SENTENCE_END/>

Original Name hash,code

hash

<SENTENCE_START> { int my position = position ; int hash = 0 ; long l ; while ( my position < limit ) { l = get ( my position ++ ) ; hash = hash + ( ( int ) l ) ^ ( ( int ) ( l >> 32 ) ) ; } return hash ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { int my position = position ; int hash = 0 ; long l ; while ( my position < limit ) { l = get ( my position ++ ) ; hash = hash + ( ( int ) l ) ^ ( ( int ) ( l >> 32 ) ) ; } return hash ; } <SENTENCE_END/>

code

<SENTENCE_START> { int my position = position ; int hash = 0 ; long l ; while ( my position < limit ) { l = get ( my position ++ ) ; hash = hash + ( ( int ) l ) ^ ( ( int ) ( l >> 32 ) ) ; } return hash ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { int my position = position ; int hash = 0 ; long l ; while ( my position < limit ) { l = get ( my position ++ ) ; hash = hash + ( ( int ) l ) ^ ( ( int ) ( l >> 32 ) ) ; } return hash ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int my position = position ; int hash = 0 ; long l ; while ( my position < limit ) { l = get ( my position ++ ) ; hash = hash + ( ( int ) l ) ^ ( ( int ) ( l >> 32 ) ) ; } return hash ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { int my position = position ; int hash = 0 ; long l ; while ( my position < limit ) { l = get ( my position ++ ) ; hash = hash + ( ( int ) l ) ^ ( ( int ) ( l >> 32 ) ) ; } return hash ; } <SENTENCE_END/>

Original Name put

put

<SENTENCE_START> { return %SELF% ( src , 0 , src . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return %SELF% ( src , 0 , src . length ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( src , 0 , src . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { return %SELF% ( src , 0 , src . length ) ; } <SENTENCE_END/>

Original Name put

put

<SENTENCE_START> { int length = src . length ; if ( off < 0 || len < 0 || ( long ) len + ( long ) off > length ) { throw new index out of bounds exception ( ) ; } if ( len > remaining ( ) ) { throw new buffer overflow exception ( ) ; } for ( int i = off ; i < off + len ; i ++ ) { %SELF% ( src [ i ] ) ; } return this ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { int length = src . length ; if ( off < 0 || len < 0 || ( long ) len + ( long ) off > length ) { throw new index out of bounds exception ( ) ; } if ( len > remaining ( ) ) { throw new buffer overflow exception ( ) ; } for ( int i = off ; i < off + len ; i ++ ) { %SELF% ( src [ i ] ) ; } return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int length = src . length ; if ( off < 0 || len < 0 || ( long ) len + ( long ) off > length ) { throw new index out of bounds exception ( ) ; } if ( len > remaining ( ) ) { throw new buffer overflow exception ( ) ; } for ( int i = off ; i < off + len ; i ++ ) { %SELF% ( src [ i ] ) ; } return this ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { int length = src . length ; if ( off < 0 || len < 0 || ( long ) len + ( long ) off > length ) { throw new index out of bounds exception ( ) ; } if ( len > remaining ( ) ) { throw new buffer overflow exception ( ) ; } for ( int i = off ; i < off + len ; i ++ ) { %SELF% ( src [ i ] ) ; } return this ; } <SENTENCE_END/>

Original Name put

put

<SENTENCE_START> { if ( src == this ) { throw new illegal argument exception ( ) ; } if ( src . remaining ( ) > remaining ( ) ) { throw new buffer overflow exception ( ) ; } long [ ] contents = new long [ src . remaining ( ) ] ; src . get ( contents ) ; %SELF% ( contents ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( src == this ) { throw new illegal argument exception ( ) ; } if ( src . remaining ( ) > remaining ( ) ) { throw new buffer overflow exception ( ) ; } long [ ] contents = new long [ src . remaining ( ) ] ; src . get ( contents ) ; %SELF% ( contents ) ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( src == this ) { throw new illegal argument exception ( ) ; } if ( src . remaining ( ) > remaining ( ) ) { throw new buffer overflow exception ( ) ; } long [ ] contents = new long [ src . remaining ( ) ] ; src . get ( contents ) ; %SELF% ( contents ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { if ( src == this ) { throw new illegal argument exception ( ) ; } if ( src . remaining ( ) > remaining ( ) ) { throw new buffer overflow exception ( ) ; } long [ ] contents = new long [ src . remaining ( ) ] ; src . get ( contents ) ; %SELF% ( contents ) ; return this ; } <SENTENCE_END/>

Original Name to,string

to

<SENTENCE_START> { string buffer buf = new string buffer ( ) ; buf . append ( get class ( ) . get name ( ) ) ; buf . append ( ", status: capacity=" ) ; buf . append ( capacity ( ) ) ; buf . append ( " position=" ) ; buf . append ( position ( ) ) ; buf . append ( " limit=" ) ; buf . append ( limit ( ) ) ; return buf . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { string buffer buf = new string buffer ( ) ; buf . append ( get class ( ) . get name ( ) ) ; buf . append ( ", status: capacity=" ) ; buf . append ( capacity ( ) ) ; buf . append ( " position=" ) ; buf . append ( position ( ) ) ; buf . append ( " limit=" ) ; buf . append ( limit ( ) ) ; return buf . %SELF% ( ) ; } <SENTENCE_END/>

string

<SENTENCE_START> { string buffer buf = new string buffer ( ) ; buf . append ( get class ( ) . get name ( ) ) ; buf . append ( ", status: capacity=" ) ; buf . append ( capacity ( ) ) ; buf . append ( " position=" ) ; buf . append ( position ( ) ) ; buf . append ( " limit=" ) ; buf . append ( limit ( ) ) ; return buf . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { string buffer buf = new string buffer ( ) ; buf . append ( get class ( ) . get name ( ) ) ; buf . append ( ", status: capacity=" ) ; buf . append ( capacity ( ) ) ; buf . append ( " position=" ) ; buf . append ( position ( ) ) ; buf . append ( " limit=" ) ; buf . append ( limit ( ) ) ; return buf . %SELF% ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { string buffer buf = new string buffer ( ) ; buf . append ( get class ( ) . get name ( ) ) ; buf . append ( ", status: capacity=" ) ; buf . append ( capacity ( ) ) ; buf . append ( " position=" ) ; buf . append ( position ( ) ) ; buf . append ( " limit=" ) ; buf . append ( limit ( ) ) ; return buf . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { string buffer buf = new string buffer ( ) ; buf . append ( get class ( ) . get name ( ) ) ; buf . append ( ", status: capacity=" ) ; buf . append ( capacity ( ) ) ; buf . append ( " position=" ) ; buf . append ( position ( ) ) ; buf . append ( " limit=" ) ; buf . append ( limit ( ) ) ; return buf . %SELF% ( ) ; } <SENTENCE_END/>

Original Name read

read

<SENTENCE_START> { int end = start + len ; for ( int i = start ; i < end ; i ++ ) { int r = %SELF% ( ) ; if ( r == - 1 ) { return i == start ? - 1 : i - start ; } buf [ i ] = ( byte ) r ; } return len ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { int end = start + len ; for ( int i = start ; i < end ; i ++ ) { int r = %SELF% ( ) ; if ( r == - 1 ) { return i == start ? - 1 : i - start ; } buf [ i ] = ( byte ) r ; } return len ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int end = start + len ; for ( int i = start ; i < end ; i ++ ) { int r = %SELF% ( ) ; if ( r == - 1 ) { return i == start ? - 1 : i - start ; } buf [ i ] = ( byte ) r ; } return len ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { int end = start + len ; for ( int i = start ; i < end ; i ++ ) { int r = %SELF% ( ) ; if ( r == - 1 ) { return i == start ? - 1 : i - start ; } buf [ i ] = ( byte ) r ; } return len ; } <SENTENCE_END/>

Original Name read

read

<SENTENCE_START> { return %SELF% ( buf , 0 , buf . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return %SELF% ( buf , 0 , buf . length ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( buf , 0 , buf . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { return %SELF% ( buf , 0 , buf . length ) ; } <SENTENCE_END/>

Original Name close

close

<SENTENCE_START> { } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { } <SENTENCE_END/>

%END%

<SENTENCE_START> { } <SENTENCE_END/>

(Copy Probability: 0.0%)

<SENTENCE_START> { } <SENTENCE_END/>

Original Name available

available

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

(Copy Probability: 0.2%)

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

%END%

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

(Copy Probability: 1.1%)

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

Original Name child

child

<SENTENCE_START> { if ( file . get path ( ) . length ( ) == 0 ) return new headless file handle ( new file ( name ) , type ) ; return new headless file handle ( new file ( file , name ) , type ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( file . get path ( ) . length ( ) == 0 ) return new headless file handle ( new file ( name ) , type ) ; return new headless file handle ( new file ( file , name ) , type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( file . get path ( ) . length ( ) == 0 ) return new headless file handle ( new file ( name ) , type ) ; return new headless file handle ( new file ( file , name ) , type ) ; } <SENTENCE_END/>

(Copy Probability: 12.7%)

<SENTENCE_START> { if ( file . get path ( ) . length ( ) == 0 ) return new headless file handle ( new file ( name ) , type ) ; return new headless file handle ( new file ( file , name ) , type ) ; } <SENTENCE_END/>

Original Name sibling

sibling

<SENTENCE_START> { if ( file . get path ( ) . length ( ) == 0 ) throw new gdx runtime exception ( "Cannot get the sibling of the root." ) ; return new headless file handle ( new file ( file . get parent ( ) , name ) , type ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { if ( file . get path ( ) . length ( ) == 0 ) throw new gdx runtime exception ( "Cannot get the sibling of the root." ) ; return new headless file handle ( new file ( file . get parent ( ) , name ) , type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( file . get path ( ) . length ( ) == 0 ) throw new gdx runtime exception ( "Cannot get the sibling of the root." ) ; return new headless file handle ( new file ( file . get parent ( ) , name ) , type ) ; } <SENTENCE_END/>

(Copy Probability: 5.9%)

<SENTENCE_START> { if ( file . get path ( ) . length ( ) == 0 ) throw new gdx runtime exception ( "Cannot get the sibling of the root." ) ; return new headless file handle ( new file ( file . get parent ( ) , name ) , type ) ; } <SENTENCE_END/>

Original Name parent

parent

<SENTENCE_START> { file %SELF% = file . get parent file ( ) ; if ( %SELF% == null ) { if ( type == file type . absolute ) %SELF% = new file ( "/" ) ; else %SELF% = new file ( "" ) ; } return new headless file handle ( %SELF% , type ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { file %SELF% = file . get parent file ( ) ; if ( %SELF% == null ) { if ( type == file type . absolute ) %SELF% = new file ( "/" ) ; else %SELF% = new file ( "" ) ; } return new headless file handle ( %SELF% , type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { file %SELF% = file . get parent file ( ) ; if ( %SELF% == null ) { if ( type == file type . absolute ) %SELF% = new file ( "/" ) ; else %SELF% = new file ( "" ) ; } return new headless file handle ( %SELF% , type ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { file %SELF% = file . get parent file ( ) ; if ( %SELF% == null ) { if ( type == file type . absolute ) %SELF% = new file ( "/" ) ; else %SELF% = new file ( "" ) ; } return new headless file handle ( %SELF% , type ) ; } <SENTENCE_END/>

Original Name file

file

<SENTENCE_START> { if ( type == file type . external ) return new file ( headless files . external path , %SELF% . get path ( ) ) ; if ( type == file type . local ) return new file ( headless files . local path , %SELF% . get path ( ) ) ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( type == file type . external ) return new file ( headless files . external path , %SELF% . get path ( ) ) ; if ( type == file type . local ) return new file ( headless files . local path , %SELF% . get path ( ) ) ; return %SELF% ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( type == file type . external ) return new file ( headless files . external path , %SELF% . get path ( ) ) ; if ( type == file type . local ) return new file ( headless files . local path , %SELF% . get path ( ) ) ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 18.3%)

<SENTENCE_START> { if ( type == file type . external ) return new file ( headless files . external path , %SELF% . get path ( ) ) ; if ( type == file type . local ) return new file ( headless files . local path , %SELF% . get path ( ) ) ; return %SELF% ; } <SENTENCE_END/>

Original Name put

put

<SENTENCE_START> { if ( key == 0 ) { v old value = zero value ; zero value = value ; if ( ! has zero value ) { has zero value = true ; size ++ ; } return old value ; } int [ ] key table = this . key table ; int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == key ) { v old value = value table [ index 1 ] ; value table [ index 1 ] = value ; return old value ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == key ) { v old value = value table [ index 2 ] ; value table [ index 2 ] = value ; return old value ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == key ) { v old value = value table [ index 3 ] ; value table [ index 3 ] = value ; return old value ; } for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; value table [ i ] = value ; return old value ; } } if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; return null ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { if ( key == 0 ) { v old value = zero value ; zero value = value ; if ( ! has zero value ) { has zero value = true ; size ++ ; } return old value ; } int [ ] key table = this . key table ; int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == key ) { v old value = value table [ index 1 ] ; value table [ index 1 ] = value ; return old value ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == key ) { v old value = value table [ index 2 ] ; value table [ index 2 ] = value ; return old value ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == key ) { v old value = value table [ index 3 ] ; value table [ index 3 ] = value ; return old value ; } for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; value table [ i ] = value ; return old value ; } } if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; return null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( key == 0 ) { v old value = zero value ; zero value = value ; if ( ! has zero value ) { has zero value = true ; size ++ ; } return old value ; } int [ ] key table = this . key table ; int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == key ) { v old value = value table [ index 1 ] ; value table [ index 1 ] = value ; return old value ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == key ) { v old value = value table [ index 2 ] ; value table [ index 2 ] = value ; return old value ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == key ) { v old value = value table [ index 3 ] ; value table [ index 3 ] = value ; return old value ; } for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; value table [ i ] = value ; return old value ; } } if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; return null ; } <SENTENCE_END/>

(Copy Probability: 23.6%)

<SENTENCE_START> { if ( key == 0 ) { v old value = zero value ; zero value = value ; if ( ! has zero value ) { has zero value = true ; size ++ ; } return old value ; } int [ ] key table = this . key table ; int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == key ) { v old value = value table [ index 1 ] ; value table [ index 1 ] = value ; return old value ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == key ) { v old value = value table [ index 2 ] ; value table [ index 2 ] = value ; return old value ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == key ) { v old value = value table [ index 3 ] ; value table [ index 3 ] = value ; return old value ; } for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; value table [ i ] = value ; return old value ; } } if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return null ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; return null ; } <SENTENCE_END/>

Original Name put,all

put

<SENTENCE_START> { for ( entry < v > entry : map . entries ( ) ) put ( entry . key , entry . value ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { for ( entry < v > entry : map . entries ( ) ) put ( entry . key , entry . value ) ; } <SENTENCE_END/>

all

<SENTENCE_START> { for ( entry < v > entry : map . entries ( ) ) put ( entry . key , entry . value ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { for ( entry < v > entry : map . entries ( ) ) put ( entry . key , entry . value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( entry < v > entry : map . entries ( ) ) put ( entry . key , entry . value ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { for ( entry < v > entry : map . entries ( ) ) put ( entry . key , entry . value ) ; } <SENTENCE_END/>

Original Name put,resize

put

<SENTENCE_START> { if ( key == 0 ) { zero value = value ; has zero value = true ; return ; } int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { if ( key == 0 ) { zero value = value ; has zero value = true ; return ; } int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; } <SENTENCE_END/>

resize

<SENTENCE_START> { if ( key == 0 ) { zero value = value ; has zero value = true ; return ; } int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; } <SENTENCE_END/>

(Copy Probability: 24.4%)

<SENTENCE_START> { if ( key == 0 ) { zero value = value ; has zero value = true ; return ; } int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( key == 0 ) { zero value = value ; has zero value = true ; return ; } int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; } <SENTENCE_END/>

(Copy Probability: 6.6%)

<SENTENCE_START> { if ( key == 0 ) { zero value = value ; has zero value = true ; return ; } int index 1 = key & mask ; int key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = key ; value table [ index 1 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 2 = hash 2 ( key ) ; int key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = key ; value table [ index 2 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } int index 3 = hash 3 ( key ) ; int key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = key ; value table [ index 3 ] = value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } push ( key , value , index 1 , key 1 , index 2 , key 2 , index 3 , key 3 ) ; } <SENTENCE_END/>

Original Name push

push

<SENTENCE_START> { int [ ] key table = this . key table ; v [ ] value table = this . value table ; int mask = this . mask ; int evicted key ; v evicted value ; int i = 0 , push iterations = this . push iterations ; do { switch ( math utils . random ( 2 ) ) { case 0 : evicted key = key 1 ; evicted value = value table [ index 1 ] ; key table [ index 1 ] = insert key ; value table [ index 1 ] = insert value ; break ; case 1 : evicted key = key 2 ; evicted value = value table [ index 2 ] ; key table [ index 2 ] = insert key ; value table [ index 2 ] = insert value ; break ; default : evicted key = key 3 ; evicted value = value table [ index 3 ] ; key table [ index 3 ] = insert key ; value table [ index 3 ] = insert value ; break ; } index 1 = evicted key & mask ; key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = evicted key ; value table [ index 1 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } index 2 = hash 2 ( evicted key ) ; key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = evicted key ; value table [ index 2 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } index 3 = hash 3 ( evicted key ) ; key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = evicted key ; value table [ index 3 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } if ( ++ i == push iterations ) break ; insert key = evicted key ; insert value = evicted value ; } while ( true ) ; put stash ( evicted key , evicted value ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { int [ ] key table = this . key table ; v [ ] value table = this . value table ; int mask = this . mask ; int evicted key ; v evicted value ; int i = 0 , push iterations = this . push iterations ; do { switch ( math utils . random ( 2 ) ) { case 0 : evicted key = key 1 ; evicted value = value table [ index 1 ] ; key table [ index 1 ] = insert key ; value table [ index 1 ] = insert value ; break ; case 1 : evicted key = key 2 ; evicted value = value table [ index 2 ] ; key table [ index 2 ] = insert key ; value table [ index 2 ] = insert value ; break ; default : evicted key = key 3 ; evicted value = value table [ index 3 ] ; key table [ index 3 ] = insert key ; value table [ index 3 ] = insert value ; break ; } index 1 = evicted key & mask ; key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = evicted key ; value table [ index 1 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } index 2 = hash 2 ( evicted key ) ; key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = evicted key ; value table [ index 2 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } index 3 = hash 3 ( evicted key ) ; key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = evicted key ; value table [ index 3 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } if ( ++ i == push iterations ) break ; insert key = evicted key ; insert value = evicted value ; } while ( true ) ; put stash ( evicted key , evicted value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int [ ] key table = this . key table ; v [ ] value table = this . value table ; int mask = this . mask ; int evicted key ; v evicted value ; int i = 0 , push iterations = this . push iterations ; do { switch ( math utils . random ( 2 ) ) { case 0 : evicted key = key 1 ; evicted value = value table [ index 1 ] ; key table [ index 1 ] = insert key ; value table [ index 1 ] = insert value ; break ; case 1 : evicted key = key 2 ; evicted value = value table [ index 2 ] ; key table [ index 2 ] = insert key ; value table [ index 2 ] = insert value ; break ; default : evicted key = key 3 ; evicted value = value table [ index 3 ] ; key table [ index 3 ] = insert key ; value table [ index 3 ] = insert value ; break ; } index 1 = evicted key & mask ; key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = evicted key ; value table [ index 1 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } index 2 = hash 2 ( evicted key ) ; key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = evicted key ; value table [ index 2 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } index 3 = hash 3 ( evicted key ) ; key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = evicted key ; value table [ index 3 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } if ( ++ i == push iterations ) break ; insert key = evicted key ; insert value = evicted value ; } while ( true ) ; put stash ( evicted key , evicted value ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { int [ ] key table = this . key table ; v [ ] value table = this . value table ; int mask = this . mask ; int evicted key ; v evicted value ; int i = 0 , push iterations = this . push iterations ; do { switch ( math utils . random ( 2 ) ) { case 0 : evicted key = key 1 ; evicted value = value table [ index 1 ] ; key table [ index 1 ] = insert key ; value table [ index 1 ] = insert value ; break ; case 1 : evicted key = key 2 ; evicted value = value table [ index 2 ] ; key table [ index 2 ] = insert key ; value table [ index 2 ] = insert value ; break ; default : evicted key = key 3 ; evicted value = value table [ index 3 ] ; key table [ index 3 ] = insert key ; value table [ index 3 ] = insert value ; break ; } index 1 = evicted key & mask ; key 1 = key table [ index 1 ] ; if ( key 1 == empty ) { key table [ index 1 ] = evicted key ; value table [ index 1 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } index 2 = hash 2 ( evicted key ) ; key 2 = key table [ index 2 ] ; if ( key 2 == empty ) { key table [ index 2 ] = evicted key ; value table [ index 2 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } index 3 = hash 3 ( evicted key ) ; key 3 = key table [ index 3 ] ; if ( key 3 == empty ) { key table [ index 3 ] = evicted key ; value table [ index 3 ] = evicted value ; if ( size ++ >= threshold ) resize ( capacity << 1 ) ; return ; } if ( ++ i == push iterations ) break ; insert key = evicted key ; insert value = evicted value ; } while ( true ) ; put stash ( evicted key , evicted value ) ; } <SENTENCE_END/>

Original Name put,stash

put

<SENTENCE_START> { if ( stash size == stash capacity ) { resize ( capacity << 1 ) ; put ( key , value ) ; return ; } int index = capacity + stash size ; key table [ index ] = key ; value table [ index ] = value ; stash size ++ ; size ++ ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { if ( stash size == stash capacity ) { resize ( capacity << 1 ) ; put ( key , value ) ; return ; } int index = capacity + stash size ; key table [ index ] = key ; value table [ index ] = value ; stash size ++ ; size ++ ; } <SENTENCE_END/>

stash

<SENTENCE_START> { if ( stash size == stash capacity ) { resize ( capacity << 1 ) ; put ( key , value ) ; return ; } int index = capacity + stash size ; key table [ index ] = key ; value table [ index ] = value ; stash size ++ ; size ++ ; } <SENTENCE_END/>

(Copy Probability: 97.5%)

<SENTENCE_START> { if ( stash size == stash capacity ) { resize ( capacity << 1 ) ; put ( key , value ) ; return ; } int index = capacity + stash size ; key table [ index ] = key ; value table [ index ] = value ; stash size ++ ; size ++ ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( stash size == stash capacity ) { resize ( capacity << 1 ) ; put ( key , value ) ; return ; } int index = capacity + stash size ; key table [ index ] = key ; value table [ index ] = value ; stash size ++ ; size ++ ; } <SENTENCE_END/>

(Copy Probability: 12.5%)

<SENTENCE_START> { if ( stash size == stash capacity ) { resize ( capacity << 1 ) ; put ( key , value ) ; return ; } int index = capacity + stash size ; key table [ index ] = key ; value table [ index ] = value ; stash size ++ ; size ++ ; } <SENTENCE_END/>

Original Name get

get

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return null ; return zero value ; } int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return get stash ( key , null ) ; } } return value table [ index ] ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return null ; return zero value ; } int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return get stash ( key , null ) ; } } return value table [ index ] ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return null ; return zero value ; } int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return get stash ( key , null ) ; } } return value table [ index ] ; } <SENTENCE_END/>

(Copy Probability: 13.6%)

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return null ; return zero value ; } int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return get stash ( key , null ) ; } } return value table [ index ] ; } <SENTENCE_END/>

Original Name get

get

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return default value ; return zero value ; } int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return get stash ( key , default value ) ; } } return value table [ index ] ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return default value ; return zero value ; } int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return get stash ( key , default value ) ; } } return value table [ index ] ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return default value ; return zero value ; } int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return get stash ( key , default value ) ; } } return value table [ index ] ; } <SENTENCE_END/>

(Copy Probability: 17.4%)

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return default value ; return zero value ; } int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return get stash ( key , default value ) ; } } return value table [ index ] ; } <SENTENCE_END/>

Original Name get,stash

get

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return value table [ i ] ; return default value ; } <SENTENCE_END/>

(Copy Probability: 5.9%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return value table [ i ] ; return default value ; } <SENTENCE_END/>

stash

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return value table [ i ] ; return default value ; } <SENTENCE_END/>

(Copy Probability: 94.8%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return value table [ i ] ; return default value ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return value table [ i ] ; return default value ; } <SENTENCE_END/>

(Copy Probability: 75.0%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return value table [ i ] ; return default value ; } <SENTENCE_END/>

Original Name remove

remove

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return null ; v old value = zero value ; zero value = null ; has zero value = false ; size -- ; return old value ; } int index = key & mask ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } index = hash 2 ( key ) ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } index = hash 3 ( key ) ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } return remove stash ( key ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return null ; v old value = zero value ; zero value = null ; has zero value = false ; size -- ; return old value ; } int index = key & mask ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } index = hash 2 ( key ) ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } index = hash 3 ( key ) ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } return remove stash ( key ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return null ; v old value = zero value ; zero value = null ; has zero value = false ; size -- ; return old value ; } int index = key & mask ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } index = hash 2 ( key ) ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } index = hash 3 ( key ) ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } return remove stash ( key ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { if ( key == 0 ) { if ( ! has zero value ) return null ; v old value = zero value ; zero value = null ; has zero value = false ; size -- ; return old value ; } int index = key & mask ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } index = hash 2 ( key ) ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } index = hash 3 ( key ) ; if ( key table [ index ] == key ) { key table [ index ] = empty ; v old value = value table [ index ] ; value table [ index ] = null ; size -- ; return old value ; } return remove stash ( key ) ; } <SENTENCE_END/>

Original Name remove,stash

remove

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; remove stash index ( i ) ; size -- ; return old value ; } } return null ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; remove stash index ( i ) ; size -- ; return old value ; } } return null ; } <SENTENCE_END/>

stash

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; remove stash index ( i ) ; size -- ; return old value ; } } return null ; } <SENTENCE_END/>

(Copy Probability: 81.0%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; remove stash index ( i ) ; size -- ; return old value ; } } return null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; remove stash index ( i ) ; size -- ; return old value ; } } return null ; } <SENTENCE_END/>

(Copy Probability: 26.3%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) { if ( key table [ i ] == key ) { v old value = value table [ i ] ; remove stash index ( i ) ; size -- ; return old value ; } } return null ; } <SENTENCE_END/>

Original Name remove,stash,index

remove

<SENTENCE_START> { stash size -- ; int last index = capacity + stash size ; if ( index < last index ) { key table [ index ] = key table [ last index ] ; value table [ index ] = value table [ last index ] ; value table [ last index ] = null ; } else value table [ index ] = null ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { stash size -- ; int last index = capacity + stash size ; if ( index < last index ) { key table [ index ] = key table [ last index ] ; value table [ index ] = value table [ last index ] ; value table [ last index ] = null ; } else value table [ index ] = null ; } <SENTENCE_END/>

stash

<SENTENCE_START> { stash size -- ; int last index = capacity + stash size ; if ( index < last index ) { key table [ index ] = key table [ last index ] ; value table [ index ] = value table [ last index ] ; value table [ last index ] = null ; } else value table [ index ] = null ; } <SENTENCE_END/>

(Copy Probability: 92.3%)

<SENTENCE_START> { stash size -- ; int last index = capacity + stash size ; if ( index < last index ) { key table [ index ] = key table [ last index ] ; value table [ index ] = value table [ last index ] ; value table [ last index ] = null ; } else value table [ index ] = null ; } <SENTENCE_END/>

index

<SENTENCE_START> { stash size -- ; int last index = capacity + stash size ; if ( index < last index ) { key table [ index ] = key table [ last index ] ; value table [ index ] = value table [ last index ] ; value table [ last index ] = null ; } else value table [ index ] = null ; } <SENTENCE_END/>

(Copy Probability: 5.4%)

<SENTENCE_START> { stash size -- ; int last index = capacity + stash size ; if ( index < last index ) { key table [ index ] = key table [ last index ] ; value table [ index ] = value table [ last index ] ; value table [ last index ] = null ; } else value table [ index ] = null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { stash size -- ; int last index = capacity + stash size ; if ( index < last index ) { key table [ index ] = key table [ last index ] ; value table [ index ] = value table [ last index ] ; value table [ last index ] = null ; } else value table [ index ] = null ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { stash size -- ; int last index = capacity + stash size ; if ( index < last index ) { key table [ index ] = key table [ last index ] ; value table [ index ] = value table [ last index ] ; value table [ last index ] = null ; } else value table [ index ] = null ; } <SENTENCE_END/>

Original Name shrink

shrink

<SENTENCE_START> { if ( maximum capacity < 0 ) throw new illegal argument exception ( "maximumCapacity must be >= 0: " + maximum capacity ) ; if ( size > maximum capacity ) maximum capacity = size ; if ( capacity <= maximum capacity ) return ; maximum capacity = math utils . next power of two ( maximum capacity ) ; resize ( maximum capacity ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { if ( maximum capacity < 0 ) throw new illegal argument exception ( "maximumCapacity must be >= 0: " + maximum capacity ) ; if ( size > maximum capacity ) maximum capacity = size ; if ( capacity <= maximum capacity ) return ; maximum capacity = math utils . next power of two ( maximum capacity ) ; resize ( maximum capacity ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( maximum capacity < 0 ) throw new illegal argument exception ( "maximumCapacity must be >= 0: " + maximum capacity ) ; if ( size > maximum capacity ) maximum capacity = size ; if ( capacity <= maximum capacity ) return ; maximum capacity = math utils . next power of two ( maximum capacity ) ; resize ( maximum capacity ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { if ( maximum capacity < 0 ) throw new illegal argument exception ( "maximumCapacity must be >= 0: " + maximum capacity ) ; if ( size > maximum capacity ) maximum capacity = size ; if ( capacity <= maximum capacity ) return ; maximum capacity = math utils . next power of two ( maximum capacity ) ; resize ( maximum capacity ) ; } <SENTENCE_END/>

Original Name clear

clear

<SENTENCE_START> { if ( capacity <= maximum capacity ) { %SELF% ( ) ; return ; } zero value = null ; has zero value = false ; size = 0 ; resize ( maximum capacity ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { if ( capacity <= maximum capacity ) { %SELF% ( ) ; return ; } zero value = null ; has zero value = false ; size = 0 ; resize ( maximum capacity ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( capacity <= maximum capacity ) { %SELF% ( ) ; return ; } zero value = null ; has zero value = false ; size = 0 ; resize ( maximum capacity ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { if ( capacity <= maximum capacity ) { %SELF% ( ) ; return ; } zero value = null ; has zero value = false ; size = 0 ; resize ( maximum capacity ) ; } <SENTENCE_END/>

Original Name clear

clear

<SENTENCE_START> { if ( size == 0 ) return ; int [ ] key table = this . key table ; v [ ] value table = this . value table ; for ( int i = capacity + stash size ; i -- > 0 ; ) { key table [ i ] = empty ; value table [ i ] = null ; } size = 0 ; stash size = 0 ; zero value = null ; has zero value = false ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( size == 0 ) return ; int [ ] key table = this . key table ; v [ ] value table = this . value table ; for ( int i = capacity + stash size ; i -- > 0 ; ) { key table [ i ] = empty ; value table [ i ] = null ; } size = 0 ; stash size = 0 ; zero value = null ; has zero value = false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( size == 0 ) return ; int [ ] key table = this . key table ; v [ ] value table = this . value table ; for ( int i = capacity + stash size ; i -- > 0 ; ) { key table [ i ] = empty ; value table [ i ] = null ; } size = 0 ; stash size = 0 ; zero value = null ; has zero value = false ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( size == 0 ) return ; int [ ] key table = this . key table ; v [ ] value table = this . value table ; for ( int i = capacity + stash size ; i -- > 0 ; ) { key table [ i ] = empty ; value table [ i ] = null ; } size = 0 ; stash size = 0 ; zero value = null ; has zero value = false ; } <SENTENCE_END/>

Original Name contains,value

contains

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return true ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return true ; } else if ( identity ) { if ( value == zero value ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return true ; } else { if ( has zero value && value . equals ( zero value ) ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return true ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return true ; } else if ( identity ) { if ( value == zero value ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return true ; } else { if ( has zero value && value . equals ( zero value ) ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return true ; } return false ; } <SENTENCE_END/>

value

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return true ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return true ; } else if ( identity ) { if ( value == zero value ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return true ; } else { if ( has zero value && value . equals ( zero value ) ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 7.7%)

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return true ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return true ; } else if ( identity ) { if ( value == zero value ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return true ; } else { if ( has zero value && value . equals ( zero value ) ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return true ; } return false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return true ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return true ; } else if ( identity ) { if ( value == zero value ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return true ; } else { if ( has zero value && value . equals ( zero value ) ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return true ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return true ; } else if ( identity ) { if ( value == zero value ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return true ; } else { if ( has zero value && value . equals ( zero value ) ) return true ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return true ; } return false ; } <SENTENCE_END/>

Original Name contains,key

contains

<SENTENCE_START> { if ( key == 0 ) return has zero value ; int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return contains key stash ( key ) ; } } return true ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( key == 0 ) return has zero value ; int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return contains key stash ( key ) ; } } return true ; } <SENTENCE_END/>

key

<SENTENCE_START> { if ( key == 0 ) return has zero value ; int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return contains key stash ( key ) ; } } return true ; } <SENTENCE_END/>

(Copy Probability: 5.8%)

<SENTENCE_START> { if ( key == 0 ) return has zero value ; int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return contains key stash ( key ) ; } } return true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( key == 0 ) return has zero value ; int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return contains key stash ( key ) ; } } return true ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { if ( key == 0 ) return has zero value ; int index = key & mask ; if ( key table [ index ] != key ) { index = hash 2 ( key ) ; if ( key table [ index ] != key ) { index = hash 3 ( key ) ; if ( key table [ index ] != key ) return contains key stash ( key ) ; } } return true ; } <SENTENCE_END/>

Original Name contains,key,stash

contains

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return true ; return false ; } <SENTENCE_END/>

(Copy Probability: 6.2%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return true ; return false ; } <SENTENCE_END/>

key

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return true ; return false ; } <SENTENCE_END/>

(Copy Probability: 93.3%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return true ; return false ; } <SENTENCE_END/>

stash

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return true ; return false ; } <SENTENCE_END/>

(Copy Probability: 58.4%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return true ; return false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return true ; return false ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { int [ ] key table = this . key table ; for ( int i = capacity , n = i + stash size ; i < n ; i ++ ) if ( key table [ i ] == key ) return true ; return false ; } <SENTENCE_END/>

Original Name find,key

find

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return 0 ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return key table [ i ] ; } else if ( identity ) { if ( value == zero value ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return key table [ i ] ; } else { if ( has zero value && value . equals ( zero value ) ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return key table [ i ] ; } return not found ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return 0 ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return key table [ i ] ; } else if ( identity ) { if ( value == zero value ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return key table [ i ] ; } else { if ( has zero value && value . equals ( zero value ) ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return key table [ i ] ; } return not found ; } <SENTENCE_END/>

key

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return 0 ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return key table [ i ] ; } else if ( identity ) { if ( value == zero value ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return key table [ i ] ; } else { if ( has zero value && value . equals ( zero value ) ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return key table [ i ] ; } return not found ; } <SENTENCE_END/>

(Copy Probability: 9.0%)

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return 0 ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return key table [ i ] ; } else if ( identity ) { if ( value == zero value ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return key table [ i ] ; } else { if ( has zero value && value . equals ( zero value ) ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return key table [ i ] ; } return not found ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return 0 ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return key table [ i ] ; } else if ( identity ) { if ( value == zero value ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return key table [ i ] ; } else { if ( has zero value && value . equals ( zero value ) ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return key table [ i ] ; } return not found ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { v [ ] value table = this . value table ; if ( value == null ) { if ( has zero value && zero value == null ) return 0 ; int [ ] key table = this . key table ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( key table [ i ] != empty && value table [ i ] == null ) return key table [ i ] ; } else if ( identity ) { if ( value == zero value ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value table [ i ] == value ) return key table [ i ] ; } else { if ( has zero value && value . equals ( zero value ) ) return 0 ; for ( int i = capacity + stash size ; i -- > 0 ; ) if ( value . equals ( value table [ i ] ) ) return key table [ i ] ; } return not found ; } <SENTENCE_END/>

Original Name ensure,capacity

ensure

<SENTENCE_START> { int size needed = size + additional capacity ; if ( size needed >= threshold ) resize ( math utils . next power of two ( ( int ) math . ceil ( size needed / load factor ) ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { int size needed = size + additional capacity ; if ( size needed >= threshold ) resize ( math utils . next power of two ( ( int ) math . ceil ( size needed / load factor ) ) ) ; } <SENTENCE_END/>

capacity

<SENTENCE_START> { int size needed = size + additional capacity ; if ( size needed >= threshold ) resize ( math utils . next power of two ( ( int ) math . ceil ( size needed / load factor ) ) ) ; } <SENTENCE_END/>

(Copy Probability: 6.3%)

<SENTENCE_START> { int size needed = size + additional capacity ; if ( size needed >= threshold ) resize ( math utils . next power of two ( ( int ) math . ceil ( size needed / load factor ) ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int size needed = size + additional capacity ; if ( size needed >= threshold ) resize ( math utils . next power of two ( ( int ) math . ceil ( size needed / load factor ) ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { int size needed = size + additional capacity ; if ( size needed >= threshold ) resize ( math utils . next power of two ( ( int ) math . ceil ( size needed / load factor ) ) ) ; } <SENTENCE_END/>

Original Name resize

resize

<SENTENCE_START> { int old end index = capacity + stash size ; capacity = new size ; threshold = ( int ) ( new size * load factor ) ; mask = new size - 1 ; hash shift = 31 - integer . number of trailing zeros ( new size ) ; stash capacity = math . max ( 3 , ( int ) math . ceil ( math . log ( new size ) ) * 2 ) ; push iterations = math . max ( math . min ( new size , 8 ) , ( int ) math . sqrt ( new size ) / 8 ) ; int [ ] old key table = key table ; v [ ] old value table = value table ; key table = new int [ new size + stash capacity ] ; value table = ( v [ ] ) new object [ new size + stash capacity ] ; int old size = size ; size = has zero value ? 1 : 0 ; stash size = 0 ; if ( old size > 0 ) { for ( int i = 0 ; i < old end index ; i ++ ) { int key = old key table [ i ] ; if ( key != empty ) put resize ( key , old value table [ i ] ) ; } } } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { int old end index = capacity + stash size ; capacity = new size ; threshold = ( int ) ( new size * load factor ) ; mask = new size - 1 ; hash shift = 31 - integer . number of trailing zeros ( new size ) ; stash capacity = math . max ( 3 , ( int ) math . ceil ( math . log ( new size ) ) * 2 ) ; push iterations = math . max ( math . min ( new size , 8 ) , ( int ) math . sqrt ( new size ) / 8 ) ; int [ ] old key table = key table ; v [ ] old value table = value table ; key table = new int [ new size + stash capacity ] ; value table = ( v [ ] ) new object [ new size + stash capacity ] ; int old size = size ; size = has zero value ? 1 : 0 ; stash size = 0 ; if ( old size > 0 ) { for ( int i = 0 ; i < old end index ; i ++ ) { int key = old key table [ i ] ; if ( key != empty ) put resize ( key , old value table [ i ] ) ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { int old end index = capacity + stash size ; capacity = new size ; threshold = ( int ) ( new size * load factor ) ; mask = new size - 1 ; hash shift = 31 - integer . number of trailing zeros ( new size ) ; stash capacity = math . max ( 3 , ( int ) math . ceil ( math . log ( new size ) ) * 2 ) ; push iterations = math . max ( math . min ( new size , 8 ) , ( int ) math . sqrt ( new size ) / 8 ) ; int [ ] old key table = key table ; v [ ] old value table = value table ; key table = new int [ new size + stash capacity ] ; value table = ( v [ ] ) new object [ new size + stash capacity ] ; int old size = size ; size = has zero value ? 1 : 0 ; stash size = 0 ; if ( old size > 0 ) { for ( int i = 0 ; i < old end index ; i ++ ) { int key = old key table [ i ] ; if ( key != empty ) put resize ( key , old value table [ i ] ) ; } } } <SENTENCE_END/>

(Copy Probability: 11.8%)

<SENTENCE_START> { int old end index = capacity + stash size ; capacity = new size ; threshold = ( int ) ( new size * load factor ) ; mask = new size - 1 ; hash shift = 31 - integer . number of trailing zeros ( new size ) ; stash capacity = math . max ( 3 , ( int ) math . ceil ( math . log ( new size ) ) * 2 ) ; push iterations = math . max ( math . min ( new size , 8 ) , ( int ) math . sqrt ( new size ) / 8 ) ; int [ ] old key table = key table ; v [ ] old value table = value table ; key table = new int [ new size + stash capacity ] ; value table = ( v [ ] ) new object [ new size + stash capacity ] ; int old size = size ; size = has zero value ? 1 : 0 ; stash size = 0 ; if ( old size > 0 ) { for ( int i = 0 ; i < old end index ; i ++ ) { int key = old key table [ i ] ; if ( key != empty ) put resize ( key , old value table [ i ] ) ; } } } <SENTENCE_END/>

Original Name hash,2

hash

<SENTENCE_START> { h *= prime 2 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { h *= prime 2 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

2

<SENTENCE_START> { h *= prime 2 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { h *= prime 2 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { h *= prime 2 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { h *= prime 2 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

Original Name hash,3

hash

<SENTENCE_START> { h *= prime 3 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { h *= prime 3 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

3

<SENTENCE_START> { h *= prime 3 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { h *= prime 3 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { h *= prime 3 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { h *= prime 3 ; return ( h ^ h >>> hash shift ) & mask ; } <SENTENCE_END/>

Original Name iterator

iterator

<SENTENCE_START> { return entries ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return entries ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return entries ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return entries ( ) ; } <SENTENCE_END/>

Original Name entries

entries

<SENTENCE_START> { if ( entries 1 == null ) { entries 1 = new entries ( this ) ; entries 2 = new entries ( this ) ; } if ( ! entries 1 . valid ) { entries 1 . reset ( ) ; entries 1 . valid = true ; entries 2 . valid = false ; return entries 1 ; } entries 2 . reset ( ) ; entries 2 . valid = true ; entries 1 . valid = false ; return entries 2 ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { if ( entries 1 == null ) { entries 1 = new entries ( this ) ; entries 2 = new entries ( this ) ; } if ( ! entries 1 . valid ) { entries 1 . reset ( ) ; entries 1 . valid = true ; entries 2 . valid = false ; return entries 1 ; } entries 2 . reset ( ) ; entries 2 . valid = true ; entries 1 . valid = false ; return entries 2 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( entries 1 == null ) { entries 1 = new entries ( this ) ; entries 2 = new entries ( this ) ; } if ( ! entries 1 . valid ) { entries 1 . reset ( ) ; entries 1 . valid = true ; entries 2 . valid = false ; return entries 1 ; } entries 2 . reset ( ) ; entries 2 . valid = true ; entries 1 . valid = false ; return entries 2 ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( entries 1 == null ) { entries 1 = new entries ( this ) ; entries 2 = new entries ( this ) ; } if ( ! entries 1 . valid ) { entries 1 . reset ( ) ; entries 1 . valid = true ; entries 2 . valid = false ; return entries 1 ; } entries 2 . reset ( ) ; entries 2 . valid = true ; entries 1 . valid = false ; return entries 2 ; } <SENTENCE_END/>

Original Name values

values

<SENTENCE_START> { if ( values 1 == null ) { values 1 = new values ( this ) ; values 2 = new values ( this ) ; } if ( ! values 1 . valid ) { values 1 . reset ( ) ; values 1 . valid = true ; values 2 . valid = false ; return values 1 ; } values 2 . reset ( ) ; values 2 . valid = true ; values 1 . valid = false ; return values 2 ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { if ( values 1 == null ) { values 1 = new values ( this ) ; values 2 = new values ( this ) ; } if ( ! values 1 . valid ) { values 1 . reset ( ) ; values 1 . valid = true ; values 2 . valid = false ; return values 1 ; } values 2 . reset ( ) ; values 2 . valid = true ; values 1 . valid = false ; return values 2 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( values 1 == null ) { values 1 = new values ( this ) ; values 2 = new values ( this ) ; } if ( ! values 1 . valid ) { values 1 . reset ( ) ; values 1 . valid = true ; values 2 . valid = false ; return values 1 ; } values 2 . reset ( ) ; values 2 . valid = true ; values 1 . valid = false ; return values 2 ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { if ( values 1 == null ) { values 1 = new values ( this ) ; values 2 = new values ( this ) ; } if ( ! values 1 . valid ) { values 1 . reset ( ) ; values 1 . valid = true ; values 2 . valid = false ; return values 1 ; } values 2 . reset ( ) ; values 2 . valid = true ; values 1 . valid = false ; return values 2 ; } <SENTENCE_END/>

Original Name keys

keys

<SENTENCE_START> { if ( keys 1 == null ) { keys 1 = new keys ( this ) ; keys 2 = new keys ( this ) ; } if ( ! keys 1 . valid ) { keys 1 . reset ( ) ; keys 1 . valid = true ; keys 2 . valid = false ; return keys 1 ; } keys 2 . reset ( ) ; keys 2 . valid = true ; keys 1 . valid = false ; return keys 2 ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( keys 1 == null ) { keys 1 = new keys ( this ) ; keys 2 = new keys ( this ) ; } if ( ! keys 1 . valid ) { keys 1 . reset ( ) ; keys 1 . valid = true ; keys 2 . valid = false ; return keys 1 ; } keys 2 . reset ( ) ; keys 2 . valid = true ; keys 1 . valid = false ; return keys 2 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( keys 1 == null ) { keys 1 = new keys ( this ) ; keys 2 = new keys ( this ) ; } if ( ! keys 1 . valid ) { keys 1 . reset ( ) ; keys 1 . valid = true ; keys 2 . valid = false ; return keys 1 ; } keys 2 . reset ( ) ; keys 2 . valid = true ; keys 1 . valid = false ; return keys 2 ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( keys 1 == null ) { keys 1 = new keys ( this ) ; keys 2 = new keys ( this ) ; } if ( ! keys 1 . valid ) { keys 1 . reset ( ) ; keys 1 . valid = true ; keys 2 . valid = false ; return keys 1 ; } keys 2 . reset ( ) ; keys 2 . valid = true ; keys 1 . valid = false ; return keys 2 ; } <SENTENCE_END/>

Original Name reset

reset

<SENTENCE_START> { current index = index illegal ; next index = index zero ; if ( map . has zero value ) has next = true ; else find next index ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { current index = index illegal ; next index = index zero ; if ( map . has zero value ) has next = true ; else find next index ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { current index = index illegal ; next index = index zero ; if ( map . has zero value ) has next = true ; else find next index ( ) ; } <SENTENCE_END/>

(Copy Probability: 11.9%)

<SENTENCE_START> { current index = index illegal ; next index = index zero ; if ( map . has zero value ) has next = true ; else find next index ( ) ; } <SENTENCE_END/>

Original Name find,next,index

find

<SENTENCE_START> { has next = false ; int [ ] key table = map . key table ; for ( int n = map . capacity + map . stash size ; ++ next index < n ; ) { if ( key table [ next index ] != empty ) { has next = true ; break ; } } } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { has next = false ; int [ ] key table = map . key table ; for ( int n = map . capacity + map . stash size ; ++ next index < n ; ) { if ( key table [ next index ] != empty ) { has next = true ; break ; } } } <SENTENCE_END/>

next

<SENTENCE_START> { has next = false ; int [ ] key table = map . key table ; for ( int n = map . capacity + map . stash size ; ++ next index < n ; ) { if ( key table [ next index ] != empty ) { has next = true ; break ; } } } <SENTENCE_END/>

(Copy Probability: 27.0%)

<SENTENCE_START> { has next = false ; int [ ] key table = map . key table ; for ( int n = map . capacity + map . stash size ; ++ next index < n ; ) { if ( key table [ next index ] != empty ) { has next = true ; break ; } } } <SENTENCE_END/>

index

<SENTENCE_START> { has next = false ; int [ ] key table = map . key table ; for ( int n = map . capacity + map . stash size ; ++ next index < n ; ) { if ( key table [ next index ] != empty ) { has next = true ; break ; } } } <SENTENCE_END/>

(Copy Probability: 8.7%)

<SENTENCE_START> { has next = false ; int [ ] key table = map . key table ; for ( int n = map . capacity + map . stash size ; ++ next index < n ; ) { if ( key table [ next index ] != empty ) { has next = true ; break ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { has next = false ; int [ ] key table = map . key table ; for ( int n = map . capacity + map . stash size ; ++ next index < n ; ) { if ( key table [ next index ] != empty ) { has next = true ; break ; } } } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { has next = false ; int [ ] key table = map . key table ; for ( int n = map . capacity + map . stash size ; ++ next index < n ; ) { if ( key table [ next index ] != empty ) { has next = true ; break ; } } } <SENTENCE_END/>

Original Name remove

remove

<SENTENCE_START> { if ( current index == index zero && map . has zero value ) { map . zero value = null ; map . has zero value = false ; } else if ( current index < 0 ) { throw new illegal state exception ( "next must be called before remove." ) ; } else if ( current index >= map . capacity ) { map . remove stash index ( current index ) ; next index = current index - 1 ; find next index ( ) ; } else { map . key table [ current index ] = empty ; map . value table [ current index ] = null ; } current index = index illegal ; map . size -- ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { if ( current index == index zero && map . has zero value ) { map . zero value = null ; map . has zero value = false ; } else if ( current index < 0 ) { throw new illegal state exception ( "next must be called before remove." ) ; } else if ( current index >= map . capacity ) { map . remove stash index ( current index ) ; next index = current index - 1 ; find next index ( ) ; } else { map . key table [ current index ] = empty ; map . value table [ current index ] = null ; } current index = index illegal ; map . size -- ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( current index == index zero && map . has zero value ) { map . zero value = null ; map . has zero value = false ; } else if ( current index < 0 ) { throw new illegal state exception ( "next must be called before remove." ) ; } else if ( current index >= map . capacity ) { map . remove stash index ( current index ) ; next index = current index - 1 ; find next index ( ) ; } else { map . key table [ current index ] = empty ; map . value table [ current index ] = null ; } current index = index illegal ; map . size -- ; } <SENTENCE_END/>

(Copy Probability: 11.2%)

<SENTENCE_START> { if ( current index == index zero && map . has zero value ) { map . zero value = null ; map . has zero value = false ; } else if ( current index < 0 ) { throw new illegal state exception ( "next must be called before remove." ) ; } else if ( current index >= map . capacity ) { map . remove stash index ( current index ) ; next index = current index - 1 ; find next index ( ) ; } else { map . key table [ current index ] = empty ; map . value table [ current index ] = null ; } current index = index illegal ; map . size -- ; } <SENTENCE_END/>

Original Name next

next

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; int [ ] key table = map . key table ; if ( next index == index zero ) { entry . key = 0 ; entry . value = map . zero value ; } else { entry . key = key table [ next index ] ; entry . value = map . value table [ next index ] ; } current index = next index ; find next index ( ) ; return entry ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; int [ ] key table = map . key table ; if ( next index == index zero ) { entry . key = 0 ; entry . value = map . zero value ; } else { entry . key = key table [ next index ] ; entry . value = map . value table [ next index ] ; } current index = next index ; find next index ( ) ; return entry ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; int [ ] key table = map . key table ; if ( next index == index zero ) { entry . key = 0 ; entry . value = map . zero value ; } else { entry . key = key table [ next index ] ; entry . value = map . value table [ next index ] ; } current index = next index ; find next index ( ) ; return entry ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; int [ ] key table = map . key table ; if ( next index == index zero ) { entry . key = 0 ; entry . value = map . zero value ; } else { entry . key = key table [ next index ] ; entry . value = map . value table [ next index ] ; } current index = next index ; find next index ( ) ; return entry ; } <SENTENCE_END/>

Original Name has,next

has

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

next

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

Original Name iterator

iterator

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

(Copy Probability: 0.2%)

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

%END%

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

(Copy Probability: 0.5%)

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

Original Name has,next

has

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

next

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; return %SELF% ; } <SENTENCE_END/>

Original Name next

next

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; v value ; if ( next index == index zero ) value = map . zero value ; else value = map . value table [ next index ] ; current index = next index ; find next index ( ) ; return value ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; v value ; if ( next index == index zero ) value = map . zero value ; else value = map . value table [ next index ] ; current index = next index ; find next index ( ) ; return value ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; v value ; if ( next index == index zero ) value = map . zero value ; else value = map . value table [ next index ] ; current index = next index ; find next index ( ) ; return value ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; v value ; if ( next index == index zero ) value = map . zero value ; else value = map . value table [ next index ] ; current index = next index ; find next index ( ) ; return value ; } <SENTENCE_END/>

Original Name iterator

iterator

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

(Copy Probability: 0.2%)

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

%END%

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

(Copy Probability: 0.5%)

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

Original Name to,array

to

<SENTENCE_START> { array array = new array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { array array = new array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

array

<SENTENCE_START> { array array = new array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { array array = new array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { array array = new array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { array array = new array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

Original Name next

next

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; int key = next index == index zero ? 0 : map . key table [ next index ] ; current index = next index ; find next index ( ) ; return key ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; int key = next index == index zero ? 0 : map . key table [ next index ] ; current index = next index ; find next index ( ) ; return key ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; int key = next index == index zero ? 0 : map . key table [ next index ] ; current index = next index ; find next index ( ) ; return key ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; int key = next index == index zero ? 0 : map . key table [ next index ] ; current index = next index ; find next index ( ) ; return key ; } <SENTENCE_END/>

Original Name to,array

to

<SENTENCE_START> { int array array = new int array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { int array array = new int array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

array

<SENTENCE_START> { int array array = new int array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { int array array = new int array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int array array = new int array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { int array array = new int array ( true , map . size ) ; while ( has next ) array . add ( next ( ) ) ; return array ; } <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,pools

set

<SENTENCE_START> { collision jni . bt generic pool allocator pools set ( swig c ptr , this , swigtype p p bt generic memory pool . get c ptr ( value ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { collision jni . bt generic pool allocator pools set ( swig c ptr , this , swigtype p p bt generic memory pool . get c ptr ( value ) ) ; } <SENTENCE_END/>

pools

<SENTENCE_START> { collision jni . bt generic pool allocator pools set ( swig c ptr , this , swigtype p p bt generic memory pool . get c ptr ( value ) ) ; } <SENTENCE_END/>

(Copy Probability: 88.1%)

<SENTENCE_START> { collision jni . bt generic pool allocator pools set ( swig c ptr , this , swigtype p p bt generic memory pool . get c ptr ( value ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt generic pool allocator pools set ( swig c ptr , this , swigtype p p bt generic memory pool . get c ptr ( value ) ) ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { collision jni . bt generic pool allocator pools set ( swig c ptr , this , swigtype p p bt generic memory pool . get c ptr ( value ) ) ; } <SENTENCE_END/>

Original Name get,pools

get

<SENTENCE_START> { long c ptr = collision jni . bt generic pool allocator pools get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt generic memory pool ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { long c ptr = collision jni . bt generic pool allocator pools get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt generic memory pool ( c ptr , false ) ; } <SENTENCE_END/>

pools

<SENTENCE_START> { long c ptr = collision jni . bt generic pool allocator pools get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt generic memory pool ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 83.0%)

<SENTENCE_START> { long c ptr = collision jni . bt generic pool allocator pools get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt generic memory pool ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt generic pool allocator pools get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt generic memory pool ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 11.7%)

<SENTENCE_START> { long c ptr = collision jni . bt generic pool allocator pools get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new swigtype p p bt generic memory pool ( c ptr , false ) ; } <SENTENCE_END/>

Original Name set,pool,count

set

<SENTENCE_START> { collision jni . bt generic pool allocator pool count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { collision jni . bt generic pool allocator pool count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

pool

<SENTENCE_START> { collision jni . bt generic pool allocator pool count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { collision jni . bt generic pool allocator pool count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

count

<SENTENCE_START> { collision jni . bt generic pool allocator pool count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 43.0%)

<SENTENCE_START> { collision jni . bt generic pool allocator pool count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt generic pool allocator pool count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 6.1%)

<SENTENCE_START> { collision jni . bt generic pool allocator pool count set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

Original Name get,pool,count

get

<SENTENCE_START> { return collision jni . bt generic pool allocator pool count get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return collision jni . bt generic pool allocator pool count get ( swig c ptr , this ) ; } <SENTENCE_END/>

pool

<SENTENCE_START> { return collision jni . bt generic pool allocator pool count get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { return collision jni . bt generic pool allocator pool count get ( swig c ptr , this ) ; } <SENTENCE_END/>

count

<SENTENCE_START> { return collision jni . bt generic pool allocator pool count get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 64.8%)

<SENTENCE_START> { return collision jni . bt generic pool allocator pool count get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt generic pool allocator pool count get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 6.4%)

<SENTENCE_START> { return collision jni . bt generic pool allocator pool count get ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name get,pool,capacity

get

<SENTENCE_START> { return collision jni . bt generic pool allocator get pool capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { return collision jni . bt generic pool allocator get pool capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

pool

<SENTENCE_START> { return collision jni . bt generic pool allocator get pool capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { return collision jni . bt generic pool allocator get pool capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

capacity

<SENTENCE_START> { return collision jni . bt generic pool allocator get pool capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 90.9%)

<SENTENCE_START> { return collision jni . bt generic pool allocator get pool capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt generic pool allocator get pool capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return collision jni . bt generic pool allocator get pool capacity ( swig c ptr , this ) ; } <SENTENCE_END/>

Original Name allocate

allocate

<SENTENCE_START> { return collision jni . bt generic pool allocator allocate ( swig c ptr , this , size bytes ) ; } <SENTENCE_END/>

(Copy Probability: 6.5%)

<SENTENCE_START> { return collision jni . bt generic pool allocator allocate ( swig c ptr , this , size bytes ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt generic pool allocator allocate ( swig c ptr , this , size bytes ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { return collision jni . bt generic pool allocator allocate ( swig c ptr , this , size bytes ) ; } <SENTENCE_END/>

Original Name free,memory

free

<SENTENCE_START> { return collision jni . bt generic pool allocator free memory ( swig c ptr , this , pointer ) ; } <SENTENCE_END/>

(Copy Probability: 9.9%)

<SENTENCE_START> { return collision jni . bt generic pool allocator free memory ( swig c ptr , this , pointer ) ; } <SENTENCE_END/>

memory

<SENTENCE_START> { return collision jni . bt generic pool allocator free memory ( swig c ptr , this , pointer ) ; } <SENTENCE_END/>

(Copy Probability: 96.9%)

<SENTENCE_START> { return collision jni . bt generic pool allocator free memory ( swig c ptr , this , pointer ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt generic pool allocator free memory ( swig c ptr , this , pointer ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return collision jni . bt generic pool allocator free memory ( swig c ptr , this , pointer ) ; } <SENTENCE_END/>

Original Name nano,time

nano

<SENTENCE_START> { return system . current time millis ( ) * nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return system . current time millis ( ) * nanos per milli ; } <SENTENCE_END/>

time

<SENTENCE_START> { return system . current time millis ( ) * nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { return system . current time millis ( ) * nanos per milli ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return system . current time millis ( ) * nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { return system . current time millis ( ) * nanos per milli ; } <SENTENCE_END/>

Original Name millis

millis

<SENTENCE_START> { return system . current time millis ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return system . current time millis ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return system . current time millis ( ) ; } <SENTENCE_END/>

(Copy Probability: 8.0%)

<SENTENCE_START> { return system . current time millis ( ) ; } <SENTENCE_END/>

Original Name nanos,to,millis

nanos

<SENTENCE_START> { return nanos / nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return nanos / nanos per milli ; } <SENTENCE_END/>

to

<SENTENCE_START> { return nanos / nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 5.1%)

<SENTENCE_START> { return nanos / nanos per milli ; } <SENTENCE_END/>

millis

<SENTENCE_START> { return nanos / nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 10.2%)

<SENTENCE_START> { return nanos / nanos per milli ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return nanos / nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return nanos / nanos per milli ; } <SENTENCE_END/>

Original Name millis,to,nanos

millis

<SENTENCE_START> { return millis * nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return millis * nanos per milli ; } <SENTENCE_END/>

to

<SENTENCE_START> { return millis * nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return millis * nanos per milli ; } <SENTENCE_END/>

nanos

<SENTENCE_START> { return millis * nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { return millis * nanos per milli ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return millis * nanos per milli ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { return millis * nanos per milli ; } <SENTENCE_END/>

Original Name time,since,nanos

time

<SENTENCE_START> { return nano time ( ) - prev time ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return nano time ( ) - prev time ; } <SENTENCE_END/>

since

<SENTENCE_START> { return nano time ( ) - prev time ; } <SENTENCE_END/>

(Copy Probability: 60.8%)

<SENTENCE_START> { return nano time ( ) - prev time ; } <SENTENCE_END/>

nanos

<SENTENCE_START> { return nano time ( ) - prev time ; } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { return nano time ( ) - prev time ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return nano time ( ) - prev time ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return nano time ( ) - prev time ; } <SENTENCE_END/>

Original Name time,since,millis

time

<SENTENCE_START> { return millis ( ) - prev time ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return millis ( ) - prev time ; } <SENTENCE_END/>

since

<SENTENCE_START> { return millis ( ) - prev time ; } <SENTENCE_END/>

(Copy Probability: 22.5%)

<SENTENCE_START> { return millis ( ) - prev time ; } <SENTENCE_END/>

millis

<SENTENCE_START> { return millis ( ) - prev time ; } <SENTENCE_END/>

(Copy Probability: 7.1%)

<SENTENCE_START> { return millis ( ) - prev time ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return millis ( ) - prev time ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return millis ( ) - prev time ; } <SENTENCE_END/>

Original Name put

put

<SENTENCE_START> { if ( ! contains key ( key ) ) keys . add ( key ) ; return super . %SELF% ( key , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( ! contains key ( key ) ) keys . add ( key ) ; return super . %SELF% ( key , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! contains key ( key ) ) keys . add ( key ) ; return super . %SELF% ( key , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { if ( ! contains key ( key ) ) keys . add ( key ) ; return super . %SELF% ( key , value ) ; } <SENTENCE_END/>

Original Name remove

remove

<SENTENCE_START> { keys . remove value ( key , false ) ; return super . %SELF% ( key ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { keys . remove value ( key , false ) ; return super . %SELF% ( key ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { keys . remove value ( key , false ) ; return super . %SELF% ( key ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { keys . remove value ( key , false ) ; return super . %SELF% ( key ) ; } <SENTENCE_END/>

Original Name clear

clear

<SENTENCE_START> { keys . %SELF% ( ) ; super . %SELF% ( maximum capacity ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { keys . %SELF% ( ) ; super . %SELF% ( maximum capacity ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { keys . %SELF% ( ) ; super . %SELF% ( maximum capacity ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { keys . %SELF% ( ) ; super . %SELF% ( maximum capacity ) ; } <SENTENCE_END/>

Original Name clear

clear

<SENTENCE_START> { keys . %SELF% ( ) ; super . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { keys . %SELF% ( ) ; super . %SELF% ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { keys . %SELF% ( ) ; super . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { keys . %SELF% ( ) ; super . %SELF% ( ) ; } <SENTENCE_END/>

Original Name ordered,keys

ordered

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

(Copy Probability: 0.3%)

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

keys

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

(Copy Probability: 13.1%)

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

%END%

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

(Copy Probability: 0.3%)

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

Original Name iterator

iterator

<SENTENCE_START> { return entries ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return entries ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return entries ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return entries ( ) ; } <SENTENCE_END/>

Original Name entries

entries

<SENTENCE_START> { if ( entries 1 == null ) { entries 1 = new ordered map entries ( this ) ; entries 2 = new ordered map entries ( this ) ; } if ( ! entries 1 . valid ) { entries 1 . reset ( ) ; entries 1 . valid = true ; entries 2 . valid = false ; return entries 1 ; } entries 2 . reset ( ) ; entries 2 . valid = true ; entries 1 . valid = false ; return entries 2 ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( entries 1 == null ) { entries 1 = new ordered map entries ( this ) ; entries 2 = new ordered map entries ( this ) ; } if ( ! entries 1 . valid ) { entries 1 . reset ( ) ; entries 1 . valid = true ; entries 2 . valid = false ; return entries 1 ; } entries 2 . reset ( ) ; entries 2 . valid = true ; entries 1 . valid = false ; return entries 2 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( entries 1 == null ) { entries 1 = new ordered map entries ( this ) ; entries 2 = new ordered map entries ( this ) ; } if ( ! entries 1 . valid ) { entries 1 . reset ( ) ; entries 1 . valid = true ; entries 2 . valid = false ; return entries 1 ; } entries 2 . reset ( ) ; entries 2 . valid = true ; entries 1 . valid = false ; return entries 2 ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { if ( entries 1 == null ) { entries 1 = new ordered map entries ( this ) ; entries 2 = new ordered map entries ( this ) ; } if ( ! entries 1 . valid ) { entries 1 . reset ( ) ; entries 1 . valid = true ; entries 2 . valid = false ; return entries 1 ; } entries 2 . reset ( ) ; entries 2 . valid = true ; entries 1 . valid = false ; return entries 2 ; } <SENTENCE_END/>

Original Name values

values

<SENTENCE_START> { if ( values 1 == null ) { values 1 = new ordered map values ( this ) ; values 2 = new ordered map values ( this ) ; } if ( ! values 1 . valid ) { values 1 . reset ( ) ; values 1 . valid = true ; values 2 . valid = false ; return values 1 ; } values 2 . reset ( ) ; values 2 . valid = true ; values 1 . valid = false ; return values 2 ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { if ( values 1 == null ) { values 1 = new ordered map values ( this ) ; values 2 = new ordered map values ( this ) ; } if ( ! values 1 . valid ) { values 1 . reset ( ) ; values 1 . valid = true ; values 2 . valid = false ; return values 1 ; } values 2 . reset ( ) ; values 2 . valid = true ; values 1 . valid = false ; return values 2 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( values 1 == null ) { values 1 = new ordered map values ( this ) ; values 2 = new ordered map values ( this ) ; } if ( ! values 1 . valid ) { values 1 . reset ( ) ; values 1 . valid = true ; values 2 . valid = false ; return values 1 ; } values 2 . reset ( ) ; values 2 . valid = true ; values 1 . valid = false ; return values 2 ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { if ( values 1 == null ) { values 1 = new ordered map values ( this ) ; values 2 = new ordered map values ( this ) ; } if ( ! values 1 . valid ) { values 1 . reset ( ) ; values 1 . valid = true ; values 2 . valid = false ; return values 1 ; } values 2 . reset ( ) ; values 2 . valid = true ; values 1 . valid = false ; return values 2 ; } <SENTENCE_END/>

Original Name keys

keys

<SENTENCE_START> { if ( keys 1 == null ) { keys 1 = new ordered map keys ( this ) ; keys 2 = new ordered map keys ( this ) ; } if ( ! keys 1 . valid ) { keys 1 . reset ( ) ; keys 1 . valid = true ; keys 2 . valid = false ; return keys 1 ; } keys 2 . reset ( ) ; keys 2 . valid = true ; keys 1 . valid = false ; return keys 2 ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { if ( keys 1 == null ) { keys 1 = new ordered map keys ( this ) ; keys 2 = new ordered map keys ( this ) ; } if ( ! keys 1 . valid ) { keys 1 . reset ( ) ; keys 1 . valid = true ; keys 2 . valid = false ; return keys 1 ; } keys 2 . reset ( ) ; keys 2 . valid = true ; keys 1 . valid = false ; return keys 2 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( keys 1 == null ) { keys 1 = new ordered map keys ( this ) ; keys 2 = new ordered map keys ( this ) ; } if ( ! keys 1 . valid ) { keys 1 . reset ( ) ; keys 1 . valid = true ; keys 2 . valid = false ; return keys 1 ; } keys 2 . reset ( ) ; keys 2 . valid = true ; keys 1 . valid = false ; return keys 2 ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { if ( keys 1 == null ) { keys 1 = new ordered map keys ( this ) ; keys 2 = new ordered map keys ( this ) ; } if ( ! keys 1 . valid ) { keys 1 . reset ( ) ; keys 1 . valid = true ; keys 2 . valid = false ; return keys 1 ; } keys 2 . reset ( ) ; keys 2 . valid = true ; keys 1 . valid = false ; return keys 2 ; } <SENTENCE_END/>

Original Name reset

reset

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

Original Name next

next

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; entry . key = keys . get ( next index ) ; entry . value = map . get ( entry . key ) ; next index ++ ; has next = next index < map . size ; return entry ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; entry . key = keys . get ( next index ) ; entry . value = map . get ( entry . key ) ; next index ++ ; has next = next index < map . size ; return entry ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; entry . key = keys . get ( next index ) ; entry . value = map . get ( entry . key ) ; next index ++ ; has next = next index < map . size ; return entry ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; entry . key = keys . get ( next index ) ; entry . value = map . get ( entry . key ) ; next index ++ ; has next = next index < map . size ; return entry ; } <SENTENCE_END/>

Original Name remove

remove

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( entry . key ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( entry . key ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( entry . key ) ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( entry . key ) ; } <SENTENCE_END/>

Original Name reset

reset

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

Original Name next

next

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; k key = keys . get ( next index ) ; next index ++ ; has next = next index < map . size ; return key ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; k key = keys . get ( next index ) ; next index ++ ; has next = next index < map . size ; return key ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; k key = keys . get ( next index ) ; next index ++ ; has next = next index < map . size ; return key ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; k key = keys . get ( next index ) ; next index ++ ; has next = next index < map . size ; return key ; } <SENTENCE_END/>

Original Name remove

remove

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( keys . get ( next index - 1 ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( keys . get ( next index - 1 ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( keys . get ( next index - 1 ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( keys . get ( next index - 1 ) ) ; } <SENTENCE_END/>

Original Name reset

reset

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { next index = 0 ; has next = map . size > 0 ; } <SENTENCE_END/>

Original Name next

next

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; v value = ( v ) map . get ( keys . get ( next index ) ) ; next index ++ ; has next = next index < map . size ; return value ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; v value = ( v ) map . get ( keys . get ( next index ) ) ; next index ++ ; has next = next index < map . size ; return value ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; v value = ( v ) map . get ( keys . get ( next index ) ) ; next index ++ ; has next = next index < map . size ; return value ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { if ( ! has next ) throw new no such element exception ( ) ; if ( ! valid ) throw new gdx runtime exception ( "#iterator() cannot be used nested." ) ; v value = ( v ) map . get ( keys . get ( next index ) ) ; next index ++ ; has next = next index < map . size ; return value ; } <SENTENCE_END/>

Original Name remove

remove

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( keys . get ( next index - 1 ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( keys . get ( next index - 1 ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( keys . get ( next index - 1 ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { if ( current index < 0 ) throw new illegal state exception ( "next must be called before remove." ) ; map . %SELF% ( keys . get ( next index - 1 ) ) ; } <SENTENCE_END/>

Original Name correctness,test

correctness

<SENTENCE_START> { string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; verify = true ; test ( runs , k ) ; print ( msg + "VERIFIED" ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; verify = true ; test ( runs , k ) ; print ( msg + "VERIFIED" ) ; } <SENTENCE_END/>

test

<SENTENCE_START> { string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; verify = true ; test ( runs , k ) ; print ( msg + "VERIFIED" ) ; } <SENTENCE_END/>

(Copy Probability: 11.1%)

<SENTENCE_START> { string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; verify = true ; test ( runs , k ) ; print ( msg + "VERIFIED" ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; verify = true ; test ( runs , k ) ; print ( msg + "VERIFIED" ) ; } <SENTENCE_END/>

(Copy Probability: 6.3%)

<SENTENCE_START> { string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; verify = true ; test ( runs , k ) ; print ( msg + "VERIFIED" ) ; } <SENTENCE_END/>

Original Name performance,test

performance

<SENTENCE_START> { verify = false ; test ( runs , k ) ; string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; print ( msg + string . format ( "avg: %.5f, min/max: %.4f/%.4f, total time: %.3f (ms), made %d comparisons" , all perf . time . min , all perf . time . max , all perf . time . average * 1000 , all perf . time . total * 1000 , comparisons made ) ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { verify = false ; test ( runs , k ) ; string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; print ( msg + string . format ( "avg: %.5f, min/max: %.4f/%.4f, total time: %.3f (ms), made %d comparisons" , all perf . time . min , all perf . time . max , all perf . time . average * 1000 , all perf . time . total * 1000 , comparisons made ) ) ; } <SENTENCE_END/>

test

<SENTENCE_START> { verify = false ; test ( runs , k ) ; string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; print ( msg + string . format ( "avg: %.5f, min/max: %.4f/%.4f, total time: %.3f (ms), made %d comparisons" , all perf . time . min , all perf . time . max , all perf . time . average * 1000 , all perf . time . total * 1000 , comparisons made ) ) ; } <SENTENCE_END/>

(Copy Probability: 10.5%)

<SENTENCE_START> { verify = false ; test ( runs , k ) ; string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; print ( msg + string . format ( "avg: %.5f, min/max: %.4f/%.4f, total time: %.3f (ms), made %d comparisons" , all perf . time . min , all perf . time . max , all perf . time . average * 1000 , all perf . time . total * 1000 , comparisons made ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { verify = false ; test ( runs , k ) ; string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; print ( msg + string . format ( "avg: %.5f, min/max: %.4f/%.4f, total time: %.3f (ms), made %d comparisons" , all perf . time . min , all perf . time . max , all perf . time . average * 1000 , all perf . time . total * 1000 , comparisons made ) ) ; } <SENTENCE_END/>

(Copy Probability: 6.8%)

<SENTENCE_START> { verify = false ; test ( runs , k ) ; string msg = string . format ( "[%d runs with %dx%d dummy game units] - " , runs , player . size , enemy . size ) ; print ( msg + string . format ( "avg: %.5f, min/max: %.4f/%.4f, total time: %.3f (ms), made %d comparisons" , all perf . time . min , all perf . time . max , all perf . time . average * 1000 , all perf . time . total * 1000 , comparisons made ) ) ; } <SENTENCE_END/>