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-10397 | java | What do it handle ? | a block write of the given buffer | private final boolean handle Blocked Write ( Byte Buffer buffer , Distribution Message msg ) throws Connection Exception { if ( ! add To Queue ( buffer , msg , BOOL ) ) { return BOOL ; } else { start Nio Pusher ( ) ; return BOOL ; } } | private final boolean handleBlockedWrite ( ByteBuffer buffer , DistributionMessage msg ) throws ConnectionException { if ( ! addToQueue ( buffer , msg , _BOOL ) ) { return _BOOL ; } else { startNioPusher ( ) ; return _BOOL ; } } | 51 |
java-test-10398 | java | What does the code remove based on passed collection ? | items from history | public void clean History ( Collection < Peer > available Peers ) { log . debug ( STRING ) ; List < String > new Peer Addresses = new Array List < > ( ) ; if ( available Peers != null ) { for ( Peer peer : available Peers ) { if ( peer != null && peer . address != null ) { new Peer Addresses . add ( peer . address ) ; ... | public void cleanHistory ( Collection < Peer > availablePeers ) { log . debug ( STRING ) ; List < String > newPeerAddresses = new ArrayList < > ( ) ; if ( availablePeers != null ) { for ( Peer peer : availablePeers ) { if ( peer != null && peer . address != null ) { newPeerAddresses . add ( peer . address ) ; } } } Lis... | 137 |
java-test-10399 | java | How does the code remove items from history ? | based on passed collection | public void clean History ( Collection < Peer > available Peers ) { log . debug ( STRING ) ; List < String > new Peer Addresses = new Array List < > ( ) ; if ( available Peers != null ) { for ( Peer peer : available Peers ) { if ( peer != null && peer . address != null ) { new Peer Addresses . add ( peer . address ) ; ... | public void cleanHistory ( Collection < Peer > availablePeers ) { log . debug ( STRING ) ; List < String > newPeerAddresses = new ArrayList < > ( ) ; if ( availablePeers != null ) { for ( Peer peer : availablePeers ) { if ( peer != null && peer . address != null ) { newPeerAddresses . add ( peer . address ) ; } } } Lis... | 137 |
java-test-10400 | java | What not found in in the collection ? | any item | public void clean History ( Collection < Peer > available Peers ) { log . debug ( STRING ) ; List < String > new Peer Addresses = new Array List < > ( ) ; if ( available Peers != null ) { for ( Peer peer : available Peers ) { if ( peer != null && peer . address != null ) { new Peer Addresses . add ( peer . address ) ; ... | public void cleanHistory ( Collection < Peer > availablePeers ) { log . debug ( STRING ) ; List < String > newPeerAddresses = new ArrayList < > ( ) ; if ( availablePeers != null ) { for ( Peer peer : availablePeers ) { if ( peer != null && peer . address != null ) { newPeerAddresses . add ( peer . address ) ; } } } Lis... | 137 |
java-test-10401 | java | Where did any item not find ? | in in the collection | public void clean History ( Collection < Peer > available Peers ) { log . debug ( STRING ) ; List < String > new Peer Addresses = new Array List < > ( ) ; if ( available Peers != null ) { for ( Peer peer : available Peers ) { if ( peer != null && peer . address != null ) { new Peer Addresses . add ( peer . address ) ; ... | public void cleanHistory ( Collection < Peer > availablePeers ) { log . debug ( STRING ) ; List < String > newPeerAddresses = new ArrayList < > ( ) ; if ( availablePeers != null ) { for ( Peer peer : availablePeers ) { if ( peer != null && peer . address != null ) { newPeerAddresses . add ( peer . address ) ; } } } Lis... | 137 |
java-test-10402 | java | Where did all files find ? | in the specified local directory | private void log Local Directory Contents ( File directory ) { Collection < File > files = Herd File Utils . list Files ( directory , True File Filter . INSTANCE , True File Filter . INSTANCE ) ; LOGGER . info ( String . format ( STRING , files . size ( ) , directory . get Path ( ) ) ) ; for ( File file : files ) { LOG... | private void logLocalDirectoryContents ( File directory ) { Collection < File > files = HerdFileUtils . listFiles ( directory , TrueFileFilter . INSTANCE , TrueFileFilter . INSTANCE ) ; LOGGER . info ( String . format ( STRING , files . size ( ) , directory . getPath ( ) ) ) ; for ( File file : files ) { LOGGER . info ... | 93 |
java-test-10403 | java | What does the code append to the writer ? | the i ' th coordinate | private void append Coordinate ( Coordinate Sequence seq , int i , Writer writer ) throws IO Exception { writer . write ( write Number ( seq . get X ( i ) ) + STRING + write Number ( seq . get Y ( i ) ) ) ; if ( output Dimension >= NUM && seq . get Dimension ( ) >= NUM ) { double z = seq . get Ordinate ( i , NUM ) ; if... | private void appendCoordinate ( CoordinateSequence seq , int i , Writer writer ) throws IOException { writer . write ( writeNumber ( seq . getX ( i ) ) + STRING + writeNumber ( seq . getY ( i ) ) ) ; if ( outputDimension >= _NUM && seq . getDimension ( ) >= _NUM ) { double z = seq . getOrdinate ( i , _NUM ) ; if ( ! Do... | 114 |
java-test-10404 | java | When does square register return to your app <p> automatically ? | after a transaction completes | public @ Non Null Charge Request . Builder auto Return ( long timeout , Time Unit unit ) { long auto Return Millis ; if ( timeout != Register Api . AUTO RETURN NO TIMEOUT ) { auto Return Millis = unit . to Millis ( timeout ) ; non Null ( unit , STRING ) ; if ( auto Return Millis < Register Api . AUTO RETURN TIMEOUT MIN... | public @ NonNull ChargeRequest . Builder autoReturn ( long timeout , TimeUnit unit ) { long autoReturnMillis ; if ( timeout != RegisterApi . AUTO_RETURN_NO_TIMEOUT ) { autoReturnMillis = unit . toMillis ( timeout ) ; nonNull ( unit , STRING ) ; if ( autoReturnMillis < RegisterApi . AUTO_RETURN_TIMEOUT_MIN_MILLIS ) { th... | 157 |
java-test-10406 | java | What positions at an empty spot ? | the sign | private boolean position Sign ( Entity sign ) { for ( int y = NUM ; y <= NUM ; y ++ ) { for ( int x = NUM ; x > NUM ; x -- ) { if ( ! zone . collides ( sign , x , y ) ) { sign . set Position ( x , y ) ; zone . add ( sign ) ; return BOOL ; } } } return BOOL ; } | private boolean positionSign ( Entity sign ) { for ( int y = _NUM ; y <= _NUM ; y ++ ) { for ( int x = _NUM ; x > _NUM ; x -- ) { if ( ! zone . collides ( sign , x , y ) ) { sign . setPosition ( x , y ) ; zone . add ( sign ) ; return _BOOL ; } } } return _BOOL ; } | 81 |
java-test-10407 | java | Where do the sign position ? | at an empty spot | private boolean position Sign ( Entity sign ) { for ( int y = NUM ; y <= NUM ; y ++ ) { for ( int x = NUM ; x > NUM ; x -- ) { if ( ! zone . collides ( sign , x , y ) ) { sign . set Position ( x , y ) ; zone . add ( sign ) ; return BOOL ; } } } return BOOL ; } | private boolean positionSign ( Entity sign ) { for ( int y = _NUM ; y <= _NUM ; y ++ ) { for ( int x = _NUM ; x > _NUM ; x -- ) { if ( ! zone . collides ( sign , x , y ) ) { sign . setPosition ( x , y ) ; zone . add ( sign ) ; return _BOOL ; } } } return _BOOL ; } | 81 |
java-test-10409 | java | What does we prefer to handle bookmark backup now ? | chrome sync | @ Override public void on Backup ( Parcel File Descriptor old State , Backup Data Output data , Parcel File Descriptor new State ) throws IO Exception { long saved File Size = - NUM ; long saved Crc = - NUM ; int saved Version = - NUM ; Data Input Stream in = new Data Input Stream ( new File Input Stream ( old State . ... | @ Override public void onBackup ( ParcelFileDescriptor oldState , BackupDataOutput data , ParcelFileDescriptor newState ) throws IOException { long savedFileSize = - _NUM ; long savedCrc = - _NUM ; int savedVersion = - _NUM ; DataInputStream in = new DataInputStream ( new FileInputStream ( oldState . getFileDescriptor ... | 153 |
java-test-10410 | java | What does this preserve simply as we now prefer chrome sync to handle bookmark backup ? | the existing state | @ Override public void on Backup ( Parcel File Descriptor old State , Backup Data Output data , Parcel File Descriptor new State ) throws IO Exception { long saved File Size = - NUM ; long saved Crc = - NUM ; int saved Version = - NUM ; Data Input Stream in = new Data Input Stream ( new File Input Stream ( old State . ... | @ Override public void onBackup ( ParcelFileDescriptor oldState , BackupDataOutput data , ParcelFileDescriptor newState ) throws IOException { long savedFileSize = - _NUM ; long savedCrc = - _NUM ; int savedVersion = - _NUM ; DataInputStream in = new DataInputStream ( new FileInputStream ( oldState . getFileDescriptor ... | 153 |
java-test-10411 | java | What do we handle ? | bookmark backup | @ Override public void on Backup ( Parcel File Descriptor old State , Backup Data Output data , Parcel File Descriptor new State ) throws IO Exception { long saved File Size = - NUM ; long saved Crc = - NUM ; int saved Version = - NUM ; Data Input Stream in = new Data Input Stream ( new File Input Stream ( old State . ... | @ Override public void onBackup ( ParcelFileDescriptor oldState , BackupDataOutput data , ParcelFileDescriptor newState ) throws IOException { long savedFileSize = - _NUM ; long savedCrc = - _NUM ; int savedVersion = - _NUM ; DataInputStream in = new DataInputStream ( new FileInputStream ( oldState . getFileDescriptor ... | 153 |
java-test-10412 | java | For what purpose does we prefer chrome sync now ? | to handle bookmark backup | @ Override public void on Backup ( Parcel File Descriptor old State , Backup Data Output data , Parcel File Descriptor new State ) throws IO Exception { long saved File Size = - NUM ; long saved Crc = - NUM ; int saved Version = - NUM ; Data Input Stream in = new Data Input Stream ( new File Input Stream ( old State . ... | @ Override public void onBackup ( ParcelFileDescriptor oldState , BackupDataOutput data , ParcelFileDescriptor newState ) throws IOException { long savedFileSize = - _NUM ; long savedCrc = - _NUM ; int savedVersion = - _NUM ; DataInputStream in = new DataInputStream ( new FileInputStream ( oldState . getFileDescriptor ... | 153 |
java-test-10413 | java | When does this preserve the existing state simply ? | as we now prefer chrome sync to handle bookmark backup | @ Override public void on Backup ( Parcel File Descriptor old State , Backup Data Output data , Parcel File Descriptor new State ) throws IO Exception { long saved File Size = - NUM ; long saved Crc = - NUM ; int saved Version = - NUM ; Data Input Stream in = new Data Input Stream ( new File Input Stream ( old State . ... | @ Override public void onBackup ( ParcelFileDescriptor oldState , BackupDataOutput data , ParcelFileDescriptor newState ) throws IOException { long savedFileSize = - _NUM ; long savedCrc = - _NUM ; int savedVersion = - _NUM ; DataInputStream in = new DataInputStream ( new FileInputStream ( oldState . getFileDescriptor ... | 153 |
java-test-10414 | java | What does the code do ? | the url ' s path equal to or a sub - directory of the realm ' s path | private boolean path Match ( URL realm Url , URL return To Url ) { String realm Path = realm Url . get Path ( ) ; String return To Path = return To Url . get Path ( ) ; if ( ! realm Path . ends With ( STRING ) ) realm Path += STRING ; if ( ! return To Path . ends With ( STRING ) ) return To Path += STRING ; return retu... | private boolean pathMatch ( URL realmUrl , URL returnToUrl ) { String realmPath = realmUrl . getPath ( ) ; String returnToPath = returnToUrl . getPath ( ) ; if ( ! realmPath . endsWith ( STRING ) ) realmPath += STRING ; if ( ! returnToPath . endsWith ( STRING ) ) returnToPath += STRING ; return returnToPath . startsWit... | 90 |
java-test-10415 | java | Where does local test data files create ? | in local_temp_path_input directory | protected void create Test Data Files ( Path local Path , List < Manifest File > manifest Files ) throws Exception { for ( Manifest File manifest File : manifest Files ) { create Local File ( local Path . to String ( ) , manifest File . get File Name ( ) , manifest File . get File Size Bytes ( ) ) ; } } | protected void createTestDataFiles ( Path localPath , List < ManifestFile > manifestFiles ) throws Exception { for ( ManifestFile manifestFile : manifestFiles ) { createLocalFile ( localPath . toString ( ) , manifestFile . getFileName ( ) , manifestFile . getFileSizeBytes ( ) ) ; } } | 67 |
java-test-10416 | java | What creates in local_temp_path_input directory ? | local test data files | protected void create Test Data Files ( Path local Path , List < Manifest File > manifest Files ) throws Exception { for ( Manifest File manifest File : manifest Files ) { create Local File ( local Path . to String ( ) , manifest File . get File Name ( ) , manifest File . get File Size Bytes ( ) ) ; } } | protected void createTestDataFiles ( Path localPath , List < ManifestFile > manifestFiles ) throws Exception { for ( ManifestFile manifestFile : manifestFiles ) { createLocalFile ( localPath . toString ( ) , manifestFile . getFileName ( ) , manifestFile . getFileSizeBytes ( ) ) ; } } | 67 |
java-test-10418 | java | What have we failed ? | to connect to all hosts | private boolean check For All Failed Hosts ( ) { boolean allbad = BOOL ; for ( int m remote Hosts Statu : m remote Hosts Status ) { if ( m remote Hosts Statu != CONNECTION FAILED ) { allbad = BOOL ; break ; } } if ( allbad ) { m plotting Aborted = BOOL ; notify Listeners ( BOOL , BOOL , BOOL , STRING + STRING ) ; } ret... | private boolean checkForAllFailedHosts ( ) { boolean allbad = _BOOL ; for ( int m_remoteHostsStatu : m_remoteHostsStatus ) { if ( m_remoteHostsStatu != CONNECTION_FAILED ) { allbad = _BOOL ; break ; } } if ( allbad ) { m_plottingAborted = _BOOL ; notifyListeners ( _BOOL , _BOOL , _BOOL , STRING + STRING ) ; } return al... | 78 |
java-test-10420 | java | What does the code write ? | a wraptoken_v2 object | public Wrap Token v2 ( Krb 5 Context context , Message Prop prop , byte [ ] data Bytes , int data Offset , int data Len ) throws GSS Exception { super ( Krb 5 Token . WRAP ID v2 , context ) ; confounder = Confounder . bytes ( CONFOUNDER SIZE ) ; gen Sign And Seq Number ( prop , data Bytes , data Offset , data Len ) ; i... | public WrapToken_v2 ( Krb5Context context , MessageProp prop , byte [ ] dataBytes , int dataOffset , int dataLen ) throws GSSException { super ( Krb5Token . WRAP_ID_v2 , context ) ; confounder = Confounder . bytes ( CONFOUNDER_SIZE ) ; genSignAndSeqNumber ( prop , dataBytes , dataOffset , dataLen ) ; if ( ! context . g... | 199 |
java-test-10428 | java | When did standard deviation imply ? | 1976 | public static double black Formula Implied Std Dev ( final Option . Type option Type , @ Real double strike , @ Real double forward , @ Real final double black Price , @ Discount Factor final double discount , @ Real double guess , @ Real final double accuracy , @ Real final double displacement ) { final int max Iterat... | public static double blackFormulaImpliedStdDev ( final Option . Type optionType , @ Real double strike , @ Real double forward , @ Real final double blackPrice , @ DiscountFactor final double discount , @ Real double guess , @ Real final double accuracy , @ Real final double displacement ) { final int maxIterations = _... | 288 |
java-test-10429 | java | How does the code write the specified text ? | without applying any escaping | protected void write Raw ( final String text ) { write Indent ( ) ; try { final int length = text != null ? text . length ( ) : NULL TEXT . length ( ) ; writer . write ( text ) ; column += length ; if ( text == null ) { return ; } boolean new Line Seen = BOOL ; for ( int i = NUM ; i < length ; i ++ ) { if ( text . char... | protected void writeRaw ( final String text ) { writeIndent ( ) ; try { final int length = text != null ? text . length ( ) : NULL_TEXT . length ( ) ; _writer . write ( text ) ; column += length ; if ( text == null ) { return ; } boolean newLineSeen = _BOOL ; for ( int i = _NUM ; i < length ; i ++ ) { if ( text . charA... | 140 |
java-test-10431 | java | What does the map exceed ? | the maximum capacity | private boolean evict ( ) { while ( is Overflow ( ) ) { Node < K , V > node = sentinel . get Next ( ) ; if ( node == sentinel ) { return BOOL ; } else if ( policy . on Evict ( this , node ) ) { if ( data . remove ( node . get Key ( ) , new Identity ( node ) ) ) { length . decrement And Get ( ) ; node . remove ( ) ; lis... | private boolean evict ( ) { while ( isOverflow ( ) ) { Node < K , V > node = sentinel . getNext ( ) ; if ( node == sentinel ) { return _BOOL ; } else if ( policy . onEvict ( this , node ) ) { if ( data . remove ( node . getKey ( ) , new Identity ( node ) ) ) { length . decrementAndGet ( ) ; node . remove ( ) ; listener... | 119 |
java-test-10432 | java | When did by loadermanager call the code ? | after search criteria were changed | @ Override public void on Loader Reset ( Loader < Cursor > loader ) { if ( Global . debug Enabled ) { Log . i ( Global . LOG CONTEXT , m Debug Prefix + STRING + get Debug Context ( ) ) ; } m Last Visible Position = m Gallery View . get Last Visible Position ( ) ; m Adapter . swap Cursor ( null ) ; m Adapter . notify Da... | @ Override public void onLoaderReset ( Loader < Cursor > loader ) { if ( Global . debugEnabled ) { Log . i ( Global . LOG_CONTEXT , mDebugPrefix + STRING + getDebugContext ( ) ) ; } mLastVisiblePosition = mGalleryView . getLastVisiblePosition ( ) ; mAdapter . swapCursor ( null ) ; mAdapter . notifyDataSetChanged ( ) ; ... | 82 |
java-test-10436 | java | What will this send to citizen ? | an email / sms | @ Request Mapping ( value = Api Url . CITIZEN PASSWORD RECOVER , method = Request Method . POST ) public Response Entity < String > password Recover ( Http Servlet Request request ) { Api Response res = Api Response . new Instance ( ) ; try { String identity = request . get Parameter ( STRING ) ; String redirect URL = ... | @ RequestMapping ( value = ApiUrl . CITIZEN_PASSWORD_RECOVER , method = RequestMethod . POST ) public ResponseEntity < String > passwordRecover ( HttpServletRequest request ) { ApiResponse res = ApiResponse . newInstance ( ) ; try { String identity = request . getParameter ( STRING ) ; String redirectURL = request . ge... | 442 |
java-test-10437 | java | What can user use ? | that link | @ Request Mapping ( value = Api Url . CITIZEN PASSWORD RECOVER , method = Request Method . POST ) public Response Entity < String > password Recover ( Http Servlet Request request ) { Api Response res = Api Response . new Instance ( ) ; try { String identity = request . get Parameter ( STRING ) ; String redirect URL = ... | @ RequestMapping ( value = ApiUrl . CITIZEN_PASSWORD_RECOVER , method = RequestMethod . POST ) public ResponseEntity < String > passwordRecover ( HttpServletRequest request ) { ApiResponse res = ApiResponse . newInstance ( ) ; try { String identity = request . getParameter ( STRING ) ; String redirectURL = request . ge... | 442 |
java-test-10438 | java | What do user reset ? | their password | @ Request Mapping ( value = Api Url . CITIZEN PASSWORD RECOVER , method = Request Method . POST ) public Response Entity < String > password Recover ( Http Servlet Request request ) { Api Response res = Api Response . new Instance ( ) ; try { String identity = request . get Parameter ( STRING ) ; String redirect URL = ... | @ RequestMapping ( value = ApiUrl . CITIZEN_PASSWORD_RECOVER , method = RequestMethod . POST ) public ResponseEntity < String > passwordRecover ( HttpServletRequest request ) { ApiResponse res = ApiResponse . newInstance ( ) ; try { String identity = request . getParameter ( STRING ) ; String redirectURL = request . ge... | 442 |
java-test-10440 | java | What does the code create ? | a volatile off - screen drawable image to be used for double buffering | public Volatile Image create Volatile Image ( int width , int height ) { Component Peer peer = this . peer ; if ( peer instanceof Lightweight Peer ) { if ( parent != null ) { return parent . create Volatile Image ( width , height ) ; } else { return null ; } } else { return ( peer != null ) ? peer . create Volatile Ima... | public VolatileImage createVolatileImage ( int width , int height ) { ComponentPeer peer = this . peer ; if ( peer instanceof LightweightPeer ) { if ( parent != null ) { return parent . createVolatileImage ( width , height ) ; } else { return null ; } } else { return ( peer != null ) ? peer . createVolatileImage ( widt... | 81 |
java-test-10441 | java | What does the code prepend to the name possibly possibly ? | a project - configured prefix | @ Contract ( STRING ) @ Nullable public static String prepend Resource Prefix ( @ Nullable Module module , @ Nullable String name ) { if ( module != null ) { Android Facet facet = Android Facet . get Instance ( module ) ; if ( facet != null ) { Android Gradle Model android Model = Android Gradle Model . get ( facet ) ;... | @ Contract ( STRING ) @ Nullable public static String prependResourcePrefix ( @ Nullable Module module , @ Nullable String name ) { if ( module != null ) { AndroidFacet facet = AndroidFacet . getInstance ( module ) ; if ( facet != null ) { AndroidGradleModel androidModel = AndroidGradleModel . get ( facet ) ; if ( andr... | 152 |
java-test-10442 | java | What represents a write to ` maxwell ` . ` positions ` . ? | a rowmap | private Row Map process Heartbeats ( Row Map row ) throws SQL Exception { String hb Client ID = ( String ) row . get Data ( STRING ) ; if ( ! Objects . equals ( hb Client ID , this . client ID ) ) return row ; Object heartbeat at = row . get Data ( STRING ) ; Object old heartbeat at = row . get Old Data ( STRING ) ; if... | private RowMap processHeartbeats ( RowMap row ) throws SQLException { String hbClientID = ( String ) row . getData ( STRING ) ; if ( ! Objects . equals ( hbClientID , this . clientID ) ) return row ; Object heartbeat_at = row . getData ( STRING ) ; Object old_heartbeat_at = row . getOldData ( STRING ) ; if ( heartbeat_... | 155 |
java-test-10443 | java | What does a rowmap represent ? | a write to ` maxwell ` . ` positions ` . | private Row Map process Heartbeats ( Row Map row ) throws SQL Exception { String hb Client ID = ( String ) row . get Data ( STRING ) ; if ( ! Objects . equals ( hb Client ID , this . client ID ) ) return row ; Object heartbeat at = row . get Data ( STRING ) ; Object old heartbeat at = row . get Old Data ( STRING ) ; if... | private RowMap processHeartbeats ( RowMap row ) throws SQLException { String hbClientID = ( String ) row . getData ( STRING ) ; if ( ! Objects . equals ( hbClientID , this . clientID ) ) return row ; Object heartbeat_at = row . getData ( STRING ) ; Object old_heartbeat_at = row . getOldData ( STRING ) ; if ( heartbeat_... | 155 |
java-test-10444 | java | What converts into a heartbeatrowmap process possibly ? | a rowmap object | private Row Map process Heartbeats ( Row Map row ) throws SQL Exception { String hb Client ID = ( String ) row . get Data ( STRING ) ; if ( ! Objects . equals ( hb Client ID , this . client ID ) ) return row ; Object heartbeat at = row . get Data ( STRING ) ; Object old heartbeat at = row . get Old Data ( STRING ) ; if... | private RowMap processHeartbeats ( RowMap row ) throws SQLException { String hbClientID = ( String ) row . getData ( STRING ) ; if ( ! Objects . equals ( hbClientID , this . clientID ) ) return row ; Object heartbeat_at = row . getData ( STRING ) ; Object old_heartbeat_at = row . getOldData ( STRING ) ; if ( heartbeat_... | 155 |
java-test-10445 | java | What do a rowmap object convert possibly ? | into a heartbeatrowmap process | private Row Map process Heartbeats ( Row Map row ) throws SQL Exception { String hb Client ID = ( String ) row . get Data ( STRING ) ; if ( ! Objects . equals ( hb Client ID , this . client ID ) ) return row ; Object heartbeat at = row . get Data ( STRING ) ; Object old heartbeat at = row . get Old Data ( STRING ) ; if... | private RowMap processHeartbeats ( RowMap row ) throws SQLException { String hbClientID = ( String ) row . getData ( STRING ) ; if ( ! Objects . equals ( hbClientID , this . clientID ) ) return row ; Object heartbeat_at = row . getData ( STRING ) ; Object old_heartbeat_at = row . getOldData ( STRING ) ; if ( heartbeat_... | 155 |
java-test-10449 | java | How did the code read a new string ? | in utf format from the receiver | private Object read New Long String ( boolean unshared ) throws IO Exception { long length = input . read Long ( ) ; Object result = input . decode UTF ( ( int ) length ) ; if ( enable Resolve ) { result = resolve Object ( result ) ; } register Object Read ( result , next Handle ( ) , unshared ) ; return result ; } | private Object readNewLongString ( boolean unshared ) throws IOException { long length = input . readLong ( ) ; Object result = input . decodeUTF ( ( int ) length ) ; if ( enableResolve ) { result = resolveObject ( result ) ; } registerObjectRead ( result , nextHandle ( ) , unshared ) ; return result ; } | 71 |
java-test-10450 | java | What can a valid dbf file on disk have then ? | fields and records added or removed | private void create DBF File ( File dbf File , boolean destroy ) throws DBF Exception , IO Exception { if ( destroy == BOOL ) { if ( dbf File . exists ( ) ) { try { dbf File . delete ( ) ; } catch ( Exception e ) { } } } try ( Random Access File raf = new Random Access File ( dbf File , STRING ) ) { if ( dbf File . len... | private void createDBFFile ( File dbfFile , boolean destroy ) throws DBFException , IOException { if ( destroy == _BOOL ) { if ( dbfFile . exists ( ) ) { try { dbfFile . delete ( ) ; } catch ( Exception e ) { } } } try ( RandomAccessFile raf = new RandomAccessFile ( dbfFile , STRING ) ) { if ( dbfFile . length ( ) == _... | 129 |
java-test-10451 | java | What can have fields and records added or removed then ? | a valid dbf file on disk | private void create DBF File ( File dbf File , boolean destroy ) throws DBF Exception , IO Exception { if ( destroy == BOOL ) { if ( dbf File . exists ( ) ) { try { dbf File . delete ( ) ; } catch ( Exception e ) { } } } try ( Random Access File raf = new Random Access File ( dbf File , STRING ) ) { if ( dbf File . len... | private void createDBFFile ( File dbfFile , boolean destroy ) throws DBFException , IOException { if ( destroy == _BOOL ) { if ( dbfFile . exists ( ) ) { try { dbfFile . delete ( ) ; } catch ( Exception e ) { } } } try ( RandomAccessFile raf = new RandomAccessFile ( dbfFile , STRING ) ) { if ( dbfFile . length ( ) == _... | 129 |
java-test-10459 | java | Where do the columns fit ? | within the given target span | protected void layout Columns ( int target Span , int [ ] offsets , int [ ] spans , Size Requirements [ ] reqs ) { Arrays . fill ( offsets , NUM ) ; Arrays . fill ( spans , NUM ) ; col Iterator . set Layout Arrays ( offsets , spans , target Span ) ; CSS . calculate Tiled Layout ( col Iterator , target Span ) ; } | protected void layoutColumns ( int targetSpan , int [ ] offsets , int [ ] spans , SizeRequirements [ ] reqs ) { Arrays . fill ( offsets , _NUM ) ; Arrays . fill ( spans , _NUM ) ; colIterator . setLayoutArrays ( offsets , spans , targetSpan ) ; CSS . calculateTiledLayout ( colIterator , targetSpan ) ; } | 73 |
java-test-10460 | java | For what purpose do the columns layout ? | to fit within the given target span | protected void layout Columns ( int target Span , int [ ] offsets , int [ ] spans , Size Requirements [ ] reqs ) { Arrays . fill ( offsets , NUM ) ; Arrays . fill ( spans , NUM ) ; col Iterator . set Layout Arrays ( offsets , spans , target Span ) ; CSS . calculate Tiled Layout ( col Iterator , target Span ) ; } | protected void layoutColumns ( int targetSpan , int [ ] offsets , int [ ] spans , SizeRequirements [ ] reqs ) { Arrays . fill ( offsets , _NUM ) ; Arrays . fill ( spans , _NUM ) ; colIterator . setLayoutArrays ( offsets , spans , targetSpan ) ; CSS . calculateTiledLayout ( colIterator , targetSpan ) ; } | 73 |
java-test-10461 | java | What do the volumemap contain only ? | the desired includedvolumes | public static Map < URI , Integer > filter Volume Map ( Map < URI , Integer > volume Map , Set < URI > included Volumes ) { Map < URI , Integer > result = new Hash Map < URI , Integer > ( ) ; if ( included Volumes == null ) { return result ; } for ( URI included Volume : included Volumes ) { result . put ( included Vol... | public static Map < URI , Integer > filterVolumeMap ( Map < URI , Integer > volumeMap , Set < URI > includedVolumes ) { Map < URI , Integer > result = new HashMap < URI , Integer > ( ) ; if ( includedVolumes == null ) { return result ; } for ( URI includedVolume : includedVolumes ) { result . put ( includedVolume , vol... | 92 |
java-test-10462 | java | What contains the desired includedvolumes only ? | the volumemap | public static Map < URI , Integer > filter Volume Map ( Map < URI , Integer > volume Map , Set < URI > included Volumes ) { Map < URI , Integer > result = new Hash Map < URI , Integer > ( ) ; if ( included Volumes == null ) { return result ; } for ( URI included Volume : included Volumes ) { result . put ( included Vol... | public static Map < URI , Integer > filterVolumeMap ( Map < URI , Integer > volumeMap , Set < URI > includedVolumes ) { Map < URI , Integer > result = new HashMap < URI , Integer > ( ) ; if ( includedVolumes == null ) { return result ; } for ( URI includedVolume : includedVolumes ) { result . put ( includedVolume , vol... | 92 |
java-test-10465 | java | How do given bytes compress ? | with zip deflate | public static byte [ ] compress ( byte [ ] data ) throws IO Exception { Deflater deflater = new Deflater ( NUM , Boolean . TRUE ) ; deflater . set Input ( data ) ; Byte Array Output Stream output Stream = new Byte Array Output Stream ( data . length ) ; deflater . finish ( ) ; byte [ ] buffer = new byte [ NUM ] ; while... | public static byte [ ] compress ( byte [ ] data ) throws IOException { Deflater deflater = new Deflater ( _NUM , Boolean . TRUE ) ; deflater . setInput ( data ) ; ByteArrayOutputStream outputStream = new ByteArrayOutputStream ( data . length ) ; deflater . finish ( ) ; byte [ ] buffer = new byte [ _NUM ] ; while ( ! de... | 136 |
java-test-10467 | java | What does the code add to the interference list growing it if necessary ? | a register ' s interference set | private void add Interfence ( int new Reg , int old Reg ) { new Reg Interference . ensure Capacity ( new Reg + NUM ) ; while ( new Reg >= new Reg Interference . size ( ) ) { new Reg Interference . add ( new Bit Int Set ( new Reg + NUM ) ) ; } old Reg Interference . merge Interference Set ( old Reg , new Reg Interferenc... | private void addInterfence ( int newReg , int oldReg ) { newRegInterference . ensureCapacity ( newReg + _NUM ) ; while ( newReg >= newRegInterference . size ( ) ) { newRegInterference . add ( new BitIntSet ( newReg + _NUM ) ) ; } oldRegInterference . mergeInterferenceSet ( oldReg , newRegInterference . get ( newReg ) )... | 83 |
java-test-10468 | java | What did the code return ? | the name of the top - most enclosing class of class c | public static String top Level Type String ( String type Str ) { int dollar Index = type Str . index Of ( STRING ) ; String top Level Type Str = dollar Index == - NUM ? type Str : type Str . substring ( NUM , dollar Index ) ; return top Level Type Str ; } | public static String topLevelTypeString ( String typeStr ) { int dollarIndex = typeStr . indexOf ( STRING ) ; String topLevelTypeStr = dollarIndex == - _NUM ? typeStr : typeStr . substring ( _NUM , dollarIndex ) ; return topLevelTypeStr ; } | 59 |
java-test-10473 | java | What does the code create ? | a new instance of radialgradientapp | public Radial Gradient App ( ) { super ( STRING ) ; J Panel panel = new J Panel ( ) ; panel . add ( new Sphere Component ( ) ) ; add ( panel ) ; pack ( ) ; set Location Relative To ( null ) ; } | public RadialGradientApp ( ) { super ( STRING ) ; JPanel panel = new JPanel ( ) ; panel . add ( new SphereComponent ( ) ) ; add ( panel ) ; pack ( ) ; setLocationRelativeTo ( null ) ; } | 51 |
java-test-10474 | java | What do this method copy into another efficiently efficiently ? | the contents of one native array | public static Object [ ] merge Native Arrays ( Object [ ] dst , Object [ ] src , int dst Position , boolean do Power Of 2 ) { if ( dst Position < NUM ) dst Position = dst . length ; Object [ ] result = resize If Needed ( dst , dst Position + src . length , do Power Of 2 ) ; System . arraycopy ( src , NUM , result , dst... | public static Object [ ] mergeNativeArrays ( Object [ ] dst , Object [ ] src , int dstPosition , boolean doPowerOf2 ) { if ( dstPosition < _NUM ) dstPosition = dst . length ; Object [ ] result = resizeIfNeeded ( dst , dstPosition + src . length , doPowerOf2 ) ; System . arraycopy ( src , _NUM , result , dstPosition , s... | 90 |
java-test-10478 | java | What does the code describe ? | the entailment regime | protected void describe Entailment Regime ( ) { if ( ! triple Store . is Quads ( ) ) return ; final URI entailment Regime ; final Axioms axioms = triple Store . get Axioms ( ) ; if ( axioms == null || axioms instanceof No Axioms ) { entailment Regime = SD . simple Entailment ; } else if ( axioms instanceof Owl Axioms )... | protected void describeEntailmentRegime ( ) { if ( ! tripleStore . isQuads ( ) ) return ; final URI entailmentRegime ; final Axioms axioms = tripleStore . getAxioms ( ) ; if ( axioms == null || axioms instanceof NoAxioms ) { entailmentRegime = SD . simpleEntailment ; } else if ( axioms instanceof OwlAxioms ) { entailme... | 127 |
java-test-10479 | java | What could report this self ? | the axioms interface | protected void describe Entailment Regime ( ) { if ( ! triple Store . is Quads ( ) ) return ; final URI entailment Regime ; final Axioms axioms = triple Store . get Axioms ( ) ; if ( axioms == null || axioms instanceof No Axioms ) { entailment Regime = SD . simple Entailment ; } else if ( axioms instanceof Owl Axioms )... | protected void describeEntailmentRegime ( ) { if ( ! tripleStore . isQuads ( ) ) return ; final URI entailmentRegime ; final Axioms axioms = tripleStore . getAxioms ( ) ; if ( axioms == null || axioms instanceof NoAxioms ) { entailmentRegime = SD . simpleEntailment ; } else if ( axioms instanceof OwlAxioms ) { entailme... | 127 |
java-test-10484 | java | What does this mimic ? | the readfile ( ) call | private void read Boot Json ( String basedir ) throws IO Exception { Bootstrap Config boot = Bootstrap Config . from Json File ( basedir + STRING ) ; String dsame Password ; String config Store Password ; try { AM Key Provider am Key Provider = new AM Key Provider ( boot . get Key Store Config ( STRING ) ) ; dsame Pass... | private void readBootJson ( String basedir ) throws IOException { BootstrapConfig boot = BootstrapConfig . fromJsonFile ( basedir + STRING ) ; String dsamePassword ; String configStorePassword ; try { AMKeyProvider amKeyProvider = new AMKeyProvider ( boot . getKeyStoreConfig ( STRING ) ) ; dsamePassword = amKeyProvider... | 364 |
java-test-10485 | java | In which direction do bootstrap data read ? | from boot | private void read Boot Json ( String basedir ) throws IO Exception { Bootstrap Config boot = Bootstrap Config . from Json File ( basedir + STRING ) ; String dsame Password ; String config Store Password ; try { AM Key Provider am Key Provider = new AM Key Provider ( boot . get Key Store Config ( STRING ) ) ; dsame Pass... | private void readBootJson ( String basedir ) throws IOException { BootstrapConfig boot = BootstrapConfig . fromJsonFile ( basedir + STRING ) ; String dsamePassword ; String configStorePassword ; try { AMKeyProvider amKeyProvider = new AMKeyProvider ( boot . getKeyStoreConfig ( STRING ) ) ; dsamePassword = amKeyProvider... | 364 |
java-test-10486 | java | How did this . data list populate with the bootstrap url ? | in the same form as the bootstrap file | private void read Boot Json ( String basedir ) throws IO Exception { Bootstrap Config boot = Bootstrap Config . from Json File ( basedir + STRING ) ; String dsame Password ; String config Store Password ; try { AM Key Provider am Key Provider = new AM Key Provider ( boot . get Key Store Config ( STRING ) ) ; dsame Pass... | private void readBootJson ( String basedir ) throws IOException { BootstrapConfig boot = BootstrapConfig . fromJsonFile ( basedir + STRING ) ; String dsamePassword ; String configStorePassword ; try { AMKeyProvider amKeyProvider = new AMKeyProvider ( boot . getKeyStoreConfig ( STRING ) ) ; dsamePassword = amKeyProvider... | 364 |
java-test-10487 | java | Where are the boot passwords stored ? | in keystore | private void read Boot Json ( String basedir ) throws IO Exception { Bootstrap Config boot = Bootstrap Config . from Json File ( basedir + STRING ) ; String dsame Password ; String config Store Password ; try { AM Key Provider am Key Provider = new AM Key Provider ( boot . get Key Store Config ( STRING ) ) ; dsame Pass... | private void readBootJson ( String basedir ) throws IOException { BootstrapConfig boot = BootstrapConfig . fromJsonFile ( basedir + STRING ) ; String dsamePassword ; String configStorePassword ; try { AMKeyProvider amKeyProvider = new AMKeyProvider ( boot . getKeyStoreConfig ( STRING ) ) ; dsamePassword = amKeyProvider... | 364 |
java-test-10488 | java | What are stored in keystore ? | the boot passwords | private void read Boot Json ( String basedir ) throws IO Exception { Bootstrap Config boot = Bootstrap Config . from Json File ( basedir + STRING ) ; String dsame Password ; String config Store Password ; try { AM Key Provider am Key Provider = new AM Key Provider ( boot . get Key Store Config ( STRING ) ) ; dsame Pass... | private void readBootJson ( String basedir ) throws IOException { BootstrapConfig boot = BootstrapConfig . fromJsonFile ( basedir + STRING ) ; String dsamePassword ; String configStorePassword ; try { AMKeyProvider amKeyProvider = new AMKeyProvider ( boot . getKeyStoreConfig ( STRING ) ) ; dsamePassword = amKeyProvider... | 364 |
java-test-10489 | java | What does the code create ? | a coordinate assignment | public mx Coordinate Assignment ( mx Hierarchical Layout layout , double intra Cell Spacing , double inter Rank Cell Spacing , int orientation , double initial X , double parallel Edge Spacing ) { this . layout = layout ; this . intra Cell Spacing = intra Cell Spacing ; this . inter Rank Cell Spacing = inter Rank Cell ... | public mxCoordinateAssignment ( mxHierarchicalLayout layout , double intraCellSpacing , double interRankCellSpacing , int orientation , double initialX , double parallelEdgeSpacing ) { this . layout = layout ; this . intraCellSpacing = intraCellSpacing ; this . interRankCellSpacing = interRankCellSpacing ; this . orien... | 96 |
java-test-10492 | java | Till when will helper method read the inputstream repeatedly ? | until the given array is filled | private static void read ( final Input Stream istream , final byte [ ] bytes ) throws IO Exception { int pos = NUM ; while ( pos < bytes . length ) { int read = istream . read ( bytes , pos , bytes . length - pos ) ; if ( read < NUM ) { throw new Runtime Exception ( STRING ) ; } pos += read ; } } | private static void read ( final InputStream istream , final byte [ ] bytes ) throws IOException { int pos = _NUM ; while ( pos < bytes . length ) { int read = istream . read ( bytes , pos , bytes . length - pos ) ; if ( read < _NUM ) { throw new RuntimeException ( STRING ) ; } pos += read ; } } | 74 |
java-test-10493 | java | In which direction is by its evaluated the postxpath until the postxpath matches exactly one element ? | from the signedelement | public static Element detect Hashed Post Tree ( Element signed Element , String post X Path ) { Element signed Post Part = signed Element ; Node signed Post Part Parent = signed Post Part . get Parent Node ( ) ; final X Path Factory factory = X Path Factory . new Instance ( ) ; final X Path xpath = factory . new X Path... | public static Element detectHashedPostTree ( Element signedElement , String postXPath ) { Element signedPostPart = signedElement ; Node signedPostPartParent = signedPostPart . getParentNode ( ) ; final XPathFactory factory = XPathFactory . newInstance ( ) ; final XPath xpath = factory . newXPath ( ) ; final Document ow... | 296 |
java-test-10494 | java | What does the code detect ? | the minimal elements protected by the postxpath | public static Element detect Hashed Post Tree ( Element signed Element , String post X Path ) { Element signed Post Part = signed Element ; Node signed Post Part Parent = signed Post Part . get Parent Node ( ) ; final X Path Factory factory = X Path Factory . new Instance ( ) ; final X Path xpath = factory . new X Path... | public static Element detectHashedPostTree ( Element signedElement , String postXPath ) { Element signedPostPart = signedElement ; Node signedPostPartParent = signedPostPart . getParentNode ( ) ; final XPathFactory factory = XPathFactory . newInstance ( ) ; final XPath xpath = factory . newXPath ( ) ; final Document ow... | 296 |
java-test-10495 | java | Till when is by its evaluated the postxpath from the signedelement ? | until the postxpath matches exactly one element | public static Element detect Hashed Post Tree ( Element signed Element , String post X Path ) { Element signed Post Part = signed Element ; Node signed Post Part Parent = signed Post Part . get Parent Node ( ) ; final X Path Factory factory = X Path Factory . new Instance ( ) ; final X Path xpath = factory . new X Path... | public static Element detectHashedPostTree ( Element signedElement , String postXPath ) { Element signedPostPart = signedElement ; Node signedPostPartParent = signedPostPart . getParentNode ( ) ; final XPathFactory factory = XPathFactory . newInstance ( ) ; final XPath xpath = factory . newXPath ( ) ; final Document ow... | 296 |
java-test-10497 | java | What prints transformation_failed_flag if something went wrong ? | p > method | public static void main ( String [ ] args ) { Print Stream ps = null ; try { ps = new Print Stream ( System . out , BOOL , STRING ) ; ps . println ( transform ( args ) ) ; } catch ( Throwable t ) { t . print Stack Trace ( ) ; if ( ps != null ) ps . println ( TRANSFORMATION FAILED FLAG ) ; if ( t instanceof Error ) thro... | public static void main ( String [ ] args ) { PrintStream ps = null ; try { ps = new PrintStream ( System . out , _BOOL , STRING ) ; ps . println ( transform ( args ) ) ; } catch ( Throwable t ) { t . printStackTrace ( ) ; if ( ps != null ) ps . println ( TRANSFORMATION_FAILED_FLAG ) ; if ( t instanceof Error ) throw (... | 88 |
java-test-10498 | java | When being main method triggered ? | in step 3 of the workaround | public static void main ( String [ ] args ) { Print Stream ps = null ; try { ps = new Print Stream ( System . out , BOOL , STRING ) ; ps . println ( transform ( args ) ) ; } catch ( Throwable t ) { t . print Stack Trace ( ) ; if ( ps != null ) ps . println ( TRANSFORMATION FAILED FLAG ) ; if ( t instanceof Error ) thro... | public static void main ( String [ ] args ) { PrintStream ps = null ; try { ps = new PrintStream ( System . out , _BOOL , STRING ) ; ps . println ( transform ( args ) ) ; } catch ( Throwable t ) { t . printStackTrace ( ) ; if ( ps != null ) ps . println ( TRANSFORMATION_FAILED_FLAG ) ; if ( t instanceof Error ) throw (... | 88 |
java-test-10499 | java | What does p > method print if something went wrong ? | transformation_failed_flag | public static void main ( String [ ] args ) { Print Stream ps = null ; try { ps = new Print Stream ( System . out , BOOL , STRING ) ; ps . println ( transform ( args ) ) ; } catch ( Throwable t ) { t . print Stack Trace ( ) ; if ( ps != null ) ps . println ( TRANSFORMATION FAILED FLAG ) ; if ( t instanceof Error ) thro... | public static void main ( String [ ] args ) { PrintStream ps = null ; try { ps = new PrintStream ( System . out , _BOOL , STRING ) ; ps . println ( transform ( args ) ) ; } catch ( Throwable t ) { t . printStackTrace ( ) ; if ( ps != null ) ps . println ( TRANSFORMATION_FAILED_FLAG ) ; if ( t instanceof Error ) throw (... | 88 |
java-test-10500 | java | Where can instructions start finally ? | in the middle of the first block | private static Blocks Remove Info is Start Block ( Block Node rem Block , Block Node start Block ) { List < Insn Node > rem Insns = rem Block . get Instructions ( ) ; List < Insn Node > start Insns = start Block . get Instructions ( ) ; if ( rem Insns . size ( ) < start Insns . size ( ) ) { return null ; } int start Po... | private static BlocksRemoveInfo isStartBlock ( BlockNode remBlock , BlockNode startBlock ) { List < InsnNode > remInsns = remBlock . getInstructions ( ) ; List < InsnNode > startInsns = startBlock . getInstructions ( ) ; if ( remInsns . size ( ) < startInsns . size ( ) ) { return null ; } int startPos = remInsns . size... | 329 |
java-test-10502 | java | What does the code create ? | an upload directory | public static void create Upload Dir ( Server server , String upload Dir ) throws Docker JSON Exception { File upload Folder = new File ( upload Dir + STRING + server . get Container ID ( ) ) ; if ( ! upload Folder . exists ( ) ) { upload Folder . mkdir ( ) ; } } | public static void createUploadDir ( Server server , String uploadDir ) throws DockerJSONException { File uploadFolder = new File ( uploadDir + STRING + server . getContainerID ( ) ) ; if ( ! uploadFolder . exists ( ) ) { uploadFolder . mkdir ( ) ; } } | 60 |
java-test-10503 | java | What does the last search term have ? | a non - zero length | protected void clear Search ( ) { if ( m Last Search . length ( ) > NUM ) { m Last Search = STRING ; notify Search Listeners ( new Search Event ( Search Panel . this , STRING , is Regular Expression ( ) ) ) ; } } | protected void clearSearch ( ) { if ( m_LastSearch . length ( ) > _NUM ) { m_LastSearch = STRING ; notifySearchListeners ( new SearchEvent ( SearchPanel . this , STRING , isRegularExpression ( ) ) ) ; } } | 51 |
java-test-10504 | java | What had a non - zero length ? | the last search term | protected void clear Search ( ) { if ( m Last Search . length ( ) > NUM ) { m Last Search = STRING ; notify Search Listeners ( new Search Event ( Search Panel . this , STRING , is Regular Expression ( ) ) ) ; } } | protected void clearSearch ( ) { if ( m_LastSearch . length ( ) > _NUM ) { m_LastSearch = STRING ; notifySearchListeners ( new SearchEvent ( SearchPanel . this , STRING , isRegularExpression ( ) ) ) ; } } | 51 |
java-test-10509 | java | What deletes sms ? | cmd | private void delete SMS ( String cmd , String search ) { int nb Deleted = - NUM ; if ( cmd . equals ( STRING ) ) { nb Deleted = m Sms Manager . delete All Sms ( ) ; } else if ( cmd . equals ( STRING ) ) { nb Deleted = m Sms Manager . delete Sent Sms ( ) ; } else if ( cmd . starts With ( STRING ) ) { Integer number = To... | private void deleteSMS ( String cmd , String search ) { int nbDeleted = - _NUM ; if ( cmd . equals ( STRING ) ) { nbDeleted = mSmsManager . deleteAllSms ( ) ; } else if ( cmd . equals ( STRING ) ) { nbDeleted = mSmsManager . deleteSentSms ( ) ; } else if ( cmd . startsWith ( STRING ) ) { Integer number = Tools . parseI... | 520 |
java-test-10510 | java | When do this call ? | when finished with the result of a copyarguments ( ) call | static public void done With Arguments ( Context ctx , Local Member res [ ] ) { for ( int i = NUM ; i < res . length ; i ++ ) { if ( res [ i ] . original Of Copy . access Peer == res [ i ] ) { res [ i ] . original Of Copy . access Peer = null ; } } } | static public void doneWithArguments ( Context ctx , LocalMember res [ ] ) { for ( int i = _NUM ; i < res . length ; i ++ ) { if ( res [ i ] . originalOfCopy . accessPeer == res [ i ] ) { res [ i ] . originalOfCopy . accessPeer = null ; } } } | 71 |
java-test-10511 | java | When did the code call in controltower ? | when a button is pressed | public synchronized void send Command ( AR Drone drone , Controller Button button ) throws IO Exception { List < Assignable Control > commands = map . get ( button ) ; if ( commands == null ) { return ; } for ( Iterator < Assignable Control > it = commands . iterator ( ) ; it . has Next ( ) ; ) { final Assignable Contr... | public synchronized void sendCommand ( ARDrone drone , ControllerButton button ) throws IOException { List < AssignableControl > commands = map . get ( button ) ; if ( commands == null ) { return ; } for ( Iterator < AssignableControl > it = commands . iterator ( ) ; it . hasNext ( ) ; ) { final AssignableControl assig... | 116 |
java-test-10513 | java | How does the code provide a collection of all the nodes in the tree ? | using a depth - first traversal | public List depth First ( boolean preorder ) { List answer = new Node List ( ) ; if ( preorder ) answer . add ( this ) ; answer . add All ( depth First Rest ( preorder ) ) ; if ( ! preorder ) answer . add ( this ) ; return answer ; } | public List depthFirst ( boolean preorder ) { List answer = new NodeList ( ) ; if ( preorder ) answer . add ( this ) ; answer . addAll ( depthFirstRest ( preorder ) ) ; if ( ! preorder ) answer . add ( this ) ; return answer ; } | 58 |
java-test-10514 | java | How do the uuid return ? | without the " urn : uuid : " prefix | public static UUID from UUID As URN String To UUID ( String UUI Das URN ) { if ( ! UUI Das URN . starts With ( UUID Helper . UUID as a URN PREFIX ) ) { IMF Error Logger imf Error Logger = new IMF Error Logger Impl ( ) ; imf Error Logger . add Error ( IMF Error Logger . IMF Errors . Error Codes . UUID ERROR , IMF Error ... | public static UUID fromUUIDAsURNStringToUUID ( String UUIDasURN ) { if ( ! UUIDasURN . startsWith ( UUIDHelper . UUID_as_a_URN_PREFIX ) ) { IMFErrorLogger imfErrorLogger = new IMFErrorLoggerImpl ( ) ; imfErrorLogger . addError ( IMFErrorLogger . IMFErrors . ErrorCodes . UUID_ERROR , IMFErrorLogger . IMFErrors . ErrorLe... | 166 |
java-test-10515 | java | What does this save ? | the building of meta data for each line | protected boolean parse Line Internal ( ) { int i = NUM ; for ( ; tokenizer . valid ( ) ; tokenizer . advance ( ) , i ++ ) { if ( ! is Label Column ( i ) && ! tokenizer . is Quoted ( ) ) { try { attributes . add ( tokenizer . get Double ( ) ) ; continue ; } catch ( Number Format Exception e ) { } } String lbl = tokeniz... | protected boolean parseLineInternal ( ) { int i = _NUM ; for ( ; tokenizer . valid ( ) ; tokenizer . advance ( ) , i ++ ) { if ( ! isLabelColumn ( i ) && ! tokenizer . isQuoted ( ) ) { try { attributes . add ( tokenizer . getDouble ( ) ) ; continue ; } catch ( NumberFormatException e ) { } } String lbl = tokenizer . ge... | 203 |
java-test-10516 | java | How does the code split the document ? | basing on the given size | public List < Pdf Document > split By Size ( long size ) { List < Page Range > split Ranges = new Array List < > ( ) ; int current Page = NUM ; int num Of Pages = pdf Document . get Number Of Pages ( ) ; while ( current Page <= num Of Pages ) { Page Range next Range = get Next Range ( current Page , num Of Pages , size... | public List < PdfDocument > splitBySize ( long size ) { List < PageRange > splitRanges = new ArrayList < > ( ) ; int currentPage = _NUM ; int numOfPages = pdfDocument . getNumberOfPages ( ) ; while ( currentPage <= numOfPages ) { PageRange nextRange = getNextRange ( currentPage , numOfPages , size ) ; splitRanges . add... | 139 |
java-test-10518 | java | How does the code find an element null if no element is found ? | by its " i d " attribute | public static Element find ( Node parent , String name ) { Node List list = parent . get Child Nodes ( ) ; for ( int i = NUM ; i < list . get Length ( ) ; i ++ ) { Node n = list . item ( i ) ; if ( n instanceof Element ) { Element e = ( Element ) n ; if ( name . equals ( e . get Attribute ( STRING ) ) ) { return e ; } ... | public static Element find ( Node parent , String name ) { NodeList list = parent . getChildNodes ( ) ; for ( int i = _NUM ; i < list . getLength ( ) ; i ++ ) { Node n = list . item ( i ) ; if ( n instanceof Element ) { Element e = ( Element ) n ; if ( name . equals ( e . getAttribute ( STRING ) ) ) { return e ; } } El... | 116 |
java-test-10519 | java | When does comparison sorts attributes test ? | before elements | public void test Sorts Attributes Before Elements ( ) throws Exception { Xpp Dom dom 1 = Xpp Factory . build Dom ( STRING ) ; Xpp Dom dom 2 = Xpp Factory . build Dom ( STRING ) ; assert Equals ( - NUM , comparator . compare ( dom 1 , dom 2 ) ) ; assert Equals ( STRING , xpath . get ( ) ) ; assert Equals ( NUM , compara... | public void testSortsAttributesBeforeElements ( ) throws Exception { XppDom dom1 = XppFactory . buildDom ( STRING ) ; XppDom dom2 = XppFactory . buildDom ( STRING ) ; assertEquals ( - _NUM , comparator . compare ( dom1 , dom2 ) ) ; assertEquals ( STRING , xpath . get ( ) ) ; assertEquals ( _NUM , comparator . compare (... | 100 |
java-test-10523 | java | What does the code validate ? | the module instance names provided to the setproperties | private boolean validate Auth Schemes ( Set auth Scheme Set ) throws Policy Exception { if ( auth Scheme Set . is Empty ( ) ) { String args [ ] = { AUTH SCHEME } ; throw new Policy Exception ( Res Bundle Utils . rb Name , STRING , args , null ) ; } Iterator auth Scheme Set Iter = auth Scheme Set . iterator ( ) ; auth S... | private boolean validateAuthSchemes ( Set authSchemeSet ) throws PolicyException { if ( authSchemeSet . isEmpty ( ) ) { String args [ ] = { AUTH_SCHEME } ; throw new PolicyException ( ResBundleUtils . rbName , STRING , args , null ) ; } Iterator authSchemeSetIter = authSchemeSet . iterator ( ) ; authSchemes . clear ( )... | 162 |
java-test-10524 | java | What does the code do ? | a subtree jump move | public double do Operation ( ) throws Operator Failed Exception { double logq ; final double alpha = ( arctan Transform ? Math . atan ( bias ) * SCALE ALPHA : Math . log ( bias ) ) ; final Node Ref root = tree . get Root ( ) ; double max Height = tree . get Node Height ( root ) ; Node Ref i ; Node Ref iP = null ; Node ... | public double doOperation ( ) throws OperatorFailedException { double logq ; final double alpha = ( arctanTransform ? Math . atan ( bias ) * SCALE_ALPHA : Math . log ( bias ) ) ; final NodeRef root = tree . getRoot ( ) ; double maxHeight = tree . getNodeHeight ( root ) ; NodeRef i ; NodeRef iP = null ; NodeRef CiP = nu... | 458 |
java-test-10525 | java | Where must which be specified ? | in the input parameter set | @ Override public Cert Path Builder Result engine Build ( Cert Path Parameters params ) throws Cert Path Builder Exception , Invalid Algorithm Parameter Exception { if ( debug != null ) { debug . println ( STRING + params + STRING ) ; } build Params = PKIX . check Builder Params ( params ) ; return build ( ) ; } | @ Override public CertPathBuilderResult engineBuild ( CertPathParameters params ) throws CertPathBuilderException , InvalidAlgorithmParameterException { if ( debug != null ) { debug . println ( STRING + params + STRING ) ; } buildParams = PKIX . checkBuilderParams ( params ) ; return build ( ) ; } | 63 |
java-test-10526 | java | What will this method attempt ? | to build in the forward direction : from the target to the ca . < p > the certification path that is constructed is validated according to the pkix specification | @ Override public Cert Path Builder Result engine Build ( Cert Path Parameters params ) throws Cert Path Builder Exception , Invalid Algorithm Parameter Exception { if ( debug != null ) { debug . println ( STRING + params + STRING ) ; } build Params = PKIX . check Builder Params ( params ) ; return build ( ) ; } | @ Override public CertPathBuilderResult engineBuild ( CertPathParameters params ) throws CertPathBuilderException , InvalidAlgorithmParameterException { if ( debug != null ) { debug . println ( STRING + params + STRING ) ; } buildParams = PKIX . checkBuilderParams ( params ) ; return build ( ) ; } | 63 |
java-test-10527 | java | What is using the sun build algorithm to which ? | a certification path | @ Override public Cert Path Builder Result engine Build ( Cert Path Parameters params ) throws Cert Path Builder Exception , Invalid Algorithm Parameter Exception { if ( debug != null ) { debug . println ( STRING + params + STRING ) ; } build Params = PKIX . check Builder Params ( params ) ; return build ( ) ; } | @ Override public CertPathBuilderResult engineBuild ( CertPathParameters params ) throws CertPathBuilderException , InvalidAlgorithmParameterException { if ( debug != null ) { debug . println ( STRING + params + STRING ) ; } buildParams = PKIX . checkBuilderParams ( params ) ; return build ( ) ; } | 63 |
java-test-10528 | java | What do a certification path use to which ? | the sun build algorithm | @ Override public Cert Path Builder Result engine Build ( Cert Path Parameters params ) throws Cert Path Builder Exception , Invalid Algorithm Parameter Exception { if ( debug != null ) { debug . println ( STRING + params + STRING ) ; } build Params = PKIX . check Builder Params ( params ) ; return build ( ) ; } | @ Override public CertPathBuilderResult engineBuild ( CertPathParameters params ) throws CertPathBuilderException , InvalidAlgorithmParameterException { if ( debug != null ) { debug . println ( STRING + params + STRING ) ; } buildParams = PKIX . checkBuilderParams ( params ) ; return build ( ) ; } | 63 |
java-test-10530 | java | What does the code write ? | the send to the journal | @ Override public void write Send ( Stub Amp actor , String method Name , Object [ ] args , Inbox Amp inbox ) { try ( Output Stream os = open Item ( inbox ) ) { try ( Out H 3 out = serializer . out ( os ) ) { String key = actor . journal Key ( ) ; out . write Long ( CODE SEND ) ; out . write String ( key ) ; out . writ... | @ Override public void writeSend ( StubAmp actor , String methodName , Object [ ] args , InboxAmp inbox ) { try ( OutputStream os = openItem ( inbox ) ) { try ( OutH3 out = _serializer . out ( os ) ) { String key = actor . journalKey ( ) ; out . writeLong ( CODE_SEND ) ; out . writeString ( key ) ; out . writeString ( ... | 145 |
java-test-10533 | java | For what purpose do asterisk and plus operators with bounded repetitions replace we ? | to avoid practically endless backtracking patterns | public static String random Regexpish String ( Random r , int max Length ) { final String Builder regexp = new String Builder ( max Length ) ; for ( int i = next Int ( r , NUM , max Length ) ; i > NUM ; i -- ) { if ( r . next Boolean ( ) ) { regexp . append ( ( char ) Random Numbers . random Int Between ( r , STRING , ... | public static String randomRegexpishString ( Random r , int maxLength ) { final StringBuilder regexp = new StringBuilder ( maxLength ) ; for ( int i = nextInt ( r , _NUM , maxLength ) ; i > _NUM ; i -- ) { if ( r . nextBoolean ( ) ) { regexp . append ( ( char ) RandomNumbers . randomIntBetween ( r , STRING , STRING ) )... | 114 |
java-test-10534 | java | What do we avoid ? | practically endless backtracking patterns | public static String random Regexpish String ( Random r , int max Length ) { final String Builder regexp = new String Builder ( max Length ) ; for ( int i = next Int ( r , NUM , max Length ) ; i > NUM ; i -- ) { if ( r . next Boolean ( ) ) { regexp . append ( ( char ) Random Numbers . random Int Between ( r , STRING , ... | public static String randomRegexpishString ( Random r , int maxLength ) { final StringBuilder regexp = new StringBuilder ( maxLength ) ; for ( int i = nextInt ( r , _NUM , maxLength ) ; i > _NUM ; i -- ) { if ( r . nextBoolean ( ) ) { regexp . append ( ( char ) RandomNumbers . randomIntBetween ( r , STRING , STRING ) )... | 114 |
java-test-10535 | java | What does the code decode from its textual json representation if possible ? | a chat message | public static Text Message decode ( String json ) { JSON Parser parser = new JSON Parser ( ) ; try { Object o = parser . parse ( json ) ; if ( o instanceof JSON Object ) { return new Text Message ( ( JSON Object ) o ) ; } else { return new Text Message ( o . to String ( ) ) ; } } catch ( Parse Exception e ) { return ne... | public static TextMessage decode ( String json ) { JSONParser parser = new JSONParser ( ) ; try { Object o = parser . parse ( json ) ; if ( o instanceof JSONObject ) { return new TextMessage ( ( JSONObject ) o ) ; } else { return new TextMessage ( o . toString ( ) ) ; } } catch ( ParseException e ) { return new TextMes... | 87 |
java-test-10536 | java | What do a regular expression match ? | the kleene closure of the language matched by the argument regular expression | public static RE mk Star ( RE x ) { if ( x . equals ( epsilon ) || x . equals ( empty ) ) { return epsilon ; } RE res = new RE ( Re Op . STAR ) ; res . unary Arg = x ; return res ; } | public static RE mkStar ( RE x ) { if ( x . equals ( epsilon ) || x . equals ( empty ) ) { return epsilon ; } RE res = new RE ( ReOp . STAR ) ; res . unaryArg = x ; return res ; } | 54 |
java-test-10542 | java | Where do those not show propely ? | on a ligth background | public static String [ ] filter Light Colors ( String [ ] a Palette , int a Threshold ) { List < String > filtered = new Array List < String > ( ) ; for ( String color : a Palette ) { if ( ! is Too Light ( color , a Threshold ) ) { filtered . add ( color ) ; } } return ( String [ ] ) filtered . to Array ( new String [ ... | public static String [ ] filterLightColors ( String [ ] aPalette , int aThreshold ) { List < String > filtered = new ArrayList < String > ( ) ; for ( String color : aPalette ) { if ( ! isTooLight ( color , aThreshold ) ) { filtered . add ( color ) ; } } return ( String [ ] ) filtered . toArray ( new String [ filtered .... | 90 |
java-test-10543 | java | How do those not show on a ligth background ? | propely | public static String [ ] filter Light Colors ( String [ ] a Palette , int a Threshold ) { List < String > filtered = new Array List < String > ( ) ; for ( String color : a Palette ) { if ( ! is Too Light ( color , a Threshold ) ) { filtered . add ( color ) ; } } return ( String [ ] ) filtered . to Array ( new String [ ... | public static String [ ] filterLightColors ( String [ ] aPalette , int aThreshold ) { List < String > filtered = new ArrayList < String > ( ) ; for ( String color : aPalette ) { if ( ! isTooLight ( color , aThreshold ) ) { filtered . add ( color ) ; } } return ( String [ ] ) filtered . toArray ( new String [ filtered .... | 90 |
java-test-10544 | java | How should the hashmap be created so that jackson can deserialize it and instantiate an object ? | through jackson | private static < T > T hash Map To Object ( Linked Hash Map map , Class < T > type ) { try { return string To Object ( mapper . write Value As String ( map ) , type ) ; } catch ( IO Exception e ) { log . warn ( STRING + type . get Name ( ) + STRING + map . to String ( ) + STRING + e . get Message ( ) ) ; return null ; ... | private static < T > T hashMapToObject ( LinkedHashMap map , Class < T > type ) { try { return stringToObject ( mapper . writeValueAsString ( map ) , type ) ; } catch ( IOException e ) { log . warn ( STRING + type . getName ( ) + STRING + map . toString ( ) + STRING + e . getMessage ( ) ) ; return null ; } } | 88 |
java-test-10545 | java | For what purpose should the hashmap be created through jackson ? | so that jackson can deserialize it and instantiate an object | private static < T > T hash Map To Object ( Linked Hash Map map , Class < T > type ) { try { return string To Object ( mapper . write Value As String ( map ) , type ) ; } catch ( IO Exception e ) { log . warn ( STRING + type . get Name ( ) + STRING + map . to String ( ) + STRING + e . get Message ( ) ) ; return null ; ... | private static < T > T hashMapToObject ( LinkedHashMap map , Class < T > type ) { try { return stringToObject ( mapper . writeValueAsString ( map ) , type ) ; } catch ( IOException e ) { log . warn ( STRING + type . getName ( ) + STRING + map . toString ( ) + STRING + e . getMessage ( ) ) ; return null ; } } | 88 |
java-test-10546 | java | What does the code add ? | an option requiring an argument | public void add Option ( String option , String argument Desc , String description ) { option List . add ( option ) ; option Description Map . put ( option , description ) ; requires Argument Set . add ( option ) ; argument Description Map . put ( option , argument Desc ) ; int width = option . length ( ) + NUM + argum... | public void addOption ( String option , String argumentDesc , String description ) { optionList . add ( option ) ; optionDescriptionMap . put ( option , description ) ; requiresArgumentSet . add ( option ) ; argumentDescriptionMap . put ( option , argumentDesc ) ; int width = option . length ( ) + _NUM + argumentDesc .... | 89 |
java-test-10547 | java | What does the code create ? | a secure client socket that is connected to the given address and port | public static Socket create Socket ( Inet Address address , int port ) throws IO Exception { Socket socket = null ; set Keystore ( ) ; SSL Socket Factory f = ( SSL Socket Factory ) SSL Socket Factory . get Default ( ) ; SSL Socket secure Socket = ( SSL Socket ) f . create Socket ( ) ; secure Socket . connect ( new Inet... | public static Socket createSocket ( InetAddress address , int port ) throws IOException { Socket socket = null ; setKeystore ( ) ; SSLSocketFactory f = ( SSLSocketFactory ) SSLSocketFactory . getDefault ( ) ; SSLSocket secureSocket = ( SSLSocket ) f . createSocket ( ) ; secureSocket . connect ( new InetSocketAddress ( ... | 166 |
java-test-10548 | java | What does the code add ? | a new bytes array argument | public void add Argument ( byte [ ] argument ) { if ( argument == null ) throw new Null Pointer Exception ( STRING ) ; arguments . add ( Arrays . copy Of Range ( argument , NUM , ( argument . length > NUM ) ? NUM : argument . length ) ) ; } | public void addArgument ( byte [ ] argument ) { if ( argument == null ) throw new NullPointerException ( STRING ) ; arguments . add ( Arrays . copyOfRange ( argument , _NUM , ( argument . length > _NUM ) ? _NUM : argument . length ) ) ; } | 57 |
java-test-10549 | java | Why does every star import end ? | as this is the expected syntax in import checks | private static List < String > normalize Star Imports ( List < String > star Imports ) { List < String > result = new Array List < String > ( star Imports . size ( ) ) ; for ( String star Import : star Imports ) { if ( star Import . ends With ( STRING ) ) { result . add ( star Import ) ; } else if ( star Import . ends ... | private static List < String > normalizeStarImports ( List < String > starImports ) { List < String > result = new ArrayList < String > ( starImports . size ( ) ) ; for ( String starImport : starImports ) { if ( starImport . endsWith ( STRING ) ) { result . add ( starImport ) ; } else if ( starImport . endsWith ( STRIN... | 118 |
java-test-10550 | java | What does the code append the log - file property if set of properties does not already define the log - file property or the gemfire . agent . log - file property if set of properties does not already define the log - file property or the gemfire . agent . log - file property ? | to the properties object | private static void append Log File Property ( final Properties props ) { if ( ! ( props . contains Key ( Distributed System Config . LOG FILE NAME ) || props . contains Key ( SYSTEM PROPERTY PREFIX + Distributed System Config . LOG FILE NAME ) ) ) { props . put ( Distributed System Config . LOG FILE NAME , DEFAULT LOG... | private static void appendLogFileProperty ( final Properties props ) { if ( ! ( props . containsKey ( DistributedSystemConfig . LOG_FILE_NAME ) || props . containsKey ( SYSTEM_PROPERTY_PREFIX + DistributedSystemConfig . LOG_FILE_NAME ) ) ) { props . put ( DistributedSystemConfig . LOG_FILE_NAME , DEFAULT_LOG_FILE ) ; }... | 70 |
java-test-10551 | java | What does set of properties not define already ? | the log - file property or the gemfire . agent . log - file property | private static void append Log File Property ( final Properties props ) { if ( ! ( props . contains Key ( Distributed System Config . LOG FILE NAME ) || props . contains Key ( SYSTEM PROPERTY PREFIX + Distributed System Config . LOG FILE NAME ) ) ) { props . put ( Distributed System Config . LOG FILE NAME , DEFAULT LOG... | private static void appendLogFileProperty ( final Properties props ) { if ( ! ( props . containsKey ( DistributedSystemConfig . LOG_FILE_NAME ) || props . containsKey ( SYSTEM_PROPERTY_PREFIX + DistributedSystemConfig . LOG_FILE_NAME ) ) ) { props . put ( DistributedSystemConfig . LOG_FILE_NAME , DEFAULT_LOG_FILE ) ; }... | 70 |
java-test-10552 | java | What does the code append to the properties object if set of properties does not already define the log - file property or the gemfire . agent . log - file property if set of properties does not already define the log - file property or the gemfire . agent . log - file property ? | the log - file property | private static void append Log File Property ( final Properties props ) { if ( ! ( props . contains Key ( Distributed System Config . LOG FILE NAME ) || props . contains Key ( SYSTEM PROPERTY PREFIX + Distributed System Config . LOG FILE NAME ) ) ) { props . put ( Distributed System Config . LOG FILE NAME , DEFAULT LOG... | private static void appendLogFileProperty ( final Properties props ) { if ( ! ( props . containsKey ( DistributedSystemConfig . LOG_FILE_NAME ) || props . containsKey ( SYSTEM_PROPERTY_PREFIX + DistributedSystemConfig . LOG_FILE_NAME ) ) ) { props . put ( DistributedSystemConfig . LOG_FILE_NAME , DEFAULT_LOG_FILE ) ; }... | 70 |
java-test-10553 | java | What does not define the log - file property or the gemfire . agent . log - file property already ? | set of properties | private static void append Log File Property ( final Properties props ) { if ( ! ( props . contains Key ( Distributed System Config . LOG FILE NAME ) || props . contains Key ( SYSTEM PROPERTY PREFIX + Distributed System Config . LOG FILE NAME ) ) ) { props . put ( Distributed System Config . LOG FILE NAME , DEFAULT LOG... | private static void appendLogFileProperty ( final Properties props ) { if ( ! ( props . containsKey ( DistributedSystemConfig . LOG_FILE_NAME ) || props . containsKey ( SYSTEM_PROPERTY_PREFIX + DistributedSystemConfig . LOG_FILE_NAME ) ) ) { props . put ( DistributedSystemConfig . LOG_FILE_NAME , DEFAULT_LOG_FILE ) ; }... | 70 |
java-test-10554 | java | For what purpose did the additional number of containers need ? | to accommodate a scale up / down operation | private int compute Num Additional Containers ( Map < String , Integer > component Changes , Packing Plan packing Plan ) { Resource scale Down Resource = Packing Utils . compute Total Resource Change ( topology , component Changes , default Instance Resources , Packing Utils . Scaling Direction . DOWN ) ; Resource scal... | private int computeNumAdditionalContainers ( Map < String , Integer > componentChanges , PackingPlan packingPlan ) { Resource scaleDownResource = PackingUtils . computeTotalResourceChange ( topology , componentChanges , defaultInstanceResources , PackingUtils . ScalingDirection . DOWN ) ; Resource scaleUpResource = Pac... | 122 |
java-test-10555 | java | What does the code compute ? | the additional number of containers needed to accommodate a scale up / down operation | private int compute Num Additional Containers ( Map < String , Integer > component Changes , Packing Plan packing Plan ) { Resource scale Down Resource = Packing Utils . compute Total Resource Change ( topology , component Changes , default Instance Resources , Packing Utils . Scaling Direction . DOWN ) ; Resource scal... | private int computeNumAdditionalContainers ( Map < String , Integer > componentChanges , PackingPlan packingPlan ) { Resource scaleDownResource = PackingUtils . computeTotalResourceChange ( topology , componentChanges , defaultInstanceResources , PackingUtils . ScalingDirection . DOWN ) ; Resource scaleUpResource = Pac... | 122 |
java-test-10558 | java | Why does the code create the consumer threads in a quantity equal to the number of available processors ? | since the producer ' s job is small enough that having more threads than processors will not be problematic ( they are also not active at the same time at least half the time ) . also populates this classes copy of the neurons in the network | private Concurrent Buffered Update ( final Network network ) { this . network = network ; current Available Processors = get Available Consumer Processors ( ) ; executors = Executors . new Fixed Thread Pool ( current Available Processors ) ; for ( Neuron n : network . get Flat Neuron List ( ) ) { neurons . add ( n ) ; ... | private ConcurrentBufferedUpdate ( final Network network ) { this . network = network ; currentAvailableProcessors = getAvailableConsumerProcessors ( ) ; executors = Executors . newFixedThreadPool ( currentAvailableProcessors ) ; for ( Neuron n : network . getFlatNeuronList ( ) ) { neurons . add ( n ) ; } for ( NeuronG... | 112 |
java-test-10559 | java | What does they populate also ? | this classes copy of the neurons in the network | private Concurrent Buffered Update ( final Network network ) { this . network = network ; current Available Processors = get Available Consumer Processors ( ) ; executors = Executors . new Fixed Thread Pool ( current Available Processors ) ; for ( Neuron n : network . get Flat Neuron List ( ) ) { neurons . add ( n ) ; ... | private ConcurrentBufferedUpdate ( final Network network ) { this . network = network ; currentAvailableProcessors = getAvailableConsumerProcessors ( ) ; executors = Executors . newFixedThreadPool ( currentAvailableProcessors ) ; for ( Neuron n : network . getFlatNeuronList ( ) ) { neurons . add ( n ) ; } for ( NeuronG... | 112 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.