id stringlengths 11 16 | language stringclasses 2
values | question stringlengths 13 844 | answer stringlengths 1 900 | code stringlengths 162 27.4k | code_original stringlengths 162 26k | code_word_count int64 51 5.96k |
|---|---|---|---|---|---|---|
java-test-3483 | java | What does the code create ? | an export mask object | public static Export Mask create Export Mask ( Db Client db Client , Export Group export Group , URI sd Uri , String mask Name ) throws Database Exception { Export Mask export Mask = new Export Mask ( ) ; export Mask . set Id ( URI Util . create Id ( Export Mask . class ) ) ; export Mask . set Mask Name ( mask Name ) ;... | public static ExportMask createExportMask ( DbClient dbClient , ExportGroup exportGroup , URI sdUri , String maskName ) throws DatabaseException { ExportMask exportMask = new ExportMask ( ) ; exportMask . setId ( URIUtil . createId ( ExportMask . class ) ) ; exportMask . setMaskName ( maskName ) ; exportMask . setStora... | 123 |
java-test-3484 | java | Where is by the controller service created the actual mask ? | at the array | public static Export Mask create Export Mask ( Db Client db Client , Export Group export Group , URI sd Uri , String mask Name ) throws Database Exception { Export Mask export Mask = new Export Mask ( ) ; export Mask . set Id ( URI Util . create Id ( Export Mask . class ) ) ; export Mask . set Mask Name ( mask Name ) ;... | public static ExportMask createExportMask ( DbClient dbClient , ExportGroup exportGroup , URI sdUri , String maskName ) throws DatabaseException { ExportMask exportMask = new ExportMask ( ) ; exportMask . setId ( URIUtil . createId ( ExportMask . class ) ) ; exportMask . setMaskName ( maskName ) ; exportMask . setStora... | 123 |
java-test-3485 | java | What is created the actual mask at the array ? | by the controller service | public static Export Mask create Export Mask ( Db Client db Client , Export Group export Group , URI sd Uri , String mask Name ) throws Database Exception { Export Mask export Mask = new Export Mask ( ) ; export Mask . set Id ( URI Util . create Id ( Export Mask . class ) ) ; export Mask . set Mask Name ( mask Name ) ;... | public static ExportMask createExportMask ( DbClient dbClient , ExportGroup exportGroup , URI sdUri , String maskName ) throws DatabaseException { ExportMask exportMask = new ExportMask ( ) ; exportMask . setId ( URIUtil . createId ( ExportMask . class ) ) ; exportMask . setMaskName ( maskName ) ; exportMask . setStora... | 123 |
java-test-3487 | java | What do a set contain ? | this charset ' s aliases | public final Set < String > aliases ( ) { if ( alias Set != null ) return alias Set ; int n = aliases . length ; Hash Set < String > hs = new Hash Set < String > ( n ) ; for ( int i = NUM ; i < n ; i ++ ) hs . add ( aliases [ i ] ) ; alias Set = Collections . unmodifiable Set ( hs ) ; return alias Set ; } | public final Set < String > aliases ( ) { if ( aliasSet != null ) return aliasSet ; int n = aliases . length ; HashSet < String > hs = new HashSet < String > ( n ) ; for ( int i = _NUM ; i < n ; i ++ ) hs . add ( aliases [ i ] ) ; aliasSet = Collections . unmodifiableSet ( hs ) ; return aliasSet ; } | 85 |
java-test-3489 | java | What causes truncation exceptions to be thrown ? | server - side prepared statements | public void test Bug 18041 ( ) throws Exception { if ( version Meets Minimum ( NUM , NUM ) ) { create Table ( STRING , STRING ) ; Properties props = new Properties ( ) ; props . set Property ( STRING , STRING ) ; props . set Property ( STRING , STRING ) ; Connection trunc Conn = null ; Prepared Statement stm = null ; t... | public void testBug18041 ( ) throws Exception { if ( versionMeetsMinimum ( _NUM , _NUM ) ) { createTable ( STRING , STRING ) ; Properties props = new Properties ( ) ; props . setProperty ( STRING , STRING ) ; props . setProperty ( STRING , STRING ) ; Connection truncConn = null ; PreparedStatement stm = null ; try { tr... | 157 |
java-test-3490 | java | What do server - side prepared statements because ? | truncation exceptions to be thrown | public void test Bug 18041 ( ) throws Exception { if ( version Meets Minimum ( NUM , NUM ) ) { create Table ( STRING , STRING ) ; Properties props = new Properties ( ) ; props . set Property ( STRING , STRING ) ; props . set Property ( STRING , STRING ) ; Connection trunc Conn = null ; Prepared Statement stm = null ; t... | public void testBug18041 ( ) throws Exception { if ( versionMeetsMinimum ( _NUM , _NUM ) ) { createTable ( STRING , STRING ) ; Properties props = new Properties ( ) ; props . setProperty ( STRING , STRING ) ; props . setProperty ( STRING , STRING ) ; Connection truncConn = null ; PreparedStatement stm = null ; try { tr... | 157 |
java-test-3491 | java | What is using to discover any case where it can not make naive assumptions about the number of chars , and how to index through them this ? | a caller | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3492 | java | What do a caller discover ? | any case where it can not make naive assumptions about the number of chars , and how to index through them | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3493 | java | What can it not make any case ? | naive assumptions about the number of chars | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3494 | java | What does not map 1 in straightforward left - > right ordering a case ? | char - > glyph | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3495 | java | Does char - > glyph map in straightforward left - > right ordering 1 a case ? | No | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3496 | java | Till when be these be one unicode character - > one glyph all all from a rendering perspective ? | still | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3497 | java | What does anything in the text trigger ? | a case where char - > glyph does not map 1 : 1 in straightforward left - > right ordering | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3498 | java | Can it make naive assumptions about the number of chars any case ? | No | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3499 | java | Why are scripts not treated as such ? | due to jdk implementations | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3500 | java | How be these be one unicode character - > one glyph all all still ? | from a rendering perspective | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3501 | java | Does char - > glyph map 1 a case in straightforward left - > right ordering ? | No | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3502 | java | What does char - > glyph not map 1 a case ? | in straightforward left - > right ordering | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3503 | java | What does char - > glyph not map in straightforward left - > right ordering a case ? | 1 | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3504 | java | What does this method accept ? | the ' char ' type | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3505 | java | Where does char - > glyph not map 1 in straightforward left - > right ordering ? | a case | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3506 | java | Does char - > glyph map 1 in straightforward left - > right ordering a case ? | No | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3507 | java | What is using this to discover any case where it can not make naive assumptions about the number of chars , and how to index through them ? | a caller | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3508 | java | Where can it not make naive assumptions about the number of chars ? | any case | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3509 | java | What triggers a case where char - > glyph does not map 1 : 1 in straightforward left - > right ordering ? | anything in the text | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3510 | java | What does not map 1 a case ? | char - > glyph | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3511 | java | What might require it ? | scripts | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3512 | java | What is a caller using to discover any case where it can not make naive assumptions about the number of chars , and how to index through them ? | this | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3513 | java | What is a caller using this ? | to discover any case where it can not make naive assumptions about the number of chars , and how to index through them | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3514 | java | What discovers any case where it can not make naive assumptions about the number of chars , and how to index through them ? | a caller | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3515 | java | What do it have in such a case ? | a ' true ' return | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3516 | java | What may it need if a caller is using this to discover any case where it can not make naive assumptions about the number of chars , and how to index through them if a caller is using this to discover any case where it can not make naive assumptions about the number of chars , and how to index through them ? | the option to have a ' true ' return in such a case | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3517 | java | What does not map in straightforward left - > right ordering 1 a case ? | char - > glyph | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3518 | java | Where do it have a ' true ' return ? | in such a case | public static boolean is Complex Text ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN LAYOUT CHARCODE ) { continue ; } else if ( is Non Simple Char ( chs [ i ] ) ) { return BOOL ; } } return BOOL ; } | public static boolean isComplexText ( char [ ] chs , int start , int limit ) { for ( int i = start ; i < limit ; i ++ ) { if ( chs [ i ] < MIN_LAYOUT_CHARCODE ) { continue ; } else if ( isNonSimpleChar ( chs [ i ] ) ) { return _BOOL ; } } return _BOOL ; } | 73 |
java-test-3519 | java | How do unexport finish ? | in vnxe | private void update FS Export ( File Share fs Obj , Db Client db Client , VN Xe Api Client api Client ) { logger . info ( STRING ) ; FS Export Map exports = fs Obj . get Fs Exports ( ) ; if ( exports == null ) { logger . info ( STRING ) ; return ; } if ( export Info != null ) { File Export export = export Info . get Fi... | private void updateFSExport ( FileShare fsObj , DbClient dbClient , VNXeApiClient apiClient ) { _logger . info ( STRING ) ; FSExportMap exports = fsObj . getFsExports ( ) ; if ( exports == null ) { _logger . info ( STRING ) ; return ; } if ( exportInfo != null ) { FileExport export = exportInfo . getFileExport ( ) ; Fi... | 138 |
java-test-3520 | java | When do fileshare update ? | after unexport finished in vnxe | private void update FS Export ( File Share fs Obj , Db Client db Client , VN Xe Api Client api Client ) { logger . info ( STRING ) ; FS Export Map exports = fs Obj . get Fs Exports ( ) ; if ( exports == null ) { logger . info ( STRING ) ; return ; } if ( export Info != null ) { File Export export = export Info . get Fi... | private void updateFSExport ( FileShare fsObj , DbClient dbClient , VNXeApiClient apiClient ) { _logger . info ( STRING ) ; FSExportMap exports = fsObj . getFsExports ( ) ; if ( exports == null ) { _logger . info ( STRING ) ; return ; } if ( exportInfo != null ) { FileExport export = exportInfo . getFileExport ( ) ; Fi... | 138 |
java-test-3521 | java | What does the code delete by name ? | a kernel | public void delete Kernel ( String name ) { Kernel kernel = get Kernel By Name ( name ) ; if ( kernel != null ) { kernel . dispose ( ) ; Integer old Size = Integer . value Of ( kernel Hash Table . size ( ) ) ; kernel Hash Table . remove ( name ) ; set Dirty And Fire Property Change ( KERNEL LISTLENGTH CHANGED PROPERTY ... | public void deleteKernel ( String name ) { Kernel kernel = getKernelByName ( name ) ; if ( kernel != null ) { kernel . dispose ( ) ; Integer oldSize = Integer . valueOf ( _kernelHashTable . size ( ) ) ; _kernelHashTable . remove ( name ) ; setDirtyAndFirePropertyChange ( KERNEL_LISTLENGTH_CHANGED_PROPERTY , oldSize , I... | 92 |
java-test-3528 | java | What does the code return for the context root ? | the help for the endpoint | @ GET @ Produces ( Media Type . APPLICATION JSON ) @ Path ( STRING ) public Map < String , List < ? extends Object > > help ( ) { Map < String , List < ? > > result = new Linked Hash Map < > ( ) ; List < Endpoint Help Dto > endpoints = describe Endpoints ( get Endpoints ( ) ) ; if ( endpoints != null && ! endpoints . i... | @ GET @ Produces ( MediaType . APPLICATION_JSON ) @ Path ( STRING ) public Map < String , List < ? extends Object > > help ( ) { Map < String , List < ? > > result = new LinkedHashMap < > ( ) ; List < EndpointHelpDto > endpoints = describeEndpoints ( getEndpoints ( ) ) ; if ( endpoints != null && ! endpoints . isEmpty ... | 136 |
java-test-3529 | java | For what purpose will it return the method help for the endpoint ? | for a specific endpoint | @ GET @ Produces ( Media Type . APPLICATION JSON ) @ Path ( STRING ) public Map < String , List < ? extends Object > > help ( ) { Map < String , List < ? > > result = new Linked Hash Map < > ( ) ; List < Endpoint Help Dto > endpoints = describe Endpoints ( get Endpoints ( ) ) ; if ( endpoints != null && ! endpoints . i... | @ GET @ Produces ( MediaType . APPLICATION_JSON ) @ Path ( STRING ) public Map < String , List < ? extends Object > > help ( ) { Map < String , List < ? > > result = new LinkedHashMap < > ( ) ; List < EndpointHelpDto > endpoints = describeEndpoints ( getEndpoints ( ) ) ; if ( endpoints != null && ! endpoints . isEmpty ... | 136 |
java-test-3530 | java | What will it return for a specific endpoint ? | the method help for the endpoint | @ GET @ Produces ( Media Type . APPLICATION JSON ) @ Path ( STRING ) public Map < String , List < ? extends Object > > help ( ) { Map < String , List < ? > > result = new Linked Hash Map < > ( ) ; List < Endpoint Help Dto > endpoints = describe Endpoints ( get Endpoints ( ) ) ; if ( endpoints != null && ! endpoints . i... | @ GET @ Produces ( MediaType . APPLICATION_JSON ) @ Path ( STRING ) public Map < String , List < ? extends Object > > help ( ) { Map < String , List < ? > > result = new LinkedHashMap < > ( ) ; List < EndpointHelpDto > endpoints = describeEndpoints ( getEndpoints ( ) ) ; if ( endpoints != null && ! endpoints . isEmpty ... | 136 |
java-test-3531 | java | What will it return for the context root for the context root ? | the endpoint help for all major endpoints | @ GET @ Produces ( Media Type . APPLICATION JSON ) @ Path ( STRING ) public Map < String , List < ? extends Object > > help ( ) { Map < String , List < ? > > result = new Linked Hash Map < > ( ) ; List < Endpoint Help Dto > endpoints = describe Endpoints ( get Endpoints ( ) ) ; if ( endpoints != null && ! endpoints . i... | @ GET @ Produces ( MediaType . APPLICATION_JSON ) @ Path ( STRING ) public Map < String , List < ? extends Object > > help ( ) { Map < String , List < ? > > result = new LinkedHashMap < > ( ) ; List < EndpointHelpDto > endpoints = describeEndpoints ( getEndpoints ( ) ) ; if ( endpoints != null && ! endpoints . isEmpty ... | 136 |
java-test-3532 | java | What evaluates at url ? | text in the interpreter | public static int eval ( String url , String text ) throws IO Exception { String return Value = null ; if ( url . starts With ( STRING ) ) { return Value = do Http ( url , text ) ; } else if ( url . starts With ( STRING ) ) { return Value = do Bsh ( url , text ) ; } else throw new IO Exception ( STRING + STRING ) ; try... | public static int eval ( String url , String text ) throws IOException { String returnValue = null ; if ( url . startsWith ( STRING ) ) { returnValue = doHttp ( url , text ) ; } else if ( url . startsWith ( STRING ) ) { returnValue = doBsh ( url , text ) ; } else throw new IOException ( STRING + STRING ) ; try { return... | 103 |
java-test-3533 | java | Where do text in the interpreter evaluate returning a possible integer return value ? | at url | public static int eval ( String url , String text ) throws IO Exception { String return Value = null ; if ( url . starts With ( STRING ) ) { return Value = do Http ( url , text ) ; } else if ( url . starts With ( STRING ) ) { return Value = do Bsh ( url , text ) ; } else throw new IO Exception ( STRING + STRING ) ; try... | public static int eval ( String url , String text ) throws IOException { String returnValue = null ; if ( url . startsWith ( STRING ) ) { returnValue = doHttp ( url , text ) ; } else if ( url . startsWith ( STRING ) ) { returnValue = doBsh ( url , text ) ; } else throw new IOException ( STRING + STRING ) ; try { return... | 103 |
java-test-3534 | java | How does this method convert the specified password into a key ? | in a deterministic manner | private byte [ ] convert Password To Key ( byte [ ] password ) { try { Message Digest md = Message Digest . get Instance ( STRING ) ; byte [ ] seed = md . digest ( password ) ; Secure Random random = Secure Random . get Instance ( STRING ) ; random . set Seed ( seed ) ; byte [ ] rawkey = new byte [ key Length ] ; rando... | private byte [ ] convertPasswordToKey ( byte [ ] password ) { try { MessageDigest md = MessageDigest . getInstance ( STRING ) ; byte [ ] seed = md . digest ( password ) ; SecureRandom random = SecureRandom . getInstance ( STRING ) ; random . setSeed ( seed ) ; byte [ ] rawkey = new byte [ keyLength ] ; random . nextByt... | 103 |
java-test-3535 | java | What does this method convert into a key in a deterministic manner ? | the specified password | private byte [ ] convert Password To Key ( byte [ ] password ) { try { Message Digest md = Message Digest . get Instance ( STRING ) ; byte [ ] seed = md . digest ( password ) ; Secure Random random = Secure Random . get Instance ( STRING ) ; random . set Seed ( seed ) ; byte [ ] rawkey = new byte [ key Length ] ; rando... | private byte [ ] convertPasswordToKey ( byte [ ] password ) { try { MessageDigest md = MessageDigest . getInstance ( STRING ) ; byte [ ] seed = md . digest ( password ) ; SecureRandom random = SecureRandom . getInstance ( STRING ) ; random . setSeed ( seed ) ; byte [ ] rawkey = new byte [ keyLength ] ; random . nextByt... | 103 |
java-test-3536 | java | What does the code create to the last move - to position ? | a straight - edge record ( i . e a straight line ) from the current drawing position | public void close ( ) { double dx = last Move To . x - pen . x ; double dy = last Move To . y - pen . y ; if ( convert To Twips ) { dx *= Swf Constants . TWIPS PER PIXEL ; dy *= Swf Constants . TWIPS PER PIXEL ; } pen . x = last Move To . x ; pen . y = last Move To . y ; if ( dx == NUM && dy == NUM ) { return ; } else ... | public void close ( ) { double dx = lastMoveTo . x - pen . x ; double dy = lastMoveTo . y - pen . y ; if ( convertToTwips ) { dx *= SwfConstants . TWIPS_PER_PIXEL ; dy *= SwfConstants . TWIPS_PER_PIXEL ; } pen . x = lastMoveTo . x ; pen . y = lastMoveTo . y ; if ( dx == _NUM && dy == _NUM ) { return ; } else { int intd... | 144 |
java-test-3537 | java | In which direction does the code create a straight - edge record ( i . e a straight line ) from the current drawing position ? | to the last move - to position | public void close ( ) { double dx = last Move To . x - pen . x ; double dy = last Move To . y - pen . y ; if ( convert To Twips ) { dx *= Swf Constants . TWIPS PER PIXEL ; dy *= Swf Constants . TWIPS PER PIXEL ; } pen . x = last Move To . x ; pen . y = last Move To . y ; if ( dx == NUM && dy == NUM ) { return ; } else ... | public void close ( ) { double dx = lastMoveTo . x - pen . x ; double dy = lastMoveTo . y - pen . y ; if ( convertToTwips ) { dx *= SwfConstants . TWIPS_PER_PIXEL ; dy *= SwfConstants . TWIPS_PER_PIXEL ; } pen . x = lastMoveTo . x ; pen . y = lastMoveTo . y ; if ( dx == _NUM && dy == _NUM ) { return ; } else { int intd... | 144 |
java-test-3539 | java | What does the code check ? | whether to release the hold partitions | private void check Release ( ) { List < Partition Reader > to Release = new Array List < Partition Reader > ( ) ; for ( Partition Reader p : hold ) { if ( ! p . is Taken ( ) ) { to Release . add ( p ) ; finish ( p ) ; } } hold . remove All ( to Release ) ; } | private void checkRelease ( ) { List < PartitionReader > toRelease = new ArrayList < PartitionReader > ( ) ; for ( PartitionReader p : hold ) { if ( ! p . isTaken ( ) ) { toRelease . add ( p ) ; finish ( p ) ; } } hold . removeAll ( toRelease ) ; } | 70 |
java-test-3540 | java | Why is test case commented normally ? | since it is only useful to print out the ddl statements recorded by the binlog during a mysql server initialization and startup | @ Ignore @ Test public void should Capture Query Event Data ( ) throws Exception { start Client ( null ) ; counters . consume All ( NUM , Time Unit . SECONDS ) ; List < Query Event Data > all Query Events = recorded Event Data ( Query Event Data . class , - NUM ) ; all Query Events . for Each ( null ) ; } | @ Ignore @ Test public void shouldCaptureQueryEventData ( ) throws Exception { startClient ( null ) ; counters . consumeAll ( _NUM , TimeUnit . SECONDS ) ; List < QueryEventData > allQueryEvents = recordedEventData ( QueryEventData . class , - _NUM ) ; allQueryEvents . forEach ( null ) ; } | 70 |
java-test-3541 | java | When did by the binlog record the ddl statements ? | during a mysql server initialization and startup | @ Ignore @ Test public void should Capture Query Event Data ( ) throws Exception { start Client ( null ) ; counters . consume All ( NUM , Time Unit . SECONDS ) ; List < Query Event Data > all Query Events = recorded Event Data ( Query Event Data . class , - NUM ) ; all Query Events . for Each ( null ) ; } | @ Ignore @ Test public void shouldCaptureQueryEventData ( ) throws Exception { startClient ( null ) ; counters . consumeAll ( _NUM , TimeUnit . SECONDS ) ; List < QueryEventData > allQueryEvents = recordedEventData ( QueryEventData . class , - _NUM ) ; allQueryEvents . forEach ( null ) ; } | 70 |
java-test-3544 | java | What does the method have ? | no declared exceptions | private static boolean usable ( Method m , Class c , Class base ) { int mods = m . get Modifiers ( ) ; return ( m . get Return Type ( ) == Proxy Trust Iterator . class && m . get Exception Types ( ) . length == NUM && ( mods & Modifier . STATIC ) == NUM && ( ( mods & ( Modifier . PUBLIC | Modifier . PROTECTED ) ) != NU... | private static boolean usable ( Method m , Class c , Class base ) { int mods = m . getModifiers ( ) ; return ( m . getReturnType ( ) == ProxyTrustIterator . class && m . getExceptionTypes ( ) . length == _NUM && ( mods & Modifier . STATIC ) == _NUM && ( ( mods & ( Modifier . PUBLIC | Modifier . PROTECTED ) ) != _NUM ||... | 107 |
java-test-3545 | java | What have the code assumes ? | that the texts do not have any common prefix or suffix | private Linked List < Diff > diff compute ( String text 1 , String text 2 , boolean checklines , long deadline ) { Linked List < Diff > diffs = new Linked List < Diff > ( ) ; if ( text 1 . length ( ) == NUM ) { diffs . add ( new Diff ( Operation . INSERT , text 2 ) ) ; return diffs ; } if ( text 2 . length ( ) == NUM )... | private LinkedList < Diff > diff_compute ( String text1 , String text2 , boolean checklines , long deadline ) { LinkedList < Diff > diffs = new LinkedList < Diff > ( ) ; if ( text1 . length ( ) == _NUM ) { diffs . add ( new Diff ( Operation . INSERT , text2 ) ) ; return diffs ; } if ( text2 . length ( ) == _NUM ) { dif... | 512 |
java-test-3546 | java | Do the texts have any common prefix or suffix ? | No | private Linked List < Diff > diff compute ( String text 1 , String text 2 , boolean checklines , long deadline ) { Linked List < Diff > diffs = new Linked List < Diff > ( ) ; if ( text 1 . length ( ) == NUM ) { diffs . add ( new Diff ( Operation . INSERT , text 2 ) ) ; return diffs ; } if ( text 2 . length ( ) == NUM )... | private LinkedList < Diff > diff_compute ( String text1 , String text2 , boolean checklines , long deadline ) { LinkedList < Diff > diffs = new LinkedList < Diff > ( ) ; if ( text1 . length ( ) == _NUM ) { diffs . add ( new Diff ( Operation . INSERT , text2 ) ) ; return diffs ; } if ( text2 . length ( ) == _NUM ) { dif... | 512 |
java-test-3547 | java | What does the code find ? | the differences between two texts | private Linked List < Diff > diff compute ( String text 1 , String text 2 , boolean checklines , long deadline ) { Linked List < Diff > diffs = new Linked List < Diff > ( ) ; if ( text 1 . length ( ) == NUM ) { diffs . add ( new Diff ( Operation . INSERT , text 2 ) ) ; return diffs ; } if ( text 2 . length ( ) == NUM )... | private LinkedList < Diff > diff_compute ( String text1 , String text2 , boolean checklines , long deadline ) { LinkedList < Diff > diffs = new LinkedList < Diff > ( ) ; if ( text1 . length ( ) == _NUM ) { diffs . add ( new Diff ( Operation . INSERT , text2 ) ) ; return diffs ; } if ( text2 . length ( ) == _NUM ) { dif... | 512 |
java-test-3548 | java | What do not have any common prefix or suffix ? | the texts | private Linked List < Diff > diff compute ( String text 1 , String text 2 , boolean checklines , long deadline ) { Linked List < Diff > diffs = new Linked List < Diff > ( ) ; if ( text 1 . length ( ) == NUM ) { diffs . add ( new Diff ( Operation . INSERT , text 2 ) ) ; return diffs ; } if ( text 2 . length ( ) == NUM )... | private LinkedList < Diff > diff_compute ( String text1 , String text2 , boolean checklines , long deadline ) { LinkedList < Diff > diffs = new LinkedList < Diff > ( ) ; if ( text1 . length ( ) == _NUM ) { diffs . add ( new Diff ( Operation . INSERT , text2 ) ) ; return diffs ; } if ( text2 . length ( ) == _NUM ) { dif... | 512 |
java-test-3549 | java | What do the texts not have ? | any common prefix or suffix | private Linked List < Diff > diff compute ( String text 1 , String text 2 , boolean checklines , long deadline ) { Linked List < Diff > diffs = new Linked List < Diff > ( ) ; if ( text 1 . length ( ) == NUM ) { diffs . add ( new Diff ( Operation . INSERT , text 2 ) ) ; return diffs ; } if ( text 2 . length ( ) == NUM )... | private LinkedList < Diff > diff_compute ( String text1 , String text2 , boolean checklines , long deadline ) { LinkedList < Diff > diffs = new LinkedList < Diff > ( ) ; if ( text1 . length ( ) == _NUM ) { diffs . add ( new Diff ( Operation . INSERT , text2 ) ) ; return diffs ; } if ( text2 . length ( ) == _NUM ) { dif... | 512 |
java-test-3550 | java | How does the given string representation of the date convert ? | using the format pattern | public static Date parse Date ( final String format , final String date String ) throws DSS Exception { try { final Simple Date Format sdf = new Simple Date Format ( format ) ; final Date date = sdf . parse ( date String ) ; return date ; } catch ( Parse Exception e ) { throw new DSS Exception ( e ) ; } } | public static Date parseDate ( final String format , final String dateString ) throws DSSException { try { final SimpleDateFormat sdf = new SimpleDateFormat ( format ) ; final Date date = sdf . parse ( dateString ) ; return date ; } catch ( ParseException e ) { throw new DSSException ( e ) ; } } | 68 |
java-test-3551 | java | How was a cleartext password obfuscated previously ? | using the xor scrambler | public static char [ ] de Obfuscate ( String e Password ) { if ( e Password == null ) return null ; byte [ ] bytes = null ; try { bytes = Simple Base 64 Encoder . decode ( e Password . substring ( xor Tag . length ( ) ) ) ; } catch ( Exception e ) { return null ; } for ( int i = NUM ; i < bytes . length ; i ++ ) { byte... | public static char [ ] deObfuscate ( String ePassword ) { if ( ePassword == null ) return null ; byte [ ] bytes = null ; try { bytes = SimpleBase64Encoder . decode ( ePassword . substring ( xorTag . length ( ) ) ) ; } catch ( Exception e ) { return null ; } for ( int i = _NUM ; i < bytes . length ; i ++ ) { bytes [ i ]... | 120 |
java-test-3552 | java | What does the code write this instance ? | to byte contiguous memory | @ Override public void write To Parcel ( Parcel dest , int flags ) { dest . write String ( m Name ) ; dest . write Long ( m Date ) ; dest . write Long ( m Cod ) ; final Weather weather = m Weathers . get ( NUM ) ; dest . write Long ( weather . get Id ( ) ) ; dest . write String ( weather . get Main ( ) ) ; dest . write... | @ Override public void writeToParcel ( Parcel dest , int flags ) { dest . writeString ( mName ) ; dest . writeLong ( mDate ) ; dest . writeLong ( mCod ) ; final Weather weather = mWeathers . get ( _NUM ) ; dest . writeLong ( weather . getId ( ) ) ; dest . writeString ( weather . getMain ( ) ) ; dest . writeString ( wea... | 219 |
java-test-3554 | java | For what purpose does the code put the specified builder queue ? | as a write message for the passed characteristic | private void queue Alarm ( Alarm alarm , Transaction Builder builder , Bluetooth Gatt Characteristic characteristic ) { Calendar calendar = alarm . get Alarm Cal ( ) ; int days Mask = NUM ; int max Alarms = NUM ; if ( alarm . get Index ( ) >= max Alarms ) { if ( alarm . is Enabled ( ) ) { GB . toast ( get Context ( ) ,... | private void queueAlarm ( Alarm alarm , TransactionBuilder builder , BluetoothGattCharacteristic characteristic ) { Calendar calendar = alarm . getAlarmCal ( ) ; int daysMask = _NUM ; int maxAlarms = _NUM ; if ( alarm . getIndex ( ) >= maxAlarms ) { if ( alarm . isEnabled ( ) ) { GB . toast ( getContext ( ) , STRING , ... | 185 |
java-test-3556 | java | How does the code read the page ? | with the given i d from this file | @ Override public P read Page ( int page ID ) { try { count Read ( ) ; long offset = ( ( long ) ( header . get Reserved Pages ( ) + page ID ) ) * ( long ) page Size ; byte [ ] buffer = new byte [ page Size ] ; file . seek ( offset ) ; file . read ( buffer ) ; return byte Array To Page ( buffer ) ; } catch ( IO Exceptio... | @ Override public P readPage ( int pageID ) { try { countRead ( ) ; long offset = ( ( long ) ( header . getReservedPages ( ) + pageID ) ) * ( long ) pageSize ; byte [ ] buffer = new byte [ pageSize ] ; file . seek ( offset ) ; file . read ( buffer ) ; return byteArrayToPage ( buffer ) ; } catch ( IOException e ) { thro... | 106 |
java-test-3559 | java | What does the code start if the current index is not already the latest ? | the online reindexer | public synchronized boolean start Reindexer ( String name , boolean force ) throws Reindexer Already Running Exception { Online Reindexer < ? , ? , ? > reindexer = reindexers . get ( name ) ; validate Reindexer Not Running ( reindexer ) ; if ( force || ! is Current Index Version Latest ( name , reindexer ) ) { reindexe... | public synchronized boolean startReindexer ( String name , boolean force ) throws ReindexerAlreadyRunningException { OnlineReindexer < ? , ? , ? > reindexer = reindexers . get ( name ) ; validateReindexerNotRunning ( reindexer ) ; if ( force || ! isCurrentIndexVersionLatest ( name , reindexer ) ) { reindexer . start ( ... | 75 |
java-test-3565 | java | What does the code instantiate ? | the specific payload coordinator used by the specified index | public static < PAYLOAD > Term Payload Coordinator < PAYLOAD > create ( Index i ) { String clz Str = i . get Index Property ( PAYLOAD COORDINATOR CLASS KEY , STRING ) ; try { @ Suppress Warnings ( STRING ) Class < Term Payload Coordinator < PAYLOAD > > clz = ( Class < Term Payload Coordinator < PAYLOAD > > ) Class . fo... | public static < PAYLOAD > TermPayloadCoordinator < PAYLOAD > create ( Index i ) { String clzStr = i . getIndexProperty ( PAYLOAD_COORDINATOR_CLASS_KEY , STRING ) ; try { @ SuppressWarnings ( STRING ) Class < TermPayloadCoordinator < PAYLOAD > > clz = ( Class < TermPayloadCoordinator < PAYLOAD > > ) Class . forName ( cl... | 117 |
java-test-3566 | java | When does npe throw ? | after possibly adding some elements | public void test Add All 3 ( ) { try { Linked Blocking Queue q = new Linked Blocking Queue ( SIZE ) ; Integer [ ] ints = new Integer [ SIZE ] ; for ( int i = NUM ; i < SIZE - NUM ; ++ i ) ints [ i ] = new Integer ( i ) ; q . add All ( Arrays . as List ( ints ) ) ; should Throw ( ) ; } catch ( Null Pointer Exception suc... | public void testAddAll3 ( ) { try { LinkedBlockingQueue q = new LinkedBlockingQueue ( SIZE ) ; Integer [ ] ints = new Integer [ SIZE ] ; for ( int i = _NUM ; i < SIZE - _NUM ; ++ i ) ints [ i ] = new Integer ( i ) ; q . addAll ( Arrays . asList ( ints ) ) ; shouldThrow ( ) ; } catch ( NullPointerException success ) { }... | 92 |
java-test-3569 | java | What does the code perform with debugging output ? | a parse | public void debug parse ( ) throws java . lang . Exception { int act ; symbol lhs sym ; short handle size , lhs sym num ; production tab = production table ( ) ; action tab = action table ( ) ; reduce tab = reduce table ( ) ; debug message ( STRING ) ; init actions ( ) ; user init ( ) ; cur token = scan ( ) ; debug mes... | public void debug_parse ( ) throws java . lang . Exception { int act ; symbol lhs_sym ; short handle_size , lhs_sym_num ; production_tab = production_table ( ) ; action_tab = action_table ( ) ; reduce_tab = reduce_table ( ) ; debug_message ( STRING ) ; init_actions ( ) ; user_init ( ) ; cur_token = scan ( ) ; debug_mes... | 399 |
java-test-3576 | java | What did a use ? | format = flowed " | public static String deflow ( String text , boolean del Sp ) { String [ ] lines = text . split ( STRING , - NUM ) ; String Buffer result = null ; String Buffer result Line = new String Buffer ( ) ; int result Line Quote Depth = NUM ; boolean result Line Flowed = BOOL ; for ( int i = NUM ; i <= lines . length ; i ++ ) {... | public static String deflow ( String text , boolean delSp ) { String [ ] lines = text . split ( STRING , - _NUM ) ; StringBuffer result = null ; StringBuffer resultLine = new StringBuffer ( ) ; int resultLineQuoteDepth = _NUM ; boolean resultLineFlowed = _BOOL ; for ( int i = _NUM ; i <= lines . length ; i ++ ) { Strin... | 496 |
java-test-3577 | java | How did a text wrap previously ? | using " format = flowed " | public static String deflow ( String text , boolean del Sp ) { String [ ] lines = text . split ( STRING , - NUM ) ; String Buffer result = null ; String Buffer result Line = new String Buffer ( ) ; int result Line Quote Depth = NUM ; boolean result Line Flowed = BOOL ; for ( int i = NUM ; i <= lines . length ; i ++ ) {... | public static String deflow ( String text , boolean delSp ) { String [ ] lines = text . split ( STRING , - _NUM ) ; StringBuffer result = null ; StringBuffer resultLine = new StringBuffer ( ) ; int resultLineQuoteDepth = _NUM ; boolean resultLineFlowed = _BOOL ; for ( int i = _NUM ; i <= lines . length ; i ++ ) { Strin... | 496 |
java-test-3581 | java | What does the code compare ? | a string . case sensitive | private static boolean compare String Case ( final String val , final int comparator , final String attr ) { final String value = comparator == APPROX ? strip Whitespaces ( val ) : val ; final String attribute = comparator == APPROX ? strip Whitespaces ( attr ) : attr ; switch ( comparator ) { case APPROX : case EQUALS... | private static boolean compareStringCase ( final String val , final int comparator , final String attr ) { final String value = comparator == APPROX ? stripWhitespaces ( val ) : val ; final String attribute = comparator == APPROX ? stripWhitespaces ( attr ) : attr ; switch ( comparator ) { case APPROX : case EQUALS : r... | 175 |
java-test-3582 | java | What does the code remove from this map if present ? | the mapping for this key | @ Override public Object remove ( Object key ) { Entry tab [ ] = table ; if ( key != null ) { int hash = System . identity Hash Code ( key ) ; int index = ( hash & NUM ) % tab . length ; for ( Entry e = tab [ index ] , prev = null ; e != null ; prev = e , e = e . next ) { if ( ( e . hash == hash ) && key == e . key ) {... | @ Override public Object remove ( Object key ) { Entry tab [ ] = table ; if ( key != null ) { int hash = System . identityHashCode ( key ) ; int index = ( hash & _NUM ) % tab . length ; for ( Entry e = tab [ index ] , prev = null ; e != null ; prev = e , e = e . next ) { if ( ( e . hash == hash ) && key == e . key ) { ... | 243 |
java-test-3583 | java | What does the code create ? | a new lexical analyzer for the specified sql statement | public Lexer ( String s ) { init Keywords ( ) ; tok = new Stream Tokenizer ( new String Reader ( s ) ) ; tok . word Chars ( STRING , STRING ) ; tok . ordinary Char ( STRING ) ; tok . lower Case Mode ( BOOL ) ; next Token ( ) ; } | public Lexer ( String s ) { initKeywords ( ) ; tok = new StreamTokenizer ( new StringReader ( s ) ) ; tok . wordChars ( STRING , STRING ) ; tok . ordinaryChar ( STRING ) ; tok . lowerCaseMode ( _BOOL ) ; nextToken ( ) ; } | 59 |
java-test-3584 | java | Where do xpos be past the track ? | at the left or the right | public int value For X Position ( int x Pos ) { int value ; int min Value = slider . get Minimum ( ) ; int max Value = slider . get Maximum ( ) ; int track Left = track Rect . x + thumb Rect . width / NUM + track Border ; int track Right = track Rect . x + track Rect . width - thumb Rect . width / NUM - track Border ; ... | public int valueForXPosition ( int xPos ) { int value ; int minValue = slider . getMinimum ( ) ; int maxValue = slider . getMaximum ( ) ; int trackLeft = trackRect . x + thumbRect . width / _NUM + trackBorder ; int trackRight = trackRect . x + trackRect . width - thumbRect . width / _NUM - trackBorder ; int trackLength... | 232 |
java-test-3585 | java | What is a value give ? | an x position | public int value For X Position ( int x Pos ) { int value ; int min Value = slider . get Minimum ( ) ; int max Value = slider . get Maximum ( ) ; int track Left = track Rect . x + thumb Rect . width / NUM + track Border ; int track Right = track Rect . x + track Rect . width - thumb Rect . width / NUM - track Border ; ... | public int valueForXPosition ( int xPos ) { int value ; int minValue = slider . getMinimum ( ) ; int maxValue = slider . getMaximum ( ) ; int trackLeft = trackRect . x + thumbRect . width / _NUM + trackBorder ; int trackRight = trackRect . x + trackRect . width - thumbRect . width / _NUM - trackBorder ; int trackLength... | 232 |
java-test-3586 | java | What is past the track at the left or the right ? | xpos | public int value For X Position ( int x Pos ) { int value ; int min Value = slider . get Minimum ( ) ; int max Value = slider . get Maximum ( ) ; int track Left = track Rect . x + thumb Rect . width / NUM + track Border ; int track Right = track Rect . x + track Rect . width - thumb Rect . width / NUM - track Border ; ... | public int valueForXPosition ( int xPos ) { int value ; int minValue = slider . getMinimum ( ) ; int maxValue = slider . getMaximum ( ) ; int trackLeft = trackRect . x + thumbRect . width / _NUM + trackBorder ; int trackRight = trackRect . x + trackRect . width - thumbRect . width / _NUM - trackBorder ; int trackLength... | 232 |
java-test-3587 | java | What does this implementation reset ? | the edges control points | public Object flip Edge ( Object edge ) { if ( edge != null && alternate Edge Style != null ) { model . begin Update ( ) ; try { String style = model . get Style ( edge ) ; if ( style == null || style . length ( ) == NUM ) { model . set Style ( edge , alternate Edge Style ) ; } else { model . set Style ( edge , null ) ... | public Object flipEdge ( Object edge ) { if ( edge != null && alternateEdgeStyle != null ) { model . beginUpdate ( ) ; try { String style = model . getStyle ( edge ) ; if ( style == null || style . length ( ) == _NUM ) { model . setStyle ( edge , alternateEdgeStyle ) ; } else { model . setStyle ( edge , null ) ; } rese... | 125 |
java-test-3588 | java | When did the code call ? | when the main control point of the edge is double - clicked | public Object flip Edge ( Object edge ) { if ( edge != null && alternate Edge Style != null ) { model . begin Update ( ) ; try { String style = model . get Style ( edge ) ; if ( style == null || style . length ( ) == NUM ) { model . set Style ( edge , alternate Edge Style ) ; } else { model . set Style ( edge , null ) ... | public Object flipEdge ( Object edge ) { if ( edge != null && alternateEdgeStyle != null ) { model . beginUpdate ( ) ; try { String style = model . getStyle ( edge ) ; if ( style == null || style . length ( ) == _NUM ) { model . setStyle ( edge , alternateEdgeStyle ) ; } else { model . setStyle ( edge , null ) ; } rese... | 125 |
java-test-3592 | java | What does the code run writing the relevant audit data to the db ? | the log module | public void run ( ) throws Serialization Exception , SQL Exception { final String query = String . format ( STRING + STRING + STRING + STRING + STRING + STRING + STRING + STRING , table Name ) ; Map < String , Map Red Stats > stats Per Stage = session State Lite . get Map Red Stats ( ) ; for ( String stage : stats Per ... | public void run ( ) throws SerializationException , SQLException { final String query = String . format ( STRING + STRING + STRING + STRING + STRING + STRING + STRING + STRING , tableName ) ; Map < String , MapRedStats > statsPerStage = sessionStateLite . getMapRedStats ( ) ; for ( String stage : statsPerStage . keySet... | 220 |
java-test-3593 | java | What does the code write to the db ? | the relevant audit data | public void run ( ) throws Serialization Exception , SQL Exception { final String query = String . format ( STRING + STRING + STRING + STRING + STRING + STRING + STRING + STRING , table Name ) ; Map < String , Map Red Stats > stats Per Stage = session State Lite . get Map Red Stats ( ) ; for ( String stage : stats Per ... | public void run ( ) throws SerializationException , SQLException { final String query = String . format ( STRING + STRING + STRING + STRING + STRING + STRING + STRING + STRING , tableName ) ; Map < String , MapRedStats > statsPerStage = sessionStateLite . getMapRedStats ( ) ; for ( String stage : statsPerStage . keySet... | 220 |
java-test-3596 | java | What does the code convert to a matrix ? | an bufferedimage | public IND Array as Matrix ( Buffered Image image ) { if ( channels == NUM ) { return to Bgr ( image ) ; } else { image = scaling If Need ( image , BOOL ) ; int w = image . get Width ( ) ; int h = image . get Height ( ) ; IND Array ret = Nd 4 j . create ( h , w ) ; for ( int i = NUM ; i < h ; i ++ ) { for ( int j = NUM... | public INDArray asMatrix ( BufferedImage image ) { if ( channels == _NUM ) { return toBgr ( image ) ; } else { image = scalingIfNeed ( image , _BOOL ) ; int w = image . getWidth ( ) ; int h = image . getHeight ( ) ; INDArray ret = Nd4j . create ( h , w ) ; for ( int i = _NUM ; i < h ; i ++ ) { for ( int j = _NUM ; j < ... | 137 |
java-test-3597 | java | What does the code draw ? | a marker for the range axis | @ Override public void draw Range Marker ( Graphics 2 D g2 , Category Plot plot , Value Axis axis , Marker marker , Rectangle 2 D data Area ) { if ( marker instanceof Value Marker ) { Value Marker vm = ( Value Marker ) marker ; double value = vm . get Value ( ) ; Range range = axis . get Range ( ) ; if ( ! range . cont... | @ Override public void drawRangeMarker ( Graphics2D g2 , CategoryPlot plot , ValueAxis axis , Marker marker , Rectangle2D dataArea ) { if ( marker instanceof ValueMarker ) { ValueMarker vm = ( ValueMarker ) marker ; double value = vm . getValue ( ) ; Range range = axis . getRange ( ) ; if ( ! range . contains ( value )... | 1,529 |
java-test-3622 | java | What does the code add to the query ? | all available table columns | private void add All Columns ( ) throws SQL Exception { Database Meta Data meta Data = get Database Meta Data ( ) ; List < String > columns = new Array List < > ( ) ; try ( Result Set rs = meta Data . get Columns ( null , null , normalize Object Name ( statement Model . get Table Name ( ) ) , null ) ) { while ( rs . ne... | private void addAllColumns ( ) throws SQLException { DatabaseMetaData metaData = getDatabaseMetaData ( ) ; List < String > columns = new ArrayList < > ( ) ; try ( ResultSet rs = metaData . getColumns ( null , null , normalizeObjectName ( statementModel . getTableName ( ) ) , null ) ) { while ( rs . next ( ) ) { columns... | 125 |
java-test-3623 | java | What does the code add ? | a limited mitre join connecting the two reflex offset segments | private void add Limited Mitre Join ( Line Segment offset 0 , Line Segment offset 1 , double distance , double mitre Limit ) { Coordinate base Pt = seg 0 . p1 ; double ang 0 = Angle . angle ( base Pt , seg 0 . p0 ) ; double ang 1 = Angle . angle ( base Pt , seg 1 . p1 ) ; double ang Diff = Angle . angle Between Oriente... | private void addLimitedMitreJoin ( LineSegment offset0 , LineSegment offset1 , double distance , double mitreLimit ) { Coordinate basePt = seg0 . p1 ; double ang0 = Angle . angle ( basePt , seg0 . p0 ) ; double ang1 = Angle . angle ( basePt , seg1 . p1 ) ; double angDiff = Angle . angleBetweenOriented ( seg0 . p0 , bas... | 353 |
java-test-3627 | java | How does a socks5 instance construct ? | without any parameter | private void init ( ) { acceptable Methods = new Array List < > ( ) ; acceptable Methods . add ( new No Authentication Required Method ( ) ) ; acceptable Methods . add ( new Gss Api Method ( ) ) ; acceptable Methods . add ( new Username Password Method ( ) ) ; } | private void init ( ) { acceptableMethods = new ArrayList < > ( ) ; acceptableMethods . add ( new NoAuthenticationRequiredMethod ( ) ) ; acceptableMethods . add ( new GssApiMethod ( ) ) ; acceptableMethods . add ( new UsernamePasswordMethod ( ) ) ; } | 58 |
java-test-3628 | java | What do we adjust ? | the edge buffer | private static Boolean find Convex Polygon ( final Planet Model planet Model , final Edge current Edge , final Geo Composite Polygon rval , final Edge Buffer edge Buffer , final List < Geo Polygon > holes , final Geo Point test Point ) { final Set < Edge > included Edges = new Hash Set < > ( ) ; included Edges . add ( ... | private static Boolean findConvexPolygon ( final PlanetModel planetModel , final Edge currentEdge , final GeoCompositePolygon rval , final EdgeBuffer edgeBuffer , final List < GeoPolygon > holes , final GeoPoint testPoint ) { final Set < Edge > includedEdges = new HashSet < > ( ) ; includedEdges . add ( currentEdge ) ;... | 1,528 |
java-test-3630 | java | What does the code locate in one of the default installation directories ? | a chrome installation | public static String locate Chrome ( ) { String os = Platform . get OS ( ) ; List < File > locations To Check = new Array List < File > ( ) ; if ( Platform . OS WIN 32 . equals ( os ) ) { String [ ] env Variables = new String [ ] { STRING , STRING , STRING , STRING , STRING , STRING } ; String [ ] appended Paths = new ... | public static String locateChrome ( ) { String os = Platform . getOS ( ) ; List < File > locationsToCheck = new ArrayList < File > ( ) ; if ( Platform . OS_WIN32 . equals ( os ) ) { String [ ] envVariables = new String [ ] { STRING , STRING , STRING , STRING , STRING , STRING } ; String [ ] appendedPaths = new String [... | 396 |
java-test-3631 | java | Where does the code locate a chrome installation ? | in one of the default installation directories | public static String locate Chrome ( ) { String os = Platform . get OS ( ) ; List < File > locations To Check = new Array List < File > ( ) ; if ( Platform . OS WIN 32 . equals ( os ) ) { String [ ] env Variables = new String [ ] { STRING , STRING , STRING , STRING , STRING , STRING } ; String [ ] appended Paths = new ... | public static String locateChrome ( ) { String os = Platform . getOS ( ) ; List < File > locationsToCheck = new ArrayList < File > ( ) ; if ( Platform . OS_WIN32 . equals ( os ) ) { String [ ] envVariables = new String [ ] { STRING , STRING , STRING , STRING , STRING , STRING } ; String [ ] appendedPaths = new String [... | 396 |
java-test-3632 | java | What require notification from a partitioned region ? | any cache components | protected boolean requires Notification From PR ( Partitioned Region r ) { synchronized ( Gem Fire Cache Impl . class ) { boolean has Serial Senders = has Serial Senders ( r ) ; boolean result = has Serial Senders ; if ( ! result ) { Iterator all Cache Servers Iterator = all Cache Servers . iterator ( ) ; while ( all C... | protected boolean requiresNotificationFromPR ( PartitionedRegion r ) { synchronized ( GemFireCacheImpl . class ) { boolean hasSerialSenders = hasSerialSenders ( r ) ; boolean result = hasSerialSenders ; if ( ! result ) { Iterator allCacheServersIterator = allCacheServers . iterator ( ) ; while ( allCacheServersIterator... | 120 |
java-test-3633 | java | Where must a pr do the messaging ? | on each put / destroy / invalidate operation | protected boolean requires Notification From PR ( Partitioned Region r ) { synchronized ( Gem Fire Cache Impl . class ) { boolean has Serial Senders = has Serial Senders ( r ) ; boolean result = has Serial Senders ; if ( ! result ) { Iterator all Cache Servers Iterator = all Cache Servers . iterator ( ) ; while ( all C... | protected boolean requiresNotificationFromPR ( PartitionedRegion r ) { synchronized ( GemFireCacheImpl . class ) { boolean hasSerialSenders = hasSerialSenders ( r ) ; boolean result = hasSerialSenders ; if ( ! result ) { Iterator allCacheServersIterator = allCacheServers . iterator ( ) ; while ( allCacheServersIterator... | 120 |
java-test-3634 | java | What does this method change ? | the point which is passed as a parameter | protected Point 2 D . Double constrain Point ( Point 2 D . Double p , Translation Direction dir ) { Point 2 D . Double p0 = constrain Point ( ( Point 2 D . Double ) p . clone ( ) ) ; switch ( dir ) { case NORTH : case NORTH WEST : case NORTH EAST : if ( p0 . y < p . y ) { p . y = p0 . y ; } else if ( p0 . y > p . y ) {... | protected Point2D . Double constrainPoint ( Point2D . Double p , TranslationDirection dir ) { Point2D . Double p0 = constrainPoint ( ( Point2D . Double ) p . clone ( ) ) ; switch ( dir ) { case NORTH : case NORTH_WEST : case NORTH_EAST : if ( p0 . y < p . y ) { p . y = p0 . y ; } else if ( p0 . y > p . y ) { p . y = p0... | 285 |
java-test-3635 | java | What does the code constrain ? | the placement of a point towards a direction | protected Point 2 D . Double constrain Point ( Point 2 D . Double p , Translation Direction dir ) { Point 2 D . Double p0 = constrain Point ( ( Point 2 D . Double ) p . clone ( ) ) ; switch ( dir ) { case NORTH : case NORTH WEST : case NORTH EAST : if ( p0 . y < p . y ) { p . y = p0 . y ; } else if ( p0 . y > p . y ) {... | protected Point2D . Double constrainPoint ( Point2D . Double p , TranslationDirection dir ) { Point2D . Double p0 = constrainPoint ( ( Point2D . Double ) p . clone ( ) ) ; switch ( dir ) { case NORTH : case NORTH_WEST : case NORTH_EAST : if ( p0 . y < p . y ) { p . y = p0 . y ; } else if ( p0 . y > p . y ) { p . y = p0... | 285 |
java-test-3636 | java | How do the input stream advance always ? | by the right amount | int escape ( ) throws RE Syntax Exception { if ( pattern . char At ( idx ) != STRING ) { internal Error ( ) ; } if ( idx + NUM == len ) { syntax Error ( STRING ) ; } idx += NUM ; char escape Char = pattern . char At ( idx - NUM ) ; switch ( escape Char ) { case RE . E BOUND : case RE . E NBOUND : return ESC COMPLEX ; c... | int escape ( ) throws RESyntaxException { if ( pattern . charAt ( idx ) != STRING ) { internalError ( ) ; } if ( idx + _NUM == len ) { syntaxError ( STRING ) ; } idx += _NUM ; char escapeChar = pattern . charAt ( idx - _NUM ) ; switch ( escapeChar ) { case RE . E_BOUND : case RE . E_NBOUND : return ESC_COMPLEX ; case R... | 463 |
java-test-3637 | java | What does this code understand ? | the subtle difference between an octal escape and a backref | int escape ( ) throws RE Syntax Exception { if ( pattern . char At ( idx ) != STRING ) { internal Error ( ) ; } if ( idx + NUM == len ) { syntax Error ( STRING ) ; } idx += NUM ; char escape Char = pattern . char At ( idx - NUM ) ; switch ( escape Char ) { case RE . E BOUND : case RE . E NBOUND : return ESC COMPLEX ; c... | int escape ( ) throws RESyntaxException { if ( pattern . charAt ( idx ) != STRING ) { internalError ( ) ; } if ( idx + _NUM == len ) { syntaxError ( STRING ) ; } idx += _NUM ; char escapeChar = pattern . charAt ( idx - _NUM ) ; switch ( escapeChar ) { case RE . E_BOUND : case RE . E_NBOUND : return ESC_COMPLEX ; case R... | 463 |
java-test-3638 | java | What can you access by looking at pattern [ idx - 1 ] ? | the type of esc_class or esc_complex or esc_backref | int escape ( ) throws RE Syntax Exception { if ( pattern . char At ( idx ) != STRING ) { internal Error ( ) ; } if ( idx + NUM == len ) { syntax Error ( STRING ) ; } idx += NUM ; char escape Char = pattern . char At ( idx - NUM ) ; switch ( escape Char ) { case RE . E BOUND : case RE . E NBOUND : return ESC COMPLEX ; c... | int escape ( ) throws RESyntaxException { if ( pattern . charAt ( idx ) != STRING ) { internalError ( ) ; } if ( idx + _NUM == len ) { syntaxError ( STRING ) ; } idx += _NUM ; char escapeChar = pattern . charAt ( idx - _NUM ) ; switch ( escapeChar ) { case RE . E_BOUND : case RE . E_NBOUND : return ESC_COMPLEX ; case R... | 463 |
java-test-3639 | java | How can you access the type of esc_class or esc_complex or esc_backref ? | by looking at pattern [ idx - 1 ] | int escape ( ) throws RE Syntax Exception { if ( pattern . char At ( idx ) != STRING ) { internal Error ( ) ; } if ( idx + NUM == len ) { syntax Error ( STRING ) ; } idx += NUM ; char escape Char = pattern . char At ( idx - NUM ) ; switch ( escape Char ) { case RE . E BOUND : case RE . E NBOUND : return ESC COMPLEX ; c... | int escape ( ) throws RESyntaxException { if ( pattern . charAt ( idx ) != STRING ) { internalError ( ) ; } if ( idx + _NUM == len ) { syntaxError ( STRING ) ; } idx += _NUM ; char escapeChar = pattern . charAt ( idx - _NUM ) ; switch ( escapeChar ) { case RE . E_BOUND : case RE . E_NBOUND : return ESC_COMPLEX ; case R... | 463 |
java-test-3640 | java | What is representing the supplied file ? | a new database row | public synchronized void create File ( JDBC Sequential File file ) throws SQL Exception { try { connection . set Auto Commit ( BOOL ) ; create File . set String ( NUM , file . get File Name ( ) ) ; create File . set String ( NUM , file . get Extension ( ) ) ; create File . set Bytes ( NUM , new byte [ NUM ] ) ; create ... | public synchronized void createFile ( JDBCSequentialFile file ) throws SQLException { try { connection . setAutoCommit ( _BOOL ) ; createFile . setString ( _NUM , file . getFileName ( ) ) ; createFile . setString ( _NUM , file . getExtension ( ) ) ; createFile . setBytes ( _NUM , new byte [ _NUM ] ) ; createFile . exec... | 144 |
java-test-3641 | java | What does the code create ? | a new database row representing the supplied file | public synchronized void create File ( JDBC Sequential File file ) throws SQL Exception { try { connection . set Auto Commit ( BOOL ) ; create File . set String ( NUM , file . get File Name ( ) ) ; create File . set String ( NUM , file . get Extension ( ) ) ; create File . set Bytes ( NUM , new byte [ NUM ] ) ; create ... | public synchronized void createFile ( JDBCSequentialFile file ) throws SQLException { try { connection . setAutoCommit ( _BOOL ) ; createFile . setString ( _NUM , file . getFileName ( ) ) ; createFile . setString ( _NUM , file . getExtension ( ) ) ; createFile . setBytes ( _NUM , new byte [ _NUM ] ) ; createFile . exec... | 144 |
java-test-3642 | java | What do a new database row represent ? | the supplied file | public synchronized void create File ( JDBC Sequential File file ) throws SQL Exception { try { connection . set Auto Commit ( BOOL ) ; create File . set String ( NUM , file . get File Name ( ) ) ; create File . set String ( NUM , file . get Extension ( ) ) ; create File . set Bytes ( NUM , new byte [ NUM ] ) ; create ... | public synchronized void createFile ( JDBCSequentialFile file ) throws SQLException { try { connection . setAutoCommit ( _BOOL ) ; createFile . setString ( _NUM , file . getFileName ( ) ) ; createFile . setString ( _NUM , file . getExtension ( ) ) ; createFile . setBytes ( _NUM , new byte [ _NUM ] ) ; createFile . exec... | 144 |
java-test-3643 | java | Where has checks given class if passed throwable ? | in one of the suppressed exceptions | public static boolean has Suppressed ( @ Nullable Throwable t , @ Nullable Class < ? extends Throwable > cls ) { if ( t == null || cls == null ) return BOOL ; if ( t . get Suppressed ( ) != null ) { for ( Throwable th : t . get Suppressed ( ) ) { if ( cls . is Assignable From ( th . get Class ( ) ) ) return BOOL ; if (... | public static boolean hasSuppressed ( @ Nullable Throwable t , @ Nullable Class < ? extends Throwable > cls ) { if ( t == null || cls == null ) return _BOOL ; if ( t . getSuppressed ( ) != null ) { for ( Throwable th : t . getSuppressed ( ) ) { if ( cls . isAssignableFrom ( th . getClass ( ) ) ) return _BOOL ; if ( has... | 98 |
java-test-3645 | java | Where is this used usually ? | in - sim | static void load Directory ( File file , Module Candidate candidate ) throws IO Exception { File [ ] files = file . list Files ( ) ; if ( files != null ) for ( File f : files ) load Sub Directory ( file , f , candidate ) ; } | static void loadDirectory ( File file , ModuleCandidate candidate ) throws IOException { File [ ] files = file . listFiles ( ) ; if ( files != null ) for ( File f : files ) loadSubDirectory ( file , f , candidate ) ; } | 53 |
java-test-3646 | java | What does the code deserialize ? | the null separated list | public void deserialize Funnel ( List < Object > serialized Funnel ) { Set < Object > funnel Step Accumulator = new Hash Set < > ( ) ; for ( Object e : serialized Funnel ) { if ( e != null ) { funnel Step Accumulator . add ( e ) ; } else { funnel Steps . add ( new Hash Set < > ( funnel Step Accumulator ) ) ; funnel Ste... | public void deserializeFunnel ( List < Object > serializedFunnel ) { Set < Object > funnelStepAccumulator = new HashSet < > ( ) ; for ( Object e : serializedFunnel ) { if ( e != null ) { funnelStepAccumulator . add ( e ) ; } else { funnelSteps . add ( new HashSet < > ( funnelStepAccumulator ) ) ; funnelStepAccumulator ... | 85 |
java-test-3650 | java | What does the code ask the user ? | whether to save the file | private boolean request Save ( ) { String msg = STRING ; int n = J Option Pane . show Confirm Dialog ( frame , msg ) ; if ( n == NUM ) { save Domain ( ) ; return BOOL ; } else if ( n == NUM ) { editor Tab . reread File ( ) ; set Saved Flag ( BOOL ) ; return BOOL ; } return BOOL ; } | private boolean requestSave ( ) { String msg = STRING ; int n = JOptionPane . showConfirmDialog ( frame , msg ) ; if ( n == _NUM ) { saveDomain ( ) ; return _BOOL ; } else if ( n == _NUM ) { editorTab . rereadFile ( ) ; setSavedFlag ( _BOOL ) ; return _BOOL ; } return _BOOL ; } | 75 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.