id stringlengths 11 16 | language stringclasses 2
values | question stringlengths 13 844 | answer stringlengths 1 900 | code stringlengths 162 27.4k | code_original stringlengths 162 26k | code_word_count int64 51 5.96k |
|---|---|---|---|---|---|---|
java-test-1741 | java | What do the prefs contain ? | the opt - in boolean | protected void do Ping ( @ Not Null String app , @ Not Null String version , @ Nullable final Map < String , String > extras ) { final String n App = normalize App Name ( app ) ; final String n Version = normalize Version ( version ) ; if ( ! m Store . is Ping Opt In ( ) ) { return ; } long now = System . current Time ... | protected void doPing ( @ NotNull String app , @ NotNull String version , @ Nullable final Map < String , String > extras ) { final String nApp = normalizeAppName ( app ) ; final String nVersion = normalizeVersion ( version ) ; if ( ! mStore . isPingOptIn ( ) ) { return ; } long now = System . currentTimeMillis ( ) ; l... | 165 |
java-test-1748 | java | What does the code create by provided peer data ? | the peer instance | private Peer construct Peer Pojo ( final Peer Data peer Data ) throws Peer Exception { Preconditions . check Not Null ( peer Data , STRING ) ; try { Peer Info peer Info = from Json ( peer Data . get Info ( ) , Peer Info . class ) ; if ( local Peer Id . equals ( peer Data . get Id ( ) ) ) { local Peer . set Peer Info ( ... | private Peer constructPeerPojo ( final PeerData peerData ) throws PeerException { Preconditions . checkNotNull ( peerData , STRING ) ; try { PeerInfo peerInfo = fromJson ( peerData . getInfo ( ) , PeerInfo . class ) ; if ( localPeerId . equals ( peerData . getId ( ) ) ) { localPeer . setPeerInfo ( peerInfo ) ; return l... | 294 |
java-test-1749 | java | How does the code create the peer instance ? | by provided peer data | private Peer construct Peer Pojo ( final Peer Data peer Data ) throws Peer Exception { Preconditions . check Not Null ( peer Data , STRING ) ; try { Peer Info peer Info = from Json ( peer Data . get Info ( ) , Peer Info . class ) ; if ( local Peer Id . equals ( peer Data . get Id ( ) ) ) { local Peer . set Peer Info ( ... | private Peer constructPeerPojo ( final PeerData peerData ) throws PeerException { Preconditions . checkNotNull ( peerData , STRING ) ; try { PeerInfo peerInfo = fromJson ( peerData . getInfo ( ) , PeerInfo . class ) ; if ( localPeerId . equals ( peerData . getId ( ) ) ) { localPeer . setPeerInfo ( peerInfo ) ; return l... | 294 |
java-test-1750 | java | What does the code produce ? | a representation of the contests of a basic block | @ Override public void visualize Block ( Block bb , Analysis < A , S , T > analysis ) { this . sb Block . set Length ( NUM ) ; List < Node > contents = new Linked List < > ( ) ; switch ( bb . get Type ( ) ) { case REGULAR BLOCK : contents . add All ( ( ( Regular Block ) bb ) . get Contents ( ) ) ; break ; case EXCEPTIO... | @ Override public void visualizeBlock ( Block bb , Analysis < A , S , T > analysis ) { this . sbBlock . setLength ( _NUM ) ; List < Node > contents = new LinkedList < > ( ) ; switch ( bb . getType ( ) ) { case REGULAR_BLOCK : contents . addAll ( ( ( RegularBlock ) bb ) . getContents ( ) ) ; break ; case EXCEPTION_BLOCK... | 324 |
java-test-1751 | java | What did the code read ? | string pool | public static String Pool read String Pool ( Byte Buffer buffer , String Pool Header string Pool Header ) { long begin Pos = buffer . position ( ) ; long [ ] offsets = new long [ ( int ) string Pool Header . get String Count ( ) ] ; if ( string Pool Header . get String Count ( ) > NUM ) { for ( int idx = NUM ; idx < st... | public static StringPool readStringPool ( ByteBuffer buffer , StringPoolHeader stringPoolHeader ) { long beginPos = buffer . position ( ) ; long [ ] offsets = new long [ ( int ) stringPoolHeader . getStringCount ( ) ] ; if ( stringPoolHeader . getStringCount ( ) > _NUM ) { for ( int idx = _NUM ; idx < stringPoolHeader ... | 377 |
java-test-1752 | java | When do the incoming request clone ? | as the headers are shared | public SIP Response create Response ( int status Code , String reason Phrase ) { SIP Response new Response ; new Response = new SIP Response ( ) ; try { new Response . set Status Code ( status Code ) ; } catch ( Parse Exception ex ) { throw new Illegal Argument Exception ( STRING + status Code ) ; } if ( reason Phrase ... | public SIPResponse createResponse ( int statusCode , String reasonPhrase ) { SIPResponse newResponse ; newResponse = new SIPResponse ( ) ; try { newResponse . setStatusCode ( statusCode ) ; } catch ( ParseException ex ) { throw new IllegalArgumentException ( STRING + statusCode ) ; } if ( reasonPhrase != null ) newResp... | 282 |
java-test-1753 | java | What does this method not clone ? | the incoming request | public SIP Response create Response ( int status Code , String reason Phrase ) { SIP Response new Response ; new Response = new SIP Response ( ) ; try { new Response . set Status Code ( status Code ) ; } catch ( Parse Exception ex ) { throw new Illegal Argument Exception ( STRING + status Code ) ; } if ( reason Phrase ... | public SIPResponse createResponse ( int statusCode , String reasonPhrase ) { SIPResponse newResponse ; newResponse = new SIPResponse ( ) ; try { newResponse . setStatusCode ( statusCode ) ; } catch ( ParseException ex ) { throw new IllegalArgumentException ( STRING + statusCode ) ; } if ( reasonPhrase != null ) newResp... | 282 |
java-test-1754 | java | What does the code create ? | a default sipresponse message for this request | public SIP Response create Response ( int status Code , String reason Phrase ) { SIP Response new Response ; new Response = new SIP Response ( ) ; try { new Response . set Status Code ( status Code ) ; } catch ( Parse Exception ex ) { throw new Illegal Argument Exception ( STRING + status Code ) ; } if ( reason Phrase ... | public SIPResponse createResponse ( int statusCode , String reasonPhrase ) { SIPResponse newResponse ; newResponse = new SIPResponse ( ) ; try { newResponse . setStatusCode ( statusCode ) ; } catch ( ParseException ex ) { throw new IllegalArgumentException ( STRING + statusCode ) ; } if ( reasonPhrase != null ) newResp... | 282 |
java-test-1755 | java | What must you be add to outgoing responses if need be ? | the necessary tags | public SIP Response create Response ( int status Code , String reason Phrase ) { SIP Response new Response ; new Response = new SIP Response ( ) ; try { new Response . set Status Code ( status Code ) ; } catch ( Parse Exception ex ) { throw new Illegal Argument Exception ( STRING + status Code ) ; } if ( reason Phrase ... | public SIPResponse createResponse ( int statusCode , String reasonPhrase ) { SIPResponse newResponse ; newResponse = new SIPResponse ( ) ; try { newResponse . setStatusCode ( statusCode ) ; } catch ( ParseException ex ) { throw new IllegalArgumentException ( STRING + statusCode ) ; } if ( reasonPhrase != null ) newResp... | 282 |
java-test-1756 | java | What do you modify ? | the outgoing response | public SIP Response create Response ( int status Code , String reason Phrase ) { SIP Response new Response ; new Response = new SIP Response ( ) ; try { new Response . set Status Code ( status Code ) ; } catch ( Parse Exception ex ) { throw new Illegal Argument Exception ( STRING + status Code ) ; } if ( reason Phrase ... | public SIPResponse createResponse ( int statusCode , String reasonPhrase ) { SIPResponse newResponse ; newResponse = new SIPResponse ( ) ; try { newResponse . setStatusCode ( statusCode ) ; } catch ( ParseException ex ) { throw new IllegalArgumentException ( STRING + statusCode ) ; } if ( reasonPhrase != null ) newResp... | 282 |
java-test-1757 | java | What do you want ? | to modify the outgoing response | public SIP Response create Response ( int status Code , String reason Phrase ) { SIP Response new Response ; new Response = new SIP Response ( ) ; try { new Response . set Status Code ( status Code ) ; } catch ( Parse Exception ex ) { throw new Illegal Argument Exception ( STRING + status Code ) ; } if ( reason Phrase ... | public SIPResponse createResponse ( int statusCode , String reasonPhrase ) { SIPResponse newResponse ; newResponse = new SIPResponse ( ) ; try { newResponse . setStatusCode ( statusCode ) ; } catch ( ParseException ex ) { throw new IllegalArgumentException ( STRING + statusCode ) ; } if ( reasonPhrase != null ) newResp... | 282 |
java-test-1758 | java | Does this method clone the incoming request ? | No | public SIP Response create Response ( int status Code , String reason Phrase ) { SIP Response new Response ; new Response = new SIP Response ( ) ; try { new Response . set Status Code ( status Code ) ; } catch ( Parse Exception ex ) { throw new Illegal Argument Exception ( STRING + status Code ) ; } if ( reason Phrase ... | public SIPResponse createResponse ( int statusCode , String reasonPhrase ) { SIPResponse newResponse ; newResponse = new SIPResponse ( ) ; try { newResponse . setStatusCode ( statusCode ) ; } catch ( ParseException ex ) { throw new IllegalArgumentException ( STRING + statusCode ) ; } if ( reasonPhrase != null ) newResp... | 282 |
java-test-1759 | java | Where does the stream position ? | at the first central directory record | private void position At Central Directory ( ) throws IO Exception { boolean found = BOOL ; long off = archive . length ( ) - MIN EOCD SIZE ; if ( off >= NUM ) { archive . seek ( off ) ; byte [ ] sig = JB Zip Output Stream . EOCD SIG ; int curr = archive . read ( ) ; while ( curr != - NUM ) { if ( curr == sig [ POS 0 ]... | private void positionAtCentralDirectory ( ) throws IOException { boolean found = _BOOL ; long off = archive . length ( ) - MIN_EOCD_SIZE ; if ( off >= _NUM ) { archive . seek ( off ) ; byte [ ] sig = JBZipOutputStream . EOCD_SIG ; int curr = archive . read ( ) ; while ( curr != - _NUM ) { if ( curr == sig [ POS_0 ] ) {... | 237 |
java-test-1760 | java | Where do we start ? | at the given edge | private S2 Loop assemble Loop ( S2 Point v0 , S2 Point v1 , List < S2 Edge > unused Edges ) { List < S2 Point > path = Lists . new Array List ( ) ; Map < S2 Point , Integer > index = Maps . new Hash Map ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , NUM ) ; while ( path . size ( ) >= NUM ) { v0 = path... | private S2Loop assembleLoop ( S2Point v0 , S2Point v1 , List < S2Edge > unusedEdges ) { List < S2Point > path = Lists . newArrayList ( ) ; Map < S2Point , Integer > index = Maps . newHashMap ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , _NUM ) ; while ( path . size ( ) >= _NUM ) { v0 = path . get ( p... | 380 |
java-test-1761 | java | When do we stop the loop ? | as soon as we encounter any vertex that we have seen before * except * for the first vertex ( v0 ) | private S2 Loop assemble Loop ( S2 Point v0 , S2 Point v1 , List < S2 Edge > unused Edges ) { List < S2 Point > path = Lists . new Array List ( ) ; Map < S2 Point , Integer > index = Maps . new Hash Map ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , NUM ) ; while ( path . size ( ) >= NUM ) { v0 = path... | private S2Loop assembleLoop ( S2Point v0 , S2Point v1 , List < S2Edge > unusedEdges ) { List < S2Point > path = Lists . newArrayList ( ) ; Map < S2Point , Integer > index = Maps . newHashMap ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , _NUM ) ; while ( path . size ( ) >= _NUM ) { v0 = path . get ( p... | 380 |
java-test-1762 | java | What do a loop take whenever possible ? | left turns | private S2 Loop assemble Loop ( S2 Point v0 , S2 Point v1 , List < S2 Edge > unused Edges ) { List < S2 Point > path = Lists . new Array List ( ) ; Map < S2 Point , Integer > index = Maps . new Hash Map ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , NUM ) ; while ( path . size ( ) >= NUM ) { v0 = path... | private S2Loop assembleLoop ( S2Point v0 , S2Point v1 , List < S2Edge > unusedEdges ) { List < S2Point > path = Lists . newArrayList ( ) ; Map < S2Point , Integer > index = Maps . newHashMap ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , _NUM ) ; while ( path . size ( ) >= _NUM ) { v0 = path . get ( p... | 380 |
java-test-1763 | java | What do we assemble whenever possible ? | a loop taking left turns | private S2 Loop assemble Loop ( S2 Point v0 , S2 Point v1 , List < S2 Edge > unused Edges ) { List < S2 Point > path = Lists . new Array List ( ) ; Map < S2 Point , Integer > index = Maps . new Hash Map ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , NUM ) ; while ( path . size ( ) >= NUM ) { v0 = path... | private S2Loop assembleLoop ( S2Point v0 , S2Point v1 , List < S2Edge > unusedEdges ) { List < S2Point > path = Lists . newArrayList ( ) ; Map < S2Point , Integer > index = Maps . newHashMap ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , _NUM ) ; while ( path . size ( ) >= _NUM ) { v0 = path . get ( p... | 380 |
java-test-1764 | java | What do we encounter ? | any vertex that we have seen before * except * for the first vertex ( v0 ) | private S2 Loop assemble Loop ( S2 Point v0 , S2 Point v1 , List < S2 Edge > unused Edges ) { List < S2 Point > path = Lists . new Array List ( ) ; Map < S2 Point , Integer > index = Maps . new Hash Map ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , NUM ) ; while ( path . size ( ) >= NUM ) { v0 = path... | private S2Loop assembleLoop ( S2Point v0 , S2Point v1 , List < S2Edge > unusedEdges ) { List < S2Point > path = Lists . newArrayList ( ) ; Map < S2Point , Integer > index = Maps . newHashMap ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , _NUM ) ; while ( path . size ( ) >= _NUM ) { v0 = path . get ( p... | 380 |
java-test-1765 | java | What does this ensure ? | that only ccw loops are constructed when possible | private S2 Loop assemble Loop ( S2 Point v0 , S2 Point v1 , List < S2 Edge > unused Edges ) { List < S2 Point > path = Lists . new Array List ( ) ; Map < S2 Point , Integer > index = Maps . new Hash Map ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , NUM ) ; while ( path . size ( ) >= NUM ) { v0 = path... | private S2Loop assembleLoop ( S2Point v0 , S2Point v1 , List < S2Edge > unusedEdges ) { List < S2Point > path = Lists . newArrayList ( ) ; Map < S2Point , Integer > index = Maps . newHashMap ( ) ; path . add ( v0 ) ; path . add ( v1 ) ; index . put ( v1 , _NUM ) ; while ( path . size ( ) >= _NUM ) { v0 = path . get ( p... | 380 |
java-test-1766 | java | What does we find ? | a completion node | private boolean check Member Access ( ) { if ( this . previous Token == Token Name DOT && this . qualifier > - NUM && this . expression Ptr == this . qualifier ) { if ( this . identifier Length Ptr > NUM && this . identifier Length Stack [ this . identifier Length Ptr - NUM ] < NUM ) { return BOOL ; } push Completion O... | private boolean checkMemberAccess ( ) { if ( this . previousToken == TokenNameDOT && this . qualifier > - _NUM && this . expressionPtr == this . qualifier ) { if ( this . identifierLengthPtr > _NUM && this . identifierLengthStack [ this . identifierLengthPtr - _NUM ] < _NUM ) { return _BOOL ; } pushCompletionOnMemberAc... | 88 |
java-test-1771 | java | What does the code initialize ? | the separator settings | private void define Separators ( UI Defaults d ) { String c = PAINTER PREFIX + STRING ; d . put ( STRING , new Insets UI Resource ( NUM , NUM , NUM , NUM ) ) ; d . put ( STRING , new Lazy Painter ( c , Separator Painter . Which . BACKGROUND ENABLED ) ) ; } | private void defineSeparators ( UIDefaults d ) { String c = PAINTER_PREFIX + STRING ; d . put ( STRING , new InsetsUIResource ( _NUM , _NUM , _NUM , _NUM ) ) ; d . put ( STRING , new LazyPainter ( c , SeparatorPainter . Which . BACKGROUND_ENABLED ) ) ; } | 62 |
java-test-1772 | java | What does the code create ? | a new resource associated to the category key and stack | Resource Handle new Resource Handle ( K key , final Callable < ? extends R > loader , Elimination Stack < Resource Key < K > > stack ) { try { final Resource Key < K > resource Key = time To Idle Policy . is Present ( ) ? new Linked Resource Key < K > ( stack , Status . IN FLIGHT , key , time To Idle Policy . get ( ) .... | ResourceHandle newResourceHandle ( K key , final Callable < ? extends R > loader , EliminationStack < ResourceKey < K > > stack ) { try { final ResourceKey < K > resourceKey = timeToIdlePolicy . isPresent ( ) ? new LinkedResourceKey < K > ( stack , Status . IN_FLIGHT , key , timeToIdlePolicy . get ( ) . idleQueue ) : n... | 209 |
java-test-1775 | java | What does the code remove ? | the given node , that must be present before this call | final void delete Tree Node ( Tree Node p ) { Tree Node next = ( Tree Node ) p . next ; Tree Node pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; Tree Node replacement ; Tree Node pl = p . left ; Tree Node pr = p . right ; if ( pl != null && pr != ... | final void deleteTreeNode ( TreeNode p ) { TreeNode next = ( TreeNode ) p . next ; TreeNode pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; TreeNode replacement ; TreeNode pl = p . left ; TreeNode pr = p . right ; if ( pl != null && pr != null ) { ... | 1,033 |
java-test-1776 | java | What did we swap ? | the tree linkages | final void delete Tree Node ( Tree Node p ) { Tree Node next = ( Tree Node ) p . next ; Tree Node pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; Tree Node replacement ; Tree Node pl = p . left ; Tree Node pr = p . right ; if ( pl != null && pr != ... | final void deleteTreeNode ( TreeNode p ) { TreeNode next = ( TreeNode ) p . next ; TreeNode pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; TreeNode replacement ; TreeNode pl = p . left ; TreeNode pr = p . right ; if ( pl != null && pr != null ) { ... | 1,033 |
java-test-1777 | java | Why is this messier than typical red - black deletion code ? | because we can not swap the contents of an interior node with a leaf successor that is pinned by " next " pointers that are accessible independently of lock . | final void delete Tree Node ( Tree Node p ) { Tree Node next = ( Tree Node ) p . next ; Tree Node pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; Tree Node replacement ; Tree Node pl = p . left ; Tree Node pr = p . right ; if ( pl != null && pr != ... | final void deleteTreeNode ( TreeNode p ) { TreeNode next = ( TreeNode ) p . next ; TreeNode pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; TreeNode replacement ; TreeNode pl = p . left ; TreeNode pr = p . right ; if ( pl != null && pr != null ) { ... | 1,033 |
java-test-1778 | java | How are " next " pointers are accessible ? | independently of lock | final void delete Tree Node ( Tree Node p ) { Tree Node next = ( Tree Node ) p . next ; Tree Node pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; Tree Node replacement ; Tree Node pl = p . left ; Tree Node pr = p . right ; if ( pl != null && pr != ... | final void deleteTreeNode ( TreeNode p ) { TreeNode next = ( TreeNode ) p . next ; TreeNode pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; TreeNode replacement ; TreeNode pl = p . left ; TreeNode pr = p . right ; if ( pl != null && pr != null ) { ... | 1,033 |
java-test-1779 | java | Can we swap the contents of an interior node with a leaf successor that is pinned by " next " pointers that are accessible independently of lock ? | No | final void delete Tree Node ( Tree Node p ) { Tree Node next = ( Tree Node ) p . next ; Tree Node pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; Tree Node replacement ; Tree Node pl = p . left ; Tree Node pr = p . right ; if ( pl != null && pr != ... | final void deleteTreeNode ( TreeNode p ) { TreeNode next = ( TreeNode ) p . next ; TreeNode pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; TreeNode replacement ; TreeNode pl = p . left ; TreeNode pr = p . right ; if ( pl != null && pr != null ) { ... | 1,033 |
java-test-1780 | java | What can we not swap with a leaf successor that is pinned by " next " pointers that are accessible independently of lock ? | the contents of an interior node | final void delete Tree Node ( Tree Node p ) { Tree Node next = ( Tree Node ) p . next ; Tree Node pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; Tree Node replacement ; Tree Node pl = p . left ; Tree Node pr = p . right ; if ( pl != null && pr != ... | final void deleteTreeNode ( TreeNode p ) { TreeNode next = ( TreeNode ) p . next ; TreeNode pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; TreeNode replacement ; TreeNode pl = p . left ; TreeNode pr = p . right ; if ( pl != null && pr != null ) { ... | 1,033 |
java-test-1781 | java | When be the given node be present ? | before this call | final void delete Tree Node ( Tree Node p ) { Tree Node next = ( Tree Node ) p . next ; Tree Node pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; Tree Node replacement ; Tree Node pl = p . left ; Tree Node pr = p . right ; if ( pl != null && pr != ... | final void deleteTreeNode ( TreeNode p ) { TreeNode next = ( TreeNode ) p . next ; TreeNode pred = p . prev ; if ( pred == null ) first = next ; else pred . next = next ; if ( next != null ) next . prev = pred ; TreeNode replacement ; TreeNode pl = p . left ; TreeNode pr = p . right ; if ( pl != null && pr != null ) { ... | 1,033 |
java-test-1782 | java | What does the code create ? | the appropriate contentimpl for the given blob | private static Content Impl parse Content ( Ole Blob Impl blob ) throws IO Exception { Byte Buffer bb = Page Channel . wrap ( blob . get Bytes ( ) ) ; if ( ( bb . remaining ( ) < NUM ) || ( bb . get Short ( ) != PACKAGE SIGNATURE ) ) { return new Unknown Content Impl ( blob ) ; } int header Size = bb . get Short ( ) ; ... | private static ContentImpl parseContent ( OleBlobImpl blob ) throws IOException { ByteBuffer bb = PageChannel . wrap ( blob . getBytes ( ) ) ; if ( ( bb . remaining ( ) < _NUM ) || ( bb . getShort ( ) != PACKAGE_SIGNATURE ) ) { return new UnknownContentImpl ( blob ) ; } int headerSize = bb . getShort ( ) ; bb . getInt ... | 422 |
java-test-1783 | java | Where does the code skip a number of bytes ? | in an input stream | public static void skip Fully ( Input Stream in , long skip ) throws IO Exception { try { while ( skip > NUM ) { long skipped = in . skip ( skip ) ; if ( skipped <= NUM ) { throw new EOF Exception ( ) ; } skip -= skipped ; } } catch ( Exception e ) { throw Db Exception . convert To IO Exception ( e ) ; } } | public static void skipFully ( InputStream in , long skip ) throws IOException { try { while ( skip > _NUM ) { long skipped = in . skip ( skip ) ; if ( skipped <= _NUM ) { throw new EOFException ( ) ; } skip -= skipped ; } } catch ( Exception e ) { throw DbException . convertToIOException ( e ) ; } } | 77 |
java-test-1788 | java | Is this code exposed at the api level ? | No | static Object new Instance ( Class Loader class Loader , String class Name ) throws Class Not Found Exception , Illegal Access Exception , Instantiation Exception { Class driver Class ; if ( class Loader == null ) { driver Class = Class . for Name ( class Name ) ; } else { driver Class = class Loader . load Class ( cla... | static Object newInstance ( ClassLoader classLoader , String className ) throws ClassNotFoundException , IllegalAccessException , InstantiationException { Class driverClass ; if ( classLoader == null ) { driverClass = Class . forName ( className ) ; } else { driverClass = classLoader . loadClass ( className ) ; } retur... | 78 |
java-test-1789 | java | Where is this code not exposed ? | at the api level | static Object new Instance ( Class Loader class Loader , String class Name ) throws Class Not Found Exception , Illegal Access Exception , Instantiation Exception { Class driver Class ; if ( class Loader == null ) { driver Class = Class . for Name ( class Name ) ; } else { driver Class = class Loader . load Class ( cla... | static Object newInstance ( ClassLoader classLoader , String className ) throws ClassNotFoundException , IllegalAccessException , InstantiationException { Class driverClass ; if ( classLoader == null ) { driverClass = Class . forName ( className ) ; } else { driverClass = classLoader . loadClass ( className ) ; } retur... | 78 |
java-test-1790 | java | For what purpose does the code create a new instance of the specified class name package private ? | so this code is not exposed at the api level | static Object new Instance ( Class Loader class Loader , String class Name ) throws Class Not Found Exception , Illegal Access Exception , Instantiation Exception { Class driver Class ; if ( class Loader == null ) { driver Class = Class . for Name ( class Name ) ; } else { driver Class = class Loader . load Class ( cla... | static Object newInstance ( ClassLoader classLoader , String className ) throws ClassNotFoundException , IllegalAccessException , InstantiationException { Class driverClass ; if ( classLoader == null ) { driverClass = Class . forName ( className ) ; } else { driverClass = classLoader . loadClass ( className ) ; } retur... | 78 |
java-test-1791 | java | What does the code create so this code is not exposed at the api level ? | a new instance of the specified class name package private | static Object new Instance ( Class Loader class Loader , String class Name ) throws Class Not Found Exception , Illegal Access Exception , Instantiation Exception { Class driver Class ; if ( class Loader == null ) { driver Class = Class . for Name ( class Name ) ; } else { driver Class = class Loader . load Class ( cla... | static Object newInstance ( ClassLoader classLoader , String className ) throws ClassNotFoundException , IllegalAccessException , InstantiationException { Class driverClass ; if ( classLoader == null ) { driverClass = Class . forName ( className ) ; } else { driverClass = classLoader . loadClass ( className ) ; } retur... | 78 |
java-test-1792 | java | What is not exposed at the api level ? | this code | static Object new Instance ( Class Loader class Loader , String class Name ) throws Class Not Found Exception , Illegal Access Exception , Instantiation Exception { Class driver Class ; if ( class Loader == null ) { driver Class = Class . for Name ( class Name ) ; } else { driver Class = class Loader . load Class ( cla... | static Object newInstance ( ClassLoader classLoader , String className ) throws ClassNotFoundException , IllegalAccessException , InstantiationException { Class driverClass ; if ( classLoader == null ) { driverClass = Class . forName ( className ) ; } else { driverClass = classLoader . loadClass ( className ) ; } retur... | 78 |
java-test-1793 | java | How does this method call to determine the fitness of the goalusebranch considering only information traced between the goaldefinitionposition and the occurrence of the next overwriting definition in order to do that the executiontrace is filtered using calculatefitnessfordurange ? | by getdistance ( ) | private double calculate Use Fitness For Definition Pos ( Execution Trace target Trace , Integer object Id , int goal Definition Pos ) throws Unexpected Fitness Exception { int previous Def Id = Def Use Execution Trace Analyzer . get Previous Definition Id ( goal Definition . get Variable Name ( ) , target Trace , goal... | private double calculateUseFitnessForDefinitionPos ( ExecutionTrace targetTrace , Integer objectId , int goalDefinitionPos ) throws UnexpectedFitnessException { int previousDefId = DefUseExecutionTraceAnalyzer . getPreviousDefinitionId ( goalDefinition . getVariableName ( ) , targetTrace , goalDefinitionPos , objectId ... | 162 |
java-test-1794 | java | What does the code calculate as follows ? | the goalusefitness for the given goaldefinitionpos | private double calculate Use Fitness For Definition Pos ( Execution Trace target Trace , Integer object Id , int goal Definition Pos ) throws Unexpected Fitness Exception { int previous Def Id = Def Use Execution Trace Analyzer . get Previous Definition Id ( goal Definition . get Variable Name ( ) , target Trace , goal... | private double calculateUseFitnessForDefinitionPos ( ExecutionTrace targetTrace , Integer objectId , int goalDefinitionPos ) throws UnexpectedFitnessException { int previousDefId = DefUseExecutionTraceAnalyzer . getPreviousDefinitionId ( goalDefinition . getVariableName ( ) , targetTrace , goalDefinitionPos , objectId ... | 162 |
java-test-1795 | java | For what purpose does this method call to determine the fitness of the goalusebranch considering only information traced between the goaldefinitionposition and the occurrence of the next overwriting definition in by getdistance ( ) ? | order to do that the executiontrace is filtered using calculatefitnessfordurange | private double calculate Use Fitness For Definition Pos ( Execution Trace target Trace , Integer object Id , int goal Definition Pos ) throws Unexpected Fitness Exception { int previous Def Id = Def Use Execution Trace Analyzer . get Previous Definition Id ( goal Definition . get Variable Name ( ) , target Trace , goal... | private double calculateUseFitnessForDefinitionPos ( ExecutionTrace targetTrace , Integer objectId , int goalDefinitionPos ) throws UnexpectedFitnessException { int previousDefId = DefUseExecutionTraceAnalyzer . getPreviousDefinitionId ( goalDefinition . getVariableName ( ) , targetTrace , goalDefinitionPos , objectId ... | 162 |
java-test-1796 | java | What does this method call by getdistance ( ) order to do that the executiontrace is filtered using calculatefitnessfordurange ? | to determine the fitness of the goalusebranch considering only information traced between the goaldefinitionposition and the occurrence of the next overwriting definition in | private double calculate Use Fitness For Definition Pos ( Execution Trace target Trace , Integer object Id , int goal Definition Pos ) throws Unexpected Fitness Exception { int previous Def Id = Def Use Execution Trace Analyzer . get Previous Definition Id ( goal Definition . get Variable Name ( ) , target Trace , goal... | private double calculateUseFitnessForDefinitionPos ( ExecutionTrace targetTrace , Integer objectId , int goalDefinitionPos ) throws UnexpectedFitnessException { int previousDefId = DefUseExecutionTraceAnalyzer . getPreviousDefinitionId ( goalDefinition . getVariableName ( ) , targetTrace , goalDefinitionPos , objectId ... | 162 |
java-test-1797 | java | When do the definition come ? | before goaldefinitionpos | private double calculate Use Fitness For Definition Pos ( Execution Trace target Trace , Integer object Id , int goal Definition Pos ) throws Unexpected Fitness Exception { int previous Def Id = Def Use Execution Trace Analyzer . get Previous Definition Id ( goal Definition . get Variable Name ( ) , target Trace , goal... | private double calculateUseFitnessForDefinitionPos ( ExecutionTrace targetTrace , Integer objectId , int goalDefinitionPos ) throws UnexpectedFitnessException { int previousDefId = DefUseExecutionTraceAnalyzer . getPreviousDefinitionId ( goalDefinition . getVariableName ( ) , targetTrace , goalDefinitionPos , objectId ... | 162 |
java-test-1798 | java | How is the executiontrace filtered ? | using calculatefitnessfordurange ( ) | private double calculate Use Fitness For Definition Pos ( Execution Trace target Trace , Integer object Id , int goal Definition Pos ) throws Unexpected Fitness Exception { int previous Def Id = Def Use Execution Trace Analyzer . get Previous Definition Id ( goal Definition . get Variable Name ( ) , target Trace , goal... | private double calculateUseFitnessForDefinitionPos ( ExecutionTrace targetTrace , Integer objectId , int goalDefinitionPos ) throws UnexpectedFitnessException { int previousDefId = DefUseExecutionTraceAnalyzer . getPreviousDefinitionId ( goalDefinition . getVariableName ( ) , targetTrace , goalDefinitionPos , objectId ... | 162 |
java-test-1801 | java | What does the code get ? | the index of the closest matching color in the palette to the given color | @ Deprecated public static byte match Color ( Color color ) { if ( color . get Alpha ( ) < NUM ) return NUM ; int index = NUM ; double best = - NUM ; for ( int i = NUM ; i < colors . length ; i ++ ) { double distance = get Distance ( color , colors [ i ] ) ; if ( distance < best || best == - NUM ) { best = distance ; i... | @ Deprecated public static byte matchColor ( Color color ) { if ( color . getAlpha ( ) < _NUM ) return _NUM ; int index = _NUM ; double best = - _NUM ; for ( int i = _NUM ; i < colors . length ; i ++ ) { double distance = getDistance ( color , colors [ i ] ) ; if ( distance < best || best == - _NUM ) { best = distance ... | 112 |
java-test-1802 | java | What does the code create ? | a new dataset with a database connection | public JDBC Category Dataset ( String url , String driver Name , String user , String passwd ) throws Class Not Found Exception , SQL Exception { Class . for Name ( driver Name ) ; this . connection = Driver Manager . get Connection ( url , user , passwd ) ; } | public JDBCCategoryDataset ( String url , String driverName , String user , String passwd ) throws ClassNotFoundException , SQLException { Class . forName ( driverName ) ; this . connection = DriverManager . getConnection ( url , user , passwd ) ; } | 54 |
java-test-1806 | java | What does the code build from componentfamily and renderertype ? | the tag handler class name | public static String make Tag Class Name ( String component Family , String renderer Type ) { if ( component Family == null ) { return null ; } String tag Class Name = component Family ; if ( renderer Type != null ) { if ( ! component Family . equals ( renderer Type ) ) { tag Class Name = tag Class Name + renderer Type... | public static String makeTagClassName ( String componentFamily , String rendererType ) { if ( componentFamily == null ) { return null ; } String tagClassName = componentFamily ; if ( rendererType != null ) { if ( ! componentFamily . equals ( rendererType ) ) { tagClassName = tagClassName + rendererType ; } } return tag... | 79 |
java-test-1809 | java | What does the code perform ? | an update operation | public Extended Answer Holder update ( I Entry Packet updated entry , Transaction txn , long lease , long timeout , Space Context sc , boolean from Replication , boolean origin , boolean new Router , int modifiers ) throws Unusable Entry Exception , Unknown Type Exception , Transaction Exception , Remote Exception , In... | public ExtendedAnswerHolder update ( IEntryPacket updated_entry , Transaction txn , long lease , long timeout , SpaceContext sc , boolean fromReplication , boolean origin , boolean newRouter , int modifiers ) throws UnusableEntryException , UnknownTypeException , TransactionException , RemoteException , InterruptedExce... | 110 |
java-test-1810 | java | What had query joins to ' fetched ' ? | all tomany relations | private void process To Many Relations ( Query Object < ? > query Object ) throws Illegal Query State Exception { List < Entity > loaded Entities = entity Loaders . get Entities For Query Object ( query Object ) ; if ( loaded Entities . is Empty ( ) ) { return ; } for ( Entity loaded Entity : loaded Entities ) { for ( ... | private void processToManyRelations ( QueryObject < ? > queryObject ) throws IllegalQueryStateException { List < Entity > loadedEntities = entityLoaders . getEntitiesForQueryObject ( queryObject ) ; if ( loadedEntities . isEmpty ( ) ) { return ; } for ( Entity loadedEntity : loadedEntities ) { for ( ToManyNode toManyNo... | 152 |
java-test-1811 | java | What did all tomany relations have ? | query joins to ' fetched ' | private void process To Many Relations ( Query Object < ? > query Object ) throws Illegal Query State Exception { List < Entity > loaded Entities = entity Loaders . get Entities For Query Object ( query Object ) ; if ( loaded Entities . is Empty ( ) ) { return ; } for ( Entity loaded Entity : loaded Entities ) { for ( ... | private void processToManyRelations ( QueryObject < ? > queryObject ) throws IllegalQueryStateException { List < Entity > loadedEntities = entityLoaders . getEntitiesForQueryObject ( queryObject ) ; if ( loadedEntities . isEmpty ( ) ) { return ; } for ( Entity loadedEntity : loadedEntities ) { for ( ToManyNode toManyNo... | 152 |
java-test-1819 | java | How does the code create a des cipher with no padding ? | in electronic codebook mode | public static void cbc encrypt ( byte [ ] input , byte [ ] output , byte [ ] key , byte [ ] ivec , boolean encrypt ) throws Krb Crypto Exception { Cipher cipher = null ; try { cipher = Cipher . get Instance ( STRING ) ; } catch ( General Security Exception e ) { Krb Crypto Exception ke = new Krb Crypto Exception ( STRI... | public static void cbc_encrypt ( byte [ ] input , byte [ ] output , byte [ ] key , byte [ ] ivec , boolean encrypt ) throws KrbCryptoException { Cipher cipher = null ; try { cipher = Cipher . getInstance ( STRING ) ; } catch ( GeneralSecurityException e ) { KrbCryptoException ke = new KrbCryptoException ( STRING + e . ... | 254 |
java-test-1820 | java | What does the code create with no padding in electronic codebook mode ? | a des cipher | public static void cbc encrypt ( byte [ ] input , byte [ ] output , byte [ ] key , byte [ ] ivec , boolean encrypt ) throws Krb Crypto Exception { Cipher cipher = null ; try { cipher = Cipher . get Instance ( STRING ) ; } catch ( General Security Exception e ) { Krb Crypto Exception ke = new Krb Crypto Exception ( STRI... | public static void cbc_encrypt ( byte [ ] input , byte [ ] output , byte [ ] key , byte [ ] ivec , boolean encrypt ) throws KrbCryptoException { Cipher cipher = null ; try { cipher = Cipher . getInstance ( STRING ) ; } catch ( GeneralSecurityException e ) { KrbCryptoException ke = new KrbCryptoException ( STRING + e . ... | 254 |
java-test-1822 | java | What was declared in the dtd of the document for the current pipeline ? | an unparsedentity with the given name | protected void check Unparsed Entity ( String ent Name ) { Unparsed Entity ent = new Unparsed Entity ( ) ; ent . name = ent Name ; int index = f Unparsed Entities . index Of ( ent ) ; if ( index != - NUM ) { ent = ( Unparsed Entity ) f Unparsed Entities . get ( index ) ; check Notation ( ent . notation ) ; check And Se... | protected void checkUnparsedEntity ( String entName ) { UnparsedEntity ent = new UnparsedEntity ( ) ; ent . name = entName ; int index = fUnparsedEntities . indexOf ( ent ) ; if ( index != - _NUM ) { ent = ( UnparsedEntity ) fUnparsedEntities . get ( index ) ; checkNotation ( ent . notation ) ; checkAndSendUnparsedEnti... | 83 |
java-test-1823 | java | What is passed to the root pipeline to be checked for conflicts if that turns out okay if that turns out okay ? | the unparsedentity | protected void check Unparsed Entity ( String ent Name ) { Unparsed Entity ent = new Unparsed Entity ( ) ; ent . name = ent Name ; int index = f Unparsed Entities . index Of ( ent ) ; if ( index != - NUM ) { ent = ( Unparsed Entity ) f Unparsed Entities . get ( index ) ; check Notation ( ent . notation ) ; check And Se... | protected void checkUnparsedEntity ( String entName ) { UnparsedEntity ent = new UnparsedEntity ( ) ; ent . name = entName ; int index = fUnparsedEntities . indexOf ( ent ) ; if ( index != - _NUM ) { ent = ( UnparsedEntity ) fUnparsedEntities . get ( index ) ; checkNotation ( ent . notation ) ; checkAndSendUnparsedEnti... | 83 |
java-test-1824 | java | What is the unparsedentity passed if that turns out okay if that turns out okay ? | to the root pipeline to be checked for conflicts | protected void check Unparsed Entity ( String ent Name ) { Unparsed Entity ent = new Unparsed Entity ( ) ; ent . name = ent Name ; int index = f Unparsed Entities . index Of ( ent ) ; if ( index != - NUM ) { ent = ( Unparsed Entity ) f Unparsed Entities . get ( index ) ; check Notation ( ent . notation ) ; check And Se... | protected void checkUnparsedEntity ( String entName ) { UnparsedEntity ent = new UnparsedEntity ( ) ; ent . name = entName ; int index = fUnparsedEntities . indexOf ( ent ) ; if ( index != - _NUM ) { ent = ( UnparsedEntity ) fUnparsedEntities . get ( index ) ; checkNotation ( ent . notation ) ; checkAndSendUnparsedEnti... | 83 |
java-test-1825 | java | When is this not stripped ? | before the predicate is tested | public void wait Until ( Predicate < Output Frame > predicate , long limit , Time Unit limit Unit ) throws Timeout Exception { long expiry = limit Unit . to Millis ( limit ) + System . current Time Millis ( ) ; wait Until ( predicate , expiry ) ; } | public void waitUntil ( Predicate < OutputFrame > predicate , long limit , TimeUnit limitUnit ) throws TimeoutException { long expiry = limitUnit . toMillis ( limit ) + System . currentTimeMillis ( ) ; waitUntil ( predicate , expiry ) ; } | 53 |
java-test-1826 | java | What will lines have often ? | a trailing newline character | public void wait Until ( Predicate < Output Frame > predicate , long limit , Time Unit limit Unit ) throws Timeout Exception { long expiry = limit Unit . to Millis ( limit ) + System . current Time Millis ( ) ; wait Until ( predicate , expiry ) ; } | public void waitUntil ( Predicate < OutputFrame > predicate , long limit , TimeUnit limitUnit ) throws TimeoutException { long expiry = limitUnit . toMillis ( limit ) + System . currentTimeMillis ( ) ; waitUntil ( predicate , expiry ) ; } | 53 |
java-test-1827 | java | What matches the provided predicate ? | any frame ( usually , line ) of output | public void wait Until ( Predicate < Output Frame > predicate , long limit , Time Unit limit Unit ) throws Timeout Exception { long expiry = limit Unit . to Millis ( limit ) + System . current Time Millis ( ) ; wait Until ( predicate , expiry ) ; } | public void waitUntil ( Predicate < OutputFrame > predicate , long limit , TimeUnit limitUnit ) throws TimeoutException { long expiry = limitUnit . toMillis ( limit ) + System . currentTimeMillis ( ) ; waitUntil ( predicate , expiry ) ; } | 53 |
java-test-1828 | java | What does this state list state match ? | an object state | private boolean matches With Enabled Object State ( @ Not Null Immutable Set < Immutable Map < String , Boolean > > allowed Object States ) { if ( my Attributes . contains Key ( STATE ENABLED ) && ! my Attributes . get ( STATE ENABLED ) ) { return BOOL ; } for ( Map < String , Boolean > allowed Attributes : allowed Obj... | private boolean matchesWithEnabledObjectState ( @ NotNull ImmutableSet < ImmutableMap < String , Boolean > > allowedObjectStates ) { if ( myAttributes . containsKey ( STATE_ENABLED ) && ! myAttributes . get ( STATE_ENABLED ) ) { return _BOOL ; } for ( Map < String , Boolean > allowedAttributes : allowedObjectStates ) {... | 165 |
java-test-1829 | java | What matches an object state ? | this state list state | private boolean matches With Enabled Object State ( @ Not Null Immutable Set < Immutable Map < String , Boolean > > allowed Object States ) { if ( my Attributes . contains Key ( STATE ENABLED ) && ! my Attributes . get ( STATE ENABLED ) ) { return BOOL ; } for ( Map < String , Boolean > allowed Attributes : allowed Obj... | private boolean matchesWithEnabledObjectState ( @ NotNull ImmutableSet < ImmutableMap < String , Boolean > > allowedObjectStates ) { if ( myAttributes . containsKey ( STATE_ENABLED ) && ! myAttributes . get ( STATE_ENABLED ) ) { return _BOOL ; } for ( Map < String , Boolean > allowedAttributes : allowedObjectStates ) {... | 165 |
java-test-1830 | java | Where is checks represented ? | in allowedobjectstates | private boolean matches With Enabled Object State ( @ Not Null Immutable Set < Immutable Map < String , Boolean > > allowed Object States ) { if ( my Attributes . contains Key ( STATE ENABLED ) && ! my Attributes . get ( STATE ENABLED ) ) { return BOOL ; } for ( Map < String , Boolean > allowed Attributes : allowed Obj... | private boolean matchesWithEnabledObjectState ( @ NotNull ImmutableSet < ImmutableMap < String , Boolean > > allowedObjectStates ) { if ( myAttributes . containsKey ( STATE_ENABLED ) && ! myAttributes . get ( STATE_ENABLED ) ) { return _BOOL ; } for ( Map < String , Boolean > allowedAttributes : allowedObjectStates ) {... | 165 |
java-test-1832 | java | What will adb shell setprop db . log . slow_query_threshold 200 " log for example ? | all queries that take 200ms or longer to run | public static boolean should Log Slow Query ( long elapsed Time Millis ) { int slow Query Millis = Integer . parse Int ( System . get Property ( STRING , STRING ) ) ; return slow Query Millis >= NUM && elapsed Time Millis >= slow Query Millis ; } | public static boolean shouldLogSlowQuery ( long elapsedTimeMillis ) { int slowQueryMillis = Integer . parseInt ( System . getProperty ( STRING , STRING ) ) ; return slowQueryMillis >= _NUM && elapsedTimeMillis >= slowQueryMillis ; } | 51 |
java-test-1833 | java | What do all queries take ? | 200ms or longer | public static boolean should Log Slow Query ( long elapsed Time Millis ) { int slow Query Millis = Integer . parse Int ( System . get Property ( STRING , STRING ) ) ; return slow Query Millis >= NUM && elapsed Time Millis >= slow Query Millis ; } | public static boolean shouldLogSlowQuery ( long elapsedTimeMillis ) { int slowQueryMillis = Integer . parseInt ( System . getProperty ( STRING , STRING ) ) ; return slowQueryMillis >= _NUM && elapsedTimeMillis >= slowQueryMillis ; } | 51 |
java-test-1834 | java | What take 200ms or longer ? | all queries | public static boolean should Log Slow Query ( long elapsed Time Millis ) { int slow Query Millis = Integer . parse Int ( System . get Property ( STRING , STRING ) ) ; return slow Query Millis >= NUM && elapsed Time Millis >= slow Query Millis ; } | public static boolean shouldLogSlowQuery ( long elapsedTimeMillis ) { int slowQueryMillis = Integer . parseInt ( System . getProperty ( STRING , STRING ) ) ; return slowQueryMillis >= _NUM && elapsedTimeMillis >= slowQueryMillis ; } | 51 |
java-test-1835 | java | When can this value be changed dynamically ? | while the system is running | public static boolean should Log Slow Query ( long elapsed Time Millis ) { int slow Query Millis = Integer . parse Int ( System . get Property ( STRING , STRING ) ) ; return slow Query Millis >= NUM && elapsed Time Millis >= slow Query Millis ; } | public static boolean shouldLogSlowQuery ( long elapsedTimeMillis ) { int slowQueryMillis = Integer . parseInt ( System . getProperty ( STRING , STRING ) ) ; return slowQueryMillis >= _NUM && elapsedTimeMillis >= slowQueryMillis ; } | 51 |
java-test-1836 | java | What will log all queries that take 200ms or longer to run for example ? | adb shell setprop db . log . slow_query_threshold 200 " | public static boolean should Log Slow Query ( long elapsed Time Millis ) { int slow Query Millis = Integer . parse Int ( System . get Property ( STRING , STRING ) ) ; return slow Query Millis >= NUM && elapsed Time Millis >= slow Query Millis ; } | public static boolean shouldLogSlowQuery ( long elapsedTimeMillis ) { int slowQueryMillis = Integer . parseInt ( System . getProperty ( STRING , STRING ) ) ; return slowQueryMillis >= _NUM && elapsedTimeMillis >= slowQueryMillis ; } | 51 |
java-test-1838 | java | What does the code allocate ? | a new string that contains characters from a subarray of the character array argument | public String ( char [ ] data , int offset , int char Count ) { if ( ( offset | char Count ) < NUM || char Count > data . length - offset ) { throw failed Bounds Check ( data . length , offset , char Count ) ; } this . offset = NUM ; this . value = new char [ char Count ] ; this . count = char Count ; System . arraycop... | public String ( char [ ] data , int offset , int charCount ) { if ( ( offset | charCount ) < _NUM || charCount > data . length - offset ) { throw failedBoundsCheck ( data . length , offset , charCount ) ; } this . offset = _NUM ; this . value = new char [ charCount ] ; this . count = charCount ; System . arraycopy ( da... | 93 |
java-test-1839 | java | What does the count argument specify ? | the length of the subarray | public String ( char [ ] data , int offset , int char Count ) { if ( ( offset | char Count ) < NUM || char Count > data . length - offset ) { throw failed Bounds Check ( data . length , offset , char Count ) ; } this . offset = NUM ; this . value = new char [ char Count ] ; this . count = char Count ; System . arraycop... | public String ( char [ ] data , int offset , int charCount ) { if ( ( offset | charCount ) < _NUM || charCount > data . length - offset ) { throw failedBoundsCheck ( data . length , offset , charCount ) ; } this . offset = _NUM ; this . value = new char [ charCount ] ; this . count = charCount ; System . arraycopy ( da... | 93 |
java-test-1840 | java | What specifies the length of the subarray ? | the count argument | public String ( char [ ] data , int offset , int char Count ) { if ( ( offset | char Count ) < NUM || char Count > data . length - offset ) { throw failed Bounds Check ( data . length , offset , char Count ) ; } this . offset = NUM ; this . value = new char [ char Count ] ; this . count = char Count ; System . arraycop... | public String ( char [ ] data , int offset , int charCount ) { if ( ( offset | charCount ) < _NUM || charCount > data . length - offset ) { throw failedBoundsCheck ( data . length , offset , charCount ) ; } this . offset = _NUM ; this . value = new char [ charCount ] ; this . count = charCount ; System . arraycopy ( da... | 93 |
java-test-1846 | java | Till when does all characters skip ? | until the end of the single line comment | private void skip Until End Of Single Line Comment ( Buffered Reader buffered Reader , String Builder minified ) throws IO Exception { while ( BOOL ) { int c Int = buffered Reader . read ( ) ; if ( c Int == - NUM ) { return ; } char c = ( char ) c Int ; if ( c == STRING ) { minified . append ( STRING ) ; return ; } } } | private void skipUntilEndOfSingleLineComment ( BufferedReader bufferedReader , StringBuilder minified ) throws IOException { while ( _BOOL ) { int cInt = bufferedReader . read ( ) ; if ( cInt == - _NUM ) { return ; } char c = ( char ) cInt ; if ( c == STRING ) { minified . append ( STRING ) ; return ; } } } | 79 |
java-test-1847 | java | What do we distinguish from the camera or from the gallery ? | the origin of the taken image | private void update Ui Configuration ( boolean a Is Taken Image Displayed , int a Image Origin ) { m Is Taken Image Displayed = a Is Taken Image Displayed ; m Taken Image Origin = a Image Origin ; if ( ! a Is Taken Image Displayed ) { m Selected Gallery Items List . clear ( ) ; } if ( a Is Taken Image Displayed ) { m I... | private void updateUiConfiguration ( boolean aIsTakenImageDisplayed , int aImageOrigin ) { mIsTakenImageDisplayed = aIsTakenImageDisplayed ; mTakenImageOrigin = aImageOrigin ; if ( ! aIsTakenImageDisplayed ) { mSelectedGalleryItemsList . clear ( ) ; } if ( aIsTakenImageDisplayed ) { mImagePreviewLayout . setVisibility ... | 127 |
java-test-1848 | java | How does the code update the ui ? | according to camera action | private void update Ui Configuration ( boolean a Is Taken Image Displayed , int a Image Origin ) { m Is Taken Image Displayed = a Is Taken Image Displayed ; m Taken Image Origin = a Image Origin ; if ( ! a Is Taken Image Displayed ) { m Selected Gallery Items List . clear ( ) ; } if ( a Is Taken Image Displayed ) { m I... | private void updateUiConfiguration ( boolean aIsTakenImageDisplayed , int aImageOrigin ) { mIsTakenImageDisplayed = aIsTakenImageDisplayed ; mTakenImageOrigin = aImageOrigin ; if ( ! aIsTakenImageDisplayed ) { mSelectedGalleryItemsList . clear ( ) ; } if ( aIsTakenImageDisplayed ) { mImagePreviewLayout . setVisibility ... | 127 |
java-test-1849 | java | How do another image cancel ? | with the camera | private void update Ui Configuration ( boolean a Is Taken Image Displayed , int a Image Origin ) { m Is Taken Image Displayed = a Is Taken Image Displayed ; m Taken Image Origin = a Image Origin ; if ( ! a Is Taken Image Displayed ) { m Selected Gallery Items List . clear ( ) ; } if ( a Is Taken Image Displayed ) { m I... | private void updateUiConfiguration ( boolean aIsTakenImageDisplayed , int aImageOrigin ) { mIsTakenImageDisplayed = aIsTakenImageDisplayed ; mTakenImageOrigin = aImageOrigin ; if ( ! aIsTakenImageDisplayed ) { mSelectedGalleryItemsList . clear ( ) ; } if ( aIsTakenImageDisplayed ) { mImagePreviewLayout . setVisibility ... | 127 |
java-test-1850 | java | Where do project create ? | within the specified tenant | public void create Project Async ( String tenant Id , Project Create Spec project Create Spec , final Future Callback < Task > response Callback ) throws IO Exception { String path = String . format ( STRING , get Base Path ( ) , tenant Id ) ; create Object Async ( path , serialize Object As Json ( project Create Spec ... | public void createProjectAsync ( String tenantId , ProjectCreateSpec projectCreateSpec , final FutureCallback < Task > responseCallback ) throws IOException { String path = String . format ( STRING , getBasePath ( ) , tenantId ) ; createObjectAsync ( path , serializeObjectAsJson ( projectCreateSpec ) , responseCallback... | 70 |
java-test-1851 | java | What creates within the specified tenant ? | project | public void create Project Async ( String tenant Id , Project Create Spec project Create Spec , final Future Callback < Task > response Callback ) throws IO Exception { String path = String . format ( STRING , get Base Path ( ) , tenant Id ) ; create Object Async ( path , serialize Object As Json ( project Create Spec ... | public void createProjectAsync ( String tenantId , ProjectCreateSpec projectCreateSpec , final FutureCallback < Task > responseCallback ) throws IOException { String path = String . format ( STRING , getBasePath ( ) , tenantId ) ; createObjectAsync ( path , serializeObjectAsJson ( projectCreateSpec ) , responseCallback... | 70 |
java-test-1852 | java | How do checks bound ? | null and array | static void check Args ( byte [ ] in , int in Offset , byte [ ] out , int out Offset ) { if ( probability ( VERY SLOW PATH PROBABILITY , in Offset < NUM || in . length - AES BLOCK SIZE < in Offset || out Offset < NUM || out . length - AES BLOCK SIZE < out Offset ) ) { Deoptimize Node . deopt ( Deoptimization Action . N... | static void checkArgs ( byte [ ] in , int inOffset , byte [ ] out , int outOffset ) { if ( probability ( VERY_SLOW_PATH_PROBABILITY , inOffset < _NUM || in . length - AES_BLOCK_SIZE < inOffset || outOffset < _NUM || out . length - AES_BLOCK_SIZE < outOffset ) ) { DeoptimizeNode . deopt ( DeoptimizationAction . None , D... | 86 |
java-test-1854 | java | What does the code add ? | a single property value | @ Suppress Warnings ( STRING ) private < T > void add Property Value ( Managed Object Definition < ? , ? > d , Property Definition < T > pd , String s ) throws Argument Exception { T value ; try { value = pd . decode Value ( s ) ; } catch ( Property Exception e ) { throw Argument Exception Factory . adapt Property Exce... | @ SuppressWarnings ( STRING ) private < T > void addPropertyValue ( ManagedObjectDefinition < ? , ? > d , PropertyDefinition < T > pd , String s ) throws ArgumentException { T value ; try { value = pd . decodeValue ( s ) ; } catch ( PropertyException e ) { throw ArgumentExceptionFactory . adaptPropertyException ( e , d... | 186 |
java-test-1855 | java | How does the code create chart ? | using the data set and uom | protected J Free Chart create Chart ( Category Dataset dataset , String title , MUOM uom ) { J Free Chart chart = Chart Factory . create Bar Chart 3 D ( title , STRING , STRING , dataset , Plot Orientation . VERTICAL , BOOL , BOOL , BOOL ) ; if ( uom == null || uom . is Hour ( ) ) { chart = Chart Factory . create Bar C... | protected JFreeChart createChart ( CategoryDataset dataset , String title , MUOM uom ) { JFreeChart chart = ChartFactory . createBarChart3D ( title , STRING , STRING , dataset , PlotOrientation . VERTICAL , _BOOL , _BOOL , _BOOL ) ; if ( uom == null || uom . isHour ( ) ) { chart = ChartFactory . createBarChart3D ( titl... | 184 |
java-test-1856 | java | What does the code create using the data set and uom ? | chart | protected J Free Chart create Chart ( Category Dataset dataset , String title , MUOM uom ) { J Free Chart chart = Chart Factory . create Bar Chart 3 D ( title , STRING , STRING , dataset , Plot Orientation . VERTICAL , BOOL , BOOL , BOOL ) ; if ( uom == null || uom . is Hour ( ) ) { chart = Chart Factory . create Bar C... | protected JFreeChart createChart ( CategoryDataset dataset , String title , MUOM uom ) { JFreeChart chart = ChartFactory . createBarChart3D ( title , STRING , STRING , dataset , PlotOrientation . VERTICAL , _BOOL , _BOOL , _BOOL ) ; if ( uom == null || uom . isHour ( ) ) { chart = ChartFactory . createBarChart3D ( titl... | 184 |
java-test-1857 | java | What does the code find ? | an valuegraphvertex corresponding to a given register | private Value Graph Vertex find Or Create Vertex ( Register r ) { Value Graph Vertex v = get Vertex ( r ) ; if ( v == null ) { v = new Value Graph Vertex ( r ) ; v . set Label ( r , NUM ) ; graph . add Graph Node ( v ) ; name Map . put ( r , v ) ; } return v ; } | private ValueGraphVertex findOrCreateVertex ( Register r ) { ValueGraphVertex v = getVertex ( r ) ; if ( v == null ) { v = new ValueGraphVertex ( r ) ; v . setLabel ( r , _NUM ) ; graph . addGraphNode ( v ) ; nameMap . put ( r , v ) ; } return v ; } | 75 |
java-test-1858 | java | What return boolean values ? | meta data functions | public void test Boolean Options ( ) throws Exception { Database Meta Data dbmd = con . get Meta Data ( ) ; assert True ( STRING , dbmd . locators Update Copy ( ) ) ; assert True ( STRING , dbmd . supports Get Generated Keys ( ) ) ; assert True ( STRING , dbmd . supports Multiple Open Results ( ) ) ; assert True ( STRI... | public void testBooleanOptions ( ) throws Exception { DatabaseMetaData dbmd = con . getMetaData ( ) ; assertTrue ( STRING , dbmd . locatorsUpdateCopy ( ) ) ; assertTrue ( STRING , dbmd . supportsGetGeneratedKeys ( ) ) ; assertTrue ( STRING , dbmd . supportsMultipleOpenResults ( ) ) ; assertTrue ( STRING , dbmd . suppor... | 153 |
java-test-1859 | java | What do meta data functions return ? | boolean values | public void test Boolean Options ( ) throws Exception { Database Meta Data dbmd = con . get Meta Data ( ) ; assert True ( STRING , dbmd . locators Update Copy ( ) ) ; assert True ( STRING , dbmd . supports Get Generated Keys ( ) ) ; assert True ( STRING , dbmd . supports Multiple Open Results ( ) ) ; assert True ( STRI... | public void testBooleanOptions ( ) throws Exception { DatabaseMetaData dbmd = con . getMetaData ( ) ; assertTrue ( STRING , dbmd . locatorsUpdateCopy ( ) ) ; assertTrue ( STRING , dbmd . supportsGetGeneratedKeys ( ) ) ; assertTrue ( STRING , dbmd . supportsMultipleOpenResults ( ) ) ; assertTrue ( STRING , dbmd . suppor... | 153 |
java-test-1860 | java | When does it exist ? | pre - | private boolean ensure Target Directory Is Valid ( File target Directory ) { if ( target Directory . exists ( ) && ! target Directory . is Directory ( ) ) { display Error Dialog ( Data Transfer Messages . File Export directory Exists ) ; give Focus To Destination ( ) ; return BOOL ; } return ensure Directory Exists ( t... | private boolean ensureTargetDirectoryIsValid ( File targetDirectory ) { if ( targetDirectory . exists ( ) && ! targetDirectory . isDirectory ( ) ) { displayErrorDialog ( DataTransferMessages . FileExport_directoryExists ) ; giveFocusToDestination ( ) ; return _BOOL ; } return ensureDirectoryExists ( targetDirectory ) ;... | 67 |
java-test-1861 | java | What is indicating whether the target exists ( ie . - if it either pre - existed or this method was able to create it ? | a boolean | private boolean ensure Target Directory Is Valid ( File target Directory ) { if ( target Directory . exists ( ) && ! target Directory . is Directory ( ) ) { display Error Dialog ( Data Transfer Messages . File Export directory Exists ) ; give Focus To Destination ( ) ; return BOOL ; } return ensure Directory Exists ( t... | private boolean ensureTargetDirectoryIsValid ( File targetDirectory ) { if ( targetDirectory . exists ( ) && ! targetDirectory . isDirectory ( ) ) { displayErrorDialog ( DataTransferMessages . FileExport_directoryExists ) ; giveFocusToDestination ( ) ; return _BOOL ; } return ensureDirectoryExists ( targetDirectory ) ;... | 67 |
java-test-1862 | java | Do the target for export create it ? | No | private boolean ensure Target Directory Is Valid ( File target Directory ) { if ( target Directory . exists ( ) && ! target Directory . is Directory ( ) ) { display Error Dialog ( Data Transfer Messages . File Export directory Exists ) ; give Focus To Destination ( ) ; return BOOL ; } return ensure Directory Exists ( t... | private boolean ensureTargetDirectoryIsValid ( File targetDirectory ) { if ( targetDirectory . exists ( ) && ! targetDirectory . isDirectory ( ) ) { displayErrorDialog ( DataTransferMessages . FileExport_directoryExists ) ; giveFocusToDestination ( ) ; return _BOOL ; } return ensureDirectoryExists ( targetDirectory ) ;... | 67 |
java-test-1863 | java | What do a boolean indicate ? | whether the target exists ( ie . - if it either pre - existed or this method was able to create it | private boolean ensure Target Directory Is Valid ( File target Directory ) { if ( target Directory . exists ( ) && ! target Directory . is Directory ( ) ) { display Error Dialog ( Data Transfer Messages . File Export directory Exists ) ; give Focus To Destination ( ) ; return BOOL ; } return ensure Directory Exists ( t... | private boolean ensureTargetDirectoryIsValid ( File targetDirectory ) { if ( targetDirectory . exists ( ) && ! targetDirectory . isDirectory ( ) ) { displayErrorDialog ( DataTransferMessages . FileExport_directoryExists ) ; giveFocusToDestination ( ) ; return _BOOL ; } return ensureDirectoryExists ( targetDirectory ) ;... | 67 |
java-test-1865 | java | What is the code begin ? | a standard fling with an initial velocity along each axis in pixels per second | public boolean fling ( int velocity X , int velocity Y ) { if ( Math . abs ( velocity X ) < m Min Fling Velocity ) { velocity X = NUM ; } if ( Math . abs ( velocity Y ) < m Min Fling Velocity ) { velocity Y = NUM ; } velocity X = Math . max ( - m Max Fling Velocity , Math . min ( velocity X , m Max Fling Velocity ) ) ;... | public boolean fling ( int velocityX , int velocityY ) { if ( Math . abs ( velocityX ) < mMinFlingVelocity ) { velocityX = _NUM ; } if ( Math . abs ( velocityY ) < mMinFlingVelocity ) { velocityY = _NUM ; } velocityX = Math . max ( - mMaxFlingVelocity , Math . min ( velocityX , mMaxFlingVelocity ) ) ; velocityY = Math ... | 145 |
java-test-1867 | java | What does the code update ? | the paging buttons state as well as the label displaying the currently visible number of attributes | private void update Paging Display ( ) { button First Page . set Enabled ( model . get Current Page Index ( ) != NUM ) ; button Previous Page . set Enabled ( model . get Current Page Index ( ) != NUM ) ; button Next Page . set Enabled ( model . get Current Page Index ( ) < model . get Number Of Pages ( ) - NUM ) ; butt... | private void updatePagingDisplay ( ) { buttonFirstPage . setEnabled ( model . getCurrentPageIndex ( ) != _NUM ) ; buttonPreviousPage . setEnabled ( model . getCurrentPageIndex ( ) != _NUM ) ; buttonNextPage . setEnabled ( model . getCurrentPageIndex ( ) < model . getNumberOfPages ( ) - _NUM ) ; buttonLastPage . setEnab... | 268 |
java-test-1868 | java | What do the label display ? | the currently visible number of attributes | private void update Paging Display ( ) { button First Page . set Enabled ( model . get Current Page Index ( ) != NUM ) ; button Previous Page . set Enabled ( model . get Current Page Index ( ) != NUM ) ; button Next Page . set Enabled ( model . get Current Page Index ( ) < model . get Number Of Pages ( ) - NUM ) ; butt... | private void updatePagingDisplay ( ) { buttonFirstPage . setEnabled ( model . getCurrentPageIndex ( ) != _NUM ) ; buttonPreviousPage . setEnabled ( model . getCurrentPageIndex ( ) != _NUM ) ; buttonNextPage . setEnabled ( model . getCurrentPageIndex ( ) < model . getNumberOfPages ( ) - _NUM ) ; buttonLastPage . setEnab... | 268 |
java-test-1869 | java | What does the code update ? | the visibility of tick labels | private void update Tick Visibility ( ) { tick Visibilities . clear ( ) ; for ( int i = NUM ; i < tick Label Positions . size ( ) ; i ++ ) { tick Visibilities . add ( Boolean . TRUE ) ; } if ( tick Label Positions . size ( ) == NUM ) { return ; } int previous Position = NUM ; String previous Label = null ; for ( int i ... | private void updateTickVisibility ( ) { tickVisibilities . clear ( ) ; for ( int i = _NUM ; i < tickLabelPositions . size ( ) ; i ++ ) { tickVisibilities . add ( Boolean . TRUE ) ; } if ( tickLabelPositions . size ( ) == _NUM ) { return ; } int previousPosition = _NUM ; String previousLabel = null ; for ( int i = _NUM ... | 312 |
java-test-1870 | java | What are that is ? | that their bottom edges are on the same y location , with respect to the specified margin | static public void assert Bottom Aligned ( View first , View second , int margin ) { int [ ] xy = new int [ NUM ] ; first . get Location On Screen ( xy ) ; int first Bottom = xy [ NUM ] + first . get Measured Height ( ) ; second . get Location On Screen ( xy ) ; int second Bottom = xy [ NUM ] + second . get Measured He... | static public void assertBottomAligned ( View first , View second , int margin ) { int [ ] xy = new int [ _NUM ] ; first . getLocationOnScreen ( xy ) ; int firstBottom = xy [ _NUM ] + first . getMeasuredHeight ( ) ; second . getLocationOnScreen ( xy ) ; int secondBottom = xy [ _NUM ] + second . getMeasuredHeight ( ) ; ... | 102 |
java-test-1871 | java | What did the code extract ? | the required keys and values | private byte [ ] extract Relevant Values ( Cursor cursor , String [ ] settings ) { final int settings Count = settings . length ; byte [ ] [ ] values = new byte [ settings Count * NUM ] [ ] ; if ( ! cursor . move To First ( ) ) { Log . e ( TAG , STRING ) ; return new byte [ NUM ] ; } int total Size = NUM ; int backed U... | private byte [ ] extractRelevantValues ( Cursor cursor , String [ ] settings ) { final int settingsCount = settings . length ; byte [ ] [ ] values = new byte [ settingsCount * _NUM ] [ ] ; if ( ! cursor . moveToFirst ( ) ) { Log . e ( TAG , STRING ) ; return new byte [ _NUM ] ; } int totalSize = _NUM ; int backedUpSett... | 430 |
java-test-1872 | java | What does the code instantiate ? | a new thread data | public Thread Data ( String thread Name , String thread State , long cpu Time In Nano Seconds ) { this . thread Name = thread Name ; this . thread State = thread State ; this . cpu Time In Nano Seconds = cpu Time In Nano Seconds ; } | public ThreadData ( String threadName , String threadState , long cpuTimeInNanoSeconds ) { this . threadName = threadName ; this . threadState = threadState ; this . cpuTimeInNanoSeconds = cpuTimeInNanoSeconds ; } | 51 |
java-test-1873 | java | What does the code write a formatted string using the specified locale , format string , and arguments ? | to this object ' s destination | public Formatter format ( Locale l , String format , Object ... args ) { ensure Open ( ) ; int last = - NUM ; int lasto = - NUM ; Format String [ ] fsa = parse ( format ) ; for ( int i = NUM ; i < fsa . length ; i ++ ) { Format String fs = fsa [ i ] ; int index = fs . index ( ) ; try { switch ( index ) { case - NUM : f... | public Formatter format ( Locale l , String format , Object ... args ) { ensureOpen ( ) ; int last = - _NUM ; int lasto = - _NUM ; FormatString [ ] fsa = parse ( format ) ; for ( int i = _NUM ; i < fsa . length ; i ++ ) { FormatString fs = fsa [ i ] ; int index = fs . index ( ) ; try { switch ( index ) { case - _NUM : ... | 301 |
java-test-1875 | java | Is str . tolowercase ( ) . endswith ( end . tolowercase ( ) ) implementation creating extra strings iff ? | No | public final static boolean ends With Ignore Case ( String str , String end ) { int str Length = str == null ? NUM : str . length ( ) ; int end Length = end == null ? NUM : end . length ( ) ; if ( end Length > str Length ) return BOOL ; for ( int i = NUM ; i <= end Length ; i ++ ) { if ( Scanner Helper . to Lower Case ... | public final static boolean endsWithIgnoreCase ( String str , String end ) { int strLength = str == null ? _NUM : str . length ( ) ; int endLength = end == null ? _NUM : end . length ( ) ; if ( endLength > strLength ) return _BOOL ; for ( int i = _NUM ; i <= endLength ; i ++ ) { if ( ScannerHelper . toLowerCase ( end .... | 123 |
java-test-1876 | java | What is str . tolowercase ( ) . endswith ( end . tolowercase ( ) ) implementation not creating iff ? | extra strings | public final static boolean ends With Ignore Case ( String str , String end ) { int str Length = str == null ? NUM : str . length ( ) ; int end Length = end == null ? NUM : end . length ( ) ; if ( end Length > str Length ) return BOOL ; for ( int i = NUM ; i <= end Length ; i ++ ) { if ( Scanner Helper . to Lower Case ... | public final static boolean endsWithIgnoreCase ( String str , String end ) { int strLength = str == null ? _NUM : str . length ( ) ; int endLength = end == null ? _NUM : end . length ( ) ; if ( endLength > strLength ) return _BOOL ; for ( int i = _NUM ; i <= endLength ; i ++ ) { if ( ScannerHelper . toLowerCase ( end .... | 123 |
java-test-1877 | java | How is str . tolowercase ( ) . endswith ( end . tolowercase ( ) ) implementation not creating extra strings ? | iff | public final static boolean ends With Ignore Case ( String str , String end ) { int str Length = str == null ? NUM : str . length ( ) ; int end Length = end == null ? NUM : end . length ( ) ; if ( end Length > str Length ) return BOOL ; for ( int i = NUM ; i <= end Length ; i ++ ) { if ( Scanner Helper . to Lower Case ... | public final static boolean endsWithIgnoreCase ( String str , String end ) { int strLength = str == null ? _NUM : str . length ( ) ; int endLength = end == null ? _NUM : end . length ( ) ; if ( endLength > strLength ) return _BOOL ; for ( int i = _NUM ; i <= endLength ; i ++ ) { if ( ScannerHelper . toLowerCase ( end .... | 123 |
java-test-1878 | java | What is not creating extra strings iff ? | str . tolowercase ( ) . endswith ( end . tolowercase ( ) ) implementation | public final static boolean ends With Ignore Case ( String str , String end ) { int str Length = str == null ? NUM : str . length ( ) ; int end Length = end == null ? NUM : end . length ( ) ; if ( end Length > str Length ) return BOOL ; for ( int i = NUM ; i <= end Length ; i ++ ) { if ( Scanner Helper . to Lower Case ... | public final static boolean endsWithIgnoreCase ( String str , String end ) { int strLength = str == null ? _NUM : str . length ( ) ; int endLength = end == null ? _NUM : end . length ( ) ; if ( endLength > strLength ) return _BOOL ; for ( int i = _NUM ; i <= endLength ; i ++ ) { if ( ScannerHelper . toLowerCase ( end .... | 123 |
java-test-1879 | java | What must we keep in induced tree ? | all nodes in tree | private boolean label To Keep Rec ( Node v , Set < Integer > ids , Node Set keep ) { boolean has Below = BOOL ; int id = ( Integer ) v . get Info ( ) ; if ( ids . size ( ) == NUM || ids . contains ( id ) ) has Below = BOOL ; for ( Edge e = v . get First Out Edge ( ) ; e != null ; e = v . get Next Out Edge ( e ) ) { Nod... | private boolean labelToKeepRec ( Node v , Set < Integer > ids , NodeSet keep ) { boolean hasBelow = _BOOL ; int id = ( Integer ) v . getInfo ( ) ; if ( ids . size ( ) == _NUM || ids . contains ( id ) ) hasBelow = _BOOL ; for ( Edge e = v . getFirstOutEdge ( ) ; e != null ; e = v . getNextOutEdge ( e ) ) { Node w = e . ... | 140 |
java-test-1880 | java | Where must we keep all nodes in tree ? | in induced tree | private boolean label To Keep Rec ( Node v , Set < Integer > ids , Node Set keep ) { boolean has Below = BOOL ; int id = ( Integer ) v . get Info ( ) ; if ( ids . size ( ) == NUM || ids . contains ( id ) ) has Below = BOOL ; for ( Edge e = v . get First Out Edge ( ) ; e != null ; e = v . get Next Out Edge ( e ) ) { Nod... | private boolean labelToKeepRec ( Node v , Set < Integer > ids , NodeSet keep ) { boolean hasBelow = _BOOL ; int id = ( Integer ) v . getInfo ( ) ; if ( ids . size ( ) == _NUM || ids . contains ( id ) ) hasBelow = _BOOL ; for ( Edge e = v . getFirstOutEdge ( ) ; e != null ; e = v . getNextOutEdge ( e ) ) { Node w = e . ... | 140 |
java-test-1883 | java | Where does the code consume the pre nested scroll if need ? | before all behaviors | private void consume Pre Nested Scroll ( int dx , int dy , int [ ] consumed ) { if ( m Over Scroll Effect == Over Scroll Effect . BOUNCE && m Unconsumed Over Scroll Offset != NUM ) { int dest Offset = m Unconsumed Over Scroll Offset - dy ; if ( ! Math Utils . same Sign ( dest Offset , m Unconsumed Over Scroll Offset ) ... | private void consumePreNestedScroll ( int dx , int dy , int [ ] consumed ) { if ( mOverScrollEffect == OverScrollEffect . BOUNCE && mUnconsumedOverScrollOffset != _NUM ) { int destOffset = mUnconsumedOverScrollOffset - dy ; if ( ! MathUtils . sameSign ( destOffset , mUnconsumedOverScrollOffset ) ) { destOffset = _NUM ;... | 156 |
java-test-1884 | java | What does the code consume if need before all behaviors ? | the pre nested scroll | private void consume Pre Nested Scroll ( int dx , int dy , int [ ] consumed ) { if ( m Over Scroll Effect == Over Scroll Effect . BOUNCE && m Unconsumed Over Scroll Offset != NUM ) { int dest Offset = m Unconsumed Over Scroll Offset - dy ; if ( ! Math Utils . same Sign ( dest Offset , m Unconsumed Over Scroll Offset ) ... | private void consumePreNestedScroll ( int dx , int dy , int [ ] consumed ) { if ( mOverScrollEffect == OverScrollEffect . BOUNCE && mUnconsumedOverScrollOffset != _NUM ) { int destOffset = mUnconsumedOverScrollOffset - dy ; if ( ! MathUtils . sameSign ( destOffset , mUnconsumedOverScrollOffset ) ) { destOffset = _NUM ;... | 156 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.