Copy+Attentional Convolutional


Original Name load,model,data

load

<SENTENCE_START> { if ( log warning ) gdx . app . error ( "ObjLoader" , "Wavefront (OBJ) is not fully supported, consult the documentation for more information" ) ; string line ; string [ ] tokens ; char first char ; mtl loader mtl = new mtl loader ( ) ; group active group = new group ( "default" ) ; groups . add ( active group ) ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; int id = 0 ; try { while ( ( line = reader . read line ( ) ) != null ) { tokens = line . split ( "|s+" ) ; if ( tokens . length < 1 ) break ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( ( first char = tokens [ 0 ] . to lower case ( ) . char at ( 0 ) ) == '#' ) { continue ; } else if ( first char == 'v' ) { if ( tokens [ 0 ] . length ( ) == 1 ) { verts . add ( float . parse float ( tokens [ 1 ] ) ) ; verts . add ( float . parse float ( tokens [ 2 ] ) ) ; verts . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 'n' ) { norms . add ( float . parse float ( tokens [ 1 ] ) ) ; norms . add ( float . parse float ( tokens [ 2 ] ) ) ; norms . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 't' ) { uvs . add ( float . parse float ( tokens [ 1 ] ) ) ; uvs . add ( ( flip v ? 1 - float . parse float ( tokens [ 2 ] ) : float . parse float ( tokens [ 2 ] ) ) ) ; } } else if ( first char == 'f' ) { string [ ] parts ; array < integer > faces = active group . faces ; for ( int i = 1 ; i < tokens . length - 2 ; i -- ) { parts = tokens [ 1 ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) { if ( i == 1 ) active group . has norms = true ; faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; } if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) { if ( i == 1 ) active group . has u vs = true ; faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; } parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; active group . num faces ++ ; } } else if ( first char == 'o' || first char == 'g' ) { if ( tokens . length > 1 ) active group = set active group ( tokens [ 1 ] ) ; else active group = set active group ( "default" ) ; } else if ( tokens [ 0 ] . equals ( "mtllib" ) ) { mtl . load ( file . parent ( ) . child ( tokens [ 1 ] ) ) ; } else if ( tokens [ 0 ] . equals ( "usemtl" ) ) { if ( tokens . length == 1 ) active group . material name = "default" ; else active group . material name = tokens [ 1 ] . replace ( '.' , '_' ) ; } } reader . close ( ) ; } catch ( io exception e ) { return null ; } for ( int i = 0 ; i < groups . size ; i ++ ) { if ( groups . get ( i ) . num faces < 1 ) { groups . remove index ( i ) ; i -- ; } } if ( groups . size < 1 ) return null ; final int num groups = groups . size ; final model data data = new model data ( ) ; for ( int g = 0 ; g < num groups ; g ++ ) { group group = groups . get ( g ) ; array < integer > faces = group . faces ; final int num elements = faces . size ; final int num faces = group . num faces ; final boolean has norms = group . has norms ; final boolean has u vs = group . has u vs ; final float [ ] final verts = new float [ ( num faces * 3 ) * ( 3 + ( has norms ? 3 : 0 ) + ( has u vs ? 2 : 0 ) ) ] ; for ( int i = 0 , vi = 0 ; i < num elements ; ) { int vert index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ) ; if ( has norms ) { int norm index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ) ; } if ( has u vs ) { int uv index = faces . get ( i ++ ) * 2 ; final verts [ vi ++ ] = uvs . get ( uv index ++ ) ; final verts [ vi ++ ] = uvs . get ( uv index ) ; } } final int num indices = num faces * 3 >= short . max value ? 0 : num faces * 3 ; final short [ ] final indices = new short [ num indices ] ; if ( num indices > 0 ) { for ( int i = 0 ; i < num indices ; i ++ ) { final indices [ i ] = ( short ) i ; } } array < vertex attribute > attributes = new array < vertex attribute > ( ) ; attributes . add ( new vertex attribute ( usage . position , 3 , shader program . position attribute ) ) ; if ( has norms ) attributes . add ( new vertex attribute ( usage . normal , 3 , shader program . normal attribute ) ) ; if ( has u vs ) attributes . add ( new vertex attribute ( usage . texture coordinates , 2 , shader program . texcoord attribute + "0" ) ) ; string string id = integer . to string ( ++ id ) ; string node id = "default" . equals ( group . name ) ? "node" + string id : group . name ; string mesh id = "default" . equals ( group . name ) ? "mesh" + string id : group . name ; string part id = "default" . equals ( group . name ) ? "part" + string id : group . name ; model node node = new model node ( ) ; node . id = node id ; node . mesh id = mesh id ; node . scale = new vector 3 ( 1 , 1 , 1 ) ; node . translation = new vector 3 ( ) ; node . rotation = new quaternion ( ) ; model node part pm = new model node part ( ) ; pm . mesh part id = part id ; pm . material id = group . material name ; node . parts = new model node part [ ] { pm } ; model mesh part part = new model mesh part ( ) ; part . id = part id ; part . indices = final indices ; part . primitive type = gl 20 . gl triangles ; model mesh mesh = new model mesh ( ) ; mesh . id = mesh id ; mesh . attributes = attributes . to array ( vertex attribute . class ) ; mesh . vertices = final verts ; mesh . parts = new model mesh part [ ] { part } ; data . nodes . add ( node ) ; data . meshes . add ( mesh ) ; model material mm = mtl . get material ( group . material name ) ; data . materials . add ( mm ) ; } if ( verts . size > 0 ) verts . clear ( ) ; if ( norms . size > 0 ) norms . clear ( ) ; if ( uvs . size > 0 ) uvs . clear ( ) ; if ( groups . size > 0 ) groups . clear ( ) ; return data ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { if ( log warning ) gdx . app . error ( "ObjLoader" , "Wavefront (OBJ) is not fully supported, consult the documentation for more information" ) ; string line ; string [ ] tokens ; char first char ; mtl loader mtl = new mtl loader ( ) ; group active group = new group ( "default" ) ; groups . add ( active group ) ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; int id = 0 ; try { while ( ( line = reader . read line ( ) ) != null ) { tokens = line . split ( "|s+" ) ; if ( tokens . length < 1 ) break ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( ( first char = tokens [ 0 ] . to lower case ( ) . char at ( 0 ) ) == '#' ) { continue ; } else if ( first char == 'v' ) { if ( tokens [ 0 ] . length ( ) == 1 ) { verts . add ( float . parse float ( tokens [ 1 ] ) ) ; verts . add ( float . parse float ( tokens [ 2 ] ) ) ; verts . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 'n' ) { norms . add ( float . parse float ( tokens [ 1 ] ) ) ; norms . add ( float . parse float ( tokens [ 2 ] ) ) ; norms . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 't' ) { uvs . add ( float . parse float ( tokens [ 1 ] ) ) ; uvs . add ( ( flip v ? 1 - float . parse float ( tokens [ 2 ] ) : float . parse float ( tokens [ 2 ] ) ) ) ; } } else if ( first char == 'f' ) { string [ ] parts ; array < integer > faces = active group . faces ; for ( int i = 1 ; i < tokens . length - 2 ; i -- ) { parts = tokens [ 1 ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) { if ( i == 1 ) active group . has norms = true ; faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; } if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) { if ( i == 1 ) active group . has u vs = true ; faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; } parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; active group . num faces ++ ; } } else if ( first char == 'o' || first char == 'g' ) { if ( tokens . length > 1 ) active group = set active group ( tokens [ 1 ] ) ; else active group = set active group ( "default" ) ; } else if ( tokens [ 0 ] . equals ( "mtllib" ) ) { mtl . load ( file . parent ( ) . child ( tokens [ 1 ] ) ) ; } else if ( tokens [ 0 ] . equals ( "usemtl" ) ) { if ( tokens . length == 1 ) active group . material name = "default" ; else active group . material name = tokens [ 1 ] . replace ( '.' , '_' ) ; } } reader . close ( ) ; } catch ( io exception e ) { return null ; } for ( int i = 0 ; i < groups . size ; i ++ ) { if ( groups . get ( i ) . num faces < 1 ) { groups . remove index ( i ) ; i -- ; } } if ( groups . size < 1 ) return null ; final int num groups = groups . size ; final model data data = new model data ( ) ; for ( int g = 0 ; g < num groups ; g ++ ) { group group = groups . get ( g ) ; array < integer > faces = group . faces ; final int num elements = faces . size ; final int num faces = group . num faces ; final boolean has norms = group . has norms ; final boolean has u vs = group . has u vs ; final float [ ] final verts = new float [ ( num faces * 3 ) * ( 3 + ( has norms ? 3 : 0 ) + ( has u vs ? 2 : 0 ) ) ] ; for ( int i = 0 , vi = 0 ; i < num elements ; ) { int vert index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ) ; if ( has norms ) { int norm index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ) ; } if ( has u vs ) { int uv index = faces . get ( i ++ ) * 2 ; final verts [ vi ++ ] = uvs . get ( uv index ++ ) ; final verts [ vi ++ ] = uvs . get ( uv index ) ; } } final int num indices = num faces * 3 >= short . max value ? 0 : num faces * 3 ; final short [ ] final indices = new short [ num indices ] ; if ( num indices > 0 ) { for ( int i = 0 ; i < num indices ; i ++ ) { final indices [ i ] = ( short ) i ; } } array < vertex attribute > attributes = new array < vertex attribute > ( ) ; attributes . add ( new vertex attribute ( usage . position , 3 , shader program . position attribute ) ) ; if ( has norms ) attributes . add ( new vertex attribute ( usage . normal , 3 , shader program . normal attribute ) ) ; if ( has u vs ) attributes . add ( new vertex attribute ( usage . texture coordinates , 2 , shader program . texcoord attribute + "0" ) ) ; string string id = integer . to string ( ++ id ) ; string node id = "default" . equals ( group . name ) ? "node" + string id : group . name ; string mesh id = "default" . equals ( group . name ) ? "mesh" + string id : group . name ; string part id = "default" . equals ( group . name ) ? "part" + string id : group . name ; model node node = new model node ( ) ; node . id = node id ; node . mesh id = mesh id ; node . scale = new vector 3 ( 1 , 1 , 1 ) ; node . translation = new vector 3 ( ) ; node . rotation = new quaternion ( ) ; model node part pm = new model node part ( ) ; pm . mesh part id = part id ; pm . material id = group . material name ; node . parts = new model node part [ ] { pm } ; model mesh part part = new model mesh part ( ) ; part . id = part id ; part . indices = final indices ; part . primitive type = gl 20 . gl triangles ; model mesh mesh = new model mesh ( ) ; mesh . id = mesh id ; mesh . attributes = attributes . to array ( vertex attribute . class ) ; mesh . vertices = final verts ; mesh . parts = new model mesh part [ ] { part } ; data . nodes . add ( node ) ; data . meshes . add ( mesh ) ; model material mm = mtl . get material ( group . material name ) ; data . materials . add ( mm ) ; } if ( verts . size > 0 ) verts . clear ( ) ; if ( norms . size > 0 ) norms . clear ( ) ; if ( uvs . size > 0 ) uvs . clear ( ) ; if ( groups . size > 0 ) groups . clear ( ) ; return data ; } <SENTENCE_END/>

model

<SENTENCE_START> { if ( log warning ) gdx . app . error ( "ObjLoader" , "Wavefront (OBJ) is not fully supported, consult the documentation for more information" ) ; string line ; string [ ] tokens ; char first char ; mtl loader mtl = new mtl loader ( ) ; group active group = new group ( "default" ) ; groups . add ( active group ) ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; int id = 0 ; try { while ( ( line = reader . read line ( ) ) != null ) { tokens = line . split ( "|s+" ) ; if ( tokens . length < 1 ) break ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( ( first char = tokens [ 0 ] . to lower case ( ) . char at ( 0 ) ) == '#' ) { continue ; } else if ( first char == 'v' ) { if ( tokens [ 0 ] . length ( ) == 1 ) { verts . add ( float . parse float ( tokens [ 1 ] ) ) ; verts . add ( float . parse float ( tokens [ 2 ] ) ) ; verts . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 'n' ) { norms . add ( float . parse float ( tokens [ 1 ] ) ) ; norms . add ( float . parse float ( tokens [ 2 ] ) ) ; norms . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 't' ) { uvs . add ( float . parse float ( tokens [ 1 ] ) ) ; uvs . add ( ( flip v ? 1 - float . parse float ( tokens [ 2 ] ) : float . parse float ( tokens [ 2 ] ) ) ) ; } } else if ( first char == 'f' ) { string [ ] parts ; array < integer > faces = active group . faces ; for ( int i = 1 ; i < tokens . length - 2 ; i -- ) { parts = tokens [ 1 ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) { if ( i == 1 ) active group . has norms = true ; faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; } if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) { if ( i == 1 ) active group . has u vs = true ; faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; } parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; active group . num faces ++ ; } } else if ( first char == 'o' || first char == 'g' ) { if ( tokens . length > 1 ) active group = set active group ( tokens [ 1 ] ) ; else active group = set active group ( "default" ) ; } else if ( tokens [ 0 ] . equals ( "mtllib" ) ) { mtl . load ( file . parent ( ) . child ( tokens [ 1 ] ) ) ; } else if ( tokens [ 0 ] . equals ( "usemtl" ) ) { if ( tokens . length == 1 ) active group . material name = "default" ; else active group . material name = tokens [ 1 ] . replace ( '.' , '_' ) ; } } reader . close ( ) ; } catch ( io exception e ) { return null ; } for ( int i = 0 ; i < groups . size ; i ++ ) { if ( groups . get ( i ) . num faces < 1 ) { groups . remove index ( i ) ; i -- ; } } if ( groups . size < 1 ) return null ; final int num groups = groups . size ; final model data data = new model data ( ) ; for ( int g = 0 ; g < num groups ; g ++ ) { group group = groups . get ( g ) ; array < integer > faces = group . faces ; final int num elements = faces . size ; final int num faces = group . num faces ; final boolean has norms = group . has norms ; final boolean has u vs = group . has u vs ; final float [ ] final verts = new float [ ( num faces * 3 ) * ( 3 + ( has norms ? 3 : 0 ) + ( has u vs ? 2 : 0 ) ) ] ; for ( int i = 0 , vi = 0 ; i < num elements ; ) { int vert index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ) ; if ( has norms ) { int norm index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ) ; } if ( has u vs ) { int uv index = faces . get ( i ++ ) * 2 ; final verts [ vi ++ ] = uvs . get ( uv index ++ ) ; final verts [ vi ++ ] = uvs . get ( uv index ) ; } } final int num indices = num faces * 3 >= short . max value ? 0 : num faces * 3 ; final short [ ] final indices = new short [ num indices ] ; if ( num indices > 0 ) { for ( int i = 0 ; i < num indices ; i ++ ) { final indices [ i ] = ( short ) i ; } } array < vertex attribute > attributes = new array < vertex attribute > ( ) ; attributes . add ( new vertex attribute ( usage . position , 3 , shader program . position attribute ) ) ; if ( has norms ) attributes . add ( new vertex attribute ( usage . normal , 3 , shader program . normal attribute ) ) ; if ( has u vs ) attributes . add ( new vertex attribute ( usage . texture coordinates , 2 , shader program . texcoord attribute + "0" ) ) ; string string id = integer . to string ( ++ id ) ; string node id = "default" . equals ( group . name ) ? "node" + string id : group . name ; string mesh id = "default" . equals ( group . name ) ? "mesh" + string id : group . name ; string part id = "default" . equals ( group . name ) ? "part" + string id : group . name ; model node node = new model node ( ) ; node . id = node id ; node . mesh id = mesh id ; node . scale = new vector 3 ( 1 , 1 , 1 ) ; node . translation = new vector 3 ( ) ; node . rotation = new quaternion ( ) ; model node part pm = new model node part ( ) ; pm . mesh part id = part id ; pm . material id = group . material name ; node . parts = new model node part [ ] { pm } ; model mesh part part = new model mesh part ( ) ; part . id = part id ; part . indices = final indices ; part . primitive type = gl 20 . gl triangles ; model mesh mesh = new model mesh ( ) ; mesh . id = mesh id ; mesh . attributes = attributes . to array ( vertex attribute . class ) ; mesh . vertices = final verts ; mesh . parts = new model mesh part [ ] { part } ; data . nodes . add ( node ) ; data . meshes . add ( mesh ) ; model material mm = mtl . get material ( group . material name ) ; data . materials . add ( mm ) ; } if ( verts . size > 0 ) verts . clear ( ) ; if ( norms . size > 0 ) norms . clear ( ) ; if ( uvs . size > 0 ) uvs . clear ( ) ; if ( groups . size > 0 ) groups . clear ( ) ; return data ; } <SENTENCE_END/>

(Copy Probability: 8.3%)

<SENTENCE_START> { if ( log warning ) gdx . app . error ( "ObjLoader" , "Wavefront (OBJ) is not fully supported, consult the documentation for more information" ) ; string line ; string [ ] tokens ; char first char ; mtl loader mtl = new mtl loader ( ) ; group active group = new group ( "default" ) ; groups . add ( active group ) ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; int id = 0 ; try { while ( ( line = reader . read line ( ) ) != null ) { tokens = line . split ( "|s+" ) ; if ( tokens . length < 1 ) break ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( ( first char = tokens [ 0 ] . to lower case ( ) . char at ( 0 ) ) == '#' ) { continue ; } else if ( first char == 'v' ) { if ( tokens [ 0 ] . length ( ) == 1 ) { verts . add ( float . parse float ( tokens [ 1 ] ) ) ; verts . add ( float . parse float ( tokens [ 2 ] ) ) ; verts . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 'n' ) { norms . add ( float . parse float ( tokens [ 1 ] ) ) ; norms . add ( float . parse float ( tokens [ 2 ] ) ) ; norms . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 't' ) { uvs . add ( float . parse float ( tokens [ 1 ] ) ) ; uvs . add ( ( flip v ? 1 - float . parse float ( tokens [ 2 ] ) : float . parse float ( tokens [ 2 ] ) ) ) ; } } else if ( first char == 'f' ) { string [ ] parts ; array < integer > faces = active group . faces ; for ( int i = 1 ; i < tokens . length - 2 ; i -- ) { parts = tokens [ 1 ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) { if ( i == 1 ) active group . has norms = true ; faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; } if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) { if ( i == 1 ) active group . has u vs = true ; faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; } parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; active group . num faces ++ ; } } else if ( first char == 'o' || first char == 'g' ) { if ( tokens . length > 1 ) active group = set active group ( tokens [ 1 ] ) ; else active group = set active group ( "default" ) ; } else if ( tokens [ 0 ] . equals ( "mtllib" ) ) { mtl . load ( file . parent ( ) . child ( tokens [ 1 ] ) ) ; } else if ( tokens [ 0 ] . equals ( "usemtl" ) ) { if ( tokens . length == 1 ) active group . material name = "default" ; else active group . material name = tokens [ 1 ] . replace ( '.' , '_' ) ; } } reader . close ( ) ; } catch ( io exception e ) { return null ; } for ( int i = 0 ; i < groups . size ; i ++ ) { if ( groups . get ( i ) . num faces < 1 ) { groups . remove index ( i ) ; i -- ; } } if ( groups . size < 1 ) return null ; final int num groups = groups . size ; final model data data = new model data ( ) ; for ( int g = 0 ; g < num groups ; g ++ ) { group group = groups . get ( g ) ; array < integer > faces = group . faces ; final int num elements = faces . size ; final int num faces = group . num faces ; final boolean has norms = group . has norms ; final boolean has u vs = group . has u vs ; final float [ ] final verts = new float [ ( num faces * 3 ) * ( 3 + ( has norms ? 3 : 0 ) + ( has u vs ? 2 : 0 ) ) ] ; for ( int i = 0 , vi = 0 ; i < num elements ; ) { int vert index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ) ; if ( has norms ) { int norm index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ) ; } if ( has u vs ) { int uv index = faces . get ( i ++ ) * 2 ; final verts [ vi ++ ] = uvs . get ( uv index ++ ) ; final verts [ vi ++ ] = uvs . get ( uv index ) ; } } final int num indices = num faces * 3 >= short . max value ? 0 : num faces * 3 ; final short [ ] final indices = new short [ num indices ] ; if ( num indices > 0 ) { for ( int i = 0 ; i < num indices ; i ++ ) { final indices [ i ] = ( short ) i ; } } array < vertex attribute > attributes = new array < vertex attribute > ( ) ; attributes . add ( new vertex attribute ( usage . position , 3 , shader program . position attribute ) ) ; if ( has norms ) attributes . add ( new vertex attribute ( usage . normal , 3 , shader program . normal attribute ) ) ; if ( has u vs ) attributes . add ( new vertex attribute ( usage . texture coordinates , 2 , shader program . texcoord attribute + "0" ) ) ; string string id = integer . to string ( ++ id ) ; string node id = "default" . equals ( group . name ) ? "node" + string id : group . name ; string mesh id = "default" . equals ( group . name ) ? "mesh" + string id : group . name ; string part id = "default" . equals ( group . name ) ? "part" + string id : group . name ; model node node = new model node ( ) ; node . id = node id ; node . mesh id = mesh id ; node . scale = new vector 3 ( 1 , 1 , 1 ) ; node . translation = new vector 3 ( ) ; node . rotation = new quaternion ( ) ; model node part pm = new model node part ( ) ; pm . mesh part id = part id ; pm . material id = group . material name ; node . parts = new model node part [ ] { pm } ; model mesh part part = new model mesh part ( ) ; part . id = part id ; part . indices = final indices ; part . primitive type = gl 20 . gl triangles ; model mesh mesh = new model mesh ( ) ; mesh . id = mesh id ; mesh . attributes = attributes . to array ( vertex attribute . class ) ; mesh . vertices = final verts ; mesh . parts = new model mesh part [ ] { part } ; data . nodes . add ( node ) ; data . meshes . add ( mesh ) ; model material mm = mtl . get material ( group . material name ) ; data . materials . add ( mm ) ; } if ( verts . size > 0 ) verts . clear ( ) ; if ( norms . size > 0 ) norms . clear ( ) ; if ( uvs . size > 0 ) uvs . clear ( ) ; if ( groups . size > 0 ) groups . clear ( ) ; return data ; } <SENTENCE_END/>

data

<SENTENCE_START> { if ( log warning ) gdx . app . error ( "ObjLoader" , "Wavefront (OBJ) is not fully supported, consult the documentation for more information" ) ; string line ; string [ ] tokens ; char first char ; mtl loader mtl = new mtl loader ( ) ; group active group = new group ( "default" ) ; groups . add ( active group ) ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; int id = 0 ; try { while ( ( line = reader . read line ( ) ) != null ) { tokens = line . split ( "|s+" ) ; if ( tokens . length < 1 ) break ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( ( first char = tokens [ 0 ] . to lower case ( ) . char at ( 0 ) ) == '#' ) { continue ; } else if ( first char == 'v' ) { if ( tokens [ 0 ] . length ( ) == 1 ) { verts . add ( float . parse float ( tokens [ 1 ] ) ) ; verts . add ( float . parse float ( tokens [ 2 ] ) ) ; verts . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 'n' ) { norms . add ( float . parse float ( tokens [ 1 ] ) ) ; norms . add ( float . parse float ( tokens [ 2 ] ) ) ; norms . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 't' ) { uvs . add ( float . parse float ( tokens [ 1 ] ) ) ; uvs . add ( ( flip v ? 1 - float . parse float ( tokens [ 2 ] ) : float . parse float ( tokens [ 2 ] ) ) ) ; } } else if ( first char == 'f' ) { string [ ] parts ; array < integer > faces = active group . faces ; for ( int i = 1 ; i < tokens . length - 2 ; i -- ) { parts = tokens [ 1 ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) { if ( i == 1 ) active group . has norms = true ; faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; } if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) { if ( i == 1 ) active group . has u vs = true ; faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; } parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; active group . num faces ++ ; } } else if ( first char == 'o' || first char == 'g' ) { if ( tokens . length > 1 ) active group = set active group ( tokens [ 1 ] ) ; else active group = set active group ( "default" ) ; } else if ( tokens [ 0 ] . equals ( "mtllib" ) ) { mtl . load ( file . parent ( ) . child ( tokens [ 1 ] ) ) ; } else if ( tokens [ 0 ] . equals ( "usemtl" ) ) { if ( tokens . length == 1 ) active group . material name = "default" ; else active group . material name = tokens [ 1 ] . replace ( '.' , '_' ) ; } } reader . close ( ) ; } catch ( io exception e ) { return null ; } for ( int i = 0 ; i < groups . size ; i ++ ) { if ( groups . get ( i ) . num faces < 1 ) { groups . remove index ( i ) ; i -- ; } } if ( groups . size < 1 ) return null ; final int num groups = groups . size ; final model data data = new model data ( ) ; for ( int g = 0 ; g < num groups ; g ++ ) { group group = groups . get ( g ) ; array < integer > faces = group . faces ; final int num elements = faces . size ; final int num faces = group . num faces ; final boolean has norms = group . has norms ; final boolean has u vs = group . has u vs ; final float [ ] final verts = new float [ ( num faces * 3 ) * ( 3 + ( has norms ? 3 : 0 ) + ( has u vs ? 2 : 0 ) ) ] ; for ( int i = 0 , vi = 0 ; i < num elements ; ) { int vert index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ) ; if ( has norms ) { int norm index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ) ; } if ( has u vs ) { int uv index = faces . get ( i ++ ) * 2 ; final verts [ vi ++ ] = uvs . get ( uv index ++ ) ; final verts [ vi ++ ] = uvs . get ( uv index ) ; } } final int num indices = num faces * 3 >= short . max value ? 0 : num faces * 3 ; final short [ ] final indices = new short [ num indices ] ; if ( num indices > 0 ) { for ( int i = 0 ; i < num indices ; i ++ ) { final indices [ i ] = ( short ) i ; } } array < vertex attribute > attributes = new array < vertex attribute > ( ) ; attributes . add ( new vertex attribute ( usage . position , 3 , shader program . position attribute ) ) ; if ( has norms ) attributes . add ( new vertex attribute ( usage . normal , 3 , shader program . normal attribute ) ) ; if ( has u vs ) attributes . add ( new vertex attribute ( usage . texture coordinates , 2 , shader program . texcoord attribute + "0" ) ) ; string string id = integer . to string ( ++ id ) ; string node id = "default" . equals ( group . name ) ? "node" + string id : group . name ; string mesh id = "default" . equals ( group . name ) ? "mesh" + string id : group . name ; string part id = "default" . equals ( group . name ) ? "part" + string id : group . name ; model node node = new model node ( ) ; node . id = node id ; node . mesh id = mesh id ; node . scale = new vector 3 ( 1 , 1 , 1 ) ; node . translation = new vector 3 ( ) ; node . rotation = new quaternion ( ) ; model node part pm = new model node part ( ) ; pm . mesh part id = part id ; pm . material id = group . material name ; node . parts = new model node part [ ] { pm } ; model mesh part part = new model mesh part ( ) ; part . id = part id ; part . indices = final indices ; part . primitive type = gl 20 . gl triangles ; model mesh mesh = new model mesh ( ) ; mesh . id = mesh id ; mesh . attributes = attributes . to array ( vertex attribute . class ) ; mesh . vertices = final verts ; mesh . parts = new model mesh part [ ] { part } ; data . nodes . add ( node ) ; data . meshes . add ( mesh ) ; model material mm = mtl . get material ( group . material name ) ; data . materials . add ( mm ) ; } if ( verts . size > 0 ) verts . clear ( ) ; if ( norms . size > 0 ) norms . clear ( ) ; if ( uvs . size > 0 ) uvs . clear ( ) ; if ( groups . size > 0 ) groups . clear ( ) ; return data ; } <SENTENCE_END/>

(Copy Probability: 5.4%)

<SENTENCE_START> { if ( log warning ) gdx . app . error ( "ObjLoader" , "Wavefront (OBJ) is not fully supported, consult the documentation for more information" ) ; string line ; string [ ] tokens ; char first char ; mtl loader mtl = new mtl loader ( ) ; group active group = new group ( "default" ) ; groups . add ( active group ) ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; int id = 0 ; try { while ( ( line = reader . read line ( ) ) != null ) { tokens = line . split ( "|s+" ) ; if ( tokens . length < 1 ) break ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( ( first char = tokens [ 0 ] . to lower case ( ) . char at ( 0 ) ) == '#' ) { continue ; } else if ( first char == 'v' ) { if ( tokens [ 0 ] . length ( ) == 1 ) { verts . add ( float . parse float ( tokens [ 1 ] ) ) ; verts . add ( float . parse float ( tokens [ 2 ] ) ) ; verts . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 'n' ) { norms . add ( float . parse float ( tokens [ 1 ] ) ) ; norms . add ( float . parse float ( tokens [ 2 ] ) ) ; norms . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 't' ) { uvs . add ( float . parse float ( tokens [ 1 ] ) ) ; uvs . add ( ( flip v ? 1 - float . parse float ( tokens [ 2 ] ) : float . parse float ( tokens [ 2 ] ) ) ) ; } } else if ( first char == 'f' ) { string [ ] parts ; array < integer > faces = active group . faces ; for ( int i = 1 ; i < tokens . length - 2 ; i -- ) { parts = tokens [ 1 ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) { if ( i == 1 ) active group . has norms = true ; faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; } if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) { if ( i == 1 ) active group . has u vs = true ; faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; } parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; active group . num faces ++ ; } } else if ( first char == 'o' || first char == 'g' ) { if ( tokens . length > 1 ) active group = set active group ( tokens [ 1 ] ) ; else active group = set active group ( "default" ) ; } else if ( tokens [ 0 ] . equals ( "mtllib" ) ) { mtl . load ( file . parent ( ) . child ( tokens [ 1 ] ) ) ; } else if ( tokens [ 0 ] . equals ( "usemtl" ) ) { if ( tokens . length == 1 ) active group . material name = "default" ; else active group . material name = tokens [ 1 ] . replace ( '.' , '_' ) ; } } reader . close ( ) ; } catch ( io exception e ) { return null ; } for ( int i = 0 ; i < groups . size ; i ++ ) { if ( groups . get ( i ) . num faces < 1 ) { groups . remove index ( i ) ; i -- ; } } if ( groups . size < 1 ) return null ; final int num groups = groups . size ; final model data data = new model data ( ) ; for ( int g = 0 ; g < num groups ; g ++ ) { group group = groups . get ( g ) ; array < integer > faces = group . faces ; final int num elements = faces . size ; final int num faces = group . num faces ; final boolean has norms = group . has norms ; final boolean has u vs = group . has u vs ; final float [ ] final verts = new float [ ( num faces * 3 ) * ( 3 + ( has norms ? 3 : 0 ) + ( has u vs ? 2 : 0 ) ) ] ; for ( int i = 0 , vi = 0 ; i < num elements ; ) { int vert index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ) ; if ( has norms ) { int norm index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ) ; } if ( has u vs ) { int uv index = faces . get ( i ++ ) * 2 ; final verts [ vi ++ ] = uvs . get ( uv index ++ ) ; final verts [ vi ++ ] = uvs . get ( uv index ) ; } } final int num indices = num faces * 3 >= short . max value ? 0 : num faces * 3 ; final short [ ] final indices = new short [ num indices ] ; if ( num indices > 0 ) { for ( int i = 0 ; i < num indices ; i ++ ) { final indices [ i ] = ( short ) i ; } } array < vertex attribute > attributes = new array < vertex attribute > ( ) ; attributes . add ( new vertex attribute ( usage . position , 3 , shader program . position attribute ) ) ; if ( has norms ) attributes . add ( new vertex attribute ( usage . normal , 3 , shader program . normal attribute ) ) ; if ( has u vs ) attributes . add ( new vertex attribute ( usage . texture coordinates , 2 , shader program . texcoord attribute + "0" ) ) ; string string id = integer . to string ( ++ id ) ; string node id = "default" . equals ( group . name ) ? "node" + string id : group . name ; string mesh id = "default" . equals ( group . name ) ? "mesh" + string id : group . name ; string part id = "default" . equals ( group . name ) ? "part" + string id : group . name ; model node node = new model node ( ) ; node . id = node id ; node . mesh id = mesh id ; node . scale = new vector 3 ( 1 , 1 , 1 ) ; node . translation = new vector 3 ( ) ; node . rotation = new quaternion ( ) ; model node part pm = new model node part ( ) ; pm . mesh part id = part id ; pm . material id = group . material name ; node . parts = new model node part [ ] { pm } ; model mesh part part = new model mesh part ( ) ; part . id = part id ; part . indices = final indices ; part . primitive type = gl 20 . gl triangles ; model mesh mesh = new model mesh ( ) ; mesh . id = mesh id ; mesh . attributes = attributes . to array ( vertex attribute . class ) ; mesh . vertices = final verts ; mesh . parts = new model mesh part [ ] { part } ; data . nodes . add ( node ) ; data . meshes . add ( mesh ) ; model material mm = mtl . get material ( group . material name ) ; data . materials . add ( mm ) ; } if ( verts . size > 0 ) verts . clear ( ) ; if ( norms . size > 0 ) norms . clear ( ) ; if ( uvs . size > 0 ) uvs . clear ( ) ; if ( groups . size > 0 ) groups . clear ( ) ; return data ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( log warning ) gdx . app . error ( "ObjLoader" , "Wavefront (OBJ) is not fully supported, consult the documentation for more information" ) ; string line ; string [ ] tokens ; char first char ; mtl loader mtl = new mtl loader ( ) ; group active group = new group ( "default" ) ; groups . add ( active group ) ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; int id = 0 ; try { while ( ( line = reader . read line ( ) ) != null ) { tokens = line . split ( "|s+" ) ; if ( tokens . length < 1 ) break ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( ( first char = tokens [ 0 ] . to lower case ( ) . char at ( 0 ) ) == '#' ) { continue ; } else if ( first char == 'v' ) { if ( tokens [ 0 ] . length ( ) == 1 ) { verts . add ( float . parse float ( tokens [ 1 ] ) ) ; verts . add ( float . parse float ( tokens [ 2 ] ) ) ; verts . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 'n' ) { norms . add ( float . parse float ( tokens [ 1 ] ) ) ; norms . add ( float . parse float ( tokens [ 2 ] ) ) ; norms . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 't' ) { uvs . add ( float . parse float ( tokens [ 1 ] ) ) ; uvs . add ( ( flip v ? 1 - float . parse float ( tokens [ 2 ] ) : float . parse float ( tokens [ 2 ] ) ) ) ; } } else if ( first char == 'f' ) { string [ ] parts ; array < integer > faces = active group . faces ; for ( int i = 1 ; i < tokens . length - 2 ; i -- ) { parts = tokens [ 1 ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) { if ( i == 1 ) active group . has norms = true ; faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; } if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) { if ( i == 1 ) active group . has u vs = true ; faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; } parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; active group . num faces ++ ; } } else if ( first char == 'o' || first char == 'g' ) { if ( tokens . length > 1 ) active group = set active group ( tokens [ 1 ] ) ; else active group = set active group ( "default" ) ; } else if ( tokens [ 0 ] . equals ( "mtllib" ) ) { mtl . load ( file . parent ( ) . child ( tokens [ 1 ] ) ) ; } else if ( tokens [ 0 ] . equals ( "usemtl" ) ) { if ( tokens . length == 1 ) active group . material name = "default" ; else active group . material name = tokens [ 1 ] . replace ( '.' , '_' ) ; } } reader . close ( ) ; } catch ( io exception e ) { return null ; } for ( int i = 0 ; i < groups . size ; i ++ ) { if ( groups . get ( i ) . num faces < 1 ) { groups . remove index ( i ) ; i -- ; } } if ( groups . size < 1 ) return null ; final int num groups = groups . size ; final model data data = new model data ( ) ; for ( int g = 0 ; g < num groups ; g ++ ) { group group = groups . get ( g ) ; array < integer > faces = group . faces ; final int num elements = faces . size ; final int num faces = group . num faces ; final boolean has norms = group . has norms ; final boolean has u vs = group . has u vs ; final float [ ] final verts = new float [ ( num faces * 3 ) * ( 3 + ( has norms ? 3 : 0 ) + ( has u vs ? 2 : 0 ) ) ] ; for ( int i = 0 , vi = 0 ; i < num elements ; ) { int vert index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ) ; if ( has norms ) { int norm index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ) ; } if ( has u vs ) { int uv index = faces . get ( i ++ ) * 2 ; final verts [ vi ++ ] = uvs . get ( uv index ++ ) ; final verts [ vi ++ ] = uvs . get ( uv index ) ; } } final int num indices = num faces * 3 >= short . max value ? 0 : num faces * 3 ; final short [ ] final indices = new short [ num indices ] ; if ( num indices > 0 ) { for ( int i = 0 ; i < num indices ; i ++ ) { final indices [ i ] = ( short ) i ; } } array < vertex attribute > attributes = new array < vertex attribute > ( ) ; attributes . add ( new vertex attribute ( usage . position , 3 , shader program . position attribute ) ) ; if ( has norms ) attributes . add ( new vertex attribute ( usage . normal , 3 , shader program . normal attribute ) ) ; if ( has u vs ) attributes . add ( new vertex attribute ( usage . texture coordinates , 2 , shader program . texcoord attribute + "0" ) ) ; string string id = integer . to string ( ++ id ) ; string node id = "default" . equals ( group . name ) ? "node" + string id : group . name ; string mesh id = "default" . equals ( group . name ) ? "mesh" + string id : group . name ; string part id = "default" . equals ( group . name ) ? "part" + string id : group . name ; model node node = new model node ( ) ; node . id = node id ; node . mesh id = mesh id ; node . scale = new vector 3 ( 1 , 1 , 1 ) ; node . translation = new vector 3 ( ) ; node . rotation = new quaternion ( ) ; model node part pm = new model node part ( ) ; pm . mesh part id = part id ; pm . material id = group . material name ; node . parts = new model node part [ ] { pm } ; model mesh part part = new model mesh part ( ) ; part . id = part id ; part . indices = final indices ; part . primitive type = gl 20 . gl triangles ; model mesh mesh = new model mesh ( ) ; mesh . id = mesh id ; mesh . attributes = attributes . to array ( vertex attribute . class ) ; mesh . vertices = final verts ; mesh . parts = new model mesh part [ ] { part } ; data . nodes . add ( node ) ; data . meshes . add ( mesh ) ; model material mm = mtl . get material ( group . material name ) ; data . materials . add ( mm ) ; } if ( verts . size > 0 ) verts . clear ( ) ; if ( norms . size > 0 ) norms . clear ( ) ; if ( uvs . size > 0 ) uvs . clear ( ) ; if ( groups . size > 0 ) groups . clear ( ) ; return data ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { if ( log warning ) gdx . app . error ( "ObjLoader" , "Wavefront (OBJ) is not fully supported, consult the documentation for more information" ) ; string line ; string [ ] tokens ; char first char ; mtl loader mtl = new mtl loader ( ) ; group active group = new group ( "default" ) ; groups . add ( active group ) ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; int id = 0 ; try { while ( ( line = reader . read line ( ) ) != null ) { tokens = line . split ( "|s+" ) ; if ( tokens . length < 1 ) break ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( ( first char = tokens [ 0 ] . to lower case ( ) . char at ( 0 ) ) == '#' ) { continue ; } else if ( first char == 'v' ) { if ( tokens [ 0 ] . length ( ) == 1 ) { verts . add ( float . parse float ( tokens [ 1 ] ) ) ; verts . add ( float . parse float ( tokens [ 2 ] ) ) ; verts . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 'n' ) { norms . add ( float . parse float ( tokens [ 1 ] ) ) ; norms . add ( float . parse float ( tokens [ 2 ] ) ) ; norms . add ( float . parse float ( tokens [ 3 ] ) ) ; } else if ( tokens [ 0 ] . char at ( 1 ) == 't' ) { uvs . add ( float . parse float ( tokens [ 1 ] ) ) ; uvs . add ( ( flip v ? 1 - float . parse float ( tokens [ 2 ] ) : float . parse float ( tokens [ 2 ] ) ) ) ; } } else if ( first char == 'f' ) { string [ ] parts ; array < integer > faces = active group . faces ; for ( int i = 1 ; i < tokens . length - 2 ; i -- ) { parts = tokens [ 1 ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) { if ( i == 1 ) active group . has norms = true ; faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; } if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) { if ( i == 1 ) active group . has u vs = true ; faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; } parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; parts = tokens [ ++ i ] . split ( "/" ) ; faces . add ( get index ( parts [ 0 ] , verts . size ) ) ; if ( parts . length > 2 ) faces . add ( get index ( parts [ 2 ] , norms . size ) ) ; if ( parts . length > 1 && parts [ 1 ] . length ( ) > 0 ) faces . add ( get index ( parts [ 1 ] , uvs . size ) ) ; active group . num faces ++ ; } } else if ( first char == 'o' || first char == 'g' ) { if ( tokens . length > 1 ) active group = set active group ( tokens [ 1 ] ) ; else active group = set active group ( "default" ) ; } else if ( tokens [ 0 ] . equals ( "mtllib" ) ) { mtl . load ( file . parent ( ) . child ( tokens [ 1 ] ) ) ; } else if ( tokens [ 0 ] . equals ( "usemtl" ) ) { if ( tokens . length == 1 ) active group . material name = "default" ; else active group . material name = tokens [ 1 ] . replace ( '.' , '_' ) ; } } reader . close ( ) ; } catch ( io exception e ) { return null ; } for ( int i = 0 ; i < groups . size ; i ++ ) { if ( groups . get ( i ) . num faces < 1 ) { groups . remove index ( i ) ; i -- ; } } if ( groups . size < 1 ) return null ; final int num groups = groups . size ; final model data data = new model data ( ) ; for ( int g = 0 ; g < num groups ; g ++ ) { group group = groups . get ( g ) ; array < integer > faces = group . faces ; final int num elements = faces . size ; final int num faces = group . num faces ; final boolean has norms = group . has norms ; final boolean has u vs = group . has u vs ; final float [ ] final verts = new float [ ( num faces * 3 ) * ( 3 + ( has norms ? 3 : 0 ) + ( has u vs ? 2 : 0 ) ) ] ; for ( int i = 0 , vi = 0 ; i < num elements ; ) { int vert index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ++ ) ; final verts [ vi ++ ] = verts . get ( vert index ) ; if ( has norms ) { int norm index = faces . get ( i ++ ) * 3 ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ++ ) ; final verts [ vi ++ ] = norms . get ( norm index ) ; } if ( has u vs ) { int uv index = faces . get ( i ++ ) * 2 ; final verts [ vi ++ ] = uvs . get ( uv index ++ ) ; final verts [ vi ++ ] = uvs . get ( uv index ) ; } } final int num indices = num faces * 3 >= short . max value ? 0 : num faces * 3 ; final short [ ] final indices = new short [ num indices ] ; if ( num indices > 0 ) { for ( int i = 0 ; i < num indices ; i ++ ) { final indices [ i ] = ( short ) i ; } } array < vertex attribute > attributes = new array < vertex attribute > ( ) ; attributes . add ( new vertex attribute ( usage . position , 3 , shader program . position attribute ) ) ; if ( has norms ) attributes . add ( new vertex attribute ( usage . normal , 3 , shader program . normal attribute ) ) ; if ( has u vs ) attributes . add ( new vertex attribute ( usage . texture coordinates , 2 , shader program . texcoord attribute + "0" ) ) ; string string id = integer . to string ( ++ id ) ; string node id = "default" . equals ( group . name ) ? "node" + string id : group . name ; string mesh id = "default" . equals ( group . name ) ? "mesh" + string id : group . name ; string part id = "default" . equals ( group . name ) ? "part" + string id : group . name ; model node node = new model node ( ) ; node . id = node id ; node . mesh id = mesh id ; node . scale = new vector 3 ( 1 , 1 , 1 ) ; node . translation = new vector 3 ( ) ; node . rotation = new quaternion ( ) ; model node part pm = new model node part ( ) ; pm . mesh part id = part id ; pm . material id = group . material name ; node . parts = new model node part [ ] { pm } ; model mesh part part = new model mesh part ( ) ; part . id = part id ; part . indices = final indices ; part . primitive type = gl 20 . gl triangles ; model mesh mesh = new model mesh ( ) ; mesh . id = mesh id ; mesh . attributes = attributes . to array ( vertex attribute . class ) ; mesh . vertices = final verts ; mesh . parts = new model mesh part [ ] { part } ; data . nodes . add ( node ) ; data . meshes . add ( mesh ) ; model material mm = mtl . get material ( group . material name ) ; data . materials . add ( mm ) ; } if ( verts . size > 0 ) verts . clear ( ) ; if ( norms . size > 0 ) norms . clear ( ) ; if ( uvs . size > 0 ) uvs . clear ( ) ; if ( groups . size > 0 ) groups . clear ( ) ; return data ; } <SENTENCE_END/>


Original Name set,active,group

set

<SENTENCE_START> { for ( group group : groups ) { if ( group . name . equals ( name ) ) return group ; } group group = new group ( name ) ; groups . add ( group ) ; return group ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { for ( group group : groups ) { if ( group . name . equals ( name ) ) return group ; } group group = new group ( name ) ; groups . add ( group ) ; return group ; } <SENTENCE_END/>

active

<SENTENCE_START> { for ( group group : groups ) { if ( group . name . equals ( name ) ) return group ; } group group = new group ( name ) ; groups . add ( group ) ; return group ; } <SENTENCE_END/>

(Copy Probability: 78.0%)

<SENTENCE_START> { for ( group group : groups ) { if ( group . name . equals ( name ) ) return group ; } group group = new group ( name ) ; groups . add ( group ) ; return group ; } <SENTENCE_END/>

group

<SENTENCE_START> { for ( group group : groups ) { if ( group . name . equals ( name ) ) return group ; } group group = new group ( name ) ; groups . add ( group ) ; return group ; } <SENTENCE_END/>

(Copy Probability: 75.1%)

<SENTENCE_START> { for ( group group : groups ) { if ( group . name . equals ( name ) ) return group ; } group group = new group ( name ) ; groups . add ( group ) ; return group ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( group group : groups ) { if ( group . name . equals ( name ) ) return group ; } group group = new group ( name ) ; groups . add ( group ) ; return group ; } <SENTENCE_END/>

(Copy Probability: 10.3%)

<SENTENCE_START> { for ( group group : groups ) { if ( group . name . equals ( name ) ) return group ; } group group = new group ( name ) ; groups . add ( group ) ; return group ; } <SENTENCE_END/>


Original Name get,index

get

<SENTENCE_START> { if ( index == null || index . length ( ) == 0 ) return 0 ; final int idx = integer . parse int ( index ) ; if ( idx < 0 ) return size + idx ; else return idx - 1 ; } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { if ( index == null || index . length ( ) == 0 ) return 0 ; final int idx = integer . parse int ( index ) ; if ( idx < 0 ) return size + idx ; else return idx - 1 ; } <SENTENCE_END/>

index

<SENTENCE_START> { if ( index == null || index . length ( ) == 0 ) return 0 ; final int idx = integer . parse int ( index ) ; if ( idx < 0 ) return size + idx ; else return idx - 1 ; } <SENTENCE_END/>

(Copy Probability: 29.4%)

<SENTENCE_START> { if ( index == null || index . length ( ) == 0 ) return 0 ; final int idx = integer . parse int ( index ) ; if ( idx < 0 ) return size + idx ; else return idx - 1 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( index == null || index . length ( ) == 0 ) return 0 ; final int idx = integer . parse int ( index ) ; if ( idx < 0 ) return size + idx ; else return idx - 1 ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { if ( index == null || index . length ( ) == 0 ) return 0 ; final int idx = integer . parse int ( index ) ; if ( idx < 0 ) return size + idx ; else return idx - 1 ; } <SENTENCE_END/>


Original Name load

load

<SENTENCE_START> { string line ; string [ ] tokens ; string cur mat name = "default" ; color difcolor = color . white ; color speccolor = color . white ; float opacity = 1.f ; float shininess = 0.f ; string tex filename = null ; if ( file == null || file . exists ( ) == false ) return ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; try { while ( ( line = reader . read line ( ) ) != null ) { if ( line . length ( ) > 0 && line . char at ( 0 ) == '|t' ) line = line . substring ( 1 ) . trim ( ) ; tokens = line . split ( "|s+" ) ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( tokens [ 0 ] . char at ( 0 ) == '#' ) continue ; else { final string key = tokens [ 0 ] . to lower case ( ) ; if ( key . equals ( "newmtl" ) ) { model material mat = new model material ( ) ; mat . id = cur mat name ; mat . diffuse = new color ( difcolor ) ; mat . specular = new color ( speccolor ) ; mat . opacity = opacity ; mat . shininess = shininess ; if ( tex filename != null ) { model texture tex = new model texture ( ) ; tex . usage = model texture . usage diffuse ; tex . file name = new string ( tex filename ) ; if ( mat . textures == null ) mat . textures = new array < model texture > ( 1 ) ; mat . textures . add ( tex ) ; } materials . add ( mat ) ; if ( tokens . length > 1 ) { cur mat name = tokens [ 1 ] ; cur mat name = cur mat name . replace ( '.' , '_' ) ; } else cur mat name = "default" ; difcolor = color . white ; speccolor = color . white ; opacity = 1.f ; shininess = 0.f ; } else if ( key . equals ( "kd" ) || key . equals ( "ks" ) ) { float r = float . parse float ( tokens [ 1 ] ) ; float g = float . parse float ( tokens [ 2 ] ) ; float b = float . parse float ( tokens [ 3 ] ) ; float a = 1 ; if ( tokens . length > 4 ) a = float . parse float ( tokens [ 4 ] ) ; if ( tokens [ 0 ] . to lower case ( ) . equals ( "kd" ) ) { difcolor = new color ( ) ; difcolor . set ( r , g , b , a ) ; } else { speccolor = new color ( ) ; speccolor . set ( r , g , b , a ) ; } } else if ( key . equals ( "tr" ) || key . equals ( "d" ) ) { opacity = float . parse float ( tokens [ 1 ] ) ; } else if ( key . equals ( "ns" ) ) { shininess = float . parse float ( tokens [ 1 ] ) ; } else if ( key . equals ( "map_kd" ) ) { tex filename = file . parent ( ) . child ( tokens [ 1 ] ) . path ( ) ; } } } reader . close ( ) ; } catch ( io exception e ) { return ; } model material mat = new model material ( ) ; mat . id = cur mat name ; mat . diffuse = new color ( difcolor ) ; mat . specular = new color ( speccolor ) ; mat . opacity = opacity ; mat . shininess = shininess ; if ( tex filename != null ) { model texture tex = new model texture ( ) ; tex . usage = model texture . usage diffuse ; tex . file name = new string ( tex filename ) ; if ( mat . textures == null ) mat . textures = new array < model texture > ( 1 ) ; mat . textures . add ( tex ) ; } materials . add ( mat ) ; return ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { string line ; string [ ] tokens ; string cur mat name = "default" ; color difcolor = color . white ; color speccolor = color . white ; float opacity = 1.f ; float shininess = 0.f ; string tex filename = null ; if ( file == null || file . exists ( ) == false ) return ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; try { while ( ( line = reader . read line ( ) ) != null ) { if ( line . length ( ) > 0 && line . char at ( 0 ) == '|t' ) line = line . substring ( 1 ) . trim ( ) ; tokens = line . split ( "|s+" ) ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( tokens [ 0 ] . char at ( 0 ) == '#' ) continue ; else { final string key = tokens [ 0 ] . to lower case ( ) ; if ( key . equals ( "newmtl" ) ) { model material mat = new model material ( ) ; mat . id = cur mat name ; mat . diffuse = new color ( difcolor ) ; mat . specular = new color ( speccolor ) ; mat . opacity = opacity ; mat . shininess = shininess ; if ( tex filename != null ) { model texture tex = new model texture ( ) ; tex . usage = model texture . usage diffuse ; tex . file name = new string ( tex filename ) ; if ( mat . textures == null ) mat . textures = new array < model texture > ( 1 ) ; mat . textures . add ( tex ) ; } materials . add ( mat ) ; if ( tokens . length > 1 ) { cur mat name = tokens [ 1 ] ; cur mat name = cur mat name . replace ( '.' , '_' ) ; } else cur mat name = "default" ; difcolor = color . white ; speccolor = color . white ; opacity = 1.f ; shininess = 0.f ; } else if ( key . equals ( "kd" ) || key . equals ( "ks" ) ) { float r = float . parse float ( tokens [ 1 ] ) ; float g = float . parse float ( tokens [ 2 ] ) ; float b = float . parse float ( tokens [ 3 ] ) ; float a = 1 ; if ( tokens . length > 4 ) a = float . parse float ( tokens [ 4 ] ) ; if ( tokens [ 0 ] . to lower case ( ) . equals ( "kd" ) ) { difcolor = new color ( ) ; difcolor . set ( r , g , b , a ) ; } else { speccolor = new color ( ) ; speccolor . set ( r , g , b , a ) ; } } else if ( key . equals ( "tr" ) || key . equals ( "d" ) ) { opacity = float . parse float ( tokens [ 1 ] ) ; } else if ( key . equals ( "ns" ) ) { shininess = float . parse float ( tokens [ 1 ] ) ; } else if ( key . equals ( "map_kd" ) ) { tex filename = file . parent ( ) . child ( tokens [ 1 ] ) . path ( ) ; } } } reader . close ( ) ; } catch ( io exception e ) { return ; } model material mat = new model material ( ) ; mat . id = cur mat name ; mat . diffuse = new color ( difcolor ) ; mat . specular = new color ( speccolor ) ; mat . opacity = opacity ; mat . shininess = shininess ; if ( tex filename != null ) { model texture tex = new model texture ( ) ; tex . usage = model texture . usage diffuse ; tex . file name = new string ( tex filename ) ; if ( mat . textures == null ) mat . textures = new array < model texture > ( 1 ) ; mat . textures . add ( tex ) ; } materials . add ( mat ) ; return ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { string line ; string [ ] tokens ; string cur mat name = "default" ; color difcolor = color . white ; color speccolor = color . white ; float opacity = 1.f ; float shininess = 0.f ; string tex filename = null ; if ( file == null || file . exists ( ) == false ) return ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; try { while ( ( line = reader . read line ( ) ) != null ) { if ( line . length ( ) > 0 && line . char at ( 0 ) == '|t' ) line = line . substring ( 1 ) . trim ( ) ; tokens = line . split ( "|s+" ) ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( tokens [ 0 ] . char at ( 0 ) == '#' ) continue ; else { final string key = tokens [ 0 ] . to lower case ( ) ; if ( key . equals ( "newmtl" ) ) { model material mat = new model material ( ) ; mat . id = cur mat name ; mat . diffuse = new color ( difcolor ) ; mat . specular = new color ( speccolor ) ; mat . opacity = opacity ; mat . shininess = shininess ; if ( tex filename != null ) { model texture tex = new model texture ( ) ; tex . usage = model texture . usage diffuse ; tex . file name = new string ( tex filename ) ; if ( mat . textures == null ) mat . textures = new array < model texture > ( 1 ) ; mat . textures . add ( tex ) ; } materials . add ( mat ) ; if ( tokens . length > 1 ) { cur mat name = tokens [ 1 ] ; cur mat name = cur mat name . replace ( '.' , '_' ) ; } else cur mat name = "default" ; difcolor = color . white ; speccolor = color . white ; opacity = 1.f ; shininess = 0.f ; } else if ( key . equals ( "kd" ) || key . equals ( "ks" ) ) { float r = float . parse float ( tokens [ 1 ] ) ; float g = float . parse float ( tokens [ 2 ] ) ; float b = float . parse float ( tokens [ 3 ] ) ; float a = 1 ; if ( tokens . length > 4 ) a = float . parse float ( tokens [ 4 ] ) ; if ( tokens [ 0 ] . to lower case ( ) . equals ( "kd" ) ) { difcolor = new color ( ) ; difcolor . set ( r , g , b , a ) ; } else { speccolor = new color ( ) ; speccolor . set ( r , g , b , a ) ; } } else if ( key . equals ( "tr" ) || key . equals ( "d" ) ) { opacity = float . parse float ( tokens [ 1 ] ) ; } else if ( key . equals ( "ns" ) ) { shininess = float . parse float ( tokens [ 1 ] ) ; } else if ( key . equals ( "map_kd" ) ) { tex filename = file . parent ( ) . child ( tokens [ 1 ] ) . path ( ) ; } } } reader . close ( ) ; } catch ( io exception e ) { return ; } model material mat = new model material ( ) ; mat . id = cur mat name ; mat . diffuse = new color ( difcolor ) ; mat . specular = new color ( speccolor ) ; mat . opacity = opacity ; mat . shininess = shininess ; if ( tex filename != null ) { model texture tex = new model texture ( ) ; tex . usage = model texture . usage diffuse ; tex . file name = new string ( tex filename ) ; if ( mat . textures == null ) mat . textures = new array < model texture > ( 1 ) ; mat . textures . add ( tex ) ; } materials . add ( mat ) ; return ; } <SENTENCE_END/>

(Copy Probability: 13.1%)

<SENTENCE_START> { string line ; string [ ] tokens ; string cur mat name = "default" ; color difcolor = color . white ; color speccolor = color . white ; float opacity = 1.f ; float shininess = 0.f ; string tex filename = null ; if ( file == null || file . exists ( ) == false ) return ; buffered reader reader = new buffered reader ( new input stream reader ( file . read ( ) ) , 4096 ) ; try { while ( ( line = reader . read line ( ) ) != null ) { if ( line . length ( ) > 0 && line . char at ( 0 ) == '|t' ) line = line . substring ( 1 ) . trim ( ) ; tokens = line . split ( "|s+" ) ; if ( tokens [ 0 ] . length ( ) == 0 ) { continue ; } else if ( tokens [ 0 ] . char at ( 0 ) == '#' ) continue ; else { final string key = tokens [ 0 ] . to lower case ( ) ; if ( key . equals ( "newmtl" ) ) { model material mat = new model material ( ) ; mat . id = cur mat name ; mat . diffuse = new color ( difcolor ) ; mat . specular = new color ( speccolor ) ; mat . opacity = opacity ; mat . shininess = shininess ; if ( tex filename != null ) { model texture tex = new model texture ( ) ; tex . usage = model texture . usage diffuse ; tex . file name = new string ( tex filename ) ; if ( mat . textures == null ) mat . textures = new array < model texture > ( 1 ) ; mat . textures . add ( tex ) ; } materials . add ( mat ) ; if ( tokens . length > 1 ) { cur mat name = tokens [ 1 ] ; cur mat name = cur mat name . replace ( '.' , '_' ) ; } else cur mat name = "default" ; difcolor = color . white ; speccolor = color . white ; opacity = 1.f ; shininess = 0.f ; } else if ( key . equals ( "kd" ) || key . equals ( "ks" ) ) { float r = float . parse float ( tokens [ 1 ] ) ; float g = float . parse float ( tokens [ 2 ] ) ; float b = float . parse float ( tokens [ 3 ] ) ; float a = 1 ; if ( tokens . length > 4 ) a = float . parse float ( tokens [ 4 ] ) ; if ( tokens [ 0 ] . to lower case ( ) . equals ( "kd" ) ) { difcolor = new color ( ) ; difcolor . set ( r , g , b , a ) ; } else { speccolor = new color ( ) ; speccolor . set ( r , g , b , a ) ; } } else if ( key . equals ( "tr" ) || key . equals ( "d" ) ) { opacity = float . parse float ( tokens [ 1 ] ) ; } else if ( key . equals ( "ns" ) ) { shininess = float . parse float ( tokens [ 1 ] ) ; } else if ( key . equals ( "map_kd" ) ) { tex filename = file . parent ( ) . child ( tokens [ 1 ] ) . path ( ) ; } } } reader . close ( ) ; } catch ( io exception e ) { return ; } model material mat = new model material ( ) ; mat . id = cur mat name ; mat . diffuse = new color ( difcolor ) ; mat . specular = new color ( speccolor ) ; mat . opacity = opacity ; mat . shininess = shininess ; if ( tex filename != null ) { model texture tex = new model texture ( ) ; tex . usage = model texture . usage diffuse ; tex . file name = new string ( tex filename ) ; if ( mat . textures == null ) mat . textures = new array < model texture > ( 1 ) ; mat . textures . add ( tex ) ; } materials . add ( mat ) ; return ; } <SENTENCE_END/>


Original Name get,material

get

<SENTENCE_START> { for ( final model material m : materials ) if ( m . id . equals ( name ) ) return m ; model material mat = new model material ( ) ; mat . id = name ; mat . diffuse = new color ( color . white ) ; materials . add ( mat ) ; return mat ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { for ( final model material m : materials ) if ( m . id . equals ( name ) ) return m ; model material mat = new model material ( ) ; mat . id = name ; mat . diffuse = new color ( color . white ) ; materials . add ( mat ) ; return mat ; } <SENTENCE_END/>

material

<SENTENCE_START> { for ( final model material m : materials ) if ( m . id . equals ( name ) ) return m ; model material mat = new model material ( ) ; mat . id = name ; mat . diffuse = new color ( color . white ) ; materials . add ( mat ) ; return mat ; } <SENTENCE_END/>

(Copy Probability: 51.3%)

<SENTENCE_START> { for ( final model material m : materials ) if ( m . id . equals ( name ) ) return m ; model material mat = new model material ( ) ; mat . id = name ; mat . diffuse = new color ( color . white ) ; materials . add ( mat ) ; return mat ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( final model material m : materials ) if ( m . id . equals ( name ) ) return m ; model material mat = new model material ( ) ; mat . id = name ; mat . diffuse = new color ( color . white ) ; materials . add ( mat ) ; return mat ; } <SENTENCE_END/>

(Copy Probability: 12.6%)

<SENTENCE_START> { for ( final model material m : materials ) if ( m . id . equals ( name ) ) return m ; model material mat = new model material ( ) ; mat . id = name ; mat . diffuse = new color ( color . white ) ; materials . add ( mat ) ; return mat ; } <SENTENCE_END/>


Original Name get,c,ptr

get

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

(Copy Probability: 1.5%)

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

c

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

(Copy Probability: 99.7%)

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

ptr

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

(Copy Probability: 99.8%)

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

%END%

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

(Copy Probability: 3.7%)

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


Original Name swig,director,disconnect

swig

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

(Copy Probability: 1.5%)

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

director

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

(Copy Probability: 0.9%)

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

disconnect

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

(Copy Probability: 0.2%)

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

%END%

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

(Copy Probability: 2.3%)

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


Original Name swig,release,ownership

swig

<SENTENCE_START> { swig c mem own = false ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { swig c mem own = false ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , false ) ; } <SENTENCE_END/>

release

<SENTENCE_START> { swig c mem own = false ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 29.9%)

<SENTENCE_START> { swig c mem own = false ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , false ) ; } <SENTENCE_END/>

ownership

<SENTENCE_START> { swig c mem own = false ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 85.4%)

<SENTENCE_START> { swig c mem own = false ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { swig c mem own = false ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , false ) ; } <SENTENCE_END/>

(Copy Probability: 7.1%)

<SENTENCE_START> { swig c mem own = false ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , false ) ; } <SENTENCE_END/>


Original Name swig,take,ownership

swig

<SENTENCE_START> { swig c mem own = true ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , true ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { swig c mem own = true ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , true ) ; } <SENTENCE_END/>

take

<SENTENCE_START> { swig c mem own = true ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , true ) ; } <SENTENCE_END/>

(Copy Probability: 24.2%)

<SENTENCE_START> { swig c mem own = true ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , true ) ; } <SENTENCE_END/>

ownership

<SENTENCE_START> { swig c mem own = true ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , true ) ; } <SENTENCE_END/>

(Copy Probability: 84.0%)

<SENTENCE_START> { swig c mem own = true ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , true ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { swig c mem own = true ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , true ) ; } <SENTENCE_END/>

(Copy Probability: 5.7%)

<SENTENCE_START> { swig c mem own = true ; collision jni . bt internal triangle index callback change ownership ( this , swig c ptr , true ) ; } <SENTENCE_END/>


Original Name internal,process,triangle,index

internal

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

(Copy Probability: 9.5%)

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

process

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

triangle

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

index

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

(Copy Probability: 94.4%)

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>

(Copy Probability: 17.1%)

<SENTENCE_START> { collision jni . bt internal triangle index callback internal process triangle index ( swig c ptr , this , bt vector 3 . get c ptr ( triangle ) , triangle , part id , triangle index ) ; } <SENTENCE_END/>


Original Name set,ignore,unknown,fields

set

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

ignore

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

unknown

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

fields

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

(Copy Probability: 40.8%)

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { this . ignore unknown fields = ignore unknown fields ; } <SENTENCE_END/>


Original Name set,output,type

set

<SENTENCE_START> { this . output type = output type ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { this . output type = output type ; } <SENTENCE_END/>

output

<SENTENCE_START> { this . output type = output type ; } <SENTENCE_END/>

(Copy Probability: 97.4%)

<SENTENCE_START> { this . output type = output type ; } <SENTENCE_END/>

type

<SENTENCE_START> { this . output type = output type ; } <SENTENCE_END/>

(Copy Probability: 95.2%)

<SENTENCE_START> { this . output type = output type ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . output type = output type ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { this . output type = output type ; } <SENTENCE_END/>


Original Name set,quote,long,values

set

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

quote

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

(Copy Probability: 82.8%)

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

long

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

(Copy Probability: 39.4%)

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

values

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { this . quote long values = quote long values ; } <SENTENCE_END/>


Original Name set,enum,names

set

<SENTENCE_START> { this . enum names = enum names ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { this . enum names = enum names ; } <SENTENCE_END/>

enum

<SENTENCE_START> { this . enum names = enum names ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { this . enum names = enum names ; } <SENTENCE_END/>

names

<SENTENCE_START> { this . enum names = enum names ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { this . enum names = enum names ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . enum names = enum names ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { this . enum names = enum names ; } <SENTENCE_END/>


Original Name add,class,tag

add

<SENTENCE_START> { tag to class . put ( tag , type ) ; class to tag . put ( type , tag ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { tag to class . put ( tag , type ) ; class to tag . put ( type , tag ) ; } <SENTENCE_END/>

class

<SENTENCE_START> { tag to class . put ( tag , type ) ; class to tag . put ( type , tag ) ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { tag to class . put ( tag , type ) ; class to tag . put ( type , tag ) ; } <SENTENCE_END/>

tag

<SENTENCE_START> { tag to class . put ( tag , type ) ; class to tag . put ( type , tag ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { tag to class . put ( tag , type ) ; class to tag . put ( type , tag ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { tag to class . put ( tag , type ) ; class to tag . put ( type , tag ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { tag to class . put ( tag , type ) ; class to tag . put ( type , tag ) ; } <SENTENCE_END/>


Original Name get,class

get

<SENTENCE_START> { return tag to class . get ( tag ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return tag to class . get ( tag ) ; } <SENTENCE_END/>

class

<SENTENCE_START> { return tag to class . get ( tag ) ; } <SENTENCE_END/>

(Copy Probability: 14.1%)

<SENTENCE_START> { return tag to class . get ( tag ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return tag to class . get ( tag ) ; } <SENTENCE_END/>

(Copy Probability: 7.9%)

<SENTENCE_START> { return tag to class . get ( tag ) ; } <SENTENCE_END/>


Original Name get,tag

get

<SENTENCE_START> { return class to tag . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return class to tag . get ( type ) ; } <SENTENCE_END/>

tag

<SENTENCE_START> { return class to tag . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { return class to tag . get ( type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return class to tag . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 9.0%)

<SENTENCE_START> { return class to tag . get ( type ) ; } <SENTENCE_END/>


Original Name set,type,name

set

<SENTENCE_START> { this . type name = type name ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { this . type name = type name ; } <SENTENCE_END/>

type

<SENTENCE_START> { this . type name = type name ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { this . type name = type name ; } <SENTENCE_END/>

name

<SENTENCE_START> { this . type name = type name ; } <SENTENCE_END/>

(Copy Probability: 72.5%)

<SENTENCE_START> { this . type name = type name ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . type name = type name ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { this . type name = type name ; } <SENTENCE_END/>


Original Name set,default,serializer

set

<SENTENCE_START> { this . default serializer = default serializer ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { this . default serializer = default serializer ; } <SENTENCE_END/>

default

<SENTENCE_START> { this . default serializer = default serializer ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { this . default serializer = default serializer ; } <SENTENCE_END/>

serializer

<SENTENCE_START> { this . default serializer = default serializer ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { this . default serializer = default serializer ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . default serializer = default serializer ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { this . default serializer = default serializer ; } <SENTENCE_END/>


Original Name set,serializer

set

<SENTENCE_START> { class to serializer . put ( type , serializer ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { class to serializer . put ( type , serializer ) ; } <SENTENCE_END/>

serializer

<SENTENCE_START> { class to serializer . put ( type , serializer ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { class to serializer . put ( type , serializer ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { class to serializer . put ( type , serializer ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { class to serializer . put ( type , serializer ) ; } <SENTENCE_END/>


Original Name get,serializer

get

<SENTENCE_START> { return class to serializer . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return class to serializer . get ( type ) ; } <SENTENCE_END/>

serializer

<SENTENCE_START> { return class to serializer . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return class to serializer . get ( type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return class to serializer . get ( type ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return class to serializer . get ( type ) ; } <SENTENCE_END/>


Original Name set,use,prototypes

set

<SENTENCE_START> { this . use prototypes = use prototypes ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { this . use prototypes = use prototypes ; } <SENTENCE_END/>

use

<SENTENCE_START> { this . use prototypes = use prototypes ; } <SENTENCE_END/>

(Copy Probability: 98.6%)

<SENTENCE_START> { this . use prototypes = use prototypes ; } <SENTENCE_END/>

prototypes

<SENTENCE_START> { this . use prototypes = use prototypes ; } <SENTENCE_END/>

(Copy Probability: 88.8%)

<SENTENCE_START> { this . use prototypes = use prototypes ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . use prototypes = use prototypes ; } <SENTENCE_END/>

(Copy Probability: 15.2%)

<SENTENCE_START> { this . use prototypes = use prototypes ; } <SENTENCE_END/>


Original Name set,element,type

set

<SENTENCE_START> { object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; metadata . element type = element type ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; metadata . element type = element type ; } <SENTENCE_END/>

element

<SENTENCE_START> { object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; metadata . element type = element type ; } <SENTENCE_END/>

(Copy Probability: 71.0%)

<SENTENCE_START> { object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; metadata . element type = element type ; } <SENTENCE_END/>

type

<SENTENCE_START> { object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; metadata . element type = element type ; } <SENTENCE_END/>

(Copy Probability: 68.1%)

<SENTENCE_START> { object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; metadata . element type = element type ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; metadata . element type = element type ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; metadata . element type = element type ; } <SENTENCE_END/>


Original Name get,fields

get

<SENTENCE_START> { ordered map < string , field metadata > fields = type to fields . get ( type ) ; if ( fields != null ) return fields ; array < class > class hierarchy = new array ( ) ; class next class = type ; while ( next class != object . class ) { class hierarchy . add ( next class ) ; next class = next class . get superclass ( ) ; } array list < field > all fields = new array list ( ) ; for ( int i = class hierarchy . size - 1 ; i >= 0 ; i -- ) collections . add all ( all fields , class reflection . get declared fields ( class hierarchy . get ( i ) ) ) ; ordered map < string , field metadata > name to field = new ordered map ( all fields . size ( ) ) ; for ( int i = 0 , n = all fields . size ( ) ; i < n ; i ++ ) { field field = all fields . get ( i ) ; if ( field . is transient ( ) ) continue ; if ( field . is static ( ) ) continue ; if ( field . is synthetic ( ) ) continue ; if ( ! field . is accessible ( ) ) { try { field . set accessible ( true ) ; } catch ( access control exception ex ) { continue ; } } name to field . put ( field . get name ( ) , new field metadata ( field ) ) ; } type to fields . put ( type , name to field ) ; return name to field ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { ordered map < string , field metadata > fields = type to fields . get ( type ) ; if ( fields != null ) return fields ; array < class > class hierarchy = new array ( ) ; class next class = type ; while ( next class != object . class ) { class hierarchy . add ( next class ) ; next class = next class . get superclass ( ) ; } array list < field > all fields = new array list ( ) ; for ( int i = class hierarchy . size - 1 ; i >= 0 ; i -- ) collections . add all ( all fields , class reflection . get declared fields ( class hierarchy . get ( i ) ) ) ; ordered map < string , field metadata > name to field = new ordered map ( all fields . size ( ) ) ; for ( int i = 0 , n = all fields . size ( ) ; i < n ; i ++ ) { field field = all fields . get ( i ) ; if ( field . is transient ( ) ) continue ; if ( field . is static ( ) ) continue ; if ( field . is synthetic ( ) ) continue ; if ( ! field . is accessible ( ) ) { try { field . set accessible ( true ) ; } catch ( access control exception ex ) { continue ; } } name to field . put ( field . get name ( ) , new field metadata ( field ) ) ; } type to fields . put ( type , name to field ) ; return name to field ; } <SENTENCE_END/>

fields

<SENTENCE_START> { ordered map < string , field metadata > fields = type to fields . get ( type ) ; if ( fields != null ) return fields ; array < class > class hierarchy = new array ( ) ; class next class = type ; while ( next class != object . class ) { class hierarchy . add ( next class ) ; next class = next class . get superclass ( ) ; } array list < field > all fields = new array list ( ) ; for ( int i = class hierarchy . size - 1 ; i >= 0 ; i -- ) collections . add all ( all fields , class reflection . get declared fields ( class hierarchy . get ( i ) ) ) ; ordered map < string , field metadata > name to field = new ordered map ( all fields . size ( ) ) ; for ( int i = 0 , n = all fields . size ( ) ; i < n ; i ++ ) { field field = all fields . get ( i ) ; if ( field . is transient ( ) ) continue ; if ( field . is static ( ) ) continue ; if ( field . is synthetic ( ) ) continue ; if ( ! field . is accessible ( ) ) { try { field . set accessible ( true ) ; } catch ( access control exception ex ) { continue ; } } name to field . put ( field . get name ( ) , new field metadata ( field ) ) ; } type to fields . put ( type , name to field ) ; return name to field ; } <SENTENCE_END/>

(Copy Probability: 40.2%)

<SENTENCE_START> { ordered map < string , field metadata > fields = type to fields . get ( type ) ; if ( fields != null ) return fields ; array < class > class hierarchy = new array ( ) ; class next class = type ; while ( next class != object . class ) { class hierarchy . add ( next class ) ; next class = next class . get superclass ( ) ; } array list < field > all fields = new array list ( ) ; for ( int i = class hierarchy . size - 1 ; i >= 0 ; i -- ) collections . add all ( all fields , class reflection . get declared fields ( class hierarchy . get ( i ) ) ) ; ordered map < string , field metadata > name to field = new ordered map ( all fields . size ( ) ) ; for ( int i = 0 , n = all fields . size ( ) ; i < n ; i ++ ) { field field = all fields . get ( i ) ; if ( field . is transient ( ) ) continue ; if ( field . is static ( ) ) continue ; if ( field . is synthetic ( ) ) continue ; if ( ! field . is accessible ( ) ) { try { field . set accessible ( true ) ; } catch ( access control exception ex ) { continue ; } } name to field . put ( field . get name ( ) , new field metadata ( field ) ) ; } type to fields . put ( type , name to field ) ; return name to field ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { ordered map < string , field metadata > fields = type to fields . get ( type ) ; if ( fields != null ) return fields ; array < class > class hierarchy = new array ( ) ; class next class = type ; while ( next class != object . class ) { class hierarchy . add ( next class ) ; next class = next class . get superclass ( ) ; } array list < field > all fields = new array list ( ) ; for ( int i = class hierarchy . size - 1 ; i >= 0 ; i -- ) collections . add all ( all fields , class reflection . get declared fields ( class hierarchy . get ( i ) ) ) ; ordered map < string , field metadata > name to field = new ordered map ( all fields . size ( ) ) ; for ( int i = 0 , n = all fields . size ( ) ; i < n ; i ++ ) { field field = all fields . get ( i ) ; if ( field . is transient ( ) ) continue ; if ( field . is static ( ) ) continue ; if ( field . is synthetic ( ) ) continue ; if ( ! field . is accessible ( ) ) { try { field . set accessible ( true ) ; } catch ( access control exception ex ) { continue ; } } name to field . put ( field . get name ( ) , new field metadata ( field ) ) ; } type to fields . put ( type , name to field ) ; return name to field ; } <SENTENCE_END/>

(Copy Probability: 39.2%)

<SENTENCE_START> { ordered map < string , field metadata > fields = type to fields . get ( type ) ; if ( fields != null ) return fields ; array < class > class hierarchy = new array ( ) ; class next class = type ; while ( next class != object . class ) { class hierarchy . add ( next class ) ; next class = next class . get superclass ( ) ; } array list < field > all fields = new array list ( ) ; for ( int i = class hierarchy . size - 1 ; i >= 0 ; i -- ) collections . add all ( all fields , class reflection . get declared fields ( class hierarchy . get ( i ) ) ) ; ordered map < string , field metadata > name to field = new ordered map ( all fields . size ( ) ) ; for ( int i = 0 , n = all fields . size ( ) ; i < n ; i ++ ) { field field = all fields . get ( i ) ; if ( field . is transient ( ) ) continue ; if ( field . is static ( ) ) continue ; if ( field . is synthetic ( ) ) continue ; if ( ! field . is accessible ( ) ) { try { field . set accessible ( true ) ; } catch ( access control exception ex ) { continue ; } } name to field . put ( field . get name ( ) , new field metadata ( field ) ) ; } type to fields . put ( type , name to field ) ; return name to field ; } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { return %SELF% ( object , object == null ? null : object . get class ( ) , ( class ) null ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return %SELF% ( object , object == null ? null : object . get class ( ) , ( class ) null ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return %SELF% ( object , object == null ? null : object . get class ( ) , ( class ) null ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { return %SELF% ( object , object == null ? null : object . get class ( ) , ( class ) null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( object , object == null ? null : object . get class ( ) , ( class ) null ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { return %SELF% ( object , object == null ? null : object . get class ( ) , ( class ) null ) ; } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { return %SELF% ( object , known type , ( class ) null ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return %SELF% ( object , known type , ( class ) null ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return %SELF% ( object , known type , ( class ) null ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return %SELF% ( object , known type , ( class ) null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( object , known type , ( class ) null ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return %SELF% ( object , known type , ( class ) null ) ; } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { string writer buffer = new string writer ( ) ; %SELF% ( object , known type , element type , buffer ) ; return buffer . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { string writer buffer = new string writer ( ) ; %SELF% ( object , known type , element type , buffer ) ; return buffer . to string ( ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { string writer buffer = new string writer ( ) ; %SELF% ( object , known type , element type , buffer ) ; return buffer . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { string writer buffer = new string writer ( ) ; %SELF% ( object , known type , element type , buffer ) ; return buffer . to string ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { string writer buffer = new string writer ( ) ; %SELF% ( object , known type , element type , buffer ) ; return buffer . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { string writer buffer = new string writer ( ) ; %SELF% ( object , known type , element type , buffer ) ; return buffer . to string ( ) ; } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , file ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , file ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , file ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , file ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , file ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , file ) ; } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { %SELF% ( object , known type , null , file ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( object , known type , null , file ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { %SELF% ( object , known type , null , file ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( object , known type , null , file ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , known type , null , file ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { %SELF% ( object , known type , null , file ) ; } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { writer writer = null ; try { writer = file . writer ( false , "UTF-8" ) ; %SELF% ( object , known type , element type , writer ) ; } catch ( exception ex ) { throw new serialization exception ( "Error writing file: " + file , ex ) ; } finally { stream utils . close quietly ( writer ) ; } } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { writer writer = null ; try { writer = file . writer ( false , "UTF-8" ) ; %SELF% ( object , known type , element type , writer ) ; } catch ( exception ex ) { throw new serialization exception ( "Error writing file: " + file , ex ) ; } finally { stream utils . close quietly ( writer ) ; } } <SENTENCE_END/>

json

<SENTENCE_START> { writer writer = null ; try { writer = file . writer ( false , "UTF-8" ) ; %SELF% ( object , known type , element type , writer ) ; } catch ( exception ex ) { throw new serialization exception ( "Error writing file: " + file , ex ) ; } finally { stream utils . close quietly ( writer ) ; } } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { writer writer = null ; try { writer = file . writer ( false , "UTF-8" ) ; %SELF% ( object , known type , element type , writer ) ; } catch ( exception ex ) { throw new serialization exception ( "Error writing file: " + file , ex ) ; } finally { stream utils . close quietly ( writer ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { writer writer = null ; try { writer = file . writer ( false , "UTF-8" ) ; %SELF% ( object , known type , element type , writer ) ; } catch ( exception ex ) { throw new serialization exception ( "Error writing file: " + file , ex ) ; } finally { stream utils . close quietly ( writer ) ; } } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { writer writer = null ; try { writer = file . writer ( false , "UTF-8" ) ; %SELF% ( object , known type , element type , writer ) ; } catch ( exception ex ) { throw new serialization exception ( "Error writing file: " + file , ex ) ; } finally { stream utils . close quietly ( writer ) ; } } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , writer ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , writer ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , writer ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , writer ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , writer ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { %SELF% ( object , object == null ? null : object . get class ( ) , null , writer ) ; } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { %SELF% ( object , known type , null , writer ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { %SELF% ( object , known type , null , writer ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { %SELF% ( object , known type , null , writer ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { %SELF% ( object , known type , null , writer ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , known type , null , writer ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { %SELF% ( object , known type , null , writer ) ; } <SENTENCE_END/>


Original Name to,json

to

<SENTENCE_START> { set writer ( writer ) ; try { write value ( object , known type , element type ) ; } finally { stream utils . close quietly ( this . writer ) ; this . writer = null ; } } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { set writer ( writer ) ; try { write value ( object , known type , element type ) ; } finally { stream utils . close quietly ( this . writer ) ; this . writer = null ; } } <SENTENCE_END/>

json

<SENTENCE_START> { set writer ( writer ) ; try { write value ( object , known type , element type ) ; } finally { stream utils . close quietly ( this . writer ) ; this . writer = null ; } } <SENTENCE_END/>

(Copy Probability: 5.6%)

<SENTENCE_START> { set writer ( writer ) ; try { write value ( object , known type , element type ) ; } finally { stream utils . close quietly ( this . writer ) ; this . writer = null ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { set writer ( writer ) ; try { write value ( object , known type , element type ) ; } finally { stream utils . close quietly ( this . writer ) ; this . writer = null ; } } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { set writer ( writer ) ; try { write value ( object , known type , element type ) ; } finally { stream utils . close quietly ( this . writer ) ; this . writer = null ; } } <SENTENCE_END/>


Original Name set,writer

set

<SENTENCE_START> { if ( ! ( writer instanceof json writer ) ) writer = new json writer ( writer ) ; this . writer = ( json writer ) writer ; this . writer . set output type ( output type ) ; this . writer . set quote long values ( quote long values ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { if ( ! ( writer instanceof json writer ) ) writer = new json writer ( writer ) ; this . writer = ( json writer ) writer ; this . writer . set output type ( output type ) ; this . writer . set quote long values ( quote long values ) ; } <SENTENCE_END/>

writer

<SENTENCE_START> { if ( ! ( writer instanceof json writer ) ) writer = new json writer ( writer ) ; this . writer = ( json writer ) writer ; this . writer . set output type ( output type ) ; this . writer . set quote long values ( quote long values ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { if ( ! ( writer instanceof json writer ) ) writer = new json writer ( writer ) ; this . writer = ( json writer ) writer ; this . writer . set output type ( output type ) ; this . writer . set quote long values ( quote long values ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! ( writer instanceof json writer ) ) writer = new json writer ( writer ) ; this . writer = ( json writer ) writer ; this . writer . set output type ( output type ) ; this . writer . set quote long values ( quote long values ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( ! ( writer instanceof json writer ) ) writer = new json writer ( writer ) ; this . writer = ( json writer ) writer ; this . writer . set output type ( output type ) ; this . writer . set quote long values ( quote long values ) ; } <SENTENCE_END/>


Original Name get,writer

get

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

(Copy Probability: 0.2%)

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

writer

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

(Copy Probability: 3.1%)

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

%END%

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

(Copy Probability: 0.2%)

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


Original Name write,fields

write

<SENTENCE_START> { class type = object . get class ( ) ; object [ ] default values = get default values ( type ) ; ordered map < string , field metadata > fields = get fields ( type ) ; int i = 0 ; for ( field metadata metadata : new ordered map values < field metadata > ( fields ) ) { field field = metadata . field ; try { object value = field . get ( object ) ; if ( default values != null ) { object default value = default values [ i ++ ] ; if ( value == null && default value == null ) continue ; if ( value != null && default value != null ) { if ( value . equals ( default value ) ) continue ; if ( value . get class ( ) . is array ( ) && default value . get class ( ) . is array ( ) ) { equals 1 [ 0 ] = value ; equals 2 [ 0 ] = default value ; if ( arrays . deep equals ( equals 1 , equals 2 ) ) continue ; } } } if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( field . get name ( ) ) ; write value ( value , field . get type ( ) , metadata . element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { class type = object . get class ( ) ; object [ ] default values = get default values ( type ) ; ordered map < string , field metadata > fields = get fields ( type ) ; int i = 0 ; for ( field metadata metadata : new ordered map values < field metadata > ( fields ) ) { field field = metadata . field ; try { object value = field . get ( object ) ; if ( default values != null ) { object default value = default values [ i ++ ] ; if ( value == null && default value == null ) continue ; if ( value != null && default value != null ) { if ( value . equals ( default value ) ) continue ; if ( value . get class ( ) . is array ( ) && default value . get class ( ) . is array ( ) ) { equals 1 [ 0 ] = value ; equals 2 [ 0 ] = default value ; if ( arrays . deep equals ( equals 1 , equals 2 ) ) continue ; } } } if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( field . get name ( ) ) ; write value ( value , field . get type ( ) , metadata . element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

fields

<SENTENCE_START> { class type = object . get class ( ) ; object [ ] default values = get default values ( type ) ; ordered map < string , field metadata > fields = get fields ( type ) ; int i = 0 ; for ( field metadata metadata : new ordered map values < field metadata > ( fields ) ) { field field = metadata . field ; try { object value = field . get ( object ) ; if ( default values != null ) { object default value = default values [ i ++ ] ; if ( value == null && default value == null ) continue ; if ( value != null && default value != null ) { if ( value . equals ( default value ) ) continue ; if ( value . get class ( ) . is array ( ) && default value . get class ( ) . is array ( ) ) { equals 1 [ 0 ] = value ; equals 2 [ 0 ] = default value ; if ( arrays . deep equals ( equals 1 , equals 2 ) ) continue ; } } } if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( field . get name ( ) ) ; write value ( value , field . get type ( ) , metadata . element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

(Copy Probability: 19.9%)

<SENTENCE_START> { class type = object . get class ( ) ; object [ ] default values = get default values ( type ) ; ordered map < string , field metadata > fields = get fields ( type ) ; int i = 0 ; for ( field metadata metadata : new ordered map values < field metadata > ( fields ) ) { field field = metadata . field ; try { object value = field . get ( object ) ; if ( default values != null ) { object default value = default values [ i ++ ] ; if ( value == null && default value == null ) continue ; if ( value != null && default value != null ) { if ( value . equals ( default value ) ) continue ; if ( value . get class ( ) . is array ( ) && default value . get class ( ) . is array ( ) ) { equals 1 [ 0 ] = value ; equals 2 [ 0 ] = default value ; if ( arrays . deep equals ( equals 1 , equals 2 ) ) continue ; } } } if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( field . get name ( ) ) ; write value ( value , field . get type ( ) , metadata . element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { class type = object . get class ( ) ; object [ ] default values = get default values ( type ) ; ordered map < string , field metadata > fields = get fields ( type ) ; int i = 0 ; for ( field metadata metadata : new ordered map values < field metadata > ( fields ) ) { field field = metadata . field ; try { object value = field . get ( object ) ; if ( default values != null ) { object default value = default values [ i ++ ] ; if ( value == null && default value == null ) continue ; if ( value != null && default value != null ) { if ( value . equals ( default value ) ) continue ; if ( value . get class ( ) . is array ( ) && default value . get class ( ) . is array ( ) ) { equals 1 [ 0 ] = value ; equals 2 [ 0 ] = default value ; if ( arrays . deep equals ( equals 1 , equals 2 ) ) continue ; } } } if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( field . get name ( ) ) ; write value ( value , field . get type ( ) , metadata . element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

(Copy Probability: 13.9%)

<SENTENCE_START> { class type = object . get class ( ) ; object [ ] default values = get default values ( type ) ; ordered map < string , field metadata > fields = get fields ( type ) ; int i = 0 ; for ( field metadata metadata : new ordered map values < field metadata > ( fields ) ) { field field = metadata . field ; try { object value = field . get ( object ) ; if ( default values != null ) { object default value = default values [ i ++ ] ; if ( value == null && default value == null ) continue ; if ( value != null && default value != null ) { if ( value . equals ( default value ) ) continue ; if ( value . get class ( ) . is array ( ) && default value . get class ( ) . is array ( ) ) { equals 1 [ 0 ] = value ; equals 2 [ 0 ] = default value ; if ( arrays . deep equals ( equals 1 , equals 2 ) ) continue ; } } } if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( field . get name ( ) ) ; write value ( value , field . get type ( ) , metadata . element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>


Original Name get,default,values

get

<SENTENCE_START> { if ( ! use prototypes ) return null ; if ( class to default values . contains key ( type ) ) return class to default values . get ( type ) ; object object ; try { object = new instance ( type ) ; } catch ( exception ex ) { class to default values . put ( type , null ) ; return null ; } object map < string , field metadata > fields = get fields ( type ) ; object [ ] values = new object [ fields . size ] ; class to default values . put ( type , values ) ; int i = 0 ; for ( field metadata metadata : fields . values ( ) ) { field field = metadata . field ; try { values [ i ++ ] = field . get ( object ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } return values ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { if ( ! use prototypes ) return null ; if ( class to default values . contains key ( type ) ) return class to default values . get ( type ) ; object object ; try { object = new instance ( type ) ; } catch ( exception ex ) { class to default values . put ( type , null ) ; return null ; } object map < string , field metadata > fields = get fields ( type ) ; object [ ] values = new object [ fields . size ] ; class to default values . put ( type , values ) ; int i = 0 ; for ( field metadata metadata : fields . values ( ) ) { field field = metadata . field ; try { values [ i ++ ] = field . get ( object ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } return values ; } <SENTENCE_END/>

default

<SENTENCE_START> { if ( ! use prototypes ) return null ; if ( class to default values . contains key ( type ) ) return class to default values . get ( type ) ; object object ; try { object = new instance ( type ) ; } catch ( exception ex ) { class to default values . put ( type , null ) ; return null ; } object map < string , field metadata > fields = get fields ( type ) ; object [ ] values = new object [ fields . size ] ; class to default values . put ( type , values ) ; int i = 0 ; for ( field metadata metadata : fields . values ( ) ) { field field = metadata . field ; try { values [ i ++ ] = field . get ( object ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } return values ; } <SENTENCE_END/>

(Copy Probability: 20.7%)

<SENTENCE_START> { if ( ! use prototypes ) return null ; if ( class to default values . contains key ( type ) ) return class to default values . get ( type ) ; object object ; try { object = new instance ( type ) ; } catch ( exception ex ) { class to default values . put ( type , null ) ; return null ; } object map < string , field metadata > fields = get fields ( type ) ; object [ ] values = new object [ fields . size ] ; class to default values . put ( type , values ) ; int i = 0 ; for ( field metadata metadata : fields . values ( ) ) { field field = metadata . field ; try { values [ i ++ ] = field . get ( object ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } return values ; } <SENTENCE_END/>

values

<SENTENCE_START> { if ( ! use prototypes ) return null ; if ( class to default values . contains key ( type ) ) return class to default values . get ( type ) ; object object ; try { object = new instance ( type ) ; } catch ( exception ex ) { class to default values . put ( type , null ) ; return null ; } object map < string , field metadata > fields = get fields ( type ) ; object [ ] values = new object [ fields . size ] ; class to default values . put ( type , values ) ; int i = 0 ; for ( field metadata metadata : fields . values ( ) ) { field field = metadata . field ; try { values [ i ++ ] = field . get ( object ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } return values ; } <SENTENCE_END/>

(Copy Probability: 22.6%)

<SENTENCE_START> { if ( ! use prototypes ) return null ; if ( class to default values . contains key ( type ) ) return class to default values . get ( type ) ; object object ; try { object = new instance ( type ) ; } catch ( exception ex ) { class to default values . put ( type , null ) ; return null ; } object map < string , field metadata > fields = get fields ( type ) ; object [ ] values = new object [ fields . size ] ; class to default values . put ( type , values ) ; int i = 0 ; for ( field metadata metadata : fields . values ( ) ) { field field = metadata . field ; try { values [ i ++ ] = field . get ( object ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } return values ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( ! use prototypes ) return null ; if ( class to default values . contains key ( type ) ) return class to default values . get ( type ) ; object object ; try { object = new instance ( type ) ; } catch ( exception ex ) { class to default values . put ( type , null ) ; return null ; } object map < string , field metadata > fields = get fields ( type ) ; object [ ] values = new object [ fields . size ] ; class to default values . put ( type , values ) ; int i = 0 ; for ( field metadata metadata : fields . values ( ) ) { field field = metadata . field ; try { values [ i ++ ] = field . get ( object ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } return values ; } <SENTENCE_END/>

(Copy Probability: 6.5%)

<SENTENCE_START> { if ( ! use prototypes ) return null ; if ( class to default values . contains key ( type ) ) return class to default values . get ( type ) ; object object ; try { object = new instance ( type ) ; } catch ( exception ex ) { class to default values . put ( type , null ) ; return null ; } object map < string , field metadata > fields = get fields ( type ) ; object [ ] values = new object [ fields . size ] ; class to default values . put ( type , values ) ; int i = 0 ; for ( field metadata metadata : fields . values ( ) ) { field field = metadata . field ; try { values [ i ++ ] = field . get ( object ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } return values ; } <SENTENCE_END/>


Original Name write,field

write

<SENTENCE_START> { %SELF% ( object , name , name , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { %SELF% ( object , name , name , null ) ; } <SENTENCE_END/>

field

<SENTENCE_START> { %SELF% ( object , name , name , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( object , name , name , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , name , name , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { %SELF% ( object , name , name , null ) ; } <SENTENCE_END/>


Original Name write,field

write

<SENTENCE_START> { %SELF% ( object , name , name , element type ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( object , name , name , element type ) ; } <SENTENCE_END/>

field

<SENTENCE_START> { %SELF% ( object , name , name , element type ) ; } <SENTENCE_END/>

(Copy Probability: 5.4%)

<SENTENCE_START> { %SELF% ( object , name , name , element type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , name , name , element type ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { %SELF% ( object , name , name , element type ) ; } <SENTENCE_END/>


Original Name write,field

write

<SENTENCE_START> { %SELF% ( object , field name , json name , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( object , field name , json name , null ) ; } <SENTENCE_END/>

field

<SENTENCE_START> { %SELF% ( object , field name , json name , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { %SELF% ( object , field name , json name , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , field name , json name , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { %SELF% ( object , field name , json name , null ) ; } <SENTENCE_END/>


Original Name write,field

write

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; try { if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( json name ) ; write value ( field . get ( object ) , field . get type ( ) , element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; try { if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( json name ) ; write value ( field . get ( object ) , field . get type ( ) , element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

field

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; try { if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( json name ) ; write value ( field . get ( object ) , field . get type ( ) , element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

(Copy Probability: 27.8%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; try { if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( json name ) ; write value ( field . get ( object ) , field . get type ( ) , element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; try { if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( json name ) ; write value ( field . get ( object ) , field . get type ( ) , element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

(Copy Probability: 23.9%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; try { if ( debug ) system . out . println ( "Writing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" ) ; writer . name ( json name ) ; write value ( field . get ( object ) , field . get type ( ) , element type ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( field + " (" + type . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>


Original Name write,value

write

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>


Original Name write,value

write

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , null ) ; } <SENTENCE_END/>


Original Name write,value

write

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , element type ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , element type ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , element type ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , element type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , element type ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( value , known type , element type ) ; } <SENTENCE_END/>


Original Name write,value

write

<SENTENCE_START> { if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { if ( value == null ) %SELF% ( value , null , null ) ; else %SELF% ( value , value . get class ( ) , null ) ; } <SENTENCE_END/>


Original Name write,value

write

<SENTENCE_START> { %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( value , known type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { %SELF% ( value , known type , null ) ; } <SENTENCE_END/>


Original Name write,value

write

<SENTENCE_START> { try { if ( value == null ) { writer . value ( null ) ; return ; } if ( ( known type != null && known type . is primitive ( ) ) || known type == string . class || known type == integer . class || known type == boolean . class || known type == float . class || known type == long . class || known type == double . class || known type == short . class || known type == byte . class || known type == character . class ) { writer . value ( value ) ; return ; } class actual type = value . get class ( ) ; if ( actual type . is primitive ( ) || actual type == string . class || actual type == integer . class || actual type == boolean . class || actual type == float . class || actual type == long . class || actual type == double . class || actual type == short . class || actual type == byte . class || actual type == character . class ) { write object start ( actual type , null ) ; %SELF% ( "value" , value ) ; write object end ( ) ; return ; } if ( value instanceof serializable ) { write object start ( actual type , known type ) ; ( ( serializable ) value ) . write ( this ) ; write object end ( ) ; return ; } serializer serializer = class to serializer . get ( actual type ) ; if ( serializer != null ) { serializer . write ( this , value , known type ) ; return ; } if ( value instanceof array ) { if ( known type != null && actual type != known type && actual type != array . class ) throw new serialization exception ( "Serialization of an Array other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; array array = ( array ) value ; for ( int i = 0 , n = array . size ; i < n ; i ++ ) %SELF% ( array . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof queue ) { if ( known type != null && actual type != known type && actual type != queue . class ) throw new serialization exception ( "Serialization of a Queue other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; queue queue = ( queue ) value ; for ( int i = 0 , n = queue . size ; i < n ; i ++ ) %SELF% ( queue . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof collection ) { if ( type name != null && actual type != array list . class && ( known type == null || known type != actual type ) ) { write object start ( actual type , known type ) ; write array start ( "items" ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; write object end ( ) ; } else { write array start ( ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; } return ; } if ( actual type . is array ( ) ) { if ( element type == null ) element type = actual type . get component type ( ) ; int length = array reflection . get length ( value ) ; write array start ( ) ; for ( int i = 0 ; i < length ; i ++ ) %SELF% ( array reflection . get ( value , i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof object map ) { if ( known type == null ) known type = object map . class ; write object start ( actual type , known type ) ; for ( entry entry : ( ( object map < ? , ? > ) value ) . entries ( ) ) { writer . name ( convert to string ( entry . key ) ) ; %SELF% ( entry . value , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof array map ) { if ( known type == null ) known type = array map . class ; write object start ( actual type , known type ) ; array map map = ( array map ) value ; for ( int i = 0 , n = map . size ; i < n ; i ++ ) { writer . name ( convert to string ( map . keys [ i ] ) ) ; %SELF% ( map . values [ i ] , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof map ) { if ( known type == null ) known type = hash map . class ; write object start ( actual type , known type ) ; for ( map . entry entry : ( ( map < ? , ? > ) value ) . entry set ( ) ) { writer . name ( convert to string ( entry . get key ( ) ) ) ; %SELF% ( entry . get value ( ) , element type , null ) ; } write object end ( ) ; return ; } if ( class reflection . is assignable from ( enum . class , actual type ) ) { if ( type name != null && ( known type == null || known type != actual type ) ) { if ( actual type . get enum constants ( ) == null ) actual type = actual type . get superclass ( ) ; write object start ( actual type , null ) ; writer . name ( "value" ) ; writer . value ( convert to string ( ( enum ) value ) ) ; write object end ( ) ; } else { writer . value ( convert to string ( ( enum ) value ) ) ; } return ; } write object start ( actual type , known type ) ; write fields ( value ) ; write object end ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { try { if ( value == null ) { writer . value ( null ) ; return ; } if ( ( known type != null && known type . is primitive ( ) ) || known type == string . class || known type == integer . class || known type == boolean . class || known type == float . class || known type == long . class || known type == double . class || known type == short . class || known type == byte . class || known type == character . class ) { writer . value ( value ) ; return ; } class actual type = value . get class ( ) ; if ( actual type . is primitive ( ) || actual type == string . class || actual type == integer . class || actual type == boolean . class || actual type == float . class || actual type == long . class || actual type == double . class || actual type == short . class || actual type == byte . class || actual type == character . class ) { write object start ( actual type , null ) ; %SELF% ( "value" , value ) ; write object end ( ) ; return ; } if ( value instanceof serializable ) { write object start ( actual type , known type ) ; ( ( serializable ) value ) . write ( this ) ; write object end ( ) ; return ; } serializer serializer = class to serializer . get ( actual type ) ; if ( serializer != null ) { serializer . write ( this , value , known type ) ; return ; } if ( value instanceof array ) { if ( known type != null && actual type != known type && actual type != array . class ) throw new serialization exception ( "Serialization of an Array other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; array array = ( array ) value ; for ( int i = 0 , n = array . size ; i < n ; i ++ ) %SELF% ( array . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof queue ) { if ( known type != null && actual type != known type && actual type != queue . class ) throw new serialization exception ( "Serialization of a Queue other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; queue queue = ( queue ) value ; for ( int i = 0 , n = queue . size ; i < n ; i ++ ) %SELF% ( queue . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof collection ) { if ( type name != null && actual type != array list . class && ( known type == null || known type != actual type ) ) { write object start ( actual type , known type ) ; write array start ( "items" ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; write object end ( ) ; } else { write array start ( ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; } return ; } if ( actual type . is array ( ) ) { if ( element type == null ) element type = actual type . get component type ( ) ; int length = array reflection . get length ( value ) ; write array start ( ) ; for ( int i = 0 ; i < length ; i ++ ) %SELF% ( array reflection . get ( value , i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof object map ) { if ( known type == null ) known type = object map . class ; write object start ( actual type , known type ) ; for ( entry entry : ( ( object map < ? , ? > ) value ) . entries ( ) ) { writer . name ( convert to string ( entry . key ) ) ; %SELF% ( entry . value , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof array map ) { if ( known type == null ) known type = array map . class ; write object start ( actual type , known type ) ; array map map = ( array map ) value ; for ( int i = 0 , n = map . size ; i < n ; i ++ ) { writer . name ( convert to string ( map . keys [ i ] ) ) ; %SELF% ( map . values [ i ] , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof map ) { if ( known type == null ) known type = hash map . class ; write object start ( actual type , known type ) ; for ( map . entry entry : ( ( map < ? , ? > ) value ) . entry set ( ) ) { writer . name ( convert to string ( entry . get key ( ) ) ) ; %SELF% ( entry . get value ( ) , element type , null ) ; } write object end ( ) ; return ; } if ( class reflection . is assignable from ( enum . class , actual type ) ) { if ( type name != null && ( known type == null || known type != actual type ) ) { if ( actual type . get enum constants ( ) == null ) actual type = actual type . get superclass ( ) ; write object start ( actual type , null ) ; writer . name ( "value" ) ; writer . value ( convert to string ( ( enum ) value ) ) ; write object end ( ) ; } else { writer . value ( convert to string ( ( enum ) value ) ) ; } return ; } write object start ( actual type , known type ) ; write fields ( value ) ; write object end ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

value

<SENTENCE_START> { try { if ( value == null ) { writer . value ( null ) ; return ; } if ( ( known type != null && known type . is primitive ( ) ) || known type == string . class || known type == integer . class || known type == boolean . class || known type == float . class || known type == long . class || known type == double . class || known type == short . class || known type == byte . class || known type == character . class ) { writer . value ( value ) ; return ; } class actual type = value . get class ( ) ; if ( actual type . is primitive ( ) || actual type == string . class || actual type == integer . class || actual type == boolean . class || actual type == float . class || actual type == long . class || actual type == double . class || actual type == short . class || actual type == byte . class || actual type == character . class ) { write object start ( actual type , null ) ; %SELF% ( "value" , value ) ; write object end ( ) ; return ; } if ( value instanceof serializable ) { write object start ( actual type , known type ) ; ( ( serializable ) value ) . write ( this ) ; write object end ( ) ; return ; } serializer serializer = class to serializer . get ( actual type ) ; if ( serializer != null ) { serializer . write ( this , value , known type ) ; return ; } if ( value instanceof array ) { if ( known type != null && actual type != known type && actual type != array . class ) throw new serialization exception ( "Serialization of an Array other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; array array = ( array ) value ; for ( int i = 0 , n = array . size ; i < n ; i ++ ) %SELF% ( array . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof queue ) { if ( known type != null && actual type != known type && actual type != queue . class ) throw new serialization exception ( "Serialization of a Queue other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; queue queue = ( queue ) value ; for ( int i = 0 , n = queue . size ; i < n ; i ++ ) %SELF% ( queue . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof collection ) { if ( type name != null && actual type != array list . class && ( known type == null || known type != actual type ) ) { write object start ( actual type , known type ) ; write array start ( "items" ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; write object end ( ) ; } else { write array start ( ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; } return ; } if ( actual type . is array ( ) ) { if ( element type == null ) element type = actual type . get component type ( ) ; int length = array reflection . get length ( value ) ; write array start ( ) ; for ( int i = 0 ; i < length ; i ++ ) %SELF% ( array reflection . get ( value , i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof object map ) { if ( known type == null ) known type = object map . class ; write object start ( actual type , known type ) ; for ( entry entry : ( ( object map < ? , ? > ) value ) . entries ( ) ) { writer . name ( convert to string ( entry . key ) ) ; %SELF% ( entry . value , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof array map ) { if ( known type == null ) known type = array map . class ; write object start ( actual type , known type ) ; array map map = ( array map ) value ; for ( int i = 0 , n = map . size ; i < n ; i ++ ) { writer . name ( convert to string ( map . keys [ i ] ) ) ; %SELF% ( map . values [ i ] , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof map ) { if ( known type == null ) known type = hash map . class ; write object start ( actual type , known type ) ; for ( map . entry entry : ( ( map < ? , ? > ) value ) . entry set ( ) ) { writer . name ( convert to string ( entry . get key ( ) ) ) ; %SELF% ( entry . get value ( ) , element type , null ) ; } write object end ( ) ; return ; } if ( class reflection . is assignable from ( enum . class , actual type ) ) { if ( type name != null && ( known type == null || known type != actual type ) ) { if ( actual type . get enum constants ( ) == null ) actual type = actual type . get superclass ( ) ; write object start ( actual type , null ) ; writer . name ( "value" ) ; writer . value ( convert to string ( ( enum ) value ) ) ; write object end ( ) ; } else { writer . value ( convert to string ( ( enum ) value ) ) ; } return ; } write object start ( actual type , known type ) ; write fields ( value ) ; write object end ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 5.4%)

<SENTENCE_START> { try { if ( value == null ) { writer . value ( null ) ; return ; } if ( ( known type != null && known type . is primitive ( ) ) || known type == string . class || known type == integer . class || known type == boolean . class || known type == float . class || known type == long . class || known type == double . class || known type == short . class || known type == byte . class || known type == character . class ) { writer . value ( value ) ; return ; } class actual type = value . get class ( ) ; if ( actual type . is primitive ( ) || actual type == string . class || actual type == integer . class || actual type == boolean . class || actual type == float . class || actual type == long . class || actual type == double . class || actual type == short . class || actual type == byte . class || actual type == character . class ) { write object start ( actual type , null ) ; %SELF% ( "value" , value ) ; write object end ( ) ; return ; } if ( value instanceof serializable ) { write object start ( actual type , known type ) ; ( ( serializable ) value ) . write ( this ) ; write object end ( ) ; return ; } serializer serializer = class to serializer . get ( actual type ) ; if ( serializer != null ) { serializer . write ( this , value , known type ) ; return ; } if ( value instanceof array ) { if ( known type != null && actual type != known type && actual type != array . class ) throw new serialization exception ( "Serialization of an Array other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; array array = ( array ) value ; for ( int i = 0 , n = array . size ; i < n ; i ++ ) %SELF% ( array . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof queue ) { if ( known type != null && actual type != known type && actual type != queue . class ) throw new serialization exception ( "Serialization of a Queue other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; queue queue = ( queue ) value ; for ( int i = 0 , n = queue . size ; i < n ; i ++ ) %SELF% ( queue . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof collection ) { if ( type name != null && actual type != array list . class && ( known type == null || known type != actual type ) ) { write object start ( actual type , known type ) ; write array start ( "items" ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; write object end ( ) ; } else { write array start ( ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; } return ; } if ( actual type . is array ( ) ) { if ( element type == null ) element type = actual type . get component type ( ) ; int length = array reflection . get length ( value ) ; write array start ( ) ; for ( int i = 0 ; i < length ; i ++ ) %SELF% ( array reflection . get ( value , i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof object map ) { if ( known type == null ) known type = object map . class ; write object start ( actual type , known type ) ; for ( entry entry : ( ( object map < ? , ? > ) value ) . entries ( ) ) { writer . name ( convert to string ( entry . key ) ) ; %SELF% ( entry . value , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof array map ) { if ( known type == null ) known type = array map . class ; write object start ( actual type , known type ) ; array map map = ( array map ) value ; for ( int i = 0 , n = map . size ; i < n ; i ++ ) { writer . name ( convert to string ( map . keys [ i ] ) ) ; %SELF% ( map . values [ i ] , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof map ) { if ( known type == null ) known type = hash map . class ; write object start ( actual type , known type ) ; for ( map . entry entry : ( ( map < ? , ? > ) value ) . entry set ( ) ) { writer . name ( convert to string ( entry . get key ( ) ) ) ; %SELF% ( entry . get value ( ) , element type , null ) ; } write object end ( ) ; return ; } if ( class reflection . is assignable from ( enum . class , actual type ) ) { if ( type name != null && ( known type == null || known type != actual type ) ) { if ( actual type . get enum constants ( ) == null ) actual type = actual type . get superclass ( ) ; write object start ( actual type , null ) ; writer . name ( "value" ) ; writer . value ( convert to string ( ( enum ) value ) ) ; write object end ( ) ; } else { writer . value ( convert to string ( ( enum ) value ) ) ; } return ; } write object start ( actual type , known type ) ; write fields ( value ) ; write object end ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { if ( value == null ) { writer . value ( null ) ; return ; } if ( ( known type != null && known type . is primitive ( ) ) || known type == string . class || known type == integer . class || known type == boolean . class || known type == float . class || known type == long . class || known type == double . class || known type == short . class || known type == byte . class || known type == character . class ) { writer . value ( value ) ; return ; } class actual type = value . get class ( ) ; if ( actual type . is primitive ( ) || actual type == string . class || actual type == integer . class || actual type == boolean . class || actual type == float . class || actual type == long . class || actual type == double . class || actual type == short . class || actual type == byte . class || actual type == character . class ) { write object start ( actual type , null ) ; %SELF% ( "value" , value ) ; write object end ( ) ; return ; } if ( value instanceof serializable ) { write object start ( actual type , known type ) ; ( ( serializable ) value ) . write ( this ) ; write object end ( ) ; return ; } serializer serializer = class to serializer . get ( actual type ) ; if ( serializer != null ) { serializer . write ( this , value , known type ) ; return ; } if ( value instanceof array ) { if ( known type != null && actual type != known type && actual type != array . class ) throw new serialization exception ( "Serialization of an Array other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; array array = ( array ) value ; for ( int i = 0 , n = array . size ; i < n ; i ++ ) %SELF% ( array . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof queue ) { if ( known type != null && actual type != known type && actual type != queue . class ) throw new serialization exception ( "Serialization of a Queue other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; queue queue = ( queue ) value ; for ( int i = 0 , n = queue . size ; i < n ; i ++ ) %SELF% ( queue . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof collection ) { if ( type name != null && actual type != array list . class && ( known type == null || known type != actual type ) ) { write object start ( actual type , known type ) ; write array start ( "items" ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; write object end ( ) ; } else { write array start ( ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; } return ; } if ( actual type . is array ( ) ) { if ( element type == null ) element type = actual type . get component type ( ) ; int length = array reflection . get length ( value ) ; write array start ( ) ; for ( int i = 0 ; i < length ; i ++ ) %SELF% ( array reflection . get ( value , i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof object map ) { if ( known type == null ) known type = object map . class ; write object start ( actual type , known type ) ; for ( entry entry : ( ( object map < ? , ? > ) value ) . entries ( ) ) { writer . name ( convert to string ( entry . key ) ) ; %SELF% ( entry . value , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof array map ) { if ( known type == null ) known type = array map . class ; write object start ( actual type , known type ) ; array map map = ( array map ) value ; for ( int i = 0 , n = map . size ; i < n ; i ++ ) { writer . name ( convert to string ( map . keys [ i ] ) ) ; %SELF% ( map . values [ i ] , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof map ) { if ( known type == null ) known type = hash map . class ; write object start ( actual type , known type ) ; for ( map . entry entry : ( ( map < ? , ? > ) value ) . entry set ( ) ) { writer . name ( convert to string ( entry . get key ( ) ) ) ; %SELF% ( entry . get value ( ) , element type , null ) ; } write object end ( ) ; return ; } if ( class reflection . is assignable from ( enum . class , actual type ) ) { if ( type name != null && ( known type == null || known type != actual type ) ) { if ( actual type . get enum constants ( ) == null ) actual type = actual type . get superclass ( ) ; write object start ( actual type , null ) ; writer . name ( "value" ) ; writer . value ( convert to string ( ( enum ) value ) ) ; write object end ( ) ; } else { writer . value ( convert to string ( ( enum ) value ) ) ; } return ; } write object start ( actual type , known type ) ; write fields ( value ) ; write object end ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 5.1%)

<SENTENCE_START> { try { if ( value == null ) { writer . value ( null ) ; return ; } if ( ( known type != null && known type . is primitive ( ) ) || known type == string . class || known type == integer . class || known type == boolean . class || known type == float . class || known type == long . class || known type == double . class || known type == short . class || known type == byte . class || known type == character . class ) { writer . value ( value ) ; return ; } class actual type = value . get class ( ) ; if ( actual type . is primitive ( ) || actual type == string . class || actual type == integer . class || actual type == boolean . class || actual type == float . class || actual type == long . class || actual type == double . class || actual type == short . class || actual type == byte . class || actual type == character . class ) { write object start ( actual type , null ) ; %SELF% ( "value" , value ) ; write object end ( ) ; return ; } if ( value instanceof serializable ) { write object start ( actual type , known type ) ; ( ( serializable ) value ) . write ( this ) ; write object end ( ) ; return ; } serializer serializer = class to serializer . get ( actual type ) ; if ( serializer != null ) { serializer . write ( this , value , known type ) ; return ; } if ( value instanceof array ) { if ( known type != null && actual type != known type && actual type != array . class ) throw new serialization exception ( "Serialization of an Array other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; array array = ( array ) value ; for ( int i = 0 , n = array . size ; i < n ; i ++ ) %SELF% ( array . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof queue ) { if ( known type != null && actual type != known type && actual type != queue . class ) throw new serialization exception ( "Serialization of a Queue other than the known type is not supported. " + "Known type: " + known type + " Actual type: " + actual type ) ; write array start ( ) ; queue queue = ( queue ) value ; for ( int i = 0 , n = queue . size ; i < n ; i ++ ) %SELF% ( queue . get ( i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof collection ) { if ( type name != null && actual type != array list . class && ( known type == null || known type != actual type ) ) { write object start ( actual type , known type ) ; write array start ( "items" ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; write object end ( ) ; } else { write array start ( ) ; for ( object item : ( collection ) value ) %SELF% ( item , element type , null ) ; write array end ( ) ; } return ; } if ( actual type . is array ( ) ) { if ( element type == null ) element type = actual type . get component type ( ) ; int length = array reflection . get length ( value ) ; write array start ( ) ; for ( int i = 0 ; i < length ; i ++ ) %SELF% ( array reflection . get ( value , i ) , element type , null ) ; write array end ( ) ; return ; } if ( value instanceof object map ) { if ( known type == null ) known type = object map . class ; write object start ( actual type , known type ) ; for ( entry entry : ( ( object map < ? , ? > ) value ) . entries ( ) ) { writer . name ( convert to string ( entry . key ) ) ; %SELF% ( entry . value , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof array map ) { if ( known type == null ) known type = array map . class ; write object start ( actual type , known type ) ; array map map = ( array map ) value ; for ( int i = 0 , n = map . size ; i < n ; i ++ ) { writer . name ( convert to string ( map . keys [ i ] ) ) ; %SELF% ( map . values [ i ] , element type , null ) ; } write object end ( ) ; return ; } if ( value instanceof map ) { if ( known type == null ) known type = hash map . class ; write object start ( actual type , known type ) ; for ( map . entry entry : ( ( map < ? , ? > ) value ) . entry set ( ) ) { writer . name ( convert to string ( entry . get key ( ) ) ) ; %SELF% ( entry . get value ( ) , element type , null ) ; } write object end ( ) ; return ; } if ( class reflection . is assignable from ( enum . class , actual type ) ) { if ( type name != null && ( known type == null || known type != actual type ) ) { if ( actual type . get enum constants ( ) == null ) actual type = actual type . get superclass ( ) ; write object start ( actual type , null ) ; writer . name ( "value" ) ; writer . value ( convert to string ( ( enum ) value ) ) ; write object end ( ) ; } else { writer . value ( convert to string ( ( enum ) value ) ) ; } return ; } write object start ( actual type , known type ) ; write fields ( value ) ; write object end ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>


Original Name write,object,start

write

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( ) ; } <SENTENCE_END/>

object

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( ) ; } <SENTENCE_END/>

start

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( ) ; } <SENTENCE_END/>


Original Name write,object,start

write

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( actual type , known type ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( actual type , known type ) ; } <SENTENCE_END/>

object

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( actual type , known type ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( actual type , known type ) ; } <SENTENCE_END/>

start

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( actual type , known type ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( actual type , known type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( actual type , known type ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { try { writer . name ( name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } %SELF% ( actual type , known type ) ; } <SENTENCE_END/>


Original Name write,object,start

write

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

object

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

start

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>


Original Name write,object,start

write

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( known type == null || known type != actual type ) write type ( actual type ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( known type == null || known type != actual type ) write type ( actual type ) ; } <SENTENCE_END/>

object

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( known type == null || known type != actual type ) write type ( actual type ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( known type == null || known type != actual type ) write type ( actual type ) ; } <SENTENCE_END/>

start

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( known type == null || known type != actual type ) write type ( actual type ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( known type == null || known type != actual type ) write type ( actual type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( known type == null || known type != actual type ) write type ( actual type ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { try { writer . object ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( known type == null || known type != actual type ) write type ( actual type ) ; } <SENTENCE_END/>


Original Name write,object,end

write

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

object

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

end

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>


Original Name write,array,start

write

<SENTENCE_START> { try { writer . name ( name ) ; writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { try { writer . name ( name ) ; writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

array

<SENTENCE_START> { try { writer . name ( name ) ; writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { try { writer . name ( name ) ; writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

start

<SENTENCE_START> { try { writer . name ( name ) ; writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { try { writer . name ( name ) ; writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . name ( name ) ; writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { try { writer . name ( name ) ; writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>


Original Name write,array,start

write

<SENTENCE_START> { try { writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { try { writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

array

<SENTENCE_START> { try { writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { try { writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

start

<SENTENCE_START> { try { writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { try { writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { try { writer . array ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>


Original Name write,array,end

write

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

array

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

end

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { try { writer . pop ( ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } } <SENTENCE_END/>


Original Name write,type

write

<SENTENCE_START> { if ( type name == null ) return ; string class name = get tag ( type ) ; if ( class name == null ) class name = type . get name ( ) ; try { writer . set ( type name , class name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( debug ) system . out . println ( "Writing type: " + type . get name ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { if ( type name == null ) return ; string class name = get tag ( type ) ; if ( class name == null ) class name = type . get name ( ) ; try { writer . set ( type name , class name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( debug ) system . out . println ( "Writing type: " + type . get name ( ) ) ; } <SENTENCE_END/>

type

<SENTENCE_START> { if ( type name == null ) return ; string class name = get tag ( type ) ; if ( class name == null ) class name = type . get name ( ) ; try { writer . set ( type name , class name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( debug ) system . out . println ( "Writing type: " + type . get name ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 32.6%)

<SENTENCE_START> { if ( type name == null ) return ; string class name = get tag ( type ) ; if ( class name == null ) class name = type . get name ( ) ; try { writer . set ( type name , class name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( debug ) system . out . println ( "Writing type: " + type . get name ( ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( type name == null ) return ; string class name = get tag ( type ) ; if ( class name == null ) class name = type . get name ( ) ; try { writer . set ( type name , class name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( debug ) system . out . println ( "Writing type: " + type . get name ( ) ) ; } <SENTENCE_END/>

(Copy Probability: 18.2%)

<SENTENCE_START> { if ( type name == null ) return ; string class name = get tag ( type ) ; if ( class name == null ) class name = type . get name ( ) ; try { writer . set ( type name , class name ) ; } catch ( io exception ex ) { throw new serialization exception ( ex ) ; } if ( debug ) system . out . println ( "Writing type: " + type . get name ( ) ) ; } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( reader ) ) ; } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( input ) ) ; } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { try { return ( t ) read value ( type , null , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { try { return ( t ) read value ( type , null , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

json

<SENTENCE_START> { try { return ( t ) read value ( type , null , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { try { return ( t ) read value ( type , null , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { return ( t ) read value ( type , null , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { try { return ( t ) read value ( type , null , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { try { return ( t ) read value ( type , element type , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { try { return ( t ) read value ( type , element type , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

json

<SENTENCE_START> { try { return ( t ) read value ( type , element type , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { try { return ( t ) read value ( type , element type , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { return ( t ) read value ( type , element type , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { try { return ( t ) read value ( type , element type , new json reader ( ) . parse ( file ) ) ; } catch ( exception ex ) { throw new serialization exception ( "Error reading file: " + file , ex ) ; } } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( data , offset , length ) ) ; } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return ( t ) read value ( type , null , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>


Original Name from,json

from

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

json

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return ( t ) read value ( type , element type , new json reader ( ) . parse ( json ) ) ; } <SENTENCE_END/>


Original Name read,field

read

<SENTENCE_START> { %SELF% ( object , name , name , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( object , name , name , null , json data ) ; } <SENTENCE_END/>

field

<SENTENCE_START> { %SELF% ( object , name , name , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { %SELF% ( object , name , name , null , json data ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , name , name , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { %SELF% ( object , name , name , null , json data ) ; } <SENTENCE_END/>


Original Name read,field

read

<SENTENCE_START> { %SELF% ( object , name , name , element type , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( object , name , name , element type , json data ) ; } <SENTENCE_END/>

field

<SENTENCE_START> { %SELF% ( object , name , name , element type , json data ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { %SELF% ( object , name , name , element type , json data ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , name , name , element type , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( object , name , name , element type , json data ) ; } <SENTENCE_END/>


Original Name read,field

read

<SENTENCE_START> { %SELF% ( object , field name , json name , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { %SELF% ( object , field name , json name , null , json data ) ; } <SENTENCE_END/>

field

<SENTENCE_START> { %SELF% ( object , field name , json name , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { %SELF% ( object , field name , json name , null , json data ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( object , field name , json name , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { %SELF% ( object , field name , json name , null , json data ) ; } <SENTENCE_END/>


Original Name read,field

read

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; %SELF% ( object , field , json name , element type , json map ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; %SELF% ( object , field , json name , element type , json map ) ; } <SENTENCE_END/>

field

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; %SELF% ( object , field , json name , element type , json map ) ; } <SENTENCE_END/>

(Copy Probability: 71.7%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; %SELF% ( object , field , json name , element type , json map ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; %SELF% ( object , field , json name , element type , json map ) ; } <SENTENCE_END/>

(Copy Probability: 30.0%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; field metadata metadata = fields . get ( field name ) ; if ( metadata == null ) throw new serialization exception ( "Field not found: " + field name + " (" + type . get name ( ) + ")" ) ; field field = metadata . field ; if ( element type == null ) element type = metadata . element type ; %SELF% ( object , field , json name , element type , json map ) ; } <SENTENCE_END/>


Original Name read,field

read

<SENTENCE_START> { json value json value = json map . get ( json name ) ; if ( json value == null ) return ; try { field . set ( object , read value ( field . get type ( ) , element type , json value ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( json value . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { json value json value = json map . get ( json name ) ; if ( json value == null ) return ; try { field . set ( object , read value ( field . get type ( ) , element type , json value ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( json value . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

field

<SENTENCE_START> { json value json value = json map . get ( json name ) ; if ( json value == null ) return ; try { field . set ( object , read value ( field . get type ( ) , element type , json value ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( json value . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

(Copy Probability: 7.3%)

<SENTENCE_START> { json value json value = json map . get ( json name ) ; if ( json value == null ) return ; try { field . set ( object , read value ( field . get type ( ) , element type , json value ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( json value . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { json value json value = json map . get ( json name ) ; if ( json value == null ) return ; try { field . set ( object , read value ( field . get type ( ) , element type , json value ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( json value . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { json value json value = json map . get ( json name ) ; if ( json value == null ) return ; try { field . set ( object , read value ( field . get type ( ) , element type , json value ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( json value . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + field . get declaring class ( ) . get name ( ) + ")" ) ; throw ex ; } } <SENTENCE_END/>


Original Name read,fields

read

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; for ( json value child = json map . child ; child != null ; child = child . next ) { field metadata metadata = fields . get ( child . name ( ) ) ; if ( metadata == null ) { if ( ignore unknown fields ) { if ( debug ) system . out . println ( "Ignoring unknown field: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; continue ; } else { serialization exception ex = new serialization exception ( "Field not found: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; ex . add trace ( child . trace ( ) ) ; throw ex ; } } field field = metadata . field ; try { field . set ( object , read value ( field . get type ( ) , metadata . element type , child ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( child . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; for ( json value child = json map . child ; child != null ; child = child . next ) { field metadata metadata = fields . get ( child . name ( ) ) ; if ( metadata == null ) { if ( ignore unknown fields ) { if ( debug ) system . out . println ( "Ignoring unknown field: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; continue ; } else { serialization exception ex = new serialization exception ( "Field not found: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; ex . add trace ( child . trace ( ) ) ; throw ex ; } } field field = metadata . field ; try { field . set ( object , read value ( field . get type ( ) , metadata . element type , child ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( child . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

fields

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; for ( json value child = json map . child ; child != null ; child = child . next ) { field metadata metadata = fields . get ( child . name ( ) ) ; if ( metadata == null ) { if ( ignore unknown fields ) { if ( debug ) system . out . println ( "Ignoring unknown field: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; continue ; } else { serialization exception ex = new serialization exception ( "Field not found: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; ex . add trace ( child . trace ( ) ) ; throw ex ; } } field field = metadata . field ; try { field . set ( object , read value ( field . get type ( ) , metadata . element type , child ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( child . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

(Copy Probability: 21.9%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; for ( json value child = json map . child ; child != null ; child = child . next ) { field metadata metadata = fields . get ( child . name ( ) ) ; if ( metadata == null ) { if ( ignore unknown fields ) { if ( debug ) system . out . println ( "Ignoring unknown field: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; continue ; } else { serialization exception ex = new serialization exception ( "Field not found: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; ex . add trace ( child . trace ( ) ) ; throw ex ; } } field field = metadata . field ; try { field . set ( object , read value ( field . get type ( ) , metadata . element type , child ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( child . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; for ( json value child = json map . child ; child != null ; child = child . next ) { field metadata metadata = fields . get ( child . name ( ) ) ; if ( metadata == null ) { if ( ignore unknown fields ) { if ( debug ) system . out . println ( "Ignoring unknown field: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; continue ; } else { serialization exception ex = new serialization exception ( "Field not found: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; ex . add trace ( child . trace ( ) ) ; throw ex ; } } field field = metadata . field ; try { field . set ( object , read value ( field . get type ( ) , metadata . element type , child ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( child . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>

(Copy Probability: 7.3%)

<SENTENCE_START> { class type = object . get class ( ) ; object map < string , field metadata > fields = get fields ( type ) ; for ( json value child = json map . child ; child != null ; child = child . next ) { field metadata metadata = fields . get ( child . name ( ) ) ; if ( metadata == null ) { if ( ignore unknown fields ) { if ( debug ) system . out . println ( "Ignoring unknown field: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; continue ; } else { serialization exception ex = new serialization exception ( "Field not found: " + child . name ( ) + " (" + type . get name ( ) + ")" ) ; ex . add trace ( child . trace ( ) ) ; throw ex ; } } field field = metadata . field ; try { field . set ( object , read value ( field . get type ( ) , metadata . element type , child ) ) ; } catch ( reflection exception ex ) { throw new serialization exception ( "Error accessing field: " + field . get name ( ) + " (" + type . get name ( ) + ")" , ex ) ; } catch ( serialization exception ex ) { ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } catch ( runtime exception runtime ex ) { serialization exception ex = new serialization exception ( runtime ex ) ; ex . add trace ( child . trace ( ) ) ; ex . add trace ( field . get name ( ) + " (" + type . get name ( ) + ")" ) ; throw ex ; } } } <SENTENCE_END/>


Original Name read,value

read

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json map . get ( name ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json map . get ( name ) ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json map . get ( name ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json map . get ( name ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json map . get ( name ) ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json map . get ( name ) ) ; } <SENTENCE_END/>


Original Name read,value

read

<SENTENCE_START> { json value json value = json map . get ( name ) ; if ( json value == null ) return default value ; return ( t ) %SELF% ( type , null , json value ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { json value json value = json map . get ( name ) ; if ( json value == null ) return default value ; return ( t ) %SELF% ( type , null , json value ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { json value json value = json map . get ( name ) ; if ( json value == null ) return default value ; return ( t ) %SELF% ( type , null , json value ) ; } <SENTENCE_END/>

(Copy Probability: 7.0%)

<SENTENCE_START> { json value json value = json map . get ( name ) ; if ( json value == null ) return default value ; return ( t ) %SELF% ( type , null , json value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { json value json value = json map . get ( name ) ; if ( json value == null ) return default value ; return ( t ) %SELF% ( type , null , json value ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { json value json value = json map . get ( name ) ; if ( json value == null ) return default value ; return ( t ) %SELF% ( type , null , json value ) ; } <SENTENCE_END/>


Original Name read,value

read

<SENTENCE_START> { return ( t ) %SELF% ( type , element type , json map . get ( name ) ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return ( t ) %SELF% ( type , element type , json map . get ( name ) ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { return ( t ) %SELF% ( type , element type , json map . get ( name ) ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return ( t ) %SELF% ( type , element type , json map . get ( name ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) %SELF% ( type , element type , json map . get ( name ) ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return ( t ) %SELF% ( type , element type , json map . get ( name ) ) ; } <SENTENCE_END/>


Original Name read,value

read

<SENTENCE_START> { json value json value = json map . get ( name ) ; return ( t ) %SELF% ( type , element type , default value , json value ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { json value json value = json map . get ( name ) ; return ( t ) %SELF% ( type , element type , default value , json value ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { json value json value = json map . get ( name ) ; return ( t ) %SELF% ( type , element type , default value , json value ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { json value json value = json map . get ( name ) ; return ( t ) %SELF% ( type , element type , default value , json value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { json value json value = json map . get ( name ) ; return ( t ) %SELF% ( type , element type , default value , json value ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { json value json value = json map . get ( name ) ; return ( t ) %SELF% ( type , element type , default value , json value ) ; } <SENTENCE_END/>


Original Name read,value

read

<SENTENCE_START> { if ( json data == null ) return default value ; return ( t ) %SELF% ( type , element type , json data ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { if ( json data == null ) return default value ; return ( t ) %SELF% ( type , element type , json data ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { if ( json data == null ) return default value ; return ( t ) %SELF% ( type , element type , json data ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( json data == null ) return default value ; return ( t ) %SELF% ( type , element type , json data ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( json data == null ) return default value ; return ( t ) %SELF% ( type , element type , json data ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { if ( json data == null ) return default value ; return ( t ) %SELF% ( type , element type , json data ) ; } <SENTENCE_END/>


Original Name read,value

read

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json data ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json data ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json data ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return ( t ) %SELF% ( type , null , json data ) ; } <SENTENCE_END/>


Original Name read,value

read

<SENTENCE_START> { if ( json data == null ) return null ; if ( json data . is object ( ) ) { string class name = type name == null ? null : json data . get string ( type name , null ) ; if ( class name != null ) { json data . remove ( type name ) ; type = get class ( class name ) ; if ( type == null ) { try { type = ( class < t > ) class reflection . for name ( class name ) ; } catch ( reflection exception ex ) { throw new serialization exception ( ex ) ; } } } if ( type == null ) { if ( default serializer != null ) return ( t ) default serializer . read ( this , json data , type ) ; return ( t ) json data ; } if ( type name != null && class reflection . is assignable from ( collection . class , type ) ) { json data = json data . get ( "items" ) ; } else { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; if ( type == string . class || type == integer . class || type == boolean . class || type == float . class || type == long . class || type == double . class || type == short . class || type == byte . class || type == character . class || class reflection . is assignable from ( enum . class , type ) ) { return %SELF% ( "value" , type , json data ) ; } object object = new instance ( type ) ; if ( object instanceof serializable ) { ( ( serializable ) object ) . read ( this , json data ) ; return ( t ) object ; } if ( object instanceof object map ) { object map result = ( object map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof array map ) { array map result = ( array map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof map ) { map result = ( map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } read fields ( object , json data ) ; return ( t ) object ; } } if ( type != null ) { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; } if ( json data . is array ( ) ) { if ( type == null || type == object . class ) type = ( class < t > ) array . class ; if ( class reflection . is assignable from ( array . class , type ) ) { array result = type == array . class ? new array ( ) : ( array ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( queue . class , type ) ) { queue result = type == queue . class ? new queue ( ) : ( queue ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add last ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( collection . class , type ) ) { collection result = type . is interface ( ) ? new array list ( ) : ( collection ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( type . is array ( ) ) { class component type = type . get component type ( ) ; if ( element type == null ) element type = component type ; object result = array reflection . new instance ( component type , json data . size ) ; int i = 0 ; for ( json value child = json data . child ; child != null ; child = child . next ) array reflection . set ( result , i ++ , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } if ( json data . is number ( ) ) { try { if ( type == null || type == float . class || type == float . class ) return ( t ) ( float ) json data . as float ( ) ; if ( type == int . class || type == integer . class ) return ( t ) ( integer ) json data . as int ( ) ; if ( type == long . class || type == long . class ) return ( t ) ( long ) json data . as long ( ) ; if ( type == double . class || type == double . class ) return ( t ) ( double ) json data . as double ( ) ; if ( type == string . class ) return ( t ) json data . as string ( ) ; if ( type == short . class || type == short . class ) return ( t ) ( short ) json data . as short ( ) ; if ( type == byte . class || type == byte . class ) return ( t ) ( byte ) json data . as byte ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is boolean ( ) ) { try { if ( type == null || type == boolean . class || type == boolean . class ) return ( t ) ( boolean ) json data . as boolean ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is string ( ) ) { string string = json data . as string ( ) ; if ( type == null || type == string . class ) return ( t ) string ; try { if ( type == int . class || type == integer . class ) return ( t ) integer . value of ( string ) ; if ( type == float . class || type == float . class ) return ( t ) float . value of ( string ) ; if ( type == long . class || type == long . class ) return ( t ) long . value of ( string ) ; if ( type == double . class || type == double . class ) return ( t ) double . value of ( string ) ; if ( type == short . class || type == short . class ) return ( t ) short . value of ( string ) ; if ( type == byte . class || type == byte . class ) return ( t ) byte . value of ( string ) ; } catch ( number format exception ignored ) { } if ( type == boolean . class || type == boolean . class ) return ( t ) boolean . value of ( string ) ; if ( type == char . class || type == character . class ) return ( t ) ( character ) string . char at ( 0 ) ; if ( class reflection . is assignable from ( enum . class , type ) ) { enum [ ] constants = ( enum [ ] ) type . get enum constants ( ) ; for ( int i = 0 , n = constants . length ; i < n ; i ++ ) { enum e = constants [ i ] ; if ( string . equals ( convert to string ( e ) ) ) return ( t ) e ; } } if ( type == char sequence . class ) return ( t ) string ; throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } return null ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { if ( json data == null ) return null ; if ( json data . is object ( ) ) { string class name = type name == null ? null : json data . get string ( type name , null ) ; if ( class name != null ) { json data . remove ( type name ) ; type = get class ( class name ) ; if ( type == null ) { try { type = ( class < t > ) class reflection . for name ( class name ) ; } catch ( reflection exception ex ) { throw new serialization exception ( ex ) ; } } } if ( type == null ) { if ( default serializer != null ) return ( t ) default serializer . read ( this , json data , type ) ; return ( t ) json data ; } if ( type name != null && class reflection . is assignable from ( collection . class , type ) ) { json data = json data . get ( "items" ) ; } else { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; if ( type == string . class || type == integer . class || type == boolean . class || type == float . class || type == long . class || type == double . class || type == short . class || type == byte . class || type == character . class || class reflection . is assignable from ( enum . class , type ) ) { return %SELF% ( "value" , type , json data ) ; } object object = new instance ( type ) ; if ( object instanceof serializable ) { ( ( serializable ) object ) . read ( this , json data ) ; return ( t ) object ; } if ( object instanceof object map ) { object map result = ( object map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof array map ) { array map result = ( array map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof map ) { map result = ( map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } read fields ( object , json data ) ; return ( t ) object ; } } if ( type != null ) { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; } if ( json data . is array ( ) ) { if ( type == null || type == object . class ) type = ( class < t > ) array . class ; if ( class reflection . is assignable from ( array . class , type ) ) { array result = type == array . class ? new array ( ) : ( array ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( queue . class , type ) ) { queue result = type == queue . class ? new queue ( ) : ( queue ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add last ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( collection . class , type ) ) { collection result = type . is interface ( ) ? new array list ( ) : ( collection ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( type . is array ( ) ) { class component type = type . get component type ( ) ; if ( element type == null ) element type = component type ; object result = array reflection . new instance ( component type , json data . size ) ; int i = 0 ; for ( json value child = json data . child ; child != null ; child = child . next ) array reflection . set ( result , i ++ , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } if ( json data . is number ( ) ) { try { if ( type == null || type == float . class || type == float . class ) return ( t ) ( float ) json data . as float ( ) ; if ( type == int . class || type == integer . class ) return ( t ) ( integer ) json data . as int ( ) ; if ( type == long . class || type == long . class ) return ( t ) ( long ) json data . as long ( ) ; if ( type == double . class || type == double . class ) return ( t ) ( double ) json data . as double ( ) ; if ( type == string . class ) return ( t ) json data . as string ( ) ; if ( type == short . class || type == short . class ) return ( t ) ( short ) json data . as short ( ) ; if ( type == byte . class || type == byte . class ) return ( t ) ( byte ) json data . as byte ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is boolean ( ) ) { try { if ( type == null || type == boolean . class || type == boolean . class ) return ( t ) ( boolean ) json data . as boolean ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is string ( ) ) { string string = json data . as string ( ) ; if ( type == null || type == string . class ) return ( t ) string ; try { if ( type == int . class || type == integer . class ) return ( t ) integer . value of ( string ) ; if ( type == float . class || type == float . class ) return ( t ) float . value of ( string ) ; if ( type == long . class || type == long . class ) return ( t ) long . value of ( string ) ; if ( type == double . class || type == double . class ) return ( t ) double . value of ( string ) ; if ( type == short . class || type == short . class ) return ( t ) short . value of ( string ) ; if ( type == byte . class || type == byte . class ) return ( t ) byte . value of ( string ) ; } catch ( number format exception ignored ) { } if ( type == boolean . class || type == boolean . class ) return ( t ) boolean . value of ( string ) ; if ( type == char . class || type == character . class ) return ( t ) ( character ) string . char at ( 0 ) ; if ( class reflection . is assignable from ( enum . class , type ) ) { enum [ ] constants = ( enum [ ] ) type . get enum constants ( ) ; for ( int i = 0 , n = constants . length ; i < n ; i ++ ) { enum e = constants [ i ] ; if ( string . equals ( convert to string ( e ) ) ) return ( t ) e ; } } if ( type == char sequence . class ) return ( t ) string ; throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } return null ; } <SENTENCE_END/>

value

<SENTENCE_START> { if ( json data == null ) return null ; if ( json data . is object ( ) ) { string class name = type name == null ? null : json data . get string ( type name , null ) ; if ( class name != null ) { json data . remove ( type name ) ; type = get class ( class name ) ; if ( type == null ) { try { type = ( class < t > ) class reflection . for name ( class name ) ; } catch ( reflection exception ex ) { throw new serialization exception ( ex ) ; } } } if ( type == null ) { if ( default serializer != null ) return ( t ) default serializer . read ( this , json data , type ) ; return ( t ) json data ; } if ( type name != null && class reflection . is assignable from ( collection . class , type ) ) { json data = json data . get ( "items" ) ; } else { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; if ( type == string . class || type == integer . class || type == boolean . class || type == float . class || type == long . class || type == double . class || type == short . class || type == byte . class || type == character . class || class reflection . is assignable from ( enum . class , type ) ) { return %SELF% ( "value" , type , json data ) ; } object object = new instance ( type ) ; if ( object instanceof serializable ) { ( ( serializable ) object ) . read ( this , json data ) ; return ( t ) object ; } if ( object instanceof object map ) { object map result = ( object map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof array map ) { array map result = ( array map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof map ) { map result = ( map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } read fields ( object , json data ) ; return ( t ) object ; } } if ( type != null ) { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; } if ( json data . is array ( ) ) { if ( type == null || type == object . class ) type = ( class < t > ) array . class ; if ( class reflection . is assignable from ( array . class , type ) ) { array result = type == array . class ? new array ( ) : ( array ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( queue . class , type ) ) { queue result = type == queue . class ? new queue ( ) : ( queue ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add last ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( collection . class , type ) ) { collection result = type . is interface ( ) ? new array list ( ) : ( collection ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( type . is array ( ) ) { class component type = type . get component type ( ) ; if ( element type == null ) element type = component type ; object result = array reflection . new instance ( component type , json data . size ) ; int i = 0 ; for ( json value child = json data . child ; child != null ; child = child . next ) array reflection . set ( result , i ++ , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } if ( json data . is number ( ) ) { try { if ( type == null || type == float . class || type == float . class ) return ( t ) ( float ) json data . as float ( ) ; if ( type == int . class || type == integer . class ) return ( t ) ( integer ) json data . as int ( ) ; if ( type == long . class || type == long . class ) return ( t ) ( long ) json data . as long ( ) ; if ( type == double . class || type == double . class ) return ( t ) ( double ) json data . as double ( ) ; if ( type == string . class ) return ( t ) json data . as string ( ) ; if ( type == short . class || type == short . class ) return ( t ) ( short ) json data . as short ( ) ; if ( type == byte . class || type == byte . class ) return ( t ) ( byte ) json data . as byte ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is boolean ( ) ) { try { if ( type == null || type == boolean . class || type == boolean . class ) return ( t ) ( boolean ) json data . as boolean ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is string ( ) ) { string string = json data . as string ( ) ; if ( type == null || type == string . class ) return ( t ) string ; try { if ( type == int . class || type == integer . class ) return ( t ) integer . value of ( string ) ; if ( type == float . class || type == float . class ) return ( t ) float . value of ( string ) ; if ( type == long . class || type == long . class ) return ( t ) long . value of ( string ) ; if ( type == double . class || type == double . class ) return ( t ) double . value of ( string ) ; if ( type == short . class || type == short . class ) return ( t ) short . value of ( string ) ; if ( type == byte . class || type == byte . class ) return ( t ) byte . value of ( string ) ; } catch ( number format exception ignored ) { } if ( type == boolean . class || type == boolean . class ) return ( t ) boolean . value of ( string ) ; if ( type == char . class || type == character . class ) return ( t ) ( character ) string . char at ( 0 ) ; if ( class reflection . is assignable from ( enum . class , type ) ) { enum [ ] constants = ( enum [ ] ) type . get enum constants ( ) ; for ( int i = 0 , n = constants . length ; i < n ; i ++ ) { enum e = constants [ i ] ; if ( string . equals ( convert to string ( e ) ) ) return ( t ) e ; } } if ( type == char sequence . class ) return ( t ) string ; throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } return null ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { if ( json data == null ) return null ; if ( json data . is object ( ) ) { string class name = type name == null ? null : json data . get string ( type name , null ) ; if ( class name != null ) { json data . remove ( type name ) ; type = get class ( class name ) ; if ( type == null ) { try { type = ( class < t > ) class reflection . for name ( class name ) ; } catch ( reflection exception ex ) { throw new serialization exception ( ex ) ; } } } if ( type == null ) { if ( default serializer != null ) return ( t ) default serializer . read ( this , json data , type ) ; return ( t ) json data ; } if ( type name != null && class reflection . is assignable from ( collection . class , type ) ) { json data = json data . get ( "items" ) ; } else { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; if ( type == string . class || type == integer . class || type == boolean . class || type == float . class || type == long . class || type == double . class || type == short . class || type == byte . class || type == character . class || class reflection . is assignable from ( enum . class , type ) ) { return %SELF% ( "value" , type , json data ) ; } object object = new instance ( type ) ; if ( object instanceof serializable ) { ( ( serializable ) object ) . read ( this , json data ) ; return ( t ) object ; } if ( object instanceof object map ) { object map result = ( object map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof array map ) { array map result = ( array map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof map ) { map result = ( map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } read fields ( object , json data ) ; return ( t ) object ; } } if ( type != null ) { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; } if ( json data . is array ( ) ) { if ( type == null || type == object . class ) type = ( class < t > ) array . class ; if ( class reflection . is assignable from ( array . class , type ) ) { array result = type == array . class ? new array ( ) : ( array ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( queue . class , type ) ) { queue result = type == queue . class ? new queue ( ) : ( queue ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add last ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( collection . class , type ) ) { collection result = type . is interface ( ) ? new array list ( ) : ( collection ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( type . is array ( ) ) { class component type = type . get component type ( ) ; if ( element type == null ) element type = component type ; object result = array reflection . new instance ( component type , json data . size ) ; int i = 0 ; for ( json value child = json data . child ; child != null ; child = child . next ) array reflection . set ( result , i ++ , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } if ( json data . is number ( ) ) { try { if ( type == null || type == float . class || type == float . class ) return ( t ) ( float ) json data . as float ( ) ; if ( type == int . class || type == integer . class ) return ( t ) ( integer ) json data . as int ( ) ; if ( type == long . class || type == long . class ) return ( t ) ( long ) json data . as long ( ) ; if ( type == double . class || type == double . class ) return ( t ) ( double ) json data . as double ( ) ; if ( type == string . class ) return ( t ) json data . as string ( ) ; if ( type == short . class || type == short . class ) return ( t ) ( short ) json data . as short ( ) ; if ( type == byte . class || type == byte . class ) return ( t ) ( byte ) json data . as byte ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is boolean ( ) ) { try { if ( type == null || type == boolean . class || type == boolean . class ) return ( t ) ( boolean ) json data . as boolean ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is string ( ) ) { string string = json data . as string ( ) ; if ( type == null || type == string . class ) return ( t ) string ; try { if ( type == int . class || type == integer . class ) return ( t ) integer . value of ( string ) ; if ( type == float . class || type == float . class ) return ( t ) float . value of ( string ) ; if ( type == long . class || type == long . class ) return ( t ) long . value of ( string ) ; if ( type == double . class || type == double . class ) return ( t ) double . value of ( string ) ; if ( type == short . class || type == short . class ) return ( t ) short . value of ( string ) ; if ( type == byte . class || type == byte . class ) return ( t ) byte . value of ( string ) ; } catch ( number format exception ignored ) { } if ( type == boolean . class || type == boolean . class ) return ( t ) boolean . value of ( string ) ; if ( type == char . class || type == character . class ) return ( t ) ( character ) string . char at ( 0 ) ; if ( class reflection . is assignable from ( enum . class , type ) ) { enum [ ] constants = ( enum [ ] ) type . get enum constants ( ) ; for ( int i = 0 , n = constants . length ; i < n ; i ++ ) { enum e = constants [ i ] ; if ( string . equals ( convert to string ( e ) ) ) return ( t ) e ; } } if ( type == char sequence . class ) return ( t ) string ; throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } return null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( json data == null ) return null ; if ( json data . is object ( ) ) { string class name = type name == null ? null : json data . get string ( type name , null ) ; if ( class name != null ) { json data . remove ( type name ) ; type = get class ( class name ) ; if ( type == null ) { try { type = ( class < t > ) class reflection . for name ( class name ) ; } catch ( reflection exception ex ) { throw new serialization exception ( ex ) ; } } } if ( type == null ) { if ( default serializer != null ) return ( t ) default serializer . read ( this , json data , type ) ; return ( t ) json data ; } if ( type name != null && class reflection . is assignable from ( collection . class , type ) ) { json data = json data . get ( "items" ) ; } else { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; if ( type == string . class || type == integer . class || type == boolean . class || type == float . class || type == long . class || type == double . class || type == short . class || type == byte . class || type == character . class || class reflection . is assignable from ( enum . class , type ) ) { return %SELF% ( "value" , type , json data ) ; } object object = new instance ( type ) ; if ( object instanceof serializable ) { ( ( serializable ) object ) . read ( this , json data ) ; return ( t ) object ; } if ( object instanceof object map ) { object map result = ( object map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof array map ) { array map result = ( array map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof map ) { map result = ( map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } read fields ( object , json data ) ; return ( t ) object ; } } if ( type != null ) { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; } if ( json data . is array ( ) ) { if ( type == null || type == object . class ) type = ( class < t > ) array . class ; if ( class reflection . is assignable from ( array . class , type ) ) { array result = type == array . class ? new array ( ) : ( array ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( queue . class , type ) ) { queue result = type == queue . class ? new queue ( ) : ( queue ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add last ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( collection . class , type ) ) { collection result = type . is interface ( ) ? new array list ( ) : ( collection ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( type . is array ( ) ) { class component type = type . get component type ( ) ; if ( element type == null ) element type = component type ; object result = array reflection . new instance ( component type , json data . size ) ; int i = 0 ; for ( json value child = json data . child ; child != null ; child = child . next ) array reflection . set ( result , i ++ , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } if ( json data . is number ( ) ) { try { if ( type == null || type == float . class || type == float . class ) return ( t ) ( float ) json data . as float ( ) ; if ( type == int . class || type == integer . class ) return ( t ) ( integer ) json data . as int ( ) ; if ( type == long . class || type == long . class ) return ( t ) ( long ) json data . as long ( ) ; if ( type == double . class || type == double . class ) return ( t ) ( double ) json data . as double ( ) ; if ( type == string . class ) return ( t ) json data . as string ( ) ; if ( type == short . class || type == short . class ) return ( t ) ( short ) json data . as short ( ) ; if ( type == byte . class || type == byte . class ) return ( t ) ( byte ) json data . as byte ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is boolean ( ) ) { try { if ( type == null || type == boolean . class || type == boolean . class ) return ( t ) ( boolean ) json data . as boolean ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is string ( ) ) { string string = json data . as string ( ) ; if ( type == null || type == string . class ) return ( t ) string ; try { if ( type == int . class || type == integer . class ) return ( t ) integer . value of ( string ) ; if ( type == float . class || type == float . class ) return ( t ) float . value of ( string ) ; if ( type == long . class || type == long . class ) return ( t ) long . value of ( string ) ; if ( type == double . class || type == double . class ) return ( t ) double . value of ( string ) ; if ( type == short . class || type == short . class ) return ( t ) short . value of ( string ) ; if ( type == byte . class || type == byte . class ) return ( t ) byte . value of ( string ) ; } catch ( number format exception ignored ) { } if ( type == boolean . class || type == boolean . class ) return ( t ) boolean . value of ( string ) ; if ( type == char . class || type == character . class ) return ( t ) ( character ) string . char at ( 0 ) ; if ( class reflection . is assignable from ( enum . class , type ) ) { enum [ ] constants = ( enum [ ] ) type . get enum constants ( ) ; for ( int i = 0 , n = constants . length ; i < n ; i ++ ) { enum e = constants [ i ] ; if ( string . equals ( convert to string ( e ) ) ) return ( t ) e ; } } if ( type == char sequence . class ) return ( t ) string ; throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } return null ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { if ( json data == null ) return null ; if ( json data . is object ( ) ) { string class name = type name == null ? null : json data . get string ( type name , null ) ; if ( class name != null ) { json data . remove ( type name ) ; type = get class ( class name ) ; if ( type == null ) { try { type = ( class < t > ) class reflection . for name ( class name ) ; } catch ( reflection exception ex ) { throw new serialization exception ( ex ) ; } } } if ( type == null ) { if ( default serializer != null ) return ( t ) default serializer . read ( this , json data , type ) ; return ( t ) json data ; } if ( type name != null && class reflection . is assignable from ( collection . class , type ) ) { json data = json data . get ( "items" ) ; } else { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; if ( type == string . class || type == integer . class || type == boolean . class || type == float . class || type == long . class || type == double . class || type == short . class || type == byte . class || type == character . class || class reflection . is assignable from ( enum . class , type ) ) { return %SELF% ( "value" , type , json data ) ; } object object = new instance ( type ) ; if ( object instanceof serializable ) { ( ( serializable ) object ) . read ( this , json data ) ; return ( t ) object ; } if ( object instanceof object map ) { object map result = ( object map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof array map ) { array map result = ( array map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( object instanceof map ) { map result = ( map ) object ; for ( json value child = json data . child ; child != null ; child = child . next ) result . put ( child . name ( ) , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } read fields ( object , json data ) ; return ( t ) object ; } } if ( type != null ) { serializer serializer = class to serializer . get ( type ) ; if ( serializer != null ) return ( t ) serializer . read ( this , json data , type ) ; } if ( json data . is array ( ) ) { if ( type == null || type == object . class ) type = ( class < t > ) array . class ; if ( class reflection . is assignable from ( array . class , type ) ) { array result = type == array . class ? new array ( ) : ( array ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( queue . class , type ) ) { queue result = type == queue . class ? new queue ( ) : ( queue ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add last ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( class reflection . is assignable from ( collection . class , type ) ) { collection result = type . is interface ( ) ? new array list ( ) : ( collection ) new instance ( type ) ; for ( json value child = json data . child ; child != null ; child = child . next ) result . add ( %SELF% ( element type , null , child ) ) ; return ( t ) result ; } if ( type . is array ( ) ) { class component type = type . get component type ( ) ; if ( element type == null ) element type = component type ; object result = array reflection . new instance ( component type , json data . size ) ; int i = 0 ; for ( json value child = json data . child ; child != null ; child = child . next ) array reflection . set ( result , i ++ , %SELF% ( element type , null , child ) ) ; return ( t ) result ; } throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } if ( json data . is number ( ) ) { try { if ( type == null || type == float . class || type == float . class ) return ( t ) ( float ) json data . as float ( ) ; if ( type == int . class || type == integer . class ) return ( t ) ( integer ) json data . as int ( ) ; if ( type == long . class || type == long . class ) return ( t ) ( long ) json data . as long ( ) ; if ( type == double . class || type == double . class ) return ( t ) ( double ) json data . as double ( ) ; if ( type == string . class ) return ( t ) json data . as string ( ) ; if ( type == short . class || type == short . class ) return ( t ) ( short ) json data . as short ( ) ; if ( type == byte . class || type == byte . class ) return ( t ) ( byte ) json data . as byte ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is boolean ( ) ) { try { if ( type == null || type == boolean . class || type == boolean . class ) return ( t ) ( boolean ) json data . as boolean ( ) ; } catch ( number format exception ignored ) { } json data = new json value ( json data . as string ( ) ) ; } if ( json data . is string ( ) ) { string string = json data . as string ( ) ; if ( type == null || type == string . class ) return ( t ) string ; try { if ( type == int . class || type == integer . class ) return ( t ) integer . value of ( string ) ; if ( type == float . class || type == float . class ) return ( t ) float . value of ( string ) ; if ( type == long . class || type == long . class ) return ( t ) long . value of ( string ) ; if ( type == double . class || type == double . class ) return ( t ) double . value of ( string ) ; if ( type == short . class || type == short . class ) return ( t ) short . value of ( string ) ; if ( type == byte . class || type == byte . class ) return ( t ) byte . value of ( string ) ; } catch ( number format exception ignored ) { } if ( type == boolean . class || type == boolean . class ) return ( t ) boolean . value of ( string ) ; if ( type == char . class || type == character . class ) return ( t ) ( character ) string . char at ( 0 ) ; if ( class reflection . is assignable from ( enum . class , type ) ) { enum [ ] constants = ( enum [ ] ) type . get enum constants ( ) ; for ( int i = 0 , n = constants . length ; i < n ; i ++ ) { enum e = constants [ i ] ; if ( string . equals ( convert to string ( e ) ) ) return ( t ) e ; } } if ( type == char sequence . class ) return ( t ) string ; throw new serialization exception ( "Unable to convert value to required type: " + json data + " (" + type . get name ( ) + ")" ) ; } return null ; } <SENTENCE_END/>


Original Name convert,to,string

convert

<SENTENCE_START> { return enum names ? e . name ( ) : e . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return enum names ? e . name ( ) : e . to string ( ) ; } <SENTENCE_END/>

to

<SENTENCE_START> { return enum names ? e . name ( ) : e . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 80.3%)

<SENTENCE_START> { return enum names ? e . name ( ) : e . to string ( ) ; } <SENTENCE_END/>

string

<SENTENCE_START> { return enum names ? e . name ( ) : e . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 39.6%)

<SENTENCE_START> { return enum names ? e . name ( ) : e . to string ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return enum names ? e . name ( ) : e . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { return enum names ? e . name ( ) : e . to string ( ) ; } <SENTENCE_END/>


Original Name convert,to,string

convert

<SENTENCE_START> { if ( object instanceof enum ) return %SELF% ( ( enum ) object ) ; if ( object instanceof class ) return ( ( class ) object ) . get name ( ) ; return string . value of ( object ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { if ( object instanceof enum ) return %SELF% ( ( enum ) object ) ; if ( object instanceof class ) return ( ( class ) object ) . get name ( ) ; return string . value of ( object ) ; } <SENTENCE_END/>

to

<SENTENCE_START> { if ( object instanceof enum ) return %SELF% ( ( enum ) object ) ; if ( object instanceof class ) return ( ( class ) object ) . get name ( ) ; return string . value of ( object ) ; } <SENTENCE_END/>

(Copy Probability: 8.6%)

<SENTENCE_START> { if ( object instanceof enum ) return %SELF% ( ( enum ) object ) ; if ( object instanceof class ) return ( ( class ) object ) . get name ( ) ; return string . value of ( object ) ; } <SENTENCE_END/>

string

<SENTENCE_START> { if ( object instanceof enum ) return %SELF% ( ( enum ) object ) ; if ( object instanceof class ) return ( ( class ) object ) . get name ( ) ; return string . value of ( object ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { if ( object instanceof enum ) return %SELF% ( ( enum ) object ) ; if ( object instanceof class ) return ( ( class ) object ) . get name ( ) ; return string . value of ( object ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( object instanceof enum ) return %SELF% ( ( enum ) object ) ; if ( object instanceof class ) return ( ( class ) object ) . get name ( ) ; return string . value of ( object ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { if ( object instanceof enum ) return %SELF% ( ( enum ) object ) ; if ( object instanceof class ) return ( ( class ) object ) . get name ( ) ; return string . value of ( object ) ; } <SENTENCE_END/>


Original Name new,instance

new

<SENTENCE_START> { try { return class reflection . %SELF% ( type ) ; } catch ( exception ex ) { try { constructor constructor = class reflection . get declared constructor ( type ) ; constructor . set accessible ( true ) ; return constructor . %SELF% ( ) ; } catch ( security exception ignored ) { } catch ( reflection exception ignored ) { if ( class reflection . is assignable from ( enum . class , type ) ) { if ( type . get enum constants ( ) == null ) type = type . get superclass ( ) ; return type . get enum constants ( ) [ 0 ] ; } if ( type . is array ( ) ) throw new serialization exception ( "Encountered JSON object when expected array of type: " + type . get name ( ) , ex ) ; else if ( class reflection . is member class ( type ) && ! class reflection . is static class ( type ) ) throw new serialization exception ( "Class cannot be created (non-static member class): " + type . get name ( ) , ex ) ; else throw new serialization exception ( "Class cannot be created (missing no-arg constructor): " + type . get name ( ) , ex ) ; } catch ( exception private constructor exception ) { ex = private constructor exception ; } throw new serialization exception ( "Error constructing instance of class: " + type . get name ( ) , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { try { return class reflection . %SELF% ( type ) ; } catch ( exception ex ) { try { constructor constructor = class reflection . get declared constructor ( type ) ; constructor . set accessible ( true ) ; return constructor . %SELF% ( ) ; } catch ( security exception ignored ) { } catch ( reflection exception ignored ) { if ( class reflection . is assignable from ( enum . class , type ) ) { if ( type . get enum constants ( ) == null ) type = type . get superclass ( ) ; return type . get enum constants ( ) [ 0 ] ; } if ( type . is array ( ) ) throw new serialization exception ( "Encountered JSON object when expected array of type: " + type . get name ( ) , ex ) ; else if ( class reflection . is member class ( type ) && ! class reflection . is static class ( type ) ) throw new serialization exception ( "Class cannot be created (non-static member class): " + type . get name ( ) , ex ) ; else throw new serialization exception ( "Class cannot be created (missing no-arg constructor): " + type . get name ( ) , ex ) ; } catch ( exception private constructor exception ) { ex = private constructor exception ; } throw new serialization exception ( "Error constructing instance of class: " + type . get name ( ) , ex ) ; } } <SENTENCE_END/>

instance

<SENTENCE_START> { try { return class reflection . %SELF% ( type ) ; } catch ( exception ex ) { try { constructor constructor = class reflection . get declared constructor ( type ) ; constructor . set accessible ( true ) ; return constructor . %SELF% ( ) ; } catch ( security exception ignored ) { } catch ( reflection exception ignored ) { if ( class reflection . is assignable from ( enum . class , type ) ) { if ( type . get enum constants ( ) == null ) type = type . get superclass ( ) ; return type . get enum constants ( ) [ 0 ] ; } if ( type . is array ( ) ) throw new serialization exception ( "Encountered JSON object when expected array of type: " + type . get name ( ) , ex ) ; else if ( class reflection . is member class ( type ) && ! class reflection . is static class ( type ) ) throw new serialization exception ( "Class cannot be created (non-static member class): " + type . get name ( ) , ex ) ; else throw new serialization exception ( "Class cannot be created (missing no-arg constructor): " + type . get name ( ) , ex ) ; } catch ( exception private constructor exception ) { ex = private constructor exception ; } throw new serialization exception ( "Error constructing instance of class: " + type . get name ( ) , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 43.1%)

<SENTENCE_START> { try { return class reflection . %SELF% ( type ) ; } catch ( exception ex ) { try { constructor constructor = class reflection . get declared constructor ( type ) ; constructor . set accessible ( true ) ; return constructor . %SELF% ( ) ; } catch ( security exception ignored ) { } catch ( reflection exception ignored ) { if ( class reflection . is assignable from ( enum . class , type ) ) { if ( type . get enum constants ( ) == null ) type = type . get superclass ( ) ; return type . get enum constants ( ) [ 0 ] ; } if ( type . is array ( ) ) throw new serialization exception ( "Encountered JSON object when expected array of type: " + type . get name ( ) , ex ) ; else if ( class reflection . is member class ( type ) && ! class reflection . is static class ( type ) ) throw new serialization exception ( "Class cannot be created (non-static member class): " + type . get name ( ) , ex ) ; else throw new serialization exception ( "Class cannot be created (missing no-arg constructor): " + type . get name ( ) , ex ) ; } catch ( exception private constructor exception ) { ex = private constructor exception ; } throw new serialization exception ( "Error constructing instance of class: " + type . get name ( ) , ex ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { return class reflection . %SELF% ( type ) ; } catch ( exception ex ) { try { constructor constructor = class reflection . get declared constructor ( type ) ; constructor . set accessible ( true ) ; return constructor . %SELF% ( ) ; } catch ( security exception ignored ) { } catch ( reflection exception ignored ) { if ( class reflection . is assignable from ( enum . class , type ) ) { if ( type . get enum constants ( ) == null ) type = type . get superclass ( ) ; return type . get enum constants ( ) [ 0 ] ; } if ( type . is array ( ) ) throw new serialization exception ( "Encountered JSON object when expected array of type: " + type . get name ( ) , ex ) ; else if ( class reflection . is member class ( type ) && ! class reflection . is static class ( type ) ) throw new serialization exception ( "Class cannot be created (non-static member class): " + type . get name ( ) , ex ) ; else throw new serialization exception ( "Class cannot be created (missing no-arg constructor): " + type . get name ( ) , ex ) ; } catch ( exception private constructor exception ) { ex = private constructor exception ; } throw new serialization exception ( "Error constructing instance of class: " + type . get name ( ) , ex ) ; } } <SENTENCE_END/>

(Copy Probability: 21.8%)

<SENTENCE_START> { try { return class reflection . %SELF% ( type ) ; } catch ( exception ex ) { try { constructor constructor = class reflection . get declared constructor ( type ) ; constructor . set accessible ( true ) ; return constructor . %SELF% ( ) ; } catch ( security exception ignored ) { } catch ( reflection exception ignored ) { if ( class reflection . is assignable from ( enum . class , type ) ) { if ( type . get enum constants ( ) == null ) type = type . get superclass ( ) ; return type . get enum constants ( ) [ 0 ] ; } if ( type . is array ( ) ) throw new serialization exception ( "Encountered JSON object when expected array of type: " + type . get name ( ) , ex ) ; else if ( class reflection . is member class ( type ) && ! class reflection . is static class ( type ) ) throw new serialization exception ( "Class cannot be created (non-static member class): " + type . get name ( ) , ex ) ; else throw new serialization exception ( "Class cannot be created (missing no-arg constructor): " + type . get name ( ) , ex ) ; } catch ( exception private constructor exception ) { ex = private constructor exception ; } throw new serialization exception ( "Error constructing instance of class: " + type . get name ( ) , ex ) ; } } <SENTENCE_END/>


Original Name pretty,print

pretty

<SENTENCE_START> { return %SELF% ( object , 0 ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return %SELF% ( object , 0 ) ; } <SENTENCE_END/>

print

<SENTENCE_START> { return %SELF% ( object , 0 ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return %SELF% ( object , 0 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( object , 0 ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return %SELF% ( object , 0 ) ; } <SENTENCE_END/>


Original Name pretty,print

pretty

<SENTENCE_START> { return %SELF% ( json , 0 ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return %SELF% ( json , 0 ) ; } <SENTENCE_END/>

print

<SENTENCE_START> { return %SELF% ( json , 0 ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return %SELF% ( json , 0 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( json , 0 ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { return %SELF% ( json , 0 ) ; } <SENTENCE_END/>


Original Name pretty,print

pretty

<SENTENCE_START> { return %SELF% ( to json ( object ) , single line columns ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return %SELF% ( to json ( object ) , single line columns ) ; } <SENTENCE_END/>

print

<SENTENCE_START> { return %SELF% ( to json ( object ) , single line columns ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return %SELF% ( to json ( object ) , single line columns ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( to json ( object ) , single line columns ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return %SELF% ( to json ( object ) , single line columns ) ; } <SENTENCE_END/>


Original Name pretty,print

pretty

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( output type , single line columns ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( output type , single line columns ) ; } <SENTENCE_END/>

print

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( output type , single line columns ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( output type , single line columns ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( output type , single line columns ) ; } <SENTENCE_END/>

(Copy Probability: 5.8%)

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( output type , single line columns ) ; } <SENTENCE_END/>


Original Name pretty,print

pretty

<SENTENCE_START> { return %SELF% ( to json ( object ) , settings ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { return %SELF% ( to json ( object ) , settings ) ; } <SENTENCE_END/>

print

<SENTENCE_START> { return %SELF% ( to json ( object ) , settings ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { return %SELF% ( to json ( object ) , settings ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( to json ( object ) , settings ) ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { return %SELF% ( to json ( object ) , settings ) ; } <SENTENCE_END/>


Original Name pretty,print

pretty

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( settings ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( settings ) ; } <SENTENCE_END/>

print

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( settings ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( settings ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( settings ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return new json reader ( ) . parse ( json ) . %SELF% ( settings ) ; } <SENTENCE_END/>


Original Name apply

apply

<SENTENCE_START> { return start + ( end - start ) * %SELF% ( a ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return start + ( end - start ) * %SELF% ( a ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return start + ( end - start ) * %SELF% ( a ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return start + ( end - start ) * %SELF% ( a ) ; } <SENTENCE_END/>


Original Name apply

apply

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

(Copy Probability: 0.2%)

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

%END%

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

(Copy Probability: 3.2%)

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


Original Name apply

apply

<SENTENCE_START> { return math utils . clamp ( a * a * a * ( a * ( a * 6 - 15 ) + 10 ) , 0 , 1 ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return math utils . clamp ( a * a * a * ( a * ( a * 6 - 15 ) + 10 ) , 0 , 1 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return math utils . clamp ( a * a * a * ( a * ( a * 6 - 15 ) + 10 ) , 0 , 1 ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return math utils . clamp ( a * a * a * ( a * ( a * 6 - 15 ) + 10 ) , 0 , 1 ) ; } <SENTENCE_END/>


Original Name apply

apply

<SENTENCE_START> { return ( 1 - math utils . cos ( a * math utils . pi ) ) / 2 ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return ( 1 - math utils . cos ( a * math utils . pi ) ) / 2 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return ( 1 - math utils . cos ( a * math utils . pi ) ) / 2 ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return ( 1 - math utils . cos ( a * math utils . pi ) ) / 2 ; } <SENTENCE_END/>


Original Name apply

apply

<SENTENCE_START> { return 1 - math utils . cos ( a * math utils . pi / 2 ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return 1 - math utils . cos ( a * math utils . pi / 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return 1 - math utils . cos ( a * math utils . pi / 2 ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return 1 - math utils . cos ( a * math utils . pi / 2 ) ; } <SENTENCE_END/>


Original Name apply

apply

<SENTENCE_START> { return math utils . sin ( a * math utils . pi / 2 ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return math utils . sin ( a * math utils . pi / 2 ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return math utils . sin ( a * math utils . pi / 2 ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { return math utils . sin ( a * math utils . pi / 2 ) ; } <SENTENCE_END/>


Original Name apply

apply

<SENTENCE_START> { if ( a <= 0.5f ) { a *= 2 ; return ( 1 - ( float ) math . sqrt ( 1 - a * a ) ) / 2 ; } a -- ; a *= 2 ; return ( ( float ) math . sqrt ( 1 - a * a ) + 1 ) / 2 ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { if ( a <= 0.5f ) { a *= 2 ; return ( 1 - ( float ) math . sqrt ( 1 - a * a ) ) / 2 ; } a -- ; a *= 2 ; return ( ( float ) math . sqrt ( 1 - a * a ) + 1 ) / 2 ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( a <= 0.5f ) { a *= 2 ; return ( 1 - ( float ) math . sqrt ( 1 - a * a ) ) / 2 ; } a -- ; a *= 2 ; return ( ( float ) math . sqrt ( 1 - a * a ) + 1 ) / 2 ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { if ( a <= 0.5f ) { a *= 2 ; return ( 1 - ( float ) math . sqrt ( 1 - a * a ) ) / 2 ; } a -- ; a *= 2 ; return ( ( float ) math . sqrt ( 1 - a * a ) + 1 ) / 2 ; } <SENTENCE_END/>


Original Name apply

apply

<SENTENCE_START> { return 1 - ( float ) math . sqrt ( 1 - a * a ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return 1 - ( float ) math . sqrt ( 1 - a * a ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return 1 - ( float ) math . sqrt ( 1 - a * a ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return 1 - ( float ) math . sqrt ( 1 - a * a ) ; } <SENTENCE_END/>


Original Name apply

apply

<SENTENCE_START> { a -- ; return ( float ) math . sqrt ( 1 - a * a ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { a -- ; return ( float ) math . sqrt ( 1 - a * a ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { a -- ; return ( float ) math . sqrt ( 1 - a * a ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { a -- ; return ( float ) math . sqrt ( 1 - a * a ) ; } <SENTENCE_END/>


Original Name out

out

<SENTENCE_START> { float test = a + widths [ 0 ] / 2 ; if ( test < widths [ 0 ] ) return test / ( widths [ 0 ] / 2 ) - 1 ; return super . apply ( a ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { float test = a + widths [ 0 ] / 2 ; if ( test < widths [ 0 ] ) return test / ( widths [ 0 ] / 2 ) - 1 ; return super . apply ( a ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float test = a + widths [ 0 ] / 2 ; if ( test < widths [ 0 ] ) return test / ( widths [ 0 ] / 2 ) - 1 ; return super . apply ( a ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { float test = a + widths [ 0 ] / 2 ; if ( test < widths [ 0 ] ) return test / ( widths [ 0 ] / 2 ) - 1 ; return super . apply ( a ) ; } <SENTENCE_END/>


Original Name native,order

native

<SENTENCE_START> { return native order ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return native order ; } <SENTENCE_END/>

order

<SENTENCE_START> { return native order ; } <SENTENCE_END/>

(Copy Probability: 70.5%)

<SENTENCE_START> { return native order ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return native order ; } <SENTENCE_END/>

(Copy Probability: 37.9%)

<SENTENCE_START> { return native order ; } <SENTENCE_END/>


Original Name needs,gl,20

needs

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

(Copy Probability: 0.2%)

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

gl

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

(Copy Probability: 0.2%)

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

20

<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 resume

resume

<SENTENCE_START> { } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { } <SENTENCE_END/>

%END%

<SENTENCE_START> { } <SENTENCE_END/>

(Copy Probability: 0.0%)

<SENTENCE_START> { } <SENTENCE_END/>


Original Name resize

resize

<SENTENCE_START> { } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { } <SENTENCE_END/>

%END%

<SENTENCE_START> { } <SENTENCE_END/>

(Copy Probability: 0.0%)

<SENTENCE_START> { } <SENTENCE_END/>


Original Name pause

pause

<SENTENCE_START> { } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { } <SENTENCE_END/>

%END%

<SENTENCE_START> { } <SENTENCE_END/>

(Copy Probability: 0.0%)

<SENTENCE_START> { } <SENTENCE_END/>


Original Name test,overlap

test

<SENTENCE_START> { input . proxy a . set ( shape a , index a ) ; input . proxy b . set ( shape b , index b ) ; input . transform a . set ( xf a ) ; input . transform b . set ( xf b ) ; input . use radii = true ; cache . count = 0 ; pool . get distance ( ) . distance ( output , cache , input ) ; return output . distance < 10.0f * settings . epsilon ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { input . proxy a . set ( shape a , index a ) ; input . proxy b . set ( shape b , index b ) ; input . transform a . set ( xf a ) ; input . transform b . set ( xf b ) ; input . use radii = true ; cache . count = 0 ; pool . get distance ( ) . distance ( output , cache , input ) ; return output . distance < 10.0f * settings . epsilon ; } <SENTENCE_END/>

overlap

<SENTENCE_START> { input . proxy a . set ( shape a , index a ) ; input . proxy b . set ( shape b , index b ) ; input . transform a . set ( xf a ) ; input . transform b . set ( xf b ) ; input . use radii = true ; cache . count = 0 ; pool . get distance ( ) . distance ( output , cache , input ) ; return output . distance < 10.0f * settings . epsilon ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { input . proxy a . set ( shape a , index a ) ; input . proxy b . set ( shape b , index b ) ; input . transform a . set ( xf a ) ; input . transform b . set ( xf b ) ; input . use radii = true ; cache . count = 0 ; pool . get distance ( ) . distance ( output , cache , input ) ; return output . distance < 10.0f * settings . epsilon ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { input . proxy a . set ( shape a , index a ) ; input . proxy b . set ( shape b , index b ) ; input . transform a . set ( xf a ) ; input . transform b . set ( xf b ) ; input . use radii = true ; cache . count = 0 ; pool . get distance ( ) . distance ( output , cache , input ) ; return output . distance < 10.0f * settings . epsilon ; } <SENTENCE_END/>

(Copy Probability: 7.6%)

<SENTENCE_START> { input . proxy a . set ( shape a , index a ) ; input . proxy b . set ( shape b , index b ) ; input . transform a . set ( xf a ) ; input . transform b . set ( xf b ) ; input . use radii = true ; cache . count = 0 ; pool . get distance ( ) . distance ( output , cache , input ) ; return output . distance < 10.0f * settings . epsilon ; } <SENTENCE_END/>


Original Name get,point,states

get

<SENTENCE_START> { for ( int i = 0 ; i < settings . max manifold points ; i ++ ) { state 1 [ i ] = point state . null state ; state 2 [ i ] = point state . null state ; } for ( int i = 0 ; i < manifold 1 . point count ; i ++ ) { contact id id = manifold 1 . points [ i ] . id ; state 1 [ i ] = point state . remove state ; for ( int j = 0 ; j < manifold 2 . point count ; j ++ ) { if ( manifold 2 . points [ j ] . id . is equal ( id ) ) { state 1 [ i ] = point state . persist state ; break ; } } } for ( int i = 0 ; i < manifold 2 . point count ; i ++ ) { contact id id = manifold 2 . points [ i ] . id ; state 2 [ i ] = point state . add state ; for ( int j = 0 ; j < manifold 1 . point count ; j ++ ) { if ( manifold 1 . points [ j ] . id . is equal ( id ) ) { state 2 [ i ] = point state . persist state ; break ; } } } } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { for ( int i = 0 ; i < settings . max manifold points ; i ++ ) { state 1 [ i ] = point state . null state ; state 2 [ i ] = point state . null state ; } for ( int i = 0 ; i < manifold 1 . point count ; i ++ ) { contact id id = manifold 1 . points [ i ] . id ; state 1 [ i ] = point state . remove state ; for ( int j = 0 ; j < manifold 2 . point count ; j ++ ) { if ( manifold 2 . points [ j ] . id . is equal ( id ) ) { state 1 [ i ] = point state . persist state ; break ; } } } for ( int i = 0 ; i < manifold 2 . point count ; i ++ ) { contact id id = manifold 2 . points [ i ] . id ; state 2 [ i ] = point state . add state ; for ( int j = 0 ; j < manifold 1 . point count ; j ++ ) { if ( manifold 1 . points [ j ] . id . is equal ( id ) ) { state 2 [ i ] = point state . persist state ; break ; } } } } <SENTENCE_END/>

point

<SENTENCE_START> { for ( int i = 0 ; i < settings . max manifold points ; i ++ ) { state 1 [ i ] = point state . null state ; state 2 [ i ] = point state . null state ; } for ( int i = 0 ; i < manifold 1 . point count ; i ++ ) { contact id id = manifold 1 . points [ i ] . id ; state 1 [ i ] = point state . remove state ; for ( int j = 0 ; j < manifold 2 . point count ; j ++ ) { if ( manifold 2 . points [ j ] . id . is equal ( id ) ) { state 1 [ i ] = point state . persist state ; break ; } } } for ( int i = 0 ; i < manifold 2 . point count ; i ++ ) { contact id id = manifold 2 . points [ i ] . id ; state 2 [ i ] = point state . add state ; for ( int j = 0 ; j < manifold 1 . point count ; j ++ ) { if ( manifold 1 . points [ j ] . id . is equal ( id ) ) { state 2 [ i ] = point state . persist state ; break ; } } } } <SENTENCE_END/>

(Copy Probability: 28.2%)

<SENTENCE_START> { for ( int i = 0 ; i < settings . max manifold points ; i ++ ) { state 1 [ i ] = point state . null state ; state 2 [ i ] = point state . null state ; } for ( int i = 0 ; i < manifold 1 . point count ; i ++ ) { contact id id = manifold 1 . points [ i ] . id ; state 1 [ i ] = point state . remove state ; for ( int j = 0 ; j < manifold 2 . point count ; j ++ ) { if ( manifold 2 . points [ j ] . id . is equal ( id ) ) { state 1 [ i ] = point state . persist state ; break ; } } } for ( int i = 0 ; i < manifold 2 . point count ; i ++ ) { contact id id = manifold 2 . points [ i ] . id ; state 2 [ i ] = point state . add state ; for ( int j = 0 ; j < manifold 1 . point count ; j ++ ) { if ( manifold 1 . points [ j ] . id . is equal ( id ) ) { state 2 [ i ] = point state . persist state ; break ; } } } } <SENTENCE_END/>

states

<SENTENCE_START> { for ( int i = 0 ; i < settings . max manifold points ; i ++ ) { state 1 [ i ] = point state . null state ; state 2 [ i ] = point state . null state ; } for ( int i = 0 ; i < manifold 1 . point count ; i ++ ) { contact id id = manifold 1 . points [ i ] . id ; state 1 [ i ] = point state . remove state ; for ( int j = 0 ; j < manifold 2 . point count ; j ++ ) { if ( manifold 2 . points [ j ] . id . is equal ( id ) ) { state 1 [ i ] = point state . persist state ; break ; } } } for ( int i = 0 ; i < manifold 2 . point count ; i ++ ) { contact id id = manifold 2 . points [ i ] . id ; state 2 [ i ] = point state . add state ; for ( int j = 0 ; j < manifold 1 . point count ; j ++ ) { if ( manifold 1 . points [ j ] . id . is equal ( id ) ) { state 2 [ i ] = point state . persist state ; break ; } } } } <SENTENCE_END/>

(Copy Probability: 10.6%)

<SENTENCE_START> { for ( int i = 0 ; i < settings . max manifold points ; i ++ ) { state 1 [ i ] = point state . null state ; state 2 [ i ] = point state . null state ; } for ( int i = 0 ; i < manifold 1 . point count ; i ++ ) { contact id id = manifold 1 . points [ i ] . id ; state 1 [ i ] = point state . remove state ; for ( int j = 0 ; j < manifold 2 . point count ; j ++ ) { if ( manifold 2 . points [ j ] . id . is equal ( id ) ) { state 1 [ i ] = point state . persist state ; break ; } } } for ( int i = 0 ; i < manifold 2 . point count ; i ++ ) { contact id id = manifold 2 . points [ i ] . id ; state 2 [ i ] = point state . add state ; for ( int j = 0 ; j < manifold 1 . point count ; j ++ ) { if ( manifold 1 . points [ j ] . id . is equal ( id ) ) { state 2 [ i ] = point state . persist state ; break ; } } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int i = 0 ; i < settings . max manifold points ; i ++ ) { state 1 [ i ] = point state . null state ; state 2 [ i ] = point state . null state ; } for ( int i = 0 ; i < manifold 1 . point count ; i ++ ) { contact id id = manifold 1 . points [ i ] . id ; state 1 [ i ] = point state . remove state ; for ( int j = 0 ; j < manifold 2 . point count ; j ++ ) { if ( manifold 2 . points [ j ] . id . is equal ( id ) ) { state 1 [ i ] = point state . persist state ; break ; } } } for ( int i = 0 ; i < manifold 2 . point count ; i ++ ) { contact id id = manifold 2 . points [ i ] . id ; state 2 [ i ] = point state . add state ; for ( int j = 0 ; j < manifold 1 . point count ; j ++ ) { if ( manifold 1 . points [ j ] . id . is equal ( id ) ) { state 2 [ i ] = point state . persist state ; break ; } } } } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { for ( int i = 0 ; i < settings . max manifold points ; i ++ ) { state 1 [ i ] = point state . null state ; state 2 [ i ] = point state . null state ; } for ( int i = 0 ; i < manifold 1 . point count ; i ++ ) { contact id id = manifold 1 . points [ i ] . id ; state 1 [ i ] = point state . remove state ; for ( int j = 0 ; j < manifold 2 . point count ; j ++ ) { if ( manifold 2 . points [ j ] . id . is equal ( id ) ) { state 1 [ i ] = point state . persist state ; break ; } } } for ( int i = 0 ; i < manifold 2 . point count ; i ++ ) { contact id id = manifold 2 . points [ i ] . id ; state 2 [ i ] = point state . add state ; for ( int j = 0 ; j < manifold 1 . point count ; j ++ ) { if ( manifold 1 . points [ j ] . id . is equal ( id ) ) { state 2 [ i ] = point state . persist state ; break ; } } } } <SENTENCE_END/>


Original Name clip,segment,to,line

clip

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

segment

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

(Copy Probability: 8.2%)

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

to

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

(Copy Probability: 7.3%)

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

line

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { int num out = 0 ; final clip vertex v in 0 = v in [ 0 ] ; final clip vertex v in 1 = v in [ 1 ] ; final vec 2 v in 0 v = v in 0 . v ; final vec 2 v in 1 v = v in 1 . v ; float distance 0 = vec 2 . dot ( normal , v in 0 v ) - offset ; float distance 1 = vec 2 . dot ( normal , v in 1 v ) - offset ; if ( distance 0 <= 0.0f ) { v out [ num out ++ ] . set ( v in 0 ) ; } if ( distance 1 <= 0.0f ) { v out [ num out ++ ] . set ( v in 1 ) ; } if ( distance 0 * distance 1 < 0.0f ) { float interp = distance 0 / ( distance 0 - distance 1 ) ; clip vertex v out no = v out [ num out ] ; v out no . v . x = v in 0 v . x + interp * ( v in 1 v . x - v in 0 v . x ) ; v out no . v . y = v in 0 v . y + interp * ( v in 1 v . y - v in 0 v . y ) ; v out no . id . index a = ( byte ) vertex index a ; v out no . id . index b = v in 0 . id . index b ; v out no . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; v out no . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ++ num out ; } return num out ; } <SENTENCE_END/>


Original Name collide,circles

collide

<SENTENCE_START> { manifold . point count = 0 ; vec 2 circle 1 p = circle 1 . m p ; vec 2 circle 2 p = circle 2 . m p ; float p ax = ( xf a . q . c * circle 1 p . x - xf a . q . s * circle 1 p . y ) + xf a . p . x ; float p ay = ( xf a . q . s * circle 1 p . x + xf a . q . c * circle 1 p . y ) + xf a . p . y ; float p bx = ( xf b . q . c * circle 2 p . x - xf b . q . s * circle 2 p . y ) + xf b . p . x ; float p by = ( xf b . q . s * circle 2 p . x + xf b . q . c * circle 2 p . y ) + xf b . p . y ; float dx = p bx - p ax ; float dy = p by - p ay ; float dist sqr = dx * dx + dy * dy ; final float radius = circle 1 . m radius + circle 2 . m radius ; if ( dist sqr > radius * radius ) { return ; } manifold . type = manifold type . circles ; manifold . local point . set ( circle 1 p ) ; manifold . local normal . set zero ( ) ; manifold . point count = 1 ; manifold . points [ 0 ] . local point . set ( circle 2 p ) ; manifold . points [ 0 ] . id . zero ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { manifold . point count = 0 ; vec 2 circle 1 p = circle 1 . m p ; vec 2 circle 2 p = circle 2 . m p ; float p ax = ( xf a . q . c * circle 1 p . x - xf a . q . s * circle 1 p . y ) + xf a . p . x ; float p ay = ( xf a . q . s * circle 1 p . x + xf a . q . c * circle 1 p . y ) + xf a . p . y ; float p bx = ( xf b . q . c * circle 2 p . x - xf b . q . s * circle 2 p . y ) + xf b . p . x ; float p by = ( xf b . q . s * circle 2 p . x + xf b . q . c * circle 2 p . y ) + xf b . p . y ; float dx = p bx - p ax ; float dy = p by - p ay ; float dist sqr = dx * dx + dy * dy ; final float radius = circle 1 . m radius + circle 2 . m radius ; if ( dist sqr > radius * radius ) { return ; } manifold . type = manifold type . circles ; manifold . local point . set ( circle 1 p ) ; manifold . local normal . set zero ( ) ; manifold . point count = 1 ; manifold . points [ 0 ] . local point . set ( circle 2 p ) ; manifold . points [ 0 ] . id . zero ( ) ; } <SENTENCE_END/>

circles

<SENTENCE_START> { manifold . point count = 0 ; vec 2 circle 1 p = circle 1 . m p ; vec 2 circle 2 p = circle 2 . m p ; float p ax = ( xf a . q . c * circle 1 p . x - xf a . q . s * circle 1 p . y ) + xf a . p . x ; float p ay = ( xf a . q . s * circle 1 p . x + xf a . q . c * circle 1 p . y ) + xf a . p . y ; float p bx = ( xf b . q . c * circle 2 p . x - xf b . q . s * circle 2 p . y ) + xf b . p . x ; float p by = ( xf b . q . s * circle 2 p . x + xf b . q . c * circle 2 p . y ) + xf b . p . y ; float dx = p bx - p ax ; float dy = p by - p ay ; float dist sqr = dx * dx + dy * dy ; final float radius = circle 1 . m radius + circle 2 . m radius ; if ( dist sqr > radius * radius ) { return ; } manifold . type = manifold type . circles ; manifold . local point . set ( circle 1 p ) ; manifold . local normal . set zero ( ) ; manifold . point count = 1 ; manifold . points [ 0 ] . local point . set ( circle 2 p ) ; manifold . points [ 0 ] . id . zero ( ) ; } <SENTENCE_END/>

(Copy Probability: 10.7%)

<SENTENCE_START> { manifold . point count = 0 ; vec 2 circle 1 p = circle 1 . m p ; vec 2 circle 2 p = circle 2 . m p ; float p ax = ( xf a . q . c * circle 1 p . x - xf a . q . s * circle 1 p . y ) + xf a . p . x ; float p ay = ( xf a . q . s * circle 1 p . x + xf a . q . c * circle 1 p . y ) + xf a . p . y ; float p bx = ( xf b . q . c * circle 2 p . x - xf b . q . s * circle 2 p . y ) + xf b . p . x ; float p by = ( xf b . q . s * circle 2 p . x + xf b . q . c * circle 2 p . y ) + xf b . p . y ; float dx = p bx - p ax ; float dy = p by - p ay ; float dist sqr = dx * dx + dy * dy ; final float radius = circle 1 . m radius + circle 2 . m radius ; if ( dist sqr > radius * radius ) { return ; } manifold . type = manifold type . circles ; manifold . local point . set ( circle 1 p ) ; manifold . local normal . set zero ( ) ; manifold . point count = 1 ; manifold . points [ 0 ] . local point . set ( circle 2 p ) ; manifold . points [ 0 ] . id . zero ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { manifold . point count = 0 ; vec 2 circle 1 p = circle 1 . m p ; vec 2 circle 2 p = circle 2 . m p ; float p ax = ( xf a . q . c * circle 1 p . x - xf a . q . s * circle 1 p . y ) + xf a . p . x ; float p ay = ( xf a . q . s * circle 1 p . x + xf a . q . c * circle 1 p . y ) + xf a . p . y ; float p bx = ( xf b . q . c * circle 2 p . x - xf b . q . s * circle 2 p . y ) + xf b . p . x ; float p by = ( xf b . q . s * circle 2 p . x + xf b . q . c * circle 2 p . y ) + xf b . p . y ; float dx = p bx - p ax ; float dy = p by - p ay ; float dist sqr = dx * dx + dy * dy ; final float radius = circle 1 . m radius + circle 2 . m radius ; if ( dist sqr > radius * radius ) { return ; } manifold . type = manifold type . circles ; manifold . local point . set ( circle 1 p ) ; manifold . local normal . set zero ( ) ; manifold . point count = 1 ; manifold . points [ 0 ] . local point . set ( circle 2 p ) ; manifold . points [ 0 ] . id . zero ( ) ; } <SENTENCE_END/>

(Copy Probability: 10.5%)

<SENTENCE_START> { manifold . point count = 0 ; vec 2 circle 1 p = circle 1 . m p ; vec 2 circle 2 p = circle 2 . m p ; float p ax = ( xf a . q . c * circle 1 p . x - xf a . q . s * circle 1 p . y ) + xf a . p . x ; float p ay = ( xf a . q . s * circle 1 p . x + xf a . q . c * circle 1 p . y ) + xf a . p . y ; float p bx = ( xf b . q . c * circle 2 p . x - xf b . q . s * circle 2 p . y ) + xf b . p . x ; float p by = ( xf b . q . s * circle 2 p . x + xf b . q . c * circle 2 p . y ) + xf b . p . y ; float dx = p bx - p ax ; float dy = p by - p ay ; float dist sqr = dx * dx + dy * dy ; final float radius = circle 1 . m radius + circle 2 . m radius ; if ( dist sqr > radius * radius ) { return ; } manifold . type = manifold type . circles ; manifold . local point . set ( circle 1 p ) ; manifold . local normal . set zero ( ) ; manifold . point count = 1 ; manifold . points [ 0 ] . local point . set ( circle 2 p ) ; manifold . points [ 0 ] . id . zero ( ) ; } <SENTENCE_END/>


Original Name collide,polygon,and,circle

collide

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

polygon

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

(Copy Probability: 7.6%)

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

and

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

(Copy Probability: 6.7%)

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

circle

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { manifold . point count = 0 ; final vec 2 circlep = circle . m p ; final rot xf bq = xf b . q ; final rot xf aq = xf a . q ; final float cx = ( xf bq . c * circlep . x - xf bq . s * circlep . y ) + xf b . p . x ; final float cy = ( xf bq . s * circlep . x + xf bq . c * circlep . y ) + xf b . p . y ; final float px = cx - xf a . p . x ; final float py = cy - xf a . p . y ; final float c localx = ( xf aq . c * px + xf aq . s * py ) ; final float c localy = ( - xf aq . s * px + xf aq . c * py ) ; int normal index = 0 ; float separation = - float . max value ; final float radius = polygon . m radius + circle . m radius ; final int vertex count = polygon . m count ; float s ; final vec 2 [ ] vertices = polygon . m vertices ; final vec 2 [ ] normals = polygon . m normals ; for ( int i = 0 ; i < vertex count ; i ++ ) { final vec 2 vertex = vertices [ i ] ; final float tempx = c localx - vertex . x ; final float tempy = c localy - vertex . y ; s = normals [ i ] . x * tempx + normals [ i ] . y * tempy ; if ( s > radius ) { return ; } if ( s > separation ) { separation = s ; normal index = i ; } } final int vert index 1 = normal index ; final int vert index 2 = vert index 1 + 1 < vertex count ? vert index 1 + 1 : 0 ; final vec 2 v 1 = vertices [ vert index 1 ] ; final vec 2 v 2 = vertices [ vert index 2 ] ; if ( separation < settings . epsilon ) { manifold . point count = 1 ; manifold . type = manifold type . face a ; final vec 2 normal = normals [ normal index ] ; manifold . local normal . x = normal . x ; manifold . local normal . y = normal . y ; manifold . local point . x = ( v 1 . x + v 2 . x ) * .5f ; manifold . local point . y = ( v 1 . y + v 2 . y ) * .5f ; final manifold point mpoint = manifold . points [ 0 ] ; mpoint . local point . x = circlep . x ; mpoint . local point . y = circlep . y ; mpoint . id . zero ( ) ; return ; } final float temp x = c localx - v 1 . x ; final float temp y = c localy - v 1 . y ; final float temp 2 x = v 2 . x - v 1 . x ; final float temp 2 y = v 2 . y - v 1 . y ; final float u 1 = temp x * temp 2 x + temp y * temp 2 y ; final float temp 3 x = c localx - v 2 . x ; final float temp 3 y = c localy - v 2 . y ; final float temp 4 x = v 1 . x - v 2 . x ; final float temp 4 y = v 1 . y - v 2 . y ; final float u 2 = temp 3 x * temp 4 x + temp 3 y * temp 4 y ; if ( u 1 <= 0f ) { final float dx = c localx - v 1 . x ; final float dy = c localy - v 1 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 1 . x ; manifold . local normal . y = c localy - v 1 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 1 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else if ( u 2 <= 0.0f ) { final float dx = c localx - v 2 . x ; final float dy = c localy - v 2 . y ; if ( dx * dx + dy * dy > radius * radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . x = c localx - v 2 . x ; manifold . local normal . y = c localy - v 2 . y ; manifold . local normal . normalize ( ) ; manifold . local point . set ( v 2 ) ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } else { final float fcx = ( v 1 . x + v 2 . x ) * .5f ; final float fcy = ( v 1 . y + v 2 . y ) * .5f ; final float tx = c localx - fcx ; final float ty = c localy - fcy ; final vec 2 normal = normals [ vert index 1 ] ; separation = tx * normal . x + ty * normal . y ; if ( separation > radius ) { return ; } manifold . point count = 1 ; manifold . type = manifold type . face a ; manifold . local normal . set ( normals [ vert index 1 ] ) ; manifold . local point . x = fcx ; manifold . local point . y = fcy ; manifold . points [ 0 ] . local point . set ( circlep ) ; manifold . points [ 0 ] . id . zero ( ) ; } } <SENTENCE_END/>


Original Name find,max,separation

find

<SENTENCE_START> { int count 1 = poly 1 . m count ; int count 2 = poly 2 . m count ; vec 2 [ ] n 1 s = poly 1 . m normals ; vec 2 [ ] v 1 s = poly 1 . m vertices ; vec 2 [ ] v 2 s = poly 2 . m vertices ; transform . mul trans to out unsafe ( xf 2 , xf 1 , xf ) ; final rot xfq = xf . q ; int best index = 0 ; float max separation = - float . max value ; for ( int i = 0 ; i < count 1 ; i ++ ) { rot . mul to out unsafe ( xfq , n 1 s [ i ] , n ) ; transform . mul to out unsafe ( xf , v 1 s [ i ] , v 1 ) ; float si = float . max value ; for ( int j = 0 ; j < count 2 ; ++ j ) { vec 2 v 2 sj = v 2 s [ j ] ; float sij = n . x * ( v 2 sj . x - v 1 . x ) + n . y * ( v 2 sj . y - v 1 . y ) ; if ( sij < si ) { si = sij ; } } if ( si > max separation ) { max separation = si ; best index = i ; } } results . edge index = best index ; results . separation = max separation ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { int count 1 = poly 1 . m count ; int count 2 = poly 2 . m count ; vec 2 [ ] n 1 s = poly 1 . m normals ; vec 2 [ ] v 1 s = poly 1 . m vertices ; vec 2 [ ] v 2 s = poly 2 . m vertices ; transform . mul trans to out unsafe ( xf 2 , xf 1 , xf ) ; final rot xfq = xf . q ; int best index = 0 ; float max separation = - float . max value ; for ( int i = 0 ; i < count 1 ; i ++ ) { rot . mul to out unsafe ( xfq , n 1 s [ i ] , n ) ; transform . mul to out unsafe ( xf , v 1 s [ i ] , v 1 ) ; float si = float . max value ; for ( int j = 0 ; j < count 2 ; ++ j ) { vec 2 v 2 sj = v 2 s [ j ] ; float sij = n . x * ( v 2 sj . x - v 1 . x ) + n . y * ( v 2 sj . y - v 1 . y ) ; if ( sij < si ) { si = sij ; } } if ( si > max separation ) { max separation = si ; best index = i ; } } results . edge index = best index ; results . separation = max separation ; } <SENTENCE_END/>

max

<SENTENCE_START> { int count 1 = poly 1 . m count ; int count 2 = poly 2 . m count ; vec 2 [ ] n 1 s = poly 1 . m normals ; vec 2 [ ] v 1 s = poly 1 . m vertices ; vec 2 [ ] v 2 s = poly 2 . m vertices ; transform . mul trans to out unsafe ( xf 2 , xf 1 , xf ) ; final rot xfq = xf . q ; int best index = 0 ; float max separation = - float . max value ; for ( int i = 0 ; i < count 1 ; i ++ ) { rot . mul to out unsafe ( xfq , n 1 s [ i ] , n ) ; transform . mul to out unsafe ( xf , v 1 s [ i ] , v 1 ) ; float si = float . max value ; for ( int j = 0 ; j < count 2 ; ++ j ) { vec 2 v 2 sj = v 2 s [ j ] ; float sij = n . x * ( v 2 sj . x - v 1 . x ) + n . y * ( v 2 sj . y - v 1 . y ) ; if ( sij < si ) { si = sij ; } } if ( si > max separation ) { max separation = si ; best index = i ; } } results . edge index = best index ; results . separation = max separation ; } <SENTENCE_END/>

(Copy Probability: 15.1%)

<SENTENCE_START> { int count 1 = poly 1 . m count ; int count 2 = poly 2 . m count ; vec 2 [ ] n 1 s = poly 1 . m normals ; vec 2 [ ] v 1 s = poly 1 . m vertices ; vec 2 [ ] v 2 s = poly 2 . m vertices ; transform . mul trans to out unsafe ( xf 2 , xf 1 , xf ) ; final rot xfq = xf . q ; int best index = 0 ; float max separation = - float . max value ; for ( int i = 0 ; i < count 1 ; i ++ ) { rot . mul to out unsafe ( xfq , n 1 s [ i ] , n ) ; transform . mul to out unsafe ( xf , v 1 s [ i ] , v 1 ) ; float si = float . max value ; for ( int j = 0 ; j < count 2 ; ++ j ) { vec 2 v 2 sj = v 2 s [ j ] ; float sij = n . x * ( v 2 sj . x - v 1 . x ) + n . y * ( v 2 sj . y - v 1 . y ) ; if ( sij < si ) { si = sij ; } } if ( si > max separation ) { max separation = si ; best index = i ; } } results . edge index = best index ; results . separation = max separation ; } <SENTENCE_END/>

separation

<SENTENCE_START> { int count 1 = poly 1 . m count ; int count 2 = poly 2 . m count ; vec 2 [ ] n 1 s = poly 1 . m normals ; vec 2 [ ] v 1 s = poly 1 . m vertices ; vec 2 [ ] v 2 s = poly 2 . m vertices ; transform . mul trans to out unsafe ( xf 2 , xf 1 , xf ) ; final rot xfq = xf . q ; int best index = 0 ; float max separation = - float . max value ; for ( int i = 0 ; i < count 1 ; i ++ ) { rot . mul to out unsafe ( xfq , n 1 s [ i ] , n ) ; transform . mul to out unsafe ( xf , v 1 s [ i ] , v 1 ) ; float si = float . max value ; for ( int j = 0 ; j < count 2 ; ++ j ) { vec 2 v 2 sj = v 2 s [ j ] ; float sij = n . x * ( v 2 sj . x - v 1 . x ) + n . y * ( v 2 sj . y - v 1 . y ) ; if ( sij < si ) { si = sij ; } } if ( si > max separation ) { max separation = si ; best index = i ; } } results . edge index = best index ; results . separation = max separation ; } <SENTENCE_END/>

(Copy Probability: 5.8%)

<SENTENCE_START> { int count 1 = poly 1 . m count ; int count 2 = poly 2 . m count ; vec 2 [ ] n 1 s = poly 1 . m normals ; vec 2 [ ] v 1 s = poly 1 . m vertices ; vec 2 [ ] v 2 s = poly 2 . m vertices ; transform . mul trans to out unsafe ( xf 2 , xf 1 , xf ) ; final rot xfq = xf . q ; int best index = 0 ; float max separation = - float . max value ; for ( int i = 0 ; i < count 1 ; i ++ ) { rot . mul to out unsafe ( xfq , n 1 s [ i ] , n ) ; transform . mul to out unsafe ( xf , v 1 s [ i ] , v 1 ) ; float si = float . max value ; for ( int j = 0 ; j < count 2 ; ++ j ) { vec 2 v 2 sj = v 2 s [ j ] ; float sij = n . x * ( v 2 sj . x - v 1 . x ) + n . y * ( v 2 sj . y - v 1 . y ) ; if ( sij < si ) { si = sij ; } } if ( si > max separation ) { max separation = si ; best index = i ; } } results . edge index = best index ; results . separation = max separation ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int count 1 = poly 1 . m count ; int count 2 = poly 2 . m count ; vec 2 [ ] n 1 s = poly 1 . m normals ; vec 2 [ ] v 1 s = poly 1 . m vertices ; vec 2 [ ] v 2 s = poly 2 . m vertices ; transform . mul trans to out unsafe ( xf 2 , xf 1 , xf ) ; final rot xfq = xf . q ; int best index = 0 ; float max separation = - float . max value ; for ( int i = 0 ; i < count 1 ; i ++ ) { rot . mul to out unsafe ( xfq , n 1 s [ i ] , n ) ; transform . mul to out unsafe ( xf , v 1 s [ i ] , v 1 ) ; float si = float . max value ; for ( int j = 0 ; j < count 2 ; ++ j ) { vec 2 v 2 sj = v 2 s [ j ] ; float sij = n . x * ( v 2 sj . x - v 1 . x ) + n . y * ( v 2 sj . y - v 1 . y ) ; if ( sij < si ) { si = sij ; } } if ( si > max separation ) { max separation = si ; best index = i ; } } results . edge index = best index ; results . separation = max separation ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { int count 1 = poly 1 . m count ; int count 2 = poly 2 . m count ; vec 2 [ ] n 1 s = poly 1 . m normals ; vec 2 [ ] v 1 s = poly 1 . m vertices ; vec 2 [ ] v 2 s = poly 2 . m vertices ; transform . mul trans to out unsafe ( xf 2 , xf 1 , xf ) ; final rot xfq = xf . q ; int best index = 0 ; float max separation = - float . max value ; for ( int i = 0 ; i < count 1 ; i ++ ) { rot . mul to out unsafe ( xfq , n 1 s [ i ] , n ) ; transform . mul to out unsafe ( xf , v 1 s [ i ] , v 1 ) ; float si = float . max value ; for ( int j = 0 ; j < count 2 ; ++ j ) { vec 2 v 2 sj = v 2 s [ j ] ; float sij = n . x * ( v 2 sj . x - v 1 . x ) + n . y * ( v 2 sj . y - v 1 . y ) ; if ( sij < si ) { si = sij ; } } if ( si > max separation ) { max separation = si ; best index = i ; } } results . edge index = best index ; results . separation = max separation ; } <SENTENCE_END/>


Original Name find,incident,edge

find

<SENTENCE_START> { int count 1 = poly 1 . m count ; final vec 2 [ ] normals 1 = poly 1 . m normals ; int count 2 = poly 2 . m count ; final vec 2 [ ] vertices 2 = poly 2 . m vertices ; final vec 2 [ ] normals 2 = poly 2 . m normals ; assert ( 0 <= edge 1 && edge 1 < count 1 ) ; final clip vertex c 0 = c [ 0 ] ; final clip vertex c 1 = c [ 1 ] ; final rot xf 1 q = xf 1 . q ; final rot xf 2 q = xf 2 . q ; final vec 2 v = normals 1 [ edge 1 ] ; final float tempx = xf 1 q . c * v . x - xf 1 q . s * v . y ; final float tempy = xf 1 q . s * v . x + xf 1 q . c * v . y ; final float normal 1 x = xf 2 q . c * tempx + xf 2 q . s * tempy ; final float normal 1 y = - xf 2 q . s * tempx + xf 2 q . c * tempy ; int index = 0 ; float min dot = float . max value ; for ( int i = 0 ; i < count 2 ; ++ i ) { vec 2 b = normals 2 [ i ] ; float dot = normal 1 x * b . x + normal 1 y * b . y ; if ( dot < min dot ) { min dot = dot ; index = i ; } } int i 1 = index ; int i 2 = i 1 + 1 < count 2 ? i 1 + 1 : 0 ; vec 2 v 1 = vertices 2 [ i 1 ] ; vec 2 out = c 0 . v ; out . x = ( xf 2 q . c * v 1 . x - xf 2 q . s * v 1 . y ) + xf 2 . p . x ; out . y = ( xf 2 q . s * v 1 . x + xf 2 q . c * v 1 . y ) + xf 2 . p . y ; c 0 . id . index a = ( byte ) edge 1 ; c 0 . id . index b = ( byte ) i 1 ; c 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; vec 2 v 2 = vertices 2 [ i 2 ] ; vec 2 out 1 = c 1 . v ; out 1 . x = ( xf 2 q . c * v 2 . x - xf 2 q . s * v 2 . y ) + xf 2 . p . x ; out 1 . y = ( xf 2 q . s * v 2 . x + xf 2 q . c * v 2 . y ) + xf 2 . p . y ; c 1 . id . index a = ( byte ) edge 1 ; c 1 . id . index b = ( byte ) i 2 ; c 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { int count 1 = poly 1 . m count ; final vec 2 [ ] normals 1 = poly 1 . m normals ; int count 2 = poly 2 . m count ; final vec 2 [ ] vertices 2 = poly 2 . m vertices ; final vec 2 [ ] normals 2 = poly 2 . m normals ; assert ( 0 <= edge 1 && edge 1 < count 1 ) ; final clip vertex c 0 = c [ 0 ] ; final clip vertex c 1 = c [ 1 ] ; final rot xf 1 q = xf 1 . q ; final rot xf 2 q = xf 2 . q ; final vec 2 v = normals 1 [ edge 1 ] ; final float tempx = xf 1 q . c * v . x - xf 1 q . s * v . y ; final float tempy = xf 1 q . s * v . x + xf 1 q . c * v . y ; final float normal 1 x = xf 2 q . c * tempx + xf 2 q . s * tempy ; final float normal 1 y = - xf 2 q . s * tempx + xf 2 q . c * tempy ; int index = 0 ; float min dot = float . max value ; for ( int i = 0 ; i < count 2 ; ++ i ) { vec 2 b = normals 2 [ i ] ; float dot = normal 1 x * b . x + normal 1 y * b . y ; if ( dot < min dot ) { min dot = dot ; index = i ; } } int i 1 = index ; int i 2 = i 1 + 1 < count 2 ? i 1 + 1 : 0 ; vec 2 v 1 = vertices 2 [ i 1 ] ; vec 2 out = c 0 . v ; out . x = ( xf 2 q . c * v 1 . x - xf 2 q . s * v 1 . y ) + xf 2 . p . x ; out . y = ( xf 2 q . s * v 1 . x + xf 2 q . c * v 1 . y ) + xf 2 . p . y ; c 0 . id . index a = ( byte ) edge 1 ; c 0 . id . index b = ( byte ) i 1 ; c 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; vec 2 v 2 = vertices 2 [ i 2 ] ; vec 2 out 1 = c 1 . v ; out 1 . x = ( xf 2 q . c * v 2 . x - xf 2 q . s * v 2 . y ) + xf 2 . p . x ; out 1 . y = ( xf 2 q . s * v 2 . x + xf 2 q . c * v 2 . y ) + xf 2 . p . y ; c 1 . id . index a = ( byte ) edge 1 ; c 1 . id . index b = ( byte ) i 2 ; c 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; } <SENTENCE_END/>

incident

<SENTENCE_START> { int count 1 = poly 1 . m count ; final vec 2 [ ] normals 1 = poly 1 . m normals ; int count 2 = poly 2 . m count ; final vec 2 [ ] vertices 2 = poly 2 . m vertices ; final vec 2 [ ] normals 2 = poly 2 . m normals ; assert ( 0 <= edge 1 && edge 1 < count 1 ) ; final clip vertex c 0 = c [ 0 ] ; final clip vertex c 1 = c [ 1 ] ; final rot xf 1 q = xf 1 . q ; final rot xf 2 q = xf 2 . q ; final vec 2 v = normals 1 [ edge 1 ] ; final float tempx = xf 1 q . c * v . x - xf 1 q . s * v . y ; final float tempy = xf 1 q . s * v . x + xf 1 q . c * v . y ; final float normal 1 x = xf 2 q . c * tempx + xf 2 q . s * tempy ; final float normal 1 y = - xf 2 q . s * tempx + xf 2 q . c * tempy ; int index = 0 ; float min dot = float . max value ; for ( int i = 0 ; i < count 2 ; ++ i ) { vec 2 b = normals 2 [ i ] ; float dot = normal 1 x * b . x + normal 1 y * b . y ; if ( dot < min dot ) { min dot = dot ; index = i ; } } int i 1 = index ; int i 2 = i 1 + 1 < count 2 ? i 1 + 1 : 0 ; vec 2 v 1 = vertices 2 [ i 1 ] ; vec 2 out = c 0 . v ; out . x = ( xf 2 q . c * v 1 . x - xf 2 q . s * v 1 . y ) + xf 2 . p . x ; out . y = ( xf 2 q . s * v 1 . x + xf 2 q . c * v 1 . y ) + xf 2 . p . y ; c 0 . id . index a = ( byte ) edge 1 ; c 0 . id . index b = ( byte ) i 1 ; c 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; vec 2 v 2 = vertices 2 [ i 2 ] ; vec 2 out 1 = c 1 . v ; out 1 . x = ( xf 2 q . c * v 2 . x - xf 2 q . s * v 2 . y ) + xf 2 . p . x ; out 1 . y = ( xf 2 q . s * v 2 . x + xf 2 q . c * v 2 . y ) + xf 2 . p . y ; c 1 . id . index a = ( byte ) edge 1 ; c 1 . id . index b = ( byte ) i 2 ; c 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; } <SENTENCE_END/>

(Copy Probability: 10.0%)

<SENTENCE_START> { int count 1 = poly 1 . m count ; final vec 2 [ ] normals 1 = poly 1 . m normals ; int count 2 = poly 2 . m count ; final vec 2 [ ] vertices 2 = poly 2 . m vertices ; final vec 2 [ ] normals 2 = poly 2 . m normals ; assert ( 0 <= edge 1 && edge 1 < count 1 ) ; final clip vertex c 0 = c [ 0 ] ; final clip vertex c 1 = c [ 1 ] ; final rot xf 1 q = xf 1 . q ; final rot xf 2 q = xf 2 . q ; final vec 2 v = normals 1 [ edge 1 ] ; final float tempx = xf 1 q . c * v . x - xf 1 q . s * v . y ; final float tempy = xf 1 q . s * v . x + xf 1 q . c * v . y ; final float normal 1 x = xf 2 q . c * tempx + xf 2 q . s * tempy ; final float normal 1 y = - xf 2 q . s * tempx + xf 2 q . c * tempy ; int index = 0 ; float min dot = float . max value ; for ( int i = 0 ; i < count 2 ; ++ i ) { vec 2 b = normals 2 [ i ] ; float dot = normal 1 x * b . x + normal 1 y * b . y ; if ( dot < min dot ) { min dot = dot ; index = i ; } } int i 1 = index ; int i 2 = i 1 + 1 < count 2 ? i 1 + 1 : 0 ; vec 2 v 1 = vertices 2 [ i 1 ] ; vec 2 out = c 0 . v ; out . x = ( xf 2 q . c * v 1 . x - xf 2 q . s * v 1 . y ) + xf 2 . p . x ; out . y = ( xf 2 q . s * v 1 . x + xf 2 q . c * v 1 . y ) + xf 2 . p . y ; c 0 . id . index a = ( byte ) edge 1 ; c 0 . id . index b = ( byte ) i 1 ; c 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; vec 2 v 2 = vertices 2 [ i 2 ] ; vec 2 out 1 = c 1 . v ; out 1 . x = ( xf 2 q . c * v 2 . x - xf 2 q . s * v 2 . y ) + xf 2 . p . x ; out 1 . y = ( xf 2 q . s * v 2 . x + xf 2 q . c * v 2 . y ) + xf 2 . p . y ; c 1 . id . index a = ( byte ) edge 1 ; c 1 . id . index b = ( byte ) i 2 ; c 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; } <SENTENCE_END/>

edge

<SENTENCE_START> { int count 1 = poly 1 . m count ; final vec 2 [ ] normals 1 = poly 1 . m normals ; int count 2 = poly 2 . m count ; final vec 2 [ ] vertices 2 = poly 2 . m vertices ; final vec 2 [ ] normals 2 = poly 2 . m normals ; assert ( 0 <= edge 1 && edge 1 < count 1 ) ; final clip vertex c 0 = c [ 0 ] ; final clip vertex c 1 = c [ 1 ] ; final rot xf 1 q = xf 1 . q ; final rot xf 2 q = xf 2 . q ; final vec 2 v = normals 1 [ edge 1 ] ; final float tempx = xf 1 q . c * v . x - xf 1 q . s * v . y ; final float tempy = xf 1 q . s * v . x + xf 1 q . c * v . y ; final float normal 1 x = xf 2 q . c * tempx + xf 2 q . s * tempy ; final float normal 1 y = - xf 2 q . s * tempx + xf 2 q . c * tempy ; int index = 0 ; float min dot = float . max value ; for ( int i = 0 ; i < count 2 ; ++ i ) { vec 2 b = normals 2 [ i ] ; float dot = normal 1 x * b . x + normal 1 y * b . y ; if ( dot < min dot ) { min dot = dot ; index = i ; } } int i 1 = index ; int i 2 = i 1 + 1 < count 2 ? i 1 + 1 : 0 ; vec 2 v 1 = vertices 2 [ i 1 ] ; vec 2 out = c 0 . v ; out . x = ( xf 2 q . c * v 1 . x - xf 2 q . s * v 1 . y ) + xf 2 . p . x ; out . y = ( xf 2 q . s * v 1 . x + xf 2 q . c * v 1 . y ) + xf 2 . p . y ; c 0 . id . index a = ( byte ) edge 1 ; c 0 . id . index b = ( byte ) i 1 ; c 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; vec 2 v 2 = vertices 2 [ i 2 ] ; vec 2 out 1 = c 1 . v ; out 1 . x = ( xf 2 q . c * v 2 . x - xf 2 q . s * v 2 . y ) + xf 2 . p . x ; out 1 . y = ( xf 2 q . s * v 2 . x + xf 2 q . c * v 2 . y ) + xf 2 . p . y ; c 1 . id . index a = ( byte ) edge 1 ; c 1 . id . index b = ( byte ) i 2 ; c 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { int count 1 = poly 1 . m count ; final vec 2 [ ] normals 1 = poly 1 . m normals ; int count 2 = poly 2 . m count ; final vec 2 [ ] vertices 2 = poly 2 . m vertices ; final vec 2 [ ] normals 2 = poly 2 . m normals ; assert ( 0 <= edge 1 && edge 1 < count 1 ) ; final clip vertex c 0 = c [ 0 ] ; final clip vertex c 1 = c [ 1 ] ; final rot xf 1 q = xf 1 . q ; final rot xf 2 q = xf 2 . q ; final vec 2 v = normals 1 [ edge 1 ] ; final float tempx = xf 1 q . c * v . x - xf 1 q . s * v . y ; final float tempy = xf 1 q . s * v . x + xf 1 q . c * v . y ; final float normal 1 x = xf 2 q . c * tempx + xf 2 q . s * tempy ; final float normal 1 y = - xf 2 q . s * tempx + xf 2 q . c * tempy ; int index = 0 ; float min dot = float . max value ; for ( int i = 0 ; i < count 2 ; ++ i ) { vec 2 b = normals 2 [ i ] ; float dot = normal 1 x * b . x + normal 1 y * b . y ; if ( dot < min dot ) { min dot = dot ; index = i ; } } int i 1 = index ; int i 2 = i 1 + 1 < count 2 ? i 1 + 1 : 0 ; vec 2 v 1 = vertices 2 [ i 1 ] ; vec 2 out = c 0 . v ; out . x = ( xf 2 q . c * v 1 . x - xf 2 q . s * v 1 . y ) + xf 2 . p . x ; out . y = ( xf 2 q . s * v 1 . x + xf 2 q . c * v 1 . y ) + xf 2 . p . y ; c 0 . id . index a = ( byte ) edge 1 ; c 0 . id . index b = ( byte ) i 1 ; c 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; vec 2 v 2 = vertices 2 [ i 2 ] ; vec 2 out 1 = c 1 . v ; out 1 . x = ( xf 2 q . c * v 2 . x - xf 2 q . s * v 2 . y ) + xf 2 . p . x ; out 1 . y = ( xf 2 q . s * v 2 . x + xf 2 q . c * v 2 . y ) + xf 2 . p . y ; c 1 . id . index a = ( byte ) edge 1 ; c 1 . id . index b = ( byte ) i 2 ; c 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { int count 1 = poly 1 . m count ; final vec 2 [ ] normals 1 = poly 1 . m normals ; int count 2 = poly 2 . m count ; final vec 2 [ ] vertices 2 = poly 2 . m vertices ; final vec 2 [ ] normals 2 = poly 2 . m normals ; assert ( 0 <= edge 1 && edge 1 < count 1 ) ; final clip vertex c 0 = c [ 0 ] ; final clip vertex c 1 = c [ 1 ] ; final rot xf 1 q = xf 1 . q ; final rot xf 2 q = xf 2 . q ; final vec 2 v = normals 1 [ edge 1 ] ; final float tempx = xf 1 q . c * v . x - xf 1 q . s * v . y ; final float tempy = xf 1 q . s * v . x + xf 1 q . c * v . y ; final float normal 1 x = xf 2 q . c * tempx + xf 2 q . s * tempy ; final float normal 1 y = - xf 2 q . s * tempx + xf 2 q . c * tempy ; int index = 0 ; float min dot = float . max value ; for ( int i = 0 ; i < count 2 ; ++ i ) { vec 2 b = normals 2 [ i ] ; float dot = normal 1 x * b . x + normal 1 y * b . y ; if ( dot < min dot ) { min dot = dot ; index = i ; } } int i 1 = index ; int i 2 = i 1 + 1 < count 2 ? i 1 + 1 : 0 ; vec 2 v 1 = vertices 2 [ i 1 ] ; vec 2 out = c 0 . v ; out . x = ( xf 2 q . c * v 1 . x - xf 2 q . s * v 1 . y ) + xf 2 . p . x ; out . y = ( xf 2 q . s * v 1 . x + xf 2 q . c * v 1 . y ) + xf 2 . p . y ; c 0 . id . index a = ( byte ) edge 1 ; c 0 . id . index b = ( byte ) i 1 ; c 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; vec 2 v 2 = vertices 2 [ i 2 ] ; vec 2 out 1 = c 1 . v ; out 1 . x = ( xf 2 q . c * v 2 . x - xf 2 q . s * v 2 . y ) + xf 2 . p . x ; out 1 . y = ( xf 2 q . s * v 2 . x + xf 2 q . c * v 2 . y ) + xf 2 . p . y ; c 1 . id . index a = ( byte ) edge 1 ; c 1 . id . index b = ( byte ) i 2 ; c 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { int count 1 = poly 1 . m count ; final vec 2 [ ] normals 1 = poly 1 . m normals ; int count 2 = poly 2 . m count ; final vec 2 [ ] vertices 2 = poly 2 . m vertices ; final vec 2 [ ] normals 2 = poly 2 . m normals ; assert ( 0 <= edge 1 && edge 1 < count 1 ) ; final clip vertex c 0 = c [ 0 ] ; final clip vertex c 1 = c [ 1 ] ; final rot xf 1 q = xf 1 . q ; final rot xf 2 q = xf 2 . q ; final vec 2 v = normals 1 [ edge 1 ] ; final float tempx = xf 1 q . c * v . x - xf 1 q . s * v . y ; final float tempy = xf 1 q . s * v . x + xf 1 q . c * v . y ; final float normal 1 x = xf 2 q . c * tempx + xf 2 q . s * tempy ; final float normal 1 y = - xf 2 q . s * tempx + xf 2 q . c * tempy ; int index = 0 ; float min dot = float . max value ; for ( int i = 0 ; i < count 2 ; ++ i ) { vec 2 b = normals 2 [ i ] ; float dot = normal 1 x * b . x + normal 1 y * b . y ; if ( dot < min dot ) { min dot = dot ; index = i ; } } int i 1 = index ; int i 2 = i 1 + 1 < count 2 ? i 1 + 1 : 0 ; vec 2 v 1 = vertices 2 [ i 1 ] ; vec 2 out = c 0 . v ; out . x = ( xf 2 q . c * v 1 . x - xf 2 q . s * v 1 . y ) + xf 2 . p . x ; out . y = ( xf 2 q . s * v 1 . x + xf 2 q . c * v 1 . y ) + xf 2 . p . y ; c 0 . id . index a = ( byte ) edge 1 ; c 0 . id . index b = ( byte ) i 1 ; c 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; vec 2 v 2 = vertices 2 [ i 2 ] ; vec 2 out 1 = c 1 . v ; out 1 . x = ( xf 2 q . c * v 2 . x - xf 2 q . s * v 2 . y ) + xf 2 . p . x ; out 1 . y = ( xf 2 q . s * v 2 . x + xf 2 q . c * v 2 . y ) + xf 2 . p . y ; c 1 . id . index a = ( byte ) edge 1 ; c 1 . id . index b = ( byte ) i 2 ; c 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; c 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; } <SENTENCE_END/>


Original Name collide,polygons

collide

<SENTENCE_START> { manifold . point count = 0 ; float total radius = poly a . m radius + poly b . m radius ; find max separation ( results 1 , poly a , xf a , poly b , xf b ) ; if ( results 1 . separation > total radius ) { return ; } find max separation ( results 2 , poly b , xf b , poly a , xf a ) ; if ( results 2 . separation > total radius ) { return ; } final polygon shape poly 1 ; final polygon shape poly 2 ; transform xf 1 , xf 2 ; int edge 1 ; boolean flip ; final float k tol = 0.1f * settings . linear slop ; if ( results 2 . separation > results 1 . separation + k tol ) { poly 1 = poly b ; poly 2 = poly a ; xf 1 = xf b ; xf 2 = xf a ; edge 1 = results 2 . edge index ; manifold . type = manifold type . face b ; flip = true ; } else { poly 1 = poly a ; poly 2 = poly b ; xf 1 = xf a ; xf 2 = xf b ; edge 1 = results 1 . edge index ; manifold . type = manifold type . face a ; flip = false ; } final rot xf 1 q = xf 1 . q ; find incident edge ( incident edge , poly 1 , xf 1 , edge 1 , poly 2 , xf 2 ) ; int count 1 = poly 1 . m count ; final vec 2 [ ] vertices 1 = poly 1 . m vertices ; final int iv 1 = edge 1 ; final int iv 2 = edge 1 + 1 < count 1 ? edge 1 + 1 : 0 ; v 11 . set ( vertices 1 [ iv 1 ] ) ; v 12 . set ( vertices 1 [ iv 2 ] ) ; local tangent . x = v 12 . x - v 11 . x ; local tangent . y = v 12 . y - v 11 . y ; local tangent . normalize ( ) ; local normal . x = 1f * local tangent . y ; local normal . y = - 1f * local tangent . x ; plane point . x = ( v 11 . x + v 12 . x ) * .5f ; plane point . y = ( v 11 . y + v 12 . y ) * .5f ; tangent . x = xf 1 q . c * local tangent . x - xf 1 q . s * local tangent . y ; tangent . y = xf 1 q . s * local tangent . x + xf 1 q . c * local tangent . y ; final float normalx = 1f * tangent . y ; final float normaly = - 1f * tangent . x ; transform . mul to out ( xf 1 , v 11 , v 11 ) ; transform . mul to out ( xf 1 , v 12 , v 12 ) ; float front offset = normalx * v 11 . x + normaly * v 11 . y ; float side offset 1 = - ( tangent . x * v 11 . x + tangent . y * v 11 . y ) + total radius ; float side offset 2 = tangent . x * v 12 . x + tangent . y * v 12 . y + total radius ; int np ; tangent . negate local ( ) ; np = clip segment to line ( clip points 1 , incident edge , tangent , side offset 1 , iv 1 ) ; tangent . negate local ( ) ; if ( np < 2 ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , tangent , side offset 2 , iv 2 ) ; if ( np < 2 ) { return ; } manifold . local normal . set ( local normal ) ; manifold . local point . set ( plane point ) ; int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation = normalx * clip points 2 [ i ] . v . x + normaly * clip points 2 [ i ] . v . y - front offset ; if ( separation <= total radius ) { manifold point cp = manifold . points [ point count ] ; vec 2 out = cp . local point ; final float px = clip points 2 [ i ] . v . x - xf 2 . p . x ; final float py = clip points 2 [ i ] . v . y - xf 2 . p . y ; out . x = ( xf 2 . q . c * px + xf 2 . q . s * py ) ; out . y = ( - xf 2 . q . s * px + xf 2 . q . c * py ) ; cp . id . set ( clip points 2 [ i ] . id ) ; if ( flip ) { cp . id . flip ( ) ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { manifold . point count = 0 ; float total radius = poly a . m radius + poly b . m radius ; find max separation ( results 1 , poly a , xf a , poly b , xf b ) ; if ( results 1 . separation > total radius ) { return ; } find max separation ( results 2 , poly b , xf b , poly a , xf a ) ; if ( results 2 . separation > total radius ) { return ; } final polygon shape poly 1 ; final polygon shape poly 2 ; transform xf 1 , xf 2 ; int edge 1 ; boolean flip ; final float k tol = 0.1f * settings . linear slop ; if ( results 2 . separation > results 1 . separation + k tol ) { poly 1 = poly b ; poly 2 = poly a ; xf 1 = xf b ; xf 2 = xf a ; edge 1 = results 2 . edge index ; manifold . type = manifold type . face b ; flip = true ; } else { poly 1 = poly a ; poly 2 = poly b ; xf 1 = xf a ; xf 2 = xf b ; edge 1 = results 1 . edge index ; manifold . type = manifold type . face a ; flip = false ; } final rot xf 1 q = xf 1 . q ; find incident edge ( incident edge , poly 1 , xf 1 , edge 1 , poly 2 , xf 2 ) ; int count 1 = poly 1 . m count ; final vec 2 [ ] vertices 1 = poly 1 . m vertices ; final int iv 1 = edge 1 ; final int iv 2 = edge 1 + 1 < count 1 ? edge 1 + 1 : 0 ; v 11 . set ( vertices 1 [ iv 1 ] ) ; v 12 . set ( vertices 1 [ iv 2 ] ) ; local tangent . x = v 12 . x - v 11 . x ; local tangent . y = v 12 . y - v 11 . y ; local tangent . normalize ( ) ; local normal . x = 1f * local tangent . y ; local normal . y = - 1f * local tangent . x ; plane point . x = ( v 11 . x + v 12 . x ) * .5f ; plane point . y = ( v 11 . y + v 12 . y ) * .5f ; tangent . x = xf 1 q . c * local tangent . x - xf 1 q . s * local tangent . y ; tangent . y = xf 1 q . s * local tangent . x + xf 1 q . c * local tangent . y ; final float normalx = 1f * tangent . y ; final float normaly = - 1f * tangent . x ; transform . mul to out ( xf 1 , v 11 , v 11 ) ; transform . mul to out ( xf 1 , v 12 , v 12 ) ; float front offset = normalx * v 11 . x + normaly * v 11 . y ; float side offset 1 = - ( tangent . x * v 11 . x + tangent . y * v 11 . y ) + total radius ; float side offset 2 = tangent . x * v 12 . x + tangent . y * v 12 . y + total radius ; int np ; tangent . negate local ( ) ; np = clip segment to line ( clip points 1 , incident edge , tangent , side offset 1 , iv 1 ) ; tangent . negate local ( ) ; if ( np < 2 ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , tangent , side offset 2 , iv 2 ) ; if ( np < 2 ) { return ; } manifold . local normal . set ( local normal ) ; manifold . local point . set ( plane point ) ; int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation = normalx * clip points 2 [ i ] . v . x + normaly * clip points 2 [ i ] . v . y - front offset ; if ( separation <= total radius ) { manifold point cp = manifold . points [ point count ] ; vec 2 out = cp . local point ; final float px = clip points 2 [ i ] . v . x - xf 2 . p . x ; final float py = clip points 2 [ i ] . v . y - xf 2 . p . y ; out . x = ( xf 2 . q . c * px + xf 2 . q . s * py ) ; out . y = ( - xf 2 . q . s * px + xf 2 . q . c * py ) ; cp . id . set ( clip points 2 [ i ] . id ) ; if ( flip ) { cp . id . flip ( ) ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>

polygons

<SENTENCE_START> { manifold . point count = 0 ; float total radius = poly a . m radius + poly b . m radius ; find max separation ( results 1 , poly a , xf a , poly b , xf b ) ; if ( results 1 . separation > total radius ) { return ; } find max separation ( results 2 , poly b , xf b , poly a , xf a ) ; if ( results 2 . separation > total radius ) { return ; } final polygon shape poly 1 ; final polygon shape poly 2 ; transform xf 1 , xf 2 ; int edge 1 ; boolean flip ; final float k tol = 0.1f * settings . linear slop ; if ( results 2 . separation > results 1 . separation + k tol ) { poly 1 = poly b ; poly 2 = poly a ; xf 1 = xf b ; xf 2 = xf a ; edge 1 = results 2 . edge index ; manifold . type = manifold type . face b ; flip = true ; } else { poly 1 = poly a ; poly 2 = poly b ; xf 1 = xf a ; xf 2 = xf b ; edge 1 = results 1 . edge index ; manifold . type = manifold type . face a ; flip = false ; } final rot xf 1 q = xf 1 . q ; find incident edge ( incident edge , poly 1 , xf 1 , edge 1 , poly 2 , xf 2 ) ; int count 1 = poly 1 . m count ; final vec 2 [ ] vertices 1 = poly 1 . m vertices ; final int iv 1 = edge 1 ; final int iv 2 = edge 1 + 1 < count 1 ? edge 1 + 1 : 0 ; v 11 . set ( vertices 1 [ iv 1 ] ) ; v 12 . set ( vertices 1 [ iv 2 ] ) ; local tangent . x = v 12 . x - v 11 . x ; local tangent . y = v 12 . y - v 11 . y ; local tangent . normalize ( ) ; local normal . x = 1f * local tangent . y ; local normal . y = - 1f * local tangent . x ; plane point . x = ( v 11 . x + v 12 . x ) * .5f ; plane point . y = ( v 11 . y + v 12 . y ) * .5f ; tangent . x = xf 1 q . c * local tangent . x - xf 1 q . s * local tangent . y ; tangent . y = xf 1 q . s * local tangent . x + xf 1 q . c * local tangent . y ; final float normalx = 1f * tangent . y ; final float normaly = - 1f * tangent . x ; transform . mul to out ( xf 1 , v 11 , v 11 ) ; transform . mul to out ( xf 1 , v 12 , v 12 ) ; float front offset = normalx * v 11 . x + normaly * v 11 . y ; float side offset 1 = - ( tangent . x * v 11 . x + tangent . y * v 11 . y ) + total radius ; float side offset 2 = tangent . x * v 12 . x + tangent . y * v 12 . y + total radius ; int np ; tangent . negate local ( ) ; np = clip segment to line ( clip points 1 , incident edge , tangent , side offset 1 , iv 1 ) ; tangent . negate local ( ) ; if ( np < 2 ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , tangent , side offset 2 , iv 2 ) ; if ( np < 2 ) { return ; } manifold . local normal . set ( local normal ) ; manifold . local point . set ( plane point ) ; int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation = normalx * clip points 2 [ i ] . v . x + normaly * clip points 2 [ i ] . v . y - front offset ; if ( separation <= total radius ) { manifold point cp = manifold . points [ point count ] ; vec 2 out = cp . local point ; final float px = clip points 2 [ i ] . v . x - xf 2 . p . x ; final float py = clip points 2 [ i ] . v . y - xf 2 . p . y ; out . x = ( xf 2 . q . c * px + xf 2 . q . s * py ) ; out . y = ( - xf 2 . q . s * px + xf 2 . q . c * py ) ; cp . id . set ( clip points 2 [ i ] . id ) ; if ( flip ) { cp . id . flip ( ) ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>

(Copy Probability: 12.1%)

<SENTENCE_START> { manifold . point count = 0 ; float total radius = poly a . m radius + poly b . m radius ; find max separation ( results 1 , poly a , xf a , poly b , xf b ) ; if ( results 1 . separation > total radius ) { return ; } find max separation ( results 2 , poly b , xf b , poly a , xf a ) ; if ( results 2 . separation > total radius ) { return ; } final polygon shape poly 1 ; final polygon shape poly 2 ; transform xf 1 , xf 2 ; int edge 1 ; boolean flip ; final float k tol = 0.1f * settings . linear slop ; if ( results 2 . separation > results 1 . separation + k tol ) { poly 1 = poly b ; poly 2 = poly a ; xf 1 = xf b ; xf 2 = xf a ; edge 1 = results 2 . edge index ; manifold . type = manifold type . face b ; flip = true ; } else { poly 1 = poly a ; poly 2 = poly b ; xf 1 = xf a ; xf 2 = xf b ; edge 1 = results 1 . edge index ; manifold . type = manifold type . face a ; flip = false ; } final rot xf 1 q = xf 1 . q ; find incident edge ( incident edge , poly 1 , xf 1 , edge 1 , poly 2 , xf 2 ) ; int count 1 = poly 1 . m count ; final vec 2 [ ] vertices 1 = poly 1 . m vertices ; final int iv 1 = edge 1 ; final int iv 2 = edge 1 + 1 < count 1 ? edge 1 + 1 : 0 ; v 11 . set ( vertices 1 [ iv 1 ] ) ; v 12 . set ( vertices 1 [ iv 2 ] ) ; local tangent . x = v 12 . x - v 11 . x ; local tangent . y = v 12 . y - v 11 . y ; local tangent . normalize ( ) ; local normal . x = 1f * local tangent . y ; local normal . y = - 1f * local tangent . x ; plane point . x = ( v 11 . x + v 12 . x ) * .5f ; plane point . y = ( v 11 . y + v 12 . y ) * .5f ; tangent . x = xf 1 q . c * local tangent . x - xf 1 q . s * local tangent . y ; tangent . y = xf 1 q . s * local tangent . x + xf 1 q . c * local tangent . y ; final float normalx = 1f * tangent . y ; final float normaly = - 1f * tangent . x ; transform . mul to out ( xf 1 , v 11 , v 11 ) ; transform . mul to out ( xf 1 , v 12 , v 12 ) ; float front offset = normalx * v 11 . x + normaly * v 11 . y ; float side offset 1 = - ( tangent . x * v 11 . x + tangent . y * v 11 . y ) + total radius ; float side offset 2 = tangent . x * v 12 . x + tangent . y * v 12 . y + total radius ; int np ; tangent . negate local ( ) ; np = clip segment to line ( clip points 1 , incident edge , tangent , side offset 1 , iv 1 ) ; tangent . negate local ( ) ; if ( np < 2 ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , tangent , side offset 2 , iv 2 ) ; if ( np < 2 ) { return ; } manifold . local normal . set ( local normal ) ; manifold . local point . set ( plane point ) ; int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation = normalx * clip points 2 [ i ] . v . x + normaly * clip points 2 [ i ] . v . y - front offset ; if ( separation <= total radius ) { manifold point cp = manifold . points [ point count ] ; vec 2 out = cp . local point ; final float px = clip points 2 [ i ] . v . x - xf 2 . p . x ; final float py = clip points 2 [ i ] . v . y - xf 2 . p . y ; out . x = ( xf 2 . q . c * px + xf 2 . q . s * py ) ; out . y = ( - xf 2 . q . s * px + xf 2 . q . c * py ) ; cp . id . set ( clip points 2 [ i ] . id ) ; if ( flip ) { cp . id . flip ( ) ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { manifold . point count = 0 ; float total radius = poly a . m radius + poly b . m radius ; find max separation ( results 1 , poly a , xf a , poly b , xf b ) ; if ( results 1 . separation > total radius ) { return ; } find max separation ( results 2 , poly b , xf b , poly a , xf a ) ; if ( results 2 . separation > total radius ) { return ; } final polygon shape poly 1 ; final polygon shape poly 2 ; transform xf 1 , xf 2 ; int edge 1 ; boolean flip ; final float k tol = 0.1f * settings . linear slop ; if ( results 2 . separation > results 1 . separation + k tol ) { poly 1 = poly b ; poly 2 = poly a ; xf 1 = xf b ; xf 2 = xf a ; edge 1 = results 2 . edge index ; manifold . type = manifold type . face b ; flip = true ; } else { poly 1 = poly a ; poly 2 = poly b ; xf 1 = xf a ; xf 2 = xf b ; edge 1 = results 1 . edge index ; manifold . type = manifold type . face a ; flip = false ; } final rot xf 1 q = xf 1 . q ; find incident edge ( incident edge , poly 1 , xf 1 , edge 1 , poly 2 , xf 2 ) ; int count 1 = poly 1 . m count ; final vec 2 [ ] vertices 1 = poly 1 . m vertices ; final int iv 1 = edge 1 ; final int iv 2 = edge 1 + 1 < count 1 ? edge 1 + 1 : 0 ; v 11 . set ( vertices 1 [ iv 1 ] ) ; v 12 . set ( vertices 1 [ iv 2 ] ) ; local tangent . x = v 12 . x - v 11 . x ; local tangent . y = v 12 . y - v 11 . y ; local tangent . normalize ( ) ; local normal . x = 1f * local tangent . y ; local normal . y = - 1f * local tangent . x ; plane point . x = ( v 11 . x + v 12 . x ) * .5f ; plane point . y = ( v 11 . y + v 12 . y ) * .5f ; tangent . x = xf 1 q . c * local tangent . x - xf 1 q . s * local tangent . y ; tangent . y = xf 1 q . s * local tangent . x + xf 1 q . c * local tangent . y ; final float normalx = 1f * tangent . y ; final float normaly = - 1f * tangent . x ; transform . mul to out ( xf 1 , v 11 , v 11 ) ; transform . mul to out ( xf 1 , v 12 , v 12 ) ; float front offset = normalx * v 11 . x + normaly * v 11 . y ; float side offset 1 = - ( tangent . x * v 11 . x + tangent . y * v 11 . y ) + total radius ; float side offset 2 = tangent . x * v 12 . x + tangent . y * v 12 . y + total radius ; int np ; tangent . negate local ( ) ; np = clip segment to line ( clip points 1 , incident edge , tangent , side offset 1 , iv 1 ) ; tangent . negate local ( ) ; if ( np < 2 ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , tangent , side offset 2 , iv 2 ) ; if ( np < 2 ) { return ; } manifold . local normal . set ( local normal ) ; manifold . local point . set ( plane point ) ; int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation = normalx * clip points 2 [ i ] . v . x + normaly * clip points 2 [ i ] . v . y - front offset ; if ( separation <= total radius ) { manifold point cp = manifold . points [ point count ] ; vec 2 out = cp . local point ; final float px = clip points 2 [ i ] . v . x - xf 2 . p . x ; final float py = clip points 2 [ i ] . v . y - xf 2 . p . y ; out . x = ( xf 2 . q . c * px + xf 2 . q . s * py ) ; out . y = ( - xf 2 . q . s * px + xf 2 . q . c * py ) ; cp . id . set ( clip points 2 [ i ] . id ) ; if ( flip ) { cp . id . flip ( ) ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>

(Copy Probability: 10.3%)

<SENTENCE_START> { manifold . point count = 0 ; float total radius = poly a . m radius + poly b . m radius ; find max separation ( results 1 , poly a , xf a , poly b , xf b ) ; if ( results 1 . separation > total radius ) { return ; } find max separation ( results 2 , poly b , xf b , poly a , xf a ) ; if ( results 2 . separation > total radius ) { return ; } final polygon shape poly 1 ; final polygon shape poly 2 ; transform xf 1 , xf 2 ; int edge 1 ; boolean flip ; final float k tol = 0.1f * settings . linear slop ; if ( results 2 . separation > results 1 . separation + k tol ) { poly 1 = poly b ; poly 2 = poly a ; xf 1 = xf b ; xf 2 = xf a ; edge 1 = results 2 . edge index ; manifold . type = manifold type . face b ; flip = true ; } else { poly 1 = poly a ; poly 2 = poly b ; xf 1 = xf a ; xf 2 = xf b ; edge 1 = results 1 . edge index ; manifold . type = manifold type . face a ; flip = false ; } final rot xf 1 q = xf 1 . q ; find incident edge ( incident edge , poly 1 , xf 1 , edge 1 , poly 2 , xf 2 ) ; int count 1 = poly 1 . m count ; final vec 2 [ ] vertices 1 = poly 1 . m vertices ; final int iv 1 = edge 1 ; final int iv 2 = edge 1 + 1 < count 1 ? edge 1 + 1 : 0 ; v 11 . set ( vertices 1 [ iv 1 ] ) ; v 12 . set ( vertices 1 [ iv 2 ] ) ; local tangent . x = v 12 . x - v 11 . x ; local tangent . y = v 12 . y - v 11 . y ; local tangent . normalize ( ) ; local normal . x = 1f * local tangent . y ; local normal . y = - 1f * local tangent . x ; plane point . x = ( v 11 . x + v 12 . x ) * .5f ; plane point . y = ( v 11 . y + v 12 . y ) * .5f ; tangent . x = xf 1 q . c * local tangent . x - xf 1 q . s * local tangent . y ; tangent . y = xf 1 q . s * local tangent . x + xf 1 q . c * local tangent . y ; final float normalx = 1f * tangent . y ; final float normaly = - 1f * tangent . x ; transform . mul to out ( xf 1 , v 11 , v 11 ) ; transform . mul to out ( xf 1 , v 12 , v 12 ) ; float front offset = normalx * v 11 . x + normaly * v 11 . y ; float side offset 1 = - ( tangent . x * v 11 . x + tangent . y * v 11 . y ) + total radius ; float side offset 2 = tangent . x * v 12 . x + tangent . y * v 12 . y + total radius ; int np ; tangent . negate local ( ) ; np = clip segment to line ( clip points 1 , incident edge , tangent , side offset 1 , iv 1 ) ; tangent . negate local ( ) ; if ( np < 2 ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , tangent , side offset 2 , iv 2 ) ; if ( np < 2 ) { return ; } manifold . local normal . set ( local normal ) ; manifold . local point . set ( plane point ) ; int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation = normalx * clip points 2 [ i ] . v . x + normaly * clip points 2 [ i ] . v . y - front offset ; if ( separation <= total radius ) { manifold point cp = manifold . points [ point count ] ; vec 2 out = cp . local point ; final float px = clip points 2 [ i ] . v . x - xf 2 . p . x ; final float py = clip points 2 [ i ] . v . y - xf 2 . p . y ; out . x = ( xf 2 . q . c * px + xf 2 . q . s * py ) ; out . y = ( - xf 2 . q . s * px + xf 2 . q . c * py ) ; cp . id . set ( clip points 2 [ i ] . id ) ; if ( flip ) { cp . id . flip ( ) ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>


Original Name collide,edge,and,circle

collide

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

edge

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

(Copy Probability: 7.4%)

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

and

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

(Copy Probability: 8.6%)

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

circle

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { manifold . point count = 0 ; transform . mul to out unsafe ( xf b , circle b . m p , temp ) ; transform . mul trans to out unsafe ( xf a , temp , q ) ; final vec 2 a = edge a . m vertex 1 ; final vec 2 b = edge a . m vertex 2 ; e . set ( b ) . sub local ( a ) ; float u = vec 2 . dot ( e , temp . set ( b ) . sub local ( q ) ) ; float v = vec 2 . dot ( e , temp . set ( q ) . sub local ( a ) ) ; float radius = edge a . m radius + circle b . m radius ; cf . index b = 0 ; cf . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( v <= 0.0f ) { final vec 2 p = a ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 0 ) { final vec 2 a 1 = edge a . m vertex 0 ; final vec 2 b 1 = a ; e 1 . set ( b 1 ) . sub local ( a 1 ) ; float u 1 = vec 2 . dot ( e 1 , temp . set ( b 1 ) . sub local ( q ) ) ; if ( u 1 > 0.0f ) { return ; } } cf . index a = 0 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } if ( u <= 0.0f ) { vec 2 p = b ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } if ( edge a . m has vertex 3 ) { final vec 2 b 2 = edge a . m vertex 3 ; final vec 2 a 2 = b ; final vec 2 e 2 = e 1 ; e 2 . set ( b 2 ) . sub local ( a 2 ) ; float v 2 = vec 2 . dot ( e 2 , temp . set ( q ) . sub local ( a 2 ) ) ; if ( v 2 > 0.0f ) { return ; } } cf . index a = 1 ; cf . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . circles ; manifold . local normal . set zero ( ) ; manifold . local point . set ( p ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; return ; } float den = vec 2 . dot ( e , e ) ; assert ( den > 0.0f ) ; p . set ( a ) . mul local ( u ) . add local ( temp . set ( b ) . mul local ( v ) ) ; p . mul local ( 1.0f / den ) ; d . set ( q ) . sub local ( p ) ; float dd = vec 2 . dot ( d , d ) ; if ( dd > radius * radius ) { return ; } n . x = - e . y ; n . y = e . x ; if ( vec 2 . dot ( n , temp . set ( q ) . sub local ( a ) ) < 0.0f ) { n . set ( - n . x , - n . y ) ; } n . normalize ( ) ; cf . index a = 0 ; cf . type a = ( byte ) contact id . type . face . ordinal ( ) ; manifold . point count = 1 ; manifold . type = manifold . manifold type . face a ; manifold . local normal . set ( n ) ; manifold . local point . set ( a ) ; manifold . points [ 0 ] . id . set ( cf ) ; manifold . points [ 0 ] . local point . set ( circle b . m p ) ; } <SENTENCE_END/>


Original Name collide,edge,and,polygon

collide

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

edge

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

(Copy Probability: 5.3%)

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

and

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

polygon

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { collider . collide ( manifold , edge a , xf a , polygon b , xf b ) ; } <SENTENCE_END/>


Original Name set

set

<SENTENCE_START> { vec 2 v 1 = cv . v ; v . x = v 1 . x ; v . y = v 1 . y ; contact id c = cv . id ; id . index a = c . index a ; id . index b = c . index b ; id . type a = c . type a ; id . type b = c . type b ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { vec 2 v 1 = cv . v ; v . x = v 1 . x ; v . y = v 1 . y ; contact id c = cv . id ; id . index a = c . index a ; id . index b = c . index b ; id . type a = c . type a ; id . type b = c . type b ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { vec 2 v 1 = cv . v ; v . x = v 1 . x ; v . y = v 1 . y ; contact id c = cv . id ; id . index a = c . index a ; id . index b = c . index b ; id . type a = c . type a ; id . type b = c . type b ; } <SENTENCE_END/>

(Copy Probability: 9.4%)

<SENTENCE_START> { vec 2 v 1 = cv . v ; v . x = v 1 . x ; v . y = v 1 . y ; contact id c = cv . id ; id . index a = c . index a ; id . index b = c . index b ; id . type a = c . type a ; id . type b = c . type b ; } <SENTENCE_END/>


Original Name collide

collide

<SENTENCE_START> { transform . mul trans to out unsafe ( xf a , xf b , m xf ) ; transform . mul to out unsafe ( m xf , polygon b . m centroid , m centroid b ) ; m v 0 = edge a . m vertex 0 ; m v 1 = edge a . m vertex 1 ; m v 2 = edge a . m vertex 2 ; m v 3 = edge a . m vertex 3 ; boolean has vertex 0 = edge a . m has vertex 0 ; boolean has vertex 3 = edge a . m has vertex 3 ; edge 1 . set ( m v 2 ) . sub local ( m v 1 ) ; edge 1 . normalize ( ) ; m normal 1 . set ( edge 1 . y , - edge 1 . x ) ; float offset 1 = vec 2 . dot ( m normal 1 , temp . set ( m centroid b ) . sub local ( m v 1 ) ) ; float offset 0 = 0.0f , offset 2 = 0.0f ; boolean convex 1 = false , convex 2 = false ; if ( has vertex 0 ) { edge 0 . set ( m v 1 ) . sub local ( m v 0 ) ; edge 0 . normalize ( ) ; m normal 0 . set ( edge 0 . y , - edge 0 . x ) ; convex 1 = vec 2 . cross ( edge 0 , edge 1 ) >= 0.0f ; offset 0 = vec 2 . dot ( m normal 0 , temp . set ( m centroid b ) . sub local ( m v 0 ) ) ; } if ( has vertex 3 ) { edge 2 . set ( m v 3 ) . sub local ( m v 2 ) ; edge 2 . normalize ( ) ; m normal 2 . set ( edge 2 . y , - edge 2 . x ) ; convex 2 = vec 2 . cross ( edge 1 , edge 2 ) > 0.0f ; offset 2 = vec 2 . dot ( m normal 2 , temp . set ( m centroid b ) . sub local ( m v 2 ) ) ; } if ( has vertex 0 && has vertex 3 ) { if ( convex 1 && convex 2 ) { m front = offset 0 >= 0.0f || offset 1 >= 0.0f || offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else if ( convex 1 ) { m front = offset 0 >= 0.0f || ( offset 1 >= 0.0f && offset 2 >= 0.0f ) ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else if ( convex 2 ) { m front = offset 2 >= 0.0f || ( offset 0 >= 0.0f && offset 1 >= 0.0f ) ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } else { m front = offset 0 >= 0.0f && offset 1 >= 0.0f && offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } } else if ( has vertex 0 ) { if ( convex 1 ) { m front = offset 0 >= 0.0f || offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else { m front = offset 0 >= 0.0f && offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } } else if ( has vertex 3 ) { if ( convex 2 ) { m front = offset 1 >= 0.0f || offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } else { m front = offset 1 >= 0.0f && offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } } else { m front = offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } m polygon b . count = polygon b . m count ; for ( int i = 0 ; i < polygon b . m count ; ++ i ) { transform . mul to out unsafe ( m xf , polygon b . m vertices [ i ] , m polygon b . vertices [ i ] ) ; rot . mul to out unsafe ( m xf . q , polygon b . m normals [ i ] , m polygon b . normals [ i ] ) ; } m radius = 2.0f * settings . polygon radius ; manifold . point count = 0 ; compute edge separation ( edge axis ) ; if ( edge axis . type == ep axis . type . unknown ) { return ; } if ( edge axis . separation > m radius ) { return ; } compute polygon separation ( polygon axis ) ; if ( polygon axis . type != ep axis . type . unknown && polygon axis . separation > m radius ) { return ; } final float k relative tol = 0.98f ; final float k absolute tol = 0.001f ; ep axis primary axis ; if ( polygon axis . type == ep axis . type . unknown ) { primary axis = edge axis ; } else if ( polygon axis . separation > k relative tol * edge axis . separation + k absolute tol ) { primary axis = polygon axis ; } else { primary axis = edge axis ; } final clip vertex ie 0 = ie [ 0 ] ; final clip vertex ie 1 = ie [ 1 ] ; if ( primary axis . type == ep axis . type . edge a ) { manifold . type = manifold . manifold type . face a ; int best index = 0 ; float best value = vec 2 . dot ( m normal , m polygon b . normals [ 0 ] ) ; for ( int i = 1 ; i < m polygon b . count ; ++ i ) { float value = vec 2 . dot ( m normal , m polygon b . normals [ i ] ) ; if ( value < best value ) { best value = value ; best index = i ; } } int i 1 = best index ; int i 2 = i 1 + 1 < m polygon b . count ? i 1 + 1 : 0 ; ie 0 . v . set ( m polygon b . vertices [ i 1 ] ) ; ie 0 . id . index a = 0 ; ie 0 . id . index b = ( byte ) i 1 ; ie 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; ie 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 1 . v . set ( m polygon b . vertices [ i 2 ] ) ; ie 1 . id . index a = 0 ; ie 1 . id . index b = ( byte ) i 2 ; ie 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; ie 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( m front ) { rf . i 1 = 0 ; rf . i 2 = 1 ; rf . v 1 . set ( m v 1 ) ; rf . v 2 . set ( m v 2 ) ; rf . normal . set ( m normal 1 ) ; } else { rf . i 1 = 1 ; rf . i 2 = 0 ; rf . v 1 . set ( m v 2 ) ; rf . v 2 . set ( m v 1 ) ; rf . normal . set ( m normal 1 ) . negate local ( ) ; } } else { manifold . type = manifold . manifold type . face b ; ie 0 . v . set ( m v 1 ) ; ie 0 . id . index a = 0 ; ie 0 . id . index b = ( byte ) primary axis . index ; ie 0 . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 0 . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ie 1 . v . set ( m v 2 ) ; ie 1 . id . index a = 0 ; ie 1 . id . index b = ( byte ) primary axis . index ; ie 1 . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 1 . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; rf . i 1 = primary axis . index ; rf . i 2 = rf . i 1 + 1 < m polygon b . count ? rf . i 1 + 1 : 0 ; rf . v 1 . set ( m polygon b . vertices [ rf . i 1 ] ) ; rf . v 2 . set ( m polygon b . vertices [ rf . i 2 ] ) ; rf . normal . set ( m polygon b . normals [ rf . i 1 ] ) ; } rf . side normal 1 . set ( rf . normal . y , - rf . normal . x ) ; rf . side normal 2 . set ( rf . side normal 1 ) . negate local ( ) ; rf . side offset 1 = vec 2 . dot ( rf . side normal 1 , rf . v 1 ) ; rf . side offset 2 = vec 2 . dot ( rf . side normal 2 , rf . v 2 ) ; int np ; np = clip segment to line ( clip points 1 , ie , rf . side normal 1 , rf . side offset 1 , rf . i 1 ) ; if ( np < settings . max manifold points ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , rf . side normal 2 , rf . side offset 2 , rf . i 2 ) ; if ( np < settings . max manifold points ) { return ; } if ( primary axis . type == ep axis . type . edge a ) { manifold . local normal . set ( rf . normal ) ; manifold . local point . set ( rf . v 1 ) ; } else { manifold . local normal . set ( polygon b . m normals [ rf . i 1 ] ) ; manifold . local point . set ( polygon b . m vertices [ rf . i 1 ] ) ; } int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation ; separation = vec 2 . dot ( rf . normal , temp . set ( clip points 2 [ i ] . v ) . sub local ( rf . v 1 ) ) ; if ( separation <= m radius ) { manifold point cp = manifold . points [ point count ] ; if ( primary axis . type == ep axis . type . edge a ) { transform . mul trans to out unsafe ( m xf , clip points 2 [ i ] . v , cp . local point ) ; cp . id . set ( clip points 2 [ i ] . id ) ; } else { cp . local point . set ( clip points 2 [ i ] . v ) ; cp . id . type a = clip points 2 [ i ] . id . type b ; cp . id . type b = clip points 2 [ i ] . id . type a ; cp . id . index a = clip points 2 [ i ] . id . index b ; cp . id . index b = clip points 2 [ i ] . id . index a ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { transform . mul trans to out unsafe ( xf a , xf b , m xf ) ; transform . mul to out unsafe ( m xf , polygon b . m centroid , m centroid b ) ; m v 0 = edge a . m vertex 0 ; m v 1 = edge a . m vertex 1 ; m v 2 = edge a . m vertex 2 ; m v 3 = edge a . m vertex 3 ; boolean has vertex 0 = edge a . m has vertex 0 ; boolean has vertex 3 = edge a . m has vertex 3 ; edge 1 . set ( m v 2 ) . sub local ( m v 1 ) ; edge 1 . normalize ( ) ; m normal 1 . set ( edge 1 . y , - edge 1 . x ) ; float offset 1 = vec 2 . dot ( m normal 1 , temp . set ( m centroid b ) . sub local ( m v 1 ) ) ; float offset 0 = 0.0f , offset 2 = 0.0f ; boolean convex 1 = false , convex 2 = false ; if ( has vertex 0 ) { edge 0 . set ( m v 1 ) . sub local ( m v 0 ) ; edge 0 . normalize ( ) ; m normal 0 . set ( edge 0 . y , - edge 0 . x ) ; convex 1 = vec 2 . cross ( edge 0 , edge 1 ) >= 0.0f ; offset 0 = vec 2 . dot ( m normal 0 , temp . set ( m centroid b ) . sub local ( m v 0 ) ) ; } if ( has vertex 3 ) { edge 2 . set ( m v 3 ) . sub local ( m v 2 ) ; edge 2 . normalize ( ) ; m normal 2 . set ( edge 2 . y , - edge 2 . x ) ; convex 2 = vec 2 . cross ( edge 1 , edge 2 ) > 0.0f ; offset 2 = vec 2 . dot ( m normal 2 , temp . set ( m centroid b ) . sub local ( m v 2 ) ) ; } if ( has vertex 0 && has vertex 3 ) { if ( convex 1 && convex 2 ) { m front = offset 0 >= 0.0f || offset 1 >= 0.0f || offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else if ( convex 1 ) { m front = offset 0 >= 0.0f || ( offset 1 >= 0.0f && offset 2 >= 0.0f ) ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else if ( convex 2 ) { m front = offset 2 >= 0.0f || ( offset 0 >= 0.0f && offset 1 >= 0.0f ) ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } else { m front = offset 0 >= 0.0f && offset 1 >= 0.0f && offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } } else if ( has vertex 0 ) { if ( convex 1 ) { m front = offset 0 >= 0.0f || offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else { m front = offset 0 >= 0.0f && offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } } else if ( has vertex 3 ) { if ( convex 2 ) { m front = offset 1 >= 0.0f || offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } else { m front = offset 1 >= 0.0f && offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } } else { m front = offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } m polygon b . count = polygon b . m count ; for ( int i = 0 ; i < polygon b . m count ; ++ i ) { transform . mul to out unsafe ( m xf , polygon b . m vertices [ i ] , m polygon b . vertices [ i ] ) ; rot . mul to out unsafe ( m xf . q , polygon b . m normals [ i ] , m polygon b . normals [ i ] ) ; } m radius = 2.0f * settings . polygon radius ; manifold . point count = 0 ; compute edge separation ( edge axis ) ; if ( edge axis . type == ep axis . type . unknown ) { return ; } if ( edge axis . separation > m radius ) { return ; } compute polygon separation ( polygon axis ) ; if ( polygon axis . type != ep axis . type . unknown && polygon axis . separation > m radius ) { return ; } final float k relative tol = 0.98f ; final float k absolute tol = 0.001f ; ep axis primary axis ; if ( polygon axis . type == ep axis . type . unknown ) { primary axis = edge axis ; } else if ( polygon axis . separation > k relative tol * edge axis . separation + k absolute tol ) { primary axis = polygon axis ; } else { primary axis = edge axis ; } final clip vertex ie 0 = ie [ 0 ] ; final clip vertex ie 1 = ie [ 1 ] ; if ( primary axis . type == ep axis . type . edge a ) { manifold . type = manifold . manifold type . face a ; int best index = 0 ; float best value = vec 2 . dot ( m normal , m polygon b . normals [ 0 ] ) ; for ( int i = 1 ; i < m polygon b . count ; ++ i ) { float value = vec 2 . dot ( m normal , m polygon b . normals [ i ] ) ; if ( value < best value ) { best value = value ; best index = i ; } } int i 1 = best index ; int i 2 = i 1 + 1 < m polygon b . count ? i 1 + 1 : 0 ; ie 0 . v . set ( m polygon b . vertices [ i 1 ] ) ; ie 0 . id . index a = 0 ; ie 0 . id . index b = ( byte ) i 1 ; ie 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; ie 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 1 . v . set ( m polygon b . vertices [ i 2 ] ) ; ie 1 . id . index a = 0 ; ie 1 . id . index b = ( byte ) i 2 ; ie 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; ie 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( m front ) { rf . i 1 = 0 ; rf . i 2 = 1 ; rf . v 1 . set ( m v 1 ) ; rf . v 2 . set ( m v 2 ) ; rf . normal . set ( m normal 1 ) ; } else { rf . i 1 = 1 ; rf . i 2 = 0 ; rf . v 1 . set ( m v 2 ) ; rf . v 2 . set ( m v 1 ) ; rf . normal . set ( m normal 1 ) . negate local ( ) ; } } else { manifold . type = manifold . manifold type . face b ; ie 0 . v . set ( m v 1 ) ; ie 0 . id . index a = 0 ; ie 0 . id . index b = ( byte ) primary axis . index ; ie 0 . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 0 . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ie 1 . v . set ( m v 2 ) ; ie 1 . id . index a = 0 ; ie 1 . id . index b = ( byte ) primary axis . index ; ie 1 . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 1 . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; rf . i 1 = primary axis . index ; rf . i 2 = rf . i 1 + 1 < m polygon b . count ? rf . i 1 + 1 : 0 ; rf . v 1 . set ( m polygon b . vertices [ rf . i 1 ] ) ; rf . v 2 . set ( m polygon b . vertices [ rf . i 2 ] ) ; rf . normal . set ( m polygon b . normals [ rf . i 1 ] ) ; } rf . side normal 1 . set ( rf . normal . y , - rf . normal . x ) ; rf . side normal 2 . set ( rf . side normal 1 ) . negate local ( ) ; rf . side offset 1 = vec 2 . dot ( rf . side normal 1 , rf . v 1 ) ; rf . side offset 2 = vec 2 . dot ( rf . side normal 2 , rf . v 2 ) ; int np ; np = clip segment to line ( clip points 1 , ie , rf . side normal 1 , rf . side offset 1 , rf . i 1 ) ; if ( np < settings . max manifold points ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , rf . side normal 2 , rf . side offset 2 , rf . i 2 ) ; if ( np < settings . max manifold points ) { return ; } if ( primary axis . type == ep axis . type . edge a ) { manifold . local normal . set ( rf . normal ) ; manifold . local point . set ( rf . v 1 ) ; } else { manifold . local normal . set ( polygon b . m normals [ rf . i 1 ] ) ; manifold . local point . set ( polygon b . m vertices [ rf . i 1 ] ) ; } int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation ; separation = vec 2 . dot ( rf . normal , temp . set ( clip points 2 [ i ] . v ) . sub local ( rf . v 1 ) ) ; if ( separation <= m radius ) { manifold point cp = manifold . points [ point count ] ; if ( primary axis . type == ep axis . type . edge a ) { transform . mul trans to out unsafe ( m xf , clip points 2 [ i ] . v , cp . local point ) ; cp . id . set ( clip points 2 [ i ] . id ) ; } else { cp . local point . set ( clip points 2 [ i ] . v ) ; cp . id . type a = clip points 2 [ i ] . id . type b ; cp . id . type b = clip points 2 [ i ] . id . type a ; cp . id . index a = clip points 2 [ i ] . id . index b ; cp . id . index b = clip points 2 [ i ] . id . index a ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { transform . mul trans to out unsafe ( xf a , xf b , m xf ) ; transform . mul to out unsafe ( m xf , polygon b . m centroid , m centroid b ) ; m v 0 = edge a . m vertex 0 ; m v 1 = edge a . m vertex 1 ; m v 2 = edge a . m vertex 2 ; m v 3 = edge a . m vertex 3 ; boolean has vertex 0 = edge a . m has vertex 0 ; boolean has vertex 3 = edge a . m has vertex 3 ; edge 1 . set ( m v 2 ) . sub local ( m v 1 ) ; edge 1 . normalize ( ) ; m normal 1 . set ( edge 1 . y , - edge 1 . x ) ; float offset 1 = vec 2 . dot ( m normal 1 , temp . set ( m centroid b ) . sub local ( m v 1 ) ) ; float offset 0 = 0.0f , offset 2 = 0.0f ; boolean convex 1 = false , convex 2 = false ; if ( has vertex 0 ) { edge 0 . set ( m v 1 ) . sub local ( m v 0 ) ; edge 0 . normalize ( ) ; m normal 0 . set ( edge 0 . y , - edge 0 . x ) ; convex 1 = vec 2 . cross ( edge 0 , edge 1 ) >= 0.0f ; offset 0 = vec 2 . dot ( m normal 0 , temp . set ( m centroid b ) . sub local ( m v 0 ) ) ; } if ( has vertex 3 ) { edge 2 . set ( m v 3 ) . sub local ( m v 2 ) ; edge 2 . normalize ( ) ; m normal 2 . set ( edge 2 . y , - edge 2 . x ) ; convex 2 = vec 2 . cross ( edge 1 , edge 2 ) > 0.0f ; offset 2 = vec 2 . dot ( m normal 2 , temp . set ( m centroid b ) . sub local ( m v 2 ) ) ; } if ( has vertex 0 && has vertex 3 ) { if ( convex 1 && convex 2 ) { m front = offset 0 >= 0.0f || offset 1 >= 0.0f || offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else if ( convex 1 ) { m front = offset 0 >= 0.0f || ( offset 1 >= 0.0f && offset 2 >= 0.0f ) ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else if ( convex 2 ) { m front = offset 2 >= 0.0f || ( offset 0 >= 0.0f && offset 1 >= 0.0f ) ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } else { m front = offset 0 >= 0.0f && offset 1 >= 0.0f && offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } } else if ( has vertex 0 ) { if ( convex 1 ) { m front = offset 0 >= 0.0f || offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else { m front = offset 0 >= 0.0f && offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } } else if ( has vertex 3 ) { if ( convex 2 ) { m front = offset 1 >= 0.0f || offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } else { m front = offset 1 >= 0.0f && offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } } else { m front = offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } m polygon b . count = polygon b . m count ; for ( int i = 0 ; i < polygon b . m count ; ++ i ) { transform . mul to out unsafe ( m xf , polygon b . m vertices [ i ] , m polygon b . vertices [ i ] ) ; rot . mul to out unsafe ( m xf . q , polygon b . m normals [ i ] , m polygon b . normals [ i ] ) ; } m radius = 2.0f * settings . polygon radius ; manifold . point count = 0 ; compute edge separation ( edge axis ) ; if ( edge axis . type == ep axis . type . unknown ) { return ; } if ( edge axis . separation > m radius ) { return ; } compute polygon separation ( polygon axis ) ; if ( polygon axis . type != ep axis . type . unknown && polygon axis . separation > m radius ) { return ; } final float k relative tol = 0.98f ; final float k absolute tol = 0.001f ; ep axis primary axis ; if ( polygon axis . type == ep axis . type . unknown ) { primary axis = edge axis ; } else if ( polygon axis . separation > k relative tol * edge axis . separation + k absolute tol ) { primary axis = polygon axis ; } else { primary axis = edge axis ; } final clip vertex ie 0 = ie [ 0 ] ; final clip vertex ie 1 = ie [ 1 ] ; if ( primary axis . type == ep axis . type . edge a ) { manifold . type = manifold . manifold type . face a ; int best index = 0 ; float best value = vec 2 . dot ( m normal , m polygon b . normals [ 0 ] ) ; for ( int i = 1 ; i < m polygon b . count ; ++ i ) { float value = vec 2 . dot ( m normal , m polygon b . normals [ i ] ) ; if ( value < best value ) { best value = value ; best index = i ; } } int i 1 = best index ; int i 2 = i 1 + 1 < m polygon b . count ? i 1 + 1 : 0 ; ie 0 . v . set ( m polygon b . vertices [ i 1 ] ) ; ie 0 . id . index a = 0 ; ie 0 . id . index b = ( byte ) i 1 ; ie 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; ie 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 1 . v . set ( m polygon b . vertices [ i 2 ] ) ; ie 1 . id . index a = 0 ; ie 1 . id . index b = ( byte ) i 2 ; ie 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; ie 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( m front ) { rf . i 1 = 0 ; rf . i 2 = 1 ; rf . v 1 . set ( m v 1 ) ; rf . v 2 . set ( m v 2 ) ; rf . normal . set ( m normal 1 ) ; } else { rf . i 1 = 1 ; rf . i 2 = 0 ; rf . v 1 . set ( m v 2 ) ; rf . v 2 . set ( m v 1 ) ; rf . normal . set ( m normal 1 ) . negate local ( ) ; } } else { manifold . type = manifold . manifold type . face b ; ie 0 . v . set ( m v 1 ) ; ie 0 . id . index a = 0 ; ie 0 . id . index b = ( byte ) primary axis . index ; ie 0 . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 0 . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ie 1 . v . set ( m v 2 ) ; ie 1 . id . index a = 0 ; ie 1 . id . index b = ( byte ) primary axis . index ; ie 1 . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 1 . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; rf . i 1 = primary axis . index ; rf . i 2 = rf . i 1 + 1 < m polygon b . count ? rf . i 1 + 1 : 0 ; rf . v 1 . set ( m polygon b . vertices [ rf . i 1 ] ) ; rf . v 2 . set ( m polygon b . vertices [ rf . i 2 ] ) ; rf . normal . set ( m polygon b . normals [ rf . i 1 ] ) ; } rf . side normal 1 . set ( rf . normal . y , - rf . normal . x ) ; rf . side normal 2 . set ( rf . side normal 1 ) . negate local ( ) ; rf . side offset 1 = vec 2 . dot ( rf . side normal 1 , rf . v 1 ) ; rf . side offset 2 = vec 2 . dot ( rf . side normal 2 , rf . v 2 ) ; int np ; np = clip segment to line ( clip points 1 , ie , rf . side normal 1 , rf . side offset 1 , rf . i 1 ) ; if ( np < settings . max manifold points ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , rf . side normal 2 , rf . side offset 2 , rf . i 2 ) ; if ( np < settings . max manifold points ) { return ; } if ( primary axis . type == ep axis . type . edge a ) { manifold . local normal . set ( rf . normal ) ; manifold . local point . set ( rf . v 1 ) ; } else { manifold . local normal . set ( polygon b . m normals [ rf . i 1 ] ) ; manifold . local point . set ( polygon b . m vertices [ rf . i 1 ] ) ; } int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation ; separation = vec 2 . dot ( rf . normal , temp . set ( clip points 2 [ i ] . v ) . sub local ( rf . v 1 ) ) ; if ( separation <= m radius ) { manifold point cp = manifold . points [ point count ] ; if ( primary axis . type == ep axis . type . edge a ) { transform . mul trans to out unsafe ( m xf , clip points 2 [ i ] . v , cp . local point ) ; cp . id . set ( clip points 2 [ i ] . id ) ; } else { cp . local point . set ( clip points 2 [ i ] . v ) ; cp . id . type a = clip points 2 [ i ] . id . type b ; cp . id . type b = clip points 2 [ i ] . id . type a ; cp . id . index a = clip points 2 [ i ] . id . index b ; cp . id . index b = clip points 2 [ i ] . id . index a ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>

(Copy Probability: 6.1%)

<SENTENCE_START> { transform . mul trans to out unsafe ( xf a , xf b , m xf ) ; transform . mul to out unsafe ( m xf , polygon b . m centroid , m centroid b ) ; m v 0 = edge a . m vertex 0 ; m v 1 = edge a . m vertex 1 ; m v 2 = edge a . m vertex 2 ; m v 3 = edge a . m vertex 3 ; boolean has vertex 0 = edge a . m has vertex 0 ; boolean has vertex 3 = edge a . m has vertex 3 ; edge 1 . set ( m v 2 ) . sub local ( m v 1 ) ; edge 1 . normalize ( ) ; m normal 1 . set ( edge 1 . y , - edge 1 . x ) ; float offset 1 = vec 2 . dot ( m normal 1 , temp . set ( m centroid b ) . sub local ( m v 1 ) ) ; float offset 0 = 0.0f , offset 2 = 0.0f ; boolean convex 1 = false , convex 2 = false ; if ( has vertex 0 ) { edge 0 . set ( m v 1 ) . sub local ( m v 0 ) ; edge 0 . normalize ( ) ; m normal 0 . set ( edge 0 . y , - edge 0 . x ) ; convex 1 = vec 2 . cross ( edge 0 , edge 1 ) >= 0.0f ; offset 0 = vec 2 . dot ( m normal 0 , temp . set ( m centroid b ) . sub local ( m v 0 ) ) ; } if ( has vertex 3 ) { edge 2 . set ( m v 3 ) . sub local ( m v 2 ) ; edge 2 . normalize ( ) ; m normal 2 . set ( edge 2 . y , - edge 2 . x ) ; convex 2 = vec 2 . cross ( edge 1 , edge 2 ) > 0.0f ; offset 2 = vec 2 . dot ( m normal 2 , temp . set ( m centroid b ) . sub local ( m v 2 ) ) ; } if ( has vertex 0 && has vertex 3 ) { if ( convex 1 && convex 2 ) { m front = offset 0 >= 0.0f || offset 1 >= 0.0f || offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else if ( convex 1 ) { m front = offset 0 >= 0.0f || ( offset 1 >= 0.0f && offset 2 >= 0.0f ) ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else if ( convex 2 ) { m front = offset 2 >= 0.0f || ( offset 0 >= 0.0f && offset 1 >= 0.0f ) ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } else { m front = offset 0 >= 0.0f && offset 1 >= 0.0f && offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } } else if ( has vertex 0 ) { if ( convex 1 ) { m front = offset 0 >= 0.0f || offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 0 . x ; m lower limit . y = m normal 0 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } } else { m front = offset 0 >= 0.0f && offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = - m normal 0 . x ; m upper limit . y = - m normal 0 . y ; } } } else if ( has vertex 3 ) { if ( convex 2 ) { m front = offset 1 >= 0.0f || offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 2 . x ; m upper limit . y = m normal 2 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } else { m front = offset 1 >= 0.0f && offset 2 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = - m normal 2 . x ; m lower limit . y = - m normal 2 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } } else { m front = offset 1 >= 0.0f ; if ( m front ) { m normal . x = m normal 1 . x ; m normal . y = m normal 1 . y ; m lower limit . x = - m normal 1 . x ; m lower limit . y = - m normal 1 . y ; m upper limit . x = - m normal 1 . x ; m upper limit . y = - m normal 1 . y ; } else { m normal . x = - m normal 1 . x ; m normal . y = - m normal 1 . y ; m lower limit . x = m normal 1 . x ; m lower limit . y = m normal 1 . y ; m upper limit . x = m normal 1 . x ; m upper limit . y = m normal 1 . y ; } } m polygon b . count = polygon b . m count ; for ( int i = 0 ; i < polygon b . m count ; ++ i ) { transform . mul to out unsafe ( m xf , polygon b . m vertices [ i ] , m polygon b . vertices [ i ] ) ; rot . mul to out unsafe ( m xf . q , polygon b . m normals [ i ] , m polygon b . normals [ i ] ) ; } m radius = 2.0f * settings . polygon radius ; manifold . point count = 0 ; compute edge separation ( edge axis ) ; if ( edge axis . type == ep axis . type . unknown ) { return ; } if ( edge axis . separation > m radius ) { return ; } compute polygon separation ( polygon axis ) ; if ( polygon axis . type != ep axis . type . unknown && polygon axis . separation > m radius ) { return ; } final float k relative tol = 0.98f ; final float k absolute tol = 0.001f ; ep axis primary axis ; if ( polygon axis . type == ep axis . type . unknown ) { primary axis = edge axis ; } else if ( polygon axis . separation > k relative tol * edge axis . separation + k absolute tol ) { primary axis = polygon axis ; } else { primary axis = edge axis ; } final clip vertex ie 0 = ie [ 0 ] ; final clip vertex ie 1 = ie [ 1 ] ; if ( primary axis . type == ep axis . type . edge a ) { manifold . type = manifold . manifold type . face a ; int best index = 0 ; float best value = vec 2 . dot ( m normal , m polygon b . normals [ 0 ] ) ; for ( int i = 1 ; i < m polygon b . count ; ++ i ) { float value = vec 2 . dot ( m normal , m polygon b . normals [ i ] ) ; if ( value < best value ) { best value = value ; best index = i ; } } int i 1 = best index ; int i 2 = i 1 + 1 < m polygon b . count ? i 1 + 1 : 0 ; ie 0 . v . set ( m polygon b . vertices [ i 1 ] ) ; ie 0 . id . index a = 0 ; ie 0 . id . index b = ( byte ) i 1 ; ie 0 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; ie 0 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 1 . v . set ( m polygon b . vertices [ i 2 ] ) ; ie 1 . id . index a = 0 ; ie 1 . id . index b = ( byte ) i 2 ; ie 1 . id . type a = ( byte ) contact id . type . face . ordinal ( ) ; ie 1 . id . type b = ( byte ) contact id . type . vertex . ordinal ( ) ; if ( m front ) { rf . i 1 = 0 ; rf . i 2 = 1 ; rf . v 1 . set ( m v 1 ) ; rf . v 2 . set ( m v 2 ) ; rf . normal . set ( m normal 1 ) ; } else { rf . i 1 = 1 ; rf . i 2 = 0 ; rf . v 1 . set ( m v 2 ) ; rf . v 2 . set ( m v 1 ) ; rf . normal . set ( m normal 1 ) . negate local ( ) ; } } else { manifold . type = manifold . manifold type . face b ; ie 0 . v . set ( m v 1 ) ; ie 0 . id . index a = 0 ; ie 0 . id . index b = ( byte ) primary axis . index ; ie 0 . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 0 . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; ie 1 . v . set ( m v 2 ) ; ie 1 . id . index a = 0 ; ie 1 . id . index b = ( byte ) primary axis . index ; ie 1 . id . type a = ( byte ) contact id . type . vertex . ordinal ( ) ; ie 1 . id . type b = ( byte ) contact id . type . face . ordinal ( ) ; rf . i 1 = primary axis . index ; rf . i 2 = rf . i 1 + 1 < m polygon b . count ? rf . i 1 + 1 : 0 ; rf . v 1 . set ( m polygon b . vertices [ rf . i 1 ] ) ; rf . v 2 . set ( m polygon b . vertices [ rf . i 2 ] ) ; rf . normal . set ( m polygon b . normals [ rf . i 1 ] ) ; } rf . side normal 1 . set ( rf . normal . y , - rf . normal . x ) ; rf . side normal 2 . set ( rf . side normal 1 ) . negate local ( ) ; rf . side offset 1 = vec 2 . dot ( rf . side normal 1 , rf . v 1 ) ; rf . side offset 2 = vec 2 . dot ( rf . side normal 2 , rf . v 2 ) ; int np ; np = clip segment to line ( clip points 1 , ie , rf . side normal 1 , rf . side offset 1 , rf . i 1 ) ; if ( np < settings . max manifold points ) { return ; } np = clip segment to line ( clip points 2 , clip points 1 , rf . side normal 2 , rf . side offset 2 , rf . i 2 ) ; if ( np < settings . max manifold points ) { return ; } if ( primary axis . type == ep axis . type . edge a ) { manifold . local normal . set ( rf . normal ) ; manifold . local point . set ( rf . v 1 ) ; } else { manifold . local normal . set ( polygon b . m normals [ rf . i 1 ] ) ; manifold . local point . set ( polygon b . m vertices [ rf . i 1 ] ) ; } int point count = 0 ; for ( int i = 0 ; i < settings . max manifold points ; ++ i ) { float separation ; separation = vec 2 . dot ( rf . normal , temp . set ( clip points 2 [ i ] . v ) . sub local ( rf . v 1 ) ) ; if ( separation <= m radius ) { manifold point cp = manifold . points [ point count ] ; if ( primary axis . type == ep axis . type . edge a ) { transform . mul trans to out unsafe ( m xf , clip points 2 [ i ] . v , cp . local point ) ; cp . id . set ( clip points 2 [ i ] . id ) ; } else { cp . local point . set ( clip points 2 [ i ] . v ) ; cp . id . type a = clip points 2 [ i ] . id . type b ; cp . id . type b = clip points 2 [ i ] . id . type a ; cp . id . index a = clip points 2 [ i ] . id . index b ; cp . id . index b = clip points 2 [ i ] . id . index a ; } ++ point count ; } } manifold . point count = point count ; } <SENTENCE_END/>


Original Name compute,edge,separation

compute

<SENTENCE_START> { axis . type = ep axis . type . edge a ; axis . index = m front ? 0 : 1 ; axis . separation = float . max value ; float nx = m normal . x ; float ny = m normal . y ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 v = m polygon b . vertices [ i ] ; float tempx = v . x - m v 1 . x ; float tempy = v . y - m v 1 . y ; float s = nx * tempx + ny * tempy ; if ( s < axis . separation ) { axis . separation = s ; } } } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { axis . type = ep axis . type . edge a ; axis . index = m front ? 0 : 1 ; axis . separation = float . max value ; float nx = m normal . x ; float ny = m normal . y ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 v = m polygon b . vertices [ i ] ; float tempx = v . x - m v 1 . x ; float tempy = v . y - m v 1 . y ; float s = nx * tempx + ny * tempy ; if ( s < axis . separation ) { axis . separation = s ; } } } <SENTENCE_END/>

edge

<SENTENCE_START> { axis . type = ep axis . type . edge a ; axis . index = m front ? 0 : 1 ; axis . separation = float . max value ; float nx = m normal . x ; float ny = m normal . y ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 v = m polygon b . vertices [ i ] ; float tempx = v . x - m v 1 . x ; float tempy = v . y - m v 1 . y ; float s = nx * tempx + ny * tempy ; if ( s < axis . separation ) { axis . separation = s ; } } } <SENTENCE_END/>

(Copy Probability: 8.0%)

<SENTENCE_START> { axis . type = ep axis . type . edge a ; axis . index = m front ? 0 : 1 ; axis . separation = float . max value ; float nx = m normal . x ; float ny = m normal . y ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 v = m polygon b . vertices [ i ] ; float tempx = v . x - m v 1 . x ; float tempy = v . y - m v 1 . y ; float s = nx * tempx + ny * tempy ; if ( s < axis . separation ) { axis . separation = s ; } } } <SENTENCE_END/>

separation

<SENTENCE_START> { axis . type = ep axis . type . edge a ; axis . index = m front ? 0 : 1 ; axis . separation = float . max value ; float nx = m normal . x ; float ny = m normal . y ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 v = m polygon b . vertices [ i ] ; float tempx = v . x - m v 1 . x ; float tempy = v . y - m v 1 . y ; float s = nx * tempx + ny * tempy ; if ( s < axis . separation ) { axis . separation = s ; } } } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { axis . type = ep axis . type . edge a ; axis . index = m front ? 0 : 1 ; axis . separation = float . max value ; float nx = m normal . x ; float ny = m normal . y ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 v = m polygon b . vertices [ i ] ; float tempx = v . x - m v 1 . x ; float tempy = v . y - m v 1 . y ; float s = nx * tempx + ny * tempy ; if ( s < axis . separation ) { axis . separation = s ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { axis . type = ep axis . type . edge a ; axis . index = m front ? 0 : 1 ; axis . separation = float . max value ; float nx = m normal . x ; float ny = m normal . y ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 v = m polygon b . vertices [ i ] ; float tempx = v . x - m v 1 . x ; float tempy = v . y - m v 1 . y ; float s = nx * tempx + ny * tempy ; if ( s < axis . separation ) { axis . separation = s ; } } } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { axis . type = ep axis . type . edge a ; axis . index = m front ? 0 : 1 ; axis . separation = float . max value ; float nx = m normal . x ; float ny = m normal . y ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 v = m polygon b . vertices [ i ] ; float tempx = v . x - m v 1 . x ; float tempy = v . y - m v 1 . y ; float s = nx * tempx + ny * tempy ; if ( s < axis . separation ) { axis . separation = s ; } } } <SENTENCE_END/>


Original Name compute,polygon,separation

compute

<SENTENCE_START> { axis . type = ep axis . type . unknown ; axis . index = - 1 ; axis . separation = - float . max value ; perp . x = - m normal . y ; perp . y = m normal . x ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 normal b = m polygon b . normals [ i ] ; vec 2 v b = m polygon b . vertices [ i ] ; n . x = - normal b . x ; n . y = - normal b . y ; float tempx = v b . x - m v 1 . x ; float tempy = v b . y - m v 1 . y ; float s 1 = n . x * tempx + n . y * tempy ; tempx = v b . x - m v 2 . x ; tempy = v b . y - m v 2 . y ; float s 2 = n . x * tempx + n . y * tempy ; float s = math utils . min ( s 1 , s 2 ) ; if ( s > m radius ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; return ; } if ( n . x * perp . x + n . y * perp . y >= 0.0f ) { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m upper limit ) , m normal ) < - settings . angular slop ) { continue ; } } else { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m lower limit ) , m normal ) < - settings . angular slop ) { continue ; } } if ( s > axis . separation ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; } } } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { axis . type = ep axis . type . unknown ; axis . index = - 1 ; axis . separation = - float . max value ; perp . x = - m normal . y ; perp . y = m normal . x ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 normal b = m polygon b . normals [ i ] ; vec 2 v b = m polygon b . vertices [ i ] ; n . x = - normal b . x ; n . y = - normal b . y ; float tempx = v b . x - m v 1 . x ; float tempy = v b . y - m v 1 . y ; float s 1 = n . x * tempx + n . y * tempy ; tempx = v b . x - m v 2 . x ; tempy = v b . y - m v 2 . y ; float s 2 = n . x * tempx + n . y * tempy ; float s = math utils . min ( s 1 , s 2 ) ; if ( s > m radius ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; return ; } if ( n . x * perp . x + n . y * perp . y >= 0.0f ) { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m upper limit ) , m normal ) < - settings . angular slop ) { continue ; } } else { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m lower limit ) , m normal ) < - settings . angular slop ) { continue ; } } if ( s > axis . separation ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; } } } <SENTENCE_END/>

polygon

<SENTENCE_START> { axis . type = ep axis . type . unknown ; axis . index = - 1 ; axis . separation = - float . max value ; perp . x = - m normal . y ; perp . y = m normal . x ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 normal b = m polygon b . normals [ i ] ; vec 2 v b = m polygon b . vertices [ i ] ; n . x = - normal b . x ; n . y = - normal b . y ; float tempx = v b . x - m v 1 . x ; float tempy = v b . y - m v 1 . y ; float s 1 = n . x * tempx + n . y * tempy ; tempx = v b . x - m v 2 . x ; tempy = v b . y - m v 2 . y ; float s 2 = n . x * tempx + n . y * tempy ; float s = math utils . min ( s 1 , s 2 ) ; if ( s > m radius ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; return ; } if ( n . x * perp . x + n . y * perp . y >= 0.0f ) { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m upper limit ) , m normal ) < - settings . angular slop ) { continue ; } } else { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m lower limit ) , m normal ) < - settings . angular slop ) { continue ; } } if ( s > axis . separation ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; } } } <SENTENCE_END/>

(Copy Probability: 7.8%)

<SENTENCE_START> { axis . type = ep axis . type . unknown ; axis . index = - 1 ; axis . separation = - float . max value ; perp . x = - m normal . y ; perp . y = m normal . x ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 normal b = m polygon b . normals [ i ] ; vec 2 v b = m polygon b . vertices [ i ] ; n . x = - normal b . x ; n . y = - normal b . y ; float tempx = v b . x - m v 1 . x ; float tempy = v b . y - m v 1 . y ; float s 1 = n . x * tempx + n . y * tempy ; tempx = v b . x - m v 2 . x ; tempy = v b . y - m v 2 . y ; float s 2 = n . x * tempx + n . y * tempy ; float s = math utils . min ( s 1 , s 2 ) ; if ( s > m radius ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; return ; } if ( n . x * perp . x + n . y * perp . y >= 0.0f ) { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m upper limit ) , m normal ) < - settings . angular slop ) { continue ; } } else { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m lower limit ) , m normal ) < - settings . angular slop ) { continue ; } } if ( s > axis . separation ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; } } } <SENTENCE_END/>

separation

<SENTENCE_START> { axis . type = ep axis . type . unknown ; axis . index = - 1 ; axis . separation = - float . max value ; perp . x = - m normal . y ; perp . y = m normal . x ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 normal b = m polygon b . normals [ i ] ; vec 2 v b = m polygon b . vertices [ i ] ; n . x = - normal b . x ; n . y = - normal b . y ; float tempx = v b . x - m v 1 . x ; float tempy = v b . y - m v 1 . y ; float s 1 = n . x * tempx + n . y * tempy ; tempx = v b . x - m v 2 . x ; tempy = v b . y - m v 2 . y ; float s 2 = n . x * tempx + n . y * tempy ; float s = math utils . min ( s 1 , s 2 ) ; if ( s > m radius ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; return ; } if ( n . x * perp . x + n . y * perp . y >= 0.0f ) { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m upper limit ) , m normal ) < - settings . angular slop ) { continue ; } } else { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m lower limit ) , m normal ) < - settings . angular slop ) { continue ; } } if ( s > axis . separation ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; } } } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { axis . type = ep axis . type . unknown ; axis . index = - 1 ; axis . separation = - float . max value ; perp . x = - m normal . y ; perp . y = m normal . x ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 normal b = m polygon b . normals [ i ] ; vec 2 v b = m polygon b . vertices [ i ] ; n . x = - normal b . x ; n . y = - normal b . y ; float tempx = v b . x - m v 1 . x ; float tempy = v b . y - m v 1 . y ; float s 1 = n . x * tempx + n . y * tempy ; tempx = v b . x - m v 2 . x ; tempy = v b . y - m v 2 . y ; float s 2 = n . x * tempx + n . y * tempy ; float s = math utils . min ( s 1 , s 2 ) ; if ( s > m radius ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; return ; } if ( n . x * perp . x + n . y * perp . y >= 0.0f ) { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m upper limit ) , m normal ) < - settings . angular slop ) { continue ; } } else { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m lower limit ) , m normal ) < - settings . angular slop ) { continue ; } } if ( s > axis . separation ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { axis . type = ep axis . type . unknown ; axis . index = - 1 ; axis . separation = - float . max value ; perp . x = - m normal . y ; perp . y = m normal . x ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 normal b = m polygon b . normals [ i ] ; vec 2 v b = m polygon b . vertices [ i ] ; n . x = - normal b . x ; n . y = - normal b . y ; float tempx = v b . x - m v 1 . x ; float tempy = v b . y - m v 1 . y ; float s 1 = n . x * tempx + n . y * tempy ; tempx = v b . x - m v 2 . x ; tempy = v b . y - m v 2 . y ; float s 2 = n . x * tempx + n . y * tempy ; float s = math utils . min ( s 1 , s 2 ) ; if ( s > m radius ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; return ; } if ( n . x * perp . x + n . y * perp . y >= 0.0f ) { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m upper limit ) , m normal ) < - settings . angular slop ) { continue ; } } else { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m lower limit ) , m normal ) < - settings . angular slop ) { continue ; } } if ( s > axis . separation ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; } } } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { axis . type = ep axis . type . unknown ; axis . index = - 1 ; axis . separation = - float . max value ; perp . x = - m normal . y ; perp . y = m normal . x ; for ( int i = 0 ; i < m polygon b . count ; ++ i ) { vec 2 normal b = m polygon b . normals [ i ] ; vec 2 v b = m polygon b . vertices [ i ] ; n . x = - normal b . x ; n . y = - normal b . y ; float tempx = v b . x - m v 1 . x ; float tempy = v b . y - m v 1 . y ; float s 1 = n . x * tempx + n . y * tempy ; tempx = v b . x - m v 2 . x ; tempy = v b . y - m v 2 . y ; float s 2 = n . x * tempx + n . y * tempy ; float s = math utils . min ( s 1 , s 2 ) ; if ( s > m radius ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; return ; } if ( n . x * perp . x + n . y * perp . y >= 0.0f ) { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m upper limit ) , m normal ) < - settings . angular slop ) { continue ; } } else { if ( vec 2 . dot ( temp . set ( n ) . sub local ( m lower limit ) , m normal ) < - settings . angular slop ) { continue ; } } if ( s > axis . separation ) { axis . type = ep axis . type . edge b ; axis . index = i ; axis . separation = s ; } } } <SENTENCE_END/>


Original Name get,color

get

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

(Copy Probability: 0.3%)

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

color

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

(Copy Probability: 71.0%)

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

%END%

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

(Copy Probability: 1.2%)

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


Original Name set,color

set

<SENTENCE_START> { %SELF% ( color . r , color . g , color . b , color . a ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { %SELF% ( color . r , color . g , color . b , color . a ) ; } <SENTENCE_END/>

color

<SENTENCE_START> { %SELF% ( color . r , color . g , color . b , color . a ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { %SELF% ( color . r , color . g , color . b , color . a ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( color . r , color . g , color . b , color . a ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { %SELF% ( color . r , color . g , color . b , color . a ) ; } <SENTENCE_END/>


Original Name set,color

set

<SENTENCE_START> { color . set ( r , g , b , a ) ; if ( model instance != null ) { for ( material m : model instance . materials ) { color attribute ca = ( color attribute ) m . get ( color attribute . diffuse ) ; if ( ca != null ) ca . color . set ( r , g , b , a ) ; } } } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { color . set ( r , g , b , a ) ; if ( model instance != null ) { for ( material m : model instance . materials ) { color attribute ca = ( color attribute ) m . get ( color attribute . diffuse ) ; if ( ca != null ) ca . color . set ( r , g , b , a ) ; } } } <SENTENCE_END/>

color

<SENTENCE_START> { color . set ( r , g , b , a ) ; if ( model instance != null ) { for ( material m : model instance . materials ) { color attribute ca = ( color attribute ) m . get ( color attribute . diffuse ) ; if ( ca != null ) ca . color . set ( r , g , b , a ) ; } } } <SENTENCE_END/>

(Copy Probability: 29.7%)

<SENTENCE_START> { color . set ( r , g , b , a ) ; if ( model instance != null ) { for ( material m : model instance . materials ) { color attribute ca = ( color attribute ) m . get ( color attribute . diffuse ) ; if ( ca != null ) ca . color . set ( r , g , b , a ) ; } } } <SENTENCE_END/>

%END%

<SENTENCE_START> { color . set ( r , g , b , a ) ; if ( model instance != null ) { for ( material m : model instance . materials ) { color attribute ca = ( color attribute ) m . get ( color attribute . diffuse ) ; if ( ca != null ) ca . color . set ( r , g , b , a ) ; } } } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { color . set ( r , g , b , a ) ; if ( model instance != null ) { for ( material m : model instance . materials ) { color attribute ca = ( color attribute ) m . get ( color attribute . diffuse ) ; if ( ca != null ) ca . color . set ( r , g , b , a ) ; } } } <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,values

set

<SENTENCE_START> { collision jni . bt short int index triplet data values set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { collision jni . bt short int index triplet data values set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

values

<SENTENCE_START> { collision jni . bt short int index triplet data values set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { collision jni . bt short int index triplet data values set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt short int index triplet data values set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 6.7%)

<SENTENCE_START> { collision jni . bt short int index triplet data values set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,values

get

<SENTENCE_START> { return collision jni . bt short int index triplet data values get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return collision jni . bt short int index triplet data values get ( swig c ptr , this ) ; } <SENTENCE_END/>

values

<SENTENCE_START> { return collision jni . bt short int index triplet data values get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.4%)

<SENTENCE_START> { return collision jni . bt short int index triplet data values get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt short int index triplet data values get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 5.2%)

<SENTENCE_START> { return collision jni . bt short int index triplet data values get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,pad

set

<SENTENCE_START> { collision jni . bt short int index triplet data pad set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { collision jni . bt short int index triplet data pad set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

pad

<SENTENCE_START> { collision jni . bt short int index triplet data pad set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . bt short int index triplet data pad set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt short int index triplet data pad set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { collision jni . bt short int index triplet data pad set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,pad

get

<SENTENCE_START> { return collision jni . bt short int index triplet data pad get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return collision jni . bt short int index triplet data pad get ( swig c ptr , this ) ; } <SENTENCE_END/>

pad

<SENTENCE_START> { return collision jni . bt short int index triplet data pad get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . bt short int index triplet data pad get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . bt short int index triplet data pad get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 6.8%)

<SENTENCE_START> { return collision jni . bt short int index triplet data pad get ( 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 get,info,1,non,virtual

get

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

info

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

1

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

non

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

virtual

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

(Copy Probability: 67.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>

(Copy Probability: 29.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 1 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 1 . get c ptr ( info ) , info ) ; } <SENTENCE_END/>


Original Name get,info,2,non,virtual

get

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

info

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

2

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

non

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

virtual

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 87.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 21.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint get info 2 non virtual ( swig c ptr , this , bt typed constraint . bt constraint info 2 . get c ptr ( info ) , info , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>


Original Name update,rhs

update

<SENTENCE_START> { dynamics jni . bt cone twist constraint update rhs ( swig c ptr , this , time step ) ; } <SENTENCE_END/>

(Copy Probability: 21.8%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint update rhs ( swig c ptr , this , time step ) ; } <SENTENCE_END/>

rhs

<SENTENCE_START> { dynamics jni . bt cone twist constraint update rhs ( swig c ptr , this , time step ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint update rhs ( swig c ptr , this , time step ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint update rhs ( swig c ptr , this , time step ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint update rhs ( swig c ptr , this , time step ) ; } <SENTENCE_END/>


Original Name get,rigid,body,a

get

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

rigid

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

body

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

a

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 95.6%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 12.3%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body a ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>


Original Name get,rigid,body,b

get

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

rigid

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

body

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

b

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 93.9%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>

(Copy Probability: 9.7%)

<SENTENCE_START> { return bt rigid body . get instance ( dynamics jni . bt cone twist constraint get rigid body b ( swig c ptr , this ) , false ) ; } <SENTENCE_END/>


Original Name set,angular,only

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set angular only ( swig c ptr , this , angular only ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set angular only ( swig c ptr , this , angular only ) ; } <SENTENCE_END/>

angular

<SENTENCE_START> { dynamics jni . bt cone twist constraint set angular only ( swig c ptr , this , angular only ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set angular only ( swig c ptr , this , angular only ) ; } <SENTENCE_END/>

only

<SENTENCE_START> { dynamics jni . bt cone twist constraint set angular only ( swig c ptr , this , angular only ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set angular only ( swig c ptr , this , angular only ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set angular only ( swig c ptr , this , angular only ) ; } <SENTENCE_END/>

(Copy Probability: 18.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set angular only ( swig c ptr , this , angular only ) ; } <SENTENCE_END/>


Original Name set,limit

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 0 ( swig c ptr , this , limit index , limit value ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 0 ( swig c ptr , this , limit index , limit value ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 0 ( swig c ptr , this , limit index , limit value ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 0 ( swig c ptr , this , limit index , limit value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 0 ( swig c ptr , this , limit index , limit value ) ; } <SENTENCE_END/>

(Copy Probability: 13.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 0 ( swig c ptr , this , limit index , limit value ) ; } <SENTENCE_END/>


Original Name set,limit

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 1 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor , relaxation factor ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 1 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor , relaxation factor ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 1 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor , relaxation factor ) ; } <SENTENCE_END/>

(Copy Probability: 86.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 1 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor , relaxation factor ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 1 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor , relaxation factor ) ; } <SENTENCE_END/>

(Copy Probability: 18.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 1 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor , relaxation factor ) ; } <SENTENCE_END/>


Original Name set,limit

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 2 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor ) ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 2 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 2 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor ) ; } <SENTENCE_END/>

(Copy Probability: 83.8%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 2 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 2 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor ) ; } <SENTENCE_END/>

(Copy Probability: 23.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 2 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness , bias factor ) ; } <SENTENCE_END/>


Original Name set,limit

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 3 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 3 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 3 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness ) ; } <SENTENCE_END/>

(Copy Probability: 85.4%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 3 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 3 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness ) ; } <SENTENCE_END/>

(Copy Probability: 16.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 3 ( swig c ptr , this , swing span 1 , swing span 2 , twist span , softness ) ; } <SENTENCE_END/>


Original Name set,limit

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 4 ( swig c ptr , this , swing span 1 , swing span 2 , twist span ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 4 ( swig c ptr , this , swing span 1 , swing span 2 , twist span ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 4 ( swig c ptr , this , swing span 1 , swing span 2 , twist span ) ; } <SENTENCE_END/>

(Copy Probability: 92.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 4 ( swig c ptr , this , swing span 1 , swing span 2 , twist span ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 4 ( swig c ptr , this , swing span 1 , swing span 2 , twist span ) ; } <SENTENCE_END/>

(Copy Probability: 28.1%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set limit swig 4 ( swig c ptr , this , swing span 1 , swing span 2 , twist span ) ; } <SENTENCE_END/>


Original Name get,a,frame

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get a frame ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get a frame ( swig c ptr , this ) ; } <SENTENCE_END/>

a

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get a frame ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get a frame ( swig c ptr , this ) ; } <SENTENCE_END/>

frame

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get a frame ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get a frame ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get a frame ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get a frame ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,b,frame

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get b frame ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get b frame ( swig c ptr , this ) ; } <SENTENCE_END/>

b

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get b frame ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get b frame ( swig c ptr , this ) ; } <SENTENCE_END/>

frame

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get b frame ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get b frame ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get b frame ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 24.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get b frame ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,solve,twist,limit

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

solve

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

twist

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 92.7%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 9.1%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve twist limit ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,solve,swing,limit

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

solve

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

swing

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 89.5%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 14.6%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get solve swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,twist,limit,sign

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

twist

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

sign

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 9.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 13.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist limit sign ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name calc,angle,info

calc

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 8.3%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info ( swig c ptr , this ) ; } <SENTENCE_END/>

angle

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info ( swig c ptr , this ) ; } <SENTENCE_END/>

info

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 96.1%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name calc,angle,info,2

calc

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 11.0%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

angle

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

info

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

2

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 89.4%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>

(Copy Probability: 7.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint calc angle info 2 ( swig c ptr , this , trans a , trans b , inv inertia world a , inv inertia world b ) ; } <SENTENCE_END/>


Original Name get,swing,span,1

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

swing

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

span

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

1

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 97.4%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 7.4%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 1 ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,swing,span,2

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

swing

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

span

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

2

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 96.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 7.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get swing span 2 ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,twist,span

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist span ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist span ( swig c ptr , this ) ; } <SENTENCE_END/>

twist

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist span ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist span ( swig c ptr , this ) ; } <SENTENCE_END/>

span

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist span ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist span ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist span ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist span ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,twist,angle

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist angle ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist angle ( swig c ptr , this ) ; } <SENTENCE_END/>

twist

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist angle ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist angle ( swig c ptr , this ) ; } <SENTENCE_END/>

angle

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist angle ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist angle ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist angle ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.5%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get twist angle ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name is,past,swing,limit

is

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

past

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

swing

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

limit

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 71.1%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 7.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint is past swing limit ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,damping

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set damping ( swig c ptr , this , damping ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set damping ( swig c ptr , this , damping ) ; } <SENTENCE_END/>

damping

<SENTENCE_START> { dynamics jni . bt cone twist constraint set damping ( swig c ptr , this , damping ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set damping ( swig c ptr , this , damping ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set damping ( swig c ptr , this , damping ) ; } <SENTENCE_END/>

(Copy Probability: 16.8%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set damping ( swig c ptr , this , damping ) ; } <SENTENCE_END/>


Original Name enable,motor

enable

<SENTENCE_START> { dynamics jni . bt cone twist constraint enable motor ( swig c ptr , this , b ) ; } <SENTENCE_END/>

(Copy Probability: 12.3%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint enable motor ( swig c ptr , this , b ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt cone twist constraint enable motor ( swig c ptr , this , b ) ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint enable motor ( swig c ptr , this , b ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint enable motor ( swig c ptr , this , b ) ; } <SENTENCE_END/>

(Copy Probability: 6.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint enable motor ( swig c ptr , this , b ) ; } <SENTENCE_END/>


Original Name set,max,motor,impulse

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

max

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

impulse

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 96.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 11.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>


Original Name set,max,motor,impulse,normalized

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 4.0%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

max

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

impulse

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 98.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

normalized

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 31.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>

(Copy Probability: 30.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set max motor impulse normalized ( swig c ptr , this , max motor impulse ) ; } <SENTENCE_END/>


Original Name get,fix,thresh

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get fix thresh ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get fix thresh ( swig c ptr , this ) ; } <SENTENCE_END/>

fix

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get fix thresh ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get fix thresh ( swig c ptr , this ) ; } <SENTENCE_END/>

thresh

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get fix thresh ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 98.6%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get fix thresh ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get fix thresh ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get fix thresh ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,fix,thresh

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set fix thresh ( swig c ptr , this , fix thresh ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set fix thresh ( swig c ptr , this , fix thresh ) ; } <SENTENCE_END/>

fix

<SENTENCE_START> { dynamics jni . bt cone twist constraint set fix thresh ( swig c ptr , this , fix thresh ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set fix thresh ( swig c ptr , this , fix thresh ) ; } <SENTENCE_END/>

thresh

<SENTENCE_START> { dynamics jni . bt cone twist constraint set fix thresh ( swig c ptr , this , fix thresh ) ; } <SENTENCE_END/>

(Copy Probability: 98.4%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set fix thresh ( swig c ptr , this , fix thresh ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set fix thresh ( swig c ptr , this , fix thresh ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set fix thresh ( swig c ptr , this , fix thresh ) ; } <SENTENCE_END/>


Original Name set,motor,target

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target ( swig c ptr , this , q ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target ( swig c ptr , this , q ) ; } <SENTENCE_END/>

target

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target ( swig c ptr , this , q ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 4.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target ( swig c ptr , this , q ) ; } <SENTENCE_END/>


Original Name set,motor,target,in,constraint,space

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

motor

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

target

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

in

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 84.3%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

constraint

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 30.6%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

space

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 29.5%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>

(Copy Probability: 29.4%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set motor target in constraint space ( swig c ptr , this , q ) ; } <SENTENCE_END/>


Original Name get,point,for,angle

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

point

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

for

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

angle

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

(Copy Probability: 94.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>

(Copy Probability: 12.3%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get point for angle ( swig c ptr , this , f angle in radians , f length ) ; } <SENTENCE_END/>


Original Name set,param

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

param

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

(Copy Probability: 96.3%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>

(Copy Probability: 6.2%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 0 ( swig c ptr , this , num , value , axis ) ; } <SENTENCE_END/>


Original Name set,param

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

param

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

(Copy Probability: 97.7%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>

(Copy Probability: 8.1%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set param swig 1 ( swig c ptr , this , num , value ) ; } <SENTENCE_END/>


Original Name set,frames

set

<SENTENCE_START> { dynamics jni . bt cone twist constraint set frames ( swig c ptr , this , frame a , frame b ) ; } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set frames ( swig c ptr , this , frame a , frame b ) ; } <SENTENCE_END/>

frames

<SENTENCE_START> { dynamics jni . bt cone twist constraint set frames ( swig c ptr , this , frame a , frame b ) ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set frames ( swig c ptr , this , frame a , frame b ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { dynamics jni . bt cone twist constraint set frames ( swig c ptr , this , frame a , frame b ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { dynamics jni . bt cone twist constraint set frames ( swig c ptr , this , frame a , frame b ) ; } <SENTENCE_END/>


Original Name get,frame,offset,a

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

frame

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

offset

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

a

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 92.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 25.1%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset a ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,frame,offset,b

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

frame

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

offset

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 100.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

b

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 90.0%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 19.6%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get frame offset b ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name get,param

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

param

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

(Copy Probability: 98.3%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 0 ( swig c ptr , this , num , axis ) ; } <SENTENCE_END/>


Original Name get,param

get

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

(Copy Probability: 3.8%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

param

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { return dynamics jni . bt cone twist constraint get param swig 1 ( swig c ptr , this , num ) ; } <SENTENCE_END/>


Original Name begin

begin

<SENTENCE_START> { if ( color == null ) color = target . get color ( ) ; start = color . a ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { if ( color == null ) color = target . get color ( ) ; start = color . a ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( color == null ) color = target . get color ( ) ; start = color . a ; } <SENTENCE_END/>

(Copy Probability: 5.6%)

<SENTENCE_START> { if ( color == null ) color = target . get color ( ) ; start = color . a ; } <SENTENCE_END/>


Original Name update

update

<SENTENCE_START> { color . a = start + ( end - start ) * percent ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { color . a = start + ( end - start ) * percent ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { color . a = start + ( end - start ) * percent ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { color . a = start + ( end - start ) * percent ; } <SENTENCE_END/>


Original Name reset

reset

<SENTENCE_START> { super . %SELF% ( ) ; color = null ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { super . %SELF% ( ) ; color = null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { super . %SELF% ( ) ; color = null ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { super . %SELF% ( ) ; color = null ; } <SENTENCE_END/>


Original Name get,color

get

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

(Copy Probability: 0.3%)

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

color

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

(Copy Probability: 71.0%)

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

%END%

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

(Copy Probability: 1.2%)

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


Original Name set,color

set

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

(Copy Probability: 1.1%)

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

color

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

(Copy Probability: 97.5%)

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

%END%

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

(Copy Probability: 0.9%)

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


Original Name get,alpha

get

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

(Copy Probability: 0.3%)

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

alpha

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

(Copy Probability: 17.3%)

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

%END%

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

(Copy Probability: 0.4%)

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


Original Name set,alpha

set

<SENTENCE_START> { this . end = alpha ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { this . end = alpha ; } <SENTENCE_END/>

alpha

<SENTENCE_START> { this . end = alpha ; } <SENTENCE_END/>

(Copy Probability: 16.2%)

<SENTENCE_START> { this . end = alpha ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . end = alpha ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { this . end = alpha ; } <SENTENCE_END/>


Original Name invalidate

invalidate

<SENTENCE_START> { super . %SELF% ( ) ; size invalid = true ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { super . %SELF% ( ) ; size invalid = true ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { super . %SELF% ( ) ; size invalid = true ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { super . %SELF% ( ) ; size invalid = true ; } <SENTENCE_END/>


Original Name compute,size

compute

<SENTENCE_START> { size invalid = false ; snapshot array < actor > children = get children ( ) ; int n = children . size ; pref width = pad left + pad right + spacing * ( n - 1 ) ; pref height = 0 ; for ( int i = 0 ; i < n ; i ++ ) { actor child = children . get ( i ) ; if ( child instanceof layout ) { layout layout = ( layout ) child ; pref width += layout . get pref width ( ) ; pref height = math . max ( pref height , layout . get pref height ( ) ) ; } else { pref width += child . get width ( ) ; pref height = math . max ( pref height , child . get height ( ) ) ; } } pref height += pad top + pad bottom ; if ( round ) { pref width = math . round ( pref width ) ; pref height = math . round ( pref height ) ; } } <SENTENCE_END/>

(Copy Probability: 3.7%)

<SENTENCE_START> { size invalid = false ; snapshot array < actor > children = get children ( ) ; int n = children . size ; pref width = pad left + pad right + spacing * ( n - 1 ) ; pref height = 0 ; for ( int i = 0 ; i < n ; i ++ ) { actor child = children . get ( i ) ; if ( child instanceof layout ) { layout layout = ( layout ) child ; pref width += layout . get pref width ( ) ; pref height = math . max ( pref height , layout . get pref height ( ) ) ; } else { pref width += child . get width ( ) ; pref height = math . max ( pref height , child . get height ( ) ) ; } } pref height += pad top + pad bottom ; if ( round ) { pref width = math . round ( pref width ) ; pref height = math . round ( pref height ) ; } } <SENTENCE_END/>

size

<SENTENCE_START> { size invalid = false ; snapshot array < actor > children = get children ( ) ; int n = children . size ; pref width = pad left + pad right + spacing * ( n - 1 ) ; pref height = 0 ; for ( int i = 0 ; i < n ; i ++ ) { actor child = children . get ( i ) ; if ( child instanceof layout ) { layout layout = ( layout ) child ; pref width += layout . get pref width ( ) ; pref height = math . max ( pref height , layout . get pref height ( ) ) ; } else { pref width += child . get width ( ) ; pref height = math . max ( pref height , child . get height ( ) ) ; } } pref height += pad top + pad bottom ; if ( round ) { pref width = math . round ( pref width ) ; pref height = math . round ( pref height ) ; } } <SENTENCE_END/>

(Copy Probability: 11.5%)

<SENTENCE_START> { size invalid = false ; snapshot array < actor > children = get children ( ) ; int n = children . size ; pref width = pad left + pad right + spacing * ( n - 1 ) ; pref height = 0 ; for ( int i = 0 ; i < n ; i ++ ) { actor child = children . get ( i ) ; if ( child instanceof layout ) { layout layout = ( layout ) child ; pref width += layout . get pref width ( ) ; pref height = math . max ( pref height , layout . get pref height ( ) ) ; } else { pref width += child . get width ( ) ; pref height = math . max ( pref height , child . get height ( ) ) ; } } pref height += pad top + pad bottom ; if ( round ) { pref width = math . round ( pref width ) ; pref height = math . round ( pref height ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { size invalid = false ; snapshot array < actor > children = get children ( ) ; int n = children . size ; pref width = pad left + pad right + spacing * ( n - 1 ) ; pref height = 0 ; for ( int i = 0 ; i < n ; i ++ ) { actor child = children . get ( i ) ; if ( child instanceof layout ) { layout layout = ( layout ) child ; pref width += layout . get pref width ( ) ; pref height = math . max ( pref height , layout . get pref height ( ) ) ; } else { pref width += child . get width ( ) ; pref height = math . max ( pref height , child . get height ( ) ) ; } } pref height += pad top + pad bottom ; if ( round ) { pref width = math . round ( pref width ) ; pref height = math . round ( pref height ) ; } } <SENTENCE_END/>

(Copy Probability: 8.6%)

<SENTENCE_START> { size invalid = false ; snapshot array < actor > children = get children ( ) ; int n = children . size ; pref width = pad left + pad right + spacing * ( n - 1 ) ; pref height = 0 ; for ( int i = 0 ; i < n ; i ++ ) { actor child = children . get ( i ) ; if ( child instanceof layout ) { layout layout = ( layout ) child ; pref width += layout . get pref width ( ) ; pref height = math . max ( pref height , layout . get pref height ( ) ) ; } else { pref width += child . get width ( ) ; pref height = math . max ( pref height , child . get height ( ) ) ; } } pref height += pad top + pad bottom ; if ( round ) { pref width = math . round ( pref width ) ; pref height = math . round ( pref height ) ; } } <SENTENCE_END/>


Original Name layout

layout

<SENTENCE_START> { float spacing = this . spacing , pad bottom = this . pad bottom ; int align = this . align ; boolean reverse = this . reverse , round = this . round ; float group height = get height ( ) - pad top - pad bottom ; float x = ! reverse ? pad left : get width ( ) - pad right + spacing ; snapshot array < actor > children = get children ( ) ; for ( int i = 0 , n = children . size ; i < n ; i ++ ) { actor child = children . get ( i ) ; float width , height ; layout %SELF% = null ; if ( child instanceof layout ) { %SELF% = ( layout ) child ; if ( fill > 0 ) height = group height * fill ; else height = math . min ( %SELF% . get pref height ( ) , group height ) ; height = math . max ( height , %SELF% . get min height ( ) ) ; float max height = %SELF% . get max height ( ) ; if ( max height > 0 && height > max height ) height = max height ; width = %SELF% . get pref width ( ) ; } else { width = child . get width ( ) ; height = child . get height ( ) ; if ( fill > 0 ) height *= fill ; } float y = pad bottom ; if ( ( align & align . top ) != 0 ) y += group height - height ; else if ( ( align & align . bottom ) == 0 ) y += ( group height - height ) / 2 ; if ( reverse ) x -= ( width + spacing ) ; if ( round ) child . set bounds ( math . round ( x ) , math . round ( y ) , math . round ( width ) , math . round ( height ) ) ; else child . set bounds ( x , y , width , height ) ; if ( ! reverse ) x += ( width + spacing ) ; if ( %SELF% != null ) %SELF% . validate ( ) ; } } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { float spacing = this . spacing , pad bottom = this . pad bottom ; int align = this . align ; boolean reverse = this . reverse , round = this . round ; float group height = get height ( ) - pad top - pad bottom ; float x = ! reverse ? pad left : get width ( ) - pad right + spacing ; snapshot array < actor > children = get children ( ) ; for ( int i = 0 , n = children . size ; i < n ; i ++ ) { actor child = children . get ( i ) ; float width , height ; layout %SELF% = null ; if ( child instanceof layout ) { %SELF% = ( layout ) child ; if ( fill > 0 ) height = group height * fill ; else height = math . min ( %SELF% . get pref height ( ) , group height ) ; height = math . max ( height , %SELF% . get min height ( ) ) ; float max height = %SELF% . get max height ( ) ; if ( max height > 0 && height > max height ) height = max height ; width = %SELF% . get pref width ( ) ; } else { width = child . get width ( ) ; height = child . get height ( ) ; if ( fill > 0 ) height *= fill ; } float y = pad bottom ; if ( ( align & align . top ) != 0 ) y += group height - height ; else if ( ( align & align . bottom ) == 0 ) y += ( group height - height ) / 2 ; if ( reverse ) x -= ( width + spacing ) ; if ( round ) child . set bounds ( math . round ( x ) , math . round ( y ) , math . round ( width ) , math . round ( height ) ) ; else child . set bounds ( x , y , width , height ) ; if ( ! reverse ) x += ( width + spacing ) ; if ( %SELF% != null ) %SELF% . validate ( ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { float spacing = this . spacing , pad bottom = this . pad bottom ; int align = this . align ; boolean reverse = this . reverse , round = this . round ; float group height = get height ( ) - pad top - pad bottom ; float x = ! reverse ? pad left : get width ( ) - pad right + spacing ; snapshot array < actor > children = get children ( ) ; for ( int i = 0 , n = children . size ; i < n ; i ++ ) { actor child = children . get ( i ) ; float width , height ; layout %SELF% = null ; if ( child instanceof layout ) { %SELF% = ( layout ) child ; if ( fill > 0 ) height = group height * fill ; else height = math . min ( %SELF% . get pref height ( ) , group height ) ; height = math . max ( height , %SELF% . get min height ( ) ) ; float max height = %SELF% . get max height ( ) ; if ( max height > 0 && height > max height ) height = max height ; width = %SELF% . get pref width ( ) ; } else { width = child . get width ( ) ; height = child . get height ( ) ; if ( fill > 0 ) height *= fill ; } float y = pad bottom ; if ( ( align & align . top ) != 0 ) y += group height - height ; else if ( ( align & align . bottom ) == 0 ) y += ( group height - height ) / 2 ; if ( reverse ) x -= ( width + spacing ) ; if ( round ) child . set bounds ( math . round ( x ) , math . round ( y ) , math . round ( width ) , math . round ( height ) ) ; else child . set bounds ( x , y , width , height ) ; if ( ! reverse ) x += ( width + spacing ) ; if ( %SELF% != null ) %SELF% . validate ( ) ; } } <SENTENCE_END/>

(Copy Probability: 6.5%)

<SENTENCE_START> { float spacing = this . spacing , pad bottom = this . pad bottom ; int align = this . align ; boolean reverse = this . reverse , round = this . round ; float group height = get height ( ) - pad top - pad bottom ; float x = ! reverse ? pad left : get width ( ) - pad right + spacing ; snapshot array < actor > children = get children ( ) ; for ( int i = 0 , n = children . size ; i < n ; i ++ ) { actor child = children . get ( i ) ; float width , height ; layout %SELF% = null ; if ( child instanceof layout ) { %SELF% = ( layout ) child ; if ( fill > 0 ) height = group height * fill ; else height = math . min ( %SELF% . get pref height ( ) , group height ) ; height = math . max ( height , %SELF% . get min height ( ) ) ; float max height = %SELF% . get max height ( ) ; if ( max height > 0 && height > max height ) height = max height ; width = %SELF% . get pref width ( ) ; } else { width = child . get width ( ) ; height = child . get height ( ) ; if ( fill > 0 ) height *= fill ; } float y = pad bottom ; if ( ( align & align . top ) != 0 ) y += group height - height ; else if ( ( align & align . bottom ) == 0 ) y += ( group height - height ) / 2 ; if ( reverse ) x -= ( width + spacing ) ; if ( round ) child . set bounds ( math . round ( x ) , math . round ( y ) , math . round ( width ) , math . round ( height ) ) ; else child . set bounds ( x , y , width , height ) ; if ( ! reverse ) x += ( width + spacing ) ; if ( %SELF% != null ) %SELF% . validate ( ) ; } } <SENTENCE_END/>


Original Name get,pref,width

get

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref width ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref width ; } <SENTENCE_END/>

pref

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref width ; } <SENTENCE_END/>

(Copy Probability: 34.8%)

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref width ; } <SENTENCE_END/>

width

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref width ; } <SENTENCE_END/>

(Copy Probability: 37.2%)

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref width ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref width ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref width ; } <SENTENCE_END/>


Original Name get,pref,height

get

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref height ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref height ; } <SENTENCE_END/>

pref

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref height ; } <SENTENCE_END/>

(Copy Probability: 43.1%)

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref height ; } <SENTENCE_END/>

height

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref height ; } <SENTENCE_END/>

(Copy Probability: 46.9%)

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref height ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref height ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { if ( size invalid ) compute size ( ) ; return pref height ; } <SENTENCE_END/>


Original Name set,round

set

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

(Copy Probability: 1.6%)

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

round

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

(Copy Probability: 99.5%)

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

%END%

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

(Copy Probability: 1.0%)

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


Original Name reverse

reverse

<SENTENCE_START> { %SELF% ( true ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { %SELF% ( true ) ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( true ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { %SELF% ( true ) ; return this ; } <SENTENCE_END/>


Original Name reverse

reverse

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>


Original Name get,reverse

get

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

(Copy Probability: 0.3%)

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

reverse

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

(Copy Probability: 47.7%)

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

%END%

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

(Copy Probability: 1.4%)

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


Original Name space

space

<SENTENCE_START> { this . spacing = spacing ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { this . spacing = spacing ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . spacing = spacing ; return this ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { this . spacing = spacing ; return this ; } <SENTENCE_END/>


Original Name get,space

get

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

(Copy Probability: 0.3%)

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

space

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

(Copy Probability: 95.1%)

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

%END%

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

(Copy Probability: 6.8%)

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


Original Name pad

pad

<SENTENCE_START> { pad top = %SELF% ; pad left = %SELF% ; pad bottom = %SELF% ; pad right = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { pad top = %SELF% ; pad left = %SELF% ; pad bottom = %SELF% ; pad right = %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { pad top = %SELF% ; pad left = %SELF% ; pad bottom = %SELF% ; pad right = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { pad top = %SELF% ; pad left = %SELF% ; pad bottom = %SELF% ; pad right = %SELF% ; return this ; } <SENTENCE_END/>


Original Name pad

pad

<SENTENCE_START> { pad top = top ; pad left = left ; pad bottom = bottom ; pad right = right ; return this ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { pad top = top ; pad left = left ; pad bottom = bottom ; pad right = right ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { pad top = top ; pad left = left ; pad bottom = bottom ; pad right = right ; return this ; } <SENTENCE_END/>

(Copy Probability: 22.8%)

<SENTENCE_START> { pad top = top ; pad left = left ; pad bottom = bottom ; pad right = right ; return this ; } <SENTENCE_END/>


Original Name pad,top

pad

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

top

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>


Original Name pad,left

pad

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

left

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>


Original Name pad,bottom

pad

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

bottom

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>


Original Name pad,right

pad

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

right

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>


Original Name get,pad,top

get

<SENTENCE_START> { return pad top ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return pad top ; } <SENTENCE_END/>

pad

<SENTENCE_START> { return pad top ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { return pad top ; } <SENTENCE_END/>

top

<SENTENCE_START> { return pad top ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { return pad top ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return pad top ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { return pad top ; } <SENTENCE_END/>


Original Name get,pad,left

get

<SENTENCE_START> { return pad left ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return pad left ; } <SENTENCE_END/>

pad

<SENTENCE_START> { return pad left ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { return pad left ; } <SENTENCE_END/>

left

<SENTENCE_START> { return pad left ; } <SENTENCE_END/>

(Copy Probability: 98.9%)

<SENTENCE_START> { return pad left ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return pad left ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { return pad left ; } <SENTENCE_END/>


Original Name get,pad,bottom

get

<SENTENCE_START> { return pad bottom ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return pad bottom ; } <SENTENCE_END/>

pad

<SENTENCE_START> { return pad bottom ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { return pad bottom ; } <SENTENCE_END/>

bottom

<SENTENCE_START> { return pad bottom ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { return pad bottom ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return pad bottom ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { return pad bottom ; } <SENTENCE_END/>


Original Name get,pad,right

get

<SENTENCE_START> { return pad right ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { return pad right ; } <SENTENCE_END/>

pad

<SENTENCE_START> { return pad right ; } <SENTENCE_END/>

(Copy Probability: 99.1%)

<SENTENCE_START> { return pad right ; } <SENTENCE_END/>

right

<SENTENCE_START> { return pad right ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { return pad right ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return pad right ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { return pad right ; } <SENTENCE_END/>


Original Name align

align

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>


Original Name center

center

<SENTENCE_START> { align = align . %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { align = align . %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { align = align . %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { align = align . %SELF% ; return this ; } <SENTENCE_END/>


Original Name top

top

<SENTENCE_START> { align |= align . %SELF% ; align &= ~ align . bottom ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { align |= align . %SELF% ; align &= ~ align . bottom ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { align |= align . %SELF% ; align &= ~ align . bottom ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { align |= align . %SELF% ; align &= ~ align . bottom ; return this ; } <SENTENCE_END/>


Original Name bottom

bottom

<SENTENCE_START> { align |= align . %SELF% ; align &= ~ align . top ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { align |= align . %SELF% ; align &= ~ align . top ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { align |= align . %SELF% ; align &= ~ align . top ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { align |= align . %SELF% ; align &= ~ align . top ; return this ; } <SENTENCE_END/>


Original Name get,align

get

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

(Copy Probability: 0.3%)

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

align

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

(Copy Probability: 50.8%)

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

%END%

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

(Copy Probability: 1.6%)

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


Original Name fill

fill

<SENTENCE_START> { %SELF% = 1f ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { %SELF% = 1f ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% = 1f ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% = 1f ; return this ; } <SENTENCE_END/>


Original Name fill

fill

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { this . %SELF% = %SELF% ; return this ; } <SENTENCE_END/>


Original Name get,fill

get

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

(Copy Probability: 0.4%)

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

fill

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

(Copy Probability: 79.1%)

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

%END%

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

(Copy Probability: 2.1%)

<SENTENCE_START> { return fill ; } <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,shape,part

set

<SENTENCE_START> { collision jni . local shape info shape part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { collision jni . local shape info shape part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { collision jni . local shape info shape part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { collision jni . local shape info shape part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

part

<SENTENCE_START> { collision jni . local shape info shape part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 94.3%)

<SENTENCE_START> { collision jni . local shape info shape part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . local shape info shape part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 7.3%)

<SENTENCE_START> { collision jni . local shape info shape part set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,shape,part

get

<SENTENCE_START> { return collision jni . local shape info shape part get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return collision jni . local shape info shape part get ( swig c ptr , this ) ; } <SENTENCE_END/>

shape

<SENTENCE_START> { return collision jni . local shape info shape part get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { return collision jni . local shape info shape part get ( swig c ptr , this ) ; } <SENTENCE_END/>

part

<SENTENCE_START> { return collision jni . local shape info shape part get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 96.7%)

<SENTENCE_START> { return collision jni . local shape info shape part get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . local shape info shape part get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 6.4%)

<SENTENCE_START> { return collision jni . local shape info shape part get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,triangle,index

set

<SENTENCE_START> { collision jni . local shape info triangle index set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { collision jni . local shape info triangle index set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

triangle

<SENTENCE_START> { collision jni . local shape info triangle index set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . local shape info triangle index set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

index

<SENTENCE_START> { collision jni . local shape info triangle index set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { collision jni . local shape info triangle index set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . local shape info triangle index set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 10.7%)

<SENTENCE_START> { collision jni . local shape info triangle index set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,triangle,index

get

<SENTENCE_START> { return collision jni . local shape info triangle index get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return collision jni . local shape info triangle index get ( swig c ptr , this ) ; } <SENTENCE_END/>

triangle

<SENTENCE_START> { return collision jni . local shape info triangle index get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { return collision jni . local shape info triangle index get ( swig c ptr , this ) ; } <SENTENCE_END/>

index

<SENTENCE_START> { return collision jni . local shape info triangle index get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return collision jni . local shape info triangle index get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . local shape info triangle index get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 9.5%)

<SENTENCE_START> { return collision jni . local shape info triangle index get ( 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 create

create

<SENTENCE_START> { font = new bitmap font ( ) ; font . set color ( 0 , 0 , 0 , 1 ) ; pixmap pixmap = new pixmap ( 16 , 16 , format . rgba 8888 ) ; pixmap . set color ( 1 , 1 , 1 , 1 ) ; pixmap . fill ( ) ; texture = new texture ( pixmap ) ; batch = new sprite batch ( ) ; camera = new orthographic camera ( ) ; camera . position . set ( 100 , 100 , 0 ) ; camera . update ( ) ; viewports = viewport test 1 . get viewports ( camera ) ; viewport = viewports . first ( ) ; names = viewport test 1 . get viewport names ( ) ; name = names . first ( ) ; gdx . input . set input processor ( new input adapter ( ) { public boolean key down ( int keycode ) { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } } ) ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { font = new bitmap font ( ) ; font . set color ( 0 , 0 , 0 , 1 ) ; pixmap pixmap = new pixmap ( 16 , 16 , format . rgba 8888 ) ; pixmap . set color ( 1 , 1 , 1 , 1 ) ; pixmap . fill ( ) ; texture = new texture ( pixmap ) ; batch = new sprite batch ( ) ; camera = new orthographic camera ( ) ; camera . position . set ( 100 , 100 , 0 ) ; camera . update ( ) ; viewports = viewport test 1 . get viewports ( camera ) ; viewport = viewports . first ( ) ; names = viewport test 1 . get viewport names ( ) ; name = names . first ( ) ; gdx . input . set input processor ( new input adapter ( ) { public boolean key down ( int keycode ) { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } } ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { font = new bitmap font ( ) ; font . set color ( 0 , 0 , 0 , 1 ) ; pixmap pixmap = new pixmap ( 16 , 16 , format . rgba 8888 ) ; pixmap . set color ( 1 , 1 , 1 , 1 ) ; pixmap . fill ( ) ; texture = new texture ( pixmap ) ; batch = new sprite batch ( ) ; camera = new orthographic camera ( ) ; camera . position . set ( 100 , 100 , 0 ) ; camera . update ( ) ; viewports = viewport test 1 . get viewports ( camera ) ; viewport = viewports . first ( ) ; names = viewport test 1 . get viewport names ( ) ; name = names . first ( ) ; gdx . input . set input processor ( new input adapter ( ) { public boolean key down ( int keycode ) { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } } ) ; } <SENTENCE_END/>

(Copy Probability: 8.7%)

<SENTENCE_START> { font = new bitmap font ( ) ; font . set color ( 0 , 0 , 0 , 1 ) ; pixmap pixmap = new pixmap ( 16 , 16 , format . rgba 8888 ) ; pixmap . set color ( 1 , 1 , 1 , 1 ) ; pixmap . fill ( ) ; texture = new texture ( pixmap ) ; batch = new sprite batch ( ) ; camera = new orthographic camera ( ) ; camera . position . set ( 100 , 100 , 0 ) ; camera . update ( ) ; viewports = viewport test 1 . get viewports ( camera ) ; viewport = viewports . first ( ) ; names = viewport test 1 . get viewport names ( ) ; name = names . first ( ) ; gdx . input . set input processor ( new input adapter ( ) { public boolean key down ( int keycode ) { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } } ) ; } <SENTENCE_END/>


Original Name key,down

key

<SENTENCE_START> { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } <SENTENCE_END/>

down

<SENTENCE_START> { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } <SENTENCE_END/>

(Copy Probability: 8.0%)

<SENTENCE_START> { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { if ( keycode == input . keys . space ) { int index = ( viewports . index of ( viewport , true ) + 1 ) % viewports . size ; name = names . get ( index ) ; viewport = viewports . get ( index ) ; resize ( gdx . graphics . get width ( ) , gdx . graphics . get height ( ) ) ; } return false ; } <SENTENCE_END/>


Original Name render

render

<SENTENCE_START> { batch . set projection matrix ( camera . projection ) ; batch . set transform matrix ( camera . view ) ; gdx . gl . gl clear ( gl 20 . gl color buffer bit ) ; batch . begin ( ) ; batch . set color ( 1 , 1 , 1 , 1 ) ; batch . draw ( texture , - 4096 , - 4096 , 4096 , 4096 , 8192 , 8192 , 1 , 1 , 0 , 0 , 0 , 16 , 16 , false , false ) ; batch . set color ( 1 , 0 , 0 , 1 ) ; batch . draw ( texture , 150 , 100 , 16 , 16 , 32 , 32 , 1 , 1 , 45 , 0 , 0 , 16 , 16 , false , false ) ; font . draw ( batch , viewport . get class ( ) . get simple name ( ) , 150 , 100 ) ; batch . end ( ) ; if ( viewport instanceof scaling viewport ) { scaling viewport scaling viewport = ( scaling viewport ) viewport ; int screen width = gdx . graphics . get width ( ) ; int screen height = gdx . graphics . get height ( ) ; gdx . gl . gl viewport ( 0 , 0 , screen width , screen height ) ; batch . get projection matrix ( ) . idt ( ) . set to ortho 2 d ( 0 , 0 , screen width , screen height ) ; batch . get transform matrix ( ) . idt ( ) ; batch . begin ( ) ; float left gutter width = scaling viewport . get left gutter width ( ) ; if ( left gutter width > 0 ) { batch . draw ( texture , 0 , 0 , left gutter width , screen height ) ; batch . draw ( texture , scaling viewport . get right gutter x ( ) , 0 , scaling viewport . get right gutter width ( ) , screen height ) ; } float bottom gutter height = scaling viewport . get bottom gutter height ( ) ; if ( bottom gutter height > 0 ) { batch . draw ( texture , 0 , 0 , screen width , bottom gutter height ) ; batch . draw ( texture , 0 , scaling viewport . get top gutter y ( ) , screen width , scaling viewport . get top gutter height ( ) ) ; } batch . end ( ) ; viewport . update ( screen width , screen height , true ) ; } } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { batch . set projection matrix ( camera . projection ) ; batch . set transform matrix ( camera . view ) ; gdx . gl . gl clear ( gl 20 . gl color buffer bit ) ; batch . begin ( ) ; batch . set color ( 1 , 1 , 1 , 1 ) ; batch . draw ( texture , - 4096 , - 4096 , 4096 , 4096 , 8192 , 8192 , 1 , 1 , 0 , 0 , 0 , 16 , 16 , false , false ) ; batch . set color ( 1 , 0 , 0 , 1 ) ; batch . draw ( texture , 150 , 100 , 16 , 16 , 32 , 32 , 1 , 1 , 45 , 0 , 0 , 16 , 16 , false , false ) ; font . draw ( batch , viewport . get class ( ) . get simple name ( ) , 150 , 100 ) ; batch . end ( ) ; if ( viewport instanceof scaling viewport ) { scaling viewport scaling viewport = ( scaling viewport ) viewport ; int screen width = gdx . graphics . get width ( ) ; int screen height = gdx . graphics . get height ( ) ; gdx . gl . gl viewport ( 0 , 0 , screen width , screen height ) ; batch . get projection matrix ( ) . idt ( ) . set to ortho 2 d ( 0 , 0 , screen width , screen height ) ; batch . get transform matrix ( ) . idt ( ) ; batch . begin ( ) ; float left gutter width = scaling viewport . get left gutter width ( ) ; if ( left gutter width > 0 ) { batch . draw ( texture , 0 , 0 , left gutter width , screen height ) ; batch . draw ( texture , scaling viewport . get right gutter x ( ) , 0 , scaling viewport . get right gutter width ( ) , screen height ) ; } float bottom gutter height = scaling viewport . get bottom gutter height ( ) ; if ( bottom gutter height > 0 ) { batch . draw ( texture , 0 , 0 , screen width , bottom gutter height ) ; batch . draw ( texture , 0 , scaling viewport . get top gutter y ( ) , screen width , scaling viewport . get top gutter height ( ) ) ; } batch . end ( ) ; viewport . update ( screen width , screen height , true ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { batch . set projection matrix ( camera . projection ) ; batch . set transform matrix ( camera . view ) ; gdx . gl . gl clear ( gl 20 . gl color buffer bit ) ; batch . begin ( ) ; batch . set color ( 1 , 1 , 1 , 1 ) ; batch . draw ( texture , - 4096 , - 4096 , 4096 , 4096 , 8192 , 8192 , 1 , 1 , 0 , 0 , 0 , 16 , 16 , false , false ) ; batch . set color ( 1 , 0 , 0 , 1 ) ; batch . draw ( texture , 150 , 100 , 16 , 16 , 32 , 32 , 1 , 1 , 45 , 0 , 0 , 16 , 16 , false , false ) ; font . draw ( batch , viewport . get class ( ) . get simple name ( ) , 150 , 100 ) ; batch . end ( ) ; if ( viewport instanceof scaling viewport ) { scaling viewport scaling viewport = ( scaling viewport ) viewport ; int screen width = gdx . graphics . get width ( ) ; int screen height = gdx . graphics . get height ( ) ; gdx . gl . gl viewport ( 0 , 0 , screen width , screen height ) ; batch . get projection matrix ( ) . idt ( ) . set to ortho 2 d ( 0 , 0 , screen width , screen height ) ; batch . get transform matrix ( ) . idt ( ) ; batch . begin ( ) ; float left gutter width = scaling viewport . get left gutter width ( ) ; if ( left gutter width > 0 ) { batch . draw ( texture , 0 , 0 , left gutter width , screen height ) ; batch . draw ( texture , scaling viewport . get right gutter x ( ) , 0 , scaling viewport . get right gutter width ( ) , screen height ) ; } float bottom gutter height = scaling viewport . get bottom gutter height ( ) ; if ( bottom gutter height > 0 ) { batch . draw ( texture , 0 , 0 , screen width , bottom gutter height ) ; batch . draw ( texture , 0 , scaling viewport . get top gutter y ( ) , screen width , scaling viewport . get top gutter height ( ) ) ; } batch . end ( ) ; viewport . update ( screen width , screen height , true ) ; } } <SENTENCE_END/>

(Copy Probability: 9.0%)

<SENTENCE_START> { batch . set projection matrix ( camera . projection ) ; batch . set transform matrix ( camera . view ) ; gdx . gl . gl clear ( gl 20 . gl color buffer bit ) ; batch . begin ( ) ; batch . set color ( 1 , 1 , 1 , 1 ) ; batch . draw ( texture , - 4096 , - 4096 , 4096 , 4096 , 8192 , 8192 , 1 , 1 , 0 , 0 , 0 , 16 , 16 , false , false ) ; batch . set color ( 1 , 0 , 0 , 1 ) ; batch . draw ( texture , 150 , 100 , 16 , 16 , 32 , 32 , 1 , 1 , 45 , 0 , 0 , 16 , 16 , false , false ) ; font . draw ( batch , viewport . get class ( ) . get simple name ( ) , 150 , 100 ) ; batch . end ( ) ; if ( viewport instanceof scaling viewport ) { scaling viewport scaling viewport = ( scaling viewport ) viewport ; int screen width = gdx . graphics . get width ( ) ; int screen height = gdx . graphics . get height ( ) ; gdx . gl . gl viewport ( 0 , 0 , screen width , screen height ) ; batch . get projection matrix ( ) . idt ( ) . set to ortho 2 d ( 0 , 0 , screen width , screen height ) ; batch . get transform matrix ( ) . idt ( ) ; batch . begin ( ) ; float left gutter width = scaling viewport . get left gutter width ( ) ; if ( left gutter width > 0 ) { batch . draw ( texture , 0 , 0 , left gutter width , screen height ) ; batch . draw ( texture , scaling viewport . get right gutter x ( ) , 0 , scaling viewport . get right gutter width ( ) , screen height ) ; } float bottom gutter height = scaling viewport . get bottom gutter height ( ) ; if ( bottom gutter height > 0 ) { batch . draw ( texture , 0 , 0 , screen width , bottom gutter height ) ; batch . draw ( texture , 0 , scaling viewport . get top gutter y ( ) , screen width , scaling viewport . get top gutter height ( ) ) ; } batch . end ( ) ; viewport . update ( screen width , screen height , true ) ; } } <SENTENCE_END/>


Original Name resize

resize

<SENTENCE_START> { system . out . println ( name ) ; viewport . update ( width , height ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { system . out . println ( name ) ; viewport . update ( width , height ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { system . out . println ( name ) ; viewport . update ( width , height ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { system . out . println ( name ) ; viewport . update ( width , height ) ; } <SENTENCE_END/>


Original Name dispose

dispose

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

(Copy Probability: 0.6%)

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

%END%

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

(Copy Probability: 0.2%)

<SENTENCE_START> { texture . %SELF% ( ) ; batch . %SELF% ( ) ; } <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,user,value

set

<SENTENCE_START> { collision jni . gdx collision object bridge user value set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { collision jni . gdx collision object bridge user value set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

user

<SENTENCE_START> { collision jni . gdx collision object bridge user value set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { collision jni . gdx collision object bridge user value set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { collision jni . gdx collision object bridge user value set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { collision jni . gdx collision object bridge user value set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . gdx collision object bridge user value set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 39.3%)

<SENTENCE_START> { collision jni . gdx collision object bridge user value set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,user,value

get

<SENTENCE_START> { return collision jni . gdx collision object bridge user value get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return collision jni . gdx collision object bridge user value get ( swig c ptr , this ) ; } <SENTENCE_END/>

user

<SENTENCE_START> { return collision jni . gdx collision object bridge user value get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return collision jni . gdx collision object bridge user value get ( swig c ptr , this ) ; } <SENTENCE_END/>

value

<SENTENCE_START> { return collision jni . gdx collision object bridge user value get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.7%)

<SENTENCE_START> { return collision jni . gdx collision object bridge user value get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . gdx collision object bridge user value get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 40.7%)

<SENTENCE_START> { return collision jni . gdx collision object bridge user value get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,contact,callback,flag

set

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

contact

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.6%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

callback

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

flag

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 70.6%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 12.4%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback flag set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,contact,callback,flag

get

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

contact

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

callback

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

flag

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 66.9%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 12.0%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback flag get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name set,contact,callback,filter

set

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

contact

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.5%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

callback

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 99.8%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

filter

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 67.8%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>

(Copy Probability: 12.1%)

<SENTENCE_START> { collision jni . gdx collision object bridge contact callback filter set ( swig c ptr , this , value ) ; } <SENTENCE_END/>


Original Name get,contact,callback,filter

get

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

contact

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

callback

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 99.9%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

filter

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 63.7%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>

(Copy Probability: 12.2%)

<SENTENCE_START> { return collision jni . gdx collision object bridge contact callback filter get ( swig c ptr , this ) ; } <SENTENCE_END/>


Original Name read

read

<SENTENCE_START> { if ( input == null ) { input = new ogg input stream ( file . %SELF% ( ) , previous input ) ; setup ( input . get channels ( ) , input . get sample rate ( ) ) ; previous input = null ; } return input . %SELF% ( buffer ) ; } <SENTENCE_END/>

(Copy Probability: 2.8%)

<SENTENCE_START> { if ( input == null ) { input = new ogg input stream ( file . %SELF% ( ) , previous input ) ; setup ( input . get channels ( ) , input . get sample rate ( ) ) ; previous input = null ; } return input . %SELF% ( buffer ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( input == null ) { input = new ogg input stream ( file . %SELF% ( ) , previous input ) ; setup ( input . get channels ( ) , input . get sample rate ( ) ) ; previous input = null ; } return input . %SELF% ( buffer ) ; } <SENTENCE_END/>

(Copy Probability: 7.2%)

<SENTENCE_START> { if ( input == null ) { input = new ogg input stream ( file . %SELF% ( ) , previous input ) ; setup ( input . get channels ( ) , input . get sample rate ( ) ) ; previous input = null ; } return input . %SELF% ( buffer ) ; } <SENTENCE_END/>


Original Name reset

reset

<SENTENCE_START> { stream utils . close quietly ( input ) ; previous input = null ; input = null ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { stream utils . close quietly ( input ) ; previous input = null ; input = null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { stream utils . close quietly ( input ) ; previous input = null ; input = null ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { stream utils . close quietly ( input ) ; previous input = null ; input = null ; } <SENTENCE_END/>


Original Name get,c,ptr

get

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

(Copy Probability: 1.5%)

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

c

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

(Copy Probability: 99.7%)

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

ptr

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

(Copy Probability: 99.8%)

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

%END%

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

(Copy Probability: 3.7%)

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


Original Name size

size

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

(Copy Probability: 2.7%)

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

%END%

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

(Copy Probability: 81.1%)

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


Original Name at

at

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

(Copy Probability: 7.5%)

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

%END%

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

(Copy Probability: 89.0%)

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


Original Name clear

clear

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

(Copy Probability: 2.0%)

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

%END%

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

(Copy Probability: 86.6%)

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


Original Name pop,back

pop

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

(Copy Probability: 8.6%)

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

back

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

(Copy Probability: 95.6%)

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

%END%

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

(Copy Probability: 9.2%)

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


Original Name resize,no,initialize

resize

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

(Copy Probability: 3.0%)

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

no

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

(Copy Probability: 98.8%)

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

initialize

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

(Copy Probability: 98.9%)

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

%END%

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

(Copy Probability: 12.9%)

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


Original Name resize

resize

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

(Copy Probability: 6.9%)

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

%END%

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

(Copy Probability: 74.1%)

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


Original Name resize

resize

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

(Copy Probability: 7.0%)

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

%END%

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

(Copy Probability: 74.5%)

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


Original Name expand,non,initializing

expand

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

(Copy Probability: 12.6%)

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

non

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

(Copy Probability: 99.0%)

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

initializing

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

(Copy Probability: 98.8%)

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

%END%

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

(Copy Probability: 7.5%)

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


Original Name expand

expand

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

(Copy Probability: 10.9%)

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

%END%

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

(Copy Probability: 60.6%)

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


Original Name expand

expand

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

(Copy Probability: 13.1%)

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

%END%

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

(Copy Probability: 71.6%)

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


Original Name push,back

push

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

(Copy Probability: 11.7%)

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

back

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

(Copy Probability: 97.4%)

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

%END%

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

(Copy Probability: 45.2%)

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


Original Name capacity

capacity

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

(Copy Probability: 2.9%)

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

%END%

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

(Copy Probability: 62.4%)

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


Original Name reserve

reserve

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

(Copy Probability: 13.9%)

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

%END%

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

(Copy Probability: 31.8%)

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


Original Name get,c,ptr

get

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

(Copy Probability: 1.5%)

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

c

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

(Copy Probability: 99.7%)

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

ptr

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

(Copy Probability: 99.8%)

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

%END%

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

(Copy Probability: 3.7%)

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


Original Name swap

swap

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

(Copy Probability: 5.5%)

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

%END%

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

(Copy Probability: 62.7%)

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


Original Name find,binary,search

find

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

(Copy Probability: 9.8%)

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

binary

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

(Copy Probability: 99.8%)

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

search

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

(Copy Probability: 99.1%)

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

%END%

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

(Copy Probability: 13.8%)

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


Original Name find,linear,search

find

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

(Copy Probability: 8.6%)

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

linear

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

(Copy Probability: 99.8%)

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

search

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

(Copy Probability: 98.8%)

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

%END%

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

(Copy Probability: 50.0%)

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


Original Name remove

remove

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

(Copy Probability: 5.4%)

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

%END%

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

(Copy Probability: 56.4%)

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


Original Name initialize,from,buffer

initialize

<SENTENCE_START> { collision jni . bt collision object const array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { collision jni . bt collision object const array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

from

<SENTENCE_START> { collision jni . bt collision object const array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

(Copy Probability: 99.3%)

<SENTENCE_START> { collision jni . bt collision object const array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

buffer

<SENTENCE_START> { collision jni . bt collision object const array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

(Copy Probability: 99.0%)

<SENTENCE_START> { collision jni . bt collision object const array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object const array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>

(Copy Probability: 43.4%)

<SENTENCE_START> { collision jni . bt collision object const array initialize from buffer ( swig c ptr , this , buffer , size , capacity ) ; } <SENTENCE_END/>


Original Name copy,from,array

copy

<SENTENCE_START> { collision jni . bt collision object const array copy from array ( swig c ptr , this , bt collision object const array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { collision jni . bt collision object const array copy from array ( swig c ptr , this , bt collision object const array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

from

<SENTENCE_START> { collision jni . bt collision object const array copy from array ( swig c ptr , this , bt collision object const array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

(Copy Probability: 97.5%)

<SENTENCE_START> { collision jni . bt collision object const array copy from array ( swig c ptr , this , bt collision object const array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

array

<SENTENCE_START> { collision jni . bt collision object const array copy from array ( swig c ptr , this , bt collision object const array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

(Copy Probability: 98.2%)

<SENTENCE_START> { collision jni . bt collision object const array copy from array ( swig c ptr , this , bt collision object const array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { collision jni . bt collision object const array copy from array ( swig c ptr , this , bt collision object const array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>

(Copy Probability: 31.4%)

<SENTENCE_START> { collision jni . bt collision object const array copy from array ( swig c ptr , this , bt collision object const array . get c ptr ( other array ) , other array ) ; } <SENTENCE_END/>


Original Name clamp

clamp

<SENTENCE_START> { return v < 0f ? 0f : ( v > 1f ? 1f : v ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return v < 0f ? 0f : ( v > 1f ? 1f : v ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return v < 0f ? 0f : ( v > 1f ? 1f : v ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return v < 0f ? 0f : ( v > 1f ? 1f : v ) ; } <SENTENCE_END/>


Original Name set

set

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = values [ i ] ; return this ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = values [ i ] ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = values [ i ] ; return this ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = values [ i ] ; return this ; } <SENTENCE_END/>


Original Name set

set

<SENTENCE_START> { return %SELF% ( other . data ) ; } <SENTENCE_END/>

(Copy Probability: 0.3%)

<SENTENCE_START> { return %SELF% ( other . data ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( other . data ) ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { return %SELF% ( other . data ) ; } <SENTENCE_END/>


Original Name set

set

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b ) ; } <SENTENCE_END/>


Original Name set

set

<SENTENCE_START> { for ( int idx = 0 ; idx < data . length ; ) { data [ idx ++ ] = r ; data [ idx ++ ] = g ; data [ idx ++ ] = b ; } return this ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { for ( int idx = 0 ; idx < data . length ; ) { data [ idx ++ ] = r ; data [ idx ++ ] = g ; data [ idx ++ ] = b ; } return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int idx = 0 ; idx < data . length ; ) { data [ idx ++ ] = r ; data [ idx ++ ] = g ; data [ idx ++ ] = b ; } return this ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { for ( int idx = 0 ; idx < data . length ; ) { data [ idx ++ ] = r ; data [ idx ++ ] = g ; data [ idx ++ ] = b ; } return this ; } <SENTENCE_END/>


Original Name get,color

get

<SENTENCE_START> { side *= 3 ; return out . set ( data [ side ] , data [ side + 1 ] , data [ side + 2 ] , 1f ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { side *= 3 ; return out . set ( data [ side ] , data [ side + 1 ] , data [ side + 2 ] , 1f ) ; } <SENTENCE_END/>

color

<SENTENCE_START> { side *= 3 ; return out . set ( data [ side ] , data [ side + 1 ] , data [ side + 2 ] , 1f ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { side *= 3 ; return out . set ( data [ side ] , data [ side + 1 ] , data [ side + 2 ] , 1f ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { side *= 3 ; return out . set ( data [ side ] , data [ side + 1 ] , data [ side + 2 ] , 1f ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { side *= 3 ; return out . set ( data [ side ] , data [ side + 1 ] , data [ side + 2 ] , 1f ) ; } <SENTENCE_END/>


Original Name clear

clear

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = 0f ; return this ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = 0f ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = 0f ; return this ; } <SENTENCE_END/>

(Copy Probability: 3.2%)

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = 0f ; return this ; } <SENTENCE_END/>


Original Name clamp

clamp

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = %SELF% ( data [ i ] ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = %SELF% ( data [ i ] ) ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = %SELF% ( data [ i ] ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { for ( int i = 0 ; i < data . length ; i ++ ) data [ i ] = %SELF% ( data [ i ] ) ; return this ; } <SENTENCE_END/>


Original Name add

add

<SENTENCE_START> { for ( int idx = 0 ; idx < data . length ; ) { data [ idx ++ ] += r ; data [ idx ++ ] += g ; data [ idx ++ ] += b ; } return this ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { for ( int idx = 0 ; idx < data . length ; ) { data [ idx ++ ] += r ; data [ idx ++ ] += g ; data [ idx ++ ] += b ; } return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( int idx = 0 ; idx < data . length ; ) { data [ idx ++ ] += r ; data [ idx ++ ] += g ; data [ idx ++ ] += b ; } return this ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { for ( int idx = 0 ; idx < data . length ; ) { data [ idx ++ ] += r ; data [ idx ++ ] += g ; data [ idx ++ ] += b ; } return this ; } <SENTENCE_END/>


Original Name add

add

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b ) ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b ) ; } <SENTENCE_END/>


Original Name add

add

<SENTENCE_START> { final float x 2 = x * x , y 2 = y * y , z 2 = z * z ; float d = x 2 + y 2 + z 2 ; if ( d == 0f ) return this ; d = 1f / d * ( d + 1f ) ; final float rd = r * d , gd = g * d , bd = b * d ; int idx = x > 0 ? 0 : 3 ; data [ idx ] += x 2 * rd ; data [ idx + 1 ] += x 2 * gd ; data [ idx + 2 ] += x 2 * bd ; idx = y > 0 ? 6 : 9 ; data [ idx ] += y 2 * rd ; data [ idx + 1 ] += y 2 * gd ; data [ idx + 2 ] += y 2 * bd ; idx = z > 0 ? 12 : 15 ; data [ idx ] += z 2 * rd ; data [ idx + 1 ] += z 2 * gd ; data [ idx + 2 ] += z 2 * bd ; return this ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { final float x 2 = x * x , y 2 = y * y , z 2 = z * z ; float d = x 2 + y 2 + z 2 ; if ( d == 0f ) return this ; d = 1f / d * ( d + 1f ) ; final float rd = r * d , gd = g * d , bd = b * d ; int idx = x > 0 ? 0 : 3 ; data [ idx ] += x 2 * rd ; data [ idx + 1 ] += x 2 * gd ; data [ idx + 2 ] += x 2 * bd ; idx = y > 0 ? 6 : 9 ; data [ idx ] += y 2 * rd ; data [ idx + 1 ] += y 2 * gd ; data [ idx + 2 ] += y 2 * bd ; idx = z > 0 ? 12 : 15 ; data [ idx ] += z 2 * rd ; data [ idx + 1 ] += z 2 * gd ; data [ idx + 2 ] += z 2 * bd ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final float x 2 = x * x , y 2 = y * y , z 2 = z * z ; float d = x 2 + y 2 + z 2 ; if ( d == 0f ) return this ; d = 1f / d * ( d + 1f ) ; final float rd = r * d , gd = g * d , bd = b * d ; int idx = x > 0 ? 0 : 3 ; data [ idx ] += x 2 * rd ; data [ idx + 1 ] += x 2 * gd ; data [ idx + 2 ] += x 2 * bd ; idx = y > 0 ? 6 : 9 ; data [ idx ] += y 2 * rd ; data [ idx + 1 ] += y 2 * gd ; data [ idx + 2 ] += y 2 * bd ; idx = z > 0 ? 12 : 15 ; data [ idx ] += z 2 * rd ; data [ idx + 1 ] += z 2 * gd ; data [ idx + 2 ] += z 2 * bd ; return this ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { final float x 2 = x * x , y 2 = y * y , z 2 = z * z ; float d = x 2 + y 2 + z 2 ; if ( d == 0f ) return this ; d = 1f / d * ( d + 1f ) ; final float rd = r * d , gd = g * d , bd = b * d ; int idx = x > 0 ? 0 : 3 ; data [ idx ] += x 2 * rd ; data [ idx + 1 ] += x 2 * gd ; data [ idx + 2 ] += x 2 * bd ; idx = y > 0 ? 6 : 9 ; data [ idx ] += y 2 * rd ; data [ idx + 1 ] += y 2 * gd ; data [ idx + 2 ] += y 2 * bd ; idx = z > 0 ? 12 : 15 ; data [ idx ] += z 2 * rd ; data [ idx + 1 ] += z 2 * gd ; data [ idx + 2 ] += z 2 * bd ; return this ; } <SENTENCE_END/>


Original Name add

add

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , direction . x , direction . y , direction . z ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , direction . x , direction . y , direction . z ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , direction . x , direction . y , direction . z ) ; } <SENTENCE_END/>

(Copy Probability: 2.1%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , direction . x , direction . y , direction . z ) ; } <SENTENCE_END/>


Original Name add

add

<SENTENCE_START> { return %SELF% ( r , g , b , direction . x , direction . y , direction . z ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { return %SELF% ( r , g , b , direction . x , direction . y , direction . z ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( r , g , b , direction . x , direction . y , direction . z ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return %SELF% ( r , g , b , direction . x , direction . y , direction . z ) ; } <SENTENCE_END/>


Original Name add

add

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , x , y , z ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , x , y , z ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , x , y , z ) ; } <SENTENCE_END/>

(Copy Probability: 1.8%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , x , y , z ) ; } <SENTENCE_END/>


Original Name add

add

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , target . x - point . x , target . y - point . y , target . z - point . z ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , target . x - point . x , target . y - point . y , target . z - point . z ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , target . x - point . x , target . y - point . y , target . z - point . z ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return %SELF% ( color . r , color . g , color . b , target . x - point . x , target . y - point . y , target . z - point . z ) ; } <SENTENCE_END/>


Original Name add

add

<SENTENCE_START> { final float t = intensity / ( 1f + target . dst ( point ) ) ; return %SELF% ( color . r * t , color . g * t , color . b * t , target . x - point . x , target . y - point . y , target . z - point . z ) ; } <SENTENCE_END/>

(Copy Probability: 2.6%)

<SENTENCE_START> { final float t = intensity / ( 1f + target . dst ( point ) ) ; return %SELF% ( color . r * t , color . g * t , color . b * t , target . x - point . x , target . y - point . y , target . z - point . z ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final float t = intensity / ( 1f + target . dst ( point ) ) ; return %SELF% ( color . r * t , color . g * t , color . b * t , target . x - point . x , target . y - point . y , target . z - point . z ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { final float t = intensity / ( 1f + target . dst ( point ) ) ; return %SELF% ( color . r * t , color . g * t , color . b * t , target . x - point . x , target . y - point . y , target . z - point . z ) ; } <SENTENCE_END/>


Original Name get,file,handle,resolver

get

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

(Copy Probability: 0.3%)

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

file

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

(Copy Probability: 47.5%)

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

handle

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

(Copy Probability: 0.6%)

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

resolver

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

(Copy Probability: 0.1%)

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

%END%

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

(Copy Probability: 0.3%)

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


Original Name get

get

<SENTENCE_START> { class < t > type = asset types . %SELF% ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; object map < string , ref counted container > assets by type = assets . %SELF% ( type ) ; if ( assets by type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset container = assets by type . %SELF% ( file name ) ; if ( asset container == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; t asset = asset container . get object ( type ) ; if ( asset == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return asset ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { class < t > type = asset types . %SELF% ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; object map < string , ref counted container > assets by type = assets . %SELF% ( type ) ; if ( assets by type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset container = assets by type . %SELF% ( file name ) ; if ( asset container == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; t asset = asset container . get object ( type ) ; if ( asset == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return asset ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { class < t > type = asset types . %SELF% ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; object map < string , ref counted container > assets by type = assets . %SELF% ( type ) ; if ( assets by type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset container = assets by type . %SELF% ( file name ) ; if ( asset container == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; t asset = asset container . get object ( type ) ; if ( asset == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return asset ; } <SENTENCE_END/>

(Copy Probability: 89.4%)

<SENTENCE_START> { class < t > type = asset types . %SELF% ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; object map < string , ref counted container > assets by type = assets . %SELF% ( type ) ; if ( assets by type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset container = assets by type . %SELF% ( file name ) ; if ( asset container == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; t asset = asset container . get object ( type ) ; if ( asset == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return asset ; } <SENTENCE_END/>


Original Name get

get

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . %SELF% ( type ) ; if ( assets by type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset container = assets by type . %SELF% ( file name ) ; if ( asset container == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; t asset = asset container . get object ( type ) ; if ( asset == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return asset ; } <SENTENCE_END/>

(Copy Probability: 4.4%)

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . %SELF% ( type ) ; if ( assets by type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset container = assets by type . %SELF% ( file name ) ; if ( asset container == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; t asset = asset container . get object ( type ) ; if ( asset == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return asset ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . %SELF% ( type ) ; if ( assets by type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset container = assets by type . %SELF% ( file name ) ; if ( asset container == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; t asset = asset container . get object ( type ) ; if ( asset == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return asset ; } <SENTENCE_END/>

(Copy Probability: 91.4%)

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . %SELF% ( type ) ; if ( assets by type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset container = assets by type . %SELF% ( file name ) ; if ( asset container == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; t asset = asset container . get object ( type ) ; if ( asset == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return asset ; } <SENTENCE_END/>


Original Name get,all

get

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type != null ) { for ( object map . entry < string , ref counted container > asset : assets by type . entries ( ) ) { out . add ( asset . value . get object ( type ) ) ; } } return out ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type != null ) { for ( object map . entry < string , ref counted container > asset : assets by type . entries ( ) ) { out . add ( asset . value . get object ( type ) ) ; } } return out ; } <SENTENCE_END/>

all

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type != null ) { for ( object map . entry < string , ref counted container > asset : assets by type . entries ( ) ) { out . add ( asset . value . get object ( type ) ) ; } } return out ; } <SENTENCE_END/>

(Copy Probability: 80.8%)

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type != null ) { for ( object map . entry < string , ref counted container > asset : assets by type . entries ( ) ) { out . add ( asset . value . get object ( type ) ) ; } } return out ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type != null ) { for ( object map . entry < string , ref counted container > asset : assets by type . entries ( ) ) { out . add ( asset . value . get object ( type ) ) ; } } return out ; } <SENTENCE_END/>

(Copy Probability: 54.1%)

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type != null ) { for ( object map . entry < string , ref counted container > asset : assets by type . entries ( ) ) { out . add ( asset . value . get object ( type ) ) ; } } return out ; } <SENTENCE_END/>


Original Name get

get

<SENTENCE_START> { return %SELF% ( asset descriptor . file name , asset descriptor . type ) ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { return %SELF% ( asset descriptor . file name , asset descriptor . type ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( asset descriptor . file name , asset descriptor . type ) ; } <SENTENCE_END/>

(Copy Probability: 59.8%)

<SENTENCE_START> { return %SELF% ( asset descriptor . file name , asset descriptor . type ) ; } <SENTENCE_END/>


Original Name unload

unload

<SENTENCE_START> { if ( tasks . size ( ) > 0 ) { asset loading task curr asset = tasks . first element ( ) ; if ( curr asset . asset desc . file name . equals ( file name ) ) { curr asset . cancel = true ; log . debug ( "Unload (from tasks): " + file name ) ; return ; } } int found index = - 1 ; for ( int i = 0 ; i < load queue . size ; i ++ ) { if ( load queue . get ( i ) . file name . equals ( file name ) ) { found index = i ; break ; } } if ( found index != - 1 ) { to load -- ; load queue . remove index ( found index ) ; log . debug ( "Unload (from queue): " + file name ) ; return ; } class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; asset ref . dec ref count ( ) ; if ( asset ref . get ref count ( ) <= 0 ) { log . debug ( "Unload (dispose): " + file name ) ; if ( asset ref . get object ( object . class ) instanceof disposable ) ( ( disposable ) asset ref . get object ( object . class ) ) . dispose ( ) ; asset types . remove ( file name ) ; assets . get ( type ) . remove ( file name ) ; } else { log . debug ( "Unload (decrement): " + file name ) ; } array < string > dependencies = asset dependencies . get ( file name ) ; if ( dependencies != null ) { for ( string dependency : dependencies ) { if ( is loaded ( dependency ) ) %SELF% ( dependency ) ; } } if ( asset ref . get ref count ( ) <= 0 ) { asset dependencies . remove ( file name ) ; } } <SENTENCE_END/>

(Copy Probability: 4.6%)

<SENTENCE_START> { if ( tasks . size ( ) > 0 ) { asset loading task curr asset = tasks . first element ( ) ; if ( curr asset . asset desc . file name . equals ( file name ) ) { curr asset . cancel = true ; log . debug ( "Unload (from tasks): " + file name ) ; return ; } } int found index = - 1 ; for ( int i = 0 ; i < load queue . size ; i ++ ) { if ( load queue . get ( i ) . file name . equals ( file name ) ) { found index = i ; break ; } } if ( found index != - 1 ) { to load -- ; load queue . remove index ( found index ) ; log . debug ( "Unload (from queue): " + file name ) ; return ; } class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; asset ref . dec ref count ( ) ; if ( asset ref . get ref count ( ) <= 0 ) { log . debug ( "Unload (dispose): " + file name ) ; if ( asset ref . get object ( object . class ) instanceof disposable ) ( ( disposable ) asset ref . get object ( object . class ) ) . dispose ( ) ; asset types . remove ( file name ) ; assets . get ( type ) . remove ( file name ) ; } else { log . debug ( "Unload (decrement): " + file name ) ; } array < string > dependencies = asset dependencies . get ( file name ) ; if ( dependencies != null ) { for ( string dependency : dependencies ) { if ( is loaded ( dependency ) ) %SELF% ( dependency ) ; } } if ( asset ref . get ref count ( ) <= 0 ) { asset dependencies . remove ( file name ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( tasks . size ( ) > 0 ) { asset loading task curr asset = tasks . first element ( ) ; if ( curr asset . asset desc . file name . equals ( file name ) ) { curr asset . cancel = true ; log . debug ( "Unload (from tasks): " + file name ) ; return ; } } int found index = - 1 ; for ( int i = 0 ; i < load queue . size ; i ++ ) { if ( load queue . get ( i ) . file name . equals ( file name ) ) { found index = i ; break ; } } if ( found index != - 1 ) { to load -- ; load queue . remove index ( found index ) ; log . debug ( "Unload (from queue): " + file name ) ; return ; } class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; asset ref . dec ref count ( ) ; if ( asset ref . get ref count ( ) <= 0 ) { log . debug ( "Unload (dispose): " + file name ) ; if ( asset ref . get object ( object . class ) instanceof disposable ) ( ( disposable ) asset ref . get object ( object . class ) ) . dispose ( ) ; asset types . remove ( file name ) ; assets . get ( type ) . remove ( file name ) ; } else { log . debug ( "Unload (decrement): " + file name ) ; } array < string > dependencies = asset dependencies . get ( file name ) ; if ( dependencies != null ) { for ( string dependency : dependencies ) { if ( is loaded ( dependency ) ) %SELF% ( dependency ) ; } } if ( asset ref . get ref count ( ) <= 0 ) { asset dependencies . remove ( file name ) ; } } <SENTENCE_END/>

(Copy Probability: 37.9%)

<SENTENCE_START> { if ( tasks . size ( ) > 0 ) { asset loading task curr asset = tasks . first element ( ) ; if ( curr asset . asset desc . file name . equals ( file name ) ) { curr asset . cancel = true ; log . debug ( "Unload (from tasks): " + file name ) ; return ; } } int found index = - 1 ; for ( int i = 0 ; i < load queue . size ; i ++ ) { if ( load queue . get ( i ) . file name . equals ( file name ) ) { found index = i ; break ; } } if ( found index != - 1 ) { to load -- ; load queue . remove index ( found index ) ; log . debug ( "Unload (from queue): " + file name ) ; return ; } class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; asset ref . dec ref count ( ) ; if ( asset ref . get ref count ( ) <= 0 ) { log . debug ( "Unload (dispose): " + file name ) ; if ( asset ref . get object ( object . class ) instanceof disposable ) ( ( disposable ) asset ref . get object ( object . class ) ) . dispose ( ) ; asset types . remove ( file name ) ; assets . get ( type ) . remove ( file name ) ; } else { log . debug ( "Unload (decrement): " + file name ) ; } array < string > dependencies = asset dependencies . get ( file name ) ; if ( dependencies != null ) { for ( string dependency : dependencies ) { if ( is loaded ( dependency ) ) %SELF% ( dependency ) ; } } if ( asset ref . get ref count ( ) <= 0 ) { asset dependencies . remove ( file name ) ; } } <SENTENCE_END/>


Original Name contains,asset

contains

<SENTENCE_START> { object map < string , ref counted container > typed assets = assets . get ( asset . get class ( ) ) ; if ( typed assets == null ) return false ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 3.1%)

<SENTENCE_START> { object map < string , ref counted container > typed assets = assets . get ( asset . get class ( ) ) ; if ( typed assets == null ) return false ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return true ; } return false ; } <SENTENCE_END/>

asset

<SENTENCE_START> { object map < string , ref counted container > typed assets = assets . get ( asset . get class ( ) ) ; if ( typed assets == null ) return false ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 33.5%)

<SENTENCE_START> { object map < string , ref counted container > typed assets = assets . get ( asset . get class ( ) ) ; if ( typed assets == null ) return false ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return true ; } return false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { object map < string , ref counted container > typed assets = assets . get ( asset . get class ( ) ) ; if ( typed assets == null ) return false ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 6.9%)

<SENTENCE_START> { object map < string , ref counted container > typed assets = assets . get ( asset . get class ( ) ) ; if ( typed assets == null ) return false ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return true ; } return false ; } <SENTENCE_END/>


Original Name get,asset,file,name

get

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

(Copy Probability: 3.4%)

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

asset

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

(Copy Probability: 36.0%)

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

file

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

(Copy Probability: 13.9%)

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

name

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { for ( class asset type : assets . keys ( ) ) { object map < string , ref counted container > typed assets = assets . get ( asset type ) ; for ( string file name : typed assets . keys ( ) ) { t other asset = ( t ) typed assets . get ( file name ) . get object ( object . class ) ; if ( other asset == asset || asset . equals ( other asset ) ) return file name ; } } return null ; } <SENTENCE_END/>


Original Name is,loaded

is

<SENTENCE_START> { if ( file name == null ) return false ; return asset types . contains key ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { if ( file name == null ) return false ; return asset types . contains key ( file name ) ; } <SENTENCE_END/>

loaded

<SENTENCE_START> { if ( file name == null ) return false ; return asset types . contains key ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 83.3%)

<SENTENCE_START> { if ( file name == null ) return false ; return asset types . contains key ( file name ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( file name == null ) return false ; return asset types . contains key ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 30.6%)

<SENTENCE_START> { if ( file name == null ) return false ; return asset types . contains key ( file name ) ; } <SENTENCE_END/>


Original Name is,loaded

is

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type == null ) return false ; ref counted container asset container = assets by type . get ( file name ) ; if ( asset container == null ) return false ; return asset container . get object ( type ) != null ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type == null ) return false ; ref counted container asset container = assets by type . get ( file name ) ; if ( asset container == null ) return false ; return asset container . get object ( type ) != null ; } <SENTENCE_END/>

loaded

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type == null ) return false ; ref counted container asset container = assets by type . get ( file name ) ; if ( asset container == null ) return false ; return asset container . get object ( type ) != null ; } <SENTENCE_END/>

(Copy Probability: 88.1%)

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type == null ) return false ; ref counted container asset container = assets by type . get ( file name ) ; if ( asset container == null ) return false ; return asset container . get object ( type ) != null ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type == null ) return false ; ref counted container asset container = assets by type . get ( file name ) ; if ( asset container == null ) return false ; return asset container . get object ( type ) != null ; } <SENTENCE_END/>

(Copy Probability: 63.3%)

<SENTENCE_START> { object map < string , ref counted container > assets by type = assets . get ( type ) ; if ( assets by type == null ) return false ; ref counted container asset container = assets by type . get ( file name ) ; if ( asset container == null ) return false ; return asset container . get object ( type ) != null ; } <SENTENCE_END/>


Original Name get,loader

get

<SENTENCE_START> { return %SELF% ( type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return %SELF% ( type , null ) ; } <SENTENCE_END/>

loader

<SENTENCE_START> { return %SELF% ( type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return %SELF% ( type , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return %SELF% ( type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { return %SELF% ( type , null ) ; } <SENTENCE_END/>


Original Name get,loader

get

<SENTENCE_START> { final object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null || loaders . size < 1 ) return null ; if ( file name == null ) return loaders . get ( "" ) ; asset loader result = null ; int l = - 1 ; for ( object map . entry < string , asset loader > entry : loaders . entries ( ) ) { if ( entry . key . length ( ) > l && file name . ends with ( entry . key ) ) { result = entry . value ; l = entry . key . length ( ) ; } } return result ; } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { final object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null || loaders . size < 1 ) return null ; if ( file name == null ) return loaders . get ( "" ) ; asset loader result = null ; int l = - 1 ; for ( object map . entry < string , asset loader > entry : loaders . entries ( ) ) { if ( entry . key . length ( ) > l && file name . ends with ( entry . key ) ) { result = entry . value ; l = entry . key . length ( ) ; } } return result ; } <SENTENCE_END/>

loader

<SENTENCE_START> { final object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null || loaders . size < 1 ) return null ; if ( file name == null ) return loaders . get ( "" ) ; asset loader result = null ; int l = - 1 ; for ( object map . entry < string , asset loader > entry : loaders . entries ( ) ) { if ( entry . key . length ( ) > l && file name . ends with ( entry . key ) ) { result = entry . value ; l = entry . key . length ( ) ; } } return result ; } <SENTENCE_END/>

(Copy Probability: 22.7%)

<SENTENCE_START> { final object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null || loaders . size < 1 ) return null ; if ( file name == null ) return loaders . get ( "" ) ; asset loader result = null ; int l = - 1 ; for ( object map . entry < string , asset loader > entry : loaders . entries ( ) ) { if ( entry . key . length ( ) > l && file name . ends with ( entry . key ) ) { result = entry . value ; l = entry . key . length ( ) ; } } return result ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null || loaders . size < 1 ) return null ; if ( file name == null ) return loaders . get ( "" ) ; asset loader result = null ; int l = - 1 ; for ( object map . entry < string , asset loader > entry : loaders . entries ( ) ) { if ( entry . key . length ( ) > l && file name . ends with ( entry . key ) ) { result = entry . value ; l = entry . key . length ( ) ; } } return result ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { final object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null || loaders . size < 1 ) return null ; if ( file name == null ) return loaders . get ( "" ) ; asset loader result = null ; int l = - 1 ; for ( object map . entry < string , asset loader > entry : loaders . entries ( ) ) { if ( entry . key . length ( ) > l && file name . ends with ( entry . key ) ) { result = entry . value ; l = entry . key . length ( ) ; } } return result ; } <SENTENCE_END/>


Original Name load

load

<SENTENCE_START> { %SELF% ( file name , type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { %SELF% ( file name , type , null ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( file name , type , null ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { %SELF% ( file name , type , null ) ; } <SENTENCE_END/>


Original Name load

load

<SENTENCE_START> { asset loader loader = get loader ( type , file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( type ) ) ; if ( load queue . size == 0 ) { loaded = 0 ; to load = 0 ; } for ( int i = 0 ; i < load queue . size ; i ++ ) { asset descriptor desc = load queue . get ( i ) ; if ( desc . file name . equals ( file name ) && ! desc . type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already in preload queue, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( desc . type ) + ")" ) ; } for ( int i = 0 ; i < tasks . size ( ) ; i ++ ) { asset descriptor desc = tasks . get ( i ) . asset desc ; if ( desc . file name . equals ( file name ) && ! desc . type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already in task list, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( desc . type ) + ")" ) ; } class other type = asset types . get ( file name ) ; if ( other type != null && ! other type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already loaded, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( other type ) + ")" ) ; to load ++ ; asset descriptor asset desc = new asset descriptor ( file name , type , parameter ) ; load queue . add ( asset desc ) ; log . debug ( "Queued: " + asset desc ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { asset loader loader = get loader ( type , file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( type ) ) ; if ( load queue . size == 0 ) { loaded = 0 ; to load = 0 ; } for ( int i = 0 ; i < load queue . size ; i ++ ) { asset descriptor desc = load queue . get ( i ) ; if ( desc . file name . equals ( file name ) && ! desc . type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already in preload queue, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( desc . type ) + ")" ) ; } for ( int i = 0 ; i < tasks . size ( ) ; i ++ ) { asset descriptor desc = tasks . get ( i ) . asset desc ; if ( desc . file name . equals ( file name ) && ! desc . type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already in task list, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( desc . type ) + ")" ) ; } class other type = asset types . get ( file name ) ; if ( other type != null && ! other type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already loaded, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( other type ) + ")" ) ; to load ++ ; asset descriptor asset desc = new asset descriptor ( file name , type , parameter ) ; load queue . add ( asset desc ) ; log . debug ( "Queued: " + asset desc ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { asset loader loader = get loader ( type , file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( type ) ) ; if ( load queue . size == 0 ) { loaded = 0 ; to load = 0 ; } for ( int i = 0 ; i < load queue . size ; i ++ ) { asset descriptor desc = load queue . get ( i ) ; if ( desc . file name . equals ( file name ) && ! desc . type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already in preload queue, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( desc . type ) + ")" ) ; } for ( int i = 0 ; i < tasks . size ( ) ; i ++ ) { asset descriptor desc = tasks . get ( i ) . asset desc ; if ( desc . file name . equals ( file name ) && ! desc . type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already in task list, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( desc . type ) + ")" ) ; } class other type = asset types . get ( file name ) ; if ( other type != null && ! other type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already loaded, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( other type ) + ")" ) ; to load ++ ; asset descriptor asset desc = new asset descriptor ( file name , type , parameter ) ; load queue . add ( asset desc ) ; log . debug ( "Queued: " + asset desc ) ; } <SENTENCE_END/>

(Copy Probability: 48.6%)

<SENTENCE_START> { asset loader loader = get loader ( type , file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( type ) ) ; if ( load queue . size == 0 ) { loaded = 0 ; to load = 0 ; } for ( int i = 0 ; i < load queue . size ; i ++ ) { asset descriptor desc = load queue . get ( i ) ; if ( desc . file name . equals ( file name ) && ! desc . type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already in preload queue, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( desc . type ) + ")" ) ; } for ( int i = 0 ; i < tasks . size ( ) ; i ++ ) { asset descriptor desc = tasks . get ( i ) . asset desc ; if ( desc . file name . equals ( file name ) && ! desc . type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already in task list, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( desc . type ) + ")" ) ; } class other type = asset types . get ( file name ) ; if ( other type != null && ! other type . equals ( type ) ) throw new gdx runtime exception ( "Asset with name '" + file name + "' already loaded, but has different type (expected: " + class reflection . get simple name ( type ) + ", found: " + class reflection . get simple name ( other type ) + ")" ) ; to load ++ ; asset descriptor asset desc = new asset descriptor ( file name , type , parameter ) ; load queue . add ( asset desc ) ; log . debug ( "Queued: " + asset desc ) ; } <SENTENCE_END/>


Original Name load

load

<SENTENCE_START> { %SELF% ( desc . file name , desc . type , desc . params ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { %SELF% ( desc . file name , desc . type , desc . params ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( desc . file name , desc . type , desc . params ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { %SELF% ( desc . file name , desc . type , desc . params ) ; } <SENTENCE_END/>


Original Name update

update

<SENTENCE_START> { try { if ( tasks . size ( ) == 0 ) { while ( load queue . size != 0 && tasks . size ( ) == 0 ) { next task ( ) ; } if ( tasks . size ( ) == 0 ) return true ; } return update task ( ) && load queue . size == 0 && tasks . size ( ) == 0 ; } catch ( throwable t ) { handle task error ( t ) ; return load queue . size == 0 ; } } <SENTENCE_END/>

(Copy Probability: 3.0%)

<SENTENCE_START> { try { if ( tasks . size ( ) == 0 ) { while ( load queue . size != 0 && tasks . size ( ) == 0 ) { next task ( ) ; } if ( tasks . size ( ) == 0 ) return true ; } return update task ( ) && load queue . size == 0 && tasks . size ( ) == 0 ; } catch ( throwable t ) { handle task error ( t ) ; return load queue . size == 0 ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { try { if ( tasks . size ( ) == 0 ) { while ( load queue . size != 0 && tasks . size ( ) == 0 ) { next task ( ) ; } if ( tasks . size ( ) == 0 ) return true ; } return update task ( ) && load queue . size == 0 && tasks . size ( ) == 0 ; } catch ( throwable t ) { handle task error ( t ) ; return load queue . size == 0 ; } } <SENTENCE_END/>

(Copy Probability: 11.9%)

<SENTENCE_START> { try { if ( tasks . size ( ) == 0 ) { while ( load queue . size != 0 && tasks . size ( ) == 0 ) { next task ( ) ; } if ( tasks . size ( ) == 0 ) return true ; } return update task ( ) && load queue . size == 0 && tasks . size ( ) == 0 ; } catch ( throwable t ) { handle task error ( t ) ; return load queue . size == 0 ; } } <SENTENCE_END/>


Original Name update

update

<SENTENCE_START> { long end time = time utils . millis ( ) + millis ; while ( true ) { boolean done = %SELF% ( ) ; if ( done || time utils . millis ( ) > end time ) return done ; thread utils . yield ( ) ; } } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { long end time = time utils . millis ( ) + millis ; while ( true ) { boolean done = %SELF% ( ) ; if ( done || time utils . millis ( ) > end time ) return done ; thread utils . yield ( ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { long end time = time utils . millis ( ) + millis ; while ( true ) { boolean done = %SELF% ( ) ; if ( done || time utils . millis ( ) > end time ) return done ; thread utils . yield ( ) ; } } <SENTENCE_END/>

(Copy Probability: 8.6%)

<SENTENCE_START> { long end time = time utils . millis ( ) + millis ; while ( true ) { boolean done = %SELF% ( ) ; if ( done || time utils . millis ( ) > end time ) return done ; thread utils . yield ( ) ; } } <SENTENCE_END/>


Original Name finish,loading

finish

<SENTENCE_START> { log . debug ( "Waiting for loading to complete..." ) ; while ( ! update ( ) ) thread utils . yield ( ) ; log . debug ( "Loading complete." ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { log . debug ( "Waiting for loading to complete..." ) ; while ( ! update ( ) ) thread utils . yield ( ) ; log . debug ( "Loading complete." ) ; } <SENTENCE_END/>

loading

<SENTENCE_START> { log . debug ( "Waiting for loading to complete..." ) ; while ( ! update ( ) ) thread utils . yield ( ) ; log . debug ( "Loading complete." ) ; } <SENTENCE_END/>

(Copy Probability: 2.9%)

<SENTENCE_START> { log . debug ( "Waiting for loading to complete..." ) ; while ( ! update ( ) ) thread utils . yield ( ) ; log . debug ( "Loading complete." ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { log . debug ( "Waiting for loading to complete..." ) ; while ( ! update ( ) ) thread utils . yield ( ) ; log . debug ( "Loading complete." ) ; } <SENTENCE_END/>

(Copy Probability: 1.1%)

<SENTENCE_START> { log . debug ( "Waiting for loading to complete..." ) ; while ( ! update ( ) ) thread utils . yield ( ) ; log . debug ( "Loading complete." ) ; } <SENTENCE_END/>


Original Name finish,loading,asset

finish

<SENTENCE_START> { log . debug ( "Waiting for asset to be loaded: " + file name ) ; while ( ! is loaded ( file name ) ) { update ( ) ; thread utils . yield ( ) ; } log . debug ( "Asset loaded: " + file name ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { log . debug ( "Waiting for asset to be loaded: " + file name ) ; while ( ! is loaded ( file name ) ) { update ( ) ; thread utils . yield ( ) ; } log . debug ( "Asset loaded: " + file name ) ; } <SENTENCE_END/>

loading

<SENTENCE_START> { log . debug ( "Waiting for asset to be loaded: " + file name ) ; while ( ! is loaded ( file name ) ) { update ( ) ; thread utils . yield ( ) ; } log . debug ( "Asset loaded: " + file name ) ; } <SENTENCE_END/>

(Copy Probability: 7.8%)

<SENTENCE_START> { log . debug ( "Waiting for asset to be loaded: " + file name ) ; while ( ! is loaded ( file name ) ) { update ( ) ; thread utils . yield ( ) ; } log . debug ( "Asset loaded: " + file name ) ; } <SENTENCE_END/>

asset

<SENTENCE_START> { log . debug ( "Waiting for asset to be loaded: " + file name ) ; while ( ! is loaded ( file name ) ) { update ( ) ; thread utils . yield ( ) ; } log . debug ( "Asset loaded: " + file name ) ; } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { log . debug ( "Waiting for asset to be loaded: " + file name ) ; while ( ! is loaded ( file name ) ) { update ( ) ; thread utils . yield ( ) ; } log . debug ( "Asset loaded: " + file name ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { log . debug ( "Waiting for asset to be loaded: " + file name ) ; while ( ! is loaded ( file name ) ) { update ( ) ; thread utils . yield ( ) ; } log . debug ( "Asset loaded: " + file name ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { log . debug ( "Waiting for asset to be loaded: " + file name ) ; while ( ! is loaded ( file name ) ) { update ( ) ; thread utils . yield ( ) ; } log . debug ( "Asset loaded: " + file name ) ; } <SENTENCE_END/>


Original Name inject,dependencies

inject

<SENTENCE_START> { object set < string > injected = this . injected ; for ( asset descriptor desc : dependend asset descs ) { if ( injected . contains ( desc . file name ) ) continue ; injected . add ( desc . file name ) ; inject dependency ( parent asset filename , desc ) ; } injected . clear ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.7%)

<SENTENCE_START> { object set < string > injected = this . injected ; for ( asset descriptor desc : dependend asset descs ) { if ( injected . contains ( desc . file name ) ) continue ; injected . add ( desc . file name ) ; inject dependency ( parent asset filename , desc ) ; } injected . clear ( ) ; } <SENTENCE_END/>

dependencies

<SENTENCE_START> { object set < string > injected = this . injected ; for ( asset descriptor desc : dependend asset descs ) { if ( injected . contains ( desc . file name ) ) continue ; injected . add ( desc . file name ) ; inject dependency ( parent asset filename , desc ) ; } injected . clear ( ) ; } <SENTENCE_END/>

(Copy Probability: 13.5%)

<SENTENCE_START> { object set < string > injected = this . injected ; for ( asset descriptor desc : dependend asset descs ) { if ( injected . contains ( desc . file name ) ) continue ; injected . add ( desc . file name ) ; inject dependency ( parent asset filename , desc ) ; } injected . clear ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { object set < string > injected = this . injected ; for ( asset descriptor desc : dependend asset descs ) { if ( injected . contains ( desc . file name ) ) continue ; injected . add ( desc . file name ) ; inject dependency ( parent asset filename , desc ) ; } injected . clear ( ) ; } <SENTENCE_END/>

(Copy Probability: 5.7%)

<SENTENCE_START> { object set < string > injected = this . injected ; for ( asset descriptor desc : dependend asset descs ) { if ( injected . contains ( desc . file name ) ) continue ; injected . add ( desc . file name ) ; inject dependency ( parent asset filename , desc ) ; } injected . clear ( ) ; } <SENTENCE_END/>


Original Name inject,dependency

inject

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent asset filename ) ; if ( dependencies == null ) { dependencies = new array ( ) ; asset dependencies . put ( parent asset filename , dependencies ) ; } dependencies . add ( dependend asset desc . file name ) ; if ( is loaded ( dependend asset desc . file name ) ) { log . debug ( "Dependency already loaded: " + dependend asset desc ) ; class type = asset types . get ( dependend asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( dependend asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( dependend asset desc . file name ) ; } else { log . info ( "Loading dependency: " + dependend asset desc ) ; add task ( dependend asset desc ) ; } } <SENTENCE_END/>

(Copy Probability: 5.4%)

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent asset filename ) ; if ( dependencies == null ) { dependencies = new array ( ) ; asset dependencies . put ( parent asset filename , dependencies ) ; } dependencies . add ( dependend asset desc . file name ) ; if ( is loaded ( dependend asset desc . file name ) ) { log . debug ( "Dependency already loaded: " + dependend asset desc ) ; class type = asset types . get ( dependend asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( dependend asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( dependend asset desc . file name ) ; } else { log . info ( "Loading dependency: " + dependend asset desc ) ; add task ( dependend asset desc ) ; } } <SENTENCE_END/>

dependency

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent asset filename ) ; if ( dependencies == null ) { dependencies = new array ( ) ; asset dependencies . put ( parent asset filename , dependencies ) ; } dependencies . add ( dependend asset desc . file name ) ; if ( is loaded ( dependend asset desc . file name ) ) { log . debug ( "Dependency already loaded: " + dependend asset desc ) ; class type = asset types . get ( dependend asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( dependend asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( dependend asset desc . file name ) ; } else { log . info ( "Loading dependency: " + dependend asset desc ) ; add task ( dependend asset desc ) ; } } <SENTENCE_END/>

(Copy Probability: 76.6%)

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent asset filename ) ; if ( dependencies == null ) { dependencies = new array ( ) ; asset dependencies . put ( parent asset filename , dependencies ) ; } dependencies . add ( dependend asset desc . file name ) ; if ( is loaded ( dependend asset desc . file name ) ) { log . debug ( "Dependency already loaded: " + dependend asset desc ) ; class type = asset types . get ( dependend asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( dependend asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( dependend asset desc . file name ) ; } else { log . info ( "Loading dependency: " + dependend asset desc ) ; add task ( dependend asset desc ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent asset filename ) ; if ( dependencies == null ) { dependencies = new array ( ) ; asset dependencies . put ( parent asset filename , dependencies ) ; } dependencies . add ( dependend asset desc . file name ) ; if ( is loaded ( dependend asset desc . file name ) ) { log . debug ( "Dependency already loaded: " + dependend asset desc ) ; class type = asset types . get ( dependend asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( dependend asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( dependend asset desc . file name ) ; } else { log . info ( "Loading dependency: " + dependend asset desc ) ; add task ( dependend asset desc ) ; } } <SENTENCE_END/>

(Copy Probability: 67.9%)

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent asset filename ) ; if ( dependencies == null ) { dependencies = new array ( ) ; asset dependencies . put ( parent asset filename , dependencies ) ; } dependencies . add ( dependend asset desc . file name ) ; if ( is loaded ( dependend asset desc . file name ) ) { log . debug ( "Dependency already loaded: " + dependend asset desc ) ; class type = asset types . get ( dependend asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( dependend asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( dependend asset desc . file name ) ; } else { log . info ( "Loading dependency: " + dependend asset desc ) ; add task ( dependend asset desc ) ; } } <SENTENCE_END/>


Original Name next,task

next

<SENTENCE_START> { asset descriptor asset desc = load queue . remove index ( 0 ) ; if ( is loaded ( asset desc . file name ) ) { log . debug ( "Already loaded: " + asset desc ) ; class type = asset types . get ( asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( asset desc . file name ) ; if ( asset desc . params != null && asset desc . params . loaded callback != null ) { asset desc . params . loaded callback . finished loading ( this , asset desc . file name , asset desc . type ) ; } loaded ++ ; } else { log . info ( "Loading: " + asset desc ) ; add task ( asset desc ) ; } } <SENTENCE_END/>

(Copy Probability: 6.0%)

<SENTENCE_START> { asset descriptor asset desc = load queue . remove index ( 0 ) ; if ( is loaded ( asset desc . file name ) ) { log . debug ( "Already loaded: " + asset desc ) ; class type = asset types . get ( asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( asset desc . file name ) ; if ( asset desc . params != null && asset desc . params . loaded callback != null ) { asset desc . params . loaded callback . finished loading ( this , asset desc . file name , asset desc . type ) ; } loaded ++ ; } else { log . info ( "Loading: " + asset desc ) ; add task ( asset desc ) ; } } <SENTENCE_END/>

task

<SENTENCE_START> { asset descriptor asset desc = load queue . remove index ( 0 ) ; if ( is loaded ( asset desc . file name ) ) { log . debug ( "Already loaded: " + asset desc ) ; class type = asset types . get ( asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( asset desc . file name ) ; if ( asset desc . params != null && asset desc . params . loaded callback != null ) { asset desc . params . loaded callback . finished loading ( this , asset desc . file name , asset desc . type ) ; } loaded ++ ; } else { log . info ( "Loading: " + asset desc ) ; add task ( asset desc ) ; } } <SENTENCE_END/>

(Copy Probability: 79.5%)

<SENTENCE_START> { asset descriptor asset desc = load queue . remove index ( 0 ) ; if ( is loaded ( asset desc . file name ) ) { log . debug ( "Already loaded: " + asset desc ) ; class type = asset types . get ( asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( asset desc . file name ) ; if ( asset desc . params != null && asset desc . params . loaded callback != null ) { asset desc . params . loaded callback . finished loading ( this , asset desc . file name , asset desc . type ) ; } loaded ++ ; } else { log . info ( "Loading: " + asset desc ) ; add task ( asset desc ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { asset descriptor asset desc = load queue . remove index ( 0 ) ; if ( is loaded ( asset desc . file name ) ) { log . debug ( "Already loaded: " + asset desc ) ; class type = asset types . get ( asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( asset desc . file name ) ; if ( asset desc . params != null && asset desc . params . loaded callback != null ) { asset desc . params . loaded callback . finished loading ( this , asset desc . file name , asset desc . type ) ; } loaded ++ ; } else { log . info ( "Loading: " + asset desc ) ; add task ( asset desc ) ; } } <SENTENCE_END/>

(Copy Probability: 50.9%)

<SENTENCE_START> { asset descriptor asset desc = load queue . remove index ( 0 ) ; if ( is loaded ( asset desc . file name ) ) { log . debug ( "Already loaded: " + asset desc ) ; class type = asset types . get ( asset desc . file name ) ; ref counted container asset ref = assets . get ( type ) . get ( asset desc . file name ) ; asset ref . inc ref count ( ) ; increment ref counted dependencies ( asset desc . file name ) ; if ( asset desc . params != null && asset desc . params . loaded callback != null ) { asset desc . params . loaded callback . finished loading ( this , asset desc . file name , asset desc . type ) ; } loaded ++ ; } else { log . info ( "Loading: " + asset desc ) ; add task ( asset desc ) ; } } <SENTENCE_END/>


Original Name add,task

add

<SENTENCE_START> { asset loader loader = get loader ( asset desc . type , asset desc . file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( asset desc . type ) ) ; tasks . push ( new asset loading task ( this , asset desc , loader , executor ) ) ; } <SENTENCE_END/>

(Copy Probability: 6.2%)

<SENTENCE_START> { asset loader loader = get loader ( asset desc . type , asset desc . file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( asset desc . type ) ) ; tasks . push ( new asset loading task ( this , asset desc , loader , executor ) ) ; } <SENTENCE_END/>

task

<SENTENCE_START> { asset loader loader = get loader ( asset desc . type , asset desc . file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( asset desc . type ) ) ; tasks . push ( new asset loading task ( this , asset desc , loader , executor ) ) ; } <SENTENCE_END/>

(Copy Probability: 82.6%)

<SENTENCE_START> { asset loader loader = get loader ( asset desc . type , asset desc . file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( asset desc . type ) ) ; tasks . push ( new asset loading task ( this , asset desc , loader , executor ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { asset loader loader = get loader ( asset desc . type , asset desc . file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( asset desc . type ) ) ; tasks . push ( new asset loading task ( this , asset desc , loader , executor ) ) ; } <SENTENCE_END/>

(Copy Probability: 69.8%)

<SENTENCE_START> { asset loader loader = get loader ( asset desc . type , asset desc . file name ) ; if ( loader == null ) throw new gdx runtime exception ( "No loader for type: " + class reflection . get simple name ( asset desc . type ) ) ; tasks . push ( new asset loading task ( this , asset desc , loader , executor ) ) ; } <SENTENCE_END/>


Original Name add,asset

add

<SENTENCE_START> { asset types . put ( file name , type ) ; object map < string , ref counted container > type to assets = assets . get ( type ) ; if ( type to assets == null ) { type to assets = new object map < string , ref counted container > ( ) ; assets . put ( type , type to assets ) ; } type to assets . put ( file name , new ref counted container ( asset ) ) ; } <SENTENCE_END/>

(Copy Probability: 3.9%)

<SENTENCE_START> { asset types . put ( file name , type ) ; object map < string , ref counted container > type to assets = assets . get ( type ) ; if ( type to assets == null ) { type to assets = new object map < string , ref counted container > ( ) ; assets . put ( type , type to assets ) ; } type to assets . put ( file name , new ref counted container ( asset ) ) ; } <SENTENCE_END/>

asset

<SENTENCE_START> { asset types . put ( file name , type ) ; object map < string , ref counted container > type to assets = assets . get ( type ) ; if ( type to assets == null ) { type to assets = new object map < string , ref counted container > ( ) ; assets . put ( type , type to assets ) ; } type to assets . put ( file name , new ref counted container ( asset ) ) ; } <SENTENCE_END/>

(Copy Probability: 59.6%)

<SENTENCE_START> { asset types . put ( file name , type ) ; object map < string , ref counted container > type to assets = assets . get ( type ) ; if ( type to assets == null ) { type to assets = new object map < string , ref counted container > ( ) ; assets . put ( type , type to assets ) ; } type to assets . put ( file name , new ref counted container ( asset ) ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { asset types . put ( file name , type ) ; object map < string , ref counted container > type to assets = assets . get ( type ) ; if ( type to assets == null ) { type to assets = new object map < string , ref counted container > ( ) ; assets . put ( type , type to assets ) ; } type to assets . put ( file name , new ref counted container ( asset ) ) ; } <SENTENCE_END/>

(Copy Probability: 60.9%)

<SENTENCE_START> { asset types . put ( file name , type ) ; object map < string , ref counted container > type to assets = assets . get ( type ) ; if ( type to assets == null ) { type to assets = new object map < string , ref counted container > ( ) ; assets . put ( type , type to assets ) ; } type to assets . put ( file name , new ref counted container ( asset ) ) ; } <SENTENCE_END/>


Original Name update,task

update

<SENTENCE_START> { asset loading task task = tasks . peek ( ) ; boolean complete = true ; try { complete = task . cancel || task . update ( ) ; } catch ( runtime exception ex ) { task . cancel = true ; task failed ( task . asset desc , ex ) ; } if ( complete ) { if ( tasks . size ( ) == 1 ) loaded ++ ; tasks . pop ( ) ; if ( task . cancel ) return true ; add asset ( task . asset desc . file name , task . asset desc . type , task . get asset ( ) ) ; if ( task . asset desc . params != null && task . asset desc . params . loaded callback != null ) { task . asset desc . params . loaded callback . finished loading ( this , task . asset desc . file name , task . asset desc . type ) ; } long end time = time utils . nano time ( ) ; log . debug ( "Loaded: " + ( end time - task . start time ) / 1000000f + "ms " + task . asset desc ) ; return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 5.0%)

<SENTENCE_START> { asset loading task task = tasks . peek ( ) ; boolean complete = true ; try { complete = task . cancel || task . update ( ) ; } catch ( runtime exception ex ) { task . cancel = true ; task failed ( task . asset desc , ex ) ; } if ( complete ) { if ( tasks . size ( ) == 1 ) loaded ++ ; tasks . pop ( ) ; if ( task . cancel ) return true ; add asset ( task . asset desc . file name , task . asset desc . type , task . get asset ( ) ) ; if ( task . asset desc . params != null && task . asset desc . params . loaded callback != null ) { task . asset desc . params . loaded callback . finished loading ( this , task . asset desc . file name , task . asset desc . type ) ; } long end time = time utils . nano time ( ) ; log . debug ( "Loaded: " + ( end time - task . start time ) / 1000000f + "ms " + task . asset desc ) ; return true ; } return false ; } <SENTENCE_END/>

task

<SENTENCE_START> { asset loading task task = tasks . peek ( ) ; boolean complete = true ; try { complete = task . cancel || task . update ( ) ; } catch ( runtime exception ex ) { task . cancel = true ; task failed ( task . asset desc , ex ) ; } if ( complete ) { if ( tasks . size ( ) == 1 ) loaded ++ ; tasks . pop ( ) ; if ( task . cancel ) return true ; add asset ( task . asset desc . file name , task . asset desc . type , task . get asset ( ) ) ; if ( task . asset desc . params != null && task . asset desc . params . loaded callback != null ) { task . asset desc . params . loaded callback . finished loading ( this , task . asset desc . file name , task . asset desc . type ) ; } long end time = time utils . nano time ( ) ; log . debug ( "Loaded: " + ( end time - task . start time ) / 1000000f + "ms " + task . asset desc ) ; return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 51.3%)

<SENTENCE_START> { asset loading task task = tasks . peek ( ) ; boolean complete = true ; try { complete = task . cancel || task . update ( ) ; } catch ( runtime exception ex ) { task . cancel = true ; task failed ( task . asset desc , ex ) ; } if ( complete ) { if ( tasks . size ( ) == 1 ) loaded ++ ; tasks . pop ( ) ; if ( task . cancel ) return true ; add asset ( task . asset desc . file name , task . asset desc . type , task . get asset ( ) ) ; if ( task . asset desc . params != null && task . asset desc . params . loaded callback != null ) { task . asset desc . params . loaded callback . finished loading ( this , task . asset desc . file name , task . asset desc . type ) ; } long end time = time utils . nano time ( ) ; log . debug ( "Loaded: " + ( end time - task . start time ) / 1000000f + "ms " + task . asset desc ) ; return true ; } return false ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { asset loading task task = tasks . peek ( ) ; boolean complete = true ; try { complete = task . cancel || task . update ( ) ; } catch ( runtime exception ex ) { task . cancel = true ; task failed ( task . asset desc , ex ) ; } if ( complete ) { if ( tasks . size ( ) == 1 ) loaded ++ ; tasks . pop ( ) ; if ( task . cancel ) return true ; add asset ( task . asset desc . file name , task . asset desc . type , task . get asset ( ) ) ; if ( task . asset desc . params != null && task . asset desc . params . loaded callback != null ) { task . asset desc . params . loaded callback . finished loading ( this , task . asset desc . file name , task . asset desc . type ) ; } long end time = time utils . nano time ( ) ; log . debug ( "Loaded: " + ( end time - task . start time ) / 1000000f + "ms " + task . asset desc ) ; return true ; } return false ; } <SENTENCE_END/>

(Copy Probability: 37.6%)

<SENTENCE_START> { asset loading task task = tasks . peek ( ) ; boolean complete = true ; try { complete = task . cancel || task . update ( ) ; } catch ( runtime exception ex ) { task . cancel = true ; task failed ( task . asset desc , ex ) ; } if ( complete ) { if ( tasks . size ( ) == 1 ) loaded ++ ; tasks . pop ( ) ; if ( task . cancel ) return true ; add asset ( task . asset desc . file name , task . asset desc . type , task . get asset ( ) ) ; if ( task . asset desc . params != null && task . asset desc . params . loaded callback != null ) { task . asset desc . params . loaded callback . finished loading ( this , task . asset desc . file name , task . asset desc . type ) ; } long end time = time utils . nano time ( ) ; log . debug ( "Loaded: " + ( end time - task . start time ) / 1000000f + "ms " + task . asset desc ) ; return true ; } return false ; } <SENTENCE_END/>


Original Name task,failed

task

<SENTENCE_START> { throw ex ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { throw ex ; } <SENTENCE_END/>

failed

<SENTENCE_START> { throw ex ; } <SENTENCE_END/>

(Copy Probability: 0.0%)

<SENTENCE_START> { throw ex ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { throw ex ; } <SENTENCE_END/>

(Copy Probability: 0.1%)

<SENTENCE_START> { throw ex ; } <SENTENCE_END/>


Original Name increment,ref,counted,dependencies

increment

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

(Copy Probability: 5.4%)

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

ref

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

(Copy Probability: 92.0%)

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

counted

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

(Copy Probability: 66.4%)

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

dependencies

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

(Copy Probability: 5.5%)

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>

(Copy Probability: 4.9%)

<SENTENCE_START> { array < string > dependencies = asset dependencies . get ( parent ) ; if ( dependencies == null ) return ; for ( string dependency : dependencies ) { class type = asset types . get ( dependency ) ; ref counted container asset ref = assets . get ( type ) . get ( dependency ) ; asset ref . inc ref count ( ) ; %SELF% ( dependency ) ; } } <SENTENCE_END/>


Original Name handle,task,error

handle

<SENTENCE_START> { log . error ( "Error loading asset." , t ) ; if ( tasks . is empty ( ) ) throw new gdx runtime exception ( t ) ; asset loading task task = tasks . pop ( ) ; asset descriptor asset desc = task . asset desc ; if ( task . dependencies loaded && task . dependencies != null ) { for ( asset descriptor desc : task . dependencies ) { unload ( desc . file name ) ; } } tasks . clear ( ) ; if ( listener != null ) { listener . error ( asset desc , t ) ; } else { throw new gdx runtime exception ( t ) ; } } <SENTENCE_END/>

(Copy Probability: 11.0%)

<SENTENCE_START> { log . error ( "Error loading asset." , t ) ; if ( tasks . is empty ( ) ) throw new gdx runtime exception ( t ) ; asset loading task task = tasks . pop ( ) ; asset descriptor asset desc = task . asset desc ; if ( task . dependencies loaded && task . dependencies != null ) { for ( asset descriptor desc : task . dependencies ) { unload ( desc . file name ) ; } } tasks . clear ( ) ; if ( listener != null ) { listener . error ( asset desc , t ) ; } else { throw new gdx runtime exception ( t ) ; } } <SENTENCE_END/>

task

<SENTENCE_START> { log . error ( "Error loading asset." , t ) ; if ( tasks . is empty ( ) ) throw new gdx runtime exception ( t ) ; asset loading task task = tasks . pop ( ) ; asset descriptor asset desc = task . asset desc ; if ( task . dependencies loaded && task . dependencies != null ) { for ( asset descriptor desc : task . dependencies ) { unload ( desc . file name ) ; } } tasks . clear ( ) ; if ( listener != null ) { listener . error ( asset desc , t ) ; } else { throw new gdx runtime exception ( t ) ; } } <SENTENCE_END/>

(Copy Probability: 75.4%)

<SENTENCE_START> { log . error ( "Error loading asset." , t ) ; if ( tasks . is empty ( ) ) throw new gdx runtime exception ( t ) ; asset loading task task = tasks . pop ( ) ; asset descriptor asset desc = task . asset desc ; if ( task . dependencies loaded && task . dependencies != null ) { for ( asset descriptor desc : task . dependencies ) { unload ( desc . file name ) ; } } tasks . clear ( ) ; if ( listener != null ) { listener . error ( asset desc , t ) ; } else { throw new gdx runtime exception ( t ) ; } } <SENTENCE_END/>

error

<SENTENCE_START> { log . error ( "Error loading asset." , t ) ; if ( tasks . is empty ( ) ) throw new gdx runtime exception ( t ) ; asset loading task task = tasks . pop ( ) ; asset descriptor asset desc = task . asset desc ; if ( task . dependencies loaded && task . dependencies != null ) { for ( asset descriptor desc : task . dependencies ) { unload ( desc . file name ) ; } } tasks . clear ( ) ; if ( listener != null ) { listener . error ( asset desc , t ) ; } else { throw new gdx runtime exception ( t ) ; } } <SENTENCE_END/>

(Copy Probability: 48.5%)

<SENTENCE_START> { log . error ( "Error loading asset." , t ) ; if ( tasks . is empty ( ) ) throw new gdx runtime exception ( t ) ; asset loading task task = tasks . pop ( ) ; asset descriptor asset desc = task . asset desc ; if ( task . dependencies loaded && task . dependencies != null ) { for ( asset descriptor desc : task . dependencies ) { unload ( desc . file name ) ; } } tasks . clear ( ) ; if ( listener != null ) { listener . error ( asset desc , t ) ; } else { throw new gdx runtime exception ( t ) ; } } <SENTENCE_END/>

%END%

<SENTENCE_START> { log . error ( "Error loading asset." , t ) ; if ( tasks . is empty ( ) ) throw new gdx runtime exception ( t ) ; asset loading task task = tasks . pop ( ) ; asset descriptor asset desc = task . asset desc ; if ( task . dependencies loaded && task . dependencies != null ) { for ( asset descriptor desc : task . dependencies ) { unload ( desc . file name ) ; } } tasks . clear ( ) ; if ( listener != null ) { listener . error ( asset desc , t ) ; } else { throw new gdx runtime exception ( t ) ; } } <SENTENCE_END/>

(Copy Probability: 4.2%)

<SENTENCE_START> { log . error ( "Error loading asset." , t ) ; if ( tasks . is empty ( ) ) throw new gdx runtime exception ( t ) ; asset loading task task = tasks . pop ( ) ; asset descriptor asset desc = task . asset desc ; if ( task . dependencies loaded && task . dependencies != null ) { for ( asset descriptor desc : task . dependencies ) { unload ( desc . file name ) ; } } tasks . clear ( ) ; if ( listener != null ) { listener . error ( asset desc , t ) ; } else { throw new gdx runtime exception ( t ) ; } } <SENTENCE_END/>


Original Name set,loader

set

<SENTENCE_START> { %SELF% ( type , null , loader ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { %SELF% ( type , null , loader ) ; } <SENTENCE_END/>

loader

<SENTENCE_START> { %SELF% ( type , null , loader ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { %SELF% ( type , null , loader ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { %SELF% ( type , null , loader ) ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { %SELF% ( type , null , loader ) ; } <SENTENCE_END/>


Original Name set,loader

set

<SENTENCE_START> { if ( type == null ) throw new illegal argument exception ( "type cannot be null." ) ; if ( loader == null ) throw new illegal argument exception ( "loader cannot be null." ) ; log . debug ( "Loader set: " + class reflection . get simple name ( type ) + " -> " + class reflection . get simple name ( loader . get class ( ) ) ) ; object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null ) this . loaders . put ( type , loaders = new object map < string , asset loader > ( ) ) ; loaders . put ( suffix == null ? "" : suffix , loader ) ; } <SENTENCE_END/>

(Copy Probability: 3.5%)

<SENTENCE_START> { if ( type == null ) throw new illegal argument exception ( "type cannot be null." ) ; if ( loader == null ) throw new illegal argument exception ( "loader cannot be null." ) ; log . debug ( "Loader set: " + class reflection . get simple name ( type ) + " -> " + class reflection . get simple name ( loader . get class ( ) ) ) ; object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null ) this . loaders . put ( type , loaders = new object map < string , asset loader > ( ) ) ; loaders . put ( suffix == null ? "" : suffix , loader ) ; } <SENTENCE_END/>

loader

<SENTENCE_START> { if ( type == null ) throw new illegal argument exception ( "type cannot be null." ) ; if ( loader == null ) throw new illegal argument exception ( "loader cannot be null." ) ; log . debug ( "Loader set: " + class reflection . get simple name ( type ) + " -> " + class reflection . get simple name ( loader . get class ( ) ) ) ; object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null ) this . loaders . put ( type , loaders = new object map < string , asset loader > ( ) ) ; loaders . put ( suffix == null ? "" : suffix , loader ) ; } <SENTENCE_END/>

(Copy Probability: 15.5%)

<SENTENCE_START> { if ( type == null ) throw new illegal argument exception ( "type cannot be null." ) ; if ( loader == null ) throw new illegal argument exception ( "loader cannot be null." ) ; log . debug ( "Loader set: " + class reflection . get simple name ( type ) + " -> " + class reflection . get simple name ( loader . get class ( ) ) ) ; object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null ) this . loaders . put ( type , loaders = new object map < string , asset loader > ( ) ) ; loaders . put ( suffix == null ? "" : suffix , loader ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( type == null ) throw new illegal argument exception ( "type cannot be null." ) ; if ( loader == null ) throw new illegal argument exception ( "loader cannot be null." ) ; log . debug ( "Loader set: " + class reflection . get simple name ( type ) + " -> " + class reflection . get simple name ( loader . get class ( ) ) ) ; object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null ) this . loaders . put ( type , loaders = new object map < string , asset loader > ( ) ) ; loaders . put ( suffix == null ? "" : suffix , loader ) ; } <SENTENCE_END/>

(Copy Probability: 8.2%)

<SENTENCE_START> { if ( type == null ) throw new illegal argument exception ( "type cannot be null." ) ; if ( loader == null ) throw new illegal argument exception ( "loader cannot be null." ) ; log . debug ( "Loader set: " + class reflection . get simple name ( type ) + " -> " + class reflection . get simple name ( loader . get class ( ) ) ) ; object map < string , asset loader > loaders = this . loaders . get ( type ) ; if ( loaders == null ) this . loaders . put ( type , loaders = new object map < string , asset loader > ( ) ) ; loaders . put ( suffix == null ? "" : suffix , loader ) ; } <SENTENCE_END/>


Original Name get,loaded,assets

get

<SENTENCE_START> { return asset types . size ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return asset types . size ; } <SENTENCE_END/>

loaded

<SENTENCE_START> { return asset types . size ; } <SENTENCE_END/>

(Copy Probability: 98.8%)

<SENTENCE_START> { return asset types . size ; } <SENTENCE_END/>

assets

<SENTENCE_START> { return asset types . size ; } <SENTENCE_END/>

(Copy Probability: 82.1%)

<SENTENCE_START> { return asset types . size ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return asset types . size ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { return asset types . size ; } <SENTENCE_END/>


Original Name get,queued,assets

get

<SENTENCE_START> { return load queue . size + tasks . size ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { return load queue . size + tasks . size ( ) ; } <SENTENCE_END/>

queued

<SENTENCE_START> { return load queue . size + tasks . size ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { return load queue . size + tasks . size ( ) ; } <SENTENCE_END/>

assets

<SENTENCE_START> { return load queue . size + tasks . size ( ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return load queue . size + tasks . size ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return load queue . size + tasks . size ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.0%)

<SENTENCE_START> { return load queue . size + tasks . size ( ) ; } <SENTENCE_END/>


Original Name get,progress

get

<SENTENCE_START> { if ( to load == 0 ) return 1 ; return math . min ( 1 , loaded / ( float ) to load ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { if ( to load == 0 ) return 1 ; return math . min ( 1 , loaded / ( float ) to load ) ; } <SENTENCE_END/>

progress

<SENTENCE_START> { if ( to load == 0 ) return 1 ; return math . min ( 1 , loaded / ( float ) to load ) ; } <SENTENCE_END/>

(Copy Probability: 25.6%)

<SENTENCE_START> { if ( to load == 0 ) return 1 ; return math . min ( 1 , loaded / ( float ) to load ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { if ( to load == 0 ) return 1 ; return math . min ( 1 , loaded / ( float ) to load ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { if ( to load == 0 ) return 1 ; return math . min ( 1 , loaded / ( float ) to load ) ; } <SENTENCE_END/>


Original Name set,error,listener

set

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

(Copy Probability: 0.9%)

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

error

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

(Copy Probability: 94.6%)

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

listener

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

(Copy Probability: 2.7%)

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

%END%

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

(Copy Probability: 0.7%)

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


Original Name clear

clear

<SENTENCE_START> { load queue . %SELF% ( ) ; while ( ! update ( ) ) ; object int map < string > dependency count = new object int map < string > ( ) ; while ( asset types . size > 0 ) { dependency count . %SELF% ( ) ; array < string > assets = asset types . keys ( ) . to array ( ) ; for ( string asset : assets ) { dependency count . put ( asset , 0 ) ; } for ( string asset : assets ) { array < string > dependencies = asset dependencies . get ( asset ) ; if ( dependencies == null ) continue ; for ( string dependency : dependencies ) { int count = dependency count . get ( dependency , 0 ) ; count ++ ; dependency count . put ( dependency , count ) ; } } for ( string asset : assets ) { if ( dependency count . get ( asset , 0 ) == 0 ) { unload ( asset ) ; } } } this . assets . %SELF% ( ) ; this . asset types . %SELF% ( ) ; this . asset dependencies . %SELF% ( ) ; this . loaded = 0 ; this . to load = 0 ; this . load queue . %SELF% ( ) ; this . tasks . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.6%)

<SENTENCE_START> { load queue . %SELF% ( ) ; while ( ! update ( ) ) ; object int map < string > dependency count = new object int map < string > ( ) ; while ( asset types . size > 0 ) { dependency count . %SELF% ( ) ; array < string > assets = asset types . keys ( ) . to array ( ) ; for ( string asset : assets ) { dependency count . put ( asset , 0 ) ; } for ( string asset : assets ) { array < string > dependencies = asset dependencies . get ( asset ) ; if ( dependencies == null ) continue ; for ( string dependency : dependencies ) { int count = dependency count . get ( dependency , 0 ) ; count ++ ; dependency count . put ( dependency , count ) ; } } for ( string asset : assets ) { if ( dependency count . get ( asset , 0 ) == 0 ) { unload ( asset ) ; } } } this . assets . %SELF% ( ) ; this . asset types . %SELF% ( ) ; this . asset dependencies . %SELF% ( ) ; this . loaded = 0 ; this . to load = 0 ; this . load queue . %SELF% ( ) ; this . tasks . %SELF% ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { load queue . %SELF% ( ) ; while ( ! update ( ) ) ; object int map < string > dependency count = new object int map < string > ( ) ; while ( asset types . size > 0 ) { dependency count . %SELF% ( ) ; array < string > assets = asset types . keys ( ) . to array ( ) ; for ( string asset : assets ) { dependency count . put ( asset , 0 ) ; } for ( string asset : assets ) { array < string > dependencies = asset dependencies . get ( asset ) ; if ( dependencies == null ) continue ; for ( string dependency : dependencies ) { int count = dependency count . get ( dependency , 0 ) ; count ++ ; dependency count . put ( dependency , count ) ; } } for ( string asset : assets ) { if ( dependency count . get ( asset , 0 ) == 0 ) { unload ( asset ) ; } } } this . assets . %SELF% ( ) ; this . asset types . %SELF% ( ) ; this . asset dependencies . %SELF% ( ) ; this . loaded = 0 ; this . to load = 0 ; this . load queue . %SELF% ( ) ; this . tasks . %SELF% ( ) ; } <SENTENCE_END/>

(Copy Probability: 17.6%)

<SENTENCE_START> { load queue . %SELF% ( ) ; while ( ! update ( ) ) ; object int map < string > dependency count = new object int map < string > ( ) ; while ( asset types . size > 0 ) { dependency count . %SELF% ( ) ; array < string > assets = asset types . keys ( ) . to array ( ) ; for ( string asset : assets ) { dependency count . put ( asset , 0 ) ; } for ( string asset : assets ) { array < string > dependencies = asset dependencies . get ( asset ) ; if ( dependencies == null ) continue ; for ( string dependency : dependencies ) { int count = dependency count . get ( dependency , 0 ) ; count ++ ; dependency count . put ( dependency , count ) ; } } for ( string asset : assets ) { if ( dependency count . get ( asset , 0 ) == 0 ) { unload ( asset ) ; } } } this . assets . %SELF% ( ) ; this . asset types . %SELF% ( ) ; this . asset dependencies . %SELF% ( ) ; this . loaded = 0 ; this . to load = 0 ; this . load queue . %SELF% ( ) ; this . tasks . %SELF% ( ) ; } <SENTENCE_END/>


Original Name get,logger

get

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

(Copy Probability: 0.3%)

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

logger

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

(Copy Probability: 25.0%)

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

%END%

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

(Copy Probability: 0.6%)

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


Original Name set,logger

set

<SENTENCE_START> { log = logger ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { log = logger ; } <SENTENCE_END/>

logger

<SENTENCE_START> { log = logger ; } <SENTENCE_END/>

(Copy Probability: 13.0%)

<SENTENCE_START> { log = logger ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { log = logger ; } <SENTENCE_END/>

(Copy Probability: 0.4%)

<SENTENCE_START> { log = logger ; } <SENTENCE_END/>


Original Name get,reference,count

get

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return assets . get ( type ) . get ( file name ) . get ref count ( ) ; } <SENTENCE_END/>

(Copy Probability: 2.3%)

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return assets . get ( type ) . get ( file name ) . get ref count ( ) ; } <SENTENCE_END/>

reference

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return assets . get ( type ) . get ( file name ) . get ref count ( ) ; } <SENTENCE_END/>

(Copy Probability: 65.5%)

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return assets . get ( type ) . get ( file name ) . get ref count ( ) ; } <SENTENCE_END/>

count

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return assets . get ( type ) . get ( file name ) . get ref count ( ) ; } <SENTENCE_END/>

(Copy Probability: 40.9%)

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return assets . get ( type ) . get ( file name ) . get ref count ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return assets . get ( type ) . get ( file name ) . get ref count ( ) ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; return assets . get ( type ) . get ( file name ) . get ref count ( ) ; } <SENTENCE_END/>


Original Name set,reference,count

set

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; assets . get ( type ) . get ( file name ) . set ref count ( ref count ) ; } <SENTENCE_END/>

(Copy Probability: 2.5%)

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; assets . get ( type ) . get ( file name ) . set ref count ( ref count ) ; } <SENTENCE_END/>

reference

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; assets . get ( type ) . get ( file name ) . set ref count ( ref count ) ; } <SENTENCE_END/>

(Copy Probability: 72.8%)

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; assets . get ( type ) . get ( file name ) . set ref count ( ref count ) ; } <SENTENCE_END/>

count

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; assets . get ( type ) . get ( file name ) . set ref count ( ref count ) ; } <SENTENCE_END/>

(Copy Probability: 67.7%)

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; assets . get ( type ) . get ( file name ) . set ref count ( ref count ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; assets . get ( type ) . get ( file name ) . set ref count ( ref count ) ; } <SENTENCE_END/>

(Copy Probability: 5.7%)

<SENTENCE_START> { class type = asset types . get ( file name ) ; if ( type == null ) throw new gdx runtime exception ( "Asset not loaded: " + file name ) ; assets . get ( type ) . get ( file name ) . set ref count ( ref count ) ; } <SENTENCE_END/>


Original Name get,diagnostics

get

<SENTENCE_START> { string buffer buffer = new string buffer ( ) ; for ( string file name : asset types . keys ( ) ) { buffer . append ( file name ) ; buffer . append ( ", " ) ; class type = asset types . get ( file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; array < string > dependencies = asset dependencies . get ( file name ) ; buffer . append ( class reflection . get simple name ( type ) ) ; buffer . append ( ", refs: " ) ; buffer . append ( asset ref . get ref count ( ) ) ; if ( dependencies != null ) { buffer . append ( ", deps: [" ) ; for ( string dep : dependencies ) { buffer . append ( dep ) ; buffer . append ( "," ) ; } buffer . append ( "]" ) ; } buffer . append ( " " ) ; } return buffer . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 4.1%)

<SENTENCE_START> { string buffer buffer = new string buffer ( ) ; for ( string file name : asset types . keys ( ) ) { buffer . append ( file name ) ; buffer . append ( ", " ) ; class type = asset types . get ( file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; array < string > dependencies = asset dependencies . get ( file name ) ; buffer . append ( class reflection . get simple name ( type ) ) ; buffer . append ( ", refs: " ) ; buffer . append ( asset ref . get ref count ( ) ) ; if ( dependencies != null ) { buffer . append ( ", deps: [" ) ; for ( string dep : dependencies ) { buffer . append ( dep ) ; buffer . append ( "," ) ; } buffer . append ( "]" ) ; } buffer . append ( " " ) ; } return buffer . to string ( ) ; } <SENTENCE_END/>

diagnostics

<SENTENCE_START> { string buffer buffer = new string buffer ( ) ; for ( string file name : asset types . keys ( ) ) { buffer . append ( file name ) ; buffer . append ( ", " ) ; class type = asset types . get ( file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; array < string > dependencies = asset dependencies . get ( file name ) ; buffer . append ( class reflection . get simple name ( type ) ) ; buffer . append ( ", refs: " ) ; buffer . append ( asset ref . get ref count ( ) ) ; if ( dependencies != null ) { buffer . append ( ", deps: [" ) ; for ( string dep : dependencies ) { buffer . append ( dep ) ; buffer . append ( "," ) ; } buffer . append ( "]" ) ; } buffer . append ( " " ) ; } return buffer . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 72.8%)

<SENTENCE_START> { string buffer buffer = new string buffer ( ) ; for ( string file name : asset types . keys ( ) ) { buffer . append ( file name ) ; buffer . append ( ", " ) ; class type = asset types . get ( file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; array < string > dependencies = asset dependencies . get ( file name ) ; buffer . append ( class reflection . get simple name ( type ) ) ; buffer . append ( ", refs: " ) ; buffer . append ( asset ref . get ref count ( ) ) ; if ( dependencies != null ) { buffer . append ( ", deps: [" ) ; for ( string dep : dependencies ) { buffer . append ( dep ) ; buffer . append ( "," ) ; } buffer . append ( "]" ) ; } buffer . append ( " " ) ; } return buffer . to string ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { string buffer buffer = new string buffer ( ) ; for ( string file name : asset types . keys ( ) ) { buffer . append ( file name ) ; buffer . append ( ", " ) ; class type = asset types . get ( file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; array < string > dependencies = asset dependencies . get ( file name ) ; buffer . append ( class reflection . get simple name ( type ) ) ; buffer . append ( ", refs: " ) ; buffer . append ( asset ref . get ref count ( ) ) ; if ( dependencies != null ) { buffer . append ( ", deps: [" ) ; for ( string dep : dependencies ) { buffer . append ( dep ) ; buffer . append ( "," ) ; } buffer . append ( "]" ) ; } buffer . append ( " " ) ; } return buffer . to string ( ) ; } <SENTENCE_END/>

(Copy Probability: 51.3%)

<SENTENCE_START> { string buffer buffer = new string buffer ( ) ; for ( string file name : asset types . keys ( ) ) { buffer . append ( file name ) ; buffer . append ( ", " ) ; class type = asset types . get ( file name ) ; ref counted container asset ref = assets . get ( type ) . get ( file name ) ; array < string > dependencies = asset dependencies . get ( file name ) ; buffer . append ( class reflection . get simple name ( type ) ) ; buffer . append ( ", refs: " ) ; buffer . append ( asset ref . get ref count ( ) ) ; if ( dependencies != null ) { buffer . append ( ", deps: [" ) ; for ( string dep : dependencies ) { buffer . append ( dep ) ; buffer . append ( "," ) ; } buffer . append ( "]" ) ; } buffer . append ( " " ) ; } return buffer . to string ( ) ; } <SENTENCE_END/>


Original Name get,asset,names

get

<SENTENCE_START> { return asset types . keys ( ) . to array ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.7%)

<SENTENCE_START> { return asset types . keys ( ) . to array ( ) ; } <SENTENCE_END/>

asset

<SENTENCE_START> { return asset types . keys ( ) . to array ( ) ; } <SENTENCE_END/>

(Copy Probability: 66.5%)

<SENTENCE_START> { return asset types . keys ( ) . to array ( ) ; } <SENTENCE_END/>

names

<SENTENCE_START> { return asset types . keys ( ) . to array ( ) ; } <SENTENCE_END/>

(Copy Probability: 6.6%)

<SENTENCE_START> { return asset types . keys ( ) . to array ( ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return asset types . keys ( ) . to array ( ) ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { return asset types . keys ( ) . to array ( ) ; } <SENTENCE_END/>


Original Name get,dependencies

get

<SENTENCE_START> { return asset dependencies . get ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { return asset dependencies . get ( file name ) ; } <SENTENCE_END/>

dependencies

<SENTENCE_START> { return asset dependencies . get ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 94.4%)

<SENTENCE_START> { return asset dependencies . get ( file name ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return asset dependencies . get ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 74.9%)

<SENTENCE_START> { return asset dependencies . get ( file name ) ; } <SENTENCE_END/>


Original Name get,asset,type

get

<SENTENCE_START> { return asset types . get ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 1.3%)

<SENTENCE_START> { return asset types . get ( file name ) ; } <SENTENCE_END/>

asset

<SENTENCE_START> { return asset types . get ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 99.2%)

<SENTENCE_START> { return asset types . get ( file name ) ; } <SENTENCE_END/>

type

<SENTENCE_START> { return asset types . get ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 90.4%)

<SENTENCE_START> { return asset types . get ( file name ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return asset types . get ( file name ) ; } <SENTENCE_END/>

(Copy Probability: 7.2%)

<SENTENCE_START> { return asset types . get ( file name ) ; } <SENTENCE_END/>


Original Name get,sin

get

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

(Copy Probability: 0.2%)

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

sin

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

(Copy Probability: 2.1%)

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

%END%

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

(Copy Probability: 0.4%)

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


Original Name get,cos

get

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

(Copy Probability: 0.3%)

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

cos

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

(Copy Probability: 59.3%)

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

%END%

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

(Copy Probability: 1.3%)

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


Original Name set

set

<SENTENCE_START> { s = math utils . sin ( angle ) ; c = math utils . cos ( angle ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { s = math utils . sin ( angle ) ; c = math utils . cos ( angle ) ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { s = math utils . sin ( angle ) ; c = math utils . cos ( angle ) ; return this ; } <SENTENCE_END/>

(Copy Probability: 3.3%)

<SENTENCE_START> { s = math utils . sin ( angle ) ; c = math utils . cos ( angle ) ; return this ; } <SENTENCE_END/>


Original Name set

set

<SENTENCE_START> { s = other . s ; c = other . c ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { s = other . s ; c = other . c ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { s = other . s ; c = other . c ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { s = other . s ; c = other . c ; return this ; } <SENTENCE_END/>


Original Name set,identity

set

<SENTENCE_START> { s = 0 ; c = 1 ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { s = 0 ; c = 1 ; return this ; } <SENTENCE_END/>

identity

<SENTENCE_START> { s = 0 ; c = 1 ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { s = 0 ; c = 1 ; return this ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { s = 0 ; c = 1 ; return this ; } <SENTENCE_END/>

(Copy Probability: 0.2%)

<SENTENCE_START> { s = 0 ; c = 1 ; return this ; } <SENTENCE_END/>


Original Name get,angle

get

<SENTENCE_START> { return math utils . atan 2 ( s , c ) ; } <SENTENCE_END/>

(Copy Probability: 0.9%)

<SENTENCE_START> { return math utils . atan 2 ( s , c ) ; } <SENTENCE_END/>

angle

<SENTENCE_START> { return math utils . atan 2 ( s , c ) ; } <SENTENCE_END/>

(Copy Probability: 20.6%)

<SENTENCE_START> { return math utils . atan 2 ( s , c ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { return math utils . atan 2 ( s , c ) ; } <SENTENCE_END/>

(Copy Probability: 0.5%)

<SENTENCE_START> { return math utils . atan 2 ( s , c ) ; } <SENTENCE_END/>


Original Name get,x,axis

get

<SENTENCE_START> { x axis . set ( c , s ) ; } <SENTENCE_END/>

(Copy Probability: 0.6%)

<SENTENCE_START> { x axis . set ( c , s ) ; } <SENTENCE_END/>

x

<SENTENCE_START> { x axis . set ( c , s ) ; } <SENTENCE_END/>

(Copy Probability: 10.8%)

<SENTENCE_START> { x axis . set ( c , s ) ; } <SENTENCE_END/>

axis

<SENTENCE_START> { x axis . set ( c , s ) ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { x axis . set ( c , s ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { x axis . set ( c , s ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { x axis . set ( c , s ) ; } <SENTENCE_END/>


Original Name get,y,axis

get

<SENTENCE_START> { y axis . set ( - s , c ) ; } <SENTENCE_END/>

(Copy Probability: 0.7%)

<SENTENCE_START> { y axis . set ( - s , c ) ; } <SENTENCE_END/>

y

<SENTENCE_START> { y axis . set ( - s , c ) ; } <SENTENCE_END/>

(Copy Probability: 7.5%)

<SENTENCE_START> { y axis . set ( - s , c ) ; } <SENTENCE_END/>

axis

<SENTENCE_START> { y axis . set ( - s , c ) ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { y axis . set ( - s , c ) ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { y axis . set ( - s , c ) ; } <SENTENCE_END/>

(Copy Probability: 0.8%)

<SENTENCE_START> { y axis . set ( - s , c ) ; } <SENTENCE_END/>


Original Name clone

clone

<SENTENCE_START> { rot copy = new rot ( ) ; copy . s = s ; copy . c = c ; return copy ; } <SENTENCE_END/>

(Copy Probability: 1.2%)

<SENTENCE_START> { rot copy = new rot ( ) ; copy . s = s ; copy . c = c ; return copy ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { rot copy = new rot ( ) ; copy . s = s ; copy . c = c ; return copy ; } <SENTENCE_END/>

(Copy Probability: 4.3%)

<SENTENCE_START> { rot copy = new rot ( ) ; copy . s = s ; copy . c = c ; return copy ; } <SENTENCE_END/>


Original Name mul

mul

<SENTENCE_START> { float tempc = q . c * r . c - q . s * r . s ; out . s = q . s * r . c + q . c * r . s ; out . c = tempc ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { float tempc = q . c * r . c - q . s * r . s ; out . s = q . s * r . c + q . c * r . s ; out . c = tempc ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { float tempc = q . c * r . c - q . s * r . s ; out . s = q . s * r . c + q . c * r . s ; out . c = tempc ; } <SENTENCE_END/>

(Copy Probability: 2.0%)

<SENTENCE_START> { float tempc = q . c * r . c - q . s * r . s ; out . s = q . s * r . c + q . c * r . s ; out . c = tempc ; } <SENTENCE_END/>


Original Name mul,unsafe

mul

<SENTENCE_START> { assert ( r != out ) ; assert ( q != out ) ; out . s = q . s * r . c + q . c * r . s ; out . c = q . c * r . c - q . s * r . s ; } <SENTENCE_END/>

(Copy Probability: 2.2%)

<SENTENCE_START> { assert ( r != out ) ; assert ( q != out ) ; out . s = q . s * r . c + q . c * r . s ; out . c = q . c * r . c - q . s * r . s ; } <SENTENCE_END/>

unsafe

<SENTENCE_START> { assert ( r != out ) ; assert ( q != out ) ; out . s = q . s * r . c + q . c * r . s ; out . c = q . c * r . c - q . s * r . s ; } <SENTENCE_END/>

(Copy Probability: 1.6%)

<SENTENCE_START> { assert ( r != out ) ; assert ( q != out ) ; out . s = q . s * r . c + q . c * r . s ; out . c = q . c * r . c - q . s * r . s ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { assert ( r != out ) ; assert ( q != out ) ; out . s = q . s * r . c + q . c * r . s ; out . c = q . c * r . c - q . s * r . s ; } <SENTENCE_END/>

(Copy Probability: 1.4%)

<SENTENCE_START> { assert ( r != out ) ; assert ( q != out ) ; out . s = q . s * r . c + q . c * r . s ; out . c = q . c * r . c - q . s * r . s ; } <SENTENCE_END/>


Original Name mul,trans

mul

<SENTENCE_START> { final float tempc = q . c * r . c + q . s * r . s ; out . s = q . c * r . s - q . s * r . c ; out . c = tempc ; } <SENTENCE_END/>

(Copy Probability: 1.9%)

<SENTENCE_START> { final float tempc = q . c * r . c + q . s * r . s ; out . s = q . c * r . s - q . s * r . c ; out . c = tempc ; } <SENTENCE_END/>

trans

<SENTENCE_START> { final float tempc = q . c * r . c + q . s * r . s ; out . s = q . c * r . s - q . s * r . c ; out . c = tempc ; } <SENTENCE_END/>

(Copy Probability: 2.4%)

<SENTENCE_START> { final float tempc = q . c * r . c + q . s * r . s ; out . s = q . c * r . s - q . s * r . c ; out . c = tempc ; } <SENTENCE_END/>

%END%

<SENTENCE_START> { final float tempc = q . c * r . c + q . s * r . s ; out . s = q . c * r . s - q . s * r . c ; out . c = tempc ; } <SENTENCE_END/>

(Copy Probability: 1.5%)

<SENTENCE_START> { final float tempc = q . c * r . c + q . s * r . s ; out . s = q . c * r . s - q . s * r . c ; out . c = tempc ; } <SENTENCE_END/>