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-1166 | java | What does the code convert into a simple regex ? | a limited file glob | private String glob To Regex ( String glob ) { if ( glob . char At ( NUM ) == STRING || glob . contains ( STRING ) || glob . contains ( STRING ) ) { throw new Illegal Argument Exception ( STRING ) ; } glob = glob . replace ( STRING , STRING ) ; glob = glob . replace ( STRING , STRING ) ; glob = glob . replace ( STRING ... | private String globToRegex ( String glob ) { if ( glob . charAt ( _NUM ) == STRING || glob . contains ( STRING ) || glob . contains ( STRING ) ) { throw new IllegalArgumentException ( STRING ) ; } glob = glob . replace ( STRING , STRING ) ; glob = glob . replace ( STRING , STRING ) ; glob = glob . replace ( STRING , ST... | 84 |
java-test-1167 | java | What does the code retrieve by it ' s name ? | a codenvy workspace | @ Override public Request < Workspace > with Name ( String name ) { for ( Map . Entry < String , Workspace > entry : workspaces . entry Set ( ) ) { if ( name . equals ( entry . get Key ( ) ) ) { return new Dummy Request < Workspace > ( entry . get Value ( ) ) ; } } return new Dummy Request < > ( null ) ; } | @ Override public Request < Workspace > withName ( String name ) { for ( Map . Entry < String , Workspace > entry : workspaces . entrySet ( ) ) { if ( name . equals ( entry . getKey ( ) ) ) { return new DummyRequest < Workspace > ( entry . getValue ( ) ) ; } } return new DummyRequest < > ( null ) ; } | 78 |
java-test-1169 | java | For what purpose is this synchronized ? | so that concurrent writers must block during this operation | synchronized public long transfer To ( final Random Access File out ) throws IO Exception { final long count = next Offset . get ( ) ; final File Channel out Channel = out . get Channel ( ) ; final long to Position = out Channel . position ( ) ; buffer . limit ( ( int ) count ) ; buffer . position ( NUM ) ; File Channe... | synchronized public long transferTo ( final RandomAccessFile out ) throws IOException { final long count = nextOffset . get ( ) ; final FileChannel outChannel = out . getChannel ( ) ; final long toPosition = outChannel . position ( ) ; buffer . limit ( ( int ) count ) ; buffer . position ( _NUM ) ; FileChannelUtility .... | 100 |
java-test-1170 | java | When must concurrent writers block ? | during this operation | synchronized public long transfer To ( final Random Access File out ) throws IO Exception { final long count = next Offset . get ( ) ; final File Channel out Channel = out . get Channel ( ) ; final long to Position = out Channel . position ( ) ; buffer . limit ( ( int ) count ) ; buffer . position ( NUM ) ; File Channe... | synchronized public long transferTo ( final RandomAccessFile out ) throws IOException { final long count = nextOffset . get ( ) ; final FileChannel outChannel = out . getChannel ( ) ; final long toPosition = outChannel . position ( ) ; buffer . limit ( ( int ) count ) ; buffer . position ( _NUM ) ; FileChannelUtility .... | 100 |
java-test-1171 | java | How does the span return ? | with leading and trailing whitespaces omitted | public Span trim ( Char Sequence src ) { if ( start < end ) while ( src . char At ( end - NUM ) == NUM ) { end -- ; if ( start == end ) break ; } if ( start < end ) while ( src . char At ( start ) == NUM ) { start ++ ; if ( start == end ) break ; } return this ; } | public Span trim ( CharSequence src ) { if ( start < end ) while ( src . charAt ( end - _NUM ) == _NUM ) { end -- ; if ( start == end ) break ; } if ( start < end ) while ( src . charAt ( start ) == _NUM ) { start ++ ; if ( start == end ) break ; } return this ; } | 77 |
java-test-1176 | java | What will it delete also ? | all vms of the specified project and zone | @ After public void tear Down ( ) throws Throwable { if ( this . vm State != null ) { try { delete Document ( this . host , this . vm State . document Self Link ) ; } catch ( Throwable delete Ex ) { host . log ( Level . WARNING , STRING , delete Ex . get Message ( ) ) ; } } if ( this . compute Host != null ) { try { de... | @ After public void tearDown ( ) throws Throwable { if ( this . vmState != null ) { try { deleteDocument ( this . host , this . vmState . documentSelfLink ) ; } catch ( Throwable deleteEx ) { host . log ( Level . WARNING , STRING , deleteEx . getMessage ( ) ) ; } } if ( this . computeHost != null ) { try { deleteDocume... | 179 |
java-test-1177 | java | What are time assuming ? | both times are on the same day ( ignoring midnight ) | @ Suppress Warnings ( STRING ) protected boolean is Fast Clock Time GE ( int hr , int min ) { Date now = fast Clock . get Time ( ) ; now Hours = now . get Hours ( ) ; now Minutes = now . get Minutes ( ) ; if ( ( ( now Hours * NUM ) + now Minutes ) >= ( ( hr * NUM ) + min ) ) { return BOOL ; } return BOOL ; } | @ SuppressWarnings ( STRING ) protected boolean isFastClockTimeGE ( int hr , int min ) { Date now = fastClock . getTime ( ) ; nowHours = now . getHours ( ) ; nowMinutes = now . getMinutes ( ) ; if ( ( ( nowHours * _NUM ) + nowMinutes ) >= ( ( hr * _NUM ) + min ) ) { return _BOOL ; } return _BOOL ; } | 85 |
java-test-1178 | java | What does it set to the latest fast clock values also ? | nowminutes and nowhours | @ Suppress Warnings ( STRING ) protected boolean is Fast Clock Time GE ( int hr , int min ) { Date now = fast Clock . get Time ( ) ; now Hours = now . get Hours ( ) ; now Minutes = now . get Minutes ( ) ; if ( ( ( now Hours * NUM ) + now Minutes ) >= ( ( hr * NUM ) + min ) ) { return BOOL ; } return BOOL ; } | @ SuppressWarnings ( STRING ) protected boolean isFastClockTimeGE ( int hr , int min ) { Date now = fastClock . getTime ( ) ; nowHours = now . getHours ( ) ; nowMinutes = now . getMinutes ( ) ; if ( ( ( nowHours * _NUM ) + nowMinutes ) >= ( ( hr * _NUM ) + min ) ) { return _BOOL ; } return _BOOL ; } | 85 |
java-test-1179 | java | How does the code compress them ? | using two bits per character | public static void compress ( ) { Alphabet DNA = Alphabet . DNA ; String s = Binary Std In . read String ( ) ; int n = s . length ( ) ; Binary Std Out . write ( n ) ; for ( int i = NUM ; i < n ; i ++ ) { int d = DNA . to Index ( s . char At ( i ) ) ; Binary Std Out . write ( d , NUM ) ; } Binary Std Out . close ( ) ; } | public static void compress ( ) { Alphabet DNA = Alphabet . DNA ; String s = BinaryStdIn . readString ( ) ; int n = s . length ( ) ; BinaryStdOut . write ( n ) ; for ( int i = _NUM ; i < n ; i ++ ) { int d = DNA . toIndex ( s . charAt ( i ) ) ; BinaryStdOut . write ( d , _NUM ) ; } BinaryStdOut . close ( ) ; } | 97 |
java-test-1180 | java | What does the code read ? | a sequence of 8 - bit extended ascii characters over the alphabet { a , c , t , g } from standard input | public static void compress ( ) { Alphabet DNA = Alphabet . DNA ; String s = Binary Std In . read String ( ) ; int n = s . length ( ) ; Binary Std Out . write ( n ) ; for ( int i = NUM ; i < n ; i ++ ) { int d = DNA . to Index ( s . char At ( i ) ) ; Binary Std Out . write ( d , NUM ) ; } Binary Std Out . close ( ) ; } | public static void compress ( ) { Alphabet DNA = Alphabet . DNA ; String s = BinaryStdIn . readString ( ) ; int n = s . length ( ) ; BinaryStdOut . write ( n ) ; for ( int i = _NUM ; i < n ; i ++ ) { int d = DNA . toIndex ( s . charAt ( i ) ) ; BinaryStdOut . write ( d , _NUM ) ; } BinaryStdOut . close ( ) ; } | 97 |
java-test-1181 | java | For what purpose is zoning enabled ? | for any of the mask export groups | private boolean zoning Enabled ( Export Mask export Mask ) { if ( Network Util . are Network System Discovered ( db Client ) ) { List < Export Group > export Groups = Export Utils . get Export Groups For Mask ( export Mask . get Id ( ) , db Client ) ; for ( Export Group export Group : export Groups ) { if ( Network Sch... | private boolean zoningEnabled ( ExportMask exportMask ) { if ( NetworkUtil . areNetworkSystemDiscovered ( _dbClient ) ) { List < ExportGroup > exportGroups = ExportUtils . getExportGroupsForMask ( exportMask . getId ( ) , _dbClient ) ; for ( ExportGroup exportGroup : exportGroups ) { if ( NetworkScheduler . isZoningReq... | 99 |
java-test-1182 | java | What do clearing the buffer in this way mean ? | that the text can only ever be read once | private String read Buffer ( Input Node from ) throws Exception { int length = text . length ( ) ; if ( length > NUM ) { String value = text . to String ( ) ; text . set Length ( NUM ) ; return value ; } return null ; } | private String readBuffer ( InputNode from ) throws Exception { int length = text . length ( ) ; if ( length > _NUM ) { String value = text . toString ( ) ; text . setLength ( _NUM ) ; return value ; } return null ; } | 54 |
java-test-1183 | java | What means that the text can only ever be read once ? | clearing the buffer in this way | private String read Buffer ( Input Node from ) throws Exception { int length = text . length ( ) ; if ( length > NUM ) { String value = text . to String ( ) ; text . set Length ( NUM ) ; return value ; } return null ; } | private String readBuffer ( InputNode from ) throws Exception { int length = text . length ( ) ; if ( length > _NUM ) { String value = text . toString ( ) ; text . setLength ( _NUM ) ; return value ; } return null ; } | 54 |
java-test-1184 | java | What is this used ? | to read the text between element tags | private String read Buffer ( Input Node from ) throws Exception { int length = text . length ( ) ; if ( length > NUM ) { String value = text . to String ( ) ; text . set Length ( NUM ) ; return value ; } return null ; } | private String readBuffer ( InputNode from ) throws Exception { int length = text . length ( ) ; if ( length > _NUM ) { String value = text . toString ( ) ; text . setLength ( _NUM ) ; return value ; } return null ; } | 54 |
java-test-1185 | java | What is this will return if there is any text held in the buffer if there is any text held in the buffer ? | that text | private String read Buffer ( Input Node from ) throws Exception { int length = text . length ( ) ; if ( length > NUM ) { String value = text . to String ( ) ; text . set Length ( NUM ) ; return value ; } return null ; } | private String readBuffer ( InputNode from ) throws Exception { int length = text . length ( ) ; if ( length > _NUM ) { String value = text . toString ( ) ; text . setLength ( _NUM ) ; return value ; } return null ; } | 54 |
java-test-1188 | java | What does the code adjust on the latest cash journal available for the cash book ? | the beginning balance | public static void update Beginning Balance ( Properties ctx , int terminal Id , String trx Name ) throws Operation Exception { int cash Book Id = POS Terminal Manager . get Cash Book Id ( ctx , terminal Id ) ; update Cash Book Beginning Balance ( ctx , cash Book Id , trx Name ) ; } | public static void updateBeginningBalance ( Properties ctx , int terminalId , String trxName ) throws OperationException { int cashBookId = POSTerminalManager . getCashBookId ( ctx , terminalId ) ; updateCashBookBeginningBalance ( ctx , cashBookId , trxName ) ; } | 59 |
java-test-1189 | java | Where does the code adjust the beginning balance ? | on the latest cash journal available for the cash book | public static void update Beginning Balance ( Properties ctx , int terminal Id , String trx Name ) throws Operation Exception { int cash Book Id = POS Terminal Manager . get Cash Book Id ( ctx , terminal Id ) ; update Cash Book Beginning Balance ( ctx , cash Book Id , trx Name ) ; } | public static void updateBeginningBalance ( Properties ctx , int terminalId , String trxName ) throws OperationException { int cashBookId = POSTerminalManager . getCashBookId ( ctx , terminalId ) ; updateCashBookBeginningBalance ( ctx , cashBookId , trxName ) ; } | 59 |
java-test-1190 | java | What will give an empty map ? | the code dealing with a query filter | @ Override public Map < String , Map < String , Set < String > > > search ( String user ID Attribute Name , int limit , Query Filter < Json Pointer > query Filter , Set < String > attributes To Fetch , String filter Operand , Map < String , Set < String > > av Pairs ) throws Id Repo Unsupported Op Exception { throw new... | @ Override public Map < String , Map < String , Set < String > > > search ( String userIDAttributeName , int limit , QueryFilter < JsonPointer > queryFilter , Set < String > attributesToFetch , String filterOperand , Map < String , Set < String > > avPairs ) throws IdRepoUnsupportedOpException { throw new IdRepoUnsuppo... | 80 |
java-test-1191 | java | What will the code dealing with a query filter give ? | an empty map | @ Override public Map < String , Map < String , Set < String > > > search ( String user ID Attribute Name , int limit , Query Filter < Json Pointer > query Filter , Set < String > attributes To Fetch , String filter Operand , Map < String , Set < String > > av Pairs ) throws Id Repo Unsupported Op Exception { throw new... | @ Override public Map < String , Map < String , Set < String > > > search ( String userIDAttributeName , int limit , QueryFilter < JsonPointer > queryFilter , Set < String > attributesToFetch , String filterOperand , Map < String , Set < String > > avPairs ) throws IdRepoUnsupportedOpException { throw new IdRepoUnsuppo... | 80 |
java-test-1192 | java | When is the code dealing with a query filter not supported ? | as yet | @ Override public Map < String , Map < String , Set < String > > > search ( String user ID Attribute Name , int limit , Query Filter < Json Pointer > query Filter , Set < String > attributes To Fetch , String filter Operand , Map < String , Set < String > > av Pairs ) throws Id Repo Unsupported Op Exception { throw new... | @ Override public Map < String , Map < String , Set < String > > > search ( String userIDAttributeName , int limit , QueryFilter < JsonPointer > queryFilter , Set < String > attributesToFetch , String filterOperand , Map < String , Set < String > > avPairs ) throws IdRepoUnsupportedOpException { throw new IdRepoUnsuppo... | 80 |
java-test-1194 | java | What did the layout need whenever ? | to be updated along the minor axis | protected void layout Minor Axis ( int target Span , int axis , int [ ] offsets , int [ ] spans ) { super . layout Minor Axis ( target Span , axis , offsets , spans ) ; int col = NUM ; int ncells = get View Count ( ) ; for ( int cell = NUM ; cell < ncells ; cell ++ , col ++ ) { View cv = get View ( cell ) ; for ( ; is ... | protected void layoutMinorAxis ( int targetSpan , int axis , int [ ] offsets , int [ ] spans ) { super . layoutMinorAxis ( targetSpan , axis , offsets , spans ) ; int col = _NUM ; int ncells = getViewCount ( ) ; for ( int cell = _NUM ; cell < ncells ; cell ++ , col ++ ) { View cv = getView ( cell ) ; for ( ; isFilled (... | 192 |
java-test-1195 | java | When is by the superclass called this ? | whenever the layout needs to be updated along the minor axis | protected void layout Minor Axis ( int target Span , int axis , int [ ] offsets , int [ ] spans ) { super . layout Minor Axis ( target Span , axis , offsets , spans ) ; int col = NUM ; int ncells = get View Count ( ) ; for ( int cell = NUM ; cell < ncells ; cell ++ , col ++ ) { View cv = get View ( cell ) ; for ( ; is ... | protected void layoutMinorAxis ( int targetSpan , int axis , int [ ] offsets , int [ ] spans ) { super . layoutMinorAxis ( targetSpan , axis , offsets , spans ) ; int col = _NUM ; int ncells = getViewCount ( ) ; for ( int cell = _NUM ; cell < ncells ; cell ++ , col ++ ) { View cv = getView ( cell ) ; for ( ; isFilled (... | 192 |
java-test-1196 | java | What spans multiple rows ? | any cell | protected void layout Minor Axis ( int target Span , int axis , int [ ] offsets , int [ ] spans ) { super . layout Minor Axis ( target Span , axis , offsets , spans ) ; int col = NUM ; int ncells = get View Count ( ) ; for ( int cell = NUM ; cell < ncells ; cell ++ , col ++ ) { View cv = get View ( cell ) ; for ( ; is ... | protected void layoutMinorAxis ( int targetSpan , int axis , int [ ] offsets , int [ ] spans ) { super . layoutMinorAxis ( targetSpan , axis , offsets , spans ) ; int col = _NUM ; int ncells = getViewCount ( ) ; for ( int cell = _NUM ; cell < ncells ; cell ++ , col ++ ) { View cv = getView ( cell ) ; for ( ; isFilled (... | 192 |
java-test-1197 | java | What does any cell span ? | multiple rows | protected void layout Minor Axis ( int target Span , int axis , int [ ] offsets , int [ ] spans ) { super . layout Minor Axis ( target Span , axis , offsets , spans ) ; int col = NUM ; int ncells = get View Count ( ) ; for ( int cell = NUM ; cell < ncells ; cell ++ , col ++ ) { View cv = get View ( cell ) ; for ( ; is ... | protected void layoutMinorAxis ( int targetSpan , int axis , int [ ] offsets , int [ ] spans ) { super . layoutMinorAxis ( targetSpan , axis , offsets , spans ) ; int col = _NUM ; int ncells = getViewCount ( ) ; for ( int cell = _NUM ; cell < ncells ; cell ++ , col ++ ) { View cv = getView ( cell ) ; for ( ; isFilled (... | 192 |
java-test-1198 | java | What does the code produce ? | a string representation of the edge | public final String to String ( ) { String Builder buf = new String Builder ( ) ; Endpoint endpt Type A = get Endpoint 1 ( ) ; Endpoint endpt Type B = get Endpoint 2 ( ) ; buf . append ( get Node 1 ( ) ) ; buf . append ( STRING ) ; if ( endpt Type A == Endpoint . TAIL ) { buf . append ( STRING ) ; } else if ( endpt Typ... | public final String toString ( ) { StringBuilder buf = new StringBuilder ( ) ; Endpoint endptTypeA = getEndpoint1 ( ) ; Endpoint endptTypeB = getEndpoint2 ( ) ; buf . append ( getNode1 ( ) ) ; buf . append ( STRING ) ; if ( endptTypeA == Endpoint . TAIL ) { buf . append ( STRING ) ; } else if ( endptTypeA == Endpoint .... | 210 |
java-test-1200 | java | What will it return if the element does not exists by comparator ? | negative value | private int find ( E [ ] array , E element ) { int min = NUM ; int max = array . length - NUM ; while ( max >= min ) { int mid = midpoint ( min , max ) ; int compare = comparator . compare ( array [ mid ] , element ) ; if ( NUM == compare ) { return mid ; } min = ( compare < NUM ) ? mid + NUM : min ; max = ( compare > ... | private int find ( E [ ] array , E element ) { int min = _NUM ; int max = array . length - _NUM ; while ( max >= min ) { int mid = midpoint ( min , max ) ; int compare = comparator . compare ( array [ mid ] , element ) ; if ( _NUM == compare ) { return mid ; } min = ( compare < _NUM ) ? mid + _NUM : min ; max = ( compa... | 104 |
java-test-1201 | java | How does the element not exists ? | by comparator | private int find ( E [ ] array , E element ) { int min = NUM ; int max = array . length - NUM ; while ( max >= min ) { int mid = midpoint ( min , max ) ; int compare = comparator . compare ( array [ mid ] , element ) ; if ( NUM == compare ) { return mid ; } min = ( compare < NUM ) ? mid + NUM : min ; max = ( compare > ... | private int find ( E [ ] array , E element ) { int min = _NUM ; int max = array . length - _NUM ; while ( max >= min ) { int mid = midpoint ( min , max ) ; int compare = comparator . compare ( array [ mid ] , element ) ; if ( _NUM == compare ) { return mid ; } min = ( compare < _NUM ) ? mid + _NUM : min ; max = ( compa... | 104 |
java-test-1202 | java | What fails to create a thread when asked ? | the thread factory | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1203 | java | How do the thread factory return ? | null | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1204 | java | What does the thread factory fail when asked ? | to create a thread | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1205 | java | Why does the thread creation fail ? | either due to the thread factory returning null , or due to an exception ( typically outofmemoryerror in thread . start ( ) | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1206 | java | Does the thread factory create a thread ? | No | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1207 | java | In which direction did we roll cleanly ? | back | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1208 | java | How did we roll back ? | cleanly | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1209 | java | How is the worker count adjusted ? | accordingly | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1210 | java | When does the thread factory fail to create a thread ? | when asked | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1211 | java | How can a new worker be added ? | with respect to current pool state and the given bound ( either core or maximum ) | private boolean add Worker ( Runnable first Task , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = run State Of ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && first Task == null && ! work Queue . is Empty ( ) ) ) return BOOL ; for ( ; ; ) { int wc = worker Count Of ( c ) ; if ( wc >= CAPAC... | private boolean addWorker ( Runnable firstTask , boolean core ) { retry : for ( ; ; ) { int c = ctl . get ( ) ; int rs = runStateOf ( c ) ; if ( rs >= SHUTDOWN && ! ( rs == SHUTDOWN && firstTask == null && ! workQueue . isEmpty ( ) ) ) return _BOOL ; for ( ; ; ) { int wc = workerCountOf ( c ) ; if ( wc >= CAPACITY || w... | 348 |
java-test-1213 | java | When is full accuracy obtained ? | for xx > 1 | public static double log Gamma ( double xx ) { double x = xx - NUM ; double tmp = x + NUM ; tmp -= ( x + NUM ) * Math . log ( tmp ) ; double ser = NUM ; double [ ] coeff = cof ; for ( int j = NUM ; j <= NUM ; j ++ ) { x ++ ; ser += coeff [ j ] / x ; } return - tmp + Math . log ( NUM * ser ) ; } | public static double logGamma ( double xx ) { double x = xx - _NUM ; double tmp = x + _NUM ; tmp -= ( x + _NUM ) * Math . log ( tmp ) ; double ser = _NUM ; double [ ] coeff = cof ; for ( int j = _NUM ; j <= _NUM ; j ++ ) { x ++ ; ser += coeff [ j ] / x ; } return - tmp + Math . log ( _NUM * ser ) ; } | 93 |
java-test-1214 | java | Where is it connected to ? | on the next layer | private int calculated Weighted Value ( mx Graph Abstract Hierarchy Cell current Cell , Collection < mx Graph Abstract Hierarchy Cell > collection ) { int total Weight = NUM ; Iterator < mx Graph Abstract Hierarchy Cell > iter = collection . iterator ( ) ; while ( iter . has Next ( ) ) { mx Graph Abstract Hierarchy Cel... | private int calculatedWeightedValue ( mxGraphAbstractHierarchyCell currentCell , Collection < mxGraphAbstractHierarchyCell > collection ) { int totalWeight = _NUM ; Iterator < mxGraphAbstractHierarchyCell > iter = collection . iterator ( ) ; while ( iter . hasNext ( ) ) { mxGraphAbstractHierarchyCell cell = iter . next... | 132 |
java-test-1215 | java | What does the code calculate ? | the priority the specified cell has based on the type of its cell and the cells it is connected to on the next layer | private int calculated Weighted Value ( mx Graph Abstract Hierarchy Cell current Cell , Collection < mx Graph Abstract Hierarchy Cell > collection ) { int total Weight = NUM ; Iterator < mx Graph Abstract Hierarchy Cell > iter = collection . iterator ( ) ; while ( iter . has Next ( ) ) { mx Graph Abstract Hierarchy Cel... | private int calculatedWeightedValue ( mxGraphAbstractHierarchyCell currentCell , Collection < mxGraphAbstractHierarchyCell > collection ) { int totalWeight = _NUM ; Iterator < mxGraphAbstractHierarchyCell > iter = collection . iterator ( ) ; while ( iter . hasNext ( ) ) { mxGraphAbstractHierarchyCell cell = iter . next... | 132 |
java-test-1216 | java | What does this build ? | the proper dominance tree | private void build Dom Tree ( ) { int sz Nodes = nodes . size ( ) ; for ( int i = NUM ; i < sz Nodes ; i ++ ) { Dom Info info = dom Infos [ i ] ; if ( info . idom == - NUM ) continue ; Ssa Basic Block dom Parent = nodes . get ( info . idom ) ; dom Parent . add Dom Child ( nodes . get ( i ) ) ; } } | private void buildDomTree ( ) { int szNodes = nodes . size ( ) ; for ( int i = _NUM ; i < szNodes ; i ++ ) { DomInfo info = domInfos [ i ] ; if ( info . idom == - _NUM ) continue ; SsaBasicBlock domParent = nodes . get ( info . idom ) ; domParent . addDomChild ( nodes . get ( i ) ) ; } } | 87 |
java-test-1217 | java | What is us knowing ? | who the immediate dominator is for each node | private void build Dom Tree ( ) { int sz Nodes = nodes . size ( ) ; for ( int i = NUM ; i < sz Nodes ; i ++ ) { Dom Info info = dom Infos [ i ] ; if ( info . idom == - NUM ) continue ; Ssa Basic Block dom Parent = nodes . get ( info . idom ) ; dom Parent . add Dom Child ( nodes . get ( i ) ) ; } } | private void buildDomTree ( ) { int szNodes = nodes . size ( ) ; for ( int i = _NUM ; i < szNodes ; i ++ ) { DomInfo info = domInfos [ i ] ; if ( info . idom == - _NUM ) continue ; SsaBasicBlock domParent = nodes . get ( info . idom ) ; domParent . addDomChild ( nodes . get ( i ) ) ; } } | 87 |
java-test-1218 | java | What is who ? | the immediate dominator | private void build Dom Tree ( ) { int sz Nodes = nodes . size ( ) ; for ( int i = NUM ; i < sz Nodes ; i ++ ) { Dom Info info = dom Infos [ i ] ; if ( info . idom == - NUM ) continue ; Ssa Basic Block dom Parent = nodes . get ( info . idom ) ; dom Parent . add Dom Child ( nodes . get ( i ) ) ; } } | private void buildDomTree ( ) { int szNodes = nodes . size ( ) ; for ( int i = _NUM ; i < szNodes ; i ++ ) { DomInfo info = domInfos [ i ] ; if ( info . idom == - _NUM ) continue ; SsaBasicBlock domParent = nodes . get ( info . idom ) ; domParent . addDomChild ( nodes . get ( i ) ) ; } } | 87 |
java-test-1219 | java | What does the code create ? | a resolved classifier reference | public Classifier Reference ( Qualified Name qualified Name , URI uri ) { this . classifier Name = qualified Name . get Last Segment ( ) ; List < String > front Segments = qualified Name . get Segments ( ) ; if ( front Segments . size ( ) > NUM ) { String Joiner joiner = new String Joiner ( N4 JS Qualified Name Convert... | public ClassifierReference ( QualifiedName qualifiedName , URI uri ) { this . classifierName = qualifiedName . getLastSegment ( ) ; List < String > frontSegments = qualifiedName . getSegments ( ) ; if ( frontSegments . size ( ) > _NUM ) { StringJoiner joiner = new StringJoiner ( N4JSQualifiedNameConverter . DELIMITER )... | 135 |
java-test-1220 | java | What does this mean ? | a classifier with a valid uri of its declaration | public Classifier Reference ( Qualified Name qualified Name , URI uri ) { this . classifier Name = qualified Name . get Last Segment ( ) ; List < String > front Segments = qualified Name . get Segments ( ) ; if ( front Segments . size ( ) > NUM ) { String Joiner joiner = new String Joiner ( N4 JS Qualified Name Convert... | public ClassifierReference ( QualifiedName qualifiedName , URI uri ) { this . classifierName = qualifiedName . getLastSegment ( ) ; List < String > frontSegments = qualifiedName . getSegments ( ) ; if ( frontSegments . size ( ) > _NUM ) { StringJoiner joiner = new StringJoiner ( N4JSQualifiedNameConverter . DELIMITER )... | 135 |
java-test-1223 | java | What do we need for processes to access shared internal storage ( / sdcard ) ? | this permission | @ Target Api ( Build . VERSION CODES . M ) public boolean ensure Storage Permission Granted ( ) { if ( Build . VERSION . SDK INT >= Build . VERSION CODES . M ) { if ( check Self Permission ( Manifest . permission . WRITE EXTERNAL STORAGE ) == Package Manager . PERMISSION GRANTED ) { return BOOL ; } else { request Permi... | @ TargetApi ( Build . VERSION_CODES . M ) public boolean ensureStoragePermissionGranted ( ) { if ( Build . VERSION . SDK_INT >= Build . VERSION_CODES . M ) { if ( checkSelfPermission ( Manifest . permission . WRITE_EXTERNAL_STORAGE ) == PackageManager . PERMISSION_GRANTED ) { return _BOOL ; } else { requestPermissions ... | 99 |
java-test-1224 | java | For what purpose do we need this permission ? | for processes to access shared internal storage ( / sdcard ) | @ Target Api ( Build . VERSION CODES . M ) public boolean ensure Storage Permission Granted ( ) { if ( Build . VERSION . SDK INT >= Build . VERSION CODES . M ) { if ( check Self Permission ( Manifest . permission . WRITE EXTERNAL STORAGE ) == Package Manager . PERMISSION GRANTED ) { return BOOL ; } else { request Permi... | @ TargetApi ( Build . VERSION_CODES . M ) public boolean ensureStoragePermissionGranted ( ) { if ( Build . VERSION . SDK_INT >= Build . VERSION_CODES . M ) { if ( checkSelfPermission ( Manifest . permission . WRITE_EXTERNAL_STORAGE ) == PackageManager . PERMISSION_GRANTED ) { return _BOOL ; } else { requestPermissions ... | 99 |
java-test-1226 | java | What does this function verify with the aid of the public key ? | the signature of the message that has been updated | public boolean verify Signature ( byte [ ] message , byte [ ] signature ) { short [ ] sig Int = new short [ signature . length ] ; short tmp ; for ( int i = NUM ; i < signature . length ; i ++ ) { tmp = ( short ) signature [ i ] ; tmp &= ( short ) NUM ; sig Int [ i ] = tmp ; } short [ ] msg Hash Val = make Message Repr... | public boolean verifySignature ( byte [ ] message , byte [ ] signature ) { short [ ] sigInt = new short [ signature . length ] ; short tmp ; for ( int i = _NUM ; i < signature . length ; i ++ ) { tmp = ( short ) signature [ i ] ; tmp &= ( short ) _NUM ; sigInt [ i ] = tmp ; } short [ ] msgHashVal = makeMessageRepresent... | 168 |
java-test-1227 | java | How does this function verify the signature of the message that has been updated ? | with the aid of the public key | public boolean verify Signature ( byte [ ] message , byte [ ] signature ) { short [ ] sig Int = new short [ signature . length ] ; short tmp ; for ( int i = NUM ; i < signature . length ; i ++ ) { tmp = ( short ) signature [ i ] ; tmp &= ( short ) NUM ; sig Int [ i ] = tmp ; } short [ ] msg Hash Val = make Message Repr... | public boolean verifySignature ( byte [ ] message , byte [ ] signature ) { short [ ] sigInt = new short [ signature . length ] ; short tmp ; for ( int i = _NUM ; i < signature . length ; i ++ ) { tmp = ( short ) signature [ i ] ; tmp &= ( short ) _NUM ; sigInt [ i ] = tmp ; } short [ ] msgHashVal = makeMessageRepresent... | 168 |
java-test-1228 | java | How has the message been updated ? | with the aid of the public | public boolean verify Signature ( byte [ ] message , byte [ ] signature ) { short [ ] sig Int = new short [ signature . length ] ; short tmp ; for ( int i = NUM ; i < signature . length ; i ++ ) { tmp = ( short ) signature [ i ] ; tmp &= ( short ) NUM ; sig Int [ i ] = tmp ; } short [ ] msg Hash Val = make Message Repr... | public boolean verifySignature ( byte [ ] message , byte [ ] signature ) { short [ ] sigInt = new short [ signature . length ] ; short tmp ; for ( int i = _NUM ; i < signature . length ; i ++ ) { tmp = ( short ) signature [ i ] ; tmp &= ( short ) _NUM ; sigInt [ i ] = tmp ; } short [ ] msgHashVal = makeMessageRepresent... | 168 |
java-test-1229 | java | When is by the gpslocator called this method ? | the first time it fixes | public void on Location Changed ( Location location ) { if ( Cfg . DEBUG ) { Check . log ( TAG + STRING + location ) ; } synchronized ( listeners ) { got Valid Position = BOOL ; for ( GPS Location Listener listener : listeners ) { if ( Cfg . DEBUG ) { Check . log ( TAG + STRING + listener ) ; } listener . on Location C... | public void onLocationChanged ( Location location ) { if ( Cfg . DEBUG ) { Check . log ( TAG + STRING + location ) ; } synchronized ( listeners ) { gotValidPosition = _BOOL ; for ( GPSLocationListener listener : listeners ) { if ( Cfg . DEBUG ) { Check . log ( TAG + STRING + listener ) ; } listener . onLocationChanged ... | 87 |
java-test-1230 | java | What does the code generate ? | the native guid for block related provider triggered indications | public static String generate Native Guid ( Hashtable < String , String > cim Indication ) throws IO Exception { String native Guid = cim Indication . get ( CIM Constants . SOURCE INSTANCE MODEL PATH COMPOSITE ID ) ; logger . debug ( STRING , native Guid ) ; if ( native Guid != null && native Guid . index Of ( CIM Cons... | public static String generateNativeGuid ( Hashtable < String , String > cimIndication ) throws IOException { String nativeGuid = cimIndication . get ( CIMConstants . SOURCE_INSTANCE_MODEL_PATH_COMPOSITE_ID ) ; _logger . debug ( STRING , nativeGuid ) ; if ( nativeGuid != null && nativeGuid . indexOf ( CIMConstants . CLA... | 139 |
java-test-1231 | java | What does not match the selector if not specified issuer ? | specified issuers | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1232 | java | What match the selector in the case of null issuernames criteria ? | crls with any issuers | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1233 | java | What does specified issuers match ? | the selector | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1234 | java | What does crls with any issuers match in the case of null issuernames criteria ? | the selector | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1235 | java | When is the internal collection of issuer names copied ? | during initialization | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1236 | java | How does crls with any issuers match the selector ? | in the case of null issuernames criteria | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1237 | java | What does specified issuers not match if not specified issuer ? | the selector | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1238 | java | Does specified issuers match the selector if not specified issuer ? | No | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1239 | java | What match the selector ? | specified issuers | @ Suppress Warnings ( STRING ) public void test Set Issuer Names Ljava util Collection 02 ( ) { X509 CRL Selector selector = new X509 CRL Selector ( ) ; String iss 1 = STRING ; byte [ ] iss 2 = new byte [ ] { NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM , NUM... | @ SuppressWarnings ( STRING ) public void testSetIssuerNamesLjava_util_Collection02 ( ) { X509CRLSelector selector = new X509CRLSelector ( ) ; String iss1 = STRING ; byte [ ] iss2 = new byte [ ] { _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM , _NUM... | 333 |
java-test-1240 | java | How is state passed into the stateless httpmonitem instances ? | via ' this ' instance | public Http Mon start ( ) { time Mon Index = NUM ; Iterator iter = iter ( ) ; while ( iter . has Next ( ) ) { Http Mon Item mon Item = ( Http Mon Item ) iter . next ( ) ; mon Item . start ( this ) ; } return this ; } | public HttpMon start ( ) { timeMonIndex = _NUM ; Iterator iter = iter ( ) ; while ( iter . hasNext ( ) ) { HttpMonItem monItem = ( HttpMonItem ) iter . next ( ) ; monItem . start ( this ) ; } return this ; } | 60 |
java-test-1241 | java | For what purpose did method call ? | to start monitoring http requests , and responses . loop through all httpmonitems starting each of them | public Http Mon start ( ) { time Mon Index = NUM ; Iterator iter = iter ( ) ; while ( iter . has Next ( ) ) { Http Mon Item mon Item = ( Http Mon Item ) iter . next ( ) ; mon Item . start ( this ) ; } return this ; } | public HttpMon start ( ) { timeMonIndex = _NUM ; Iterator iter = iter ( ) ; while ( iter . hasNext ( ) ) { HttpMonItem monItem = ( HttpMonItem ) iter . next ( ) ; monItem . start ( this ) ; } return this ; } | 60 |
java-test-1245 | java | When be give one more answer be the max of two array if ratings [ i ] increase , give one more from right to left if ratings [ i ] increase , give one more from right to left ? | o ( n ) time , o ( n ) space from left to right | public int candy ( int [ ] ratings ) { int [ ] candies = new int [ ratings . length ] ; candies [ NUM ] = NUM ; for ( int i = NUM ; i < ratings . length ; i ++ ) candies [ i ] = ratings [ i ] > ratings [ i - NUM ] ? candies [ i - NUM ] + NUM : NUM ; int res = candies [ candies . length - NUM ] ; for ( int i = ratings .... | public int candy ( int [ ] ratings ) { int [ ] candies = new int [ ratings . length ] ; candies [ _NUM ] = _NUM ; for ( int i = _NUM ; i < ratings . length ; i ++ ) candies [ i ] = ratings [ i ] > ratings [ i - _NUM ] ? candies [ i - _NUM ] + _NUM : _NUM ; int res = candies [ candies . length - _NUM ] ; for ( int i = r... | 155 |
java-test-1247 | java | What does not contain a member with the specified name ? | this object | public Json Object remove ( String name ) { if ( name == null ) { throw new Null Pointer Exception ( STRING ) ; } int index = index Of ( name ) ; if ( index != - NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | public JsonObject remove ( String name ) { if ( name == null ) { throw new NullPointerException ( STRING ) ; } int index = indexOf ( name ) ; if ( index != - _NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | 69 |
java-test-1248 | java | What did this object contain ? | multiple members with the given name | public Json Object remove ( String name ) { if ( name == null ) { throw new Null Pointer Exception ( STRING ) ; } int index = index Of ( name ) ; if ( index != - NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | public JsonObject remove ( String name ) { if ( name == null ) { throw new NullPointerException ( STRING ) ; } int index = indexOf ( name ) ; if ( index != - _NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | 69 |
java-test-1249 | java | What does this object not contain ? | a member with the specified name | public Json Object remove ( String name ) { if ( name == null ) { throw new Null Pointer Exception ( STRING ) ; } int index = index Of ( name ) ; if ( index != - NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | public JsonObject remove ( String name ) { if ( name == null ) { throw new NullPointerException ( STRING ) ; } int index = indexOf ( name ) ; if ( index != - _NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | 69 |
java-test-1250 | java | What contains multiple members with the given name ? | this object | public Json Object remove ( String name ) { if ( name == null ) { throw new Null Pointer Exception ( STRING ) ; } int index = index Of ( name ) ; if ( index != - NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | public JsonObject remove ( String name ) { if ( name == null ) { throw new NullPointerException ( STRING ) ; } int index = indexOf ( name ) ; if ( index != - _NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | 69 |
java-test-1251 | java | Does this object contain a member with the specified name ? | No | public Json Object remove ( String name ) { if ( name == null ) { throw new Null Pointer Exception ( STRING ) ; } int index = index Of ( name ) ; if ( index != - NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | public JsonObject remove ( String name ) { if ( name == null ) { throw new NullPointerException ( STRING ) ; } int index = indexOf ( name ) ; if ( index != - _NUM ) { table . remove ( index ) ; names . remove ( index ) ; values . remove ( index ) ; } return this ; } | 69 |
java-test-1253 | java | Till when are any cells whose level is less than " min_level " or where ( level - min_level ) is not a multiple of " level_mod " replaced by their children ? | until either both of these conditions are satisfied or the maximum level is reached | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1254 | java | Where is ( level - min_level ) not is a multiple of " level_mod " ? | any cells | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1255 | java | What allows various geometric computations to be done ? | a normalized cell union | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1256 | java | What satisfies the desired constraints ? | the original list of cell ids | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1257 | java | Is ( level - min_level ) is a multiple of " level_mod " any cells ? | No | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1258 | java | In which direction did a covering convert to the original list of cell ids that satisfies the desired constraints then ? | back | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1259 | java | What does output " replace ? | with an expanded version of the cell union where any cells whose level is less than " min_level " or where ( level - min_level ) is not a multiple of " level_mod " are replaced by their children , until either both of these conditions are satisfied or the maximum level is reached . this method allows a covering generat... | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1260 | java | What does this method allow either both of these conditions are satisfied or the maximum level is reached ? | a covering generated by s2regioncoverer using min_level ( ) or level_mod ( ) constraints to be stored as a normalized cell union ( which allows various geometric computations to be done ) and then converted back to the original list of cell ids that satisfies the desired constraints | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1261 | java | What does the original list of cell ids satisfy ? | the desired constraints | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1262 | java | What is not a multiple of " level_mod " any cells ? | ( level - min_level ) | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1263 | java | What replaces with an expanded version of the cell union where any cells whose level is less than " min_level " or where ( level - min_level ) is not a multiple of " level_mod " are replaced by their children , until either both of these conditions are satisfied or the maximum level is reached . this method allows a co... | output " | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1264 | java | When does this method allow a covering generated by s2regioncoverer using min_level ( ) or level_mod ( ) constraints to be stored as a normalized cell union ( which allows various geometric computations to be done ) and then converted back to the original list of cell ids that satisfies the desired constraints ? | either both of these conditions are satisfied or the maximum level is reached | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1265 | java | What does a normalized cell union allow ? | various geometric computations to be done | public void denormalize ( int min Level , int level Mod , Array List < S2 Cell Id > output ) { output . clear ( ) ; output . ensure Capacity ( size ( ) ) ; for ( S2 Cell Id id : this ) { int level = id . level ( ) ; int new Level = Math . max ( min Level , level ) ; if ( level Mod > NUM ) { new Level += ( S2 Cell Id . ... | public void denormalize ( int minLevel , int levelMod , ArrayList < S2CellId > output ) { output . clear ( ) ; output . ensureCapacity ( size ( ) ) ; for ( S2CellId id : this ) { int level = id . level ( ) ; int newLevel = Math . max ( minLevel , level ) ; if ( levelMod > _NUM ) { newLevel += ( S2CellId . MAX_LEVEL - (... | 194 |
java-test-1266 | java | Where does the code create a new chunk ? | at the current position of the imageoutputstream | public Segment ( int marker ) throws IO Exception { this . marker = marker ; if ( marker != NUM ) { out . write Short ( marker ) ; offset = get Stream Position ( ) ; if ( ! standalone Markers . contains ( marker ) ) { out . write Short ( NUM ) ; } } } | public Segment ( int marker ) throws IOException { this . marker = marker ; if ( marker != _NUM ) { out . writeShort ( marker ) ; offset = getStreamPosition ( ) ; if ( ! standaloneMarkers . contains ( marker ) ) { out . writeShort ( _NUM ) ; } } } | 62 |
java-test-1267 | java | When did from the connection thread call the code ? | once the initial connection has been established without an error | protected void connected ( String ip , int port ) { this . connected Ip = ip ; this . connected Port = port ; this . connected Since = System . current Time Millis ( ) ; set State ( Irc . STATE CONNECTED ) ; on Connect ( ) ; if ( pass != null ) { send ( STRING + pass ) ; } send ( STRING + nick ) ; send ( String . forma... | protected void connected ( String ip , int port ) { this . connectedIp = ip ; this . connectedPort = port ; this . connectedSince = System . currentTimeMillis ( ) ; setState ( Irc . STATE_CONNECTED ) ; onConnect ( ) ; if ( pass != null ) { send ( STRING + pass ) ; } send ( STRING + nick ) ; send ( String . format ( STR... | 87 |
java-test-1268 | java | How has the initial connection been established ? | without an error | protected void connected ( String ip , int port ) { this . connected Ip = ip ; this . connected Port = port ; this . connected Since = System . current Time Millis ( ) ; set State ( Irc . STATE CONNECTED ) ; on Connect ( ) ; if ( pass != null ) { send ( STRING + pass ) ; } send ( STRING + nick ) ; send ( String . forma... | protected void connected ( String ip , int port ) { this . connectedIp = ip ; this . connectedPort = port ; this . connectedSince = System . currentTimeMillis ( ) ; setState ( Irc . STATE_CONNECTED ) ; onConnect ( ) ; if ( pass != null ) { send ( STRING + pass ) ; } send ( STRING + nick ) ; send ( String . format ( STR... | 87 |
java-test-1269 | java | In which direction did the code call ? | from window close of icon editors | public static boolean check Image Index ( ) { if ( index Changed ) { int result = J Option Pane . show Confirm Dialog ( null , Bundle . get Message ( STRING ) , Bundle . get Message ( STRING ) , J Option Pane . YES NO CANCEL OPTION , J Option Pane . QUESTION MESSAGE ) ; if ( result == J Option Pane . YES OPTION ) { sto... | public static boolean checkImageIndex ( ) { if ( _indexChanged ) { int result = JOptionPane . showConfirmDialog ( null , Bundle . getMessage ( STRING ) , Bundle . getMessage ( STRING ) , JOptionPane . YES_NO_CANCEL_OPTION , JOptionPane . QUESTION_MESSAGE ) ; if ( result == JOptionPane . YES_OPTION ) { storeImageIndex (... | 108 |
java-test-1270 | java | What does a utility method load into a string ? | the contents of the given input stream | public static String input Stream To String ( Input Stream input Stream ) { String Writer string Writer = new String Writer ( ) ; try { IO Utils . copy ( input Stream , string Writer ) ; } catch ( IO Exception ex ) { throw new Runtime Exception ( ex ) ; } return string Writer . to String ( ) ; } | public static String inputStreamToString ( InputStream inputStream ) { StringWriter stringWriter = new StringWriter ( ) ; try { IOUtils . copy ( inputStream , stringWriter ) ; } catch ( IOException ex ) { throw new RuntimeException ( ex ) ; } return stringWriter . toString ( ) ; } | 66 |
java-test-1271 | java | How does the code create the class loader ? | with the context class loader | public static J Class Loader Wrapper create ( Class Loader loader ) { J Class Loader Wrapper j Loader = local Class Loader . get Level ( loader ) ; if ( j Loader == null ) { j Loader = new J Class Loader Wrapper ( loader ) ; local Class Loader . set ( j Loader , loader ) ; } return j Loader ; } | public static JClassLoaderWrapper create ( ClassLoader loader ) { JClassLoaderWrapper jLoader = _localClassLoader . getLevel ( loader ) ; if ( jLoader == null ) { jLoader = new JClassLoaderWrapper ( loader ) ; _localClassLoader . set ( jLoader , loader ) ; } return jLoader ; } | 68 |
java-test-1273 | java | What specified in the element xpointer scheme ? | the element position | protected boolean match Child Sequence ( Q Name element , int event ) throws XNI Exception { if ( f Current Child Depth >= f Current Child Sequence . length ) { int tmp Current Child Sequence [ ] = new int [ f Current Child Sequence . length ] ; System . arraycopy ( f Current Child Sequence , NUM , tmp Current Child Se... | protected boolean matchChildSequence ( QName element , int event ) throws XNIException { if ( fCurrentChildDepth >= fCurrentChildSequence . length ) { int tmpCurrentChildSequence [ ] = new int [ fCurrentChildSequence . length ] ; System . arraycopy ( fCurrentChildSequence , _NUM , tmpCurrentChildSequence , _NUM , fCurr... | 454 |
java-test-1274 | java | Where did the element position specify ? | in the element xpointer scheme | protected boolean match Child Sequence ( Q Name element , int event ) throws XNI Exception { if ( f Current Child Depth >= f Current Child Sequence . length ) { int tmp Current Child Sequence [ ] = new int [ f Current Child Sequence . length ] ; System . arraycopy ( f Current Child Sequence , NUM , tmp Current Child Se... | protected boolean matchChildSequence ( QName element , int event ) throws XNIException { if ( fCurrentChildDepth >= fCurrentChildSequence . length ) { int tmpCurrentChildSequence [ ] = new int [ fCurrentChildSequence . length ] ; System . arraycopy ( fCurrentChildSequence , _NUM , tmpCurrentChildSequence , _NUM , fCurr... | 454 |
java-test-1275 | java | When do this call ? | after the game has been left | public void client Left Game ( ) { if ( ! Swing Utilities . is Event Dispatch Thread ( ) ) { Swing Action . invoke And Wait ( null ) ; return ; } Thread Util . sleep ( NUM ) ; m game Selector Model . load Default Game ( this ) ; m setup Panel Model . show Select Type ( ) ; set Visible ( BOOL ) ; } | public void clientLeftGame ( ) { if ( ! SwingUtilities . isEventDispatchThread ( ) ) { SwingAction . invokeAndWait ( null ) ; return ; } ThreadUtil . sleep ( _NUM ) ; m_gameSelectorModel . loadDefaultGame ( this ) ; m_setupPanelModel . showSelectType ( ) ; setVisible ( _BOOL ) ; } | 73 |
java-test-1276 | java | What do the dates resolve ? | the same way joda - time resolves dates | private Wikibase Date check ( int year , int month , int day , int hour , int minute , int second ) { Wikibase Date wb Date = new Wikibase Date ( year , month , day , hour , minute , second ) ; assert Equals ( wb Date . to String ( ) , joda Seconds ( year , month , day , hour , minute , second ) , wb Date . seconds Sin... | private WikibaseDate check ( int year , int month , int day , int hour , int minute , int second ) { WikibaseDate wbDate = new WikibaseDate ( year , month , day , hour , minute , second ) ; assertEquals ( wbDate . toString ( ) , jodaSeconds ( year , month , day , hour , minute , second ) , wbDate . secondsSinceEpoch ( ... | 96 |
java-test-1277 | java | What resolve the same way joda - time resolves dates ? | the dates | private Wikibase Date check ( int year , int month , int day , int hour , int minute , int second ) { Wikibase Date wb Date = new Wikibase Date ( year , month , day , hour , minute , second ) ; assert Equals ( wb Date . to String ( ) , joda Seconds ( year , month , day , hour , minute , second ) , wb Date . seconds Sin... | private WikibaseDate check ( int year , int month , int day , int hour , int minute , int second ) { WikibaseDate wbDate = new WikibaseDate ( year , month , day , hour , minute , second ) ; assertEquals ( wbDate . toString ( ) , jodaSeconds ( year , month , day , hour , minute , second ) , wbDate . secondsSinceEpoch ( ... | 96 |
java-test-1283 | java | What is within the closest word boundaries containing c ? | a cased letter | private static boolean is Final Cased ( String src , int index , Locale locale ) { Break Iterator word Boundary = Break Iterator . get Word Instance ( locale ) ; word Boundary . set Text ( src ) ; int ch ; for ( int i = index ; ( i >= NUM ) && ! word Boundary . is Boundary ( i ) ; i -= Character . char Count ( ch ) ) {... | private static boolean isFinalCased ( String src , int index , Locale locale ) { BreakIterator wordBoundary = BreakIterator . getWordInstance ( locale ) ; wordBoundary . setText ( src ) ; int ch ; for ( int i = index ; ( i >= _NUM ) && ! wordBoundary . isBoundary ( i ) ; i -= Character . charCount ( ch ) ) { ch = src .... | 189 |
java-test-1284 | java | What do c contain ? | within the closest word boundaries | private static boolean is Final Cased ( String src , int index , Locale locale ) { Break Iterator word Boundary = Break Iterator . get Word Instance ( locale ) ; word Boundary . set Text ( src ) ; int ch ; for ( int i = index ; ( i >= NUM ) && ! word Boundary . is Boundary ( i ) ; i -= Character . char Count ( ch ) ) {... | private static boolean isFinalCased ( String src , int index , Locale locale ) { BreakIterator wordBoundary = BreakIterator . getWordInstance ( locale ) ; wordBoundary . setText ( src ) ; int ch ; for ( int i = index ; ( i >= _NUM ) && ! wordBoundary . isBoundary ( i ) ; i -= Character . charCount ( ch ) ) { ch = src .... | 189 |
java-test-1285 | java | When is a cased letter within the closest word boundaries containing c ? | before c | private static boolean is Final Cased ( String src , int index , Locale locale ) { Break Iterator word Boundary = Break Iterator . get Word Instance ( locale ) ; word Boundary . set Text ( src ) ; int ch ; for ( int i = index ; ( i >= NUM ) && ! word Boundary . is Boundary ( i ) ; i -= Character . char Count ( ch ) ) {... | private static boolean isFinalCased ( String src , int index , Locale locale ) { BreakIterator wordBoundary = BreakIterator . getWordInstance ( locale ) ; wordBoundary . setText ( src ) ; int ch ; for ( int i = index ; ( i >= _NUM ) && ! wordBoundary . isBoundary ( i ) ; i -= Character . charCount ( ch ) ) { ch = src .... | 189 |
java-test-1286 | java | Where is a cased letter before c ? | within the closest word boundaries containing c | private static boolean is Final Cased ( String src , int index , Locale locale ) { Break Iterator word Boundary = Break Iterator . get Word Instance ( locale ) ; word Boundary . set Text ( src ) ; int ch ; for ( int i = index ; ( i >= NUM ) && ! word Boundary . is Boundary ( i ) ; i -= Character . char Count ( ch ) ) {... | private static boolean isFinalCased ( String src , int index , Locale locale ) { BreakIterator wordBoundary = BreakIterator . getWordInstance ( locale ) ; wordBoundary . setText ( src ) ; int ch ; for ( int i = index ; ( i >= _NUM ) && ! wordBoundary . isBoundary ( i ) ; i -= Character . charCount ( ch ) ) { ch = src .... | 189 |
java-test-1288 | java | For what purpose is this invoked on the toolkit thread ? | in response to an expose event | public boolean show ( Container c , int x , int y , int w , int h ) { synchronized ( this ) { if ( painting ) { return BOOL ; } showing = BOOL ; } try { Buffer Info info = get Buffer Info ( c ) ; Buffer Strategy buffer Strategy ; if ( info != null && info . is In Sync ( ) && ( buffer Strategy = info . get Buffer Strate... | public boolean show ( Container c , int x , int y , int w , int h ) { synchronized ( this ) { if ( painting ) { return _BOOL ; } showing = _BOOL ; } try { BufferInfo info = getBufferInfo ( c ) ; BufferStrategy bufferStrategy ; if ( info != null && info . isInSync ( ) && ( bufferStrategy = info . getBufferStrategy ( _BO... | 203 |
java-test-1289 | java | What does the code show ? | the specified region of the back buffer | public boolean show ( Container c , int x , int y , int w , int h ) { synchronized ( this ) { if ( painting ) { return BOOL ; } showing = BOOL ; } try { Buffer Info info = get Buffer Info ( c ) ; Buffer Strategy buffer Strategy ; if ( info != null && info . is In Sync ( ) && ( buffer Strategy = info . get Buffer Strate... | public boolean show ( Container c , int x , int y , int w , int h ) { synchronized ( this ) { if ( painting ) { return _BOOL ; } showing = _BOOL ; } try { BufferInfo info = getBufferInfo ( c ) ; BufferStrategy bufferStrategy ; if ( info != null && info . isInSync ( ) && ( bufferStrategy = info . getBufferStrategy ( _BO... | 203 |
java-test-1292 | java | What does the code remove at the specified index ? | the segment | public void remove Segment ( int shape Index , int segment Index ) { List < WKT Segment List > shape List = segment List . get ( shape Index ) ; if ( ( segment Index >= NUM ) && ( segment Index < shape List . size ( ) ) ) { shape List . remove ( segment Index ) ; } } | public void removeSegment ( int shapeIndex , int segmentIndex ) { List < WKTSegmentList > shapeList = segmentList . get ( shapeIndex ) ; if ( ( segmentIndex >= _NUM ) && ( segmentIndex < shapeList . size ( ) ) ) { shapeList . remove ( segmentIndex ) ; } } | 65 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.