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-2611 | java | What can this be used also ? | to find the minimum height at which there could exist a given range count ) | static public int estimate Height ( final int entry Count , final int branching Factor ) { if ( entry Count < branching Factor ) return NUM ; final double logm = Math . log ( branching Factor ) ; final double logn = Math . log ( entry Count ) ; final double h = ( logm / logn ) - NUM ; return ( int ) Math . ceil ( h ) ;... | static public int estimateHeight ( final int entryCount , final int branchingFactor ) { if ( entryCount < branchingFactor ) return _NUM ; final double logm = Math . log ( branchingFactor ) ; final double logn = Math . log ( entryCount ) ; final double h = ( logm / logn ) - _NUM ; return ( int ) Math . ceil ( h ) ; } | 76 |
java-test-2612 | java | What does the code compute ? | the height of the b + tree | static public int estimate Height ( final int entry Count , final int branching Factor ) { if ( entry Count < branching Factor ) return NUM ; final double logm = Math . log ( branching Factor ) ; final double logn = Math . log ( entry Count ) ; final double h = ( logm / logn ) - NUM ; return ( int ) Math . ceil ( h ) ;... | static public int estimateHeight ( final int entryCount , final int branchingFactor ) { if ( entryCount < branchingFactor ) return _NUM ; final double logm = Math . log ( branchingFactor ) ; final double logn = Math . log ( entryCount ) ; final double h = ( logm / logn ) - _NUM ; return ( int ) Math . ceil ( h ) ; } | 76 |
java-test-2613 | java | Where could a given range count exist ? | the minimum height | static public int estimate Height ( final int entry Count , final int branching Factor ) { if ( entry Count < branching Factor ) return NUM ; final double logm = Math . log ( branching Factor ) ; final double logn = Math . log ( entry Count ) ; final double h = ( logm / logn ) - NUM ; return ( int ) Math . ceil ( h ) ;... | static public int estimateHeight ( final int entryCount , final int branchingFactor ) { if ( entryCount < branchingFactor ) return _NUM ; final double logm = Math . log ( branchingFactor ) ; final double logn = Math . log ( entryCount ) ; final double h = ( logm / logn ) - _NUM ; return ( int ) Math . ceil ( h ) ; } | 76 |
java-test-2616 | java | What does the code remove ? | the given option | public synchronized void remove Option ( String key ) { Key k = new Key ( key ) ; options . remove ( key ) ; Hash Set < String > on = option Names . get ( k . get Section Name ( ) ) ; if ( on != null ) { on . remove ( k . get Option Name ( ) ) ; if ( on . is Empty ( ) ) { cleanup Section ( k . get Section Name ( ) ) ; ... | public synchronized void removeOption ( String key ) { Key k = new Key ( key ) ; options . remove ( key ) ; HashSet < String > on = optionNames . get ( k . getSectionName ( ) ) ; if ( on != null ) { on . remove ( k . getOptionName ( ) ) ; if ( on . isEmpty ( ) ) { cleanupSection ( k . getSectionName ( ) ) ; } } } | 92 |
java-test-2617 | java | What does the code calculate ? | the coordinates for the length of a single bar | protected double [ ] calculate Bar L 0 L 1 ( double value ) { double lclip = get Lower Clip ( ) ; double uclip = get Upper Clip ( ) ; double bar Low = Math . min ( this . base , value ) ; double bar High = Math . max ( this . base , value ) ; if ( bar High < lclip ) { return null ; } if ( bar Low > uclip ) { return nul... | protected double [ ] calculateBarL0L1 ( double value ) { double lclip = getLowerClip ( ) ; double uclip = getUpperClip ( ) ; double barLow = Math . min ( this . base , value ) ; double barHigh = Math . max ( this . base , value ) ; if ( barHigh < lclip ) { return null ; } if ( barLow > uclip ) { return null ; } barLow ... | 127 |
java-test-2618 | java | What do an encoded run occupy ? | 3 characters | static final String array To RLE String ( short [ ] a ) { String Buffer buffer = new String Buffer ( ) ; buffer . append ( ( char ) ( a . length > > NUM ) ) ; buffer . append ( ( char ) a . length ) ; short run Value = a [ NUM ] ; int run Length = NUM ; for ( int i = NUM ; i < a . length ; ++ i ) { short s = a [ i ] ; ... | static final String arrayToRLEString ( short [ ] a ) { StringBuffer buffer = new StringBuffer ( ) ; buffer . append ( ( char ) ( a . length > > _NUM ) ) ; buffer . append ( ( char ) a . length ) ; short runValue = a [ _NUM ] ; int runLength = _NUM ; for ( int i = _NUM ; i < a . length ; ++ i ) { short s = a [ i ] ; if ... | 156 |
java-test-2619 | java | How do we represent this if we encounter a run where n = = escape ? | as : c escape n - 1 c | static final String array To RLE String ( short [ ] a ) { String Buffer buffer = new String Buffer ( ) ; buffer . append ( ( char ) ( a . length > > NUM ) ) ; buffer . append ( ( char ) a . length ) ; short run Value = a [ NUM ] ; int run Length = NUM ; for ( int i = NUM ; i < a . length ; ++ i ) { short s = a [ i ] ; ... | static final String arrayToRLEString ( short [ ] a ) { StringBuffer buffer = new StringBuffer ( ) ; buffer . append ( ( char ) ( a . length > > _NUM ) ) ; buffer . append ( ( char ) a . length ) ; short runValue = a [ _NUM ] ; int runLength = _NUM ; for ( int i = _NUM ; i < a . length ; ++ i ) { short s = a [ i ] ; if ... | 156 |
java-test-2620 | java | What do a string represent ? | a short array | static final String array To RLE String ( short [ ] a ) { String Buffer buffer = new String Buffer ( ) ; buffer . append ( ( char ) ( a . length > > NUM ) ) ; buffer . append ( ( char ) a . length ) ; short run Value = a [ NUM ] ; int run Length = NUM ; for ( int i = NUM ; i < a . length ; ++ i ) { short s = a [ i ] ; ... | static final String arrayToRLEString ( short [ ] a ) { StringBuffer buffer = new StringBuffer ( ) ; buffer . append ( ( char ) ( a . length > > _NUM ) ) ; buffer . append ( ( char ) a . length ) ; short runValue = a [ _NUM ] ; int runLength = _NUM ; for ( int i = _NUM ; i < a . length ; ++ i ) { short s = a [ i ] ; if ... | 156 |
java-test-2621 | java | What do we encounter ? | a run where n = = escape | static final String array To RLE String ( short [ ] a ) { String Buffer buffer = new String Buffer ( ) ; buffer . append ( ( char ) ( a . length > > NUM ) ) ; buffer . append ( ( char ) a . length ) ; short run Value = a [ NUM ] ; int run Length = NUM ; for ( int i = NUM ; i < a . length ; ++ i ) { short s = a [ i ] ; ... | static final String arrayToRLEString ( short [ ] a ) { StringBuffer buffer = new StringBuffer ( ) ; buffer . append ( ( char ) ( a . length > > _NUM ) ) ; buffer . append ( ( char ) a . length ) ; short runValue = a [ _NUM ] ; int runLength = _NUM ; for ( int i = _NUM ; i < a . length ; ++ i ) { short s = a [ i ] ; if ... | 156 |
java-test-2622 | java | What does the code generate ? | a sidc ( symbol identification coding scheme ) for an aircraft originating the given county and departure airport use type | private String create Aircraft Symbol Code ( String country , String airport Use ) { String identity ; if ( friends . contains ( country ) ) { identity = STRING ; } else if ( neutrals . contains ( country ) ) { identity = STRING ; } else if ( hostiles . contains ( country ) ) { identity = STRING ; } else { identity = S... | private String createAircraftSymbolCode ( String country , String airportUse ) { String identity ; if ( friends . contains ( country ) ) { identity = STRING ; } else if ( neutrals . contains ( country ) ) { identity = STRING ; } else if ( hostiles . contains ( country ) ) { identity = STRING ; } else { identity = STRIN... | 136 |
java-test-2623 | java | What is originating the given county and departure airport use type ? | an aircraft | private String create Aircraft Symbol Code ( String country , String airport Use ) { String identity ; if ( friends . contains ( country ) ) { identity = STRING ; } else if ( neutrals . contains ( country ) ) { identity = STRING ; } else if ( hostiles . contains ( country ) ) { identity = STRING ; } else { identity = S... | private String createAircraftSymbolCode ( String country , String airportUse ) { String identity ; if ( friends . contains ( country ) ) { identity = STRING ; } else if ( neutrals . contains ( country ) ) { identity = STRING ; } else if ( hostiles . contains ( country ) ) { identity = STRING ; } else { identity = STRIN... | 136 |
java-test-2624 | java | What do an aircraft originate ? | the given county and departure airport use type | private String create Aircraft Symbol Code ( String country , String airport Use ) { String identity ; if ( friends . contains ( country ) ) { identity = STRING ; } else if ( neutrals . contains ( country ) ) { identity = STRING ; } else if ( hostiles . contains ( country ) ) { identity = STRING ; } else { identity = S... | private String createAircraftSymbolCode ( String country , String airportUse ) { String identity ; if ( friends . contains ( country ) ) { identity = STRING ; } else if ( neutrals . contains ( country ) ) { identity = STRING ; } else if ( hostiles . contains ( country ) ) { identity = STRING ; } else { identity = STRIN... | 136 |
java-test-2625 | java | What do a hidden unit take ? | the provided number of inputs | protected Hidden Unit ( Unit [ ] units , double [ ] weights ) { this . units = units ; this . weights = new double [ weights . length ] ; System . arraycopy ( weights , NUM , this . weights , NUM , weights . length ) ; } | protected HiddenUnit ( Unit [ ] units , double [ ] weights ) { this . units = units ; this . weights = new double [ weights . length ] ; System . arraycopy ( weights , _NUM , this . weights , _NUM , weights . length ) ; } | 53 |
java-test-2626 | java | What does the initial weights set ? | to be a copy of the provided weights | protected Hidden Unit ( Unit [ ] units , double [ ] weights ) { this . units = units ; this . weights = new double [ weights . length ] ; System . arraycopy ( weights , NUM , this . weights , NUM , weights . length ) ; } | protected HiddenUnit ( Unit [ ] units , double [ ] weights ) { this . units = units ; this . weights = new double [ weights . length ] ; System . arraycopy ( weights , _NUM , this . weights , _NUM , weights . length ) ; } | 53 |
java-test-2627 | java | What sets to be a copy of the provided weights ? | the initial weights | protected Hidden Unit ( Unit [ ] units , double [ ] weights ) { this . units = units ; this . weights = new double [ weights . length ] ; System . arraycopy ( weights , NUM , this . weights , NUM , weights . length ) ; } | protected HiddenUnit ( Unit [ ] units , double [ ] weights ) { this . units = units ; this . weights = new double [ weights . length ] ; System . arraycopy ( weights , _NUM , this . weights , _NUM , weights . length ) ; } | 53 |
java-test-2628 | java | What is taking the provided number of inputs ? | a hidden unit | protected Hidden Unit ( Unit [ ] units , double [ ] weights ) { this . units = units ; this . weights = new double [ weights . length ] ; System . arraycopy ( weights , NUM , this . weights , NUM , weights . length ) ; } | protected HiddenUnit ( Unit [ ] units , double [ ] weights ) { this . units = units ; this . weights = new double [ weights . length ] ; System . arraycopy ( weights , _NUM , this . weights , _NUM , weights . length ) ; } | 53 |
java-test-2629 | java | What will it close ? | the server connection or the embedded connection | public void close ( ) throws Ade Internal Exception { if ( db Connection != null ) { try { db Connection . close ( ) ; } catch ( SQL Exception e ) { throw new Ade Internal Exception ( STRING , e ) ; } finally { db Connection = null ; } } if ( embedded DB Connection != null ) { close Embedded DB Connection ( ) ; } } | public void close ( ) throws AdeInternalException { if ( dbConnection != null ) { try { dbConnection . close ( ) ; } catch ( SQLException e ) { throw new AdeInternalException ( STRING , e ) ; } finally { dbConnection = null ; } } if ( embeddedDBConnection != null ) { closeEmbeddedDBConnection ( ) ; } } | 74 |
java-test-2630 | java | What can we have at any given time ? | only one | public void close ( ) throws Ade Internal Exception { if ( db Connection != null ) { try { db Connection . close ( ) ; } catch ( SQL Exception e ) { throw new Ade Internal Exception ( STRING , e ) ; } finally { db Connection = null ; } } if ( embedded DB Connection != null ) { close Embedded DB Connection ( ) ; } } | public void close ( ) throws AdeInternalException { if ( dbConnection != null ) { try { dbConnection . close ( ) ; } catch ( SQLException e ) { throw new AdeInternalException ( STRING , e ) ; } finally { dbConnection = null ; } } if ( embeddedDBConnection != null ) { closeEmbeddedDBConnection ( ) ; } } | 74 |
java-test-2631 | java | How does the code return it if possible ? | with the two higher - order bytes set to 0 | @ Override public int read ( ) throws IO Exception { synchronized ( lock ) { check Not Closed ( ) ; int ch = read Char ( ) ; if ( last Was CR && ch == STRING ) { ch = read Char ( ) ; } last Was CR = BOOL ; return ch ; } } | @ Override public int read ( ) throws IOException { synchronized ( lock ) { checkNotClosed ( ) ; int ch = readChar ( ) ; if ( lastWasCR && ch == STRING ) { ch = readChar ( ) ; } lastWasCR = _BOOL ; return ch ; } } | 60 |
java-test-2632 | java | What are bufferedreader returns ? | a character from the buffer | @ Override public int read ( ) throws IO Exception { synchronized ( lock ) { check Not Closed ( ) ; int ch = read Char ( ) ; if ( last Was CR && ch == STRING ) { ch = read Char ( ) ; } last Was CR = BOOL ; return ch ; } } | @ Override public int read ( ) throws IOException { synchronized ( lock ) { checkNotClosed ( ) ; int ch = readChar ( ) ; if ( lastWasCR && ch == STRING ) { ch = readChar ( ) ; } lastWasCR = _BOOL ; return ch ; } } | 60 |
java-test-2633 | java | What are returns a character from the buffer ? | bufferedreader | @ Override public int read ( ) throws IO Exception { synchronized ( lock ) { check Not Closed ( ) ; int ch = read Char ( ) ; if ( last Was CR && ch == STRING ) { ch = read Char ( ) ; } last Was CR = BOOL ; return ch ; } } | @ Override public int read ( ) throws IOException { synchronized ( lock ) { checkNotClosed ( ) ; int ch = readChar ( ) ; if ( lastWasCR && ch == STRING ) { ch = readChar ( ) ; } lastWasCR = _BOOL ; return ch ; } } | 60 |
java-test-2634 | java | What does the code authenticate against the remote servers ? | the username and password | public void authenticate ( String name , String password ) throws IO Exception , No Such Algorithm Exception , Reject Exception , Challenge Exception { Access Request req = create Access Request ( ) ; req . add Attribute ( new User Name Attribute ( name ) ) ; req . add Attribute ( new User Password Attribute ( req . ge... | public void authenticate ( String name , String password ) throws IOException , NoSuchAlgorithmException , RejectException , ChallengeException { AccessRequest req = createAccessRequest ( ) ; req . addAttribute ( new UserNameAttribute ( name ) ) ; req . addAttribute ( new UserPasswordAttribute ( req . getAuthenticator ... | 120 |
java-test-2637 | java | What did an analysis group delete ? | to the batchlist for each group in groupstodelete | private void delete Groups ( List < String > batch List , List < Group > groups To Delete ) { String delete Statement = STRING + GROUPS TABLE + STRING ; for ( Group group : groups To Delete ) { batch List . add ( String . format ( delete Statement , group . get Uid ( ) ) ) ; } } | private void deleteGroups ( List < String > batchList , List < Group > groupsToDelete ) { String deleteStatement = STRING + GROUPS_TABLE + STRING ; for ( Group group : groupsToDelete ) { batchList . add ( String . format ( deleteStatement , group . getUid ( ) ) ) ; } } | 65 |
java-test-2638 | java | What does the code add ? | a string representation of the sql batch command required to delete an analysis group to the batchlist for each group in groupstodelete | private void delete Groups ( List < String > batch List , List < Group > groups To Delete ) { String delete Statement = STRING + GROUPS TABLE + STRING ; for ( Group group : groups To Delete ) { batch List . add ( String . format ( delete Statement , group . get Uid ( ) ) ) ; } } | private void deleteGroups ( List < String > batchList , List < Group > groupsToDelete ) { String deleteStatement = STRING + GROUPS_TABLE + STRING ; for ( Group group : groupsToDelete ) { batchList . add ( String . format ( deleteStatement , group . getUid ( ) ) ) ; } } | 65 |
java-test-2639 | java | What deletes to the batchlist for each group in groupstodelete ? | an analysis group | private void delete Groups ( List < String > batch List , List < Group > groups To Delete ) { String delete Statement = STRING + GROUPS TABLE + STRING ; for ( Group group : groups To Delete ) { batch List . add ( String . format ( delete Statement , group . get Uid ( ) ) ) ; } } | private void deleteGroups ( List < String > batchList , List < Group > groupsToDelete ) { String deleteStatement = STRING + GROUPS_TABLE + STRING ; for ( Group group : groupsToDelete ) { batchList . add ( String . format ( deleteStatement , group . getUid ( ) ) ) ; } } | 65 |
java-test-2640 | java | When does the code add space if the card number is divisible by 4 ? | after every 4 characters | private String add Space To Card Number ( ) { final int split By = NUM ; final int length = m Card Number . length ( ) ; if ( length % split By != NUM || length <= split By ) { return m Card Number ; } else { final String Builder result = new String Builder ( ) ; result . append ( m Card Number . substring ( NUM , spli... | private String addSpaceToCardNumber ( ) { final int splitBy = _NUM ; final int length = mCardNumber . length ( ) ; if ( length % splitBy != _NUM || length <= splitBy ) { return mCardNumber ; } else { final StringBuilder result = new StringBuilder ( ) ; result . append ( mCardNumber . substring ( _NUM , splitBy ) ) ; fo... | 140 |
java-test-2641 | java | What are in the stream ? | size bytes | public static Big Int [ ] read Array Of Size Big Ints ( Input Stream in ) throws IO Exception { Vector A = new Vector ( ) ; int i = NUM ; try { do { A . add Element ( read Size Big Int ( in ) ) ; i ++ ; } while ( BOOL ) ; } catch ( IO Exception e ) { } Big Int [ ] bA = new Big Int [ i ] ; for ( int j = NUM ; j < i ; j ... | public static BigInt [ ] readArrayOfSizeBigInts ( InputStream in ) throws IOException { Vector A = new Vector ( ) ; int i = _NUM ; try { do { A . addElement ( readSizeBigInt ( in ) ) ; i ++ ; } while ( _BOOL ) ; } catch ( IOException e ) { } BigInt [ ] bA = new BigInt [ i ] ; for ( int j = _NUM ; j < i ; j ++ ) bA [ j ... | 118 |
java-test-2643 | java | What restores in a previous state ? | dhus | public static boolean restore ( ) { File restore Config = new File ( RESTORATION PROPERTIES ) ; if ( restore Config . exists ( ) && restore Config . is File ( ) ) { logger . info ( STRING ) ; try ( File Input Stream stream = new File Input Stream ( restore Config ) ) { Properties properties = new Properties ( ) ; prope... | public static boolean restore ( ) { File restoreConfig = new File ( RESTORATION_PROPERTIES ) ; if ( restoreConfig . exists ( ) && restoreConfig . isFile ( ) ) { logger . info ( STRING ) ; try ( FileInputStream stream = new FileInputStream ( restoreConfig ) ) { Properties properties = new Properties ( ) ; properties . l... | 151 |
java-test-2644 | java | Where does dhus restore ? | in a previous state | public static boolean restore ( ) { File restore Config = new File ( RESTORATION PROPERTIES ) ; if ( restore Config . exists ( ) && restore Config . is File ( ) ) { logger . info ( STRING ) ; try ( File Input Stream stream = new File Input Stream ( restore Config ) ) { Properties properties = new Properties ( ) ; prope... | public static boolean restore ( ) { File restoreConfig = new File ( RESTORATION_PROPERTIES ) ; if ( restoreConfig . exists ( ) && restoreConfig . isFile ( ) ) { logger . info ( STRING ) ; try ( FileInputStream stream = new FileInputStream ( restoreConfig ) ) { Properties properties = new Properties ( ) ; properties . l... | 151 |
java-test-2645 | java | What did the code show ? | that context menu in the table | private void display Popup Menu ( final Mouse Event event ) { final int selected Index = get Selection Index ( event ) ; if ( selected Index != - NUM ) { final J Popup Menu popup Menu = get Popup Menu ( event . get X ( ) , event . get Y ( ) , selected Index ) ; if ( popup Menu != null ) { popup Menu . show ( this , eve... | private void displayPopupMenu ( final MouseEvent event ) { final int selectedIndex = getSelectionIndex ( event ) ; if ( selectedIndex != - _NUM ) { final JPopupMenu popupMenu = getPopupMenu ( event . getX ( ) , event . getY ( ) , selectedIndex ) ; if ( popupMenu != null ) { popupMenu . show ( this , event . getX ( ) , ... | 95 |
java-test-2646 | java | What does the code add ? | a particular script engine for the executor to instantiate | public Builder add Engine Settings ( final String engine Name , final List < String > imports , final List < String > static Imports , final List < String > scripts , final Map < String , Object > config ) { if ( null == imports ) throw new Illegal Argument Exception ( STRING ) ; if ( null == static Imports ) throw new... | public Builder addEngineSettings ( final String engineName , final List < String > imports , final List < String > staticImports , final List < String > scripts , final Map < String , Object > config ) { if ( null == imports ) throw new IllegalArgumentException ( STRING ) ; if ( null == staticImports ) throw new Illega... | 137 |
java-test-2647 | java | How do executor process start ? | via running an async shell process | @ Visible For Testing protected Process start Executor Process ( int container ) { return Shell Utils . run A Sync Process ( get Executor Command ( container ) , new File ( Local Context . working Directory ( config ) ) , Integer . to String ( container ) ) ; } | @ VisibleForTesting protected Process startExecutorProcess ( int container ) { return ShellUtils . runASyncProcess ( getExecutorCommand ( container ) , new File ( LocalContext . workingDirectory ( config ) ) , Integer . toString ( container ) ) ; } | 53 |
java-test-2651 | java | What did that release give us ? | a literal regex flag as well as a quote method to produce literal regexes | public static String java Util Regex Escape ( String s ) { if ( s . index Of ( STRING ) == - NUM ) { return STRING + s + STRING ; } String Builder sb = new String Builder ( ) ; for ( int i = NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . char At ( i ) ) ; } return sb . to String ( ) ; } | public static String javaUtilRegexEscape ( String s ) { if ( s . indexOf ( STRING ) == - _NUM ) { return STRING + s + STRING ; } StringBuilder sb = new StringBuilder ( ) ; for ( int i = _NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . charAt ( i ) ) ; } return sb . toString ( ) ; } | 93 |
java-test-2652 | java | What is the code escapes so it can be used as part of a regex pattern ? | the special characters | public static String java Util Regex Escape ( String s ) { if ( s . index Of ( STRING ) == - NUM ) { return STRING + s + STRING ; } String Builder sb = new String Builder ( ) ; for ( int i = NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . char At ( i ) ) ; } return sb . to String ( ) ; } | public static String javaUtilRegexEscape ( String s ) { if ( s . indexOf ( STRING ) == - _NUM ) { return STRING + s + STRING ; } StringBuilder sb = new StringBuilder ( ) ; for ( int i = _NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . charAt ( i ) ) ; } return sb . toString ( ) ; } | 93 |
java-test-2653 | java | What gives a literal regex flag as well as a quote method to produce literal regexes us ? | that release | public static String java Util Regex Escape ( String s ) { if ( s . index Of ( STRING ) == - NUM ) { return STRING + s + STRING ; } String Builder sb = new String Builder ( ) ; for ( int i = NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . char At ( i ) ) ; } return sb . to String ( ) ; } | public static String javaUtilRegexEscape ( String s ) { if ( s . indexOf ( STRING ) == - _NUM ) { return STRING + s + STRING ; } StringBuilder sb = new StringBuilder ( ) ; for ( int i = _NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . charAt ( i ) ) ; } return sb . toString ( ) ; } | 93 |
java-test-2654 | java | When should this method be removed since that release gives us a literal regex flag as well as a quote method to produce literal regexes ? | when we move to the java version 1 . | public static String java Util Regex Escape ( String s ) { if ( s . index Of ( STRING ) == - NUM ) { return STRING + s + STRING ; } String Builder sb = new String Builder ( ) ; for ( int i = NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . char At ( i ) ) ; } return sb . to String ( ) ; } | public static String javaUtilRegexEscape ( String s ) { if ( s . indexOf ( STRING ) == - _NUM ) { return STRING + s + STRING ; } StringBuilder sb = new StringBuilder ( ) ; for ( int i = _NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . charAt ( i ) ) ; } return sb . toString ( ) ; } | 93 |
java-test-2655 | java | Why should this method be removed when we move to the java version 1 . ? | since that release gives us a literal regex flag as well as a quote method to produce literal regexes | public static String java Util Regex Escape ( String s ) { if ( s . index Of ( STRING ) == - NUM ) { return STRING + s + STRING ; } String Builder sb = new String Builder ( ) ; for ( int i = NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . char At ( i ) ) ; } return sb . to String ( ) ; } | public static String javaUtilRegexEscape ( String s ) { if ( s . indexOf ( STRING ) == - _NUM ) { return STRING + s + STRING ; } StringBuilder sb = new StringBuilder ( ) ; for ( int i = _NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . charAt ( i ) ) ; } return sb . toString ( ) ; } | 93 |
java-test-2656 | java | For what purpose is the code escapes the special characters ? | so it can be used as part of a regex pattern | public static String java Util Regex Escape ( String s ) { if ( s . index Of ( STRING ) == - NUM ) { return STRING + s + STRING ; } String Builder sb = new String Builder ( ) ; for ( int i = NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . char At ( i ) ) ; } return sb . to String ( ) ; } | public static String javaUtilRegexEscape ( String s ) { if ( s . indexOf ( STRING ) == - _NUM ) { return STRING + s + STRING ; } StringBuilder sb = new StringBuilder ( ) ; for ( int i = _NUM ; i < s . length ( ) ; i ++ ) { sb . append ( STRING ) ; sb . append ( s . charAt ( i ) ) ; } return sb . toString ( ) ; } | 93 |
java-test-2657 | java | What is applied to the rhs the lhs and rhs ? | splitassignments | protected List < Node > split Assignments ( Node node ) { if ( node instanceof Assignment Node ) { List < Node > result = new Array List < > ( ) ; Assignment Node a = ( Assignment Node ) node ; result . add ( a . get Target ( ) ) ; result . add All ( split Assignments ( a . get Expression ( ) ) ) ; return result ; } el... | protected List < Node > splitAssignments ( Node node ) { if ( node instanceof AssignmentNode ) { List < Node > result = new ArrayList < > ( ) ; AssignmentNode a = ( AssignmentNode ) node ; result . add ( a . getTarget ( ) ) ; result . addAll ( splitAssignments ( a . getExpression ( ) ) ) ; return result ; } else { retu... | 90 |
java-test-2658 | java | Where is splitassignments applied to the rhs recursively ? | the lhs and rhs | protected List < Node > split Assignments ( Node node ) { if ( node instanceof Assignment Node ) { List < Node > result = new Array List < > ( ) ; Assignment Node a = ( Assignment Node ) node ; result . add ( a . get Target ( ) ) ; result . add All ( split Assignments ( a . get Expression ( ) ) ) ; return result ; } el... | protected List < Node > splitAssignments ( Node node ) { if ( node instanceof AssignmentNode ) { List < Node > result = new ArrayList < > ( ) ; AssignmentNode a = ( AssignmentNode ) node ; result . add ( a . getTarget ( ) ) ; result . addAll ( splitAssignments ( a . getExpression ( ) ) ) ; return result ; } else { retu... | 90 |
java-test-2659 | java | What does the code return again ? | the node itself | protected List < Node > split Assignments ( Node node ) { if ( node instanceof Assignment Node ) { List < Node > result = new Array List < > ( ) ; Assignment Node a = ( Assignment Node ) node ; result . add ( a . get Target ( ) ) ; result . add All ( split Assignments ( a . get Expression ( ) ) ) ; return result ; } el... | protected List < Node > splitAssignments ( Node node ) { if ( node instanceof AssignmentNode ) { List < Node > result = new ArrayList < > ( ) ; AssignmentNode a = ( AssignmentNode ) node ; result . add ( a . getTarget ( ) ) ; result . addAll ( splitAssignments ( a . getExpression ( ) ) ) ; return result ; } else { retu... | 90 |
java-test-2660 | java | What does the code return if the node is an assignment node ? | the lhs and rhs ( where splitassignments is applied recursively to the rhs ) | protected List < Node > split Assignments ( Node node ) { if ( node instanceof Assignment Node ) { List < Node > result = new Array List < > ( ) ; Assignment Node a = ( Assignment Node ) node ; result . add ( a . get Target ( ) ) ; result . add All ( split Assignments ( a . get Expression ( ) ) ) ; return result ; } el... | protected List < Node > splitAssignments ( Node node ) { if ( node instanceof AssignmentNode ) { List < Node > result = new ArrayList < > ( ) ; AssignmentNode a = ( AssignmentNode ) node ; result . add ( a . getTarget ( ) ) ; result . addAll ( splitAssignments ( a . getExpression ( ) ) ) ; return result ; } else { retu... | 90 |
java-test-2661 | java | When does the code return the lhs and rhs ( where splitassignments is applied recursively to the rhs ) ? | if the node is an assignment node | protected List < Node > split Assignments ( Node node ) { if ( node instanceof Assignment Node ) { List < Node > result = new Array List < > ( ) ; Assignment Node a = ( Assignment Node ) node ; result . add ( a . get Target ( ) ) ; result . add All ( split Assignments ( a . get Expression ( ) ) ) ; return result ; } el... | protected List < Node > splitAssignments ( Node node ) { if ( node instanceof AssignmentNode ) { List < Node > result = new ArrayList < > ( ) ; AssignmentNode a = ( AssignmentNode ) node ; result . add ( a . getTarget ( ) ) ; result . addAll ( splitAssignments ( a . getExpression ( ) ) ) ; return result ; } else { retu... | 90 |
java-test-2669 | java | What does the code add to the classpath of the target project ? | classpath entry | public void add Element To Target Project Class Path ( String element ) throws Illegal Argument Exception { check If Valid Classpath Entry ( element ) ; get Target Project Classpath ( ) ; if ( target Class Path == null || target Class Path . is Empty ( ) ) { target Class Path = element ; } else { if ( target Class Path... | public void addElementToTargetProjectClassPath ( String element ) throws IllegalArgumentException { checkIfValidClasspathEntry ( element ) ; getTargetProjectClasspath ( ) ; if ( targetClassPath == null || targetClassPath . isEmpty ( ) ) { targetClassPath = element ; } else { if ( targetClassPath . contains ( element ) ... | 97 |
java-test-2671 | java | What does the code clear ? | the list of recent files | public static void clear Recent Files ( ) { String str = Program Properties . get ( RECENTFILES , STRING ) ; if ( str . length ( ) != NUM ) { Program Properties . put ( RECENTFILES , STRING ) ; notify List Change ( RECENTFILES ) ; } } | public static void clearRecentFiles ( ) { String str = ProgramProperties . get ( RECENTFILES , STRING ) ; if ( str . length ( ) != _NUM ) { ProgramProperties . put ( RECENTFILES , STRING ) ; notifyListChange ( RECENTFILES ) ; } } | 52 |
java-test-2672 | java | When did method call ? | when an asynchronous insert operation is done | @ Override public void on Insert Complete ( int task Id , Object cookie , long insert Row Id ) { if ( task Id == App Constants . Query Tokens . INSERT WALLPOST && insert Row Id != - NUM ) { Logger . i ( TAG , STRING + insert Row Id ) ; } } | @ Override public void onInsertComplete ( int taskId , Object cookie , long insertRowId ) { if ( taskId == AppConstants . QueryTokens . INSERT_WALLPOST && insertRowId != - _NUM ) { Logger . i ( TAG , STRING + insertRowId ) ; } } | 58 |
java-test-2673 | java | When is its altnetworkdevice not is null ? | when the calling code did not already supply a value for this field | private void update Alt Deviceid ( Network FC Zone Info fabric Info , String fabric Id , String fabric WWN , String key , Map < String , Network Lite > fabric Id 2 Network ) { if ( fabric Info != null && fabric Info . get Alt Network Device Id ( ) == null ) { if ( fabric Id 2 Network . get ( key ) == null ) { Network L... | private void updateAltDeviceid ( NetworkFCZoneInfo fabricInfo , String fabricId , String fabricWWN , String key , Map < String , NetworkLite > fabricId2Network ) { if ( fabricInfo != null && fabricInfo . getAltNetworkDeviceId ( ) == null ) { if ( fabricId2Network . get ( key ) == null ) { NetworkLite network = NetworkU... | 191 |
java-test-2674 | java | What does every fabricinfo have ? | its altnetworkdevice that is not null when the calling code did not already supply a value for this field | private void update Alt Deviceid ( Network FC Zone Info fabric Info , String fabric Id , String fabric WWN , String key , Map < String , Network Lite > fabric Id 2 Network ) { if ( fabric Info != null && fabric Info . get Alt Network Device Id ( ) == null ) { if ( fabric Id 2 Network . get ( key ) == null ) { Network L... | private void updateAltDeviceid ( NetworkFCZoneInfo fabricInfo , String fabricId , String fabricWWN , String key , Map < String , NetworkLite > fabricId2Network ) { if ( fabricInfo != null && fabricInfo . getAltNetworkDeviceId ( ) == null ) { if ( fabricId2Network . get ( key ) == null ) { NetworkLite network = NetworkU... | 191 |
java-test-2675 | java | What did not supply a value for this field when when ? | the calling code | private void update Alt Deviceid ( Network FC Zone Info fabric Info , String fabric Id , String fabric WWN , String key , Map < String , Network Lite > fabric Id 2 Network ) { if ( fabric Info != null && fabric Info . get Alt Network Device Id ( ) == null ) { if ( fabric Id 2 Network . get ( key ) == null ) { Network L... | private void updateAltDeviceid ( NetworkFCZoneInfo fabricInfo , String fabricId , String fabricWWN , String key , Map < String , NetworkLite > fabricId2Network ) { if ( fabricInfo != null && fabricInfo . getAltNetworkDeviceId ( ) == null ) { if ( fabricId2Network . get ( key ) == null ) { NetworkLite network = NetworkU... | 191 |
java-test-2676 | java | What did the calling code not supply when when ? | a value for this field | private void update Alt Deviceid ( Network FC Zone Info fabric Info , String fabric Id , String fabric WWN , String key , Map < String , Network Lite > fabric Id 2 Network ) { if ( fabric Info != null && fabric Info . get Alt Network Device Id ( ) == null ) { if ( fabric Id 2 Network . get ( key ) == null ) { Network L... | private void updateAltDeviceid ( NetworkFCZoneInfo fabricInfo , String fabricId , String fabricWWN , String key , Map < String , NetworkLite > fabricId2Network ) { if ( fabricInfo != null && fabricInfo . getAltNetworkDeviceId ( ) == null ) { if ( fabricId2Network . get ( key ) == null ) { NetworkLite network = NetworkU... | 191 |
java-test-2677 | java | What has its altnetworkdevice that is not null when the calling code did not already supply a value for this field ? | every fabricinfo | private void update Alt Deviceid ( Network FC Zone Info fabric Info , String fabric Id , String fabric WWN , String key , Map < String , Network Lite > fabric Id 2 Network ) { if ( fabric Info != null && fabric Info . get Alt Network Device Id ( ) == null ) { if ( fabric Id 2 Network . get ( key ) == null ) { Network L... | private void updateAltDeviceid ( NetworkFCZoneInfo fabricInfo , String fabricId , String fabricWWN , String key , Map < String , NetworkLite > fabricId2Network ) { if ( fabricInfo != null && fabricInfo . getAltNetworkDeviceId ( ) == null ) { if ( fabricId2Network . get ( key ) == null ) { NetworkLite network = NetworkU... | 191 |
java-test-2678 | java | Did the calling code supply a value for this field when when ? | No | private void update Alt Deviceid ( Network FC Zone Info fabric Info , String fabric Id , String fabric WWN , String key , Map < String , Network Lite > fabric Id 2 Network ) { if ( fabric Info != null && fabric Info . get Alt Network Device Id ( ) == null ) { if ( fabric Id 2 Network . get ( key ) == null ) { Network L... | private void updateAltDeviceid ( NetworkFCZoneInfo fabricInfo , String fabricId , String fabricWWN , String key , Map < String , NetworkLite > fabricId2Network ) { if ( fabricInfo != null && fabricInfo . getAltNetworkDeviceId ( ) == null ) { if ( fabricId2Network . get ( key ) == null ) { NetworkLite network = NetworkU... | 191 |
java-test-2683 | java | How do the details field refresh ? | using the selection | protected void handle Selected ( Structured Selection selection ) { I Status status = new Status ( I Status . OK , Platform UI . PLUGIN ID , I Status . OK , EMPTY STRING , null ) ; Object [ ] last Selection = current Selection ; current Selection = selection . to Array ( ) ; if ( selection . size ( ) == NUM ) { status ... | protected void handleSelected ( StructuredSelection selection ) { IStatus status = new Status ( IStatus . OK , PlatformUI . PLUGIN_ID , IStatus . OK , EMPTY_STRING , null ) ; Object [ ] lastSelection = currentSelection ; currentSelection = selection . toArray ( ) ; if ( selection . size ( ) == _NUM ) { status = new Sta... | 352 |
java-test-2684 | java | How do selection in the items list handle ? | by updating labels of selected and unselected items | protected void handle Selected ( Structured Selection selection ) { I Status status = new Status ( I Status . OK , Platform UI . PLUGIN ID , I Status . OK , EMPTY STRING , null ) ; Object [ ] last Selection = current Selection ; current Selection = selection . to Array ( ) ; if ( selection . size ( ) == NUM ) { status ... | protected void handleSelected ( StructuredSelection selection ) { IStatus status = new Status ( IStatus . OK , PlatformUI . PLUGIN_ID , IStatus . OK , EMPTY_STRING , null ) ; Object [ ] lastSelection = currentSelection ; currentSelection = selection . toArray ( ) ; if ( selection . size ( ) == _NUM ) { status = new Sta... | 352 |
java-test-2687 | java | What does the code write ? | a table with one column for each map entry | public static void write Boxplot ( T Double Object Hash Map < double [ ] > table , String file ) throws IO Exception { int max Size = NUM ; T Double Object Iterator < double [ ] > it = table . iterator ( ) ; for ( int i = NUM ; i < table . size ( ) ; i ++ ) { it . advance ( ) ; max Size = Math . max ( max Size , it . v... | public static void writeBoxplot ( TDoubleObjectHashMap < double [ ] > table , String file ) throws IOException { int maxSize = _NUM ; TDoubleObjectIterator < double [ ] > it = table . iterator ( ) ; for ( int i = _NUM ; i < table . size ( ) ; i ++ ) { it . advance ( ) ; maxSize = Math . max ( maxSize , it . value ( ) .... | 302 |
java-test-2688 | java | What do this function use ? | to create boxplots | public static void write Boxplot ( T Double Object Hash Map < double [ ] > table , String file ) throws IO Exception { int max Size = NUM ; T Double Object Iterator < double [ ] > it = table . iterator ( ) ; for ( int i = NUM ; i < table . size ( ) ; i ++ ) { it . advance ( ) ; max Size = Math . max ( max Size , it . v... | public static void writeBoxplot ( TDoubleObjectHashMap < double [ ] > table , String file ) throws IOException { int maxSize = _NUM ; TDoubleObjectIterator < double [ ] > it = table . iterator ( ) ; for ( int i = _NUM ; i < table . size ( ) ; i ++ ) { it . advance ( ) ; maxSize = Math . max ( maxSize , it . value ( ) .... | 302 |
java-test-2694 | java | What does the code do ? | something to insert a variable request into the script | public void insert Variable ( ) { Script Step variable Step = Script Step Factory . create Variable ( get Variable Key ( ) , get Variable Value ( ) ) ; steps . add ( get Insert Index ( ) , variable Step ) ; variable Key = STRING ; variable Value = STRING ; reindex Script Steps ( ) ; } | public void insertVariable ( ) { ScriptStep variableStep = ScriptStepFactory . createVariable ( getVariableKey ( ) , getVariableValue ( ) ) ; steps . add ( getInsertIndex ( ) , variableStep ) ; variableKey = STRING ; variableValue = STRING ; reindexScriptSteps ( ) ; } | 63 |
java-test-2695 | java | How does that follow ? | with bidi reordering of the unidirectional view fragments | protected int layout Row ( Flow View fv , int row Index , int p0 ) { int p1 = super . layout Row ( fv , row Index , p0 ) ; View row = fv . get View ( row Index ) ; Document doc = fv . get Document ( ) ; Object i18 n Flag = doc . get Property ( Abstract Document . I18 N Property ) ; if ( ( i18 n Flag != null ) && i18 n ... | protected int layoutRow ( FlowView fv , int rowIndex , int p0 ) { int p1 = super . layoutRow ( fv , rowIndex , p0 ) ; View row = fv . getView ( rowIndex ) ; Document doc = fv . getDocument ( ) ; Object i18nFlag = doc . getProperty ( AbstractDocument . I18NProperty ) ; if ( ( i18nFlag != null ) && i18nFlag . equals ( Bo... | 283 |
java-test-2696 | java | What does the code create ? | a row of views that will fit within the layout span of the row | protected int layout Row ( Flow View fv , int row Index , int p0 ) { int p1 = super . layout Row ( fv , row Index , p0 ) ; View row = fv . get View ( row Index ) ; Document doc = fv . get Document ( ) ; Object i18 n Flag = doc . get Property ( Abstract Document . I18 N Property ) ; if ( ( i18 n Flag != null ) && i18 n ... | protected int layoutRow ( FlowView fv , int rowIndex , int p0 ) { int p1 = super . layoutRow ( fv , rowIndex , p0 ) ; View row = fv . getView ( rowIndex ) ; Document doc = fv . getDocument ( ) ; Object i18nFlag = doc . getProperty ( AbstractDocument . I18NProperty ) ; if ( ( i18nFlag != null ) && i18nFlag . equals ( Bo... | 283 |
java-test-2697 | java | What fills the row with child views or view fragments ? | the superclass functionality | protected int layout Row ( Flow View fv , int row Index , int p0 ) { int p1 = super . layout Row ( fv , row Index , p0 ) ; View row = fv . get View ( row Index ) ; Document doc = fv . get Document ( ) ; Object i18 n Flag = doc . get Property ( Abstract Document . I18 N Property ) ; if ( ( i18 n Flag != null ) && i18 n ... | protected int layoutRow ( FlowView fv , int rowIndex , int p0 ) { int p1 = super . layoutRow ( fv , rowIndex , p0 ) ; View row = fv . getView ( rowIndex ) ; Document doc = fv . getDocument ( ) ; Object i18nFlag = doc . getProperty ( AbstractDocument . I18NProperty ) ; if ( ( i18nFlag != null ) && i18nFlag . equals ( Bo... | 283 |
java-test-2698 | java | For what purpose is this implemented ? | to execute the superclass functionality ( which fills the row with child views or view fragments ) and follow that with bidi reordering of the unidirectional view fragments | protected int layout Row ( Flow View fv , int row Index , int p0 ) { int p1 = super . layout Row ( fv , row Index , p0 ) ; View row = fv . get View ( row Index ) ; Document doc = fv . get Document ( ) ; Object i18 n Flag = doc . get Property ( Abstract Document . I18 N Property ) ; if ( ( i18 n Flag != null ) && i18 n ... | protected int layoutRow ( FlowView fv , int rowIndex , int p0 ) { int p1 = super . layoutRow ( fv , rowIndex , p0 ) ; View row = fv . getView ( rowIndex ) ; Document doc = fv . getDocument ( ) ; Object i18nFlag = doc . getProperty ( AbstractDocument . I18NProperty ) ; if ( ( i18nFlag != null ) && i18nFlag . equals ( Bo... | 283 |
java-test-2699 | java | Where do the interval divide ? | a mid entry | long calculate Mid Entry ( long lo Val , long hi Val , final double dfp , long lo Entry , long hi Entry ) { final double dhi = ( double ) hi Entry ; final double dlo = ( double ) lo Entry ; final double dhi Val = ( double ) hi Val ; final double dlo Val = ( double ) lo Val ; long mid Entry = lo Entry + ( long ) ( ( dhi... | long calculateMidEntry ( long loVal , long hiVal , final double dfp , long loEntry , long hiEntry ) { final double dhi = ( double ) hiEntry ; final double dlo = ( double ) loEntry ; final double dhiVal = ( double ) hiVal ; final double dloVal = ( double ) loVal ; long midEntry = loEntry + ( long ) ( ( dhi - dlo ) * ( d... | 120 |
java-test-2700 | java | What does the code calculate ? | a mid entry where to divide the interval | long calculate Mid Entry ( long lo Val , long hi Val , final double dfp , long lo Entry , long hi Entry ) { final double dhi = ( double ) hi Entry ; final double dlo = ( double ) lo Entry ; final double dhi Val = ( double ) hi Val ; final double dlo Val = ( double ) lo Val ; long mid Entry = lo Entry + ( long ) ( ( dhi... | long calculateMidEntry ( long loVal , long hiVal , final double dfp , long loEntry , long hiEntry ) { final double dhi = ( double ) hiEntry ; final double dlo = ( double ) loEntry ; final double dhiVal = ( double ) hiVal ; final double dloVal = ( double ) loVal ; long midEntry = loEntry + ( long ) ( ( dhi - dlo ) * ( d... | 120 |
java-test-2701 | java | What do all synth painted text force ? | to be antialiased | @ Override public void paint Text ( Synth Context ss , Graphics g , String text , int x , int y , int mnemonic Index ) { Graphics 2 D g2 = ( Graphics 2 D ) g ; if ( desktop Hints == null ) { Toolkit toolkit = Toolkit . get Default Toolkit ( ) ; desktop Hints = ( Map < ? , ? > ) ( toolkit . get Desktop Property ( STRING... | @ Override public void paintText ( SynthContext ss , Graphics g , String text , int x , int y , int mnemonicIndex ) { Graphics2D g2 = ( Graphics2D ) g ; if ( desktopHints == null ) { Toolkit toolkit = Toolkit . getDefaultToolkit ( ) ; desktopHints = ( Map < ? , ? > ) ( toolkit . getDesktopProperty ( STRING ) ) ; } Obje... | 233 |
java-test-2702 | java | What forces to be antialiased ? | all synth painted text | @ Override public void paint Text ( Synth Context ss , Graphics g , String text , int x , int y , int mnemonic Index ) { Graphics 2 D g2 = ( Graphics 2 D ) g ; if ( desktop Hints == null ) { Toolkit toolkit = Toolkit . get Default Toolkit ( ) ; desktop Hints = ( Map < ? , ? > ) ( toolkit . get Desktop Property ( STRING... | @ Override public void paintText ( SynthContext ss , Graphics g , String text , int x , int y , int mnemonicIndex ) { Graphics2D g2 = ( Graphics2D ) g ; if ( desktopHints == null ) { Toolkit toolkit = Toolkit . getDefaultToolkit ( ) ; desktopHints = ( Map < ? , ? > ) ( toolkit . getDesktopProperty ( STRING ) ) ; } Obje... | 233 |
java-test-2703 | java | What considers all combinations of pairs to merge ? | each phase of the greedy algorithm | private static Planning Co Coding Group [ ] find Cocodes Brute Force ( Compressed Size Estimator size Estimator , float num Rows Weight , Planning Co Coding Group [ ] singlton Groups ) { Priority Queue < Planning Group Merge Action > q = new Priority Queue < Planning Group Merge Action > ( ) ; for ( int left Ix = NUM ;... | private static PlanningCoCodingGroup [ ] findCocodesBruteForce ( CompressedSizeEstimator sizeEstimator , float numRowsWeight , PlanningCoCodingGroup [ ] singltonGroups ) { PriorityQueue < PlanningGroupMergeAction > q = new PriorityQueue < PlanningGroupMergeAction > ( ) ; for ( int leftIx = _NUM ; leftIx < singltonGroup... | 562 |
java-test-2704 | java | What do each phase of the greedy algorithm consider ? | all combinations of pairs to merge | private static Planning Co Coding Group [ ] find Cocodes Brute Force ( Compressed Size Estimator size Estimator , float num Rows Weight , Planning Co Coding Group [ ] singlton Groups ) { Priority Queue < Planning Group Merge Action > q = new Priority Queue < Planning Group Merge Action > ( ) ; for ( int left Ix = NUM ;... | private static PlanningCoCodingGroup [ ] findCocodesBruteForce ( CompressedSizeEstimator sizeEstimator , float numRowsWeight , PlanningCoCodingGroup [ ] singltonGroups ) { PriorityQueue < PlanningGroupMergeAction > q = new PriorityQueue < PlanningGroupMergeAction > ( ) ; for ( int leftIx = _NUM ; leftIx < singltonGroup... | 562 |
java-test-2705 | java | What does a greedy approach merge into larger groups ? | pairs of column groups | private static Planning Co Coding Group [ ] find Cocodes Brute Force ( Compressed Size Estimator size Estimator , float num Rows Weight , Planning Co Coding Group [ ] singlton Groups ) { Priority Queue < Planning Group Merge Action > q = new Priority Queue < Planning Group Merge Action > ( ) ; for ( int left Ix = NUM ;... | private static PlanningCoCodingGroup [ ] findCocodesBruteForce ( CompressedSizeEstimator sizeEstimator , float numRowsWeight , PlanningCoCodingGroup [ ] singltonGroups ) { PriorityQueue < PlanningGroupMergeAction > q = new PriorityQueue < PlanningGroupMergeAction > ( ) ; for ( int leftIx = _NUM ; leftIx < singltonGroup... | 562 |
java-test-2706 | java | What does the code identify together ? | columns to code | private static Planning Co Coding Group [ ] find Cocodes Brute Force ( Compressed Size Estimator size Estimator , float num Rows Weight , Planning Co Coding Group [ ] singlton Groups ) { Priority Queue < Planning Group Merge Action > q = new Priority Queue < Planning Group Merge Action > ( ) ; for ( int left Ix = NUM ;... | private static PlanningCoCodingGroup [ ] findCocodesBruteForce ( CompressedSizeEstimator sizeEstimator , float numRowsWeight , PlanningCoCodingGroup [ ] singltonGroups ) { PriorityQueue < PlanningGroupMergeAction > q = new PriorityQueue < PlanningGroupMergeAction > ( ) ; for ( int leftIx = _NUM ; leftIx < singltonGroup... | 562 |
java-test-2707 | java | What does the code use ? | a greedy approach that merges pairs of column groups into larger groups | private static Planning Co Coding Group [ ] find Cocodes Brute Force ( Compressed Size Estimator size Estimator , float num Rows Weight , Planning Co Coding Group [ ] singlton Groups ) { Priority Queue < Planning Group Merge Action > q = new Priority Queue < Planning Group Merge Action > ( ) ; for ( int left Ix = NUM ;... | private static PlanningCoCodingGroup [ ] findCocodesBruteForce ( CompressedSizeEstimator sizeEstimator , float numRowsWeight , PlanningCoCodingGroup [ ] singltonGroups ) { PriorityQueue < PlanningGroupMergeAction > q = new PriorityQueue < PlanningGroupMergeAction > ( ) ; for ( int leftIx = _NUM ; leftIx < singltonGroup... | 562 |
java-test-2708 | java | What merges pairs of column groups into larger groups ? | a greedy approach | private static Planning Co Coding Group [ ] find Cocodes Brute Force ( Compressed Size Estimator size Estimator , float num Rows Weight , Planning Co Coding Group [ ] singlton Groups ) { Priority Queue < Planning Group Merge Action > q = new Priority Queue < Planning Group Merge Action > ( ) ; for ( int left Ix = NUM ;... | private static PlanningCoCodingGroup [ ] findCocodesBruteForce ( CompressedSizeEstimator sizeEstimator , float numRowsWeight , PlanningCoCodingGroup [ ] singltonGroups ) { PriorityQueue < PlanningGroupMergeAction > q = new PriorityQueue < PlanningGroupMergeAction > ( ) ; for ( int leftIx = _NUM ; leftIx < singltonGroup... | 562 |
java-test-2709 | java | What does the code ensure so that it ' s safe to modify ? | we own term . bytes | void ensure Own Term Bytes ( ) { NR Cell cell 0 = cells By Level [ NUM ] ; if ( cell 0 . term Buf == null ) return ; System . arraycopy ( term . bytes , term . offset , cell 0 . term Buf , NUM , term . length ) ; term . bytes = cell 0 . term Buf ; term . offset = NUM ; cell 0 . term Buf = null ; } | void ensureOwnTermBytes ( ) { NRCell cell0 = cellsByLevel [ _NUM ] ; if ( cell0 . termBuf == null ) return ; System . arraycopy ( term . bytes , term . offset , cell0 . termBuf , _NUM , term . length ) ; term . bytes = cell0 . termBuf ; term . offset = _NUM ; cell0 . termBuf = null ; } | 82 |
java-test-2710 | java | What do we own ? | term | void ensure Own Term Bytes ( ) { NR Cell cell 0 = cells By Level [ NUM ] ; if ( cell 0 . term Buf == null ) return ; System . arraycopy ( term . bytes , term . offset , cell 0 . term Buf , NUM , term . length ) ; term . bytes = cell 0 . term Buf ; term . offset = NUM ; cell 0 . term Buf = null ; } | void ensureOwnTermBytes ( ) { NRCell cell0 = cellsByLevel [ _NUM ] ; if ( cell0 . termBuf == null ) return ; System . arraycopy ( term . bytes , term . offset , cell0 . termBuf , _NUM , term . length ) ; term . bytes = cell0 . termBuf ; term . offset = _NUM ; cell0 . termBuf = null ; } | 82 |
java-test-2711 | java | For what purpose does the code ensure we own term . bytes ? | so that it ' s safe to modify | void ensure Own Term Bytes ( ) { NR Cell cell 0 = cells By Level [ NUM ] ; if ( cell 0 . term Buf == null ) return ; System . arraycopy ( term . bytes , term . offset , cell 0 . term Buf , NUM , term . length ) ; term . bytes = cell 0 . term Buf ; term . offset = NUM ; cell 0 . term Buf = null ; } | void ensureOwnTermBytes ( ) { NRCell cell0 = cellsByLevel [ _NUM ] ; if ( cell0 . termBuf == null ) return ; System . arraycopy ( term . bytes , term . offset , cell0 . termBuf , _NUM , term . length ) ; term . bytes = cell0 . termBuf ; term . offset = _NUM ; cell0 . termBuf = null ; } | 82 |
java-test-2712 | java | How do we detect ? | via a kluge in which cellsbylevel [ 0 ] . termbuf is non - null , which is a pre - allocated for use to replace term . bytes | void ensure Own Term Bytes ( ) { NR Cell cell 0 = cells By Level [ NUM ] ; if ( cell 0 . term Buf == null ) return ; System . arraycopy ( term . bytes , term . offset , cell 0 . term Buf , NUM , term . length ) ; term . bytes = cell 0 . term Buf ; term . offset = NUM ; cell 0 . term Buf = null ; } | void ensureOwnTermBytes ( ) { NRCell cell0 = cellsByLevel [ _NUM ] ; if ( cell0 . termBuf == null ) return ; System . arraycopy ( term . bytes , term . offset , cell0 . termBuf , _NUM , term . length ) ; term . bytes = cell0 . termBuf ; term . offset = _NUM ; cell0 . termBuf = null ; } | 82 |
java-test-2713 | java | What does the code perform in the iterable container ? | the given operation on each of the values | public static < T > void for Each ( Mongo Iterable < T > iterable , Consumer < T > operation ) { try ( Mongo Cursor < T > cursor = iterable . iterator ( ) ) { while ( cursor . has Next ( ) ) { operation . accept ( cursor . next ( ) ) ; } } } | public static < T > void forEach ( MongoIterable < T > iterable , Consumer < T > operation ) { try ( MongoCursor < T > cursor = iterable . iterator ( ) ) { while ( cursor . hasNext ( ) ) { operation . accept ( cursor . next ( ) ) ; } } } | 63 |
java-test-2714 | java | Where does the code perform the given operation on each of the values ? | in the iterable container | public static < T > void for Each ( Mongo Iterable < T > iterable , Consumer < T > operation ) { try ( Mongo Cursor < T > cursor = iterable . iterator ( ) ) { while ( cursor . has Next ( ) ) { operation . accept ( cursor . next ( ) ) ; } } } | public static < T > void forEach ( MongoIterable < T > iterable , Consumer < T > operation ) { try ( MongoCursor < T > cursor = iterable . iterator ( ) ) { while ( cursor . hasNext ( ) ) { operation . accept ( cursor . next ( ) ) ; } } } | 63 |
java-test-2715 | java | What does the code write ? | a string , not a char [ ] . like dataoutputstream . writechars , flip endianness of each char | @ Override public final void write Chars ( String s ) throws IO Exception { int len = s . length ( ) ; for ( int i = NUM ; i < len ; i ++ ) { write Char ( s . char At ( i ) ) ; } } | @ Override public final void writeChars ( String s ) throws IOException { int len = s . length ( ) ; for ( int i = _NUM ; i < len ; i ++ ) { writeChar ( s . charAt ( i ) ) ; } } | 53 |
java-test-2721 | java | What has a different index ? | the first code point | public int next Font Run Index ( Code Point Iterator iter ) { int cp = iter . next ( ) ; int font Index = NUM ; if ( cp != Code Point Iterator . DONE ) { font Index = get Font Index ( cp ) ; while ( ( cp = iter . next ( ) ) != Code Point Iterator . DONE ) { if ( get Font Index ( cp ) != font Index ) { iter . prev ( ) ;... | public int nextFontRunIndex ( CodePointIterator iter ) { int cp = iter . next ( ) ; int fontIndex = _NUM ; if ( cp != CodePointIterator . DONE ) { fontIndex = getFontIndex ( cp ) ; while ( ( cp = iter . next ( ) ) != CodePointIterator . DONE ) { if ( getFontIndex ( cp ) != fontIndex ) { iter . prev ( ) ; break ; } } } ... | 97 |
java-test-2722 | java | What does the first code point have ? | a different index | public int next Font Run Index ( Code Point Iterator iter ) { int cp = iter . next ( ) ; int font Index = NUM ; if ( cp != Code Point Iterator . DONE ) { font Index = get Font Index ( cp ) ; while ( ( cp = iter . next ( ) ) != Code Point Iterator . DONE ) { if ( get Font Index ( cp ) != font Index ) { iter . prev ( ) ;... | public int nextFontRunIndex ( CodePointIterator iter ) { int cp = iter . next ( ) ; int fontIndex = _NUM ; if ( cp != CodePointIterator . DONE ) { fontIndex = getFontIndex ( cp ) ; while ( ( cp = iter . next ( ) ) != CodePointIterator . DONE ) { if ( getFontIndex ( cp ) != fontIndex ) { iter . prev ( ) ; break ; } } } ... | 97 |
java-test-2723 | java | What does the code initiate ? | a pre load | private void preload ( int first , boolean increasing ) { final int start ; final int end ; if ( increasing ) { start = Math . max ( first , m Last End ) ; end = Math . min ( first + m Load Ahead Items , m Item Source . get Count ( ) ) ; } else { start = Math . max ( NUM , first - m Load Ahead Items ) ; end = Math . mi... | private void preload ( int first , boolean increasing ) { final int start ; final int end ; if ( increasing ) { start = Math . max ( first , mLastEnd ) ; end = Math . min ( first + mLoadAheadItems , mItemSource . getCount ( ) ) ; } else { start = Math . max ( _NUM , first - mLoadAheadItems ) ; end = Math . min ( first ... | 193 |
java-test-2724 | java | What does the code create ? | a new generator object with properties loaded from a file | public Generator ( String prop File ) { try { Buffered Input Stream bi = null ; try { bi = new Buffered Input Stream ( new File Input Stream ( prop File ) ) ; props . load ( bi ) ; } finally { if ( bi != null ) { bi . close ( ) ; } } } catch ( Exception e ) { set Default Props ( ) ; } } | public Generator ( String propFile ) { try { BufferedInputStream bi = null ; try { bi = new BufferedInputStream ( new FileInputStream ( propFile ) ) ; props . load ( bi ) ; } finally { if ( bi != null ) { bi . close ( ) ; } } } catch ( Exception e ) { setDefaultProps ( ) ; } } | 76 |
java-test-2725 | java | When do any other exception occur ? | during the reading operation | public Generator ( String prop File ) { try { Buffered Input Stream bi = null ; try { bi = new Buffered Input Stream ( new File Input Stream ( prop File ) ) ; props . load ( bi ) ; } finally { if ( bi != null ) { bi . close ( ) ; } } } catch ( Exception e ) { set Default Props ( ) ; } } | public Generator ( String propFile ) { try { BufferedInputStream bi = null ; try { bi = new BufferedInputStream ( new FileInputStream ( propFile ) ) ; props . load ( bi ) ; } finally { if ( bi != null ) { bi . close ( ) ; } } } catch ( Exception e ) { setDefaultProps ( ) ; } } | 76 |
java-test-2726 | java | How does the code create a new license ? | with the given license text | public License ( final String filename , final String text ) { if ( filename == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( filename . is Empty ( ) ) { throw new Illegal Argument Exception ( STRING ) ; } this . filename = filename ; if ( text == null ) { throw new Null Pointer Exception ( STRING ) ; }... | public License ( final String filename , final String text ) { if ( filename == null ) { throw new NullPointerException ( STRING ) ; } if ( filename . isEmpty ( ) ) { throw new IllegalArgumentException ( STRING ) ; } this . filename = filename ; if ( text == null ) { throw new NullPointerException ( STRING ) ; } if ( t... | 99 |
java-test-2727 | java | What does the code create with the given license text ? | a new license | public License ( final String filename , final String text ) { if ( filename == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( filename . is Empty ( ) ) { throw new Illegal Argument Exception ( STRING ) ; } this . filename = filename ; if ( text == null ) { throw new Null Pointer Exception ( STRING ) ; }... | public License ( final String filename , final String text ) { if ( filename == null ) { throw new NullPointerException ( STRING ) ; } if ( filename . isEmpty ( ) ) { throw new IllegalArgumentException ( STRING ) ; } this . filename = filename ; if ( text == null ) { throw new NullPointerException ( STRING ) ; } if ( t... | 99 |
java-test-2728 | java | Why is this the trickiest thing to handle ? | since property we are looking for may be anywhere | @ Override public Object deserialize Typed From Object ( Json Parser jp , Deserialization Context ctxt ) throws IO Exception , Json Processing Exception { Json Token t = jp . get Current Token ( ) ; if ( t == Json Token . START OBJECT ) { t = jp . next Token ( ) ; } else if ( t == Json Token . START ARRAY ) { return de... | @ Override public Object deserializeTypedFromObject ( JsonParser jp , DeserializationContext ctxt ) throws IOException , JsonProcessingException { JsonToken t = jp . getCurrentToken ( ) ; if ( t == JsonToken . START_OBJECT ) { t = jp . nextToken ( ) ; } else if ( t == JsonToken . START_ARRAY ) { return _deserializeType... | 293 |
java-test-2729 | java | For what purpose will this are check storage system which matches export group and storage ports in varray ? | for a given export group and storage system | public static boolean has Export Mask For Storage And V Array ( Db Client db Client , Export Group export Group , URI storage URI ) { Set < String > storage Port UR Is Associated With V Array And Storage Array = Export Mask Utils . get Storage Port Uris Associated With Varray And Storage Array ( storage URI , export Gr... | public static boolean hasExportMaskForStorageAndVArray ( DbClient dbClient , ExportGroup exportGroup , URI storageURI ) { Set < String > storagePortURIsAssociatedWithVArrayAndStorageArray = ExportMaskUtils . getStoragePortUrisAssociatedWithVarrayAndStorageArray ( storageURI , exportGroup . getVirtualArray ( ) , dbClien... | 207 |
java-test-2730 | java | What exists in storage system which matches export group and storage ports in varray ? | any export mask | public static boolean has Export Mask For Storage And V Array ( Db Client db Client , Export Group export Group , URI storage URI ) { Set < String > storage Port UR Is Associated With V Array And Storage Array = Export Mask Utils . get Storage Port Uris Associated With Varray And Storage Array ( storage URI , export Gr... | public static boolean hasExportMaskForStorageAndVArray ( DbClient dbClient , ExportGroup exportGroup , URI storageURI ) { Set < String > storagePortURIsAssociatedWithVArrayAndStorageArray = ExportMaskUtils . getStoragePortUrisAssociatedWithVarrayAndStorageArray ( storageURI , exportGroup . getVirtualArray ( ) , dbClien... | 207 |
java-test-2731 | java | Where do any export mask exist ? | in storage system which matches export group and storage ports in varray | public static boolean has Export Mask For Storage And V Array ( Db Client db Client , Export Group export Group , URI storage URI ) { Set < String > storage Port UR Is Associated With V Array And Storage Array = Export Mask Utils . get Storage Port Uris Associated With Varray And Storage Array ( storage URI , export Gr... | public static boolean hasExportMaskForStorageAndVArray ( DbClient dbClient , ExportGroup exportGroup , URI storageURI ) { Set < String > storagePortURIsAssociatedWithVArrayAndStorageArray = ExportMaskUtils . getStoragePortUrisAssociatedWithVarrayAndStorageArray ( storageURI , exportGroup . getVirtualArray ( ) , dbClien... | 207 |
java-test-2732 | java | In which direction do an open tag burn ? | through characters | private void process Comment ( ) { template Reader . next Character ( ) ; if ( template Reader . starts With ( syntax . get Document Type Opening ( ) ) ) { process Schema Comment ( ) ; return ; } else if ( nested Comments ) { process Nested Comment ( ) ; return ; } while ( template Reader . has Next Character ( ) ) { f... | private void processComment ( ) { templateReader . nextCharacter ( ) ; if ( templateReader . startsWith ( syntax . getDocumentTypeOpening ( ) ) ) { processSchemaComment ( ) ; return ; } else if ( nestedComments ) { processNestedComment ( ) ; return ; } while ( templateReader . hasNextCharacter ( ) ) { final char commen... | 134 |
java-test-2733 | java | What did the code find ? | an open tag starting with comment sign . burning through characters up to the comment ' s end | private void process Comment ( ) { template Reader . next Character ( ) ; if ( template Reader . starts With ( syntax . get Document Type Opening ( ) ) ) { process Schema Comment ( ) ; return ; } else if ( nested Comments ) { process Nested Comment ( ) ; return ; } while ( template Reader . has Next Character ( ) ) { f... | private void processComment ( ) { templateReader . nextCharacter ( ) ; if ( templateReader . startsWith ( syntax . getDocumentTypeOpening ( ) ) ) { processSchemaComment ( ) ; return ; } else if ( nestedComments ) { processNestedComment ( ) ; return ; } while ( templateReader . hasNextCharacter ( ) ) { final char commen... | 134 |
java-test-2734 | java | What does the assumption here be ? | that log entries in array were created in ascending order | @ Theory public void log Entries Have Same Order As Indexes ( Object [ ] data Point ) { int index 1 = ( int ) data Point [ NUM ] ; int index 2 = ( int ) data Point [ NUM ] ; Log Entry first = log Entries [ index 1 ] ; Log Entry second = log Entries [ index 2 ] ; LOG . debug ( STRING , index 1 , index 2 ) ; int result =... | @ Theory public void logEntriesHaveSameOrderAsIndexes ( Object [ ] dataPoint ) { int index1 = ( int ) dataPoint [ _NUM ] ; int index2 = ( int ) dataPoint [ _NUM ] ; LogEntry first = logEntries [ index1 ] ; LogEntry second = logEntries [ index2 ] ; LOG . debug ( STRING , index1 , index2 ) ; int result = tested . compare... | 118 |
java-test-2735 | java | What is that log entries in array were created in ascending order ? | the assumption here | @ Theory public void log Entries Have Same Order As Indexes ( Object [ ] data Point ) { int index 1 = ( int ) data Point [ NUM ] ; int index 2 = ( int ) data Point [ NUM ] ; Log Entry first = log Entries [ index 1 ] ; Log Entry second = log Entries [ index 2 ] ; LOG . debug ( STRING , index 1 , index 2 ) ; int result =... | @ Theory public void logEntriesHaveSameOrderAsIndexes ( Object [ ] dataPoint ) { int index1 = ( int ) dataPoint [ _NUM ] ; int index2 = ( int ) dataPoint [ _NUM ] ; LogEntry first = logEntries [ index1 ] ; LogEntry second = logEntries [ index2 ] ; LOG . debug ( STRING , index1 , index2 ) ; int result = tested . compare... | 118 |
java-test-2736 | java | For what purpose could the style be accessed from the drawing thread in read only capacity ? | to make the code slightly more efficient | public void paint Component Background ( Object native Graphics , int x , int y , int width , int height , Style s ) { if ( width <= NUM || height <= NUM ) { return ; } Image bg Image Orig = s . get Bg Image ( ) ; if ( bg Image Orig == null ) { if ( s . get Background Type ( ) >= Style . BACKGROUND GRADIENT LINEAR VERT... | public void paintComponentBackground ( Object nativeGraphics , int x , int y , int width , int height , Style s ) { if ( width <= _NUM || height <= _NUM ) { return ; } Image bgImageOrig = s . getBgImage ( ) ; if ( bgImageOrig == null ) { if ( s . getBackgroundType ( ) >= Style . BACKGROUND_GRADIENT_LINEAR_VERTICAL ) { ... | 2,057 |
java-test-2737 | java | How could the style be accessed from the drawing thread to make the code slightly more efficient ? | in read only capacity | public void paint Component Background ( Object native Graphics , int x , int y , int width , int height , Style s ) { if ( width <= NUM || height <= NUM ) { return ; } Image bg Image Orig = s . get Bg Image ( ) ; if ( bg Image Orig == null ) { if ( s . get Background Type ( ) >= Style . BACKGROUND GRADIENT LINEAR VERT... | public void paintComponentBackground ( Object nativeGraphics , int x , int y , int width , int height , Style s ) { if ( width <= _NUM || height <= _NUM ) { return ; } Image bgImageOrig = s . getBgImage ( ) ; if ( bgImageOrig == null ) { if ( s . getBackgroundType ( ) >= Style . BACKGROUND_GRADIENT_LINEAR_VERTICAL ) { ... | 2,057 |
java-test-2740 | java | What can handle the intent ? | any other application | public static Intent create Take Video Intent ( Activity ctx , Uri saving Uri , int duration In Seconds ) { if ( saving Uri == null ) { throw new Null Pointer Exception ( STRING ) ; } final List < Intent > camera Intents = new Array List < Intent > ( ) ; final Intent capture Intent = new Intent ( Media Store . ACTION V... | public static Intent createTakeVideoIntent ( Activity ctx , Uri savingUri , int durationInSeconds ) { if ( savingUri == null ) { throw new NullPointerException ( STRING ) ; } final List < Intent > cameraIntents = new ArrayList < Intent > ( ) ; final Intent captureIntent = new Intent ( MediaStore . ACTION_VIDEO_CAPTURE ... | 298 |
java-test-2743 | java | What does this method call ? | updatebatchstatus | @ Request Mapping ( value = { STRING , STRING } , method = Request Method . POST ) @ Response Body public Rest Wrapper update ( @ Model Attribute ( STRING ) @ Valid Batch Status batch Status , Binding Result binding Result , Principal principal ) { Rest Wrapper rest Wrapper = null ; if ( binding Result . has Errors ( )... | @ RequestMapping ( value = { STRING , STRING } , method = RequestMethod . POST ) @ ResponseBody public RestWrapper update ( @ ModelAttribute ( STRING ) @ Valid BatchStatus batchStatus , BindingResult bindingResult , Principal principal ) { RestWrapper restWrapper = null ; if ( bindingResult . hasErrors ( ) ) { BindingR... | 287 |
java-test-2744 | java | What does the user move every time ? | the slider | private void slider Direction State Changed ( ) { direction = direction Slider . get Value ( ) ; outfit Label . changed ( ) ; hair Label . changed ( ) ; if ( Testing . OUTFITS ) { eyes Label . changed ( ) ; } head Label . changed ( ) ; body Label . changed ( ) ; dress Label . changed ( ) ; } | private void sliderDirectionStateChanged ( ) { direction = directionSlider . getValue ( ) ; outfitLabel . changed ( ) ; hairLabel . changed ( ) ; if ( Testing . OUTFITS ) { eyesLabel . changed ( ) ; } headLabel . changed ( ) ; bodyLabel . changed ( ) ; dressLabel . changed ( ) ; } | 70 |
java-test-2746 | java | What does the code remove the trigger i d ? | from the layout ' s active triggers | public static void remove Trigger From Layout Active Triggers ( Goosci Sensor Layout . Sensor Layout layout , String trigger Id ) { List < String > triggers List = new Array List < > ( ) ; triggers List . add All ( Arrays . as List ( layout . active Sensor Trigger Ids ) ) ; if ( triggers List . contains ( trigger Id ) ... | public static void removeTriggerFromLayoutActiveTriggers ( GoosciSensorLayout . SensorLayout layout , String triggerId ) { List < String > triggersList = new ArrayList < > ( ) ; triggersList . addAll ( Arrays . asList ( layout . activeSensorTriggerIds ) ) ; if ( triggersList . contains ( triggerId ) ) { triggersList . ... | 106 |
java-test-2747 | java | What does the code remove from the layout ' s active triggers ? | the trigger i d | public static void remove Trigger From Layout Active Triggers ( Goosci Sensor Layout . Sensor Layout layout , String trigger Id ) { List < String > triggers List = new Array List < > ( ) ; triggers List . add All ( Arrays . as List ( layout . active Sensor Trigger Ids ) ) ; if ( triggers List . contains ( trigger Id ) ... | public static void removeTriggerFromLayoutActiveTriggers ( GoosciSensorLayout . SensorLayout layout , String triggerId ) { List < String > triggersList = new ArrayList < > ( ) ; triggersList . addAll ( Arrays . asList ( layout . activeSensorTriggerIds ) ) ; if ( triggersList . contains ( triggerId ) ) { triggersList . ... | 106 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.