Copy+Attentional Convolutional


Original Name cross,to,out,unsafe

cross

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

to

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

out

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

unsafe

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { assert ( out != b ) ; assert ( out != a ) ; out . x = a . y * b . z - a . z * b . y ; out . y = a . z * b . x - a . x * b . z ; out . z = a . x * b . y - a . y * b . x ; } <SENTENCE_END/>


Original Name generate

generate

<SENTENCE_START> { if ( target . os != target os . android ) throw new illegal argument exception ( "target os must be Android" ) ; if ( ! config . libs dir . exists ( ) ) { if ( ! config . libs dir . mkdirs ( ) ) throw new runtime exception ( "Couldn't create directory for shared library files in '" + config . libs dir + "'" ) ; } if ( ! config . jni dir . exists ( ) ) { if ( ! config . jni dir . mkdirs ( ) ) throw new runtime exception ( "Couldn't create native code directory '" + config . jni dir + "'" ) ; } array list < file descriptor > files = new array list < file descriptor > ( ) ; int idx = 0 ; string [ ] includes = new string [ target . c includes . length + target . cpp includes . length ] ; for ( string include : target . c includes ) includes [ idx ++ ] = config . jni dir + "/" + include ; for ( string include : target . cpp includes ) includes [ idx ++ ] = config . jni dir + "/" + include ; idx = 0 ; string [ ] excludes = new string [ target . c excludes . length + target . cpp excludes . length + 1 ] ; for ( string exclude : target . c excludes ) excludes [ idx ++ ] = config . jni dir + "/" + exclude ; for ( string exclude : target . cpp excludes ) excludes [ idx ++ ] = config . jni dir + "/" + exclude ; excludes [ idx ] = "**/target/*" ; gather source files ( config . jni dir , includes , excludes , files ) ; file descriptor application = config . jni dir . child ( "Application.mk" ) ; application . write string ( new file descriptor ( "com/badlogic/gdx/jnigen/resources/scripts/Application.mk.template" , file type . classpath ) . read string ( ) , false ) ; string template = new file descriptor ( "com/badlogic/gdx/jnigen/resources/scripts/Android.mk.template" , file type . classpath ) . read string ( ) ; string buffer src files = new string buffer ( ) ; for ( int i = 0 ; i < files . size ( ) ; i ++ ) { if ( i > 0 ) src files . append ( " " ) ; src files . append ( files . get ( i ) . path ( ) . replace ( '|' , '/' ) . replace ( config . jni dir . to string ( ) + "/" , "" ) ) ; if ( i < files . size ( ) - 1 ) src files . append ( "| " ) ; else src files . append ( " " ) ; } string buffer header dirs = new string buffer ( ) ; for ( string header dir : target . header dirs ) { header dirs . append ( header dir ) ; header dirs . append ( " " ) ; } template = template . replace ( "%sharedLibName%" , config . shared lib name ) ; template = template . replace ( "%headerDirs%" , header dirs ) ; template = template . replace ( "%cFlags%" , target . c flags ) ; template = template . replace ( "%cppFlags%" , target . cpp flags ) ; template = template . replace ( "%linkerFlags%" , target . linker flags ) ; template = template . replace ( "%srcFiles%" , src files ) ; config . jni dir . child ( "Android.mk" ) . write string ( template , false ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { if ( target . os != target os . android ) throw new illegal argument exception ( "target os must be Android" ) ; if ( ! config . libs dir . exists ( ) ) { if ( ! config . libs dir . mkdirs ( ) ) throw new runtime exception ( "Couldn't create directory for shared library files in '" + config . libs dir + "'" ) ; } if ( ! config . jni dir . exists ( ) ) { if ( ! config . jni dir . mkdirs ( ) ) throw new runtime exception ( "Couldn't create native code directory '" + config . jni dir + "'" ) ; } array list < file descriptor > files = new array list < file descriptor > ( ) ; int idx = 0 ; string [ ] includes = new string [ target . c includes . length + target . cpp includes . length ] ; for ( string include : target . c includes ) includes [ idx ++ ] = config . jni dir + "/" + include ; for ( string include : target . cpp includes ) includes [ idx ++ ] = config . jni dir + "/" + include ; idx = 0 ; string [ ] excludes = new string [ target . c excludes . length + target . cpp excludes . length + 1 ] ; for ( string exclude : target . c excludes ) excludes [ idx ++ ] = config . jni dir + "/" + exclude ; for ( string exclude : target . cpp excludes ) excludes [ idx ++ ] = config . jni dir + "/" + exclude ; excludes [ idx ] = "**/target/*" ; gather source files ( config . jni dir , includes , excludes , files ) ; file descriptor application = config . jni dir . child ( "Application.mk" ) ; application . write string ( new file descriptor ( "com/badlogic/gdx/jnigen/resources/scripts/Application.mk.template" , file type . classpath ) . read string ( ) , false ) ; string template = new file descriptor ( "com/badlogic/gdx/jnigen/resources/scripts/Android.mk.template" , file type . classpath ) . read string ( ) ; string buffer src files = new string buffer ( ) ; for ( int i = 0 ; i < files . size ( ) ; i ++ ) { if ( i > 0 ) src files . append ( " " ) ; src files . append ( files . get ( i ) . path ( ) . replace ( '|' , '/' ) . replace ( config . jni dir . to string ( ) + "/" , "" ) ) ; if ( i < files . size ( ) - 1 ) src files . append ( "| " ) ; else src files . append ( " " ) ; } string buffer header dirs = new string buffer ( ) ; for ( string header dir : target . header dirs ) { header dirs . append ( header dir ) ; header dirs . append ( " " ) ; } template = template . replace ( "%sharedLibName%" , config . shared lib name ) ; template = template . replace ( "%headerDirs%" , header dirs ) ; template = template . replace ( "%cFlags%" , target . c flags ) ; template = template . replace ( "%cppFlags%" , target . cpp flags ) ; template = template . replace ( "%linkerFlags%" , target . linker flags ) ; template = template . replace ( "%srcFiles%" , src files ) ; config . jni dir . child ( "Android.mk" ) . write string ( template , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( target . os != target os . android ) throw new illegal argument exception ( "target os must be Android" ) ; if ( ! config . libs dir . exists ( ) ) { if ( ! config . libs dir . mkdirs ( ) ) throw new runtime exception ( "Couldn't create directory for shared library files in '" + config . libs dir + "'" ) ; } if ( ! config . jni dir . exists ( ) ) { if ( ! config . jni dir . mkdirs ( ) ) throw new runtime exception ( "Couldn't create native code directory '" + config . jni dir + "'" ) ; } array list < file descriptor > files = new array list < file descriptor > ( ) ; int idx = 0 ; string [ ] includes = new string [ target . c includes . length + target . cpp includes . length ] ; for ( string include : target . c includes ) includes [ idx ++ ] = config . jni dir + "/" + include ; for ( string include : target . cpp includes ) includes [ idx ++ ] = config . jni dir + "/" + include ; idx = 0 ; string [ ] excludes = new string [ target . c excludes . length + target . cpp excludes . length + 1 ] ; for ( string exclude : target . c excludes ) excludes [ idx ++ ] = config . jni dir + "/" + exclude ; for ( string exclude : target . cpp excludes ) excludes [ idx ++ ] = config . jni dir + "/" + exclude ; excludes [ idx ] = "**/target/*" ; gather source files ( config . jni dir , includes , excludes , files ) ; file descriptor application = config . jni dir . child ( "Application.mk" ) ; application . write string ( new file descriptor ( "com/badlogic/gdx/jnigen/resources/scripts/Application.mk.template" , file type . classpath ) . read string ( ) , false ) ; string template = new file descriptor ( "com/badlogic/gdx/jnigen/resources/scripts/Android.mk.template" , file type . classpath ) . read string ( ) ; string buffer src files = new string buffer ( ) ; for ( int i = 0 ; i < files . size ( ) ; i ++ ) { if ( i > 0 ) src files . append ( " " ) ; src files . append ( files . get ( i ) . path ( ) . replace ( '|' , '/' ) . replace ( config . jni dir . to string ( ) + "/" , "" ) ) ; if ( i < files . size ( ) - 1 ) src files . append ( "| " ) ; else src files . append ( " " ) ; } string buffer header dirs = new string buffer ( ) ; for ( string header dir : target . header dirs ) { header dirs . append ( header dir ) ; header dirs . append ( " " ) ; } template = template . replace ( "%sharedLibName%" , config . shared lib name ) ; template = template . replace ( "%headerDirs%" , header dirs ) ; template = template . replace ( "%cFlags%" , target . c flags ) ; template = template . replace ( "%cppFlags%" , target . cpp flags ) ; template = template . replace ( "%linkerFlags%" , target . linker flags ) ; template = template . replace ( "%srcFiles%" , src files ) ; config . jni dir . child ( "Android.mk" ) . write string ( template , false ) ; } <SENTENCE_END/>

(Copy Probability: 11.2%)

<SENTENCE_START> { if ( target . os != target os . android ) throw new illegal argument exception ( "target os must be Android" ) ; if ( ! config . libs dir . exists ( ) ) { if ( ! config . libs dir . mkdirs ( ) ) throw new runtime exception ( "Couldn't create directory for shared library files in '" + config . libs dir + "'" ) ; } if ( ! config . jni dir . exists ( ) ) { if ( ! config . jni dir . mkdirs ( ) ) throw new runtime exception ( "Couldn't create native code directory '" + config . jni dir + "'" ) ; } array list < file descriptor > files = new array list < file descriptor > ( ) ; int idx = 0 ; string [ ] includes = new string [ target . c includes . length + target . cpp includes . length ] ; for ( string include : target . c includes ) includes [ idx ++ ] = config . jni dir + "/" + include ; for ( string include : target . cpp includes ) includes [ idx ++ ] = config . jni dir + "/" + include ; idx = 0 ; string [ ] excludes = new string [ target . c excludes . length + target . cpp excludes . length + 1 ] ; for ( string exclude : target . c excludes ) excludes [ idx ++ ] = config . jni dir + "/" + exclude ; for ( string exclude : target . cpp excludes ) excludes [ idx ++ ] = config . jni dir + "/" + exclude ; excludes [ idx ] = "**/target/*" ; gather source files ( config . jni dir , includes , excludes , files ) ; file descriptor application = config . jni dir . child ( "Application.mk" ) ; application . write string ( new file descriptor ( "com/badlogic/gdx/jnigen/resources/scripts/Application.mk.template" , file type . classpath ) . read string ( ) , false ) ; string template = new file descriptor ( "com/badlogic/gdx/jnigen/resources/scripts/Android.mk.template" , file type . classpath ) . read string ( ) ; string buffer src files = new string buffer ( ) ; for ( int i = 0 ; i < files . size ( ) ; i ++ ) { if ( i > 0 ) src files . append ( " " ) ; src files . append ( files . get ( i ) . path ( ) . replace ( '|' , '/' ) . replace ( config . jni dir . to string ( ) + "/" , "" ) ) ; if ( i < files . size ( ) - 1 ) src files . append ( "| " ) ; else src files . append ( " " ) ; } string buffer header dirs = new string buffer ( ) ; for ( string header dir : target . header dirs ) { header dirs . append ( header dir ) ; header dirs . append ( " " ) ; } template = template . replace ( "%sharedLibName%" , config . shared lib name ) ; template = template . replace ( "%headerDirs%" , header dirs ) ; template = template . replace ( "%cFlags%" , target . c flags ) ; template = template . replace ( "%cppFlags%" , target . cpp flags ) ; template = template . replace ( "%linkerFlags%" , target . linker flags ) ; template = template . replace ( "%srcFiles%" , src files ) ; config . jni dir . child ( "Android.mk" ) . write string ( template , false ) ; } <SENTENCE_END/>


Original Name gather,source,files

gather

<SENTENCE_START> { string file name = file . path ( ) . replace ( '|' , '/' ) ; if ( file . is directory ( ) ) { if ( match ( file name , excludes ) ) return ; for ( file descriptor child : file . list ( ) ) { %SELF% ( child , includes , excludes , files ) ; } } else { if ( match ( file name , includes ) && ! match ( file name , excludes ) ) files . add ( file ) ; } } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { string file name = file . path ( ) . replace ( '|' , '/' ) ; if ( file . is directory ( ) ) { if ( match ( file name , excludes ) ) return ; for ( file descriptor child : file . list ( ) ) { %SELF% ( child , includes , excludes , files ) ; } } else { if ( match ( file name , includes ) && ! match ( file name , excludes ) ) files . add ( file ) ; } } <SENTENCE_END/>

source

<SENTENCE_START> { string file name = file . path ( ) . replace ( '|' , '/' ) ; if ( file . is directory ( ) ) { if ( match ( file name , excludes ) ) return ; for ( file descriptor child : file . list ( ) ) { %SELF% ( child , includes , excludes , files ) ; } } else { if ( match ( file name , includes ) && ! match ( file name , excludes ) ) files . add ( file ) ; } } <SENTENCE_END/>

(Copy Probability: 9.1%)

<SENTENCE_START> { string file name = file . path ( ) . replace ( '|' , '/' ) ; if ( file . is directory ( ) ) { if ( match ( file name , excludes ) ) return ; for ( file descriptor child : file . list ( ) ) { %SELF% ( child , includes , excludes , files ) ; } } else { if ( match ( file name , includes ) && ! match ( file name , excludes ) ) files . add ( file ) ; } } <SENTENCE_END/>

files

<SENTENCE_START> { string file name = file . path ( ) . replace ( '|' , '/' ) ; if ( file . is directory ( ) ) { if ( match ( file name , excludes ) ) return ; for ( file descriptor child : file . list ( ) ) { %SELF% ( child , includes , excludes , files ) ; } } else { if ( match ( file name , includes ) && ! match ( file name , excludes ) ) files . add ( file ) ; } } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { string file name = file . path ( ) . replace ( '|' , '/' ) ; if ( file . is directory ( ) ) { if ( match ( file name , excludes ) ) return ; for ( file descriptor child : file . list ( ) ) { %SELF% ( child , includes , excludes , files ) ; } } else { if ( match ( file name , includes ) && ! match ( file name , excludes ) ) files . add ( file ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { string file name = file . path ( ) . replace ( '|' , '/' ) ; if ( file . is directory ( ) ) { if ( match ( file name , excludes ) ) return ; for ( file descriptor child : file . list ( ) ) { %SELF% ( child , includes , excludes , files ) ; } } else { if ( match ( file name , includes ) && ! match ( file name , excludes ) ) files . add ( file ) ; } } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { string file name = file . path ( ) . replace ( '|' , '/' ) ; if ( file . is directory ( ) ) { if ( match ( file name , excludes ) ) return ; for ( file descriptor child : file . list ( ) ) { %SELF% ( child , includes , excludes , files ) ; } } else { if ( match ( file name , includes ) && ! match ( file name , excludes ) ) files . add ( file ) ; } } <SENTENCE_END/>


Original Name match

match

<SENTENCE_START> { return new ant path matcher ( ) . %SELF% ( file , patterns ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return new ant path matcher ( ) . %SELF% ( file , patterns ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new ant path matcher ( ) . %SELF% ( file , patterns ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return new ant path matcher ( ) . %SELF% ( file , patterns ) ; } <SENTENCE_END/>


Original Name set,style

set

<SENTENCE_START> { if ( style == null ) throw new illegal argument exception ( "style cannot be null." ) ; this . style = style ; invalidate hierarchy ( ) ; } <SENTENCE_END/>

(Copy Probability: 8.3%)

<SENTENCE_START> { if ( style == null ) throw new illegal argument exception ( "style cannot be null." ) ; this . style = style ; invalidate hierarchy ( ) ; } <SENTENCE_END/>

style

<SENTENCE_START> { if ( style == null ) throw new illegal argument exception ( "style cannot be null." ) ; this . style = style ; invalidate hierarchy ( ) ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { if ( style == null ) throw new illegal argument exception ( "style cannot be null." ) ; this . style = style ; invalidate hierarchy ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( style == null ) throw new illegal argument exception ( "style cannot be null." ) ; this . style = style ; invalidate hierarchy ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { if ( style == null ) throw new illegal argument exception ( "style cannot be null." ) ; this . style = style ; invalidate hierarchy ( ) ; } <SENTENCE_END/>


Original Name get,style

get

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

(Copy Probability: 0.5%)

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

style

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

(Copy Probability: 98.8%)

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

%END%

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

(Copy Probability: 1.5%)

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


Original Name get,value

get

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

(Copy Probability: 0.2%)

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

value

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

(Copy Probability: 8.6%)

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

%END%

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

(Copy Probability: 0.2%)

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


Original Name get,visual,value

get

<SENTENCE_START> { if ( animate time > 0 ) return animate interpolation . apply ( animate from value , value , 1 - animate time / animate duration ) ; return value ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( animate time > 0 ) return animate interpolation . apply ( animate from value , value , 1 - animate time / animate duration ) ; return value ; } <SENTENCE_END/>

visual

<SENTENCE_START> { if ( animate time > 0 ) return animate interpolation . apply ( animate from value , value , 1 - animate time / animate duration ) ; return value ; } <SENTENCE_END/>

(Copy Probability: 8.5%)

<SENTENCE_START> { if ( animate time > 0 ) return animate interpolation . apply ( animate from value , value , 1 - animate time / animate duration ) ; return value ; } <SENTENCE_END/>

value

<SENTENCE_START> { if ( animate time > 0 ) return animate interpolation . apply ( animate from value , value , 1 - animate time / animate duration ) ; return value ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { if ( animate time > 0 ) return animate interpolation . apply ( animate from value , value , 1 - animate time / animate duration ) ; return value ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( animate time > 0 ) return animate interpolation . apply ( animate from value , value , 1 - animate time / animate duration ) ; return value ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { if ( animate time > 0 ) return animate interpolation . apply ( animate from value , value , 1 - animate time / animate duration ) ; return value ; } <SENTENCE_END/>


Original Name get,percent

get

<SENTENCE_START> { return ( value - min ) / ( max - min ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return ( value - min ) / ( max - min ) ; } <SENTENCE_END/>

percent

<SENTENCE_START> { return ( value - min ) / ( max - min ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return ( value - min ) / ( max - min ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( value - min ) / ( max - min ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return ( value - min ) / ( max - min ) ; } <SENTENCE_END/>


Original Name get,visual,percent

get

<SENTENCE_START> { return visual interpolation . apply ( ( get visual value ( ) - min ) / ( max - min ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { return visual interpolation . apply ( ( get visual value ( ) - min ) / ( max - min ) ) ; } <SENTENCE_END/>

visual

<SENTENCE_START> { return visual interpolation . apply ( ( get visual value ( ) - min ) / ( max - min ) ) ; } <SENTENCE_END/>

(Copy Probability: 42.5%)

<SENTENCE_START> { return visual interpolation . apply ( ( get visual value ( ) - min ) / ( max - min ) ) ; } <SENTENCE_END/>

percent

<SENTENCE_START> { return visual interpolation . apply ( ( get visual value ( ) - min ) / ( max - min ) ) ; } <SENTENCE_END/>

(Copy Probability: 23.4%)

<SENTENCE_START> { return visual interpolation . apply ( ( get visual value ( ) - min ) / ( max - min ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return visual interpolation . apply ( ( get visual value ( ) - min ) / ( max - min ) ) ; } <SENTENCE_END/>

(Copy Probability: 9.1%)

<SENTENCE_START> { return visual interpolation . apply ( ( get visual value ( ) - min ) / ( max - min ) ) ; } <SENTENCE_END/>


Original Name get,knob,drawable

get

<SENTENCE_START> { return ( disabled && style . disabled knob != null ) ? style . disabled knob : style . knob ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return ( disabled && style . disabled knob != null ) ? style . disabled knob : style . knob ; } <SENTENCE_END/>

knob

<SENTENCE_START> { return ( disabled && style . disabled knob != null ) ? style . disabled knob : style . knob ; } <SENTENCE_END/>

(Copy Probability: 88.8%)

<SENTENCE_START> { return ( disabled && style . disabled knob != null ) ? style . disabled knob : style . knob ; } <SENTENCE_END/>

drawable

<SENTENCE_START> { return ( disabled && style . disabled knob != null ) ? style . disabled knob : style . knob ; } <SENTENCE_END/>

(Copy Probability: 94.3%)

<SENTENCE_START> { return ( disabled && style . disabled knob != null ) ? style . disabled knob : style . knob ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( disabled && style . disabled knob != null ) ? style . disabled knob : style . knob ; } <SENTENCE_END/>

(Copy Probability: 27.8%)

<SENTENCE_START> { return ( disabled && style . disabled knob != null ) ? style . disabled knob : style . knob ; } <SENTENCE_END/>


Original Name get,knob,position

get

<SENTENCE_START> { return this . position ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return this . position ; } <SENTENCE_END/>

knob

<SENTENCE_START> { return this . position ; } <SENTENCE_END/>

(Copy Probability: 73.2%)

<SENTENCE_START> { return this . position ; } <SENTENCE_END/>

position

<SENTENCE_START> { return this . position ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { return this . position ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return this . position ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return this . position ; } <SENTENCE_END/>


Original Name set,value

set

<SENTENCE_START> { value = clamp ( math . round ( value / step size ) * step size ) ; if ( ! shift ignores snap || ( ! gdx . input . is key pressed ( keys . shift left ) && ! gdx . input . is key pressed ( keys . shift right ) ) ) value = snap ( value ) ; float old value = this . value ; if ( value == old value ) return false ; float old visual value = get visual value ( ) ; this . value = value ; change event change event = pools . obtain ( change event . class ) ; boolean cancelled = fire ( change event ) ; if ( cancelled ) this . value = old value ; else if ( animate duration > 0 ) { animate from value = old visual value ; animate time = animate duration ; } pools . free ( change event ) ; return ! cancelled ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { value = clamp ( math . round ( value / step size ) * step size ) ; if ( ! shift ignores snap || ( ! gdx . input . is key pressed ( keys . shift left ) && ! gdx . input . is key pressed ( keys . shift right ) ) ) value = snap ( value ) ; float old value = this . value ; if ( value == old value ) return false ; float old visual value = get visual value ( ) ; this . value = value ; change event change event = pools . obtain ( change event . class ) ; boolean cancelled = fire ( change event ) ; if ( cancelled ) this . value = old value ; else if ( animate duration > 0 ) { animate from value = old visual value ; animate time = animate duration ; } pools . free ( change event ) ; return ! cancelled ; } <SENTENCE_END/>

value

<SENTENCE_START> { value = clamp ( math . round ( value / step size ) * step size ) ; if ( ! shift ignores snap || ( ! gdx . input . is key pressed ( keys . shift left ) && ! gdx . input . is key pressed ( keys . shift right ) ) ) value = snap ( value ) ; float old value = this . value ; if ( value == old value ) return false ; float old visual value = get visual value ( ) ; this . value = value ; change event change event = pools . obtain ( change event . class ) ; boolean cancelled = fire ( change event ) ; if ( cancelled ) this . value = old value ; else if ( animate duration > 0 ) { animate from value = old visual value ; animate time = animate duration ; } pools . free ( change event ) ; return ! cancelled ; } <SENTENCE_END/>

(Copy Probability: 23.4%)

<SENTENCE_START> { value = clamp ( math . round ( value / step size ) * step size ) ; if ( ! shift ignores snap || ( ! gdx . input . is key pressed ( keys . shift left ) && ! gdx . input . is key pressed ( keys . shift right ) ) ) value = snap ( value ) ; float old value = this . value ; if ( value == old value ) return false ; float old visual value = get visual value ( ) ; this . value = value ; change event change event = pools . obtain ( change event . class ) ; boolean cancelled = fire ( change event ) ; if ( cancelled ) this . value = old value ; else if ( animate duration > 0 ) { animate from value = old visual value ; animate time = animate duration ; } pools . free ( change event ) ; return ! cancelled ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { value = clamp ( math . round ( value / step size ) * step size ) ; if ( ! shift ignores snap || ( ! gdx . input . is key pressed ( keys . shift left ) && ! gdx . input . is key pressed ( keys . shift right ) ) ) value = snap ( value ) ; float old value = this . value ; if ( value == old value ) return false ; float old visual value = get visual value ( ) ; this . value = value ; change event change event = pools . obtain ( change event . class ) ; boolean cancelled = fire ( change event ) ; if ( cancelled ) this . value = old value ; else if ( animate duration > 0 ) { animate from value = old visual value ; animate time = animate duration ; } pools . free ( change event ) ; return ! cancelled ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { value = clamp ( math . round ( value / step size ) * step size ) ; if ( ! shift ignores snap || ( ! gdx . input . is key pressed ( keys . shift left ) && ! gdx . input . is key pressed ( keys . shift right ) ) ) value = snap ( value ) ; float old value = this . value ; if ( value == old value ) return false ; float old visual value = get visual value ( ) ; this . value = value ; change event change event = pools . obtain ( change event . class ) ; boolean cancelled = fire ( change event ) ; if ( cancelled ) this . value = old value ; else if ( animate duration > 0 ) { animate from value = old visual value ; animate time = animate duration ; } pools . free ( change event ) ; return ! cancelled ; } <SENTENCE_END/>


Original Name clamp

clamp

<SENTENCE_START> { return math utils . %SELF% ( value , min , max ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return math utils . %SELF% ( value , min , max ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return math utils . %SELF% ( value , min , max ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return math utils . %SELF% ( value , min , max ) ; } <SENTENCE_END/>


Original Name set,range

set

<SENTENCE_START> { if ( min > max ) throw new illegal argument exception ( "min must be <= max" ) ; this . min = min ; this . max = max ; if ( value < min ) set value ( min ) ; else if ( value > max ) set value ( max ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { if ( min > max ) throw new illegal argument exception ( "min must be <= max" ) ; this . min = min ; this . max = max ; if ( value < min ) set value ( min ) ; else if ( value > max ) set value ( max ) ; } <SENTENCE_END/>

range

<SENTENCE_START> { if ( min > max ) throw new illegal argument exception ( "min must be <= max" ) ; this . min = min ; this . max = max ; if ( value < min ) set value ( min ) ; else if ( value > max ) set value ( max ) ; } <SENTENCE_END/>

(Copy Probability: 32.9%)

<SENTENCE_START> { if ( min > max ) throw new illegal argument exception ( "min must be <= max" ) ; this . min = min ; this . max = max ; if ( value < min ) set value ( min ) ; else if ( value > max ) set value ( max ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( min > max ) throw new illegal argument exception ( "min must be <= max" ) ; this . min = min ; this . max = max ; if ( value < min ) set value ( min ) ; else if ( value > max ) set value ( max ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( min > max ) throw new illegal argument exception ( "min must be <= max" ) ; this . min = min ; this . max = max ; if ( value < min ) set value ( min ) ; else if ( value > max ) set value ( max ) ; } <SENTENCE_END/>


Original Name set,step,size

set

<SENTENCE_START> { if ( step size <= 0 ) throw new illegal argument exception ( "steps must be > 0: " + step size ) ; this . step size = step size ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { if ( step size <= 0 ) throw new illegal argument exception ( "steps must be > 0: " + step size ) ; this . step size = step size ; } <SENTENCE_END/>

step

<SENTENCE_START> { if ( step size <= 0 ) throw new illegal argument exception ( "steps must be > 0: " + step size ) ; this . step size = step size ; } <SENTENCE_END/>

(Copy Probability: 21.3%)

<SENTENCE_START> { if ( step size <= 0 ) throw new illegal argument exception ( "steps must be > 0: " + step size ) ; this . step size = step size ; } <SENTENCE_END/>

size

<SENTENCE_START> { if ( step size <= 0 ) throw new illegal argument exception ( "steps must be > 0: " + step size ) ; this . step size = step size ; } <SENTENCE_END/>

(Copy Probability: 5.1%)

<SENTENCE_START> { if ( step size <= 0 ) throw new illegal argument exception ( "steps must be > 0: " + step size ) ; this . step size = step size ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( step size <= 0 ) throw new illegal argument exception ( "steps must be > 0: " + step size ) ; this . step size = step size ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( step size <= 0 ) throw new illegal argument exception ( "steps must be > 0: " + step size ) ; this . step size = step size ; } <SENTENCE_END/>


Original Name get,pref,width

get

<SENTENCE_START> { if ( vertical ) { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min width ( ) , bg . get min width ( ) ) ; } else return 140 ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { if ( vertical ) { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min width ( ) , bg . get min width ( ) ) ; } else return 140 ; } <SENTENCE_END/>

pref

<SENTENCE_START> { if ( vertical ) { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min width ( ) , bg . get min width ( ) ) ; } else return 140 ; } <SENTENCE_END/>

(Copy Probability: 84.7%)

<SENTENCE_START> { if ( vertical ) { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min width ( ) , bg . get min width ( ) ) ; } else return 140 ; } <SENTENCE_END/>

width

<SENTENCE_START> { if ( vertical ) { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min width ( ) , bg . get min width ( ) ) ; } else return 140 ; } <SENTENCE_END/>

(Copy Probability: 64.9%)

<SENTENCE_START> { if ( vertical ) { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min width ( ) , bg . get min width ( ) ) ; } else return 140 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( vertical ) { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min width ( ) , bg . get min width ( ) ) ; } else return 140 ; } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { if ( vertical ) { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min width ( ) , bg . get min width ( ) ) ; } else return 140 ; } <SENTENCE_END/>


Original Name get,pref,height

get

<SENTENCE_START> { if ( vertical ) return 140 ; else { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min height ( ) , bg == null ? 0 : bg . get min height ( ) ) ; } } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { if ( vertical ) return 140 ; else { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min height ( ) , bg == null ? 0 : bg . get min height ( ) ) ; } } <SENTENCE_END/>

pref

<SENTENCE_START> { if ( vertical ) return 140 ; else { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min height ( ) , bg == null ? 0 : bg . get min height ( ) ) ; } } <SENTENCE_END/>

(Copy Probability: 69.4%)

<SENTENCE_START> { if ( vertical ) return 140 ; else { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min height ( ) , bg == null ? 0 : bg . get min height ( ) ) ; } } <SENTENCE_END/>

height

<SENTENCE_START> { if ( vertical ) return 140 ; else { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min height ( ) , bg == null ? 0 : bg . get min height ( ) ) ; } } <SENTENCE_END/>

(Copy Probability: 55.6%)

<SENTENCE_START> { if ( vertical ) return 140 ; else { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min height ( ) , bg == null ? 0 : bg . get min height ( ) ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( vertical ) return 140 ; else { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min height ( ) , bg == null ? 0 : bg . get min height ( ) ) ; } } <SENTENCE_END/>

(Copy Probability: 6.7%)

<SENTENCE_START> { if ( vertical ) return 140 ; else { final drawable knob = get knob drawable ( ) ; final drawable bg = ( disabled && style . disabled background != null ) ? style . disabled background : style . background ; return math . max ( knob == null ? 0 : knob . get min height ( ) , bg == null ? 0 : bg . get min height ( ) ) ; } } <SENTENCE_END/>


Original Name get,min,value

get

<SENTENCE_START> { return this . min ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return this . min ; } <SENTENCE_END/>

min

<SENTENCE_START> { return this . min ; } <SENTENCE_END/>

(Copy Probability: 79.8%)

<SENTENCE_START> { return this . min ; } <SENTENCE_END/>

value

<SENTENCE_START> { return this . min ; } <SENTENCE_END/>

(Copy Probability: 16.7%)

<SENTENCE_START> { return this . min ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return this . min ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return this . min ; } <SENTENCE_END/>


Original Name get,max,value

get

<SENTENCE_START> { return this . max ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return this . max ; } <SENTENCE_END/>

max

<SENTENCE_START> { return this . max ; } <SENTENCE_END/>

(Copy Probability: 93.8%)

<SENTENCE_START> { return this . max ; } <SENTENCE_END/>

value

<SENTENCE_START> { return this . max ; } <SENTENCE_END/>

(Copy Probability: 22.7%)

<SENTENCE_START> { return this . max ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return this . max ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return this . max ; } <SENTENCE_END/>


Original Name get,step,size

get

<SENTENCE_START> { return this . step size ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return this . step size ; } <SENTENCE_END/>

step

<SENTENCE_START> { return this . step size ; } <SENTENCE_END/>

(Copy Probability: 95.9%)

<SENTENCE_START> { return this . step size ; } <SENTENCE_END/>

size

<SENTENCE_START> { return this . step size ; } <SENTENCE_END/>

(Copy Probability: 47.9%)

<SENTENCE_START> { return this . step size ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return this . step size ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return this . step size ; } <SENTENCE_END/>


Original Name set,animate,duration

set

<SENTENCE_START> { this . animate duration = duration ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { this . animate duration = duration ; } <SENTENCE_END/>

animate

<SENTENCE_START> { this . animate duration = duration ; } <SENTENCE_END/>

(Copy Probability: 85.1%)

<SENTENCE_START> { this . animate duration = duration ; } <SENTENCE_END/>

duration

<SENTENCE_START> { this . animate duration = duration ; } <SENTENCE_END/>

(Copy Probability: 14.4%)

<SENTENCE_START> { this . animate duration = duration ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . animate duration = duration ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { this . animate duration = duration ; } <SENTENCE_END/>


Original Name set,animate,interpolation

set

<SENTENCE_START> { if ( animate interpolation == null ) throw new illegal argument exception ( "animateInterpolation cannot be null." ) ; this . animate interpolation = animate interpolation ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( animate interpolation == null ) throw new illegal argument exception ( "animateInterpolation cannot be null." ) ; this . animate interpolation = animate interpolation ; } <SENTENCE_END/>

animate

<SENTENCE_START> { if ( animate interpolation == null ) throw new illegal argument exception ( "animateInterpolation cannot be null." ) ; this . animate interpolation = animate interpolation ; } <SENTENCE_END/>

(Copy Probability: 88.5%)

<SENTENCE_START> { if ( animate interpolation == null ) throw new illegal argument exception ( "animateInterpolation cannot be null." ) ; this . animate interpolation = animate interpolation ; } <SENTENCE_END/>

interpolation

<SENTENCE_START> { if ( animate interpolation == null ) throw new illegal argument exception ( "animateInterpolation cannot be null." ) ; this . animate interpolation = animate interpolation ; } <SENTENCE_END/>

(Copy Probability: 28.6%)

<SENTENCE_START> { if ( animate interpolation == null ) throw new illegal argument exception ( "animateInterpolation cannot be null." ) ; this . animate interpolation = animate interpolation ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( animate interpolation == null ) throw new illegal argument exception ( "animateInterpolation cannot be null." ) ; this . animate interpolation = animate interpolation ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { if ( animate interpolation == null ) throw new illegal argument exception ( "animateInterpolation cannot be null." ) ; this . animate interpolation = animate interpolation ; } <SENTENCE_END/>


Original Name set,visual,interpolation

set

<SENTENCE_START> { this . visual interpolation = interpolation ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { this . visual interpolation = interpolation ; } <SENTENCE_END/>

visual

<SENTENCE_START> { this . visual interpolation = interpolation ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { this . visual interpolation = interpolation ; } <SENTENCE_END/>

interpolation

<SENTENCE_START> { this . visual interpolation = interpolation ; } <SENTENCE_END/>

(Copy Probability: 94.3%)

<SENTENCE_START> { this . visual interpolation = interpolation ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . visual interpolation = interpolation ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { this . visual interpolation = interpolation ; } <SENTENCE_END/>


Original Name set,snap,to,values

set

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

snap

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

(Copy Probability: 91.7%)

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

to

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

values

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { this . snap values = values ; this . threshold = threshold ; } <SENTENCE_END/>


Original Name snap

snap

<SENTENCE_START> { if ( snap values == null ) return value ; for ( int i = 0 ; i < snap values . length ; i ++ ) { if ( math . abs ( value - snap values [ i ] ) <= threshold ) return snap values [ i ] ; } return value ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( snap values == null ) return value ; for ( int i = 0 ; i < snap values . length ; i ++ ) { if ( math . abs ( value - snap values [ i ] ) <= threshold ) return snap values [ i ] ; } return value ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( snap values == null ) return value ; for ( int i = 0 ; i < snap values . length ; i ++ ) { if ( math . abs ( value - snap values [ i ] ) <= threshold ) return snap values [ i ] ; } return value ; } <SENTENCE_END/>

(Copy Probability: 10.4%)

<SENTENCE_START> { if ( snap values == null ) return value ; for ( int i = 0 ; i < snap values . length ; i ++ ) { if ( math . abs ( value - snap values [ i ] ) <= threshold ) return snap values [ i ] ; } return value ; } <SENTENCE_END/>


Original Name set,disabled

set

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

(Copy Probability: 1.0%)

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

disabled

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

(Copy Probability: 94.0%)

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

%END%

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

(Copy Probability: 42.1%)

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


Original Name is,disabled

is

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

(Copy Probability: 0.3%)

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

disabled

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

(Copy Probability: 33.6%)

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

%END%

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

(Copy Probability: 12.4%)

<SENTENCE_START> { return disabled ; } <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 add,child,shape

add

<SENTENCE_START> { internal add child shape ( local transform , shape ) ; children . add ( shape ) ; shape . obtain ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { internal add child shape ( local transform , shape ) ; children . add ( shape ) ; shape . obtain ( ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { internal add child shape ( local transform , shape ) ; children . add ( shape ) ; shape . obtain ( ) ; } <SENTENCE_END/>

(Copy Probability: 71.2%)

<SENTENCE_START> { internal add child shape ( local transform , shape ) ; children . add ( shape ) ; shape . obtain ( ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { internal add child shape ( local transform , shape ) ; children . add ( shape ) ; shape . obtain ( ) ; } <SENTENCE_END/>

(Copy Probability: 40.8%)

<SENTENCE_START> { internal add child shape ( local transform , shape ) ; children . add ( shape ) ; shape . obtain ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { internal add child shape ( local transform , shape ) ; children . add ( shape ) ; shape . obtain ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { internal add child shape ( local transform , shape ) ; children . add ( shape ) ; shape . obtain ( ) ; } <SENTENCE_END/>


Original Name remove,child,shape

remove

<SENTENCE_START> { internal remove child shape ( shape ) ; final int idx = children . index of ( shape , false ) ; if ( idx >= 0 ) children . remove index ( idx ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { internal remove child shape ( shape ) ; final int idx = children . index of ( shape , false ) ; if ( idx >= 0 ) children . remove index ( idx ) . release ( ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { internal remove child shape ( shape ) ; final int idx = children . index of ( shape , false ) ; if ( idx >= 0 ) children . remove index ( idx ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 7.4%)

<SENTENCE_START> { internal remove child shape ( shape ) ; final int idx = children . index of ( shape , false ) ; if ( idx >= 0 ) children . remove index ( idx ) . release ( ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { internal remove child shape ( shape ) ; final int idx = children . index of ( shape , false ) ; if ( idx >= 0 ) children . remove index ( idx ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { internal remove child shape ( shape ) ; final int idx = children . index of ( shape , false ) ; if ( idx >= 0 ) children . remove index ( idx ) . release ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { internal remove child shape ( shape ) ; final int idx = children . index of ( shape , false ) ; if ( idx >= 0 ) children . remove index ( idx ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { internal remove child shape ( shape ) ; final int idx = children . index of ( shape , false ) ; if ( idx >= 0 ) children . remove index ( idx ) . release ( ) ; } <SENTENCE_END/>


Original Name remove,child,shape,by,index

remove

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 7.9%)

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

by

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

index

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { internal remove child shape by index ( index ) ; children . remove index ( index ) . release ( ) ; } <SENTENCE_END/>


Original Name get,child,shape

get

<SENTENCE_START> { return children . get ( index ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return children . get ( index ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { return children . get ( index ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { return children . get ( index ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { return children . get ( index ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { return children . get ( index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return children . get ( index ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return children . get ( index ) ; } <SENTENCE_END/>


Original Name internal,add,child,shape

internal

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 11.2%)

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

add

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 94.0%)

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 9.4%)

<SENTENCE_START> { collision jni . bt compound shape internal add child shape ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>


Original Name internal,remove,child,shape

internal

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 10.9%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

remove

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 85.7%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 7.3%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>


Original Name internal,remove,child,shape,by,index

internal

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

(Copy Probability: 7.7%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

remove

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

(Copy Probability: 98.2%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

by

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

(Copy Probability: 17.4%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

index

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

(Copy Probability: 17.0%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>

(Copy Probability: 17.0%)

<SENTENCE_START> { collision jni . bt compound shape internal remove child shape by index ( swig c ptr , this , child shapeindex ) ; } <SENTENCE_END/>


Original Name get,num,child,shapes

get

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

num

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

shapes

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 76.5%)

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { return collision jni . bt compound shape get num child shapes ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,child,transform

get

<SENTENCE_START> { return collision jni . bt compound shape get child transform swig 0 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

(Copy Probability: 7.8%)

<SENTENCE_START> { return collision jni . bt compound shape get child transform swig 0 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { return collision jni . bt compound shape get child transform swig 0 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt compound shape get child transform swig 0 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

transform

<SENTENCE_START> { return collision jni . bt compound shape get child transform swig 0 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { return collision jni . bt compound shape get child transform swig 0 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt compound shape get child transform swig 0 ( swig c ptr , this , index ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { return collision jni . bt compound shape get child transform swig 0 ( swig c ptr , this , index ) ; } <SENTENCE_END/>


Original Name update,child,transform

update

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 0 ( swig c ptr , this , child index , new child transform , should recalculate local aabb ) ; } <SENTENCE_END/>

(Copy Probability: 10.9%)

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 0 ( swig c ptr , this , child index , new child transform , should recalculate local aabb ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 0 ( swig c ptr , this , child index , new child transform , should recalculate local aabb ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 0 ( swig c ptr , this , child index , new child transform , should recalculate local aabb ) ; } <SENTENCE_END/>

transform

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 0 ( swig c ptr , this , child index , new child transform , should recalculate local aabb ) ; } <SENTENCE_END/>

(Copy Probability: 85.1%)

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 0 ( swig c ptr , this , child index , new child transform , should recalculate local aabb ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 0 ( swig c ptr , this , child index , new child transform , should recalculate local aabb ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 0 ( swig c ptr , this , child index , new child transform , should recalculate local aabb ) ; } <SENTENCE_END/>


Original Name update,child,transform

update

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 1 ( swig c ptr , this , child index , new child transform ) ; } <SENTENCE_END/>

(Copy Probability: 11.6%)

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 1 ( swig c ptr , this , child index , new child transform ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 1 ( swig c ptr , this , child index , new child transform ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 1 ( swig c ptr , this , child index , new child transform ) ; } <SENTENCE_END/>

transform

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 1 ( swig c ptr , this , child index , new child transform ) ; } <SENTENCE_END/>

(Copy Probability: 88.4%)

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 1 ( swig c ptr , this , child index , new child transform ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 1 ( swig c ptr , this , child index , new child transform ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { collision jni . bt compound shape update child transform swig 1 ( swig c ptr , this , child index , new child transform ) ; } <SENTENCE_END/>


Original Name get,child,list

get

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

(Copy Probability: 3.4%)

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

child

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

(Copy Probability: 99.8%)

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

list

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

(Copy Probability: 92.2%)

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

%END%

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

(Copy Probability: 2.7%)

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


Original Name recalculate,local,aabb

recalculate

<SENTENCE_START> { collision jni . bt compound shape recalculate local aabb ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 12.6%)

<SENTENCE_START> { collision jni . bt compound shape recalculate local aabb ( swig c ptr , this ) ; } <SENTENCE_END/>

local

<SENTENCE_START> { collision jni . bt compound shape recalculate local aabb ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { collision jni . bt compound shape recalculate local aabb ( swig c ptr , this ) ; } <SENTENCE_END/>

aabb

<SENTENCE_START> { collision jni . bt compound shape recalculate local aabb ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 87.8%)

<SENTENCE_START> { collision jni . bt compound shape recalculate local aabb ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt compound shape recalculate local aabb ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { collision jni . bt compound shape recalculate local aabb ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,dynamic,aabb,tree

get

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

(Copy Probability: 6.9%)

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

dynamic

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

(Copy Probability: 99.8%)

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

aabb

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

(Copy Probability: 100.0%)

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

tree

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

(Copy Probability: 39.4%)

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

%END%

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

(Copy Probability: 10.9%)

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


Original Name create,aabb,tree,from,children

create

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 9.3%)

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

aabb

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

tree

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

from

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 91.0%)

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

children

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 13.3%)

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 13.3%)

<SENTENCE_START> { collision jni . bt compound shape create aabb tree from children ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name calculate,principal,axis,transform

calculate

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

(Copy Probability: 15.3%)

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

principal

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

axis

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

transform

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

(Copy Probability: 80.5%)

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { assert masses . is direct ( ) : "Buffer must be allocated direct." ; { collision jni . bt compound shape calculate principal axis transform ( swig c ptr , this , masses , principal , inertia ) ; } } <SENTENCE_END/>


Original Name get,update,revision

get

<SENTENCE_START> { return collision jni . bt compound shape get update revision ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { return collision jni . bt compound shape get update revision ( swig c ptr , this ) ; } <SENTENCE_END/>

update

<SENTENCE_START> { return collision jni . bt compound shape get update revision ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { return collision jni . bt compound shape get update revision ( swig c ptr , this ) ; } <SENTENCE_END/>

revision

<SENTENCE_START> { return collision jni . bt compound shape get update revision ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 80.1%)

<SENTENCE_START> { return collision jni . bt compound shape get update revision ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt compound shape get update revision ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { return collision jni . bt compound shape get update revision ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,c,ptr

get

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

(Copy Probability: 1.5%)

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

c

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

(Copy Probability: 99.7%)

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

ptr

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

(Copy Probability: 99.8%)

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

%END%

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

(Copy Probability: 3.7%)

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


Original Name fill

fill

<SENTENCE_START> { position = 0 ; limit = in . read ( buffer ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { position = 0 ; limit = in . read ( buffer ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { position = 0 ; limit = in . read ( buffer ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { position = 0 ; limit = in . read ( buffer ) ; } <SENTENCE_END/>


Original Name read,line

read

<SENTENCE_START> { string builder sb = new string builder ( ) ; while ( true ) { if ( position >= limit ) { fill ( ) ; } if ( position >= limit ) { return sb . length ( ) == 0 ? null : sb . to string ( ) ; } for ( int i = position ; i < limit ; ++ i ) { if ( buffer [ i ] == '|r' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; if ( i + 1 < limit ) { if ( buffer [ i + 1 ] == '|n' ) { position = i + 2 ; } } else { fill ( ) ; if ( buffer [ position ] == '|n' ) { position += 1 ; } } return sb . to string ( ) ; } else if ( buffer [ i ] == '|n' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; return sb . to string ( ) ; } } sb . append ( buffer , position , limit - position ) ; position = limit ; } } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { string builder sb = new string builder ( ) ; while ( true ) { if ( position >= limit ) { fill ( ) ; } if ( position >= limit ) { return sb . length ( ) == 0 ? null : sb . to string ( ) ; } for ( int i = position ; i < limit ; ++ i ) { if ( buffer [ i ] == '|r' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; if ( i + 1 < limit ) { if ( buffer [ i + 1 ] == '|n' ) { position = i + 2 ; } } else { fill ( ) ; if ( buffer [ position ] == '|n' ) { position += 1 ; } } return sb . to string ( ) ; } else if ( buffer [ i ] == '|n' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; return sb . to string ( ) ; } } sb . append ( buffer , position , limit - position ) ; position = limit ; } } <SENTENCE_END/>

line

<SENTENCE_START> { string builder sb = new string builder ( ) ; while ( true ) { if ( position >= limit ) { fill ( ) ; } if ( position >= limit ) { return sb . length ( ) == 0 ? null : sb . to string ( ) ; } for ( int i = position ; i < limit ; ++ i ) { if ( buffer [ i ] == '|r' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; if ( i + 1 < limit ) { if ( buffer [ i + 1 ] == '|n' ) { position = i + 2 ; } } else { fill ( ) ; if ( buffer [ position ] == '|n' ) { position += 1 ; } } return sb . to string ( ) ; } else if ( buffer [ i ] == '|n' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; return sb . to string ( ) ; } } sb . append ( buffer , position , limit - position ) ; position = limit ; } } <SENTENCE_END/>

(Copy Probability: 9.2%)

<SENTENCE_START> { string builder sb = new string builder ( ) ; while ( true ) { if ( position >= limit ) { fill ( ) ; } if ( position >= limit ) { return sb . length ( ) == 0 ? null : sb . to string ( ) ; } for ( int i = position ; i < limit ; ++ i ) { if ( buffer [ i ] == '|r' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; if ( i + 1 < limit ) { if ( buffer [ i + 1 ] == '|n' ) { position = i + 2 ; } } else { fill ( ) ; if ( buffer [ position ] == '|n' ) { position += 1 ; } } return sb . to string ( ) ; } else if ( buffer [ i ] == '|n' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; return sb . to string ( ) ; } } sb . append ( buffer , position , limit - position ) ; position = limit ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { string builder sb = new string builder ( ) ; while ( true ) { if ( position >= limit ) { fill ( ) ; } if ( position >= limit ) { return sb . length ( ) == 0 ? null : sb . to string ( ) ; } for ( int i = position ; i < limit ; ++ i ) { if ( buffer [ i ] == '|r' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; if ( i + 1 < limit ) { if ( buffer [ i + 1 ] == '|n' ) { position = i + 2 ; } } else { fill ( ) ; if ( buffer [ position ] == '|n' ) { position += 1 ; } } return sb . to string ( ) ; } else if ( buffer [ i ] == '|n' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; return sb . to string ( ) ; } } sb . append ( buffer , position , limit - position ) ; position = limit ; } } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { string builder sb = new string builder ( ) ; while ( true ) { if ( position >= limit ) { fill ( ) ; } if ( position >= limit ) { return sb . length ( ) == 0 ? null : sb . to string ( ) ; } for ( int i = position ; i < limit ; ++ i ) { if ( buffer [ i ] == '|r' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; if ( i + 1 < limit ) { if ( buffer [ i + 1 ] == '|n' ) { position = i + 2 ; } } else { fill ( ) ; if ( buffer [ position ] == '|n' ) { position += 1 ; } } return sb . to string ( ) ; } else if ( buffer [ i ] == '|n' ) { sb . append ( buffer , position , i - position ) ; position = i + 1 ; return sb . to string ( ) ; } } sb . append ( buffer , position , limit - position ) ; position = limit ; } } <SENTENCE_END/>


Original Name read

read

<SENTENCE_START> { int count = 0 ; if ( position >= limit && length < buffer . length ) { fill ( ) ; } if ( position < limit ) { int remaining = limit - position ; if ( remaining > length ) { remaining = length ; } system . arraycopy ( buffer , position , b , offset , remaining ) ; count += remaining ; position += remaining ; offset += remaining ; length -= remaining ; } if ( length > 0 ) { int c = in . %SELF% ( b , offset , length ) ; if ( c == - 1 ) { if ( count == 0 ) { count = - 1 ; } } else { count += c ; } } return count ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { int count = 0 ; if ( position >= limit && length < buffer . length ) { fill ( ) ; } if ( position < limit ) { int remaining = limit - position ; if ( remaining > length ) { remaining = length ; } system . arraycopy ( buffer , position , b , offset , remaining ) ; count += remaining ; position += remaining ; offset += remaining ; length -= remaining ; } if ( length > 0 ) { int c = in . %SELF% ( b , offset , length ) ; if ( c == - 1 ) { if ( count == 0 ) { count = - 1 ; } } else { count += c ; } } return count ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int count = 0 ; if ( position >= limit && length < buffer . length ) { fill ( ) ; } if ( position < limit ) { int remaining = limit - position ; if ( remaining > length ) { remaining = length ; } system . arraycopy ( buffer , position , b , offset , remaining ) ; count += remaining ; position += remaining ; offset += remaining ; length -= remaining ; } if ( length > 0 ) { int c = in . %SELF% ( b , offset , length ) ; if ( c == - 1 ) { if ( count == 0 ) { count = - 1 ; } } else { count += c ; } } return count ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { int count = 0 ; if ( position >= limit && length < buffer . length ) { fill ( ) ; } if ( position < limit ) { int remaining = limit - position ; if ( remaining > length ) { remaining = length ; } system . arraycopy ( buffer , position , b , offset , remaining ) ; count += remaining ; position += remaining ; offset += remaining ; length -= remaining ; } if ( length > 0 ) { int c = in . %SELF% ( b , offset , length ) ; if ( c == - 1 ) { if ( count == 0 ) { count = - 1 ; } } else { count += c ; } } return count ; } <SENTENCE_END/>


Original Name close

close

<SENTENCE_START> { in . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { in . %SELF% ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { in . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { in . %SELF% ( ) ; } <SENTENCE_END/>


Original Name main

main

<SENTENCE_START> { new native code generator ( ) . generate ( "src/" , "bin/" , "jni/" ) ; build config build config = new build config ( "gdx-controllers-desktop" ) ; string [ ] windows src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/win32/*.cpp" } ; string [ ] linux src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/linux/*.cpp" } ; string [ ] mac 64 src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/mac/*.mm" , "ois-v1-4svn/src/mac/MacHIDManager.cpp" , "ois-v1-4svn/src/mac/MacJoyStick.cpp" } ; string [ ] includes = new string [ ] { "ois-v1-4svn/includes" , "dinput/" } ; build target win 32 home = build target . new default target ( target os . windows , false ) ; win 32 home . build file name = "build-windows32home.xml" ; win 32 home . exclude from master build file = true ; win 32 home . is 64 bit = false ; win 32 home . compiler prefix = "" ; win 32 home . cpp includes = windows src ; win 32 home . header dirs = includes ; win 32 home . c includes = new string [ 0 ] ; win 32 home . libraries = "-ldinput8 -ldxguid" ; build target win 32 = build target . new default target ( target os . windows , false ) ; win 32 . cpp includes = windows src ; win 32 . header dirs = includes ; win 32 . libraries = "-ldinput8 -ldxguid" ; build target win 64 = build target . new default target ( target os . windows , true ) ; win 64 . cpp includes = windows src ; win 64 . header dirs = includes ; win 64 . libraries = "-ldinput8 -ldxguid" ; build target lin 32 = build target . new default target ( target os . linux , false ) ; lin 32 . cpp includes = linux src ; lin 32 . header dirs = includes ; lin 32 . libraries = "-lX11" ; build target lin 64 = build target . new default target ( target os . linux , true ) ; lin 64 . cpp includes = linux src ; lin 64 . header dirs = includes ; lin 64 . libraries = "-lX11" ; build target mac = build target . new default target ( target os . mac os x , false ) ; mac . cpp includes = mac 64 src ; mac . header dirs = includes ; mac . cpp flags += " -x objective-c++" ; mac . libraries = "-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa" ; build target mac 64 = build target . new default target ( target os . mac os x , true ) ; mac 64 . cpp includes = mac 64 src ; mac 64 . header dirs = includes ; mac 64 . cpp flags += " -x objective-c++" ; mac 64 . libraries = "-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa" ; new ant script generator ( ) . generate ( build config , win 32 home , win 32 , win 64 , lin 32 , lin 64 , mac , mac 64 ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { new native code generator ( ) . generate ( "src/" , "bin/" , "jni/" ) ; build config build config = new build config ( "gdx-controllers-desktop" ) ; string [ ] windows src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/win32/*.cpp" } ; string [ ] linux src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/linux/*.cpp" } ; string [ ] mac 64 src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/mac/*.mm" , "ois-v1-4svn/src/mac/MacHIDManager.cpp" , "ois-v1-4svn/src/mac/MacJoyStick.cpp" } ; string [ ] includes = new string [ ] { "ois-v1-4svn/includes" , "dinput/" } ; build target win 32 home = build target . new default target ( target os . windows , false ) ; win 32 home . build file name = "build-windows32home.xml" ; win 32 home . exclude from master build file = true ; win 32 home . is 64 bit = false ; win 32 home . compiler prefix = "" ; win 32 home . cpp includes = windows src ; win 32 home . header dirs = includes ; win 32 home . c includes = new string [ 0 ] ; win 32 home . libraries = "-ldinput8 -ldxguid" ; build target win 32 = build target . new default target ( target os . windows , false ) ; win 32 . cpp includes = windows src ; win 32 . header dirs = includes ; win 32 . libraries = "-ldinput8 -ldxguid" ; build target win 64 = build target . new default target ( target os . windows , true ) ; win 64 . cpp includes = windows src ; win 64 . header dirs = includes ; win 64 . libraries = "-ldinput8 -ldxguid" ; build target lin 32 = build target . new default target ( target os . linux , false ) ; lin 32 . cpp includes = linux src ; lin 32 . header dirs = includes ; lin 32 . libraries = "-lX11" ; build target lin 64 = build target . new default target ( target os . linux , true ) ; lin 64 . cpp includes = linux src ; lin 64 . header dirs = includes ; lin 64 . libraries = "-lX11" ; build target mac = build target . new default target ( target os . mac os x , false ) ; mac . cpp includes = mac 64 src ; mac . header dirs = includes ; mac . cpp flags += " -x objective-c++" ; mac . libraries = "-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa" ; build target mac 64 = build target . new default target ( target os . mac os x , true ) ; mac 64 . cpp includes = mac 64 src ; mac 64 . header dirs = includes ; mac 64 . cpp flags += " -x objective-c++" ; mac 64 . libraries = "-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa" ; new ant script generator ( ) . generate ( build config , win 32 home , win 32 , win 64 , lin 32 , lin 64 , mac , mac 64 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { new native code generator ( ) . generate ( "src/" , "bin/" , "jni/" ) ; build config build config = new build config ( "gdx-controllers-desktop" ) ; string [ ] windows src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/win32/*.cpp" } ; string [ ] linux src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/linux/*.cpp" } ; string [ ] mac 64 src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/mac/*.mm" , "ois-v1-4svn/src/mac/MacHIDManager.cpp" , "ois-v1-4svn/src/mac/MacJoyStick.cpp" } ; string [ ] includes = new string [ ] { "ois-v1-4svn/includes" , "dinput/" } ; build target win 32 home = build target . new default target ( target os . windows , false ) ; win 32 home . build file name = "build-windows32home.xml" ; win 32 home . exclude from master build file = true ; win 32 home . is 64 bit = false ; win 32 home . compiler prefix = "" ; win 32 home . cpp includes = windows src ; win 32 home . header dirs = includes ; win 32 home . c includes = new string [ 0 ] ; win 32 home . libraries = "-ldinput8 -ldxguid" ; build target win 32 = build target . new default target ( target os . windows , false ) ; win 32 . cpp includes = windows src ; win 32 . header dirs = includes ; win 32 . libraries = "-ldinput8 -ldxguid" ; build target win 64 = build target . new default target ( target os . windows , true ) ; win 64 . cpp includes = windows src ; win 64 . header dirs = includes ; win 64 . libraries = "-ldinput8 -ldxguid" ; build target lin 32 = build target . new default target ( target os . linux , false ) ; lin 32 . cpp includes = linux src ; lin 32 . header dirs = includes ; lin 32 . libraries = "-lX11" ; build target lin 64 = build target . new default target ( target os . linux , true ) ; lin 64 . cpp includes = linux src ; lin 64 . header dirs = includes ; lin 64 . libraries = "-lX11" ; build target mac = build target . new default target ( target os . mac os x , false ) ; mac . cpp includes = mac 64 src ; mac . header dirs = includes ; mac . cpp flags += " -x objective-c++" ; mac . libraries = "-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa" ; build target mac 64 = build target . new default target ( target os . mac os x , true ) ; mac 64 . cpp includes = mac 64 src ; mac 64 . header dirs = includes ; mac 64 . cpp flags += " -x objective-c++" ; mac 64 . libraries = "-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa" ; new ant script generator ( ) . generate ( build config , win 32 home , win 32 , win 64 , lin 32 , lin 64 , mac , mac 64 ) ; } <SENTENCE_END/>

(Copy Probability: 7.2%)

<SENTENCE_START> { new native code generator ( ) . generate ( "src/" , "bin/" , "jni/" ) ; build config build config = new build config ( "gdx-controllers-desktop" ) ; string [ ] windows src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/win32/*.cpp" } ; string [ ] linux src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/linux/*.cpp" } ; string [ ] mac 64 src = { "*.cpp" , "ois-v1-4svn/src/*.cpp" , "ois-v1-4svn/src/mac/*.mm" , "ois-v1-4svn/src/mac/MacHIDManager.cpp" , "ois-v1-4svn/src/mac/MacJoyStick.cpp" } ; string [ ] includes = new string [ ] { "ois-v1-4svn/includes" , "dinput/" } ; build target win 32 home = build target . new default target ( target os . windows , false ) ; win 32 home . build file name = "build-windows32home.xml" ; win 32 home . exclude from master build file = true ; win 32 home . is 64 bit = false ; win 32 home . compiler prefix = "" ; win 32 home . cpp includes = windows src ; win 32 home . header dirs = includes ; win 32 home . c includes = new string [ 0 ] ; win 32 home . libraries = "-ldinput8 -ldxguid" ; build target win 32 = build target . new default target ( target os . windows , false ) ; win 32 . cpp includes = windows src ; win 32 . header dirs = includes ; win 32 . libraries = "-ldinput8 -ldxguid" ; build target win 64 = build target . new default target ( target os . windows , true ) ; win 64 . cpp includes = windows src ; win 64 . header dirs = includes ; win 64 . libraries = "-ldinput8 -ldxguid" ; build target lin 32 = build target . new default target ( target os . linux , false ) ; lin 32 . cpp includes = linux src ; lin 32 . header dirs = includes ; lin 32 . libraries = "-lX11" ; build target lin 64 = build target . new default target ( target os . linux , true ) ; lin 64 . cpp includes = linux src ; lin 64 . header dirs = includes ; lin 64 . libraries = "-lX11" ; build target mac = build target . new default target ( target os . mac os x , false ) ; mac . cpp includes = mac 64 src ; mac . header dirs = includes ; mac . cpp flags += " -x objective-c++" ; mac . libraries = "-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa" ; build target mac 64 = build target . new default target ( target os . mac os x , true ) ; mac 64 . cpp includes = mac 64 src ; mac 64 . header dirs = includes ; mac 64 . cpp flags += " -x objective-c++" ; mac 64 . libraries = "-framework CoreServices -framework Carbon -framework IOKit -framework Cocoa" ; new ant script generator ( ) . generate ( build config , win 32 home , win 32 , win 64 , lin 32 , lin 64 , mac , mac 64 ) ; } <SENTENCE_END/>


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,lower,limit

set

<SENTENCE_START> { dynamics jni . bt translational limit motor lower limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { dynamics jni . bt translational limit motor lower limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

lower

<SENTENCE_START> { dynamics jni . bt translational limit motor lower limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt translational limit motor lower limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt translational limit motor lower limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 92.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor lower limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor lower limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { dynamics jni . bt translational limit motor lower limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,lower,limit

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor lower limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor lower limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

lower

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor lower limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor lower limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor lower limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 91.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor lower limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor lower limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor lower limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,upper,limit

set

<SENTENCE_START> { dynamics jni . bt translational limit motor upper limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { dynamics jni . bt translational limit motor upper limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

upper

<SENTENCE_START> { dynamics jni . bt translational limit motor upper limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt translational limit motor upper limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt translational limit motor upper limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 91.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor upper limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor upper limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor upper limit set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,upper,limit

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor upper limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor upper limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

upper

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor upper limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor upper limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor upper limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 90.3%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor upper limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor upper limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor upper limit get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,accumulated,impulse

set

<SENTENCE_START> { dynamics jni . bt translational limit motor accumulated impulse set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { dynamics jni . bt translational limit motor accumulated impulse set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

accumulated

<SENTENCE_START> { dynamics jni . bt translational limit motor accumulated impulse set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor accumulated impulse set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

impulse

<SENTENCE_START> { dynamics jni . bt translational limit motor accumulated impulse set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor accumulated impulse set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor accumulated impulse set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor accumulated impulse set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,accumulated,impulse

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor accumulated impulse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor accumulated impulse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

accumulated

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor accumulated impulse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor accumulated impulse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

impulse

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor accumulated impulse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 98.4%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor accumulated impulse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor accumulated impulse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 5.1%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor accumulated impulse get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,limit,softness

set

<SENTENCE_START> { dynamics jni . bt translational limit motor limit softness set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { dynamics jni . bt translational limit motor limit softness set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt translational limit motor limit softness set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor limit softness set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

softness

<SENTENCE_START> { dynamics jni . bt translational limit motor limit softness set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 58.1%)

<SENTENCE_START> { dynamics jni . bt translational limit motor limit softness set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor limit softness set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt translational limit motor limit softness set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,limit,softness

get

<SENTENCE_START> { return dynamics jni . bt translational limit motor limit softness get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor limit softness get ( swig c ptr , this ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { return dynamics jni . bt translational limit motor limit softness get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor limit softness get ( swig c ptr , this ) ; } <SENTENCE_END/>

softness

<SENTENCE_START> { return dynamics jni . bt translational limit motor limit softness get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 75.8%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor limit softness get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor limit softness get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor limit softness get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,damping

set

<SENTENCE_START> { dynamics jni . bt translational limit motor damping set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { dynamics jni . bt translational limit motor damping set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

damping

<SENTENCE_START> { dynamics jni . bt translational limit motor damping set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { dynamics jni . bt translational limit motor damping set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor damping set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { dynamics jni . bt translational limit motor damping set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,damping

get

<SENTENCE_START> { return dynamics jni . bt translational limit motor damping get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor damping get ( swig c ptr , this ) ; } <SENTENCE_END/>

damping

<SENTENCE_START> { return dynamics jni . bt translational limit motor damping get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor damping get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor damping get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor damping get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,restitution

set

<SENTENCE_START> { dynamics jni . bt translational limit motor restitution set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { dynamics jni . bt translational limit motor restitution set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

restitution

<SENTENCE_START> { dynamics jni . bt translational limit motor restitution set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { dynamics jni . bt translational limit motor restitution set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor restitution set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { dynamics jni . bt translational limit motor restitution set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,restitution

get

<SENTENCE_START> { return dynamics jni . bt translational limit motor restitution get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor restitution get ( swig c ptr , this ) ; } <SENTENCE_END/>

restitution

<SENTENCE_START> { return dynamics jni . bt translational limit motor restitution get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor restitution get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor restitution get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor restitution get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,normal,cfm

set

<SENTENCE_START> { dynamics jni . bt translational limit motor normal cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor normal cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

normal

<SENTENCE_START> { dynamics jni . bt translational limit motor normal cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor normal cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

cfm

<SENTENCE_START> { dynamics jni . bt translational limit motor normal cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 77.2%)

<SENTENCE_START> { dynamics jni . bt translational limit motor normal cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor normal cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt translational limit motor normal cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,normal,cfm

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor normal cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor normal cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

normal

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor normal cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor normal cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

cfm

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor normal cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 68.6%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor normal cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor normal cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor normal cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,stop,erp

set

<SENTENCE_START> { dynamics jni . bt translational limit motor stop erp set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { dynamics jni . bt translational limit motor stop erp set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

stop

<SENTENCE_START> { dynamics jni . bt translational limit motor stop erp set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor stop erp set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

erp

<SENTENCE_START> { dynamics jni . bt translational limit motor stop erp set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 74.5%)

<SENTENCE_START> { dynamics jni . bt translational limit motor stop erp set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor stop erp set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { dynamics jni . bt translational limit motor stop erp set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,stop,erp

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop erp get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop erp get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

stop

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop erp get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop erp get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

erp

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop erp get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 67.9%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop erp get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop erp get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop erp get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,stop,cfm

set

<SENTENCE_START> { dynamics jni . bt translational limit motor stop cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { dynamics jni . bt translational limit motor stop cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

stop

<SENTENCE_START> { dynamics jni . bt translational limit motor stop cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt translational limit motor stop cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

cfm

<SENTENCE_START> { dynamics jni . bt translational limit motor stop cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 75.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor stop cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor stop cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { dynamics jni . bt translational limit motor stop cfm set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,stop,cfm

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

stop

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

cfm

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 69.1%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor stop cfm get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,enable,motor

set

<SENTENCE_START> { dynamics jni . bt translational limit motor enable motor set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { dynamics jni . bt translational limit motor enable motor set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

enable

<SENTENCE_START> { dynamics jni . bt translational limit motor enable motor set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor enable motor set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt translational limit motor enable motor set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 75.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor enable motor set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor enable motor set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { dynamics jni . bt translational limit motor enable motor set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,enable,motor

get

<SENTENCE_START> { return dynamics jni . bt translational limit motor enable motor get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor enable motor get ( swig c ptr , this ) ; } <SENTENCE_END/>

enable

<SENTENCE_START> { return dynamics jni . bt translational limit motor enable motor get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor enable motor get ( swig c ptr , this ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { return dynamics jni . bt translational limit motor enable motor get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 89.8%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor enable motor get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor enable motor get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor enable motor get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,target,velocity

set

<SENTENCE_START> { dynamics jni . bt translational limit motor target velocity set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor target velocity set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

target

<SENTENCE_START> { dynamics jni . bt translational limit motor target velocity set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor target velocity set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

velocity

<SENTENCE_START> { dynamics jni . bt translational limit motor target velocity set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 96.5%)

<SENTENCE_START> { dynamics jni . bt translational limit motor target velocity set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor target velocity set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { dynamics jni . bt translational limit motor target velocity set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,target,velocity

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor target velocity get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor target velocity get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

target

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor target velocity get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor target velocity get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

velocity

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor target velocity get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 94.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor target velocity get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor target velocity get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor target velocity get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,max,motor,force

set

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

max

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

force

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 80.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 6.7%)

<SENTENCE_START> { dynamics jni . bt translational limit motor max motor force set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,max,motor,force

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

max

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

force

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 76.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 7.0%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor max motor force get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,current,limit,error

set

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

current

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

error

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 63.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 7.1%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit error set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,current,limit,error

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

current

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

error

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 64.2%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current limit error get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,current,linear,diff

set

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

current

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

linear

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

diff

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 46.0%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 7.0%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current linear diff set ( swig c ptr , this , bt vector 3 . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,current,linear,diff

get

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

current

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

linear

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

diff

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 42.5%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 6.7%)

<SENTENCE_START> { long c ptr = dynamics jni . bt translational limit motor current linear diff get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt vector 3 ( c ptr , false ) ; } <SENTENCE_END/>


Original Name set,current,limit

set

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

current

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 60.1%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { dynamics jni . bt translational limit motor current limit set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,current,limit

get

<SENTENCE_START> { return dynamics jni . bt translational limit motor current limit get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor current limit get ( swig c ptr , this ) ; } <SENTENCE_END/>

current

<SENTENCE_START> { return dynamics jni . bt translational limit motor current limit get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor current limit get ( swig c ptr , this ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { return dynamics jni . bt translational limit motor current limit get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 78.8%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor current limit get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor current limit get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor current limit get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name is,limited

is

<SENTENCE_START> { return dynamics jni . bt translational limit motor is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 7.2%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

limited

<SENTENCE_START> { return dynamics jni . bt translational limit motor is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 98.0%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor is limited ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>


Original Name need,apply,force

need

<SENTENCE_START> { return dynamics jni . bt translational limit motor need apply force ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 8.2%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor need apply force ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

apply

<SENTENCE_START> { return dynamics jni . bt translational limit motor need apply force ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor need apply force ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

force

<SENTENCE_START> { return dynamics jni . bt translational limit motor need apply force ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 88.0%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor need apply force ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor need apply force ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor need apply force ( swig c ptr , this , limit index ) ; } <SENTENCE_END/>


Original Name test,limit,value

test

<SENTENCE_START> { return dynamics jni . bt translational limit motor test limit value ( swig c ptr , this , limit index , test value ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor test limit value ( swig c ptr , this , limit index , test value ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { return dynamics jni . bt translational limit motor test limit value ( swig c ptr , this , limit index , test value ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor test limit value ( swig c ptr , this , limit index , test value ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { return dynamics jni . bt translational limit motor test limit value ( swig c ptr , this , limit index , test value ) ; } <SENTENCE_END/>

(Copy Probability: 35.4%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor test limit value ( swig c ptr , this , limit index , test value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor test limit value ( swig c ptr , this , limit index , test value ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor test limit value ( swig c ptr , this , limit index , test value ) ; } <SENTENCE_END/>


Original Name solve,linear,axis

solve

<SENTENCE_START> { return dynamics jni . bt translational limit motor solve linear axis ( swig c ptr , this , time step , jac diag ab inv , bt rigid body . get c ptr ( body 1 ) , body 1 , point in a , bt rigid body . get c ptr ( body 2 ) , body 2 , point in b , limit index , axis normal on a , anchor pos ) ; } <SENTENCE_END/>

(Copy Probability: 16.2%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor solve linear axis ( swig c ptr , this , time step , jac diag ab inv , bt rigid body . get c ptr ( body 1 ) , body 1 , point in a , bt rigid body . get c ptr ( body 2 ) , body 2 , point in b , limit index , axis normal on a , anchor pos ) ; } <SENTENCE_END/>

linear

<SENTENCE_START> { return dynamics jni . bt translational limit motor solve linear axis ( swig c ptr , this , time step , jac diag ab inv , bt rigid body . get c ptr ( body 1 ) , body 1 , point in a , bt rigid body . get c ptr ( body 2 ) , body 2 , point in b , limit index , axis normal on a , anchor pos ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor solve linear axis ( swig c ptr , this , time step , jac diag ab inv , bt rigid body . get c ptr ( body 1 ) , body 1 , point in a , bt rigid body . get c ptr ( body 2 ) , body 2 , point in b , limit index , axis normal on a , anchor pos ) ; } <SENTENCE_END/>

axis

<SENTENCE_START> { return dynamics jni . bt translational limit motor solve linear axis ( swig c ptr , this , time step , jac diag ab inv , bt rigid body . get c ptr ( body 1 ) , body 1 , point in a , bt rigid body . get c ptr ( body 2 ) , body 2 , point in b , limit index , axis normal on a , anchor pos ) ; } <SENTENCE_END/>

(Copy Probability: 92.5%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor solve linear axis ( swig c ptr , this , time step , jac diag ab inv , bt rigid body . get c ptr ( body 1 ) , body 1 , point in a , bt rigid body . get c ptr ( body 2 ) , body 2 , point in b , limit index , axis normal on a , anchor pos ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt translational limit motor solve linear axis ( swig c ptr , this , time step , jac diag ab inv , bt rigid body . get c ptr ( body 1 ) , body 1 , point in a , bt rigid body . get c ptr ( body 2 ) , body 2 , point in b , limit index , axis normal on a , anchor pos ) ; } <SENTENCE_END/>

(Copy Probability: 9.2%)

<SENTENCE_START> { return dynamics jni . bt translational limit motor solve linear axis ( swig c ptr , this , time step , jac diag ab inv , bt rigid body . get c ptr ( body 1 ) , body 1 , point in a , bt rigid body . get c ptr ( body 2 ) , body 2 , point in b , limit index , axis normal on a , anchor pos ) ; } <SENTENCE_END/>


Original Name set,style

set

<SENTENCE_START> { if ( ! ( style instanceof check box style ) ) throw new illegal argument exception ( "style must be a CheckBoxStyle." ) ; super . %SELF% ( style ) ; this . style = ( check box style ) style ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( ! ( style instanceof check box style ) ) throw new illegal argument exception ( "style must be a CheckBoxStyle." ) ; super . %SELF% ( style ) ; this . style = ( check box style ) style ; } <SENTENCE_END/>

style

<SENTENCE_START> { if ( ! ( style instanceof check box style ) ) throw new illegal argument exception ( "style must be a CheckBoxStyle." ) ; super . %SELF% ( style ) ; this . style = ( check box style ) style ; } <SENTENCE_END/>

(Copy Probability: 69.4%)

<SENTENCE_START> { if ( ! ( style instanceof check box style ) ) throw new illegal argument exception ( "style must be a CheckBoxStyle." ) ; super . %SELF% ( style ) ; this . style = ( check box style ) style ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! ( style instanceof check box style ) ) throw new illegal argument exception ( "style must be a CheckBoxStyle." ) ; super . %SELF% ( style ) ; this . style = ( check box style ) style ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { if ( ! ( style instanceof check box style ) ) throw new illegal argument exception ( "style must be a CheckBoxStyle." ) ; super . %SELF% ( style ) ; this . style = ( check box style ) style ; } <SENTENCE_END/>


Original Name get,style

get

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

(Copy Probability: 0.5%)

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

style

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

(Copy Probability: 98.8%)

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

%END%

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

(Copy Probability: 1.5%)

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


Original Name draw

draw

<SENTENCE_START> { drawable checkbox = null ; if ( is disabled ( ) ) { if ( is checked && style . checkbox on disabled != null ) checkbox = style . checkbox on disabled ; else checkbox = style . checkbox off disabled ; } if ( checkbox == null ) { if ( is checked && style . checkbox on != null ) checkbox = style . checkbox on ; else if ( is over ( ) && style . checkbox over != null && ! is disabled ( ) ) checkbox = style . checkbox over ; else checkbox = style . checkbox off ; } image . set drawable ( checkbox ) ; super . %SELF% ( batch , parent alpha ) ; } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { drawable checkbox = null ; if ( is disabled ( ) ) { if ( is checked && style . checkbox on disabled != null ) checkbox = style . checkbox on disabled ; else checkbox = style . checkbox off disabled ; } if ( checkbox == null ) { if ( is checked && style . checkbox on != null ) checkbox = style . checkbox on ; else if ( is over ( ) && style . checkbox over != null && ! is disabled ( ) ) checkbox = style . checkbox over ; else checkbox = style . checkbox off ; } image . set drawable ( checkbox ) ; super . %SELF% ( batch , parent alpha ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { drawable checkbox = null ; if ( is disabled ( ) ) { if ( is checked && style . checkbox on disabled != null ) checkbox = style . checkbox on disabled ; else checkbox = style . checkbox off disabled ; } if ( checkbox == null ) { if ( is checked && style . checkbox on != null ) checkbox = style . checkbox on ; else if ( is over ( ) && style . checkbox over != null && ! is disabled ( ) ) checkbox = style . checkbox over ; else checkbox = style . checkbox off ; } image . set drawable ( checkbox ) ; super . %SELF% ( batch , parent alpha ) ; } <SENTENCE_END/>

(Copy Probability: 66.4%)

<SENTENCE_START> { drawable checkbox = null ; if ( is disabled ( ) ) { if ( is checked && style . checkbox on disabled != null ) checkbox = style . checkbox on disabled ; else checkbox = style . checkbox off disabled ; } if ( checkbox == null ) { if ( is checked && style . checkbox on != null ) checkbox = style . checkbox on ; else if ( is over ( ) && style . checkbox over != null && ! is disabled ( ) ) checkbox = style . checkbox over ; else checkbox = style . checkbox off ; } image . set drawable ( checkbox ) ; super . %SELF% ( batch , parent alpha ) ; } <SENTENCE_END/>


Original Name get,image

get

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

(Copy Probability: 0.5%)

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

image

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

(Copy Probability: 96.8%)

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

%END%

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

(Copy Probability: 3.2%)

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


Original Name get,image,cell

get

<SENTENCE_START> { return image cell ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return image cell ; } <SENTENCE_END/>

image

<SENTENCE_START> { return image cell ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { return image cell ; } <SENTENCE_END/>

cell

<SENTENCE_START> { return image cell ; } <SENTENCE_END/>

(Copy Probability: 97.4%)

<SENTENCE_START> { return image cell ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return image cell ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { return image cell ; } <SENTENCE_END/>


Original Name get,c,ptr

get

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

(Copy Probability: 1.5%)

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

c

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

(Copy Probability: 99.7%)

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

ptr

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

(Copy Probability: 99.8%)

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

%END%

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

(Copy Probability: 3.7%)

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


Original Name get,c,ptr

get

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

(Copy Probability: 1.5%)

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

c

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

(Copy Probability: 99.7%)

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

ptr

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

(Copy Probability: 99.8%)

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

%END%

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

(Copy Probability: 3.7%)

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


Original Name set,compound,shape

set

<SENTENCE_START> { collision jni . bt g impact compound shape compound primitive manager compound shape set ( swig c ptr , this , bt g impact compound shape . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { collision jni . bt g impact compound shape compound primitive manager compound shape set ( swig c ptr , this , bt g impact compound shape . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

compound

<SENTENCE_START> { collision jni . bt g impact compound shape compound primitive manager compound shape set ( swig c ptr , this , bt g impact compound shape . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { collision jni . bt g impact compound shape compound primitive manager compound shape set ( swig c ptr , this , bt g impact compound shape . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { collision jni . bt g impact compound shape compound primitive manager compound shape set ( swig c ptr , this , bt g impact compound shape . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt g impact compound shape compound primitive manager compound shape set ( swig c ptr , this , bt g impact compound shape . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact compound shape compound primitive manager compound shape set ( swig c ptr , this , bt g impact compound shape . get c ptr ( value ) , value ) ; } <SENTENCE_END/>

(Copy Probability: 70.0%)

<SENTENCE_START> { collision jni . bt g impact compound shape compound primitive manager compound shape set ( swig c ptr , this , bt g impact compound shape . get c ptr ( value ) , value ) ; } <SENTENCE_END/>


Original Name get,compound,shape

get

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape compound primitive manager compound shape get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape compound primitive manager compound shape get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape ( c ptr , false ) ; } <SENTENCE_END/>

compound

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape compound primitive manager compound shape get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape compound primitive manager compound shape get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape ( c ptr , false ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape compound primitive manager compound shape get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape compound primitive manager compound shape get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape compound primitive manager compound shape get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 72.0%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape compound primitive manager compound shape get ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape ( c ptr , false ) ; } <SENTENCE_END/>


Original Name get,compound,primitive,manager

get

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

compound

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

primitive

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

manager

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 62.8%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 8.4%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get compound primitive manager ( swig c ptr , this ) ; return ( c ptr == 0 ) ? null : new bt g impact compound shape . compound primitive manager ( c ptr , false ) ; } <SENTENCE_END/>


Original Name add,child,shape

add

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 0 ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 19.8%)

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 0 ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 0 ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 0 ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 0 ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 0 ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 0 ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 7.7%)

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 0 ( swig c ptr , this , local transform , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>


Original Name add,child,shape

add

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 1 ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 18.9%)

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 1 ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 1 ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 1 ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 1 ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 1 ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 1 ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>

(Copy Probability: 9.2%)

<SENTENCE_START> { collision jni . bt g impact compound shape add child shape swig 1 ( swig c ptr , this , bt collision shape . get c ptr ( shape ) , shape ) ; } <SENTENCE_END/>


Original Name get,child,shape

get

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get child shape swig 0 ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : bt collision shape . new derived object ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 9.2%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get child shape swig 0 ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : bt collision shape . new derived object ( c ptr , false ) ; } <SENTENCE_END/>

child

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get child shape swig 0 ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : bt collision shape . new derived object ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get child shape swig 0 ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : bt collision shape . new derived object ( c ptr , false ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get child shape swig 0 ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : bt collision shape . new derived object ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get child shape swig 0 ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : bt collision shape . new derived object ( c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get child shape swig 0 ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : bt collision shape . new derived object ( c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 19.5%)

<SENTENCE_START> { long c ptr = collision jni . bt g impact compound shape get child shape swig 0 ( swig c ptr , this , index ) ; return ( c ptr == 0 ) ? null : bt collision shape . new derived object ( c ptr , false ) ; } <SENTENCE_END/>


Original Name get,attribute,type

get

<SENTENCE_START> { for ( int i = 0 ; i < types . size ; i ++ ) if ( types . get ( i ) . compare to ( alias ) == 0 ) return 1L << i ; return 0 ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { for ( int i = 0 ; i < types . size ; i ++ ) if ( types . get ( i ) . compare to ( alias ) == 0 ) return 1L << i ; return 0 ; } <SENTENCE_END/>

attribute

<SENTENCE_START> { for ( int i = 0 ; i < types . size ; i ++ ) if ( types . get ( i ) . compare to ( alias ) == 0 ) return 1L << i ; return 0 ; } <SENTENCE_END/>

(Copy Probability: 12.1%)

<SENTENCE_START> { for ( int i = 0 ; i < types . size ; i ++ ) if ( types . get ( i ) . compare to ( alias ) == 0 ) return 1L << i ; return 0 ; } <SENTENCE_END/>

type

<SENTENCE_START> { for ( int i = 0 ; i < types . size ; i ++ ) if ( types . get ( i ) . compare to ( alias ) == 0 ) return 1L << i ; return 0 ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { for ( int i = 0 ; i < types . size ; i ++ ) if ( types . get ( i ) . compare to ( alias ) == 0 ) return 1L << i ; return 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int i = 0 ; i < types . size ; i ++ ) if ( types . get ( i ) . compare to ( alias ) == 0 ) return 1L << i ; return 0 ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { for ( int i = 0 ; i < types . size ; i ++ ) if ( types . get ( i ) . compare to ( alias ) == 0 ) return 1L << i ; return 0 ; } <SENTENCE_END/>


Original Name get,attribute,alias

get

<SENTENCE_START> { int idx = - 1 ; while ( type != 0 && ++ idx < 63 && ( ( ( type >> idx ) & 1 ) == 0 ) ) ; return ( idx >= 0 && idx < types . size ) ? types . get ( idx ) : null ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { int idx = - 1 ; while ( type != 0 && ++ idx < 63 && ( ( ( type >> idx ) & 1 ) == 0 ) ) ; return ( idx >= 0 && idx < types . size ) ? types . get ( idx ) : null ; } <SENTENCE_END/>

attribute

<SENTENCE_START> { int idx = - 1 ; while ( type != 0 && ++ idx < 63 && ( ( ( type >> idx ) & 1 ) == 0 ) ) ; return ( idx >= 0 && idx < types . size ) ? types . get ( idx ) : null ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { int idx = - 1 ; while ( type != 0 && ++ idx < 63 && ( ( ( type >> idx ) & 1 ) == 0 ) ) ; return ( idx >= 0 && idx < types . size ) ? types . get ( idx ) : null ; } <SENTENCE_END/>

alias

<SENTENCE_START> { int idx = - 1 ; while ( type != 0 && ++ idx < 63 && ( ( ( type >> idx ) & 1 ) == 0 ) ) ; return ( idx >= 0 && idx < types . size ) ? types . get ( idx ) : null ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { int idx = - 1 ; while ( type != 0 && ++ idx < 63 && ( ( ( type >> idx ) & 1 ) == 0 ) ) ; return ( idx >= 0 && idx < types . size ) ? types . get ( idx ) : null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int idx = - 1 ; while ( type != 0 && ++ idx < 63 && ( ( ( type >> idx ) & 1 ) == 0 ) ) ; return ( idx >= 0 && idx < types . size ) ? types . get ( idx ) : null ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { int idx = - 1 ; while ( type != 0 && ++ idx < 63 && ( ( ( type >> idx ) & 1 ) == 0 ) ) ; return ( idx >= 0 && idx < types . size ) ? types . get ( idx ) : null ; } <SENTENCE_END/>


Original Name register

register

<SENTENCE_START> { long result = get attribute type ( alias ) ; if ( result > 0 ) return result ; types . add ( alias ) ; return 1L << ( types . size - 1 ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { long result = get attribute type ( alias ) ; if ( result > 0 ) return result ; types . add ( alias ) ; return 1L << ( types . size - 1 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { long result = get attribute type ( alias ) ; if ( result > 0 ) return result ; types . add ( alias ) ; return 1L << ( types . size - 1 ) ; } <SENTENCE_END/>

(Copy Probability: 14.6%)

<SENTENCE_START> { long result = get attribute type ( alias ) ; if ( result > 0 ) return result ; types . add ( alias ) ; return 1L << ( types . size - 1 ) ; } <SENTENCE_END/>


Original Name equals

equals

<SENTENCE_START> { return other . hash code ( ) == hash code ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return other . hash code ( ) == hash code ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return other . hash code ( ) == hash code ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { return other . hash code ( ) == hash code ( ) ; } <SENTENCE_END/>


Original Name copy

copy

<SENTENCE_START> { read only int array buffer buf = new read only int array buffer ( other . capacity ( ) , other . backing array , other . offset ) ; buf . limit = other . limit ( ) ; buf . position = other . position ( ) ; buf . mark = mark of other ; return buf ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { read only int array buffer buf = new read only int array buffer ( other . capacity ( ) , other . backing array , other . offset ) ; buf . limit = other . limit ( ) ; buf . position = other . position ( ) ; buf . mark = mark of other ; return buf ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { read only int array buffer buf = new read only int array buffer ( other . capacity ( ) , other . backing array , other . offset ) ; buf . limit = other . limit ( ) ; buf . position = other . position ( ) ; buf . mark = mark of other ; return buf ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { read only int array buffer buf = new read only int array buffer ( other . capacity ( ) , other . backing array , other . offset ) ; buf . limit = other . limit ( ) ; buf . position = other . position ( ) ; buf . mark = mark of other ; return buf ; } <SENTENCE_END/>


Original Name as,read,only,buffer

as

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

read

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

only

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

buffer

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return duplicate ( ) ; } <SENTENCE_END/>


Original Name compact

compact

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>


Original Name duplicate

duplicate

<SENTENCE_START> { return copy ( this , mark ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return copy ( this , mark ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return copy ( this , mark ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return copy ( this , mark ) ; } <SENTENCE_END/>


Original Name is,read,only

is

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

(Copy Probability: 0.2%)

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

read

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

(Copy Probability: 0.2%)

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

only

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

(Copy Probability: 0.1%)

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

%END%

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

(Copy Probability: 0.1%)

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


Original Name protected,array

protected

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>


Original Name protected,array,offset

protected

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

offset

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>


Original Name protected,has,array

protected

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

(Copy Probability: 0.2%)

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

has

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

(Copy Probability: 0.3%)

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

array

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

(Copy Probability: 0.1%)

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

%END%

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

(Copy Probability: 0.1%)

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


Original Name put

put

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>


Original Name put

put

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>


Original Name put

put

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>


Original Name put

put

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw new read only buffer exception ( ) ; } <SENTENCE_END/>


Original Name slice

slice

<SENTENCE_START> { return new read only int array buffer ( remaining ( ) , backing array , offset + position ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return new read only int array buffer ( remaining ( ) , backing array , offset + position ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new read only int array buffer ( remaining ( ) , backing array , offset + position ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return new read only int array buffer ( remaining ( ) , backing array , offset + position ) ; } <SENTENCE_END/>


Original Name left

left

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . left ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . left ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . left ) ; } <SENTENCE_END/>

(Copy Probability: 32.1%)

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . left ) ; } <SENTENCE_END/>


Original Name left

left

<SENTENCE_START> { return button == buttons . left ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return button == buttons . left ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return button == buttons . left ; } <SENTENCE_END/>

(Copy Probability: 13.6%)

<SENTENCE_START> { return button == buttons . left ; } <SENTENCE_END/>


Original Name right

right

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . right ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . right ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . right ) ; } <SENTENCE_END/>

(Copy Probability: 36.4%)

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . right ) ; } <SENTENCE_END/>


Original Name right

right

<SENTENCE_START> { return button == buttons . right ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return button == buttons . right ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return button == buttons . right ; } <SENTENCE_END/>

(Copy Probability: 17.6%)

<SENTENCE_START> { return button == buttons . right ; } <SENTENCE_END/>


Original Name middle

middle

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . middle ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . middle ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . middle ) ; } <SENTENCE_END/>

(Copy Probability: 58.1%)

<SENTENCE_START> { return gdx . input . is button pressed ( buttons . middle ) ; } <SENTENCE_END/>


Original Name middle

middle

<SENTENCE_START> { return button == buttons . middle ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return button == buttons . middle ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return button == buttons . middle ; } <SENTENCE_END/>

(Copy Probability: 38.5%)

<SENTENCE_START> { return button == buttons . middle ; } <SENTENCE_END/>


Original Name shift

shift

<SENTENCE_START> { return gdx . input . is key pressed ( keys . shift left ) || gdx . input . is key pressed ( keys . shift right ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return gdx . input . is key pressed ( keys . shift left ) || gdx . input . is key pressed ( keys . shift right ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return gdx . input . is key pressed ( keys . shift left ) || gdx . input . is key pressed ( keys . shift right ) ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { return gdx . input . is key pressed ( keys . shift left ) || gdx . input . is key pressed ( keys . shift right ) ; } <SENTENCE_END/>


Original Name shift

shift

<SENTENCE_START> { return keycode == keys . shift left || keycode == keys . shift right ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return keycode == keys . shift left || keycode == keys . shift right ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return keycode == keys . shift left || keycode == keys . shift right ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { return keycode == keys . shift left || keycode == keys . shift right ; } <SENTENCE_END/>


Original Name ctrl

ctrl

<SENTENCE_START> { if ( is mac ) return gdx . input . is key pressed ( keys . sym ) ; else return gdx . input . is key pressed ( keys . control left ) || gdx . input . is key pressed ( keys . control right ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( is mac ) return gdx . input . is key pressed ( keys . sym ) ; else return gdx . input . is key pressed ( keys . control left ) || gdx . input . is key pressed ( keys . control right ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( is mac ) return gdx . input . is key pressed ( keys . sym ) ; else return gdx . input . is key pressed ( keys . control left ) || gdx . input . is key pressed ( keys . control right ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { if ( is mac ) return gdx . input . is key pressed ( keys . sym ) ; else return gdx . input . is key pressed ( keys . control left ) || gdx . input . is key pressed ( keys . control right ) ; } <SENTENCE_END/>


Original Name ctrl

ctrl

<SENTENCE_START> { if ( is mac ) return keycode == keys . sym ; else return keycode == keys . control left || keycode == keys . control right ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { if ( is mac ) return keycode == keys . sym ; else return keycode == keys . control left || keycode == keys . control right ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( is mac ) return keycode == keys . sym ; else return keycode == keys . control left || keycode == keys . control right ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { if ( is mac ) return keycode == keys . sym ; else return keycode == keys . control left || keycode == keys . control right ; } <SENTENCE_END/>


Original Name alt

alt

<SENTENCE_START> { return gdx . input . is key pressed ( keys . alt left ) || gdx . input . is key pressed ( keys . alt right ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return gdx . input . is key pressed ( keys . alt left ) || gdx . input . is key pressed ( keys . alt right ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return gdx . input . is key pressed ( keys . alt left ) || gdx . input . is key pressed ( keys . alt right ) ; } <SENTENCE_END/>

(Copy Probability: 5.9%)

<SENTENCE_START> { return gdx . input . is key pressed ( keys . alt left ) || gdx . input . is key pressed ( keys . alt right ) ; } <SENTENCE_END/>


Original Name alt

alt

<SENTENCE_START> { return keycode == keys . alt left || keycode == keys . alt right ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return keycode == keys . alt left || keycode == keys . alt right ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return keycode == keys . alt left || keycode == keys . alt right ; } <SENTENCE_END/>

(Copy Probability: 5.6%)

<SENTENCE_START> { return keycode == keys . alt left || keycode == keys . alt right ; } <SENTENCE_END/>


Original Name to,barycoord

to

<SENTENCE_START> { vector 2 v 0 = tmp 1 . set ( b ) . sub ( a ) ; vector 2 v 1 = tmp 2 . set ( c ) . sub ( a ) ; vector 2 v 2 = tmp 3 . set ( p ) . sub ( a ) ; float d 00 = v 0 . dot ( v 0 ) ; float d 01 = v 0 . dot ( v 1 ) ; float d 11 = v 1 . dot ( v 1 ) ; float d 20 = v 2 . dot ( v 0 ) ; float d 21 = v 2 . dot ( v 1 ) ; float denom = d 00 * d 11 - d 01 * d 01 ; barycentric out . x = ( d 11 * d 20 - d 01 * d 21 ) / denom ; barycentric out . y = ( d 00 * d 21 - d 01 * d 20 ) / denom ; return barycentric out ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { vector 2 v 0 = tmp 1 . set ( b ) . sub ( a ) ; vector 2 v 1 = tmp 2 . set ( c ) . sub ( a ) ; vector 2 v 2 = tmp 3 . set ( p ) . sub ( a ) ; float d 00 = v 0 . dot ( v 0 ) ; float d 01 = v 0 . dot ( v 1 ) ; float d 11 = v 1 . dot ( v 1 ) ; float d 20 = v 2 . dot ( v 0 ) ; float d 21 = v 2 . dot ( v 1 ) ; float denom = d 00 * d 11 - d 01 * d 01 ; barycentric out . x = ( d 11 * d 20 - d 01 * d 21 ) / denom ; barycentric out . y = ( d 00 * d 21 - d 01 * d 20 ) / denom ; return barycentric out ; } <SENTENCE_END/>

barycoord

<SENTENCE_START> { vector 2 v 0 = tmp 1 . set ( b ) . sub ( a ) ; vector 2 v 1 = tmp 2 . set ( c ) . sub ( a ) ; vector 2 v 2 = tmp 3 . set ( p ) . sub ( a ) ; float d 00 = v 0 . dot ( v 0 ) ; float d 01 = v 0 . dot ( v 1 ) ; float d 11 = v 1 . dot ( v 1 ) ; float d 20 = v 2 . dot ( v 0 ) ; float d 21 = v 2 . dot ( v 1 ) ; float denom = d 00 * d 11 - d 01 * d 01 ; barycentric out . x = ( d 11 * d 20 - d 01 * d 21 ) / denom ; barycentric out . y = ( d 00 * d 21 - d 01 * d 20 ) / denom ; return barycentric out ; } <SENTENCE_END/>

(Copy Probability: 24.4%)

<SENTENCE_START> { vector 2 v 0 = tmp 1 . set ( b ) . sub ( a ) ; vector 2 v 1 = tmp 2 . set ( c ) . sub ( a ) ; vector 2 v 2 = tmp 3 . set ( p ) . sub ( a ) ; float d 00 = v 0 . dot ( v 0 ) ; float d 01 = v 0 . dot ( v 1 ) ; float d 11 = v 1 . dot ( v 1 ) ; float d 20 = v 2 . dot ( v 0 ) ; float d 21 = v 2 . dot ( v 1 ) ; float denom = d 00 * d 11 - d 01 * d 01 ; barycentric out . x = ( d 11 * d 20 - d 01 * d 21 ) / denom ; barycentric out . y = ( d 00 * d 21 - d 01 * d 20 ) / denom ; return barycentric out ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { vector 2 v 0 = tmp 1 . set ( b ) . sub ( a ) ; vector 2 v 1 = tmp 2 . set ( c ) . sub ( a ) ; vector 2 v 2 = tmp 3 . set ( p ) . sub ( a ) ; float d 00 = v 0 . dot ( v 0 ) ; float d 01 = v 0 . dot ( v 1 ) ; float d 11 = v 1 . dot ( v 1 ) ; float d 20 = v 2 . dot ( v 0 ) ; float d 21 = v 2 . dot ( v 1 ) ; float denom = d 00 * d 11 - d 01 * d 01 ; barycentric out . x = ( d 11 * d 20 - d 01 * d 21 ) / denom ; barycentric out . y = ( d 00 * d 21 - d 01 * d 20 ) / denom ; return barycentric out ; } <SENTENCE_END/>

(Copy Probability: 19.0%)

<SENTENCE_START> { vector 2 v 0 = tmp 1 . set ( b ) . sub ( a ) ; vector 2 v 1 = tmp 2 . set ( c ) . sub ( a ) ; vector 2 v 2 = tmp 3 . set ( p ) . sub ( a ) ; float d 00 = v 0 . dot ( v 0 ) ; float d 01 = v 0 . dot ( v 1 ) ; float d 11 = v 1 . dot ( v 1 ) ; float d 20 = v 2 . dot ( v 0 ) ; float d 21 = v 2 . dot ( v 1 ) ; float denom = d 00 * d 11 - d 01 * d 01 ; barycentric out . x = ( d 11 * d 20 - d 01 * d 21 ) / denom ; barycentric out . y = ( d 00 * d 21 - d 01 * d 20 ) / denom ; return barycentric out ; } <SENTENCE_END/>


Original Name barycoord,inside,triangle

barycoord

<SENTENCE_START> { return barycentric . x >= 0 && barycentric . y >= 0 && barycentric . x + barycentric . y <= 1 ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return barycentric . x >= 0 && barycentric . y >= 0 && barycentric . x + barycentric . y <= 1 ; } <SENTENCE_END/>

inside

<SENTENCE_START> { return barycentric . x >= 0 && barycentric . y >= 0 && barycentric . x + barycentric . y <= 1 ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { return barycentric . x >= 0 && barycentric . y >= 0 && barycentric . x + barycentric . y <= 1 ; } <SENTENCE_END/>

triangle

<SENTENCE_START> { return barycentric . x >= 0 && barycentric . y >= 0 && barycentric . x + barycentric . y <= 1 ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return barycentric . x >= 0 && barycentric . y >= 0 && barycentric . x + barycentric . y <= 1 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return barycentric . x >= 0 && barycentric . y >= 0 && barycentric . x + barycentric . y <= 1 ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { return barycentric . x >= 0 && barycentric . y >= 0 && barycentric . x + barycentric . y <= 1 ; } <SENTENCE_END/>


Original Name from,barycoord

from

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; interpolated out . x = u * a . x + barycentric . x * b . x + barycentric . y * c . x ; interpolated out . y = u * a . y + barycentric . x * b . y + barycentric . y * c . y ; return interpolated out ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; interpolated out . x = u * a . x + barycentric . x * b . x + barycentric . y * c . x ; interpolated out . y = u * a . y + barycentric . x * b . y + barycentric . y * c . y ; return interpolated out ; } <SENTENCE_END/>

barycoord

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; interpolated out . x = u * a . x + barycentric . x * b . x + barycentric . y * c . x ; interpolated out . y = u * a . y + barycentric . x * b . y + barycentric . y * c . y ; return interpolated out ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; interpolated out . x = u * a . x + barycentric . x * b . x + barycentric . y * c . x ; interpolated out . y = u * a . y + barycentric . x * b . y + barycentric . y * c . y ; return interpolated out ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; interpolated out . x = u * a . x + barycentric . x * b . x + barycentric . y * c . x ; interpolated out . y = u * a . y + barycentric . x * b . y + barycentric . y * c . y ; return interpolated out ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; interpolated out . x = u * a . x + barycentric . x * b . x + barycentric . y * c . x ; interpolated out . y = u * a . y + barycentric . x * b . y + barycentric . y * c . y ; return interpolated out ; } <SENTENCE_END/>


Original Name from,barycoord

from

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; return u * a + barycentric . x * b + barycentric . y * c ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; return u * a + barycentric . x * b + barycentric . y * c ; } <SENTENCE_END/>

barycoord

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; return u * a + barycentric . x * b + barycentric . y * c ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; return u * a + barycentric . x * b + barycentric . y * c ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; return u * a + barycentric . x * b + barycentric . y * c ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { float u = 1 - barycentric . x - barycentric . y ; return u * a + barycentric . x * b + barycentric . y * c ; } <SENTENCE_END/>


Original Name lowest,positive,root

lowest

<SENTENCE_START> { float det = b * b - 4 * a * c ; if ( det < 0 ) return float . na n ; float sqrt d = ( float ) math . sqrt ( det ) ; float inv a = 1 / ( 2 * a ) ; float r 1 = ( - b - sqrt d ) * inv a ; float r 2 = ( - b + sqrt d ) * inv a ; if ( r 1 > r 2 ) { float tmp = r 2 ; r 2 = r 1 ; r 1 = tmp ; } if ( r 1 > 0 ) return r 1 ; if ( r 2 > 0 ) return r 2 ; return float . na n ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { float det = b * b - 4 * a * c ; if ( det < 0 ) return float . na n ; float sqrt d = ( float ) math . sqrt ( det ) ; float inv a = 1 / ( 2 * a ) ; float r 1 = ( - b - sqrt d ) * inv a ; float r 2 = ( - b + sqrt d ) * inv a ; if ( r 1 > r 2 ) { float tmp = r 2 ; r 2 = r 1 ; r 1 = tmp ; } if ( r 1 > 0 ) return r 1 ; if ( r 2 > 0 ) return r 2 ; return float . na n ; } <SENTENCE_END/>

positive

<SENTENCE_START> { float det = b * b - 4 * a * c ; if ( det < 0 ) return float . na n ; float sqrt d = ( float ) math . sqrt ( det ) ; float inv a = 1 / ( 2 * a ) ; float r 1 = ( - b - sqrt d ) * inv a ; float r 2 = ( - b + sqrt d ) * inv a ; if ( r 1 > r 2 ) { float tmp = r 2 ; r 2 = r 1 ; r 1 = tmp ; } if ( r 1 > 0 ) return r 1 ; if ( r 2 > 0 ) return r 2 ; return float . na n ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { float det = b * b - 4 * a * c ; if ( det < 0 ) return float . na n ; float sqrt d = ( float ) math . sqrt ( det ) ; float inv a = 1 / ( 2 * a ) ; float r 1 = ( - b - sqrt d ) * inv a ; float r 2 = ( - b + sqrt d ) * inv a ; if ( r 1 > r 2 ) { float tmp = r 2 ; r 2 = r 1 ; r 1 = tmp ; } if ( r 1 > 0 ) return r 1 ; if ( r 2 > 0 ) return r 2 ; return float . na n ; } <SENTENCE_END/>

root

<SENTENCE_START> { float det = b * b - 4 * a * c ; if ( det < 0 ) return float . na n ; float sqrt d = ( float ) math . sqrt ( det ) ; float inv a = 1 / ( 2 * a ) ; float r 1 = ( - b - sqrt d ) * inv a ; float r 2 = ( - b + sqrt d ) * inv a ; if ( r 1 > r 2 ) { float tmp = r 2 ; r 2 = r 1 ; r 1 = tmp ; } if ( r 1 > 0 ) return r 1 ; if ( r 2 > 0 ) return r 2 ; return float . na n ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { float det = b * b - 4 * a * c ; if ( det < 0 ) return float . na n ; float sqrt d = ( float ) math . sqrt ( det ) ; float inv a = 1 / ( 2 * a ) ; float r 1 = ( - b - sqrt d ) * inv a ; float r 2 = ( - b + sqrt d ) * inv a ; if ( r 1 > r 2 ) { float tmp = r 2 ; r 2 = r 1 ; r 1 = tmp ; } if ( r 1 > 0 ) return r 1 ; if ( r 2 > 0 ) return r 2 ; return float . na n ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float det = b * b - 4 * a * c ; if ( det < 0 ) return float . na n ; float sqrt d = ( float ) math . sqrt ( det ) ; float inv a = 1 / ( 2 * a ) ; float r 1 = ( - b - sqrt d ) * inv a ; float r 2 = ( - b + sqrt d ) * inv a ; if ( r 1 > r 2 ) { float tmp = r 2 ; r 2 = r 1 ; r 1 = tmp ; } if ( r 1 > 0 ) return r 1 ; if ( r 2 > 0 ) return r 2 ; return float . na n ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { float det = b * b - 4 * a * c ; if ( det < 0 ) return float . na n ; float sqrt d = ( float ) math . sqrt ( det ) ; float inv a = 1 / ( 2 * a ) ; float r 1 = ( - b - sqrt d ) * inv a ; float r 2 = ( - b + sqrt d ) * inv a ; if ( r 1 > r 2 ) { float tmp = r 2 ; r 2 = r 1 ; r 1 = tmp ; } if ( r 1 > 0 ) return r 1 ; if ( r 2 > 0 ) return r 2 ; return float . na n ; } <SENTENCE_END/>


Original Name colinear

colinear

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; return math . abs ( det ) < math utils . float rounding error ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; return math . abs ( det ) < math utils . float rounding error ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; return math . abs ( det ) < math utils . float rounding error ; } <SENTENCE_END/>

(Copy Probability: 8.2%)

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; return math . abs ( det ) < math utils . float rounding error ; } <SENTENCE_END/>


Original Name triangle,centroid

triangle

<SENTENCE_START> { centroid . x = ( x 1 + x 2 + x 3 ) / 3 ; centroid . y = ( y 1 + y 2 + y 3 ) / 3 ; return centroid ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { centroid . x = ( x 1 + x 2 + x 3 ) / 3 ; centroid . y = ( y 1 + y 2 + y 3 ) / 3 ; return centroid ; } <SENTENCE_END/>

centroid

<SENTENCE_START> { centroid . x = ( x 1 + x 2 + x 3 ) / 3 ; centroid . y = ( y 1 + y 2 + y 3 ) / 3 ; return centroid ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { centroid . x = ( x 1 + x 2 + x 3 ) / 3 ; centroid . y = ( y 1 + y 2 + y 3 ) / 3 ; return centroid ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { centroid . x = ( x 1 + x 2 + x 3 ) / 3 ; centroid . y = ( y 1 + y 2 + y 3 ) / 3 ; return centroid ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { centroid . x = ( x 1 + x 2 + x 3 ) / 3 ; centroid . y = ( y 1 + y 2 + y 3 ) / 3 ; return centroid ; } <SENTENCE_END/>


Original Name triangle,circumcenter

triangle

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float dx 13 = x 1 - x 3 , dy 13 = y 1 - y 3 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; if ( math . abs ( det ) < math utils . float rounding error ) throw new illegal argument exception ( "Triangle points must not be colinear." ) ; det *= 2 ; float sqr 1 = x 1 * x 1 + y 1 * y 1 , sqr 2 = x 2 * x 2 + y 2 * y 2 , sqr 3 = x 3 * x 3 + y 3 * y 3 ; circumcenter . set ( ( sqr 1 * dy 32 + sqr 2 * dy 13 + sqr 3 * dy 21 ) / det , - ( sqr 1 * dx 32 + sqr 2 * dx 13 + sqr 3 * dx 21 ) / det ) ; return circumcenter ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float dx 13 = x 1 - x 3 , dy 13 = y 1 - y 3 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; if ( math . abs ( det ) < math utils . float rounding error ) throw new illegal argument exception ( "Triangle points must not be colinear." ) ; det *= 2 ; float sqr 1 = x 1 * x 1 + y 1 * y 1 , sqr 2 = x 2 * x 2 + y 2 * y 2 , sqr 3 = x 3 * x 3 + y 3 * y 3 ; circumcenter . set ( ( sqr 1 * dy 32 + sqr 2 * dy 13 + sqr 3 * dy 21 ) / det , - ( sqr 1 * dx 32 + sqr 2 * dx 13 + sqr 3 * dx 21 ) / det ) ; return circumcenter ; } <SENTENCE_END/>

circumcenter

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float dx 13 = x 1 - x 3 , dy 13 = y 1 - y 3 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; if ( math . abs ( det ) < math utils . float rounding error ) throw new illegal argument exception ( "Triangle points must not be colinear." ) ; det *= 2 ; float sqr 1 = x 1 * x 1 + y 1 * y 1 , sqr 2 = x 2 * x 2 + y 2 * y 2 , sqr 3 = x 3 * x 3 + y 3 * y 3 ; circumcenter . set ( ( sqr 1 * dy 32 + sqr 2 * dy 13 + sqr 3 * dy 21 ) / det , - ( sqr 1 * dx 32 + sqr 2 * dx 13 + sqr 3 * dx 21 ) / det ) ; return circumcenter ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float dx 13 = x 1 - x 3 , dy 13 = y 1 - y 3 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; if ( math . abs ( det ) < math utils . float rounding error ) throw new illegal argument exception ( "Triangle points must not be colinear." ) ; det *= 2 ; float sqr 1 = x 1 * x 1 + y 1 * y 1 , sqr 2 = x 2 * x 2 + y 2 * y 2 , sqr 3 = x 3 * x 3 + y 3 * y 3 ; circumcenter . set ( ( sqr 1 * dy 32 + sqr 2 * dy 13 + sqr 3 * dy 21 ) / det , - ( sqr 1 * dx 32 + sqr 2 * dx 13 + sqr 3 * dx 21 ) / det ) ; return circumcenter ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float dx 13 = x 1 - x 3 , dy 13 = y 1 - y 3 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; if ( math . abs ( det ) < math utils . float rounding error ) throw new illegal argument exception ( "Triangle points must not be colinear." ) ; det *= 2 ; float sqr 1 = x 1 * x 1 + y 1 * y 1 , sqr 2 = x 2 * x 2 + y 2 * y 2 , sqr 3 = x 3 * x 3 + y 3 * y 3 ; circumcenter . set ( ( sqr 1 * dy 32 + sqr 2 * dy 13 + sqr 3 * dy 21 ) / det , - ( sqr 1 * dx 32 + sqr 2 * dx 13 + sqr 3 * dx 21 ) / det ) ; return circumcenter ; } <SENTENCE_END/>

(Copy Probability: 7.8%)

<SENTENCE_START> { float dx 21 = x 2 - x 1 , dy 21 = y 2 - y 1 ; float dx 32 = x 3 - x 2 , dy 32 = y 3 - y 2 ; float dx 13 = x 1 - x 3 , dy 13 = y 1 - y 3 ; float det = dx 32 * dy 21 - dx 21 * dy 32 ; if ( math . abs ( det ) < math utils . float rounding error ) throw new illegal argument exception ( "Triangle points must not be colinear." ) ; det *= 2 ; float sqr 1 = x 1 * x 1 + y 1 * y 1 , sqr 2 = x 2 * x 2 + y 2 * y 2 , sqr 3 = x 3 * x 3 + y 3 * y 3 ; circumcenter . set ( ( sqr 1 * dy 32 + sqr 2 * dy 13 + sqr 3 * dy 21 ) / det , - ( sqr 1 * dx 32 + sqr 2 * dx 13 + sqr 3 * dx 21 ) / det ) ; return circumcenter ; } <SENTENCE_END/>


Original Name triangle,area

triangle

<SENTENCE_START> { return math . abs ( ( x 1 - x 3 ) * ( y 2 - y 1 ) - ( x 1 - x 2 ) * ( y 3 - y 1 ) ) * 0.5f ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return math . abs ( ( x 1 - x 3 ) * ( y 2 - y 1 ) - ( x 1 - x 2 ) * ( y 3 - y 1 ) ) * 0.5f ; } <SENTENCE_END/>

area

<SENTENCE_START> { return math . abs ( ( x 1 - x 3 ) * ( y 2 - y 1 ) - ( x 1 - x 2 ) * ( y 3 - y 1 ) ) * 0.5f ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return math . abs ( ( x 1 - x 3 ) * ( y 2 - y 1 ) - ( x 1 - x 2 ) * ( y 3 - y 1 ) ) * 0.5f ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return math . abs ( ( x 1 - x 3 ) * ( y 2 - y 1 ) - ( x 1 - x 2 ) * ( y 3 - y 1 ) ) * 0.5f ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return math . abs ( ( x 1 - x 3 ) * ( y 2 - y 1 ) - ( x 1 - x 2 ) * ( y 3 - y 1 ) ) * 0.5f ; } <SENTENCE_END/>


Original Name quadrilateral,centroid

quadrilateral

<SENTENCE_START> { float avg x 1 = ( x 1 + x 2 + x 3 ) / 3 ; float avg y 1 = ( y 1 + y 2 + y 3 ) / 3 ; float avg x 2 = ( x 1 + x 4 + x 3 ) / 3 ; float avg y 2 = ( y 1 + y 4 + y 3 ) / 3 ; centroid . x = avg x 1 - ( avg x 1 - avg x 2 ) / 2 ; centroid . y = avg y 1 - ( avg y 1 - avg y 2 ) / 2 ; return centroid ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { float avg x 1 = ( x 1 + x 2 + x 3 ) / 3 ; float avg y 1 = ( y 1 + y 2 + y 3 ) / 3 ; float avg x 2 = ( x 1 + x 4 + x 3 ) / 3 ; float avg y 2 = ( y 1 + y 4 + y 3 ) / 3 ; centroid . x = avg x 1 - ( avg x 1 - avg x 2 ) / 2 ; centroid . y = avg y 1 - ( avg y 1 - avg y 2 ) / 2 ; return centroid ; } <SENTENCE_END/>

centroid

<SENTENCE_START> { float avg x 1 = ( x 1 + x 2 + x 3 ) / 3 ; float avg y 1 = ( y 1 + y 2 + y 3 ) / 3 ; float avg x 2 = ( x 1 + x 4 + x 3 ) / 3 ; float avg y 2 = ( y 1 + y 4 + y 3 ) / 3 ; centroid . x = avg x 1 - ( avg x 1 - avg x 2 ) / 2 ; centroid . y = avg y 1 - ( avg y 1 - avg y 2 ) / 2 ; return centroid ; } <SENTENCE_END/>

(Copy Probability: 5.7%)

<SENTENCE_START> { float avg x 1 = ( x 1 + x 2 + x 3 ) / 3 ; float avg y 1 = ( y 1 + y 2 + y 3 ) / 3 ; float avg x 2 = ( x 1 + x 4 + x 3 ) / 3 ; float avg y 2 = ( y 1 + y 4 + y 3 ) / 3 ; centroid . x = avg x 1 - ( avg x 1 - avg x 2 ) / 2 ; centroid . y = avg y 1 - ( avg y 1 - avg y 2 ) / 2 ; return centroid ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float avg x 1 = ( x 1 + x 2 + x 3 ) / 3 ; float avg y 1 = ( y 1 + y 2 + y 3 ) / 3 ; float avg x 2 = ( x 1 + x 4 + x 3 ) / 3 ; float avg y 2 = ( y 1 + y 4 + y 3 ) / 3 ; centroid . x = avg x 1 - ( avg x 1 - avg x 2 ) / 2 ; centroid . y = avg y 1 - ( avg y 1 - avg y 2 ) / 2 ; return centroid ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { float avg x 1 = ( x 1 + x 2 + x 3 ) / 3 ; float avg y 1 = ( y 1 + y 2 + y 3 ) / 3 ; float avg x 2 = ( x 1 + x 4 + x 3 ) / 3 ; float avg y 2 = ( y 1 + y 4 + y 3 ) / 3 ; centroid . x = avg x 1 - ( avg x 1 - avg x 2 ) / 2 ; centroid . y = avg y 1 - ( avg y 1 - avg y 2 ) / 2 ; return centroid ; } <SENTENCE_END/>


Original Name polygon,centroid

polygon

<SENTENCE_START> { if ( count < 6 ) throw new illegal argument exception ( "A polygon must have 3 or more coordinate pairs." ) ; float x = 0 , y = 0 ; float signed area = 0 ; int i = offset ; for ( int n = offset + count - 2 ; i < n ; i += 2 ) { float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ i + 2 ] ; float y 1 = polygon [ i + 3 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; } float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ offset ] ; float y 1 = polygon [ offset + 1 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; if ( signed area == 0 ) { centroid . x = 0 ; centroid . y = 0 ; } else { signed area *= 0.5f ; centroid . x = x / ( 6 * signed area ) ; centroid . y = y / ( 6 * signed area ) ; } return centroid ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( count < 6 ) throw new illegal argument exception ( "A polygon must have 3 or more coordinate pairs." ) ; float x = 0 , y = 0 ; float signed area = 0 ; int i = offset ; for ( int n = offset + count - 2 ; i < n ; i += 2 ) { float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ i + 2 ] ; float y 1 = polygon [ i + 3 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; } float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ offset ] ; float y 1 = polygon [ offset + 1 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; if ( signed area == 0 ) { centroid . x = 0 ; centroid . y = 0 ; } else { signed area *= 0.5f ; centroid . x = x / ( 6 * signed area ) ; centroid . y = y / ( 6 * signed area ) ; } return centroid ; } <SENTENCE_END/>

centroid

<SENTENCE_START> { if ( count < 6 ) throw new illegal argument exception ( "A polygon must have 3 or more coordinate pairs." ) ; float x = 0 , y = 0 ; float signed area = 0 ; int i = offset ; for ( int n = offset + count - 2 ; i < n ; i += 2 ) { float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ i + 2 ] ; float y 1 = polygon [ i + 3 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; } float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ offset ] ; float y 1 = polygon [ offset + 1 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; if ( signed area == 0 ) { centroid . x = 0 ; centroid . y = 0 ; } else { signed area *= 0.5f ; centroid . x = x / ( 6 * signed area ) ; centroid . y = y / ( 6 * signed area ) ; } return centroid ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { if ( count < 6 ) throw new illegal argument exception ( "A polygon must have 3 or more coordinate pairs." ) ; float x = 0 , y = 0 ; float signed area = 0 ; int i = offset ; for ( int n = offset + count - 2 ; i < n ; i += 2 ) { float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ i + 2 ] ; float y 1 = polygon [ i + 3 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; } float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ offset ] ; float y 1 = polygon [ offset + 1 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; if ( signed area == 0 ) { centroid . x = 0 ; centroid . y = 0 ; } else { signed area *= 0.5f ; centroid . x = x / ( 6 * signed area ) ; centroid . y = y / ( 6 * signed area ) ; } return centroid ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( count < 6 ) throw new illegal argument exception ( "A polygon must have 3 or more coordinate pairs." ) ; float x = 0 , y = 0 ; float signed area = 0 ; int i = offset ; for ( int n = offset + count - 2 ; i < n ; i += 2 ) { float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ i + 2 ] ; float y 1 = polygon [ i + 3 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; } float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ offset ] ; float y 1 = polygon [ offset + 1 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; if ( signed area == 0 ) { centroid . x = 0 ; centroid . y = 0 ; } else { signed area *= 0.5f ; centroid . x = x / ( 6 * signed area ) ; centroid . y = y / ( 6 * signed area ) ; } return centroid ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( count < 6 ) throw new illegal argument exception ( "A polygon must have 3 or more coordinate pairs." ) ; float x = 0 , y = 0 ; float signed area = 0 ; int i = offset ; for ( int n = offset + count - 2 ; i < n ; i += 2 ) { float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ i + 2 ] ; float y 1 = polygon [ i + 3 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; } float x 0 = polygon [ i ] ; float y 0 = polygon [ i + 1 ] ; float x 1 = polygon [ offset ] ; float y 1 = polygon [ offset + 1 ] ; float a = x 0 * y 1 - x 1 * y 0 ; signed area += a ; x += ( x 0 + x 1 ) * a ; y += ( y 0 + y 1 ) * a ; if ( signed area == 0 ) { centroid . x = 0 ; centroid . y = 0 ; } else { signed area *= 0.5f ; centroid . x = x / ( 6 * signed area ) ; centroid . y = y / ( 6 * signed area ) ; } return centroid ; } <SENTENCE_END/>


Original Name polygon,area

polygon

<SENTENCE_START> { float area = 0 ; for ( int i = offset , n = offset + count ; i < n ; i += 2 ) { int x 1 = i ; int y 1 = i + 1 ; int x 2 = ( i + 2 ) % n ; if ( x 2 < offset ) x 2 += offset ; int y 2 = ( i + 3 ) % n ; if ( y 2 < offset ) y 2 += offset ; area += polygon [ x 1 ] * polygon [ y 2 ] ; area -= polygon [ x 2 ] * polygon [ y 1 ] ; } area *= 0.5f ; return area ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { float area = 0 ; for ( int i = offset , n = offset + count ; i < n ; i += 2 ) { int x 1 = i ; int y 1 = i + 1 ; int x 2 = ( i + 2 ) % n ; if ( x 2 < offset ) x 2 += offset ; int y 2 = ( i + 3 ) % n ; if ( y 2 < offset ) y 2 += offset ; area += polygon [ x 1 ] * polygon [ y 2 ] ; area -= polygon [ x 2 ] * polygon [ y 1 ] ; } area *= 0.5f ; return area ; } <SENTENCE_END/>

area

<SENTENCE_START> { float area = 0 ; for ( int i = offset , n = offset + count ; i < n ; i += 2 ) { int x 1 = i ; int y 1 = i + 1 ; int x 2 = ( i + 2 ) % n ; if ( x 2 < offset ) x 2 += offset ; int y 2 = ( i + 3 ) % n ; if ( y 2 < offset ) y 2 += offset ; area += polygon [ x 1 ] * polygon [ y 2 ] ; area -= polygon [ x 2 ] * polygon [ y 1 ] ; } area *= 0.5f ; return area ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { float area = 0 ; for ( int i = offset , n = offset + count ; i < n ; i += 2 ) { int x 1 = i ; int y 1 = i + 1 ; int x 2 = ( i + 2 ) % n ; if ( x 2 < offset ) x 2 += offset ; int y 2 = ( i + 3 ) % n ; if ( y 2 < offset ) y 2 += offset ; area += polygon [ x 1 ] * polygon [ y 2 ] ; area -= polygon [ x 2 ] * polygon [ y 1 ] ; } area *= 0.5f ; return area ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float area = 0 ; for ( int i = offset , n = offset + count ; i < n ; i += 2 ) { int x 1 = i ; int y 1 = i + 1 ; int x 2 = ( i + 2 ) % n ; if ( x 2 < offset ) x 2 += offset ; int y 2 = ( i + 3 ) % n ; if ( y 2 < offset ) y 2 += offset ; area += polygon [ x 1 ] * polygon [ y 2 ] ; area -= polygon [ x 2 ] * polygon [ y 1 ] ; } area *= 0.5f ; return area ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { float area = 0 ; for ( int i = offset , n = offset + count ; i < n ; i += 2 ) { int x 1 = i ; int y 1 = i + 1 ; int x 2 = ( i + 2 ) % n ; if ( x 2 < offset ) x 2 += offset ; int y 2 = ( i + 3 ) % n ; if ( y 2 < offset ) y 2 += offset ; area += polygon [ x 1 ] * polygon [ y 2 ] ; area -= polygon [ x 2 ] * polygon [ y 1 ] ; } area *= 0.5f ; return area ; } <SENTENCE_END/>


Original Name ensure,ccw

ensure

<SENTENCE_START> { if ( ! are vertices clockwise ( polygon , 0 , polygon . length ) ) return ; int last x = polygon . length - 2 ; for ( int i = 0 , n = polygon . length / 2 ; i < n ; i += 2 ) { int other = last x - i ; float x = polygon [ i ] ; float y = polygon [ i + 1 ] ; polygon [ i ] = polygon [ other ] ; polygon [ i + 1 ] = polygon [ other + 1 ] ; polygon [ other ] = x ; polygon [ other + 1 ] = y ; } } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( ! are vertices clockwise ( polygon , 0 , polygon . length ) ) return ; int last x = polygon . length - 2 ; for ( int i = 0 , n = polygon . length / 2 ; i < n ; i += 2 ) { int other = last x - i ; float x = polygon [ i ] ; float y = polygon [ i + 1 ] ; polygon [ i ] = polygon [ other ] ; polygon [ i + 1 ] = polygon [ other + 1 ] ; polygon [ other ] = x ; polygon [ other + 1 ] = y ; } } <SENTENCE_END/>

ccw

<SENTENCE_START> { if ( ! are vertices clockwise ( polygon , 0 , polygon . length ) ) return ; int last x = polygon . length - 2 ; for ( int i = 0 , n = polygon . length / 2 ; i < n ; i += 2 ) { int other = last x - i ; float x = polygon [ i ] ; float y = polygon [ i + 1 ] ; polygon [ i ] = polygon [ other ] ; polygon [ i + 1 ] = polygon [ other + 1 ] ; polygon [ other ] = x ; polygon [ other + 1 ] = y ; } } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { if ( ! are vertices clockwise ( polygon , 0 , polygon . length ) ) return ; int last x = polygon . length - 2 ; for ( int i = 0 , n = polygon . length / 2 ; i < n ; i += 2 ) { int other = last x - i ; float x = polygon [ i ] ; float y = polygon [ i + 1 ] ; polygon [ i ] = polygon [ other ] ; polygon [ i + 1 ] = polygon [ other + 1 ] ; polygon [ other ] = x ; polygon [ other + 1 ] = y ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! are vertices clockwise ( polygon , 0 , polygon . length ) ) return ; int last x = polygon . length - 2 ; for ( int i = 0 , n = polygon . length / 2 ; i < n ; i += 2 ) { int other = last x - i ; float x = polygon [ i ] ; float y = polygon [ i + 1 ] ; polygon [ i ] = polygon [ other ] ; polygon [ i + 1 ] = polygon [ other + 1 ] ; polygon [ other ] = x ; polygon [ other + 1 ] = y ; } } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { if ( ! are vertices clockwise ( polygon , 0 , polygon . length ) ) return ; int last x = polygon . length - 2 ; for ( int i = 0 , n = polygon . length / 2 ; i < n ; i += 2 ) { int other = last x - i ; float x = polygon [ i ] ; float y = polygon [ i + 1 ] ; polygon [ i ] = polygon [ other ] ; polygon [ i + 1 ] = polygon [ other + 1 ] ; polygon [ other ] = x ; polygon [ other + 1 ] = y ; } } <SENTENCE_END/>


Original Name are,vertices,clockwise

are

<SENTENCE_START> { if ( count <= 2 ) return false ; float area = 0 , p 1 x , p 1 y , p 2 x , p 2 y ; for ( int i = offset , n = offset + count - 3 ; i < n ; i += 2 ) { p 1 x = polygon [ i ] ; p 1 y = polygon [ i + 1 ] ; p 2 x = polygon [ i + 2 ] ; p 2 y = polygon [ i + 3 ] ; area += p 1 x * p 2 y - p 2 x * p 1 y ; } p 1 x = polygon [ count - 2 ] ; p 1 y = polygon [ count - 1 ] ; p 2 x = polygon [ 0 ] ; p 2 y = polygon [ 1 ] ; return area + p 1 x * p 2 y - p 2 x * p 1 y < 0 ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( count <= 2 ) return false ; float area = 0 , p 1 x , p 1 y , p 2 x , p 2 y ; for ( int i = offset , n = offset + count - 3 ; i < n ; i += 2 ) { p 1 x = polygon [ i ] ; p 1 y = polygon [ i + 1 ] ; p 2 x = polygon [ i + 2 ] ; p 2 y = polygon [ i + 3 ] ; area += p 1 x * p 2 y - p 2 x * p 1 y ; } p 1 x = polygon [ count - 2 ] ; p 1 y = polygon [ count - 1 ] ; p 2 x = polygon [ 0 ] ; p 2 y = polygon [ 1 ] ; return area + p 1 x * p 2 y - p 2 x * p 1 y < 0 ; } <SENTENCE_END/>

vertices

<SENTENCE_START> { if ( count <= 2 ) return false ; float area = 0 , p 1 x , p 1 y , p 2 x , p 2 y ; for ( int i = offset , n = offset + count - 3 ; i < n ; i += 2 ) { p 1 x = polygon [ i ] ; p 1 y = polygon [ i + 1 ] ; p 2 x = polygon [ i + 2 ] ; p 2 y = polygon [ i + 3 ] ; area += p 1 x * p 2 y - p 2 x * p 1 y ; } p 1 x = polygon [ count - 2 ] ; p 1 y = polygon [ count - 1 ] ; p 2 x = polygon [ 0 ] ; p 2 y = polygon [ 1 ] ; return area + p 1 x * p 2 y - p 2 x * p 1 y < 0 ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { if ( count <= 2 ) return false ; float area = 0 , p 1 x , p 1 y , p 2 x , p 2 y ; for ( int i = offset , n = offset + count - 3 ; i < n ; i += 2 ) { p 1 x = polygon [ i ] ; p 1 y = polygon [ i + 1 ] ; p 2 x = polygon [ i + 2 ] ; p 2 y = polygon [ i + 3 ] ; area += p 1 x * p 2 y - p 2 x * p 1 y ; } p 1 x = polygon [ count - 2 ] ; p 1 y = polygon [ count - 1 ] ; p 2 x = polygon [ 0 ] ; p 2 y = polygon [ 1 ] ; return area + p 1 x * p 2 y - p 2 x * p 1 y < 0 ; } <SENTENCE_END/>

clockwise

<SENTENCE_START> { if ( count <= 2 ) return false ; float area = 0 , p 1 x , p 1 y , p 2 x , p 2 y ; for ( int i = offset , n = offset + count - 3 ; i < n ; i += 2 ) { p 1 x = polygon [ i ] ; p 1 y = polygon [ i + 1 ] ; p 2 x = polygon [ i + 2 ] ; p 2 y = polygon [ i + 3 ] ; area += p 1 x * p 2 y - p 2 x * p 1 y ; } p 1 x = polygon [ count - 2 ] ; p 1 y = polygon [ count - 1 ] ; p 2 x = polygon [ 0 ] ; p 2 y = polygon [ 1 ] ; return area + p 1 x * p 2 y - p 2 x * p 1 y < 0 ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { if ( count <= 2 ) return false ; float area = 0 , p 1 x , p 1 y , p 2 x , p 2 y ; for ( int i = offset , n = offset + count - 3 ; i < n ; i += 2 ) { p 1 x = polygon [ i ] ; p 1 y = polygon [ i + 1 ] ; p 2 x = polygon [ i + 2 ] ; p 2 y = polygon [ i + 3 ] ; area += p 1 x * p 2 y - p 2 x * p 1 y ; } p 1 x = polygon [ count - 2 ] ; p 1 y = polygon [ count - 1 ] ; p 2 x = polygon [ 0 ] ; p 2 y = polygon [ 1 ] ; return area + p 1 x * p 2 y - p 2 x * p 1 y < 0 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( count <= 2 ) return false ; float area = 0 , p 1 x , p 1 y , p 2 x , p 2 y ; for ( int i = offset , n = offset + count - 3 ; i < n ; i += 2 ) { p 1 x = polygon [ i ] ; p 1 y = polygon [ i + 1 ] ; p 2 x = polygon [ i + 2 ] ; p 2 y = polygon [ i + 3 ] ; area += p 1 x * p 2 y - p 2 x * p 1 y ; } p 1 x = polygon [ count - 2 ] ; p 1 y = polygon [ count - 1 ] ; p 2 x = polygon [ 0 ] ; p 2 y = polygon [ 1 ] ; return area + p 1 x * p 2 y - p 2 x * p 1 y < 0 ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( count <= 2 ) return false ; float area = 0 , p 1 x , p 1 y , p 2 x , p 2 y ; for ( int i = offset , n = offset + count - 3 ; i < n ; i += 2 ) { p 1 x = polygon [ i ] ; p 1 y = polygon [ i + 1 ] ; p 2 x = polygon [ i + 2 ] ; p 2 y = polygon [ i + 3 ] ; area += p 1 x * p 2 y - p 2 x * p 1 y ; } p 1 x = polygon [ count - 2 ] ; p 1 y = polygon [ count - 1 ] ; p 2 x = polygon [ 0 ] ; p 2 y = polygon [ 1 ] ; return area + p 1 x * p 2 y - p 2 x * p 1 y < 0 ; } <SENTENCE_END/>


Original Name process

process

<SENTENCE_START> { header file processor processor = new header file processor ( ) ; processor . %SELF% ( new file ( directory ) , new file ( directory ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { header file processor processor = new header file processor ( ) ; processor . %SELF% ( new file ( directory ) , new file ( directory ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { header file processor processor = new header file processor ( ) ; processor . %SELF% ( new file ( directory ) , new file ( directory ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { header file processor processor = new header file processor ( ) ; processor . %SELF% ( new file ( directory ) , new file ( directory ) ) ; } <SENTENCE_END/>


Original Name main

main

<SENTENCE_START> { if ( args . length != 1 ) { header fixer . process ( "../../gdx/" ) ; header fixer . process ( "../../backends/" ) ; header fixer . process ( "../../tests/" ) ; header fixer . process ( "../../extensions/" ) ; } else { header fixer . process ( args [ 0 ] ) ; } system . out . println ( "Changed " + files changed + " / " + files scanned + " files." ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { if ( args . length != 1 ) { header fixer . process ( "../../gdx/" ) ; header fixer . process ( "../../backends/" ) ; header fixer . process ( "../../tests/" ) ; header fixer . process ( "../../extensions/" ) ; } else { header fixer . process ( args [ 0 ] ) ; } system . out . println ( "Changed " + files changed + " / " + files scanned + " files." ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( args . length != 1 ) { header fixer . process ( "../../gdx/" ) ; header fixer . process ( "../../backends/" ) ; header fixer . process ( "../../tests/" ) ; header fixer . process ( "../../extensions/" ) ; } else { header fixer . process ( args [ 0 ] ) ; } system . out . println ( "Changed " + files changed + " / " + files scanned + " files." ) ; } <SENTENCE_END/>

(Copy Probability: 7.2%)

<SENTENCE_START> { if ( args . length != 1 ) { header fixer . process ( "../../gdx/" ) ; header fixer . process ( "../../backends/" ) ; header fixer . process ( "../../tests/" ) ; header fixer . process ( "../../extensions/" ) ; } else { header fixer . process ( args [ 0 ] ) ; } system . out . println ( "Changed " + files changed + " / " + files scanned + " files." ) ; } <SENTENCE_END/>


Original Name get,dependencies

get

<SENTENCE_START> { return sub dependency map . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return sub dependency map . get ( type ) ; } <SENTENCE_END/>

dependencies

<SENTENCE_START> { return sub dependency map . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { return sub dependency map . get ( type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return sub dependency map . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { return sub dependency map . get ( type ) ; } <SENTENCE_END/>


Original Name get,incompatibilities

get

<SENTENCE_START> { list < string > incompat = new array list < string > ( ) ; string [ ] sub array = sub dependency map . get ( type ) ; if ( sub array == null ) { incompat . add ( "Dependency " + name + " is not compatible with sub module " + type . get name ( ) . to upper case ( ) ) ; } return incompat ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { list < string > incompat = new array list < string > ( ) ; string [ ] sub array = sub dependency map . get ( type ) ; if ( sub array == null ) { incompat . add ( "Dependency " + name + " is not compatible with sub module " + type . get name ( ) . to upper case ( ) ) ; } return incompat ; } <SENTENCE_END/>

incompatibilities

<SENTENCE_START> { list < string > incompat = new array list < string > ( ) ; string [ ] sub array = sub dependency map . get ( type ) ; if ( sub array == null ) { incompat . add ( "Dependency " + name + " is not compatible with sub module " + type . get name ( ) . to upper case ( ) ) ; } return incompat ; } <SENTENCE_END/>

(Copy Probability: 18.5%)

<SENTENCE_START> { list < string > incompat = new array list < string > ( ) ; string [ ] sub array = sub dependency map . get ( type ) ; if ( sub array == null ) { incompat . add ( "Dependency " + name + " is not compatible with sub module " + type . get name ( ) . to upper case ( ) ) ; } return incompat ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { list < string > incompat = new array list < string > ( ) ; string [ ] sub array = sub dependency map . get ( type ) ; if ( sub array == null ) { incompat . add ( "Dependency " + name + " is not compatible with sub module " + type . get name ( ) . to upper case ( ) ) ; } return incompat ; } <SENTENCE_END/>

(Copy Probability: 13.6%)

<SENTENCE_START> { list < string > incompat = new array list < string > ( ) ; string [ ] sub array = sub dependency map . get ( type ) ; if ( sub array == null ) { incompat . add ( "Dependency " + name + " is not compatible with sub module " + type . get name ( ) . to upper case ( ) ) ; } return incompat ; } <SENTENCE_END/>


Original Name get,gwt,inherits

get

<SENTENCE_START> { return gwt inherits ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return gwt inherits ; } <SENTENCE_END/>

gwt

<SENTENCE_START> { return gwt inherits ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return gwt inherits ; } <SENTENCE_END/>

inherits

<SENTENCE_START> { return gwt inherits ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { return gwt inherits ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return gwt inherits ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return gwt inherits ; } <SENTENCE_END/>


Original Name get,name

get

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

(Copy Probability: 0.3%)

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

name

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

(Copy Probability: 69.5%)

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

%END%

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

(Copy Probability: 0.7%)

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


Original Name do,sort

do

<SENTENCE_START> { stack size = 0 ; range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } this . a = a ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } push run ( lo , run len ) ; merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; merge force collapse ( ) ; if ( debug ) assert stack size == 1 ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { stack size = 0 ; range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } this . a = a ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } push run ( lo , run len ) ; merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; merge force collapse ( ) ; if ( debug ) assert stack size == 1 ; } <SENTENCE_END/>

sort

<SENTENCE_START> { stack size = 0 ; range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } this . a = a ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } push run ( lo , run len ) ; merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; merge force collapse ( ) ; if ( debug ) assert stack size == 1 ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { stack size = 0 ; range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } this . a = a ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } push run ( lo , run len ) ; merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; merge force collapse ( ) ; if ( debug ) assert stack size == 1 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { stack size = 0 ; range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } this . a = a ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } push run ( lo , run len ) ; merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; merge force collapse ( ) ; if ( debug ) assert stack size == 1 ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { stack size = 0 ; range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } this . a = a ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } push run ( lo , run len ) ; merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; merge force collapse ( ) ; if ( debug ) assert stack size == 1 ; } <SENTENCE_END/>


Original Name sort

sort

<SENTENCE_START> { %SELF% ( a , 0 , a . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { %SELF% ( a , 0 , a . length ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( a , 0 , a . length ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { %SELF% ( a , 0 , a . length ) ; } <SENTENCE_END/>


Original Name sort

sort

<SENTENCE_START> { range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } comparable tim sort ts = new comparable tim sort ( a ) ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } ts . push run ( lo , run len ) ; ts . merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; ts . merge force collapse ( ) ; if ( debug ) assert ts . stack size == 1 ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } comparable tim sort ts = new comparable tim sort ( a ) ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } ts . push run ( lo , run len ) ; ts . merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; ts . merge force collapse ( ) ; if ( debug ) assert ts . stack size == 1 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } comparable tim sort ts = new comparable tim sort ( a ) ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } ts . push run ( lo , run len ) ; ts . merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; ts . merge force collapse ( ) ; if ( debug ) assert ts . stack size == 1 ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { range check ( a . length , lo , hi ) ; int n remaining = hi - lo ; if ( n remaining < 2 ) return ; if ( n remaining < min merge ) { int init run len = count run and make ascending ( a , lo , hi ) ; binary sort ( a , lo , hi , lo + init run len ) ; return ; } comparable tim sort ts = new comparable tim sort ( a ) ; int min run = min run length ( n remaining ) ; do { int run len = count run and make ascending ( a , lo , hi ) ; if ( run len < min run ) { int force = n remaining <= min run ? n remaining : min run ; binary sort ( a , lo , lo + force , lo + run len ) ; run len = force ; } ts . push run ( lo , run len ) ; ts . merge collapse ( ) ; lo += run len ; n remaining -= run len ; } while ( n remaining != 0 ) ; if ( debug ) assert lo == hi ; ts . merge force collapse ( ) ; if ( debug ) assert ts . stack size == 1 ; } <SENTENCE_END/>


Original Name binary,sort

binary

<SENTENCE_START> { if ( debug ) assert lo <= start && start <= hi ; if ( start == lo ) start ++ ; for ( ; start < hi ; start ++ ) { @ suppress warnings ( "unchecked" ) comparable < object > pivot = ( comparable ) a [ start ] ; int left = lo ; int right = start ; if ( debug ) assert left <= right ; while ( left < right ) { int mid = ( left + right ) >>> 1 ; if ( pivot . compare to ( a [ mid ] ) < 0 ) right = mid ; else left = mid + 1 ; } if ( debug ) assert left == right ; int n = start - left ; switch ( n ) { case 2 : a [ left + 2 ] = a [ left + 1 ] ; case 1 : a [ left + 1 ] = a [ left ] ; break ; default : system . arraycopy ( a , left , a , left + 1 , n ) ; } a [ left ] = pivot ; } } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { if ( debug ) assert lo <= start && start <= hi ; if ( start == lo ) start ++ ; for ( ; start < hi ; start ++ ) { @ suppress warnings ( "unchecked" ) comparable < object > pivot = ( comparable ) a [ start ] ; int left = lo ; int right = start ; if ( debug ) assert left <= right ; while ( left < right ) { int mid = ( left + right ) >>> 1 ; if ( pivot . compare to ( a [ mid ] ) < 0 ) right = mid ; else left = mid + 1 ; } if ( debug ) assert left == right ; int n = start - left ; switch ( n ) { case 2 : a [ left + 2 ] = a [ left + 1 ] ; case 1 : a [ left + 1 ] = a [ left ] ; break ; default : system . arraycopy ( a , left , a , left + 1 , n ) ; } a [ left ] = pivot ; } } <SENTENCE_END/>

sort

<SENTENCE_START> { if ( debug ) assert lo <= start && start <= hi ; if ( start == lo ) start ++ ; for ( ; start < hi ; start ++ ) { @ suppress warnings ( "unchecked" ) comparable < object > pivot = ( comparable ) a [ start ] ; int left = lo ; int right = start ; if ( debug ) assert left <= right ; while ( left < right ) { int mid = ( left + right ) >>> 1 ; if ( pivot . compare to ( a [ mid ] ) < 0 ) right = mid ; else left = mid + 1 ; } if ( debug ) assert left == right ; int n = start - left ; switch ( n ) { case 2 : a [ left + 2 ] = a [ left + 1 ] ; case 1 : a [ left + 1 ] = a [ left ] ; break ; default : system . arraycopy ( a , left , a , left + 1 , n ) ; } a [ left ] = pivot ; } } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { if ( debug ) assert lo <= start && start <= hi ; if ( start == lo ) start ++ ; for ( ; start < hi ; start ++ ) { @ suppress warnings ( "unchecked" ) comparable < object > pivot = ( comparable ) a [ start ] ; int left = lo ; int right = start ; if ( debug ) assert left <= right ; while ( left < right ) { int mid = ( left + right ) >>> 1 ; if ( pivot . compare to ( a [ mid ] ) < 0 ) right = mid ; else left = mid + 1 ; } if ( debug ) assert left == right ; int n = start - left ; switch ( n ) { case 2 : a [ left + 2 ] = a [ left + 1 ] ; case 1 : a [ left + 1 ] = a [ left ] ; break ; default : system . arraycopy ( a , left , a , left + 1 , n ) ; } a [ left ] = pivot ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( debug ) assert lo <= start && start <= hi ; if ( start == lo ) start ++ ; for ( ; start < hi ; start ++ ) { @ suppress warnings ( "unchecked" ) comparable < object > pivot = ( comparable ) a [ start ] ; int left = lo ; int right = start ; if ( debug ) assert left <= right ; while ( left < right ) { int mid = ( left + right ) >>> 1 ; if ( pivot . compare to ( a [ mid ] ) < 0 ) right = mid ; else left = mid + 1 ; } if ( debug ) assert left == right ; int n = start - left ; switch ( n ) { case 2 : a [ left + 2 ] = a [ left + 1 ] ; case 1 : a [ left + 1 ] = a [ left ] ; break ; default : system . arraycopy ( a , left , a , left + 1 , n ) ; } a [ left ] = pivot ; } } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { if ( debug ) assert lo <= start && start <= hi ; if ( start == lo ) start ++ ; for ( ; start < hi ; start ++ ) { @ suppress warnings ( "unchecked" ) comparable < object > pivot = ( comparable ) a [ start ] ; int left = lo ; int right = start ; if ( debug ) assert left <= right ; while ( left < right ) { int mid = ( left + right ) >>> 1 ; if ( pivot . compare to ( a [ mid ] ) < 0 ) right = mid ; else left = mid + 1 ; } if ( debug ) assert left == right ; int n = start - left ; switch ( n ) { case 2 : a [ left + 2 ] = a [ left + 1 ] ; case 1 : a [ left + 1 ] = a [ left ] ; break ; default : system . arraycopy ( a , left , a , left + 1 , n ) ; } a [ left ] = pivot ; } } <SENTENCE_END/>


Original Name count,run,and,make,ascending

count

<SENTENCE_START> { if ( debug ) assert lo < hi ; int run hi = lo + 1 ; if ( run hi == hi ) return 1 ; if ( ( ( comparable ) a