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-1429 | java | Where does this method start ? | at the given state | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1430 | java | When will this method walk the minimal path in lexicographic order ? | as long as possible | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1431 | java | What can not satisfy the machine ? | this | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1432 | java | What will the next string in lexicographic order not put into a reject state ? | the machine | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1433 | java | What will this method walk in lexicographic order as long as possible ? | the minimal path | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1434 | java | For what purpose is to backtrack necessary if this method returns false if this method returns false ? | to find out | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1435 | java | What does this method traverse from the given position in the string from the given position in the string ? | the dfa | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1436 | java | How does the next string return ? | in lexicographic order that will not put the machine into a reject state | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1437 | java | How will this method walk the minimal path as long as possible ? | in lexicographic order | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1438 | java | Will the next string in lexicographic order put the machine into a reject state ? | No | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1439 | java | What will not put the machine into a reject state ? | the next string in lexicographic order | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1440 | java | Can this satisfy the machine ? | No | private boolean next String ( int state , int position ) { int c = NUM ; if ( position < seek Bytes Ref . length ( ) ) { c = seek Bytes Ref . byte At ( position ) & NUM ; if ( c ++ == NUM ) return BOOL ; } seek Bytes Ref . set Length ( position ) ; visited [ state ] = cur Gen ; final int num Transitions = automaton . g... | private boolean nextString ( int state , int position ) { int c = _NUM ; if ( position < seekBytesRef . length ( ) ) { c = seekBytesRef . byteAt ( position ) & _NUM ; if ( c ++ == _NUM ) return _BOOL ; } seekBytesRef . setLength ( position ) ; visited [ state ] = curGen ; final int numTransitions = automaton . getNumTr... | 309 |
java-test-1447 | java | What does the code remove from the code bookmark manager ? | a code bookmark | public void remove Bookmark ( final C Code Bookmark bookmark ) { Preconditions . check Not Null ( bookmark , STRING ) ; Preconditions . check Argument ( m bookmarks . remove ( bookmark ) , STRING ) ; for ( final I Code Bookmark Manager Listener listener : m listeners ) { try { listener . removed Bookmark ( this , bookm... | public void removeBookmark ( final CCodeBookmark bookmark ) { Preconditions . checkNotNull ( bookmark , STRING ) ; Preconditions . checkArgument ( m_bookmarks . remove ( bookmark ) , STRING ) ; for ( final ICodeBookmarkManagerListener listener : m_listeners ) { try { listener . removedBookmark ( this , bookmark ) ; } c... | 86 |
java-test-1448 | java | What loads the jarinfotablemodel ? | with an array of jar files | public void load ( Jar File [ ] jar Files ) throws IO Exception { data = new Object [ jar Files . length ] [ NUM ] ; for ( int i = NUM ; i < jar Files . length ; i ++ ) { Jar File jar File = jar Files [ i ] ; String file Name = jar File . get Name ( ) ; File file = new File ( file Name ) ; Manifest manifest = jar File ... | public void load ( JarFile [ ] jarFiles ) throws IOException { data = new Object [ jarFiles . length ] [ _NUM ] ; for ( int i = _NUM ; i < jarFiles . length ; i ++ ) { JarFile jarFile = jarFiles [ i ] ; String fileName = jarFile . getName ( ) ; File file = new File ( fileName ) ; Manifest manifest = jarFile . getManife... | 396 |
java-test-1449 | java | What do with an array of jar files load ? | the jarinfotablemodel | public void load ( Jar File [ ] jar Files ) throws IO Exception { data = new Object [ jar Files . length ] [ NUM ] ; for ( int i = NUM ; i < jar Files . length ; i ++ ) { Jar File jar File = jar Files [ i ] ; String file Name = jar File . get Name ( ) ; File file = new File ( file Name ) ; Manifest manifest = jar File ... | public void load ( JarFile [ ] jarFiles ) throws IOException { data = new Object [ jarFiles . length ] [ _NUM ] ; for ( int i = _NUM ; i < jarFiles . length ; i ++ ) { JarFile jarFile = jarFiles [ i ] ; String fileName = jarFile . getName ( ) ; File file = new File ( fileName ) ; Manifest manifest = jarFile . getManife... | 396 |
java-test-1450 | java | How do empty message create for filling and sending ? | by message i d | public MAV Link Message ( MAV Link Schema schema , int msg ID , int system ID , int component ID ) { this . schema = schema ; this . definition = schema . get Message Definition ( msg ID ) ; if ( definition == null ) { throw new Runtime Exception ( STRING + msg ID ) ; } this . payload = new byte [ definition . payload ... | public MAVLinkMessage ( MAVLinkSchema schema , int msgID , int systemID , int componentID ) { this . schema = schema ; this . definition = schema . getMessageDefinition ( msgID ) ; if ( definition == null ) { throw new RuntimeException ( STRING + msgID ) ; } this . payload = new byte [ definition . payloadLength ] ; th... | 127 |
java-test-1451 | java | For what purpose do empty message create by message i d ? | for filling and sending | public MAV Link Message ( MAV Link Schema schema , int msg ID , int system ID , int component ID ) { this . schema = schema ; this . definition = schema . get Message Definition ( msg ID ) ; if ( definition == null ) { throw new Runtime Exception ( STRING + msg ID ) ; } this . payload = new byte [ definition . payload ... | public MAVLinkMessage ( MAVLinkSchema schema , int msgID , int systemID , int componentID ) { this . schema = schema ; this . definition = schema . getMessageDefinition ( msgID ) ; if ( definition == null ) { throw new RuntimeException ( STRING + msgID ) ; } this . payload = new byte [ definition . payloadLength ] ; th... | 127 |
java-test-1452 | java | What did the code read ? | a classfile structure | public Compiled Class ( Data Input Stream source ) throws IO Exception { int idx ; magic = ( long ) source . read Int ( ) ; minor version = source . read Unsigned Short ( ) ; major version = source . read Unsigned Short ( ) ; constant pool count = source . read Unsigned Short ( ) ; constant pool = new Cp [ constant poo... | public CompiledClass ( DataInputStream source ) throws IOException { int idx ; magic = ( long ) source . readInt ( ) ; minor_version = source . readUnsignedShort ( ) ; major_version = source . readUnsignedShort ( ) ; constant_pool_count = source . readUnsignedShort ( ) ; constant_pool = new Cp [ constant_pool_count ] ;... | 373 |
java-test-1453 | java | What does a string convert ? | to xml body string | public static String xmlize ( String s ) { s = s . replace All ( STRING , STRING ) ; s = s . replace All ( STRING , STRING ) ; s = s . replace All ( STRING , STRING ) ; s = s . replace All ( STRING , STRING ) ; int char Count = s . length ( ) ; for ( int iter = NUM ; iter < char Count ; iter ++ ) { char c = s . char At... | public static String xmlize ( String s ) { s = s . replaceAll ( STRING , STRING ) ; s = s . replaceAll ( STRING , STRING ) ; s = s . replaceAll ( STRING , STRING ) ; s = s . replaceAll ( STRING , STRING ) ; int charCount = s . length ( ) ; for ( int iter = _NUM ; iter < charCount ; iter ++ ) { char c = s . charAt ( ite... | 198 |
java-test-1454 | java | What does the code create ? | an argb integer as required by the swf format | public static int color ARGB ( int color , double alpha ) { int rgb = color & NUM ; int a = ( int ) Strict Math . rint ( alpha * NUM ) ; int argb = rgb | ( a << NUM ) ; return argb ; } | public static int colorARGB ( int color , double alpha ) { int rgb = color & _NUM ; int a = ( int ) StrictMath . rint ( alpha * _NUM ) ; int argb = rgb | ( a << _NUM ) ; return argb ; } | 51 |
java-test-1455 | java | What does the code add to an rgb integer ( in the highest 8 bits of the 32 bit integer ) to create an argb integer as required by the swf format ? | alpha channel information | public static int color ARGB ( int color , double alpha ) { int rgb = color & NUM ; int a = ( int ) Strict Math . rint ( alpha * NUM ) ; int argb = rgb | ( a << NUM ) ; return argb ; } | public static int colorARGB ( int color , double alpha ) { int rgb = color & _NUM ; int a = ( int ) StrictMath . rint ( alpha * _NUM ) ; int argb = rgb | ( a << _NUM ) ; return argb ; } | 51 |
java-test-1456 | java | For what purpose does the code add alpha channel information to an rgb integer ( in the highest 8 bits of the 32 bit integer ) ? | to create an argb integer as required by the swf format | public static int color ARGB ( int color , double alpha ) { int rgb = color & NUM ; int a = ( int ) Strict Math . rint ( alpha * NUM ) ; int argb = rgb | ( a << NUM ) ; return argb ; } | public static int colorARGB ( int color , double alpha ) { int rgb = color & _NUM ; int a = ( int ) StrictMath . rint ( alpha * _NUM ) ; int argb = rgb | ( a << _NUM ) ; return argb ; } | 51 |
java-test-1465 | java | When be routine info sent in discovery data ? | during this node join | public UUID register Static Routine ( String cache Name , Cache Entry Updated Listener < ? , ? > loc Lsnr , Cache Entry Event Serializable Filter rmt Filter , @ Nullable Ignite Predicate < Cluster Node > prj Pred ) throws Ignite Checked Exception { String topic Prefix = STRING + STRING + cache Name ; Cache Continuous Q... | public UUID registerStaticRoutine ( String cacheName , CacheEntryUpdatedListener < ? , ? > locLsnr , CacheEntryEventSerializableFilter rmtFilter , @ Nullable IgnitePredicate < ClusterNode > prjPred ) throws IgniteCheckedException { String topicPrefix = STRING + STRING + cacheName ; CacheContinuousQueryHandler hnd = new... | 178 |
java-test-1467 | java | What does the code take ? | an reddit . com url | public static String format Reddit Url ( String url ) { url = url . replace First ( STRING , STRING ) ; if ( url . matches ( STRING ) ) { String subdomain = url . split ( STRING , NUM ) [ NUM ] ; String domain Regex = STRING + subdomain + STRING ; if ( subdomain . equals Ignore Case ( STRING ) ) { url = url . replace F... | public static String formatRedditUrl ( String url ) { url = url . replaceFirst ( STRING , STRING ) ; if ( url . matches ( STRING ) ) { String subdomain = url . split ( STRING , _NUM ) [ _NUM ] ; String domainRegex = STRING + subdomain + STRING ; if ( subdomain . equalsIgnoreCase ( STRING ) ) { url = url . replaceFirst ... | 219 |
java-test-1468 | java | When is the minimal size for a split checked ? | when prepruning is activated | protected boolean should Stop ( int [ ] selected Examples , int [ ] selected Attributes , int depth ) { if ( use Pre Pruning && selected Examples . length < min Size For Split ) { return BOOL ; } else { for ( Column Terminator terminator : other Terminators ) { if ( terminator . should Stop ( selected Examples , select... | protected boolean shouldStop ( int [ ] selectedExamples , int [ ] selectedAttributes , int depth ) { if ( usePrePruning && selectedExamples . length < minSizeForSplit ) { return _BOOL ; } else { for ( ColumnTerminator terminator : otherTerminators ) { if ( terminator . shouldStop ( selectedExamples , selectedAttributes... | 84 |
java-test-1469 | java | Where does search results show ? | within notebooks | private void handle Html Search Notebooks ( Page Wrapper page Wrapper , Request And Response request And Response , String query , String pane Id ) throws IO Exception , Servlet Exception { page Wrapper . add Page Intro Text ( servlet Text . intro Text Search Notebooks ( BOOL ) , servlet Text . intro Text Search Notebo... | private void handleHtmlSearchNotebooks ( PageWrapper pageWrapper , RequestAndResponse requestAndResponse , String query , String paneId ) throws IOException , ServletException { pageWrapper . addPageIntroText ( servletText . introTextSearchNotebooks ( _BOOL ) , servletText . introTextSearchNotebooks ( _BOOL ) ) ; try {... | 276 |
java-test-1470 | java | In which direction did local uris read ? | from the catalog | public Map parse Catalog ( Input Source input Source ) { XML Reader xml Reader = XML Resource . new XML Reader ( ) ; Catalog Content Handler ch = new Catalog Content Handler ( ) ; add Handlers ( xml Reader , ch ) ; set Feature ( xml Reader , STRING , BOOL ) ; try { xml Reader . parse ( input Source ) ; } catch ( Except... | public Map parseCatalog ( InputSource inputSource ) { XMLReader xmlReader = XMLResource . newXMLReader ( ) ; CatalogContentHandler ch = new CatalogContentHandler ( ) ; addHandlers ( xmlReader , ch ) ; setFeature ( xmlReader , STRING , _BOOL ) ; try { xmlReader . parse ( inputSource ) ; } catch ( Exception ex ) { throw ... | 96 |
java-test-1472 | java | What does the code get ? | difference between the maximum and the minimum value | @ Override public void execute ( Metric Time Series time Series , Function Value Map function Value Map ) { if ( time Series . size ( ) <= NUM ) { function Value Map . add ( this , Double . Na N ) ; return ; } double [ ] values = time Series . get Values As Array ( ) ; double min = values [ NUM ] ; double max = values ... | @ Override public void execute ( MetricTimeSeries timeSeries , FunctionValueMap functionValueMap ) { if ( timeSeries . size ( ) <= _NUM ) { functionValueMap . add ( this , Double . NaN ) ; return ; } double [ ] values = timeSeries . getValuesAsArray ( ) ; double min = values [ _NUM ] ; double max = values [ _NUM ] ; fo... | 149 |
java-test-1473 | java | What does the code add to the floatingactionmenu ? | a new menu item | public void add Menu Item ( Floating Action Button item ) { m Menu Items . add ( item ) ; m Menu Item Animators . add ( new Item Animator ( item ) ) ; Text View button = new Text View ( get Context ( ) ) ; Layout Params params = new Layout Params ( Layout Params . WRAP CONTENT , Layout Params . WRAP CONTENT ) ; button ... | public void addMenuItem ( FloatingActionButton item ) { mMenuItems . add ( item ) ; mMenuItemAnimators . add ( new ItemAnimator ( item ) ) ; TextView button = new TextView ( getContext ( ) ) ; LayoutParams params = new LayoutParams ( LayoutParams . WRAP_CONTENT , LayoutParams . WRAP_CONTENT ) ; button . setLayoutParams... | 207 |
java-test-1478 | java | What means subtract column - mean from each column scale means : divide each column by square root of ( sum - of - squares of column / ( number of columns - 1 ) ) see http : / / docs . tibco . com / pub / enterprise - runtime - for - r / 1 . 1 . 0 - november - 2012 / terr_1 . 1 . 0_languageref / base / scale . html ? | center | public static double [ ] [ ] center And Scale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int n Rows = result . length ; final int n Cols = result [ NUM ] . length ; if ( n Rows < NUM || n Cols == NUM ) return result ; for ( int col = NUM ; col < n Cols ; col ++ ) { double mean ... | public static double [ ] [ ] centerAndScale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int nRows = result . length ; final int nCols = result [ _NUM ] . length ; if ( nRows < _NUM || nCols == _NUM ) return result ; for ( int col = _NUM ; col < nCols ; col ++ ) { double mean = _... | 239 |
java-test-1479 | java | What does center mean ? | subtract column - mean from each column scale means : divide each column by square root of ( sum - of - squares of column / ( number of columns - 1 ) ) see http : / / docs . tibco . com / pub / enterprise - runtime - for - r / 1 . 1 . 0 - november - 2012 / terr_1 . 1 . 0_languageref / base / scale . html | public static double [ ] [ ] center And Scale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int n Rows = result . length ; final int n Cols = result [ NUM ] . length ; if ( n Rows < NUM || n Cols == NUM ) return result ; for ( int col = NUM ; col < n Cols ; col ++ ) { double mean ... | public static double [ ] [ ] centerAndScale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int nRows = result . length ; final int nCols = result [ _NUM ] . length ; if ( nRows < _NUM || nCols == _NUM ) return result ; for ( int col = _NUM ; col < nCols ; col ++ ) { double mean = _... | 239 |
java-test-1480 | java | What means divide each column by square root of ( sum - of - squares of column / ( number of columns - 1 ) ) see http : / / docs . tibco . com / pub / enterprise - runtime - for - r / 1 . 1 . 0 - november - 2012 / terr_1 . 1 . 0_languageref / base / scale ? | each column scale | public static double [ ] [ ] center And Scale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int n Rows = result . length ; final int n Cols = result [ NUM ] . length ; if ( n Rows < NUM || n Cols == NUM ) return result ; for ( int col = NUM ; col < n Cols ; col ++ ) { double mean ... | public static double [ ] [ ] centerAndScale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int nRows = result . length ; final int nCols = result [ _NUM ] . length ; if ( nRows < _NUM || nCols == _NUM ) return result ; for ( int col = _NUM ; col < nCols ; col ++ ) { double mean = _... | 239 |
java-test-1481 | java | Does http see http ? | No | public static double [ ] [ ] center And Scale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int n Rows = result . length ; final int n Cols = result [ NUM ] . length ; if ( n Rows < NUM || n Cols == NUM ) return result ; for ( int col = NUM ; col < n Cols ; col ++ ) { double mean ... | public static double [ ] [ ] centerAndScale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int nRows = result . length ; final int nCols = result [ _NUM ] . length ; if ( nRows < _NUM || nCols == _NUM ) return result ; for ( int col = _NUM ; col < nCols ; col ++ ) { double mean = _... | 239 |
java-test-1482 | java | What do each column scale mean ? | divide each column by square root of ( sum - of - squares of column / ( number of columns - 1 ) ) see http : / / docs . tibco . com / pub / enterprise - runtime - for - r / 1 . 1 . 0 - november - 2012 / terr_1 . 1 . 0_languageref / base / scale | public static double [ ] [ ] center And Scale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int n Rows = result . length ; final int n Cols = result [ NUM ] . length ; if ( n Rows < NUM || n Cols == NUM ) return result ; for ( int col = NUM ; col < n Cols ; col ++ ) { double mean ... | public static double [ ] [ ] centerAndScale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int nRows = result . length ; final int nCols = result [ _NUM ] . length ; if ( nRows < _NUM || nCols == _NUM ) return result ; for ( int col = _NUM ; col < nCols ; col ++ ) { double mean = _... | 239 |
java-test-1483 | java | Does each column divide by square root of ( sum - of - squares of column / ( number of columns - 1 ) ) ? | No | public static double [ ] [ ] center And Scale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int n Rows = result . length ; final int n Cols = result [ NUM ] . length ; if ( n Rows < NUM || n Cols == NUM ) return result ; for ( int col = NUM ; col < n Cols ; col ++ ) { double mean ... | public static double [ ] [ ] centerAndScale ( double [ ] [ ] matrix ) { final double [ ] [ ] result = matrix . clone ( ) ; final int nRows = result . length ; final int nCols = result [ _NUM ] . length ; if ( nRows < _NUM || nCols == _NUM ) return result ; for ( int col = _NUM ; col < nCols ; col ++ ) { double mean = _... | 239 |
java-test-1484 | java | In which direction does the code read in proper order ? | - only view of backed queue | public Collection < Evictable Entry < K , V > > queue ( ) { Set < Evictable Entry < K , V > > cp = new Linked Hash Set < > ( ) ; for ( Holder < K , V > holder : set ) cp . add ( holder . entry ) ; return Collections . unmodifiable Collection ( cp ) ; } | public Collection < EvictableEntry < K , V > > queue ( ) { Set < EvictableEntry < K , V > > cp = new LinkedHashSet < > ( ) ; for ( Holder < K , V > holder : set ) cp . add ( holder . entry ) ; return Collections . unmodifiableCollection ( cp ) ; } | 67 |
java-test-1485 | java | What did this method ensure ? | that the predeclared namespaces all appear | private void force NS Decls ( ) { Enumeration prefixes = forced Decl Table . keys ( ) ; while ( prefixes . has More Elements ( ) ) { String prefix = ( String ) prefixes . next Element ( ) ; do Prefix ( prefix , null , BOOL ) ; } } | private void forceNSDecls ( ) { Enumeration prefixes = forcedDeclTable . keys ( ) ; while ( prefixes . hasMoreElements ( ) ) { String prefix = ( String ) prefixes . nextElement ( ) ; doPrefix ( prefix , null , _BOOL ) ; } } | 55 |
java-test-1486 | java | When does the code set images ? | after layout changed | @ Override protected void on Layout ( boolean changed , int l , int t , int r , int b ) { super . on Layout ( changed , l , t , r , b ) ; m In Layout = BOOL ; layout ( NUM , BOOL ) ; m In Layout = BOOL ; } | @ Override protected void onLayout ( boolean changed , int l , int t , int r , int b ) { super . onLayout ( changed , l , t , r , b ) ; mInLayout = _BOOL ; layout ( _NUM , _BOOL ) ; mInLayout = _BOOL ; } | 59 |
java-test-1487 | java | How does the code go through the glyph contour ? | by contour finding pairs of touched points and moving the points between them to preserve the shape of the original outline | private void interpolate Untouched Points ( final int direction ) { final int [ ] points ; final int [ ] original ; final boolean [ ] touched = new boolean [ this . touched [ GLYPH ZONE ] . length ] ; if ( direction == IU Px ) { points = x [ GLYPH ZONE ] ; original = x [ ORIGINAL + GLYPH ZONE ] ; for ( int i = NUM ; i ... | private void interpolateUntouchedPoints ( final int direction ) { final int [ ] points ; final int [ ] original ; final boolean [ ] touched = new boolean [ this . touched [ GLYPH_ZONE ] . length ] ; if ( direction == IUPx ) { points = x [ GLYPH_ZONE ] ; original = x [ ORIGINAL + GLYPH_ZONE ] ; for ( int i = _NUM ; i < ... | 521 |
java-test-1488 | java | For what purpose does the points between them move ? | to preserve the shape of the original outline | private void interpolate Untouched Points ( final int direction ) { final int [ ] points ; final int [ ] original ; final boolean [ ] touched = new boolean [ this . touched [ GLYPH ZONE ] . length ] ; if ( direction == IU Px ) { points = x [ GLYPH ZONE ] ; original = x [ ORIGINAL + GLYPH ZONE ] ; for ( int i = NUM ; i ... | private void interpolateUntouchedPoints ( final int direction ) { final int [ ] points ; final int [ ] original ; final boolean [ ] touched = new boolean [ this . touched [ GLYPH_ZONE ] . length ] ; if ( direction == IUPx ) { points = x [ GLYPH_ZONE ] ; original = x [ ORIGINAL + GLYPH_ZONE ] ; for ( int i = _NUM ; i < ... | 521 |
java-test-1489 | java | What does the code make ? | an namespaces table | public static Byte List Namespaces ( Byte List bytes , Int List namespaces ) { for ( int i = NUM ; i < namespaces . size ( ) ; i ++ ) { bytes = Int ( bytes , namespaces . get ( i ) ) ; } return bytes ; } | public static ByteList Namespaces ( ByteList bytes , IntList namespaces ) { for ( int i = _NUM ; i < namespaces . size ( ) ; i ++ ) { bytes = Int ( bytes , namespaces . get ( i ) ) ; } return bytes ; } | 53 |
java-test-1490 | java | How do all values swap ? | in two random parameters | public final double do Operation ( ) throws Operator Failed Exception { int i = Math Utils . next Int ( parameter List . size ( ) ) ; int j = i ; while ( j == i ) { j = Math Utils . next Int ( parameter List . size ( ) ) ; } final Parameter a = parameter List . get ( i ) ; final Parameter b = parameter List . get ( j )... | public final double doOperation ( ) throws OperatorFailedException { int i = MathUtils . nextInt ( parameterList . size ( ) ) ; int j = i ; while ( j == i ) { j = MathUtils . nextInt ( parameterList . size ( ) ) ; } final Parameter a = parameterList . get ( i ) ; final Parameter b = parameterList . get ( j ) ; Bounds <... | 238 |
java-test-1492 | java | What does the code create ? | a new instance of restricted | public Restricted ( int i ) { cusip = NUM - i ; String [ ] arr 1 = { STRING , STRING , STRING , STRING , STRING , STRING , STRING } ; quote Type = arr 1 [ i % NUM ] ; unique Quote Type = STRING + Integer . to String ( i ) ; price = ( i / NUM ) * NUM ; min Qty = i + NUM ; max Qty = i + NUM ; if ( ( i % NUM ) == NUM ) { ... | public Restricted ( int i ) { cusip = _NUM - i ; String [ ] arr1 = { STRING , STRING , STRING , STRING , STRING , STRING , STRING } ; quoteType = arr1 [ i % _NUM ] ; uniqueQuoteType = STRING + Integer . toString ( i ) ; price = ( i / _NUM ) * _NUM ; minQty = i + _NUM ; maxQty = i + _NUM ; if ( ( i % _NUM ) == _NUM ) { ... | 130 |
java-test-1493 | java | What does the code handle ? | the measuring of the fam | @ Override protected void on Measure ( int width Measure Spec , int height Measure Spec ) { int width Size = Measure Spec . get Size ( width Measure Spec ) ; int width Mode = Measure Spec . get Mode ( width Measure Spec ) ; int width ; int height Size = Measure Spec . get Size ( height Measure Spec ) ; int height Mode ... | @ Override protected void onMeasure ( int widthMeasureSpec , int heightMeasureSpec ) { int widthSize = MeasureSpec . getSize ( widthMeasureSpec ) ; int widthMode = MeasureSpec . getMode ( widthMeasureSpec ) ; int width ; int heightSize = MeasureSpec . getSize ( heightMeasureSpec ) ; int heightMode = MeasureSpec . getMo... | 367 |
java-test-1496 | java | What does this simplestring split ? | into an array of simplestring using the char param as the delimiter | public Simple String [ ] split ( final char delim ) { List < Simple String > all = null ; byte low = ( byte ) ( delim & NUM ) ; byte high = ( byte ) ( delim > > NUM & NUM ) ; int las Pos = NUM ; for ( int i = NUM ; i < data . length ; i += NUM ) { if ( data [ i ] == low && data [ i + NUM ] == high ) { byte [ ] bytes = ... | public SimpleString [ ] split ( final char delim ) { List < SimpleString > all = null ; byte low = ( byte ) ( delim & _NUM ) ; byte high = ( byte ) ( delim > > _NUM & _NUM ) ; int lasPos = _NUM ; for ( int i = _NUM ; i < data . length ; i += _NUM ) { if ( data [ i ] == low && data [ i + _NUM ] == high ) { byte [ ] byte... | 257 |
java-test-1497 | java | What splits into an array of simplestring using the char param as the delimiter ? | this simplestring | public Simple String [ ] split ( final char delim ) { List < Simple String > all = null ; byte low = ( byte ) ( delim & NUM ) ; byte high = ( byte ) ( delim > > NUM & NUM ) ; int las Pos = NUM ; for ( int i = NUM ; i < data . length ; i += NUM ) { if ( data [ i ] == low && data [ i + NUM ] == high ) { byte [ ] bytes = ... | public SimpleString [ ] split ( final char delim ) { List < SimpleString > all = null ; byte low = ( byte ) ( delim & _NUM ) ; byte high = ( byte ) ( delim > > _NUM & _NUM ) ; int lasPos = _NUM ; for ( int i = _NUM ; i < data . length ; i += _NUM ) { if ( data [ i ] == low && data [ i + _NUM ] == high ) { byte [ ] byte... | 257 |
java-test-1499 | java | What is trying to find an i d ? | its causes | public Integer map Throwable ( final Throwable throwable ) { Throwable throwable To Check = throwable ; int depth To Go = NUM ; while ( BOOL ) { Integer res Id = map Throwable Flat ( throwable To Check ) ; if ( res Id != null ) { return res Id ; } else { throwable To Check = throwable To Check . get Cause ( ) ; depth T... | public Integer mapThrowable ( final Throwable throwable ) { Throwable throwableToCheck = throwable ; int depthToGo = _NUM ; while ( _BOOL ) { Integer resId = mapThrowableFlat ( throwableToCheck ) ; if ( resId != null ) { return resId ; } else { throwableToCheck = throwableToCheck . getCause ( ) ; depthToGo -- ; if ( de... | 117 |
java-test-1500 | java | What do its causes try ? | to find an i d | public Integer map Throwable ( final Throwable throwable ) { Throwable throwable To Check = throwable ; int depth To Go = NUM ; while ( BOOL ) { Integer res Id = map Throwable Flat ( throwable To Check ) ; if ( res Id != null ) { return res Id ; } else { throwable To Check = throwable To Check . get Cause ( ) ; depth T... | public Integer mapThrowable ( final Throwable throwable ) { Throwable throwableToCheck = throwable ; int depthToGo = _NUM ; while ( _BOOL ) { Integer resId = mapThrowableFlat ( throwableToCheck ) ; if ( resId != null ) { return resId ; } else { throwableToCheck = throwableToCheck . getCause ( ) ; depthToGo -- ; if ( de... | 117 |
java-test-1501 | java | What does the code create if necessary ? | keys in the process | public Object save ( Object entity ) { Object key = Property Utils . get Property Value ( entity , repository Metadata . get Identifier Property ( ) ) ; log . info ( STRING + key ) ; if ( key == null && key Generator != null ) { log . info ( STRING ) ; key = key Generator . generate ( ) ; log . debug ( STRING + key ) ;... | public Object save ( Object entity ) { Object key = PropertyUtils . getPropertyValue ( entity , repositoryMetadata . getIdentifierProperty ( ) ) ; log . info ( STRING + key ) ; if ( key == null && keyGenerator != null ) { log . info ( STRING ) ; key = keyGenerator . generate ( ) ; log . debug ( STRING + key ) ; Propert... | 130 |
java-test-1502 | java | What does the code save creating keys in the process , if necessary ? | the entity in the underlying data store | public Object save ( Object entity ) { Object key = Property Utils . get Property Value ( entity , repository Metadata . get Identifier Property ( ) ) ; log . info ( STRING + key ) ; if ( key == null && key Generator != null ) { log . info ( STRING ) ; key = key Generator . generate ( ) ; log . debug ( STRING + key ) ;... | public Object save ( Object entity ) { Object key = PropertyUtils . getPropertyValue ( entity , repositoryMetadata . getIdentifierProperty ( ) ) ; log . info ( STRING + key ) ; if ( key == null && keyGenerator != null ) { log . info ( STRING ) ; key = keyGenerator . generate ( ) ; log . debug ( STRING + key ) ; Propert... | 130 |
java-test-1503 | java | What does it perform ? | any concentration | private void remove Gaps ( int nodes Level [ ] ) { int temp = m nodes . size ( ) ; int temp 2 = graph Matrix [ NUM ] . length , temp Cnt = NUM ; for ( int n = NUM ; n < temp ; n ++ ) { for ( int i = NUM ; i < temp 2 ; i ++ ) { int len = graph Matrix . length ; if ( graph Matrix [ n ] [ i ] > NUM ) { if ( nodes Level [ ... | private void removeGaps ( int nodesLevel [ ] ) { int temp = m_nodes . size ( ) ; int temp2 = graphMatrix [ _NUM ] . length , tempCnt = _NUM ; for ( int n = _NUM ; n < temp ; n ++ ) { for ( int i = _NUM ; i < temp2 ; i ++ ) { int len = graphMatrix . length ; if ( graphMatrix [ n ] [ i ] > _NUM ) { if ( nodesLevel [ i ] ... | 652 |
java-test-1508 | java | What do an existing rule match ? | the new acl rule | private boolean check Rule Match ( ACL Rule new Rule ) { List < Integer > allow Rule List = new Array List < > ( ) ; for ( ACL Rule existing Rule : get Rules ( ) ) { if ( new Rule . match ( existing Rule ) ) { return BOOL ; } if ( existing Rule . get Action ( ) == Action . ALLOW && new Rule . get Action ( ) == Action .... | private boolean checkRuleMatch ( ACLRule newRule ) { List < Integer > allowRuleList = new ArrayList < > ( ) ; for ( ACLRule existingRule : getRules ( ) ) { if ( newRule . match ( existingRule ) ) { return _BOOL ; } if ( existingRule . getAction ( ) == Action . ALLOW && newRule . getAction ( ) == Action . DENY ) { if ( ... | 137 |
java-test-1509 | java | What do existing allow ? | rules matches the new denying rule | private boolean check Rule Match ( ACL Rule new Rule ) { List < Integer > allow Rule List = new Array List < > ( ) ; for ( ACL Rule existing Rule : get Rules ( ) ) { if ( new Rule . match ( existing Rule ) ) { return BOOL ; } if ( existing Rule . get Action ( ) == Action . ALLOW && new Rule . get Action ( ) == Action .... | private boolean checkRuleMatch ( ACLRule newRule ) { List < Integer > allowRuleList = new ArrayList < > ( ) ; for ( ACLRule existingRule : getRules ( ) ) { if ( newRule . match ( existingRule ) ) { return _BOOL ; } if ( existingRule . getAction ( ) == Action . ALLOW && newRule . getAction ( ) == Action . DENY ) { if ( ... | 137 |
java-test-1510 | java | What does the new denying rule match ? | existing allowing rules | private boolean check Rule Match ( ACL Rule new Rule ) { List < Integer > allow Rule List = new Array List < > ( ) ; for ( ACL Rule existing Rule : get Rules ( ) ) { if ( new Rule . match ( existing Rule ) ) { return BOOL ; } if ( existing Rule . get Action ( ) == Action . ALLOW && new Rule . get Action ( ) == Action .... | private boolean checkRuleMatch ( ACLRule newRule ) { List < Integer > allowRuleList = new ArrayList < > ( ) ; for ( ACLRule existingRule : getRules ( ) ) { if ( newRule . match ( existingRule ) ) { return _BOOL ; } if ( existingRule . getAction ( ) == Action . ALLOW && newRule . getAction ( ) == Action . DENY ) { if ( ... | 137 |
java-test-1511 | java | What matches existing allowing rules ? | the new denying rule | private boolean check Rule Match ( ACL Rule new Rule ) { List < Integer > allow Rule List = new Array List < > ( ) ; for ( ACL Rule existing Rule : get Rules ( ) ) { if ( new Rule . match ( existing Rule ) ) { return BOOL ; } if ( existing Rule . get Action ( ) == Action . ALLOW && new Rule . get Action ( ) == Action .... | private boolean checkRuleMatch ( ACLRule newRule ) { List < Integer > allowRuleList = new ArrayList < > ( ) ; for ( ACLRule existingRule : getRules ( ) ) { if ( newRule . match ( existingRule ) ) { return _BOOL ; } if ( existingRule . getAction ( ) == Action . ALLOW && newRule . getAction ( ) == Action . DENY ) { if ( ... | 137 |
java-test-1512 | java | What does the code add ? | a load name for the car type | public void add Name ( String type , String name ) { if ( contains Name ( type , name ) ) { return ; } List < Car Load > loads = list Car Loads . get ( type ) ; if ( loads == null ) { log . debug ( STRING , type ) ; return ; } loads . add ( NUM , new Car Load ( name ) ) ; max Name Length = NUM ; set Dirty And Fire Prop... | public void addName ( String type , String name ) { if ( containsName ( type , name ) ) { return ; } List < CarLoad > loads = listCarLoads . get ( type ) ; if ( loads == null ) { log . debug ( STRING , type ) ; return ; } loads . add ( _NUM , new CarLoad ( name ) ) ; maxNameLength = _NUM ; setDirtyAndFirePropertyChange... | 98 |
java-test-1513 | java | What does the code create ? | a new visitor that produces a plain text string representation of a parsed wikipedia article | public Plain Text Converter ( boolean enumerate Section ) { Simple Wiki Configuration config = null ; try { new Simple Wiki Configuration ( Wiki Constants . SWEBLE CONFIG ) ; } catch ( IO Exception e ) { e . print Stack Trace ( ) ; } catch ( JAXB Exception e ) { e . print Stack Trace ( ) ; } this . config = config ; th... | public PlainTextConverter ( boolean enumerateSection ) { SimpleWikiConfiguration config = null ; try { new SimpleWikiConfiguration ( WikiConstants . SWEBLE_CONFIG ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } catch ( JAXBException e ) { e . printStackTrace ( ) ; } this . config = config ; this . wrapCol =... | 89 |
java-test-1514 | java | What does a new visitor produce ? | a plain text string representation of a parsed wikipedia article | public Plain Text Converter ( boolean enumerate Section ) { Simple Wiki Configuration config = null ; try { new Simple Wiki Configuration ( Wiki Constants . SWEBLE CONFIG ) ; } catch ( IO Exception e ) { e . print Stack Trace ( ) ; } catch ( JAXB Exception e ) { e . print Stack Trace ( ) ; } this . config = config ; th... | public PlainTextConverter ( boolean enumerateSection ) { SimpleWikiConfiguration config = null ; try { new SimpleWikiConfiguration ( WikiConstants . SWEBLE_CONFIG ) ; } catch ( IOException e ) { e . printStackTrace ( ) ; } catch ( JAXBException e ) { e . printStackTrace ( ) ; } this . config = config ; this . wrapCol =... | 89 |
java-test-1515 | java | What does the code generate ? | the final jar | public void generate ( ) throws File Not Found Exception , IO Exception { Tree Map < String , byte [ ] > all = new Tree Map < String , byte [ ] > ( ) ; for ( Class < ? > clazz : m Inject Classes ) { String name = class To Entry Path ( clazz ) ; Input Stream is = Class Loader . get System Resource As Stream ( name ) ; C... | public void generate ( ) throws FileNotFoundException , IOException { TreeMap < String , byte [ ] > all = new TreeMap < String , byte [ ] > ( ) ; for ( Class < ? > clazz : mInjectClasses ) { String name = classToEntryPath ( clazz ) ; InputStream is = ClassLoader . getSystemResourceAsStream ( name ) ; ClassReader cr = n... | 355 |
java-test-1519 | java | What does this return ? | the nearest defining / declaring method | public static I Method Binding find Overridden Method ( I Method Binding overriding , boolean test Visibility ) { List < I Method Binding > find Overridden Methods = find Overridden Methods ( overriding , test Visibility , BOOL ) ; if ( find Overridden Methods . is Empty ( ) ) { return null ; } return find Overridden M... | public static IMethodBinding findOverriddenMethod ( IMethodBinding overriding , boolean testVisibility ) { List < IMethodBinding > findOverriddenMethods = findOverriddenMethods ( overriding , testVisibility , _BOOL ) ; if ( findOverriddenMethods . isEmpty ( ) ) { return null ; } return findOverriddenMethods . get ( _NU... | 68 |
java-test-1520 | java | What does the code find ? | the method that is overridden by the given method | public static I Method Binding find Overridden Method ( I Method Binding overriding , boolean test Visibility ) { List < I Method Binding > find Overridden Methods = find Overridden Methods ( overriding , test Visibility , BOOL ) ; if ( find Overridden Methods . is Empty ( ) ) { return null ; } return find Overridden M... | public static IMethodBinding findOverriddenMethod ( IMethodBinding overriding , boolean testVisibility ) { List < IMethodBinding > findOverriddenMethods = findOverriddenMethods ( overriding , testVisibility , _BOOL ) ; if ( findOverriddenMethods . isEmpty ( ) ) { return null ; } return findOverriddenMethods . get ( _NU... | 68 |
java-test-1521 | java | In which direction do number of i / o threads return from a threads parameter ( ? | where 1 thread is reserved for main processing | public static int parse IO Threads ( Integer threads ) { final int result = threads == null ? Math . min ( Constants . MAX IO THREADS , Environment . default Threads ( ) ) : threads ; return Math . max ( NUM , result - NUM ) ; } | public static int parseIOThreads ( Integer threads ) { final int result = threads == null ? Math . min ( Constants . MAX_IO_THREADS , Environment . defaultThreads ( ) ) : threads ; return Math . max ( _NUM , result - _NUM ) ; } | 52 |
java-test-1522 | java | What does the code initialize ? | the various overlay polygons with their vertices | public void init Polys ( ) { Affine Transform Facing Rotate = new Affine Transform ( ) ; Polygon facing Poly tmp = new Polygon ( ) ; facing Poly tmp . add Point ( NUM , NUM ) ; facing Poly tmp . add Point ( NUM , NUM ) ; facing Poly tmp . add Point ( NUM , NUM ) ; facing Poly tmp . add Point ( NUM , NUM ) ; facing Poly... | public void initPolys ( ) { AffineTransform FacingRotate = new AffineTransform ( ) ; Polygon facingPoly_tmp = new Polygon ( ) ; facingPoly_tmp . addPoint ( _NUM , _NUM ) ; facingPoly_tmp . addPoint ( _NUM , _NUM ) ; facingPoly_tmp . addPoint ( _NUM , _NUM ) ; facingPoly_tmp . addPoint ( _NUM , _NUM ) ; facingPoly_tmp .... | 540 |
java-test-1523 | java | What does the code render ? | an aggregation function with distinct and parameter expressions | protected static void render Aggregation ( String Writer writer , String name , boolean distinct , List < Expression > children ) { writer . write ( name ) ; writer . write ( STRING ) ; if ( distinct ) { writer . write ( STRING ) ; } String delimiter = STRING ; for ( Expression param : children ) { writer . write ( del... | protected static void renderAggregation ( StringWriter writer , String name , boolean distinct , List < Expression > children ) { writer . write ( name ) ; writer . write ( STRING ) ; if ( distinct ) { writer . write ( STRING ) ; } String delimiter = STRING ; for ( Expression param : children ) { writer . write ( delim... | 97 |
java-test-1524 | java | What does the code get from the cursor ? | the contact name | private String contact ( Context context , Easy Cursor c ) { String contact = c . get String ( aliased ( Syncs Join All . CONTACT NAME ) ) ; if ( contact == null ) { contact = context . get String ( R . string . non contact ) ; } return contact ; } | private String contact ( Context context , EasyCursor c ) { String contact = c . getString ( aliased_ ( SyncsJoinAll . CONTACT_NAME ) ) ; if ( contact == null ) { contact = context . getString ( R . string . non_contact ) ; } return contact ; } | 58 |
java-test-1527 | java | What does the code leave ? | the register edit mode | private void leave Edit Mode ( final boolean update ) { if ( update ) { final Register Information Internal edited Register = m register Model . get Register Information ( this . m edited Register ) ; if ( ! Objects . equals ( m edit Value , edited Register . get Value ( ) ) ) { begin Register Update ( ) ; m register M... | private void leaveEditMode ( final boolean update ) { if ( update ) { final RegisterInformationInternal editedRegister = m_registerModel . getRegisterInformation ( this . m_editedRegister ) ; if ( ! Objects . equals ( m_editValue , editedRegister . getValue ( ) ) ) { beginRegisterUpdate ( ) ; m_registerModel . setValue... | 121 |
java-test-1528 | java | For what purpose was the maximum amount logged ? | for ( type , value , arg ) under ( type , value , arg_max ) | private void log Max ( String type , String value , String arg , long amount ) { Key key = new Key ( type , value , arg + MAXIMUM INDICATOR ) ; synchronized ( counts ) { Long old Max = counts . get ( key ) ; if ( old Max == null ) { old Max = amount ; } counts . put ( key , Math . max ( old Max , amount ) ) ; } } | private void logMax ( String type , String value , String arg , long amount ) { Key key = new Key ( type , value , arg + MAXIMUM_INDICATOR ) ; synchronized ( counts ) { Long oldMax = counts . get ( key ) ; if ( oldMax == null ) { oldMax = amount ; } counts . put ( key , Math . max ( oldMax , amount ) ) ; } } | 83 |
java-test-1529 | java | What do a boolean represent ? | the outcome of the process | public default Match Result partialmatch ( String str ) { List < Match Result > results = find ( str , NUM ) ; if ( results . is Empty ( ) ) { return new Match Result ( BOOL ) ; } else { return results . get ( NUM ) ; } } | public default MatchResult partialmatch ( String str ) { List < MatchResult > results = find ( str , _NUM ) ; if ( results . isEmpty ( ) ) { return new MatchResult ( _BOOL ) ; } else { return results . get ( _NUM ) ; } } | 55 |
java-test-1530 | java | What does the matching result contain ? | a boolean representing the outcome of the process , as well ( if the match is successful ) as the boundaries of the match and the extracted slot values | public default Match Result partialmatch ( String str ) { List < Match Result > results = find ( str , NUM ) ; if ( results . is Empty ( ) ) { return new Match Result ( BOOL ) ; } else { return results . get ( NUM ) ; } } | public default MatchResult partialmatch ( String str ) { List < MatchResult > results = find ( str , _NUM ) ; if ( results . isEmpty ( ) ) { return new MatchResult ( _BOOL ) ; } else { return results . get ( _NUM ) ; } } | 55 |
java-test-1531 | java | What contains a boolean representing the outcome of the process , as well ( if the match is successful ) as the boundaries of the match and the extracted slot values ? | the matching result | public default Match Result partialmatch ( String str ) { List < Match Result > results = find ( str , NUM ) ; if ( results . is Empty ( ) ) { return new Match Result ( BOOL ) ; } else { return results . get ( NUM ) ; } } | public default MatchResult partialmatch ( String str ) { List < MatchResult > results = find ( str , _NUM ) ; if ( results . isEmpty ( ) ) { return new MatchResult ( _BOOL ) ; } else { return results . get ( _NUM ) ; } } | 55 |
java-test-1532 | 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-1533 | 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-1534 | 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-1535 | 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-1536 | 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-1537 | 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-1538 | 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-1539 | 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-1540 | 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-1541 | 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-1542 | java | How does the code return a list of name / value pairs ? | in the order they occur in the query | public static List < Name Value Pair > parse Query Ordered ( String query ) throws URI Syntax Exception { List < Name Value Pair > parameters = new Array List < Name Value Pair > ( ) ; if ( query == null ) { return parameters ; } URI Query Tokenizer uqt = new URI Query Tokenizer ( query ) ; while ( uqt . has More Token... | public static List < NameValuePair > parseQueryOrdered ( String query ) throws URISyntaxException { List < NameValuePair > parameters = new ArrayList < NameValuePair > ( ) ; if ( query == null ) { return parameters ; } URIQueryTokenizer uqt = new URIQueryTokenizer ( query ) ; while ( uqt . hasMoreTokens ( ) ) { String ... | 166 |
java-test-1543 | java | What does the code draw ? | a horizontal scale border | private void draw Horizontal Scale ( final boolean top , final int scale , final int pixelperscale , final int offset , final Long color Naming , final Long color Scale , final String name ) { final int y = ( top ) ? this . topborder : this . height - this . bottomborder ; int x = this . leftborder ; int s = offset ; w... | private void drawHorizontalScale ( final boolean top , final int scale , final int pixelperscale , final int offset , final Long colorNaming , final Long colorScale , final String name ) { final int y = ( top ) ? this . topborder : this . height - this . bottomborder ; int x = this . leftborder ; int s = offset ; while... | 286 |
java-test-1546 | java | What noticed that # of subframes sometimes underreported because these cast to an int . rounding would sometimes overreport , however . observed that a tolerance of . 000001 would define when to round up . this appeared to be causing gaps at zone boundaries , since a coverage box could think it doesn ' t have a certain... | the number of subframes horizontally within this coverage box | public int horizontal Subframes ( ) { double value = Math . abs ( ( se lon - nw lon ) / subframe Lon Interval ) ; int lower = ( int ) value ; int upper = lower + NUM ; if ( upper - value < NUM ) { return upper ; } else return lower ; } | public int horizontalSubframes ( ) { double value = Math . abs ( ( se_lon - nw_lon ) / subframeLonInterval ) ; int lower = ( int ) value ; int upper = lower + _NUM ; if ( upper - value < _NUM ) { return upper ; } else return lower ; } | 60 |
java-test-1547 | java | How does a bundle upgrade ? | by removing the old bundle if it is installed and replacing it with the new | public void upgrade Bundle ( Path new Bundle , String symbolic Name ) throws Update Exception { List < Bundle > installed Bundles = get Bundles ( symbolic Name ) ; if ( ! installed Bundles . is Empty ( ) ) { replace Bundle ( installed Bundles , new Bundle ) ; } else { install Bundle ( new Bundle ) ; } } | public void upgradeBundle ( Path newBundle , String symbolicName ) throws UpdateException { List < Bundle > installedBundles = getBundles ( symbolicName ) ; if ( ! installedBundles . isEmpty ( ) ) { replaceBundle ( installedBundles , newBundle ) ; } else { installBundle ( newBundle ) ; } } | 65 |
java-test-1548 | java | What do it replace ? | with the new | public void upgrade Bundle ( Path new Bundle , String symbolic Name ) throws Update Exception { List < Bundle > installed Bundles = get Bundles ( symbolic Name ) ; if ( ! installed Bundles . is Empty ( ) ) { replace Bundle ( installed Bundles , new Bundle ) ; } else { install Bundle ( new Bundle ) ; } } | public void upgradeBundle ( Path newBundle , String symbolicName ) throws UpdateException { List < Bundle > installedBundles = getBundles ( symbolicName ) ; if ( ! installedBundles . isEmpty ( ) ) { replaceBundle ( installedBundles , newBundle ) ; } else { installBundle ( newBundle ) ; } } | 65 |
java-test-1549 | java | What does the code execute in parallel ? | the given actions | public void perform ( List < Action < Void > > actions , long time Bound In Millis ) { List < Time Bounded Thread < Void > > tasks = create Time Bounded Threads ( actions ) ; try { executer Service . invoke All ( tasks , time Bound In Millis , Time Unit . MILLISECONDS ) ; } catch ( Throwable thrown ) { logger . error (... | public void perform ( List < Action < Void > > actions , long timeBoundInMillis ) { List < TimeBoundedThread < Void > > tasks = createTimeBoundedThreads ( actions ) ; try { _executerService . invokeAll ( tasks , timeBoundInMillis , TimeUnit . MILLISECONDS ) ; } catch ( Throwable thrown ) { _logger . error ( String . fo... | 85 |
java-test-1550 | java | Till when does the code return ? | when all actions are completed or until the given timeout elapses | public void perform ( List < Action < Void > > actions , long time Bound In Millis ) { List < Time Bounded Thread < Void > > tasks = create Time Bounded Threads ( actions ) ; try { executer Service . invoke All ( tasks , time Bound In Millis , Time Unit . MILLISECONDS ) ; } catch ( Throwable thrown ) { logger . error (... | public void perform ( List < Action < Void > > actions , long timeBoundInMillis ) { List < TimeBoundedThread < Void > > tasks = createTimeBoundedThreads ( actions ) ; try { _executerService . invokeAll ( tasks , timeBoundInMillis , TimeUnit . MILLISECONDS ) ; } catch ( Throwable thrown ) { _logger . error ( String . fo... | 85 |
java-test-1551 | java | For what purpose does the cleaned hostname return ? | for the input sent by the client | public static String clean Virtual Host ( String host ) { host = substring Before ( host , STRING ) ; if ( host . ends With ( STRING ) ) { host = host . substring ( NUM , host . length ( ) - NUM ) ; } return host ; } | public static String cleanVirtualHost ( String host ) { host = substringBefore ( host , STRING ) ; if ( host . endsWith ( STRING ) ) { host = host . substring ( _NUM , host . length ( ) - _NUM ) ; } return host ; } | 54 |
java-test-1552 | java | What has access to this table ? | the current session | public static String format Type ( Connection conn , int pg Type , int type Mod ) throws SQL Exception { Prepared Statement prep = conn . prepare Statement ( STRING ) ; prep . set Int ( NUM , pg Type ) ; prep . set Int ( NUM , type Mod ) ; Result Set rs = prep . execute Query ( ) ; if ( rs . next ( ) ) { return rs . ge... | public static String formatType ( Connection conn , int pgType , int typeMod ) throws SQLException { PreparedStatement prep = conn . prepareStatement ( STRING ) ; prep . setInt ( _NUM , pgType ) ; prep . setInt ( _NUM , typeMod ) ; ResultSet rs = prep . executeQuery ( ) ; if ( rs . next ( ) ) { return rs . getString ( ... | 89 |
java-test-1553 | java | What did the current session have ? | access to this table | public static String format Type ( Connection conn , int pg Type , int type Mod ) throws SQL Exception { Prepared Statement prep = conn . prepare Statement ( STRING ) ; prep . set Int ( NUM , pg Type ) ; prep . set Int ( NUM , type Mod ) ; Result Set rs = prep . execute Query ( ) ; if ( rs . next ( ) ) { return rs . ge... | public static String formatType ( Connection conn , int pgType , int typeMod ) throws SQLException { PreparedStatement prep = conn . prepareStatement ( STRING ) ; prep . setInt ( _NUM , pgType ) ; prep . setInt ( _NUM , typeMod ) ; ResultSet rs = prep . executeQuery ( ) ; if ( rs . next ( ) ) { return rs . getString ( ... | 89 |
java-test-1554 | java | What does the code create ? | a omgraphic from the shape file data | protected OM Graphic make Esri Graphic ( Binary File shp File , Drawing Attributes drawing Attributes , Object point Representation , Read Byte Tracker byte Tracker ) throws IO Exception , Format Exception { Esri Graphic eg = null ; shp File . byte Order ( BOOL ) ; int shape Type = shp File . read Integer ( ) ; byte Tr... | protected OMGraphic makeEsriGraphic ( BinaryFile shpFile , DrawingAttributes drawingAttributes , Object pointRepresentation , ReadByteTracker byteTracker ) throws IOException , FormatException { EsriGraphic eg = null ; shpFile . byteOrder ( _BOOL ) ; int shapeType = shpFile . readInteger ( ) ; byteTracker . addRead ( _... | 434 |
java-test-1558 | java | What does the code add if creating tag in default namespace ? | a tag . assumed format of tag attribute : namespace : tag1 / tag2 / tag3 or tag1 / tag2 / tag3 | public Aem Tags add Tag ( String tag ) throws Denied Tag Exception { input . click ( ) ; input . send Keys ( STRING ) ; String Tokenizer tag Elements = new String Tokenizer ( tag , STRING , BOOL ) ; final int tags Count = get Tag Count ( ) ; while ( tag Elements . has More Tokens ( ) ) { input . send Keys ( tag Element... | public AemTags addTag ( String tag ) throws DeniedTagException { input . click ( ) ; input . sendKeys ( STRING ) ; StringTokenizer tagElements = new StringTokenizer ( tag , STRING , _BOOL ) ; final int tagsCount = getTagCount ( ) ; while ( tagElements . hasMoreTokens ( ) ) { input . sendKeys ( tagElements . nextToken (... | 126 |
java-test-1562 | java | What does the code calculate attempting to preserve the angular orientation of the display across transitions ? | the angular bounds of the layout | private void calc Angular Bounds ( Node Item r ) { if ( m prev Root == null || ! m prev Root . is Valid ( ) || r == m prev Root ) { m prev Root = r ; return ; } Node Item p = m prev Root ; while ( BOOL ) { Node Item pp = ( Node Item ) p . get Parent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m prev Root ... | private void calcAngularBounds ( NodeItem r ) { if ( m_prevRoot == null || ! m_prevRoot . isValid ( ) || r == m_prevRoot ) { m_prevRoot = r ; return ; } NodeItem p = m_prevRoot ; while ( _BOOL ) { NodeItem pp = ( NodeItem ) p . getParent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m_prevRoot = r ; return ... | 280 |
java-test-1563 | java | What does the code attempt ? | to preserve the angular orientation of the display across transitions | private void calc Angular Bounds ( Node Item r ) { if ( m prev Root == null || ! m prev Root . is Valid ( ) || r == m prev Root ) { m prev Root = r ; return ; } Node Item p = m prev Root ; while ( BOOL ) { Node Item pp = ( Node Item ) p . get Parent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m prev Root ... | private void calcAngularBounds ( NodeItem r ) { if ( m_prevRoot == null || ! m_prevRoot . isValid ( ) || r == m_prevRoot ) { m_prevRoot = r ; return ; } NodeItem p = m_prevRoot ; while ( _BOOL ) { NodeItem pp = ( NodeItem ) p . getParent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m_prevRoot = r ; return ... | 280 |
java-test-1564 | java | Does the code preserve the angular orientation of the display across transitions ? | No | private void calc Angular Bounds ( Node Item r ) { if ( m prev Root == null || ! m prev Root . is Valid ( ) || r == m prev Root ) { m prev Root = r ; return ; } Node Item p = m prev Root ; while ( BOOL ) { Node Item pp = ( Node Item ) p . get Parent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m prev Root ... | private void calcAngularBounds ( NodeItem r ) { if ( m_prevRoot == null || ! m_prevRoot . isValid ( ) || r == m_prevRoot ) { m_prevRoot = r ; return ; } NodeItem p = m_prevRoot ; while ( _BOOL ) { NodeItem pp = ( NodeItem ) p . getParent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m_prevRoot = r ; return ... | 280 |
java-test-1565 | java | What does the code create ? | a new featuredefinition that contains a subset of the features in this | public Feature Definition subset ( String [ ] feature Names To Drop ) { List < Integer > feature Indices To Drop = new Array List < Integer > ( ) ; for ( String feature Name : feature Names To Drop ) { int feature Index ; try { feature Index = get Feature Index ( feature Name ) ; feature Indices To Drop . add ( feature... | public FeatureDefinition subset ( String [ ] featureNamesToDrop ) { List < Integer > featureIndicesToDrop = new ArrayList < Integer > ( ) ; for ( String featureName : featureNamesToDrop ) { int featureIndex ; try { featureIndex = getFeatureIndex ( featureName ) ; featureIndicesToDrop . add ( featureIndex ) ; } catch ( ... | 230 |
java-test-1567 | java | What does the code write ? | a circle with a certain radius at a lat / lon location | public static void write ( float lat Point , float lon Point , float radius , Link Properties properties , Data Output Stream dos ) throws IO Exception { Link Circle . write ( lat Point , lon Point , radius , - NUM , - NUM , properties , dos ) ; } | public static void write ( float latPoint , float lonPoint , float radius , LinkProperties properties , DataOutputStream dos ) throws IOException { LinkCircle . write ( latPoint , lonPoint , radius , - _NUM , - _NUM , properties , dos ) ; } | 54 |
java-test-1568 | java | What is the code assumes ? | the radius is in decimal degrees | public static void write ( float lat Point , float lon Point , float radius , Link Properties properties , Data Output Stream dos ) throws IO Exception { Link Circle . write ( lat Point , lon Point , radius , - NUM , - NUM , properties , dos ) ; } | public static void write ( float latPoint , float lonPoint , float radius , LinkProperties properties , DataOutputStream dos ) throws IOException { LinkCircle . write ( latPoint , lonPoint , radius , - _NUM , - _NUM , properties , dos ) ; } | 54 |
java-test-1570 | java | What does p release ? | the destroylock | void reinitialize ( Input Stream input Stream , Region Event Impl event ) throws Timeout Exception , IO Exception , Class Not Found Exception { acquire Destroy Lock ( ) ; try { reinitialize destroy ( event ) ; recreate ( input Stream , null ) ; } finally { release Destroy Lock ( ) ; } } | void reinitialize ( InputStream inputStream , RegionEventImpl event ) throws TimeoutException , IOException , ClassNotFoundException { acquireDestroyLock ( ) ; try { reinitialize_destroy ( event ) ; recreate ( inputStream , null ) ; } finally { releaseDestroyLock ( ) ; } } | 58 |
java-test-1572 | java | For what purpose do we escape some characters in s ? | to be able to insert strings into java code | public static String java Escape ( String s ) { String Builder sb = new String Builder ( ) ; for ( int i = NUM ; i < s . length ( ) ; i ++ ) { char c = s . char At ( i ) ; switch ( c ) { case STRING : sb . append ( STRING ) ; break ; case STRING : sb . append ( STRING ) ; break ; case STRING : sb . append ( STRING ) ; ... | public static String javaEscape ( String s ) { StringBuilder sb = new StringBuilder ( ) ; for ( int i = _NUM ; i < s . length ( ) ; i ++ ) { char c = s . charAt ( i ) ; switch ( c ) { case STRING : sb . append ( STRING ) ; break ; case STRING : sb . append ( STRING ) ; break ; case STRING : sb . append ( STRING ) ; bre... | 183 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.