id stringlengths 11 15 | language stringclasses 1
value | 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-192 | java | Is this method called to clear any actions that have not been completed ? | Yes | protected synchronized void clear Remaining Actions ( ) { for ( int i = active Action List . size ( ) - NUM ; i >= NUM ; i -- ) { Transit Section Action tsa = active Action List . get ( i ) ; Thread t = tsa . get Waiting Thread ( ) ; if ( t != null ) { t . interrupt ( ) ; } if ( tsa . get Waiting For Sensor ( ) ) { tsa... | protected synchronized void clearRemainingActions ( ) { for ( int i = _activeActionList . size ( ) - _NUM ; i >= _NUM ; i -- ) { TransitSectionAction tsa = _activeActionList . get ( i ) ; Thread t = tsa . getWaitingThread ( ) ; if ( t != null ) { t . interrupt ( ) ; } if ( tsa . getWaitingForSensor ( ) ) { tsa . dispos... | 109 |
java-test-193 | java | Where do a sequence number add ? | at the rear of the given fileext | private static String gen Class ID ( String file Ext , int reg Level ) { boolean is Cls ID Exist = BOOL ; String appendix , tem Cls ID , tem Cls ID Key , tem File Ext ; tem File Ext = file Ext . trim ( ) ; if ( tem File Ext . char At ( NUM ) == STRING ) { tem File Ext = tem File Ext . substring ( NUM ) ; } int i = NUM ... | private static String genClassID ( String fileExt , int regLevel ) { boolean isClsIDExist = _BOOL ; String appendix , temClsID , temClsIDKey , temFileExt ; temFileExt = fileExt . trim ( ) ; if ( temFileExt . charAt ( _NUM ) == STRING ) { temFileExt = temFileExt . substring ( _NUM ) ; } int i = _NUM ; while ( ( isClsIDE... | 206 |
java-test-194 | java | Do a sequence number add at the rear of the given fileext ? | Yes | private static String gen Class ID ( String file Ext , int reg Level ) { boolean is Cls ID Exist = BOOL ; String appendix , tem Cls ID , tem Cls ID Key , tem File Ext ; tem File Ext = file Ext . trim ( ) ; if ( tem File Ext . char At ( NUM ) == STRING ) { tem File Ext = tem File Ext . substring ( NUM ) ; } int i = NUM ... | private static String genClassID ( String fileExt , int regLevel ) { boolean isClsIDExist = _BOOL ; String appendix , temClsID , temClsIDKey , temFileExt ; temFileExt = fileExt . trim ( ) ; if ( temFileExt . charAt ( _NUM ) == STRING ) { temFileExt = temFileExt . substring ( _NUM ) ; } int i = _NUM ; while ( ( isClsIDE... | 206 |
java-test-195 | java | How does a new class i d name based on the given fileext name construct ? | by adding a sequence number at the rear of the given fileext | private static String gen Class ID ( String file Ext , int reg Level ) { boolean is Cls ID Exist = BOOL ; String appendix , tem Cls ID , tem Cls ID Key , tem File Ext ; tem File Ext = file Ext . trim ( ) ; if ( tem File Ext . char At ( NUM ) == STRING ) { tem File Ext = tem File Ext . substring ( NUM ) ; } int i = NUM ... | private static String genClassID ( String fileExt , int regLevel ) { boolean isClsIDExist = _BOOL ; String appendix , temClsID , temClsIDKey , temFileExt ; temFileExt = fileExt . trim ( ) ; if ( temFileExt . charAt ( _NUM ) == STRING ) { temFileExt = temFileExt . substring ( _NUM ) ; } int i = _NUM ; while ( ( isClsIDE... | 206 |
java-test-196 | java | What is adding at the rear of the given fileext ? | a sequence number | private static String gen Class ID ( String file Ext , int reg Level ) { boolean is Cls ID Exist = BOOL ; String appendix , tem Cls ID , tem Cls ID Key , tem File Ext ; tem File Ext = file Ext . trim ( ) ; if ( tem File Ext . char At ( NUM ) == STRING ) { tem File Ext = tem File Ext . substring ( NUM ) ; } int i = NUM ... | private static String genClassID ( String fileExt , int regLevel ) { boolean isClsIDExist = _BOOL ; String appendix , temClsID , temClsIDKey , temFileExt ; temFileExt = fileExt . trim ( ) ; if ( temFileExt . charAt ( _NUM ) == STRING ) { temFileExt = temFileExt . substring ( _NUM ) ; } int i = _NUM ; while ( ( isClsIDE... | 206 |
java-test-197 | java | For what purpose do the incoming message process ? | to look for the needed echo | public void message ( Loco Net Message m ) { log . debug ( STRING ) ; if ( ! m Run Button . is Selected ( ) ) { return ; } if ( ! ( m Next Echo . equals ( m ) ) ) { return ; } start Sequence Delay ( ) ; } | public void message ( LocoNetMessage m ) { log . debug ( STRING ) ; if ( ! mRunButton . isSelected ( ) ) { return ; } if ( ! ( mNextEcho . equals ( m ) ) ) { return ; } startSequenceDelay ( ) ; } | 58 |
java-test-198 | java | Till when do the signalbarrier and block claim ? | until signaled | public void await ( ) throws Interrupted Exception { Thread t = Thread . current Thread ( ) ; if ( ! owner Access . compare And Set ( this , null , t ) ) { throw new Illegal State Exception ( STRING ) ; } Lock Support . park ( this ) ; owner Access . compare And Set ( this , t , null ) ; if ( t . is Interrupted ( ) ) t... | public void await ( ) throws InterruptedException { Thread t = Thread . currentThread ( ) ; if ( ! ownerAccess . compareAndSet ( this , null , t ) ) { throw new IllegalStateException ( STRING ) ; } LockSupport . park ( this ) ; ownerAccess . compareAndSet ( this , t , null ) ; if ( t . isInterrupted ( ) ) throw new Int... | 86 |
java-test-199 | java | What does the code treat as an unsigned series of bytes , most significant bits first ? | the byte [ ] | public static byte [ ] unsigned Copy And Increment ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new Illegal Argument Exception ( STRING ) ; } for ( int i = copy . length - NUM ; i >= NUM ; -- i ) { if ( copy [ i ] == - NUM ) { copy [ i ] = NUM ; } else { ++ copy [ i ] ; return... | public static byte [ ] unsignedCopyAndIncrement ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new IllegalArgumentException ( STRING ) ; } for ( int i = copy . length - _NUM ; i >= _NUM ; -- i ) { if ( copy [ i ] == - _NUM ) { copy [ i ] = _NUM ; } else { ++ copy [ i ] ; return ... | 138 |
java-test-200 | java | Does the code carry all overflows to the more significant bits / bytes over ? | Yes | public static byte [ ] unsigned Copy And Increment ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new Illegal Argument Exception ( STRING ) ; } for ( int i = copy . length - NUM ; i >= NUM ; -- i ) { if ( copy [ i ] == - NUM ) { copy [ i ] = NUM ; } else { ++ copy [ i ] ; return... | public static byte [ ] unsignedCopyAndIncrement ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new IllegalArgumentException ( STRING ) ; } for ( int i = copy . length - _NUM ; i >= _NUM ; -- i ) { if ( copy [ i ] == - _NUM ) { copy [ i ] = _NUM ; } else { ++ copy [ i ] ; return ... | 138 |
java-test-201 | java | What does the code carry to the more significant bits / bytes over ? | all overflows | public static byte [ ] unsigned Copy And Increment ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new Illegal Argument Exception ( STRING ) ; } for ( int i = copy . length - NUM ; i >= NUM ; -- i ) { if ( copy [ i ] == - NUM ) { copy [ i ] = NUM ; } else { ++ copy [ i ] ; return... | public static byte [ ] unsignedCopyAndIncrement ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new IllegalArgumentException ( STRING ) ; } for ( int i = copy . length - _NUM ; i >= _NUM ; -- i ) { if ( copy [ i ] == - _NUM ) { copy [ i ] = _NUM ; } else { ++ copy [ i ] ; return ... | 138 |
java-test-202 | java | Does the code treat the byte [ ] as an unsigned series of bytes , most significant bits first ? | Yes | public static byte [ ] unsigned Copy And Increment ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new Illegal Argument Exception ( STRING ) ; } for ( int i = copy . length - NUM ; i >= NUM ; -- i ) { if ( copy [ i ] == - NUM ) { copy [ i ] = NUM ; } else { ++ copy [ i ] ; return... | public static byte [ ] unsignedCopyAndIncrement ( final byte [ ] input ) { byte [ ] copy = copy ( input ) ; if ( copy == null ) { throw new IllegalArgumentException ( STRING ) ; } for ( int i = copy . length - _NUM ; i >= _NUM ; -- i ) { if ( copy [ i ] == - _NUM ) { copy [ i ] = _NUM ; } else { ++ copy [ i ] ; return ... | 138 |
java-test-205 | java | What are ignored in computing the error ? | any nan values in either a or b | public static double sum Squared Error ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new Illegal Argument Exception ( STRING ) ; } double sum = NUM ; for ( int i = NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . is Na N ( delta ) ) { sum += delta * delta ; ... | public static double sumSquaredError ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new IllegalArgumentException ( STRING ) ; } double sum = _NUM ; for ( int i = _NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . isNaN ( delta ) ) { sum += delta * delta ; } } ... | 99 |
java-test-206 | java | Are any nan values in either a or b ignored in computing the error ? | Yes | public static double sum Squared Error ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new Illegal Argument Exception ( STRING ) ; } double sum = NUM ; for ( int i = NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . is Na N ( delta ) ) { sum += delta * delta ; ... | public static double sumSquaredError ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new IllegalArgumentException ( STRING ) ; } double sum = _NUM ; for ( int i = _NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . isNaN ( delta ) ) { sum += delta * delta ; } } ... | 99 |
java-test-207 | java | Does the code build the sum of the squared difference of all elements with the same index numbers in the arrays ? | Yes | public static double sum Squared Error ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new Illegal Argument Exception ( STRING ) ; } double sum = NUM ; for ( int i = NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . is Na N ( delta ) ) { sum += delta * delta ; ... | public static double sumSquaredError ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new IllegalArgumentException ( STRING ) ; } double sum = _NUM ; for ( int i = _NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . isNaN ( delta ) ) { sum += delta * delta ; } } ... | 99 |
java-test-208 | java | Where are any nan values in either a or b ignored ? | in computing the error | public static double sum Squared Error ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new Illegal Argument Exception ( STRING ) ; } double sum = NUM ; for ( int i = NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . is Na N ( delta ) ) { sum += delta * delta ; ... | public static double sumSquaredError ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new IllegalArgumentException ( STRING ) ; } double sum = _NUM ; for ( int i = _NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . isNaN ( delta ) ) { sum += delta * delta ; } } ... | 99 |
java-test-209 | java | What does the code build ? | the sum of the squared difference of all elements with the same index numbers in the arrays | public static double sum Squared Error ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new Illegal Argument Exception ( STRING ) ; } double sum = NUM ; for ( int i = NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . is Na N ( delta ) ) { sum += delta * delta ; ... | public static double sumSquaredError ( double [ ] a , double [ ] b ) { if ( a . length != b . length ) { throw new IllegalArgumentException ( STRING ) ; } double sum = _NUM ; for ( int i = _NUM ; i < a . length ; i ++ ) { double delta = a [ i ] - b [ i ] ; if ( ! Double . isNaN ( delta ) ) { sum += delta * delta ; } } ... | 99 |
java-test-210 | java | Does the code find the last assignment to the given string local by searching upwards from the given statement ? | Yes | private String find Last String Assignment ( Stmt stmt , Local local , Bi Di Interprocedural CFG < Unit , Soot Method > cfg ) { if ( stmt instanceof Assign Stmt ) { Assign Stmt assign = ( Assign Stmt ) stmt ; if ( assign . get Left Op ( ) == local ) { if ( assign . get Right Op ( ) instanceof String Constant ) return (... | private String findLastStringAssignment ( Stmt stmt , Local local , BiDiInterproceduralCFG < Unit , SootMethod > cfg ) { if ( stmt instanceof AssignStmt ) { AssignStmt assign = ( AssignStmt ) stmt ; if ( assign . getLeftOp ( ) == local ) { if ( assign . getRightOp ( ) instanceof StringConstant ) return ( ( StringConsta... | 150 |
java-test-211 | java | What does the code find by searching upwards from the given statement ? | the last assignment to the given string local | private String find Last String Assignment ( Stmt stmt , Local local , Bi Di Interprocedural CFG < Unit , Soot Method > cfg ) { if ( stmt instanceof Assign Stmt ) { Assign Stmt assign = ( Assign Stmt ) stmt ; if ( assign . get Left Op ( ) == local ) { if ( assign . get Right Op ( ) instanceof String Constant ) return (... | private String findLastStringAssignment ( Stmt stmt , Local local , BiDiInterproceduralCFG < Unit , SootMethod > cfg ) { if ( stmt instanceof AssignStmt ) { AssignStmt assign = ( AssignStmt ) stmt ; if ( assign . getLeftOp ( ) == local ) { if ( assign . getRightOp ( ) instanceof StringConstant ) return ( ( StringConsta... | 150 |
java-test-212 | java | How does the code find the last assignment to the given string local ? | by searching upwards from the given statement | private String find Last String Assignment ( Stmt stmt , Local local , Bi Di Interprocedural CFG < Unit , Soot Method > cfg ) { if ( stmt instanceof Assign Stmt ) { Assign Stmt assign = ( Assign Stmt ) stmt ; if ( assign . get Left Op ( ) == local ) { if ( assign . get Right Op ( ) instanceof String Constant ) return (... | private String findLastStringAssignment ( Stmt stmt , Local local , BiDiInterproceduralCFG < Unit , SootMethod > cfg ) { if ( stmt instanceof AssignStmt ) { AssignStmt assign = ( AssignStmt ) stmt ; if ( assign . getLeftOp ( ) == local ) { if ( assign . getRightOp ( ) instanceof StringConstant ) return ( ( StringConsta... | 150 |
java-test-213 | java | What does the code add into redis for application server and management console ? | two keys | @ Override public void create Redis App Key ( Application application , String docker Manager IP , String server Port , String server Manager Port ) { String suffix Cloud Unit = application . get Suffix Cloud Unit IO ( ) ; Jedis Pool pool = null ; Jedis jedis = null ; try { pool = new Jedis Pool ( new Jedis Pool Config... | @ Override public void createRedisAppKey ( Application application , String dockerManagerIP , String serverPort , String serverManagerPort ) { String suffixCloudUnit = application . getSuffixCloudUnitIO ( ) ; JedisPool pool = null ; Jedis jedis = null ; try { pool = new JedisPool ( new JedisPoolConfig ( ) , redisIp , I... | 256 |
java-test-214 | java | For what purpose does the code add two keys into redis ? | for application server and management console | @ Override public void create Redis App Key ( Application application , String docker Manager IP , String server Port , String server Manager Port ) { String suffix Cloud Unit = application . get Suffix Cloud Unit IO ( ) ; Jedis Pool pool = null ; Jedis jedis = null ; try { pool = new Jedis Pool ( new Jedis Pool Config... | @ Override public void createRedisAppKey ( Application application , String dockerManagerIP , String serverPort , String serverManagerPort ) { String suffixCloudUnit = application . getSuffixCloudUnitIO ( ) ; JedisPool pool = null ; Jedis jedis = null ; try { pool = new JedisPool ( new JedisPoolConfig ( ) , redisIp , I... | 256 |
java-test-215 | java | Does the code add two keys into redis for application server and management console ? | Yes | @ Override public void create Redis App Key ( Application application , String docker Manager IP , String server Port , String server Manager Port ) { String suffix Cloud Unit = application . get Suffix Cloud Unit IO ( ) ; Jedis Pool pool = null ; Jedis jedis = null ; try { pool = new Jedis Pool ( new Jedis Pool Config... | @ Override public void createRedisAppKey ( Application application , String dockerManagerIP , String serverPort , String serverManagerPort ) { String suffixCloudUnit = application . getSuffixCloudUnitIO ( ) ; JedisPool pool = null ; Jedis jedis = null ; try { pool = new JedisPool ( new JedisPoolConfig ( ) , redisIp , I... | 256 |
java-test-216 | java | Does the behavior of the method test in the case of null input char array ? | Yes | public void test PBE Key Spec 1 ( ) { try { PBE Key Spec pbeks = new PBE Key Spec ( null ) ; assert True ( STRING + STRING , pbeks . get Password ( ) . length == NUM ) ; } catch ( Null Pointer Exception e ) { fail ( STRING ) ; } char [ ] password = new char [ ] { STRING , STRING , STRING , STRING , STRING } ; PBE Key S... | public void testPBEKeySpec1 ( ) { try { PBEKeySpec pbeks = new PBEKeySpec ( null ) ; assertTrue ( STRING + STRING , pbeks . getPassword ( ) . length == _NUM ) ; } catch ( NullPointerException e ) { fail ( STRING ) ; } char [ ] password = new char [ ] { STRING , STRING , STRING , STRING , STRING } ; PBEKeySpec pbeks = n... | 123 |
java-test-217 | java | What tests that input array is copied during the object initialization ? | pbekeyspec ( char [ ] | public void test PBE Key Spec 1 ( ) { try { PBE Key Spec pbeks = new PBE Key Spec ( null ) ; assert True ( STRING + STRING , pbeks . get Password ( ) . length == NUM ) ; } catch ( Null Pointer Exception e ) { fail ( STRING ) ; } char [ ] password = new char [ ] { STRING , STRING , STRING , STRING , STRING } ; PBE Key S... | public void testPBEKeySpec1 ( ) { try { PBEKeySpec pbeks = new PBEKeySpec ( null ) ; assertTrue ( STRING + STRING , pbeks . getPassword ( ) . length == _NUM ) ; } catch ( NullPointerException e ) { fail ( STRING ) ; } char [ ] password = new char [ ] { STRING , STRING , STRING , STRING , STRING } ; PBEKeySpec pbeks = n... | 123 |
java-test-218 | java | Does pbekeyspec ( char [ ] test ? | Yes | public void test PBE Key Spec 1 ( ) { try { PBE Key Spec pbeks = new PBE Key Spec ( null ) ; assert True ( STRING + STRING , pbeks . get Password ( ) . length == NUM ) ; } catch ( Null Pointer Exception e ) { fail ( STRING ) ; } char [ ] password = new char [ ] { STRING , STRING , STRING , STRING , STRING } ; PBE Key S... | public void testPBEKeySpec1 ( ) { try { PBEKeySpec pbeks = new PBEKeySpec ( null ) ; assertTrue ( STRING + STRING , pbeks . getPassword ( ) . length == _NUM ) ; } catch ( NullPointerException e ) { fail ( STRING ) ; } char [ ] password = new char [ ] { STRING , STRING , STRING , STRING , STRING } ; PBEKeySpec pbeks = n... | 123 |
java-test-219 | java | Does this interactive exchange allow user to trust the ssl at the first time browsing this site ? | Yes | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-220 | java | What is to host login page from iframe which would fails silently if the server site is not trusted by browser ? | handle ssl for ngc | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-221 | java | What do handle ssl for ngc be ? | to host login page from iframe which would fails silently if the server site is not trusted by browser | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-222 | java | What allow user to trust the ssl at the first time browsing this site ? | this interactive exchange | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-223 | java | When do user trust the ssl ? | at the first time | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-224 | java | Do user trust the ssl at the first time ? | Yes | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-225 | java | What does this interactive exchange allow ? | user to trust the ssl at the first time browsing this site | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-226 | java | Do handle ssl for ngc be to host login page from iframe which would fails silently if the server site is not trusted by browser ? | Yes | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-227 | java | What do user trust at the first time ? | the ssl | @ Request Mapping ( value = STRING , method = { Request Method . GET , Request Method . POST } ) public void sso SSL Dummy ( Locale locale , Model model , @ Path Variable ( value = STRING ) String tenant , Http Servlet Request request , Http Servlet Response response ) throws IO Exception { logger . info ( STRING + ten... | @ RequestMapping ( value = STRING , method = { RequestMethod . GET , RequestMethod . POST } ) public void ssoSSLDummy ( Locale locale , Model model , @ PathVariable ( value = STRING ) String tenant , HttpServletRequest request , HttpServletResponse response ) throws IOException { logger . info ( STRING + tenant ) ; try... | 246 |
java-test-230 | java | What does the code select ? | a format from a custom pattern | private static Date Time Formatter create Formatter For Pattern ( String pattern ) { if ( pattern == null || pattern . length ( ) == NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Date Time Formatter formatter = null ; synchronized ( c Patterned Cache ) { formatter = c Patterned Cache . get ( pattern ) ; i... | private static DateTimeFormatter createFormatterForPattern ( String pattern ) { if ( pattern == null || pattern . length ( ) == _NUM ) { throw new IllegalArgumentException ( STRING ) ; } DateTimeFormatter formatter = null ; synchronized ( cPatternedCache ) { formatter = cPatternedCache . get ( pattern ) ; if ( formatte... | 120 |
java-test-231 | java | Does the code select a format from a custom pattern ? | Yes | private static Date Time Formatter create Formatter For Pattern ( String pattern ) { if ( pattern == null || pattern . length ( ) == NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Date Time Formatter formatter = null ; synchronized ( c Patterned Cache ) { formatter = c Patterned Cache . get ( pattern ) ; i... | private static DateTimeFormatter createFormatterForPattern ( String pattern ) { if ( pattern == null || pattern . length ( ) == _NUM ) { throw new IllegalArgumentException ( STRING ) ; } DateTimeFormatter formatter = null ; synchronized ( cPatternedCache ) { formatter = cPatternedCache . get ( pattern ) ; if ( formatte... | 120 |
java-test-232 | java | When be a method called ? | when a node is about to be removed from the tree | @ Override void removing Node ( Node Impl node , Node Impl old Child , boolean replace ) { if ( iterators != null ) { notify Iterators Removing Node ( old Child ) ; } if ( ranges != null ) { notify Ranges Removing Node ( old Child ) ; } if ( mutation Events ) { mutation Events Removing Node ( node , old Child , replace... | @ Override void removingNode ( NodeImpl node , NodeImpl oldChild , boolean replace ) { if ( iterators != null ) { notifyIteratorsRemovingNode ( oldChild ) ; } if ( ranges != null ) { notifyRangesRemovingNode ( oldChild ) ; } if ( mutationEvents ) { mutationEventsRemovingNode ( node , oldChild , replace ) ; } } | 74 |
java-test-239 | java | Does the code compare ? | Yes | static boolean less Equal ( Object v1 , Object v2 ) { v1 = maybe Convert To String ( v1 ) ; v2 = maybe Convert To String ( v2 ) ; if ( Objects . equals ( v1 , v2 ) ) { return BOOL ; } return less ( v1 , v2 ) ; } | static boolean lessEqual ( Object v1 , Object v2 ) { v1 = maybeConvertToString ( v1 ) ; v2 = maybeConvertToString ( v2 ) ; if ( Objects . equals ( v1 , v2 ) ) { return _BOOL ; } return less ( v1 , v2 ) ; } | 57 |
java-test-240 | java | What does the code compare ? | whether one value is less or equal than the other | static boolean less Equal ( Object v1 , Object v2 ) { v1 = maybe Convert To String ( v1 ) ; v2 = maybe Convert To String ( v2 ) ; if ( Objects . equals ( v1 , v2 ) ) { return BOOL ; } return less ( v1 , v2 ) ; } | static boolean lessEqual ( Object v1 , Object v2 ) { v1 = maybeConvertToString ( v1 ) ; v2 = maybeConvertToString ( v2 ) ; if ( Objects . equals ( v1 , v2 ) ) { return _BOOL ; } return less ( v1 , v2 ) ; } | 57 |
java-test-241 | java | What does the code add to the archive ? | a new workspace component | Archived Component add Component ( final Workspace Component workspace Component ) { Archived Component component = new Archived Component ( serializer , workspace Component ) ; archived Components . add ( component ) ; component Uris . put ( workspace Component , component . uri ) ; return component ; } | ArchivedComponent addComponent ( final WorkspaceComponent workspaceComponent ) { ArchivedComponent component = new ArchivedComponent ( serializer , workspaceComponent ) ; archivedComponents . add ( component ) ; componentUris . put ( workspaceComponent , component . uri ) ; return component ; } | 51 |
java-test-242 | java | Does the code add a new workspace component to the archive ? | Yes | Archived Component add Component ( final Workspace Component workspace Component ) { Archived Component component = new Archived Component ( serializer , workspace Component ) ; archived Components . add ( component ) ; component Uris . put ( workspace Component , component . uri ) ; return component ; } | ArchivedComponent addComponent ( final WorkspaceComponent workspaceComponent ) { ArchivedComponent component = new ArchivedComponent ( serializer , workspaceComponent ) ; archivedComponents . add ( component ) ; componentUris . put ( workspaceComponent , component . uri ) ; return component ; } | 51 |
java-test-243 | java | Does the code create a new nodesearch instance with filters ? | Yes | public Node Search ( Accessibility Service accessibility Service , Custom Label Manager label Manager , Search Text Formatter text Formatter , List < Search Result Filter > filters ) { this ( accessibility Service , label Manager , text Formatter ) ; m Filters . add All ( filters ) ; } | public NodeSearch ( AccessibilityService accessibilityService , CustomLabelManager labelManager , SearchTextFormatter textFormatter , List < SearchResultFilter > filters ) { this ( accessibilityService , labelManager , textFormatter ) ; mFilters . addAll ( filters ) ; } | 52 |
java-test-244 | java | What does the code create ? | a new nodesearch instance with filters | public Node Search ( Accessibility Service accessibility Service , Custom Label Manager label Manager , Search Text Formatter text Formatter , List < Search Result Filter > filters ) { this ( accessibility Service , label Manager , text Formatter ) ; m Filters . add All ( filters ) ; } | public NodeSearch ( AccessibilityService accessibilityService , CustomLabelManager labelManager , SearchTextFormatter textFormatter , List < SearchResultFilter > filters ) { this ( accessibilityService , labelManager , textFormatter ) ; mFilters . addAll ( filters ) ; } | 52 |
java-test-245 | java | Does the code create a generic uri from the given string ? | Yes | public URI ( String nuri ) throws Malformed URI Exception { uri = nuri ; colon Location = nuri . index Of ( STRING ) ; fragment Location = URI Classifier . get Fragment Location ( nuri ) ; if ( colon Location == - NUM || colon Location > fragment Location || colon Location == NUM ) throw new Malformed URI Exception ( S... | public URI ( String nuri ) throws MalformedURIException { uri = nuri ; colonLocation = nuri . indexOf ( STRING ) ; fragmentLocation = URIClassifier . getFragmentLocation ( nuri ) ; if ( colonLocation == - _NUM || colonLocation > fragmentLocation || colonLocation == _NUM ) throw new MalformedURIException ( STRING + uri ... | 74 |
java-test-246 | java | What does the code create ? | a generic uri from the given string | public URI ( String nuri ) throws Malformed URI Exception { uri = nuri ; colon Location = nuri . index Of ( STRING ) ; fragment Location = URI Classifier . get Fragment Location ( nuri ) ; if ( colon Location == - NUM || colon Location > fragment Location || colon Location == NUM ) throw new Malformed URI Exception ( S... | public URI ( String nuri ) throws MalformedURIException { uri = nuri ; colonLocation = nuri . indexOf ( STRING ) ; fragmentLocation = URIClassifier . getFragmentLocation ( nuri ) ; if ( colonLocation == - _NUM || colonLocation > fragmentLocation || colonLocation == _NUM ) throw new MalformedURIException ( STRING + uri ... | 74 |
java-test-255 | java | Does the code find all implementations of a particular interface ? | Yes | public static List < Class < ? > > find All Implementations ( Class < ? > restriction Class ) { if ( restriction Class == null ) { return Collections . empty List ( ) ; } if ( ! contains ( restriction Class ) ) { ELKI Service Loader . load ( restriction Class ) ; ELKI Service Scanner . load ( restriction Class ) ; } En... | public static List < Class < ? > > findAllImplementations ( Class < ? > restrictionClass ) { if ( restrictionClass == null ) { return Collections . emptyList ( ) ; } if ( ! contains ( restrictionClass ) ) { ELKIServiceLoader . load ( restrictionClass ) ; ELKIServiceScanner . load ( restrictionClass ) ; } Entry e = data... | 250 |
java-test-256 | java | What does the code find ? | all implementations of a particular interface | public static List < Class < ? > > find All Implementations ( Class < ? > restriction Class ) { if ( restriction Class == null ) { return Collections . empty List ( ) ; } if ( ! contains ( restriction Class ) ) { ELKI Service Loader . load ( restriction Class ) ; ELKI Service Scanner . load ( restriction Class ) ; } En... | public static List < Class < ? > > findAllImplementations ( Class < ? > restrictionClass ) { if ( restrictionClass == null ) { return Collections . emptyList ( ) ; } if ( ! contains ( restrictionClass ) ) { ELKIServiceLoader . load ( restrictionClass ) ; ELKIServiceScanner . load ( restrictionClass ) ; } Entry e = data... | 250 |
java-test-264 | java | Does the computed classpath contain the jre ? | No | public void test Compute Classpath For Jre ( ) throws Core Exception { assert Equals ( NUM , java Project A . get Raw Classpath ( ) . length ) ; List < File > actual Cp = get List Of Files ( GWT Compile Runner . compute Classpath ( java Project A ) ) ; assert Equals ( NUM , actual Cp . size ( ) ) ; } | public void testComputeClasspathForJre ( ) throws CoreException { assertEquals ( _NUM , javaProjectA . getRawClasspath ( ) . length ) ; List < File > actualCp = getListOfFiles ( GWTCompileRunner . computeClasspath ( javaProjectA ) ) ; assertEquals ( _NUM , actualCp . size ( ) ) ; } | 70 |
java-test-265 | java | What does not contain the jre ? | the computed classpath | public void test Compute Classpath For Jre ( ) throws Core Exception { assert Equals ( NUM , java Project A . get Raw Classpath ( ) . length ) ; List < File > actual Cp = get List Of Files ( GWT Compile Runner . compute Classpath ( java Project A ) ) ; assert Equals ( NUM , actual Cp . size ( ) ) ; } | public void testComputeClasspathForJre ( ) throws CoreException { assertEquals ( _NUM , javaProjectA . getRawClasspath ( ) . length ) ; List < File > actualCp = getListOfFiles ( GWTCompileRunner . computeClasspath ( javaProjectA ) ) ; assertEquals ( _NUM , actualCp . size ( ) ) ; } | 70 |
java-test-266 | java | What does the computed classpath not contain ? | the jre | public void test Compute Classpath For Jre ( ) throws Core Exception { assert Equals ( NUM , java Project A . get Raw Classpath ( ) . length ) ; List < File > actual Cp = get List Of Files ( GWT Compile Runner . compute Classpath ( java Project A ) ) ; assert Equals ( NUM , actual Cp . size ( ) ) ; } | public void testComputeClasspathForJre ( ) throws CoreException { assertEquals ( _NUM , javaProjectA . getRawClasspath ( ) . length ) ; List < File > actualCp = getListOfFiles ( GWTCompileRunner . computeClasspath ( javaProjectA ) ) ; assertEquals ( _NUM , actualCp . size ( ) ) ; } | 70 |
java-test-267 | java | Do the cut the text into blocks of at least block_minimum_character_size characters , aligned on the ends of paragraphs ? | Yes | private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Of... | private void createBlocks ( ) { int offset = BLOCK_MINIMUM_CHARACTER_LENGTH ; mNumberOfBlocks = _NUM ; final CharSequence text = mDisplay ; while ( _BOOL ) { offset = TextUtils . indexOf ( text , STRING , offset ) ; if ( offset < _NUM ) { addBlockAtOffset ( text . length ( ) ) ; break ; } else { addBlockAtOffset ( offs... | 139 |
java-test-268 | java | Does the code create the initial block structure cutting the text into blocks of at least block_minimum_character_size characters , aligned on the ends of paragraphs ? | Yes | private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Of... | private void createBlocks ( ) { int offset = BLOCK_MINIMUM_CHARACTER_LENGTH ; mNumberOfBlocks = _NUM ; final CharSequence text = mDisplay ; while ( _BOOL ) { offset = TextUtils . indexOf ( text , STRING , offset ) ; if ( offset < _NUM ) { addBlockAtOffset ( text . length ( ) ) ; break ; } else { addBlockAtOffset ( offs... | 139 |
java-test-269 | java | Did blocks of at least block_minimum_character_size characters align on the ends of paragraphs ? | Yes | private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Of... | private void createBlocks ( ) { int offset = BLOCK_MINIMUM_CHARACTER_LENGTH ; mNumberOfBlocks = _NUM ; final CharSequence text = mDisplay ; while ( _BOOL ) { offset = TextUtils . indexOf ( text , STRING , offset ) ; if ( offset < _NUM ) { addBlockAtOffset ( text . length ( ) ) ; break ; } else { addBlockAtOffset ( offs... | 139 |
java-test-270 | java | What aligned on the ends of paragraphs ? | blocks of at least block_minimum_character_size characters | private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Of... | private void createBlocks ( ) { int offset = BLOCK_MINIMUM_CHARACTER_LENGTH ; mNumberOfBlocks = _NUM ; final CharSequence text = mDisplay ; while ( _BOOL ) { offset = TextUtils . indexOf ( text , STRING , offset ) ; if ( offset < _NUM ) { addBlockAtOffset ( text . length ( ) ) ; break ; } else { addBlockAtOffset ( offs... | 139 |
java-test-271 | java | Where did blocks of at least block_minimum_character_size characters align ? | on the ends of paragraphs | private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Of... | private void createBlocks ( ) { int offset = BLOCK_MINIMUM_CHARACTER_LENGTH ; mNumberOfBlocks = _NUM ; final CharSequence text = mDisplay ; while ( _BOOL ) { offset = TextUtils . indexOf ( text , STRING , offset ) ; if ( offset < _NUM ) { addBlockAtOffset ( text . length ( ) ) ; break ; } else { addBlockAtOffset ( offs... | 139 |
java-test-272 | java | What does the code create cutting the text into blocks of at least block_minimum_character_size characters , aligned on the ends of paragraphs ? | the initial block structure | private void create Blocks ( ) { int offset = BLOCK MINIMUM CHARACTER LENGTH ; m Number Of Blocks = NUM ; final Char Sequence text = m Display ; while ( BOOL ) { offset = Text Utils . index Of ( text , STRING , offset ) ; if ( offset < NUM ) { add Block At Offset ( text . length ( ) ) ; break ; } else { add Block At Of... | private void createBlocks ( ) { int offset = BLOCK_MINIMUM_CHARACTER_LENGTH ; mNumberOfBlocks = _NUM ; final CharSequence text = mDisplay ; while ( _BOOL ) { offset = TextUtils . indexOf ( text , STRING , offset ) ; if ( offset < _NUM ) { addBlockAtOffset ( text . length ( ) ) ; break ; } else { addBlockAtOffset ( offs... | 139 |
java-test-273 | java | Does it place them into the first empty slot if items are still left after doing so if items are still left after doing so ? | Yes | public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get... | public ItemStack tryToFillSlots ( ItemStack stack , int ... slots ) { if ( slots . length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING ) ; } ItemStack maxStack = stack . clone ( ) ; maxStack . setAmount ( stack . getMaxStackSize ( ) ) ; for ( int s = _NUM ; s < slots . length && stack . getAmount ( ) ... | 405 |
java-test-274 | java | How are the slots supplied first ? | in pairs | public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get... | public ItemStack tryToFillSlots ( ItemStack stack , int ... slots ) { if ( slots . length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING ) ; } ItemStack maxStack = stack . clone ( ) ; maxStack . setAmount ( stack . getMaxStackSize ( ) ) ; for ( int s = _NUM ; s < slots . length && stack . getAmount ( ) ... | 405 |
java-test-275 | java | In which direction does the given items put into the specified slots of this inventory ? | from the start slot ( inclusive ) | public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get... | public ItemStack tryToFillSlots ( ItemStack stack , int ... slots ) { if ( slots . length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING ) ; } ItemStack maxStack = stack . clone ( ) ; maxStack . setAmount ( stack . getMaxStackSize ( ) ) ; for ( int s = _NUM ; s < slots . length && stack . getAmount ( ) ... | 405 |
java-test-276 | java | Will this try to fill up all partial slots first ? | Yes | public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get... | public ItemStack tryToFillSlots ( ItemStack stack , int ... slots ) { if ( slots . length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING ) ; } ItemStack maxStack = stack . clone ( ) ; maxStack . setAmount ( stack . getMaxStackSize ( ) ) ; for ( int s = _NUM ; s < slots . length && stack . getAmount ( ) ... | 405 |
java-test-277 | java | Do this fill all partial slots ? | Yes | public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get... | public ItemStack tryToFillSlots ( ItemStack stack , int ... slots ) { if ( slots . length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING ) ; } ItemStack maxStack = stack . clone ( ) ; maxStack . setAmount ( stack . getMaxStackSize ( ) ) ; for ( int s = _NUM ; s < slots . length && stack . getAmount ( ) ... | 405 |
java-test-278 | java | What will this try first ? | to fill up all partial slots | public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get... | public ItemStack tryToFillSlots ( ItemStack stack , int ... slots ) { if ( slots . length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING ) ; } ItemStack maxStack = stack . clone ( ) ; maxStack . setAmount ( stack . getMaxStackSize ( ) ) ; for ( int s = _NUM ; s < slots . length && stack . getAmount ( ) ... | 405 |
java-test-279 | java | What do this fill ? | all partial slots | public Item Stack try To Fill Slots ( Item Stack stack , int ... slots ) { if ( slots . length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING ) ; } Item Stack max Stack = stack . clone ( ) ; max Stack . set Amount ( stack . get Max Stack Size ( ) ) ; for ( int s = NUM ; s < slots . length && stack . get... | public ItemStack tryToFillSlots ( ItemStack stack , int ... slots ) { if ( slots . length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING ) ; } ItemStack maxStack = stack . clone ( ) ; maxStack . setAmount ( stack . getMaxStackSize ( ) ) ; for ( int s = _NUM ; s < slots . length && stack . getAmount ( ) ... | 405 |
java-test-280 | java | Does the code create a national number from a number string ? | Yes | private String number To National ( String number ) { final Phone Number Util util = Phone Number Util . get Instance ( ) ; try { final Phonenumber . Phone Number phone Number = util . parse ( number , m Country Code ) ; return String . value Of ( phone Number . get National Number ( ) ) ; } catch ( Number Parse Except... | private String numberToNational ( String number ) { final PhoneNumberUtil util = PhoneNumberUtil . getInstance ( ) ; try { final Phonenumber . PhoneNumber phoneNumber = util . parse ( number , mCountryCode ) ; return String . valueOf ( phoneNumber . getNationalNumber ( ) ) ; } catch ( NumberParseException e ) { return ... | 76 |
java-test-281 | java | What does the code create from a number string ? | a national number | private String number To National ( String number ) { final Phone Number Util util = Phone Number Util . get Instance ( ) ; try { final Phonenumber . Phone Number phone Number = util . parse ( number , m Country Code ) ; return String . value Of ( phone Number . get National Number ( ) ) ; } catch ( Number Parse Except... | private String numberToNational ( String number ) { final PhoneNumberUtil util = PhoneNumberUtil . getInstance ( ) ; try { final Phonenumber . PhoneNumber phoneNumber = util . parse ( number , mCountryCode ) ; return String . valueOf ( phoneNumber . getNationalNumber ( ) ) ; } catch ( NumberParseException e ) { return ... | 76 |
java-test-286 | java | Does the code generate a set of n random distinct byte [ ] keys in sorted order in sorted order ? | Yes | public byte [ ] [ ] generate Keys ( final int nkeys ) { if ( nkeys < NUM ) throw new Illegal Argument Exception ( ) ; if ( nkeys > max Keys ) throw new Illegal Argument Exception ( ) ; final Set < byte [ ] > set = new Tree Set < byte [ ] > ( Bytes Util . Unsigned Byte Array Comparator . INSTANCE ) ; final byte [ ] [ ] ... | public byte [ ] [ ] generateKeys ( final int nkeys ) { if ( nkeys < _NUM ) throw new IllegalArgumentException ( ) ; if ( nkeys > maxKeys ) throw new IllegalArgumentException ( ) ; final Set < byte [ ] > set = new TreeSet < byte [ ] > ( BytesUtil . UnsignedByteArrayComparator . INSTANCE ) ; final byte [ ] [ ] keys = new... | 197 |
java-test-287 | java | What does the code generate in sorted order in sorted order ? | a set of n random distinct byte [ ] keys | public byte [ ] [ ] generate Keys ( final int nkeys ) { if ( nkeys < NUM ) throw new Illegal Argument Exception ( ) ; if ( nkeys > max Keys ) throw new Illegal Argument Exception ( ) ; final Set < byte [ ] > set = new Tree Set < byte [ ] > ( Bytes Util . Unsigned Byte Array Comparator . INSTANCE ) ; final byte [ ] [ ] ... | public byte [ ] [ ] generateKeys ( final int nkeys ) { if ( nkeys < _NUM ) throw new IllegalArgumentException ( ) ; if ( nkeys > maxKeys ) throw new IllegalArgumentException ( ) ; final Set < byte [ ] > set = new TreeSet < byte [ ] > ( BytesUtil . UnsignedByteArrayComparator . INSTANCE ) ; final byte [ ] [ ] keys = new... | 197 |
java-test-288 | java | Does the method expect a string ? | Yes | public final void test Set Password Verification Prefix With String Parameter ( ) { String prefix = STRING ; Password Edit Text password Edit Text = new Password Edit Text ( get Context ( ) ) ; password Edit Text . set Password Verification Prefix ( prefix ) ; assert Equals ( prefix , password Edit Text . get Password ... | public final void testSetPasswordVerificationPrefixWithStringParameter ( ) { String prefix = STRING ; PasswordEditText passwordEditText = new PasswordEditText ( getContext ( ) ) ; passwordEditText . setPasswordVerificationPrefix ( prefix ) ; assertEquals ( prefix , passwordEditText . getPasswordVerificationPrefix ( ) )... | 67 |
java-test-289 | java | What does which set ? | the password verification prefix | public final void test Set Password Verification Prefix With String Parameter ( ) { String prefix = STRING ; Password Edit Text password Edit Text = new Password Edit Text ( get Context ( ) ) ; password Edit Text . set Password Verification Prefix ( prefix ) ; assert Equals ( prefix , password Edit Text . get Password ... | public final void testSetPasswordVerificationPrefixWithStringParameter ( ) { String prefix = STRING ; PasswordEditText passwordEditText = new PasswordEditText ( getContext ( ) ) ; passwordEditText . setPasswordVerificationPrefix ( prefix ) ; assertEquals ( prefix , passwordEditText . getPasswordVerificationPrefix ( ) )... | 67 |
java-test-290 | java | Does the method allow to set the password verification prefix ? | Yes | public final void test Set Password Verification Prefix With String Parameter ( ) { String prefix = STRING ; Password Edit Text password Edit Text = new Password Edit Text ( get Context ( ) ) ; password Edit Text . set Password Verification Prefix ( prefix ) ; assert Equals ( prefix , password Edit Text . get Password ... | public final void testSetPasswordVerificationPrefixWithStringParameter ( ) { String prefix = STRING ; PasswordEditText passwordEditText = new PasswordEditText ( getContext ( ) ) ; passwordEditText . setPasswordVerificationPrefix ( prefix ) ; assertEquals ( prefix , passwordEditText . getPasswordVerificationPrefix ( ) )... | 67 |
java-test-291 | java | Does which set the password verification prefix ? | Yes | public final void test Set Password Verification Prefix With String Parameter ( ) { String prefix = STRING ; Password Edit Text password Edit Text = new Password Edit Text ( get Context ( ) ) ; password Edit Text . set Password Verification Prefix ( prefix ) ; assert Equals ( prefix , password Edit Text . get Password ... | public final void testSetPasswordVerificationPrefixWithStringParameter ( ) { String prefix = STRING ; PasswordEditText passwordEditText = new PasswordEditText ( getContext ( ) ) ; passwordEditText . setPasswordVerificationPrefix ( prefix ) ; assertEquals ( prefix , passwordEditText . getPasswordVerificationPrefix ( ) )... | 67 |
java-test-292 | java | What does the method allow ? | to set the password verification prefix | public final void test Set Password Verification Prefix With String Parameter ( ) { String prefix = STRING ; Password Edit Text password Edit Text = new Password Edit Text ( get Context ( ) ) ; password Edit Text . set Password Verification Prefix ( prefix ) ; assert Equals ( prefix , password Edit Text . get Password ... | public final void testSetPasswordVerificationPrefixWithStringParameter ( ) { String prefix = STRING ; PasswordEditText passwordEditText = new PasswordEditText ( getContext ( ) ) ; passwordEditText . setPasswordVerificationPrefix ( prefix ) ; assertEquals ( prefix , passwordEditText . getPasswordVerificationPrefix ( ) )... | 67 |
java-test-293 | java | What is satisfying the criteria ? | more than one row | public static < T > T select One ( Connection connection , String raw Sql Query , Row Processor < T > row Processor , Object ... parameters ) throws IO Exception , SQL Exception { List < T > result List = Jdbc Utils . select ( connection , raw Sql Query , row Processor , parameters ) ; if ( result List . is Empty ( ) )... | public static < T > T selectOne ( Connection connection , String rawSqlQuery , RowProcessor < T > rowProcessor , Object ... parameters ) throws IOException , SQLException { List < T > resultList = JdbcUtils . select ( connection , rawSqlQuery , rowProcessor , parameters ) ; if ( resultList . isEmpty ( ) ) { return null... | 122 |
java-test-294 | java | When are dataservicesruntimeexception is thrown ? | when there are more than one row satisfying the criteria | public static < T > T select One ( Connection connection , String raw Sql Query , Row Processor < T > row Processor , Object ... parameters ) throws IO Exception , SQL Exception { List < T > result List = Jdbc Utils . select ( connection , raw Sql Query , row Processor , parameters ) ; if ( result List . is Empty ( ) )... | public static < T > T selectOne ( Connection connection , String rawSqlQuery , RowProcessor < T > rowProcessor , Object ... parameters ) throws IOException , SQLException { List < T > resultList = JdbcUtils . select ( connection , rawSqlQuery , rowProcessor , parameters ) ; if ( resultList . isEmpty ( ) ) { return null... | 122 |
java-test-295 | java | Do no rows satisfy the criteria ? | Yes | public static < T > T select One ( Connection connection , String raw Sql Query , Row Processor < T > row Processor , Object ... parameters ) throws IO Exception , SQL Exception { List < T > result List = Jdbc Utils . select ( connection , raw Sql Query , row Processor , parameters ) ; if ( result List . is Empty ( ) )... | public static < T > T selectOne ( Connection connection , String rawSqlQuery , RowProcessor < T > rowProcessor , Object ... parameters ) throws IOException , SQLException { List < T > resultList = JdbcUtils . select ( connection , rawSqlQuery , rowProcessor , parameters ) ; if ( resultList . isEmpty ( ) ) { return null... | 122 |
java-test-296 | java | In which direction is only one row are expected when ? | from the returned result set | public static < T > T select One ( Connection connection , String raw Sql Query , Row Processor < T > row Processor , Object ... parameters ) throws IO Exception , SQL Exception { List < T > result List = Jdbc Utils . select ( connection , raw Sql Query , row Processor , parameters ) ; if ( result List . is Empty ( ) )... | public static < T > T selectOne ( Connection connection , String rawSqlQuery , RowProcessor < T > rowProcessor , Object ... parameters ) throws IOException , SQLException { List < T > resultList = JdbcUtils . select ( connection , rawSqlQuery , rowProcessor , parameters ) ; if ( resultList . isEmpty ( ) ) { return null... | 122 |
java-test-297 | java | Do more than one row satisfy the criteria ? | Yes | public static < T > T select One ( Connection connection , String raw Sql Query , Row Processor < T > row Processor , Object ... parameters ) throws IO Exception , SQL Exception { List < T > result List = Jdbc Utils . select ( connection , raw Sql Query , row Processor , parameters ) ; if ( result List . is Empty ( ) )... | public static < T > T selectOne ( Connection connection , String rawSqlQuery , RowProcessor < T > rowProcessor , Object ... parameters ) throws IOException , SQLException { List < T > resultList = JdbcUtils . select ( connection , rawSqlQuery , rowProcessor , parameters ) ; if ( resultList . isEmpty ( ) ) { return null... | 122 |
java-test-298 | java | What does the entire method not need since this includes taking the event out from the queue and processing the event since this includes taking the event out from the queue and processing the event ? | to be synchronized | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-299 | java | What does not need to be synchronized since this includes taking the event out from the queue and processing the event since this includes taking the event out from the queue and processing the event ? | the entire method | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-300 | java | In which direction does we take the event ? | from the queue | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-301 | java | Does the entire method need to be synchronized since this includes taking the event out from the queue and processing the event since this includes taking the event out from the queue and processing the event ? | No | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-302 | java | What do we provide ? | exclusive access over the code where an event is removed from the queue | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-303 | java | Do we need to provide exclusive access over the code where an event is removed from the queue only ? | Yes | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-304 | java | Do we provide exclusive access over the code where an event is removed from the queue ? | Yes | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-305 | java | Where is an event removed from the queue ? | where | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-306 | java | What does we take from the queue ? | the event | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-307 | java | Is an event removed from the queue where ? | Yes | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-308 | java | What do we need only ? | to provide exclusive access over the code where an event is removed from the queue | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-309 | java | What is removed from the queue where ? | an event | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-310 | java | Why does the entire method not need to be synchronized ? | since this includes taking the event out from the queue and processing the event | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-311 | java | Does we take the event from the queue ? | Yes | void dispatch Events ( ) { Event Info event Info = null ; synchronized ( this ) { try { if ( event Queue . size ( ) == NUM ) { if ( auto Closing Clips . size ( ) > NUM || line Monitors . size ( ) > NUM ) { int wait Time = AUTO CLOSE TIME ; if ( line Monitors . size ( ) > NUM ) { wait Time = LINE MONITOR TIME ; } wait (... | void dispatchEvents ( ) { EventInfo eventInfo = null ; synchronized ( this ) { try { if ( eventQueue . size ( ) == _NUM ) { if ( autoClosingClips . size ( ) > _NUM || lineMonitors . size ( ) > _NUM ) { int waitTime = AUTO_CLOSE_TIME ; if ( lineMonitors . size ( ) > _NUM ) { waitTime = LINE_MONITOR_TIME ; } wait ( waitT... | 194 |
java-test-312 | java | What does the url represent ? | a local db | public static boolean is Local DB ( String db URL ) throws Invalid Exception { if ( db URL == null ) { throw new Invalid Exception ( STRING ) ; } return db URL . starts With ( STRING ) || db URL . starts With ( STRING ) ; } | public static boolean isLocalDB ( String dbURL ) throws InvalidException { if ( dbURL == null ) { throw new InvalidException ( STRING ) ; } return dbURL . startsWith ( STRING ) || dbURL . startsWith ( STRING ) ; } | 52 |
java-test-313 | java | Does the url represent a local db ? | Yes | public static boolean is Local DB ( String db URL ) throws Invalid Exception { if ( db URL == null ) { throw new Invalid Exception ( STRING ) ; } return db URL . starts With ( STRING ) || db URL . starts With ( STRING ) ; } | public static boolean isLocalDB ( String dbURL ) throws InvalidException { if ( dbURL == null ) { throw new InvalidException ( STRING ) ; } return dbURL . startsWith ( STRING ) || dbURL . startsWith ( STRING ) ; } | 52 |
java-test-318 | java | How do if we have dragged the bottom of the list too low ( we have pushed the bottom element off the bottom of the screen when we did not need to ) check ? | by sliding everything back up | private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; fi... | private void correctTooLow ( int childCount ) { if ( mFirstPosition == _NUM && childCount > _NUM ) { final int firstTop = getHighestChildTop ( ) ; final int start = getListPaddingTop ( ) ; final int end = ( getTop ( ) - getBottom ( ) ) - getListPaddingBottom ( ) ; int topOffset = firstTop - start ; final int lastBottom... | 243 |
java-test-319 | java | Have we pushed the bottom element off the bottom of the screen when we did not need to ? | Yes | private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; fi... | private void correctTooLow ( int childCount ) { if ( mFirstPosition == _NUM && childCount > _NUM ) { final int firstTop = getHighestChildTop ( ) ; final int start = getListPaddingTop ( ) ; final int end = ( getTop ( ) - getBottom ( ) ) - getListPaddingBottom ( ) ; int topOffset = firstTop - start ; final int lastBottom... | 243 |
java-test-320 | java | Have we dragged the bottom of the list too low ? | Yes | private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; fi... | private void correctTooLow ( int childCount ) { if ( mFirstPosition == _NUM && childCount > _NUM ) { final int firstTop = getHighestChildTop ( ) ; final int start = getListPaddingTop ( ) ; final int end = ( getTop ( ) - getBottom ( ) ) - getListPaddingBottom ( ) ; int topOffset = firstTop - start ; final int lastBottom... | 243 |
java-test-321 | java | What did we not need when ? | to | private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; fi... | private void correctTooLow ( int childCount ) { if ( mFirstPosition == _NUM && childCount > _NUM ) { final int firstTop = getHighestChildTop ( ) ; final int start = getListPaddingTop ( ) ; final int end = ( getTop ( ) - getBottom ( ) ) - getListPaddingBottom ( ) ; int topOffset = firstTop - start ; final int lastBottom... | 243 |
java-test-322 | java | What have we dragged too low ? | the bottom of the list | private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; fi... | private void correctTooLow ( int childCount ) { if ( mFirstPosition == _NUM && childCount > _NUM ) { final int firstTop = getHighestChildTop ( ) ; final int start = getListPaddingTop ( ) ; final int end = ( getTop ( ) - getBottom ( ) ) - getListPaddingBottom ( ) ; int topOffset = firstTop - start ; final int lastBottom... | 243 |
java-test-323 | java | When have we pushed the bottom element off the bottom of the screen ? | when we did not need to | private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; fi... | private void correctTooLow ( int childCount ) { if ( mFirstPosition == _NUM && childCount > _NUM ) { final int firstTop = getHighestChildTop ( ) ; final int start = getListPaddingTop ( ) ; final int end = ( getTop ( ) - getBottom ( ) ) - getListPaddingBottom ( ) ; int topOffset = firstTop - start ; final int lastBottom... | 243 |
java-test-324 | java | What have we pushed off the bottom of the screen when we did not need to ? | the bottom element | private void correct Too Low ( int child Count ) { if ( m First Position == NUM && child Count > NUM ) { final int first Top = get Highest Child Top ( ) ; final int start = get List Padding Top ( ) ; final int end = ( get Top ( ) - get Bottom ( ) ) - get List Padding Bottom ( ) ; int top Offset = first Top - start ; fi... | private void correctTooLow ( int childCount ) { if ( mFirstPosition == _NUM && childCount > _NUM ) { final int firstTop = getHighestChildTop ( ) ; final int start = getListPaddingTop ( ) ; final int end = ( getTop ( ) - getBottom ( ) ) - getListPaddingBottom ( ) ; int topOffset = firstTop - start ; final int lastBottom... | 243 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.