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-6216 | java | What are inserted into the new array at the appropriate places ? | the contents of the old array | int [ ] update Layout Array ( int [ ] old Array , int offset , int n Inserted ) { int n = get View Count ( ) ; int [ ] new Array = new int [ n ] ; System . arraycopy ( old Array , NUM , new Array , NUM , offset ) ; System . arraycopy ( old Array , offset , new Array , offset + n Inserted , n - n Inserted - offset ) ; r... | int [ ] updateLayoutArray ( int [ ] oldArray , int offset , int nInserted ) { int n = getViewCount ( ) ; int [ ] newArray = new int [ n ] ; System . arraycopy ( oldArray , _NUM , newArray , _NUM , offset ) ; System . arraycopy ( oldArray , offset , newArray , offset + nInserted , n - nInserted - offset ) ; return newAr... | 89 |
java-test-6217 | java | What does the code resize to match the new number of child views ? | the given layout array | int [ ] update Layout Array ( int [ ] old Array , int offset , int n Inserted ) { int n = get View Count ( ) ; int [ ] new Array = new int [ n ] ; System . arraycopy ( old Array , NUM , new Array , NUM , offset ) ; System . arraycopy ( old Array , offset , new Array , offset + n Inserted , n - n Inserted - offset ) ; r... | int [ ] updateLayoutArray ( int [ ] oldArray , int offset , int nInserted ) { int n = getViewCount ( ) ; int [ ] newArray = new int [ n ] ; System . arraycopy ( oldArray , _NUM , newArray , _NUM , offset ) ; System . arraycopy ( oldArray , offset , newArray , offset + nInserted , n - nInserted - offset ) ; return newAr... | 89 |
java-test-6218 | java | For what purpose does the code resize the given layout array ? | to match the new number of child views | int [ ] update Layout Array ( int [ ] old Array , int offset , int n Inserted ) { int n = get View Count ( ) ; int [ ] new Array = new int [ n ] ; System . arraycopy ( old Array , NUM , new Array , NUM , offset ) ; System . arraycopy ( old Array , offset , new Array , offset + n Inserted , n - n Inserted - offset ) ; r... | int [ ] updateLayoutArray ( int [ ] oldArray , int offset , int nInserted ) { int n = getViewCount ( ) ; int [ ] newArray = new int [ n ] ; System . arraycopy ( oldArray , _NUM , newArray , _NUM , offset ) ; System . arraycopy ( oldArray , offset , newArray , offset + nInserted , n - nInserted - offset ) ; return newAr... | 89 |
java-test-6220 | java | What is pruning thread ? | the searcher | public void start Searcher Pruning Thread ( Count Down Latch shutdown Now ) { if ( searcher Pruning Thread == null ) { searcher Pruning Thread = new Searcher Pruning Thread ( shutdown Now ) ; searcher Pruning Thread . set Name ( STRING + name ) ; searcher Pruning Thread . start ( ) ; } } | public void startSearcherPruningThread ( CountDownLatch shutdownNow ) { if ( searcherPruningThread == null ) { searcherPruningThread = new SearcherPruningThread ( shutdownNow ) ; searcherPruningThread . setName ( STRING + name ) ; searcherPruningThread . start ( ) ; } } | 58 |
java-test-6221 | java | What does the code start ? | the searcher pruning thread | public void start Searcher Pruning Thread ( Count Down Latch shutdown Now ) { if ( searcher Pruning Thread == null ) { searcher Pruning Thread = new Searcher Pruning Thread ( shutdown Now ) ; searcher Pruning Thread . set Name ( STRING + name ) ; searcher Pruning Thread . start ( ) ; } } | public void startSearcherPruningThread ( CountDownLatch shutdownNow ) { if ( searcherPruningThread == null ) { searcherPruningThread = new SearcherPruningThread ( shutdownNow ) ; searcherPruningThread . setName ( STRING + name ) ; searcherPruningThread . start ( ) ; } } | 58 |
java-test-6223 | java | How does the graphicsenvironment return ? | according to the system property ' java . awt . graphicsenv ' | private static Graphics Environment create GE ( ) { Graphics Environment ge ; String nm = Access Controller . do Privileged ( new Get Property Action ( STRING , null ) ) ; try { Class < Graphics Environment > ge Cls ; try { ge Cls = ( Class < Graphics Environment > ) Class . for Name ( nm ) ; } catch ( Class Not Found ... | private static GraphicsEnvironment createGE ( ) { GraphicsEnvironment ge ; String nm = AccessController . doPrivileged ( new GetPropertyAction ( STRING , null ) ) ; try { Class < GraphicsEnvironment > geCls ; try { geCls = ( Class < GraphicsEnvironment > ) Class . forName ( nm ) ; } catch ( ClassNotFoundException ex ) ... | 198 |
java-test-6224 | java | Why can mrjobconfiguration be not used for the general case ? | because program blocks and related symbol tables can be hierarchically structured | public static Object [ ] parse Data Object ( String in ) throws DML Runtime Exception { Object [ ] ret = new Object [ NUM ] ; String Tokenizer st = new String Tokenizer ( in , DATA FIELD DELIM ) ; String name = st . next Token ( ) ; Data Type datatype = Data Type . value Of ( st . next Token ( ) ) ; Value Type valuetyp... | public static Object [ ] parseDataObject ( String in ) throws DMLRuntimeException { Object [ ] ret = new Object [ _NUM ] ; StringTokenizer st = new StringTokenizer ( in , DATA_FIELD_DELIM ) ; String name = st . nextToken ( ) ; DataType datatype = DataType . valueOf ( st . nextToken ( ) ) ; ValueType valuetype = ValueTy... | 560 |
java-test-6228 | java | What is searching in classpath ? | for rapidminer jars | public static synchronized void ensure Rapid Miner Home Set ( final Level log Level ) { LOGGER . set Level ( log Level ) ; if ( get Rapid Miner Home ( ) == null ) { log Info ( STRING + PROPERTY RAPIDMINER HOME + STRING ) ; if ( ! search In Class Path ( ) ) { try { log Info ( STRING + PROPERTY RAPIDMINER HOME + STRING )... | public static synchronized void ensureRapidMinerHomeSet ( final Level logLevel ) { LOGGER . setLevel ( logLevel ) ; if ( getRapidMinerHome ( ) == null ) { logInfo ( STRING + PROPERTY_RAPIDMINER_HOME + STRING ) ; if ( ! searchInClassPath ( ) ) { try { logInfo ( STRING + PROPERTY_RAPIDMINER_HOME + STRING ) ; searchInBuil... | 128 |
java-test-6229 | java | How is the environment variable ' rapidminer . home ' set ? | by searching for rapidminer jars in classpath | public static synchronized void ensure Rapid Miner Home Set ( final Level log Level ) { LOGGER . set Level ( log Level ) ; if ( get Rapid Miner Home ( ) == null ) { log Info ( STRING + PROPERTY RAPIDMINER HOME + STRING ) ; if ( ! search In Class Path ( ) ) { try { log Info ( STRING + PROPERTY RAPIDMINER HOME + STRING )... | public static synchronized void ensureRapidMinerHomeSet ( final Level logLevel ) { LOGGER . setLevel ( logLevel ) ; if ( getRapidMinerHome ( ) == null ) { logInfo ( STRING + PROPERTY_RAPIDMINER_HOME + STRING ) ; if ( ! searchInClassPath ( ) ) { try { logInfo ( STRING + PROPERTY_RAPIDMINER_HOME + STRING ) ; searchInBuil... | 128 |
java-test-6230 | java | What does the code move down one space ? | all the selected tiles | protected void move One Slot To Bottom ( Image Tile [ ] selected Tiles 2 ) { OM Graphic List list = get List ( ) ; if ( list != null && selected Tiles != null && selected Tiles . length > NUM ) { for ( int i = selected Tiles 2 . length - NUM ; i >= NUM ; i -- ) { Image Tile tile = selected Tiles 2 [ i ] ; list . move I... | protected void moveOneSlotToBottom ( ImageTile [ ] selectedTiles2 ) { OMGraphicList list = getList ( ) ; if ( list != null && selectedTiles != null && selectedTiles . length > _NUM ) { for ( int i = selectedTiles2 . length - _NUM ; i >= _NUM ; i -- ) { ImageTile tile = selectedTiles2 [ i ] ; list . moveIndexedOneToBott... | 104 |
java-test-6231 | java | In which direction does the code move all the selected tiles ? | down one space | protected void move One Slot To Bottom ( Image Tile [ ] selected Tiles 2 ) { OM Graphic List list = get List ( ) ; if ( list != null && selected Tiles != null && selected Tiles . length > NUM ) { for ( int i = selected Tiles 2 . length - NUM ; i >= NUM ; i -- ) { Image Tile tile = selected Tiles 2 [ i ] ; list . move I... | protected void moveOneSlotToBottom ( ImageTile [ ] selectedTiles2 ) { OMGraphicList list = getList ( ) ; if ( list != null && selectedTiles != null && selectedTiles . length > _NUM ) { for ( int i = selectedTiles2 . length - _NUM ; i >= _NUM ; i -- ) { ImageTile tile = selectedTiles2 [ i ] ; list . moveIndexedOneToBott... | 104 |
java-test-6232 | java | What do we update ? | the peak limits | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6233 | java | Why does we continue to update the peak limits if force allocation is passed if force allocation is passed ? | since we now know that this allocation will occur despite our moving past one or more limits | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6234 | java | What will we do stop ? | updating the peak allocation | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6235 | java | How is allocation done always ? | through the entire tree | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6236 | java | What do we manage consistently ? | reservation boundary issues | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6237 | java | What will we do continue ? | to do a complete and consistent allocation | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6238 | java | What do we do ? | a complete and consistent allocation | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6239 | java | What are whether the allocation should be forced and whether or not the peak memory allocation should be updated if at some point during allocation escalation we determine that the allocation is no longer possible ? | the two options that we influence | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6240 | java | What do we know ? | that we will be directly unwinding this allocation ( and thus never actually making the allocation ) | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6241 | java | What will we be unwinding and thus never actually making the allocation ) directly ? | this allocation | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6242 | java | What does we continue if force allocation is passed if force allocation is passed since we now know that this allocation will occur despite our moving past one or more limits ? | to update the peak limits | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6243 | java | Why do we do this ? | because we know that we will be directly unwinding this allocation ( and thus never actually making the allocation ) . if force allocation is passed , then we continue to update the peak limits since we now know that this allocation will occur despite our moving past one or more limits | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6244 | java | What do we never make actually ? | the allocation | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6245 | java | When do we determine that the allocation is no longer possible ? | at some point during allocation escalation | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6246 | java | For what purpose are this takes a forced approach to allocation ? | to ensure that we manage reservation boundary issues consistently . allocation is always done through the entire tree | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6247 | java | What do we know now ? | that this allocation will occur despite our moving past one or more limits | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6248 | java | What do we determine at some point during allocation escalation ? | that the allocation is no longer possible | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6249 | java | What are this takes to ensure that we manage reservation boundary issues consistently . allocation is always done through the entire tree ? | a forced approach to allocation | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6250 | java | What does the two options that we influence be if at some point during allocation escalation we determine that the allocation is no longer possible ? | whether the allocation should be forced and whether or not the peak memory allocation should be updated | private Allocation Outcome allocate ( final long size , final boolean incoming Update Peak , final boolean force Allocation ) { final long new Local = locally Held Memory . add And Get ( size ) ; final long beyond Reservation = new Local - reservation ; final boolean beyond Limit = new Local > allocation Limit . get ( ... | private AllocationOutcome allocate ( final long size , final boolean incomingUpdatePeak , final boolean forceAllocation ) { final long newLocal = locallyHeldMemory . addAndGet ( size ) ; final long beyondReservation = newLocal - reservation ; final boolean beyondLimit = newLocal > allocationLimit . get ( ) ; final bool... | 183 |
java-test-6252 | java | How does the code add a load of given field ? | at given instruction | public void add Load ( Instruction Handle handle , X Field field ) { get Load Store Count ( field ) . load Count ++ ; handle To Field Map . put ( handle , field ) ; load Handle Set . set ( handle . get Position ( ) ) ; } | public void addLoad ( InstructionHandle handle , XField field ) { getLoadStoreCount ( field ) . loadCount ++ ; handleToFieldMap . put ( handle , field ) ; loadHandleSet . set ( handle . getPosition ( ) ) ; } | 53 |
java-test-6253 | java | What does the code add at given instruction ? | a load of given field | public void add Load ( Instruction Handle handle , X Field field ) { get Load Store Count ( field ) . load Count ++ ; handle To Field Map . put ( handle , field ) ; load Handle Set . set ( handle . get Position ( ) ) ; } | public void addLoad ( InstructionHandle handle , XField field ) { getLoadStoreCount ( field ) . loadCount ++ ; handleToFieldMap . put ( handle , field ) ; loadHandleSet . set ( handle . getPosition ( ) ) ; } | 53 |
java-test-6255 | java | In which direction did label read files of different source ? | from category | public int [ ] read Labels ( ) throws Exception { int labels [ ] = new int [ data Num ] ; Buffered Reader tr Users = new Buffered Reader ( new Input Stream Reader ( new File Input Stream ( label File ) ) ) ; String line = STRING ; while ( ( line = tr Users . read Line ( ) ) != null ) { String [ ] strs = line . split ( ... | public int [ ] readLabels ( ) throws Exception { int labels [ ] = new int [ dataNum ] ; BufferedReader trUsers = new BufferedReader ( new InputStreamReader ( new FileInputStream ( labelFile ) ) ) ; String line = STRING ; while ( ( line = trUsers . readLine ( ) ) != null ) { String [ ] strs = line . split ( STRING ) ; l... | 119 |
java-test-6264 | java | What does the code extract ? | the signature i d from the usekey element | private String extract Signature Id ( Use Key Type use Key , Security Header Type header ) { assert header != null ; String signature Id = null ; if ( use Key != null ) { signature Id = use Key . get Sig ( ) ; if ( header . get Signature ( ) == null || ! signature Id . equals Ignore Case ( header . get Signature ( ) . ... | private String extractSignatureId ( UseKeyType useKey , SecurityHeaderType header ) { assert header != null ; String signatureId = null ; if ( useKey != null ) { signatureId = useKey . getSig ( ) ; if ( header . getSignature ( ) == null || ! signatureId . equalsIgnoreCase ( header . getSignature ( ) . getId ( ) ) ) { t... | 98 |
java-test-6265 | java | What does the code verify ? | that the signature i d is valid | private String extract Signature Id ( Use Key Type use Key , Security Header Type header ) { assert header != null ; String signature Id = null ; if ( use Key != null ) { signature Id = use Key . get Sig ( ) ; if ( header . get Signature ( ) == null || ! signature Id . equals Ignore Case ( header . get Signature ( ) . ... | private String extractSignatureId ( UseKeyType useKey , SecurityHeaderType header ) { assert header != null ; String signatureId = null ; if ( useKey != null ) { signatureId = useKey . getSig ( ) ; if ( header . getSignature ( ) == null || ! signatureId . equalsIgnoreCase ( header . getSignature ( ) . getId ( ) ) ) { t... | 98 |
java-test-6266 | java | What does the code check ? | whether a settings ' s value is currently set to the default value | public boolean is Default ( String scope , String key ) { synchronized ( m Lock ) { String default Value = get String Default ( key ) ; String value = get String ( scope , key ) ; return value == null ? BOOL : value . equals ( default Value ) ; } } | public boolean isDefault ( String scope , String key ) { synchronized ( mLock ) { String defaultValue = getStringDefault ( key ) ; String value = getString ( scope , key ) ; return value == null ? _BOOL : value . equals ( defaultValue ) ; } } | 57 |
java-test-6267 | java | What does a routine know ? | how and when to quote and escape the given value | private static String quote ( String value ) { boolean needs Quotes = BOOL ; int length = value . length ( ) ; for ( int i = NUM ; ( i < length ) && ! needs Quotes ; ++ i ) { needs Quotes = ! is Token Char ( value . char At ( i ) ) ; } if ( needs Quotes ) { String Builder buffer = new String Builder ( ( int ) ( length ... | private static String quote ( String value ) { boolean needsQuotes = _BOOL ; int length = value . length ( ) ; for ( int i = _NUM ; ( i < length ) && ! needsQuotes ; ++ i ) { needsQuotes = ! isTokenChar ( value . charAt ( i ) ) ; } if ( needsQuotes ) { StringBuilder buffer = new StringBuilder ( ( int ) ( length * _NUM ... | 174 |
java-test-6268 | java | What knows how and when to quote and escape the given value ? | a routine | private static String quote ( String value ) { boolean needs Quotes = BOOL ; int length = value . length ( ) ; for ( int i = NUM ; ( i < length ) && ! needs Quotes ; ++ i ) { needs Quotes = ! is Token Char ( value . char At ( i ) ) ; } if ( needs Quotes ) { String Builder buffer = new String Builder ( ( int ) ( length ... | private static String quote ( String value ) { boolean needsQuotes = _BOOL ; int length = value . length ( ) ; for ( int i = _NUM ; ( i < length ) && ! needsQuotes ; ++ i ) { needsQuotes = ! isTokenChar ( value . charAt ( i ) ) ; } if ( needsQuotes ) { StringBuilder buffer = new StringBuilder ( ( int ) ( length * _NUM ... | 174 |
java-test-6269 | java | What does the specified sdp data contain ? | definitions for a video stream | public static boolean sdp Has Video ( JSON Object sdp ) { boolean has Video = BOOL ; if ( null != sdp ) { try { String sdp String = sdp . get String ( STRING ) ; has Video = sdp String . contains ( STRING ) ; } catch ( JSON Exception e ) { Log . d ( TAG , STRING ) ; } } return has Video ; } | public static boolean sdpHasVideo ( JSONObject sdp ) { boolean hasVideo = _BOOL ; if ( null != sdp ) { try { String sdpString = sdp . getString ( STRING ) ; hasVideo = sdpString . contains ( STRING ) ; } catch ( JSONException e ) { Log . d ( TAG , STRING ) ; } } return hasVideo ; } | 74 |
java-test-6270 | java | What contains definitions for a video stream ? | the specified sdp data | public static boolean sdp Has Video ( JSON Object sdp ) { boolean has Video = BOOL ; if ( null != sdp ) { try { String sdp String = sdp . get String ( STRING ) ; has Video = sdp String . contains ( STRING ) ; } catch ( JSON Exception e ) { Log . d ( TAG , STRING ) ; } } return has Video ; } | public static boolean sdpHasVideo ( JSONObject sdp ) { boolean hasVideo = _BOOL ; if ( null != sdp ) { try { String sdpString = sdp . getString ( STRING ) ; hasVideo = sdpString . contains ( STRING ) ; } catch ( JSONException e ) { Log . d ( TAG , STRING ) ; } } return hasVideo ; } | 74 |
java-test-6271 | java | What does the code get ? | the specs for all currently woven advice | public synchronized Collection < Weave Spec > woven ( ) { Collection < Weave Spec > specs = Lists . new Array List ( ) ; for ( Weave w : woven . values ( ) ) { specs . add ( w . spec ) ; } return specs ; } | public synchronized Collection < WeaveSpec > woven ( ) { Collection < WeaveSpec > specs = Lists . newArrayList ( ) ; for ( Weave w : woven . values ( ) ) { specs . add ( w . spec ) ; } return specs ; } | 52 |
java-test-6272 | java | What is force delete used ? | to remove struct / trait in case of entity updates | public boolean delete Edge Reference ( Atlas Edge edge , Data Types . Type Category type Category , boolean is Composite , boolean force Delete Struct Trait ) throws Atlas Exception { LOG . debug ( STRING , string ( edge ) ) ; boolean force Delete = ( type Category == Data Types . Type Category . STRUCT || type Categor... | public boolean deleteEdgeReference ( AtlasEdge edge , DataTypes . TypeCategory typeCategory , boolean isComposite , boolean forceDeleteStructTrait ) throws AtlasException { LOG . debug ( STRING , string ( edge ) ) ; boolean forceDelete = ( typeCategory == DataTypes . TypeCategory . STRUCT || typeCategory == DataTypes .... | 183 |
java-test-6273 | java | What is used to remove struct / trait in case of entity updates ? | force delete | public boolean delete Edge Reference ( Atlas Edge edge , Data Types . Type Category type Category , boolean is Composite , boolean force Delete Struct Trait ) throws Atlas Exception { LOG . debug ( STRING , string ( edge ) ) ; boolean force Delete = ( type Category == Data Types . Type Category . STRUCT || type Categor... | public boolean deleteEdgeReference ( AtlasEdge edge , DataTypes . TypeCategory typeCategory , boolean isComposite , boolean forceDeleteStructTrait ) throws AtlasException { LOG . debug ( STRING , string ( edge ) ) ; boolean forceDelete = ( typeCategory == DataTypes . TypeCategory . STRUCT || typeCategory == DataTypes .... | 183 |
java-test-6274 | java | What is the flag character means for f format ? | that the output should be left justified within the field . the default is to pad with blanks on the left . ' + ' character means that the conversion will always begin with a sign ( + or - ) . the blank flag character means that a non - negative input will be preceded with a blank . if both a ' + ' and a ' ' are specif... | private char [ ] f Format Digits ( double x ) { String sx , sx Out ; int i , j , k ; int n1 In , n2 In ; int expon = NUM ; boolean minus Sign = BOOL ; if ( x > NUM ) sx = Double . to String ( x ) ; else if ( x < NUM ) { sx = Double . to String ( - x ) ; minus Sign = BOOL ; } else { sx = Double . to String ( x ) ; if ( ... | private char [ ] fFormatDigits ( double x ) { String sx , sxOut ; int i , j , k ; int n1In , n2In ; int expon = _NUM ; boolean minusSign = _BOOL ; if ( x > _NUM ) sx = Double . toString ( x ) ; else if ( x < _NUM ) { sx = Double . toString ( - x ) ; minusSign = _BOOL ; } else { sx = Double . toString ( x ) ; if ( sx . ... | 1,682 |
java-test-6275 | java | How does the code expand the current speech data ? | by appending the data in the input stream | public void write ( Input Stream stream ) { if ( is Final ) { log . warning ( STRING ) ; return ; } try { int n Read ; byte [ ] buffer = new byte [ NUM * NUM ] ; while ( ( n Read = stream . read ( buffer , NUM , buffer . length ) ) != - NUM ) { byte [ ] new Data = new byte [ data . length + n Read ] ; System . arraycop... | public void write ( InputStream stream ) { if ( isFinal ) { log . warning ( STRING ) ; return ; } try { int nRead ; byte [ ] buffer = new byte [ _NUM * _NUM ] ; while ( ( nRead = stream . read ( buffer , _NUM , buffer . length ) ) != - _NUM ) { byte [ ] newData = new byte [ data . length + nRead ] ; System . arraycopy ... | 145 |
java-test-6276 | java | What does the code append ? | the data in the input stream | public void write ( Input Stream stream ) { if ( is Final ) { log . warning ( STRING ) ; return ; } try { int n Read ; byte [ ] buffer = new byte [ NUM * NUM ] ; while ( ( n Read = stream . read ( buffer , NUM , buffer . length ) ) != - NUM ) { byte [ ] new Data = new byte [ data . length + n Read ] ; System . arraycop... | public void write ( InputStream stream ) { if ( isFinal ) { log . warning ( STRING ) ; return ; } try { int nRead ; byte [ ] buffer = new byte [ _NUM * _NUM ] ; while ( ( nRead = stream . read ( buffer , _NUM , buffer . length ) ) != - _NUM ) { byte [ ] newData = new byte [ data . length + nRead ] ; System . arraycopy ... | 145 |
java-test-6280 | java | What does the code select if any ? | the video track | private static int select Track ( Media Extractor extractor ) { int num Tracks = extractor . get Track Count ( ) ; for ( int i = NUM ; i < num Tracks ; i ++ ) { Media Format format = extractor . get Track Format ( i ) ; String mime = format . get String ( Media Format . KEY MIME ) ; if ( mime . starts With ( STRING ) )... | private static int selectTrack ( MediaExtractor extractor ) { int numTracks = extractor . getTrackCount ( ) ; for ( int i = _NUM ; i < numTracks ; i ++ ) { MediaFormat format = extractor . getTrackFormat ( i ) ; String mime = format . getString ( MediaFormat . KEY_MIME ) ; if ( mime . startsWith ( STRING ) ) { if ( VER... | 113 |
java-test-6281 | java | What does the code find ? | the first occurrence of ' ' , ' - ' , ' , ' or ' | private static int find Separator ( String s ) { int result = s . index Of ( STRING ) ; if ( result == - NUM ) { result = s . index Of ( STRING ) ; } if ( result == - NUM ) { result = s . index Of ( STRING ) ; } if ( result == - NUM ) { result = s . index Of ( STRING ) ; } return result ; } | private static int findSeparator ( String s ) { int result = s . indexOf ( STRING ) ; if ( result == - _NUM ) { result = s . indexOf ( STRING ) ; } if ( result == - _NUM ) { result = s . indexOf ( STRING ) ; } if ( result == - _NUM ) { result = s . indexOf ( STRING ) ; } return result ; } | 82 |
java-test-6282 | java | What has caused the pool to become quiescent ? | inactivating w | private boolean await Work ( Work Queue w , int r ) { if ( w == null || w . qlock < NUM ) return BOOL ; for ( int pred = w . stack Pred , spins = SPINS , ss ; ; ) { if ( ( ss = w . scan State ) >= NUM ) break ; else if ( spins > NUM ) { r ^= r << NUM ; r ^= r > > > NUM ; r ^= r << NUM ; if ( r >= NUM && -- spins == NUM... | private boolean awaitWork ( WorkQueue w , int r ) { if ( w == null || w . qlock < _NUM ) return _BOOL ; for ( int pred = w . stackPred , spins = SPINS , ss ; ; ) { if ( ( ss = w . scanState ) >= _NUM ) break ; else if ( spins > _NUM ) { r ^= r << _NUM ; r ^= r > > > _NUM ; r ^= r << _NUM ; if ( r >= _NUM && -- spins ==... | 520 |
java-test-6284 | java | What does the code see ? | the general contract of the readint method of datainput | public final int read Int ( ) throws java . io . IO Exception { read Fully ( scratch , NUM , NUM ) ; return ( ( ( scratch [ NUM ] & NUM ) << NUM ) | ( ( scratch [ NUM ] & NUM ) << NUM ) | ( ( scratch [ NUM ] & NUM ) << NUM ) | ( ( scratch [ NUM ] & NUM ) << NUM ) ) ; } | public final int readInt ( ) throws java . io . IOException { readFully ( scratch , _NUM , _NUM ) ; return ( ( ( scratch [ _NUM ] & _NUM ) << _NUM ) | ( ( scratch [ _NUM ] & _NUM ) << _NUM ) | ( ( scratch [ _NUM ] & _NUM ) << _NUM ) | ( ( scratch [ _NUM ] & _NUM ) << _NUM ) ) ; } | 81 |
java-test-6285 | java | What is this method have used if no factoryfinderinstance can be found for key , and this call to getapplicationfactoryfinderinstance ( ) * does * have a currentkeyrent facescontext but a previous call to getapplicationfactoryfinderinstance * did not * have a currentkeyrent facescontext ? | to detect the following special initialization case | private boolean detect Special Initialization Case ( Faces Context faces Context ) { boolean result = BOOL ; if ( null == faces Context ) { log Null Faces Context . compare And Set ( BOOL , BOOL ) ; } else { log Non Null Faces Context . compare And Set ( BOOL , BOOL ) ; } result = log Null Faces Context . get ( ) && lo... | private boolean detectSpecialInitializationCase ( FacesContext facesContext ) { boolean result = _BOOL ; if ( null == facesContext ) { logNullFacesContext . compareAndSet ( _BOOL , _BOOL ) ; } else { logNonNullFacesContext . compareAndSet ( _BOOL , _BOOL ) ; } result = logNullFacesContext . get ( ) && logNonNullFacesCo... | 84 |
java-test-6286 | java | What does have have a currentkeyrent facescontext ? | this call to getapplicationfactoryfinderinstance ( ) | private boolean detect Special Initialization Case ( Faces Context faces Context ) { boolean result = BOOL ; if ( null == faces Context ) { log Null Faces Context . compare And Set ( BOOL , BOOL ) ; } else { log Non Null Faces Context . compare And Set ( BOOL , BOOL ) ; } result = log Null Faces Context . get ( ) && lo... | private boolean detectSpecialInitializationCase ( FacesContext facesContext ) { boolean result = _BOOL ; if ( null == facesContext ) { logNullFacesContext . compareAndSet ( _BOOL , _BOOL ) ; } else { logNonNullFacesContext . compareAndSet ( _BOOL , _BOOL ) ; } result = logNullFacesContext . get ( ) && logNonNullFacesCo... | 84 |
java-test-6287 | java | What did not have a currentkeyrent facescontext ? | a previous call to getapplicationfactoryfinderinstance | private boolean detect Special Initialization Case ( Faces Context faces Context ) { boolean result = BOOL ; if ( null == faces Context ) { log Null Faces Context . compare And Set ( BOOL , BOOL ) ; } else { log Non Null Faces Context . compare And Set ( BOOL , BOOL ) ; } result = log Null Faces Context . get ( ) && lo... | private boolean detectSpecialInitializationCase ( FacesContext facesContext ) { boolean result = _BOOL ; if ( null == facesContext ) { logNullFacesContext . compareAndSet ( _BOOL , _BOOL ) ; } else { logNonNullFacesContext . compareAndSet ( _BOOL , _BOOL ) ; } result = logNullFacesContext . get ( ) && logNonNullFacesCo... | 84 |
java-test-6291 | java | How does the persistence layer query ? | using the given tokenfilter which must have the required ' return attributes ' defined within it | public void delete On Query ( final Token Filter filter ) throws Core Token Exception , Illegal Argument Exception { filter . add Return Attribute ( Core Token Field . TOKEN ID ) ; Result Handler < Collection < Partial Token > , Core Token Exception > handler = handler Factory . get Delete On Query Handler ( ) ; try { ... | public void deleteOnQuery ( final TokenFilter filter ) throws CoreTokenException , IllegalArgumentException { filter . addReturnAttribute ( CoreTokenField . TOKEN_ID ) ; ResultHandler < Collection < PartialToken > , CoreTokenException > handler = handlerFactory . getDeleteOnQueryHandler ( ) ; try { attributeQueryWithHa... | 94 |
java-test-6292 | java | What must the given tokenfilter have ? | the required ' return attributes ' defined within it | public void delete On Query ( final Token Filter filter ) throws Core Token Exception , Illegal Argument Exception { filter . add Return Attribute ( Core Token Field . TOKEN ID ) ; Result Handler < Collection < Partial Token > , Core Token Exception > handler = handler Factory . get Delete On Query Handler ( ) ; try { ... | public void deleteOnQuery ( final TokenFilter filter ) throws CoreTokenException , IllegalArgumentException { filter . addReturnAttribute ( CoreTokenField . TOKEN_ID ) ; ResultHandler < Collection < PartialToken > , CoreTokenException > handler = handlerFactory . getDeleteOnQueryHandler ( ) ; try { attributeQueryWithHa... | 94 |
java-test-6293 | java | Where did the required ' return attributes ' define ? | within it | public void delete On Query ( final Token Filter filter ) throws Core Token Exception , Illegal Argument Exception { filter . add Return Attribute ( Core Token Field . TOKEN ID ) ; Result Handler < Collection < Partial Token > , Core Token Exception > handler = handler Factory . get Delete On Query Handler ( ) ; try { ... | public void deleteOnQuery ( final TokenFilter filter ) throws CoreTokenException , IllegalArgumentException { filter . addReturnAttribute ( CoreTokenField . TOKEN_ID ) ; ResultHandler < Collection < PartialToken > , CoreTokenException > handler = handlerFactory . getDeleteOnQueryHandler ( ) ; try { attributeQueryWithHa... | 94 |
java-test-6294 | java | What defined within it ? | the required ' return attributes ' | public void delete On Query ( final Token Filter filter ) throws Core Token Exception , Illegal Argument Exception { filter . add Return Attribute ( Core Token Field . TOKEN ID ) ; Result Handler < Collection < Partial Token > , Core Token Exception > handler = handler Factory . get Delete On Query Handler ( ) ; try { ... | public void deleteOnQuery ( final TokenFilter filter ) throws CoreTokenException , IllegalArgumentException { filter . addReturnAttribute ( CoreTokenField . TOKEN_ID ) ; ResultHandler < Collection < PartialToken > , CoreTokenException > handler = handlerFactory . getDeleteOnQueryHandler ( ) ; try { attributeQueryWithHa... | 94 |
java-test-6296 | java | What represent hour respectively , minute and second ? | " ss " | public static Date string To Date ( String str Date ) throws Parse Exception { int [ ] diff Time = null ; boolean plus Time = BOOL ; int idx T = str Date . index Of ( STRING ) ; if ( idx T == - NUM ) { throw new Parse Exception ( STRING , NUM ) ; } int idx Diff UTC = str Date . index Of ( STRING , idx T ) ; if ( idx Di... | public static Date stringToDate ( String strDate ) throws ParseException { int [ ] diffTime = null ; boolean plusTime = _BOOL ; int idxT = strDate . indexOf ( STRING ) ; if ( idxT == - _NUM ) { throw new ParseException ( STRING , _NUM ) ; } int idxDiffUTC = strDate . indexOf ( STRING , idxT ) ; if ( idxDiffUTC == - _NU... | 225 |
java-test-6298 | java | What does a new entry construct ? | from the specified symbol and next entry reference | public Entry ( String symbol , Entry next ) { this . symbol = symbol . intern ( ) ; characters = new char [ symbol . length ( ) ] ; symbol . get Chars ( NUM , characters . length , characters , NUM ) ; this . next = next ; } | public Entry ( String symbol , Entry next ) { this . symbol = symbol . intern ( ) ; characters = new char [ symbol . length ( ) ] ; symbol . getChars ( _NUM , characters . length , characters , _NUM ) ; this . next = next ; } | 55 |
java-test-6301 | java | What will train skip ? | the routelocation | public void add Train Skips Location ( String location Id ) { if ( skip Locations List . contains ( location Id ) ) { return ; } skip Locations List . add ( NUM , location Id ) ; log . debug ( STRING + location Id ) ; set Dirty And Fire Property Change ( STOPS CHANGED PROPERTY , skip Locations List . size ( ) - NUM , s... | public void addTrainSkipsLocation ( String locationId ) { if ( _skipLocationsList . contains ( locationId ) ) { return ; } _skipLocationsList . add ( _NUM , locationId ) ; log . debug ( STRING + locationId ) ; setDirtyAndFirePropertyChange ( STOPS_CHANGED_PROPERTY , _skipLocationsList . size ( ) - _NUM , _skipLocations... | 81 |
java-test-6303 | java | How does the code perform the conversion ? | without checked exceptions | public static URL to URL ( URI uri ) { if ( uri == null ) throw new Null Pointer Exception ( STRING ) ; try { return uri . to URL ( ) ; } catch ( Malformed URL Exception e ) { throw new Illegal Argument Exception ( uri + STRING , e ) ; } } | public static URL toURL ( URI uri ) { if ( uri == null ) throw new NullPointerException ( STRING ) ; try { return uri . toURL ( ) ; } catch ( MalformedURLException e ) { throw new IllegalArgumentException ( uri + STRING , e ) ; } } | 59 |
java-test-6304 | java | What does the code perform without checked exceptions ? | the conversion | public static URL to URL ( URI uri ) { if ( uri == null ) throw new Null Pointer Exception ( STRING ) ; try { return uri . to URL ( ) ; } catch ( Malformed URL Exception e ) { throw new Illegal Argument Exception ( uri + STRING , e ) ; } } | public static URL toURL ( URI uri ) { if ( uri == null ) throw new NullPointerException ( STRING ) ; try { return uri . toURL ( ) ; } catch ( MalformedURLException e ) { throw new IllegalArgumentException ( uri + STRING , e ) ; } } | 59 |
java-test-6305 | java | When did none receive ? | within timeout | public Event do Wait Timeout ( long timeout ) { Event e = null ; long towait = NUM ; long endtime = - NUM ; boolean usetimeout = ( timeout > NUM ) ; if ( usetimeout ) { endtime = System . nano Time ( ) + timeout * NUM * NUM ; } if ( network Thread . get Done ( ) ) return null ; while ( e == null ) { if ( usetimeout ) {... | public Event doWaitTimeout ( long timeout ) { Event e = null ; long towait = _NUM ; long endtime = - _NUM ; boolean usetimeout = ( timeout > _NUM ) ; if ( usetimeout ) { endtime = System . nanoTime ( ) + timeout * _NUM * _NUM ; } if ( networkThread . getDone ( ) ) return null ; while ( e == null ) { if ( usetimeout ) {... | 206 |
java-test-6306 | java | What locates for given sub - type of type that this deserializer handles ? | deserializer | protected Json Deserializer < Object > find Subclass Deserializer ( Deserialization Context ctxt , Object bean , Token Buffer unknown Tokens ) throws IO Exception , Json Processing Exception { Json Deserializer < Object > sub Deser ; synchronized ( this ) { sub Deser = ( sub Deserializers == null ) ? null : sub Deseria... | protected JsonDeserializer < Object > _findSubclassDeserializer ( DeserializationContext ctxt , Object bean , TokenBuffer unknownTokens ) throws IOException , JsonProcessingException { JsonDeserializer < Object > subDeser ; synchronized ( this ) { subDeser = ( _subDeserializers == null ) ? null : _subDeserializers . ge... | 218 |
java-test-6307 | java | What do deserializer locate ? | for given sub - type of type that this deserializer handles | protected Json Deserializer < Object > find Subclass Deserializer ( Deserialization Context ctxt , Object bean , Token Buffer unknown Tokens ) throws IO Exception , Json Processing Exception { Json Deserializer < Object > sub Deser ; synchronized ( this ) { sub Deser = ( sub Deserializers == null ) ? null : sub Deseria... | protected JsonDeserializer < Object > _findSubclassDeserializer ( DeserializationContext ctxt , Object bean , TokenBuffer unknownTokens ) throws IOException , JsonProcessingException { JsonDeserializer < Object > subDeser ; synchronized ( this ) { subDeser = ( _subDeserializers == null ) ? null : _subDeserializers . ge... | 218 |
java-test-6308 | java | For what purpose did helper method call ? | to ( try to ) locate deserializer for given sub - type of type that this deserializer handles | protected Json Deserializer < Object > find Subclass Deserializer ( Deserialization Context ctxt , Object bean , Token Buffer unknown Tokens ) throws IO Exception , Json Processing Exception { Json Deserializer < Object > sub Deser ; synchronized ( this ) { sub Deser = ( sub Deserializers == null ) ? null : sub Deseria... | protected JsonDeserializer < Object > _findSubclassDeserializer ( DeserializationContext ctxt , Object bean , TokenBuffer unknownTokens ) throws IOException , JsonProcessingException { JsonDeserializer < Object > subDeser ; synchronized ( this ) { subDeser = ( _subDeserializers == null ) ? null : _subDeserializers . ge... | 218 |
java-test-6309 | java | How does the code delete all rows ? | with the keys matching the subset of all keys | public void delete Value Subkeyed ( Connection connection , Object keys [ ] ) { String Builder builder = new String Builder ( ) ; builder . append ( STRING ) ; builder . append ( table Name ) ; builder . append ( STRING ) ; String delimiter = STRING ; for ( int i = NUM ; i < keys . length ; i ++ ) { builder . append ( ... | public void deleteValueSubkeyed ( Connection connection , Object keys [ ] ) { StringBuilder builder = new StringBuilder ( ) ; builder . append ( STRING ) ; builder . append ( tableName ) ; builder . append ( STRING ) ; String delimiter = STRING ; for ( int i = _NUM ; i < keys . length ; i ++ ) { builder . append ( deli... | 334 |
java-test-6310 | java | What does this reconstruct ? | the ancestral nodestates at each node | private void reconstruct States ( Tree tree , Node Ref node , int [ ] parent States ) { for ( int i = NUM ; i < patterns . get Pattern Count ( ) ; i ++ ) { double [ ] Sa = node Scores [ node . get Number ( ) ] [ i ] ; if ( compress States ) { int [ ] set = state Sets [ i ] ; int min State = set [ NUM ] ; double min Cos... | private void reconstructStates ( Tree tree , NodeRef node , int [ ] parentStates ) { for ( int i = _NUM ; i < patterns . getPatternCount ( ) ; i ++ ) { double [ ] Sa = nodeScores [ node . getNumber ( ) ] [ i ] ; if ( compressStates ) { int [ ] set = stateSets [ i ] ; int minState = set [ _NUM ] ; double minCost = Sa [ ... | 354 |
java-test-6311 | java | What does the code ensure ? | that the annotation arguments comply to their declarations | @ Override public Void visit Annotation ( Annotation Tree node , Void p ) { List < ? extends Expression Tree > args = node . get Arguments ( ) ; if ( args . is Empty ( ) ) { return null ; } Element anno = Tree Info . symbol ( ( JC Tree ) node . get Annotation Type ( ) ) ; if ( anno . to String ( ) . equals ( Default Qu... | @ Override public Void visitAnnotation ( AnnotationTree node , Void p ) { List < ? extends ExpressionTree > args = node . getArguments ( ) ; if ( args . isEmpty ( ) ) { return null ; } Element anno = TreeInfo . symbol ( ( JCTree ) node . getAnnotationType ( ) ) ; if ( anno . toString ( ) . equals ( DefaultQualifier . c... | 679 |
java-test-6312 | java | What form special trees ? | annotation arguments | @ Override public Void visit Annotation ( Annotation Tree node , Void p ) { List < ? extends Expression Tree > args = node . get Arguments ( ) ; if ( args . is Empty ( ) ) { return null ; } Element anno = Tree Info . symbol ( ( JC Tree ) node . get Annotation Type ( ) ) ; if ( anno . to String ( ) . equals ( Default Qu... | @ Override public Void visitAnnotation ( AnnotationTree node , Void p ) { List < ? extends ExpressionTree > args = node . getArguments ( ) ; if ( args . isEmpty ( ) ) { return null ; } Element anno = TreeInfo . symbol ( ( JCTree ) node . getAnnotationType ( ) ) ; if ( anno . toString ( ) . equals ( DefaultQualifier . c... | 679 |
java-test-6313 | java | Why do this need some special casing ? | as annotation arguments form special trees | @ Override public Void visit Annotation ( Annotation Tree node , Void p ) { List < ? extends Expression Tree > args = node . get Arguments ( ) ; if ( args . is Empty ( ) ) { return null ; } Element anno = Tree Info . symbol ( ( JC Tree ) node . get Annotation Type ( ) ) ; if ( anno . to String ( ) . equals ( Default Qu... | @ Override public Void visitAnnotation ( AnnotationTree node , Void p ) { List < ? extends ExpressionTree > args = node . getArguments ( ) ; if ( args . isEmpty ( ) ) { return null ; } Element anno = TreeInfo . symbol ( ( JCTree ) node . getAnnotationType ( ) ) ; if ( anno . toString ( ) . equals ( DefaultQualifier . c... | 679 |
java-test-6314 | java | What do this need as annotation arguments form special trees ? | some special casing | @ Override public Void visit Annotation ( Annotation Tree node , Void p ) { List < ? extends Expression Tree > args = node . get Arguments ( ) ; if ( args . is Empty ( ) ) { return null ; } Element anno = Tree Info . symbol ( ( JC Tree ) node . get Annotation Type ( ) ) ; if ( anno . to String ( ) . equals ( Default Qu... | @ Override public Void visitAnnotation ( AnnotationTree node , Void p ) { List < ? extends ExpressionTree > args = node . getArguments ( ) ; if ( args . isEmpty ( ) ) { return null ; } Element anno = TreeInfo . symbol ( ( JCTree ) node . getAnnotationType ( ) ) ; if ( anno . toString ( ) . equals ( DefaultQualifier . c... | 679 |
java-test-6315 | java | What does annotation arguments form ? | special trees | @ Override public Void visit Annotation ( Annotation Tree node , Void p ) { List < ? extends Expression Tree > args = node . get Arguments ( ) ; if ( args . is Empty ( ) ) { return null ; } Element anno = Tree Info . symbol ( ( JC Tree ) node . get Annotation Type ( ) ) ; if ( anno . to String ( ) . equals ( Default Qu... | @ Override public Void visitAnnotation ( AnnotationTree node , Void p ) { List < ? extends ExpressionTree > args = node . getArguments ( ) ; if ( args . isEmpty ( ) ) { return null ; } Element anno = TreeInfo . symbol ( ( JCTree ) node . getAnnotationType ( ) ) ; if ( anno . toString ( ) . equals ( DefaultQualifier . c... | 679 |
java-test-6316 | java | What is used to compute the checksum ? | only the specified region of the buffer | public void test checksum 02 ( ) { byte [ ] data = new byte [ NUM ] ; r . next Bytes ( data ) ; Adler 32 adler 32 = new Adler 32 ( ) ; adler 32 . update ( data , NUM , NUM ) ; final int expected Checksum = ( int ) adler 32 . get Value ( ) ; assert Equals ( expected Checksum , chk . checksum ( Byte Buffer . wrap ( data ... | public void test_checksum02 ( ) { byte [ ] data = new byte [ _NUM ] ; r . nextBytes ( data ) ; Adler32 adler32 = new Adler32 ( ) ; adler32 . update ( data , _NUM , _NUM ) ; final int expectedChecksum = ( int ) adler32 . getValue ( ) ; assertEquals ( expectedChecksum , chk . checksum ( ByteBuffer . wrap ( data ) , _NUM ... | 93 |
java-test-6317 | java | What is only the specified region of the buffer used ? | to compute the checksum | public void test checksum 02 ( ) { byte [ ] data = new byte [ NUM ] ; r . next Bytes ( data ) ; Adler 32 adler 32 = new Adler 32 ( ) ; adler 32 . update ( data , NUM , NUM ) ; final int expected Checksum = ( int ) adler 32 . get Value ( ) ; assert Equals ( expected Checksum , chk . checksum ( Byte Buffer . wrap ( data ... | public void test_checksum02 ( ) { byte [ ] data = new byte [ _NUM ] ; r . nextBytes ( data ) ; Adler32 adler32 = new Adler32 ( ) ; adler32 . update ( data , _NUM , _NUM ) ; final int expectedChecksum = ( int ) adler32 . getValue ( ) ; assertEquals ( expectedChecksum , chk . checksum ( ByteBuffer . wrap ( data ) , _NUM ... | 93 |
java-test-6322 | java | How does the code parse the length of the episode ? | in milliseonds | private static long parse Duration From Seconds ( String duration Seconds ) { long duration = NUM ; try { duration = Long . parse Long ( duration Seconds ) ; duration = duration * NUM ; } catch ( Number Format Exception e ) { Timber . w ( STRING ) ; Timber . w ( e . get Message ( ) ) ; } return duration ; } | private static long parseDurationFromSeconds ( String durationSeconds ) { long duration = _NUM ; try { duration = Long . parseLong ( durationSeconds ) ; duration = duration * _NUM ; } catch ( NumberFormatException e ) { Timber . w ( STRING ) ; Timber . w ( e . getMessage ( ) ) ; } return duration ; } | 70 |
java-test-6323 | java | What do a string resemble ? | ssss | private static long parse Duration From Seconds ( String duration Seconds ) { long duration = NUM ; try { duration = Long . parse Long ( duration Seconds ) ; duration = duration * NUM ; } catch ( Number Format Exception e ) { Timber . w ( STRING ) ; Timber . w ( e . get Message ( ) ) ; } return duration ; } | private static long parseDurationFromSeconds ( String durationSeconds ) { long duration = _NUM ; try { duration = Long . parseLong ( durationSeconds ) ; duration = duration * _NUM ; } catch ( NumberFormatException e ) { Timber . w ( STRING ) ; Timber . w ( e . getMessage ( ) ) ; } return duration ; } | 70 |
java-test-6324 | java | What does the code parse in milliseonds ? | the length of the episode | private static long parse Duration From Seconds ( String duration Seconds ) { long duration = NUM ; try { duration = Long . parse Long ( duration Seconds ) ; duration = duration * NUM ; } catch ( Number Format Exception e ) { Timber . w ( STRING ) ; Timber . w ( e . get Message ( ) ) ; } return duration ; } | private static long parseDurationFromSeconds ( String durationSeconds ) { long duration = _NUM ; try { duration = Long . parseLong ( durationSeconds ) ; duration = duration * _NUM ; } catch ( NumberFormatException e ) { Timber . w ( STRING ) ; Timber . w ( e . getMessage ( ) ) ; } return duration ; } | 70 |
java-test-6326 | java | What can we do manage ? | to do it | private Rewrite Match invoke Run Method ( Object class Instance To Run , Http Servlet Request http Servlet Request , Http Servlet Response http Servlet Response , Filter Chain chain , Object [ ] match Objs ) throws Servlet Exception , Invocation Target Exception { if ( log . is Debug Enabled ( ) ) { log . debug ( STRIN... | private RewriteMatch invokeRunMethod ( Object classInstanceToRun , HttpServletRequest httpServletRequest , HttpServletResponse httpServletResponse , FilterChain chain , Object [ ] matchObjs ) throws ServletException , InvocationTargetException { if ( log . isDebugEnabled ( ) ) { log . debug ( STRING + classStr + STRING... | 561 |
java-test-6327 | java | What do we don here ? | log exceptions | private Rewrite Match invoke Run Method ( Object class Instance To Run , Http Servlet Request http Servlet Request , Http Servlet Response http Servlet Response , Filter Chain chain , Object [ ] match Objs ) throws Servlet Exception , Invocation Target Exception { if ( log . is Debug Enabled ( ) ) { log . debug ( STRIN... | private RewriteMatch invokeRunMethod ( Object classInstanceToRun , HttpServletRequest httpServletRequest , HttpServletResponse httpServletResponse , FilterChain chain , Object [ ] matchObjs ) throws ServletException , InvocationTargetException { if ( log . isDebugEnabled ( ) ) { log . debug ( STRING + classStr + STRING... | 561 |
java-test-6328 | java | What describes the same font ? | another fontdescription | public boolean equals ( Object value ) { if ( this == value ) { return BOOL ; } else if ( value != null && value instanceof Font Description ) { Font Description other = ( Font Description ) value ; if ( style != other . style ) return BOOL ; if ( compact Font Format != other . compact Font Format ) return BOOL ; if ( ... | public boolean equals ( Object value ) { if ( this == value ) { return _BOOL ; } else if ( value != null && value instanceof FontDescription ) { FontDescription other = ( FontDescription ) value ; if ( style != other . style ) return _BOOL ; if ( compactFontFormat != other . compactFontFormat ) return _BOOL ; if ( adva... | 164 |
java-test-6329 | java | What does another fontdescription describe ? | the same font | public boolean equals ( Object value ) { if ( this == value ) { return BOOL ; } else if ( value != null && value instanceof Font Description ) { Font Description other = ( Font Description ) value ; if ( style != other . style ) return BOOL ; if ( compact Font Format != other . compact Font Format ) return BOOL ; if ( ... | public boolean equals ( Object value ) { if ( this == value ) { return _BOOL ; } else if ( value != null && value instanceof FontDescription ) { FontDescription other = ( FontDescription ) value ; if ( style != other . style ) return _BOOL ; if ( compactFontFormat != other . compactFontFormat ) return _BOOL ; if ( adva... | 164 |
java-test-6330 | java | Where do we show alpha beta ? | in symbol font | public String node Label ( ) { String Builder sb = new String Builder ( ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( alpha ) ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( beta ) ) ; if ( set ) { sb . append ( STRING ) ; sb . append ( Formatter . convert ( value ) ) ; } sb . append... | public String nodeLabel ( ) { StringBuilder sb = new StringBuilder ( ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( alpha ) ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( beta ) ) ; if ( set ) { sb . append ( STRING ) ; sb . append ( Formatter . convert ( value ) ) ; } sb . append ( ... | 96 |
java-test-6331 | java | What do we show in symbol font ? | alpha beta | public String node Label ( ) { String Builder sb = new String Builder ( ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( alpha ) ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( beta ) ) ; if ( set ) { sb . append ( STRING ) ; sb . append ( Formatter . convert ( value ) ) ; } sb . append... | public String nodeLabel ( ) { StringBuilder sb = new StringBuilder ( ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( alpha ) ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( beta ) ) ; if ( set ) { sb . append ( STRING ) ; sb . append ( Formatter . convert ( value ) ) ; } sb . append ( ... | 96 |
java-test-6332 | java | For what purpose do label for dotty output compute ? | to try to maximize utility | public String node Label ( ) { String Builder sb = new String Builder ( ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( alpha ) ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( beta ) ) ; if ( set ) { sb . append ( STRING ) ; sb . append ( Formatter . convert ( value ) ) ; } sb . append... | public String nodeLabel ( ) { StringBuilder sb = new StringBuilder ( ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( alpha ) ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( beta ) ) ; if ( set ) { sb . append ( STRING ) ; sb . append ( Formatter . convert ( value ) ) ; } sb . append ( ... | 96 |
java-test-6333 | java | What do we want ? | to show alpha beta in symbol font | public String node Label ( ) { String Builder sb = new String Builder ( ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( alpha ) ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( beta ) ) ; if ( set ) { sb . append ( STRING ) ; sb . append ( Formatter . convert ( value ) ) ; } sb . append... | public String nodeLabel ( ) { StringBuilder sb = new StringBuilder ( ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( alpha ) ) ; sb . append ( STRING ) ; sb . append ( Formatter . convert ( beta ) ) ; if ( set ) { sb . append ( STRING ) ; sb . append ( Formatter . convert ( value ) ) ; } sb . append ( ... | 96 |
java-test-6334 | java | What is being animated elsewhere ? | the current color | public void paint Component ( Graphics g ) { g . set Color ( get Background ( ) ) ; g . fill Rect ( NUM , NUM , get Width ( ) , get Height ( ) ) ; g . set Color ( current Color ) ; g . fill Oval ( NUM , NUM , get Width ( ) , get Height ( ) ) ; } | public void paintComponent ( Graphics g ) { g . setColor ( getBackground ( ) ) ; g . fillRect ( _NUM , _NUM , getWidth ( ) , getHeight ( ) ) ; g . setColor ( currentColor ) ; g . fillOval ( _NUM , _NUM , getWidth ( ) , getHeight ( ) ) ; } | 70 |
java-test-6335 | java | What does the code update ? | the datatag in the cache | public final Event < Boolean > update From Source ( final Long data Tag Id , final Source Data Tag Value source Data Tag Value ) { tag Cache . acquire Write Lock On Key ( data Tag Id ) ; try { T data Tag = tag Cache . get ( data Tag Id ) ; if ( source Data Tag Value != null && source Data Tag Value . get Value ( ) != n... | public final Event < Boolean > updateFromSource ( final Long dataTagId , final SourceDataTagValue sourceDataTagValue ) { tagCache . acquireWriteLockOnKey ( dataTagId ) ; try { T dataTag = tagCache . get ( dataTagId ) ; if ( sourceDataTagValue != null && sourceDataTagValue . getValue ( ) != null && isKnownClass ( dataTa... | 204 |
java-test-6336 | java | What does the method notify if an update is made ? | any cache listeners | public final Event < Boolean > update From Source ( final Long data Tag Id , final Source Data Tag Value source Data Tag Value ) { tag Cache . acquire Write Lock On Key ( data Tag Id ) ; try { T data Tag = tag Cache . get ( data Tag Id ) ; if ( source Data Tag Value != null && source Data Tag Value . get Value ( ) != n... | public final Event < Boolean > updateFromSource ( final Long dataTagId , final SourceDataTagValue sourceDataTagValue ) { tagCache . acquireWriteLockOnKey ( dataTagId ) ; try { T dataTag = tagCache . get ( dataTagId ) ; if ( sourceDataTagValue != null && sourceDataTagValue . getValue ( ) != null && isKnownClass ( dataTa... | 204 |
java-test-6337 | java | How do all files from each segmentinfos e ? | decref | private void delete Commits ( ) { int size = commits To Delete . size ( ) ; if ( size > NUM ) { Throwable first Throwable = null ; for ( int i = NUM ; i < size ; i ++ ) { Commit Point commit = commits To Delete . get ( i ) ; if ( info Stream . is Enabled ( STRING ) ) { info Stream . message ( STRING , STRING + commit .... | private void deleteCommits ( ) { int size = commitsToDelete . size ( ) ; if ( size > _NUM ) { Throwable firstThrowable = null ; for ( int i = _NUM ; i < size ; i ++ ) { CommitPoint commit = commitsToDelete . get ( i ) ; if ( infoStream . isEnabled ( STRING ) ) { infoStream . message ( STRING , STRING + commit . getSegm... | 252 |
java-test-6338 | java | How does the code remove the commitpoints in the commitstodelete list ? | by decref ' ing all files from each segmentinfos | private void delete Commits ( ) { int size = commits To Delete . size ( ) ; if ( size > NUM ) { Throwable first Throwable = null ; for ( int i = NUM ; i < size ; i ++ ) { Commit Point commit = commits To Delete . get ( i ) ; if ( info Stream . is Enabled ( STRING ) ) { info Stream . message ( STRING , STRING + commit .... | private void deleteCommits ( ) { int size = commitsToDelete . size ( ) ; if ( size > _NUM ) { Throwable firstThrowable = null ; for ( int i = _NUM ; i < size ; i ++ ) { CommitPoint commit = commitsToDelete . get ( i ) ; if ( infoStream . isEnabled ( STRING ) ) { infoStream . message ( STRING , STRING + commit . getSegm... | 252 |
java-test-6339 | java | What does the code remove by decref ' ing all files from each segmentinfos ? | the commitpoints in the commitstodelete list | private void delete Commits ( ) { int size = commits To Delete . size ( ) ; if ( size > NUM ) { Throwable first Throwable = null ; for ( int i = NUM ; i < size ; i ++ ) { Commit Point commit = commits To Delete . get ( i ) ; if ( info Stream . is Enabled ( STRING ) ) { info Stream . message ( STRING , STRING + commit .... | private void deleteCommits ( ) { int size = commitsToDelete . size ( ) ; if ( size > _NUM ) { Throwable firstThrowable = null ; for ( int i = _NUM ; i < size ; i ++ ) { CommitPoint commit = commitsToDelete . get ( i ) ; if ( infoStream . isEnabled ( STRING ) ) { infoStream . message ( STRING , STRING + commit . getSegm... | 252 |
java-test-6341 | java | What does the code add ? | a line from vertex p1 | void add ( int p1 , int p2 ) { int i = ncon ; if ( p1 >= nvert || p2 >= nvert ) { return ; } if ( i >= maxcon ) { if ( con == null ) { maxcon = NUM ; con = new int [ maxcon ] ; } else { maxcon *= NUM ; int nv [ ] = new int [ maxcon ] ; System . arraycopy ( con , NUM , nv , NUM , con . length ) ; con = nv ; } } if ( p1 ... | void add ( int p1 , int p2 ) { int i = ncon ; if ( p1 >= nvert || p2 >= nvert ) { return ; } if ( i >= maxcon ) { if ( con == null ) { maxcon = _NUM ; con = new int [ maxcon ] ; } else { maxcon *= _NUM ; int nv [ ] = new int [ maxcon ] ; System . arraycopy ( con , _NUM , nv , _NUM , con . length ) ; con = nv ; } } if (... | 137 |
java-test-6342 | java | What does the code prepare ? | a printable string of each output line | private String line Printer ( List < Text Read > text Reads , boolean bs , boolean no Format , boolean with Read Name ) throws IO Exception { String Builder sb = new String Builder ( ) ; int cur Pos = NUM ; for ( Text Read tr : text Reads ) { sb . append ( String Utils . repeat ( STRING , ( tr . get Text Start ( ) - NU... | private String linePrinter ( List < TextRead > textReads , boolean bs , boolean noFormat , boolean withReadName ) throws IOException { StringBuilder sb = new StringBuilder ( ) ; int curPos = _NUM ; for ( TextRead tr : textReads ) { sb . append ( StringUtils . repeat ( STRING , ( tr . getTextStart ( ) - _NUM ) - curPos ... | 133 |
java-test-6343 | java | What does the code provide ? | some necessary initialization after object has been deserialized | private void read Object ( Object Input Stream ois ) throws IO Exception , Class Not Found Exception { try { ois . default Read Object ( ) ; init Plot ( ) ; } catch ( Exception ex ) { ex . print Stack Trace ( ) ; } } | private void readObject ( ObjectInputStream ois ) throws IOException , ClassNotFoundException { try { ois . defaultReadObject ( ) ; initPlot ( ) ; } catch ( Exception ex ) { ex . printStackTrace ( ) ; } } | 51 |
java-test-6344 | java | What does the code write ? | an unsigned 16 bit big - endian number | public static byte [ ] write Unsigned Short ( int s ) { Byte Buffer bb = Byte Buffer . allocate ( NUM ) ; bb . put ( ( byte ) ( ( s > > NUM ) & NUM ) ) ; bb . put ( ( byte ) ( s & NUM ) ) ; return bb . array ( ) ; } | public static byte [ ] writeUnsignedShort ( int s ) { ByteBuffer bb = ByteBuffer . allocate ( _NUM ) ; bb . put ( ( byte ) ( ( s > > _NUM ) & _NUM ) ) ; bb . put ( ( byte ) ( s & _NUM ) ) ; return bb . array ( ) ; } | 66 |
java-test-6345 | java | What does the code create ? | a new class loader | public Dynamic Class Loader ( Class Loader parent , boolean enable Dependency Check , boolean is Root ) { super ( NULL URL ARRAY , get Init Parent ( parent , is Root ) ) ; parent = get Parent ( ) ; is Enable Dependency Check = enable Dependency Check ; dependencies . set Check Interval ( global Dependency Check Interva... | public DynamicClassLoader ( ClassLoader parent , boolean enableDependencyCheck , boolean isRoot ) { super ( NULL_URL_ARRAY , getInitParent ( parent , isRoot ) ) ; parent = getParent ( ) ; _isEnableDependencyCheck = enableDependencyCheck ; _dependencies . setCheckInterval ( _globalDependencyCheckInterval ) ; if ( ! Curr... | 223 |
java-test-6346 | java | What does the code normalize ? | the supplied application name | protected String normalize App Name ( String app ) { String app 2 = app . replace All ( STRING , STRING ) ; if ( app . length ( ) == NUM ) { throw new Illegal Argument Exception ( STRING + app ) ; } return app 2 ; } | protected String normalizeAppName ( String app ) { String app2 = app . replaceAll ( STRING , STRING ) ; if ( app . length ( ) == _NUM ) { throw new IllegalArgumentException ( STRING + app ) ; } return app2 ; } | 52 |
java-test-6347 | java | What do a rectangular box contain ? | the text " click to edit " | public void paint Value ( Graphics g , Rectangle box ) { Color old Color = g . get Color ( ) ; Font old Font = g . get Font ( ) ; g . set Color ( Color . blue ) ; g . set Font ( new Font ( old Font . get Font Name ( ) , Font . BOLD , old Font . get Size ( ) ) ) ; g . draw Rect ( box . x - NUM , box . y + NUM , box . wi... | public void paintValue ( Graphics g , Rectangle box ) { Color oldColor = g . getColor ( ) ; Font oldFont = g . getFont ( ) ; g . setColor ( Color . blue ) ; g . setFont ( new Font ( oldFont . getFontName ( ) , Font . BOLD , oldFont . getSize ( ) ) ) ; g . drawRect ( box . x - _NUM , box . y + _NUM , box . width - _NUM ... | 160 |
java-test-6348 | java | What does the code represent as a rectangular box containing the text " click to edit " ? | the face of the custom property editor | public void paint Value ( Graphics g , Rectangle box ) { Color old Color = g . get Color ( ) ; Font old Font = g . get Font ( ) ; g . set Color ( Color . blue ) ; g . set Font ( new Font ( old Font . get Font Name ( ) , Font . BOLD , old Font . get Size ( ) ) ) ; g . draw Rect ( box . x - NUM , box . y + NUM , box . wi... | public void paintValue ( Graphics g , Rectangle box ) { Color oldColor = g . getColor ( ) ; Font oldFont = g . getFont ( ) ; g . setColor ( Color . blue ) ; g . setFont ( new Font ( oldFont . getFontName ( ) , Font . BOLD , oldFont . getSize ( ) ) ) ; g . drawRect ( box . x - _NUM , box . y + _NUM , box . width - _NUM ... | 160 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.