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-3334 | java | When is parses what ' s left of the target name in the specified tokenizer , and initializes the transient fields parses what ' s left of the target name in the specified tokenizer , and initializes the transient fields false ? | when parsing the local principals | private void parse Name ( String Tokenizer st , boolean peer ) { List vals = new Array List ( NUM ) ; outer : while ( BOOL ) { String cls ; do { if ( ! st . has More Tokens ( ) ) { break outer ; } cls = st . next Token ( ) ; } while ( cls . equals ( STRING ) ) ; if ( ! peer && cls . equals Ignore Case ( STRING ) ) { pa... | private void parseName ( StringTokenizer st , boolean peer ) { List vals = new ArrayList ( _NUM ) ; outer : while ( _BOOL ) { String cls ; do { if ( ! st . hasMoreTokens ( ) ) { break outer ; } cls = st . nextToken ( ) ; } while ( cls . equals ( STRING ) ) ; if ( ! peer && cls . equalsIgnoreCase ( STRING ) ) { parseNam... | 531 |
java-test-3335 | java | What does the code remove ? | multiple spaces | public static final String remove Multiple Spaces And Returns ( final String data ) { final String Builder all data = new String Builder ( data ) ; int i = NUM ; while ( i < all data . length ( ) ) { if ( ( ( all data . char At ( i ) == STRING ) && ( all data . char At ( i - NUM ) == STRING ) ) || ( ( all data . char A... | public static final String removeMultipleSpacesAndReturns ( final String data ) { final StringBuilder all_data = new StringBuilder ( data ) ; int i = _NUM ; while ( i < all_data . length ( ) ) { if ( ( ( all_data . charAt ( i ) == STRING ) && ( all_data . charAt ( i - _NUM ) == STRING ) ) || ( ( all_data . charAt ( i )... | 142 |
java-test-3336 | java | When did illegalargumentexception argument exception throw if the _ hosts propertey is determined to be a property placeholder ? | when nothing found | private void determine Hosts As Property ( ) { if ( hosts . starts With ( STRING ) && hosts . ends With ( STRING ) ) { String hosts Property = hosts . substring ( NUM , hosts . length ( ) - NUM ) ; hosts = Property Util . get Property ( hosts Property ) ; if ( hosts == null ) { throw new Illegal Argument Exception ( ST... | private void determineHostsAsProperty ( ) { if ( hosts . startsWith ( STRING ) && hosts . endsWith ( STRING ) ) { String hostsProperty = hosts . substring ( _NUM , hosts . length ( ) - _NUM ) ; hosts = PropertyUtil . getProperty ( hostsProperty ) ; if ( hosts == null ) { throw new IllegalArgumentException ( STRING + ho... | 83 |
java-test-3337 | java | In which direction is the output string written once the entire input string has been processed ? | back to the text area | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3338 | java | Where did the text string read in ? | from the data area | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3339 | java | When is the output string written back to the text area ? | once the entire input string has been processed | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3340 | java | Does this method convert them into hex characters ( i . e . every character read is represented as two hex characters ) ? | No | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3341 | java | What do the button say ? | ' hex ' | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3342 | java | What do the text data in the data area need ? | to be converted to a hex representation | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3343 | java | What is saying ' hex ' ? | the button | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3344 | java | In which direction did the text string read from the data area ? | in | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3345 | java | What read from the data area ? | the text string | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3346 | java | What needs to be converted to a hex representation ? | the text data in the data area | private void to Hex String ( ) { String sub Text = received Data . get Text ( ) ; String Buffer hex Text = new String Buffer ( ) ; byte [ ] sub Bytes = sub Text . get Bytes ( ) ; for ( int i = NUM ; i < sub Bytes . length ; i ++ ) { int byte Value = sub Bytes [ i ] ; if ( byte Value < NUM ) { byte Value += NUM ; } if (... | private void toHexString ( ) { String subText = receivedData . getText ( ) ; StringBuffer hexText = new StringBuffer ( ) ; byte [ ] subBytes = subText . getBytes ( ) ; for ( int i = _NUM ; i < subBytes . length ; i ++ ) { int byteValue = subBytes [ i ] ; if ( byteValue < _NUM ) { byteValue += _NUM ; } if ( byteValue < ... | 186 |
java-test-3347 | java | What does the code create ? | a set of virtual dice with the given number of faces that start with the given value | public MM Roll ( MM Random rng , int count , int start ) { super ( count , start ) ; this . total = rng . random Int ( this . faces ) + this . min ; all . add Element ( this . total ) ; } | public MMRoll ( MMRandom rng , int count , int start ) { super ( count , start ) ; this . total = rng . randomInt ( this . faces ) + this . min ; all . addElement ( this . total ) ; } | 51 |
java-test-3348 | java | What does the code create ? | a name from a sequence of lower - camel strings | public static Name lower Camel ( String ... pieces ) { List < Name Piece > name Pieces = new Array List < > ( ) ; for ( String piece : pieces ) { validate Camel ( piece , Check Case . LOWER ) ; name Pieces . add ( new Name Piece ( piece , Case Format . LOWER CAMEL ) ) ; } return new Name ( name Pieces ) ; } | public static Name lowerCamel ( String ... pieces ) { List < NamePiece > namePieces = new ArrayList < > ( ) ; for ( String piece : pieces ) { validateCamel ( piece , CheckCase . LOWER ) ; namePieces . add ( new NamePiece ( piece , CaseFormat . LOWER_CAMEL ) ) ; } return new Name ( namePieces ) ; } | 75 |
java-test-3352 | java | What does the code fetch ? | the definition of the named field | public DDF Field Definition find Field Defn ( String psz Field Name ) { for ( Iterator it = pao Field Defns . iterator ( ) ; it . has Next ( ) ; ) { DDF Field Definition ddffd = ( DDF Field Definition ) it . next ( ) ; String psz This Name = ddffd . get Name ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( ... | public DDFFieldDefinition findFieldDefn ( String pszFieldName ) { for ( Iterator it = paoFieldDefns . iterator ( ) ; it . hasNext ( ) ; ) { DDFFieldDefinition ddffd = ( DDFFieldDefinition ) it . next ( ) ; String pszThisName = ddffd . getName ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( STRING + pszFiel... | 139 |
java-test-3353 | java | What do this function find ? | one with the indicated field name | public DDF Field Definition find Field Defn ( String psz Field Name ) { for ( Iterator it = pao Field Defns . iterator ( ) ; it . has Next ( ) ; ) { DDF Field Definition ddffd = ( DDF Field Definition ) it . next ( ) ; String psz This Name = ddffd . get Name ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( ... | public DDFFieldDefinition findFieldDefn ( String pszFieldName ) { for ( Iterator it = paoFieldDefns . iterator ( ) ; it . hasNext ( ) ; ) { DDFFieldDefinition ddffd = ( DDFFieldDefinition ) it . next ( ) ; String pszThisName = ddffd . getName ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( STRING + pszFiel... | 139 |
java-test-3354 | java | What will this function scan to find one with the indicated field name ? | the ddffielddefn ' s on this module | public DDF Field Definition find Field Defn ( String psz Field Name ) { for ( Iterator it = pao Field Defns . iterator ( ) ; it . has Next ( ) ; ) { DDF Field Definition ddffd = ( DDF Field Definition ) it . next ( ) ; String psz This Name = ddffd . get Name ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( ... | public DDFFieldDefinition findFieldDefn ( String pszFieldName ) { for ( Iterator it = paoFieldDefns . iterator ( ) ; it . hasNext ( ) ; ) { DDFFieldDefinition ddffd = ( DDFFieldDefinition ) it . next ( ) ; String pszThisName = ddffd . getName ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( STRING + pszFiel... | 139 |
java-test-3355 | java | For what purpose will this function scan the ddffielddefn ' s on this module ? | to find one with the indicated field name | public DDF Field Definition find Field Defn ( String psz Field Name ) { for ( Iterator it = pao Field Defns . iterator ( ) ; it . has Next ( ) ; ) { DDF Field Definition ddffd = ( DDF Field Definition ) it . next ( ) ; String psz This Name = ddffd . get Name ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( ... | public DDFFieldDefinition findFieldDefn ( String pszFieldName ) { for ( Iterator it = paoFieldDefns . iterator ( ) ; it . hasNext ( ) ; ) { DDFFieldDefinition ddffd = ( DDFFieldDefinition ) it . next ( ) ; String pszThisName = ddffd . getName ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( STRING + pszFiel... | 139 |
java-test-3357 | java | What should the specified method terminate ? | the call graph | public boolean is terminal ( Method Or Method Context mc ) { Stack < Soot Method > sys stack = new Stack < Soot Method > ( ) ; boolean result ; if ( ! is system ( mc . method ( ) ) ) result = BOOL ; else { if ( ! process callbacks ) result = BOOL ; else { if ( ( stack . size ( ) > NUM ) && is system ( stack . peek ( ) ... | public boolean is_terminal ( MethodOrMethodContext mc ) { Stack < SootMethod > sys_stack = new Stack < SootMethod > ( ) ; boolean result ; if ( ! is_system ( mc . method ( ) ) ) result = _BOOL ; else { if ( ! process_callbacks ) result = _BOOL ; else { if ( ( stack . size ( ) > _NUM ) && is_system ( stack . peek ( ) ) ... | 153 |
java-test-3358 | java | Do system calls have callbacks into application code ? | No | public boolean is terminal ( Method Or Method Context mc ) { Stack < Soot Method > sys stack = new Stack < Soot Method > ( ) ; boolean result ; if ( ! is system ( mc . method ( ) ) ) result = BOOL ; else { if ( ! process callbacks ) result = BOOL ; else { if ( ( stack . size ( ) > NUM ) && is system ( stack . peek ( ) ... | public boolean is_terminal ( MethodOrMethodContext mc ) { Stack < SootMethod > sys_stack = new Stack < SootMethod > ( ) ; boolean result ; if ( ! is_system ( mc . method ( ) ) ) result = _BOOL ; else { if ( ! process_callbacks ) result = _BOOL ; else { if ( ( stack . size ( ) > _NUM ) && is_system ( stack . peek ( ) ) ... | 153 |
java-test-3359 | java | Where is the call graph terminated ? | on system calls that do not have callbacks into application code | public boolean is terminal ( Method Or Method Context mc ) { Stack < Soot Method > sys stack = new Stack < Soot Method > ( ) ; boolean result ; if ( ! is system ( mc . method ( ) ) ) result = BOOL ; else { if ( ! process callbacks ) result = BOOL ; else { if ( ( stack . size ( ) > NUM ) && is system ( stack . peek ( ) ... | public boolean is_terminal ( MethodOrMethodContext mc ) { Stack < SootMethod > sys_stack = new Stack < SootMethod > ( ) ; boolean result ; if ( ! is_system ( mc . method ( ) ) ) result = _BOOL ; else { if ( ! process_callbacks ) result = _BOOL ; else { if ( ( stack . size ( ) > _NUM ) && is_system ( stack . peek ( ) ) ... | 153 |
java-test-3360 | java | What is terminated on system calls that do not have callbacks into application code ? | the call graph | public boolean is terminal ( Method Or Method Context mc ) { Stack < Soot Method > sys stack = new Stack < Soot Method > ( ) ; boolean result ; if ( ! is system ( mc . method ( ) ) ) result = BOOL ; else { if ( ! process callbacks ) result = BOOL ; else { if ( ( stack . size ( ) > NUM ) && is system ( stack . peek ( ) ... | public boolean is_terminal ( MethodOrMethodContext mc ) { Stack < SootMethod > sys_stack = new Stack < SootMethod > ( ) ; boolean result ; if ( ! is_system ( mc . method ( ) ) ) result = _BOOL ; else { if ( ! process_callbacks ) result = _BOOL ; else { if ( ( stack . size ( ) > _NUM ) && is_system ( stack . peek ( ) ) ... | 153 |
java-test-3361 | java | What do not have callbacks into application code ? | system calls | public boolean is terminal ( Method Or Method Context mc ) { Stack < Soot Method > sys stack = new Stack < Soot Method > ( ) ; boolean result ; if ( ! is system ( mc . method ( ) ) ) result = BOOL ; else { if ( ! process callbacks ) result = BOOL ; else { if ( ( stack . size ( ) > NUM ) && is system ( stack . peek ( ) ... | public boolean is_terminal ( MethodOrMethodContext mc ) { Stack < SootMethod > sys_stack = new Stack < SootMethod > ( ) ; boolean result ; if ( ! is_system ( mc . method ( ) ) ) result = _BOOL ; else { if ( ! process_callbacks ) result = _BOOL ; else { if ( ( stack . size ( ) > _NUM ) && is_system ( stack . peek ( ) ) ... | 153 |
java-test-3362 | java | What do system calls not have ? | callbacks into application code | public boolean is terminal ( Method Or Method Context mc ) { Stack < Soot Method > sys stack = new Stack < Soot Method > ( ) ; boolean result ; if ( ! is system ( mc . method ( ) ) ) result = BOOL ; else { if ( ! process callbacks ) result = BOOL ; else { if ( ( stack . size ( ) > NUM ) && is system ( stack . peek ( ) ... | public boolean is_terminal ( MethodOrMethodContext mc ) { Stack < SootMethod > sys_stack = new Stack < SootMethod > ( ) ; boolean result ; if ( ! is_system ( mc . method ( ) ) ) result = _BOOL ; else { if ( ! process_callbacks ) result = _BOOL ; else { if ( ( stack . size ( ) > _NUM ) && is_system ( stack . peek ( ) ) ... | 153 |
java-test-3363 | java | What should terminate the call graph ? | the specified method | public boolean is terminal ( Method Or Method Context mc ) { Stack < Soot Method > sys stack = new Stack < Soot Method > ( ) ; boolean result ; if ( ! is system ( mc . method ( ) ) ) result = BOOL ; else { if ( ! process callbacks ) result = BOOL ; else { if ( ( stack . size ( ) > NUM ) && is system ( stack . peek ( ) ... | public boolean is_terminal ( MethodOrMethodContext mc ) { Stack < SootMethod > sys_stack = new Stack < SootMethod > ( ) ; boolean result ; if ( ! is_system ( mc . method ( ) ) ) result = _BOOL ; else { if ( ! process_callbacks ) result = _BOOL ; else { if ( ( stack . size ( ) > _NUM ) && is_system ( stack . peek ( ) ) ... | 153 |
java-test-3364 | java | What does the code remove ? | all the entries from the cache | public synchronized long clear ( ) { long removed Size = NUM ; while ( BOOL ) { Map . Entry < Key , Value > entry = entries . poll First Entry ( ) ; if ( entry == null ) { break ; } Value value = entry . get Value ( ) ; removed Size += weighter . get Size ( value ) ; value . release ( ) ; } entries . clear ( ) ; return... | public synchronized long clear ( ) { long removedSize = _NUM ; while ( _BOOL ) { Map . Entry < Key , Value > entry = entries . pollFirstEntry ( ) ; if ( entry == null ) { break ; } Value value = entry . getValue ( ) ; removedSize += weighter . getSize ( value ) ; value . release ( ) ; } entries . clear ( ) ; return siz... | 93 |
java-test-3366 | java | What does each byte represent ? | two characters of the hex string | public byte [ ] convert Hex String To Binary ( String hex String ) throws Illegal Argument Exception { int length = hex String . length ( ) ; if ( length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING + length + STRING + hex String ) ; } byte [ ] binary = new byte [ length / NUM ] ; for ( int i = NUM ; ... | public byte [ ] convertHexStringToBinary ( String hexString ) throws IllegalArgumentException { int length = hexString . length ( ) ; if ( length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING + length + STRING + hexString ) ; } byte [ ] binary = new byte [ length / _NUM ] ; for ( int i = _NUM ; i < len... | 173 |
java-test-3367 | java | What does the code convert into a binary representation where each byte represents two characters of the hex string . <p> the hex characters may be upper or lower case ? | the provided hex - string | public byte [ ] convert Hex String To Binary ( String hex String ) throws Illegal Argument Exception { int length = hex String . length ( ) ; if ( length % NUM != NUM ) { throw new Illegal Argument Exception ( STRING + length + STRING + hex String ) ; } byte [ ] binary = new byte [ length / NUM ] ; for ( int i = NUM ; ... | public byte [ ] convertHexStringToBinary ( String hexString ) throws IllegalArgumentException { int length = hexString . length ( ) ; if ( length % _NUM != _NUM ) { throw new IllegalArgumentException ( STRING + length + STRING + hexString ) ; } byte [ ] binary = new byte [ length / _NUM ] ; for ( int i = _NUM ; i < len... | 173 |
java-test-3368 | java | What does the code deploy to the given context path ? | the war | protected void deploy ( Http Servlet Response response , String context Path , String war URL ) throws IO Exception { String context = context Path ; boolean error = BOOL ; if ( context == null ) { File file = new File ( war URL ) ; String file Name = file . get Name ( ) ; if ( file Name . ends With ( STRING ) ) { file... | protected void deploy ( HttpServletResponse response , String contextPath , String warURL ) throws IOException { String context = contextPath ; boolean error = _BOOL ; if ( context == null ) { File file = new File ( warURL ) ; String fileName = file . getName ( ) ; if ( fileName . endsWith ( STRING ) ) { fileName = fil... | 421 |
java-test-3373 | java | What does the code initialize ? | the internal frame close button settings | private void define Internal Frame Close Buttons ( UI Defaults d ) { String p = STRING ; String c = PAINTER PREFIX + STRING ; d . put ( p + STRING , STRING ) ; d . put ( p + STRING , new Title Pane Close Button Window Not Focused State ( ) ) ; d . put ( p + STRING , new Insets UI Resource ( NUM , NUM , NUM , NUM ) ) ; ... | private void defineInternalFrameCloseButtons ( UIDefaults d ) { String p = STRING ; String c = PAINTER_PREFIX + STRING ; d . put ( p + STRING , STRING ) ; d . put ( p + STRING , new TitlePaneCloseButtonWindowNotFocusedState ( ) ) ; d . put ( p + STRING , new InsetsUIResource ( _NUM , _NUM , _NUM , _NUM ) ) ; d . put ( ... | 296 |
java-test-3375 | java | What does the code read as written by writeclass ? | a class name from the given input stream | private static Class < ? > read Class ( Data Input di ) throws IO Exception { int len = di . read Int ( ) ; byte [ ] bytes = new byte [ len ] ; di . read Fully ( bytes ) ; String class Name = new String ( bytes ) ; Class < ? > result = null ; try { result = Internal Data Serializer . get Cached Class ( class Name ) ; }... | private static Class < ? > readClass ( DataInput di ) throws IOException { int len = di . readInt ( ) ; byte [ ] bytes = new byte [ len ] ; di . readFully ( bytes ) ; String className = new String ( bytes ) ; Class < ? > result = null ; try { result = InternalDataSerializer . getCachedClass ( className ) ; } catch ( Cl... | 95 |
java-test-3376 | java | What haves free space available ? | allocator | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3377 | java | What does allocator have ? | free space available | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3378 | java | What does we check too naively ? | committed bit density | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3379 | java | When should we do this only ? | when identifying the initial allocation , and when the allocindex is incremented | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3380 | java | What is determining to identify an initial allocation point ? | a good rule | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3381 | java | For what purpose do we add a " density " restriction for small slots ? | to encourage the aggregation of writes ( by increasing the likelihood of sibling slot allocation ) | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3382 | java | What do we add to encourage the aggregation of writes ( by increasing the likelihood of sibling slot allocation ) ? | a " density " restriction for small slots | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3383 | java | What has the introduction of iallocationcontexts is added to the older concept of a free list ? | some complexity | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3384 | java | What do we want ? | to add a " density " restriction for small slots to encourage the aggregation of writes ( by increasing the likelihood of sibling slot allocation ) | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3385 | java | What do a good rule determine ? | to identify an initial allocation point | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3386 | java | How does we check committed bit density ? | too naively | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3387 | java | What is here ? | some " do what i mean " complexity | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3388 | java | How do the aggregation of writes encourage ? | by increasing the likelihood of sibling slot allocation ) | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3389 | java | What has is added some complexity to the older concept of a free list ? | the introduction of iallocationcontexts | public int alloc ( final RW Store store , final int size , final I Allocation Context context ) { try { if ( size <= NUM ) throw new Illegal Argument Exception ( STRING + size ) ; if ( size > m size ) throw new Illegal Argument Exception ( STRING + m size + STRING + size + STRING ) ; if ( m free Bits == NUM ) { throw n... | public int alloc ( final RWStore store , final int size , final IAllocationContext context ) { try { if ( size <= _NUM ) throw new IllegalArgumentException ( STRING + size ) ; if ( size > m_size ) throw new IllegalArgumentException ( STRING + m_size + STRING + size + STRING ) ; if ( m_freeBits == _NUM ) { throw new Ill... | 414 |
java-test-3390 | java | How do we try all the connectors if a node goes down again ? | as one may now be available for replication < p > todo | @ Override public void node Down ( long event UID , String node ID ) { try { lock . lock ( ) ; untried Connectors . put All ( tried Connectors ) ; tried Connectors . clear ( ) ; if ( untried Connectors . size ( ) > NUM ) { condition . signal ( ) ; } } finally { lock . unlock ( ) ; } } | @ Override public void nodeDown ( long eventUID , String nodeID ) { try { lock . lock ( ) ; untriedConnectors . putAll ( triedConnectors ) ; triedConnectors . clear ( ) ; if ( untriedConnectors . size ( ) > _NUM ) { condition . signal ( ) ; } } finally { lock . unlock ( ) ; } } | 71 |
java-test-3391 | java | What do we try if a node goes down as one may now be available for replication <p> todo again ? | all the connectors | @ Override public void node Down ( long event UID , String node ID ) { try { lock . lock ( ) ; untried Connectors . put All ( tried Connectors ) ; tried Connectors . clear ( ) ; if ( untried Connectors . size ( ) > NUM ) { condition . signal ( ) ; } } finally { lock . unlock ( ) ; } } | @ Override public void nodeDown ( long eventUID , String nodeID ) { try { lock . lock ( ) ; untriedConnectors . putAll ( triedConnectors ) ; triedConnectors . clear ( ) ; if ( untriedConnectors . size ( ) > _NUM ) { condition . signal ( ) ; } } finally { lock . unlock ( ) ; } } | 71 |
java-test-3393 | java | What does the code close ? | the current container element | public B end ( ) { assert Current ( ) ; if ( level == NUM ) { throw new Illegal State Exception ( log Id ( ) + STRING + dump Elements ( ) ) ; } List < Element Info > children = new Array List < > ( ) ; while ( elements . peek ( ) . level == level ) { children . add ( elements . pop ( ) ) ; } Collections . reverse ( chi... | public B end ( ) { assertCurrent ( ) ; if ( level == _NUM ) { throw new IllegalStateException ( logId ( ) + STRING + dumpElements ( ) ) ; } List < ElementInfo > children = new ArrayList < > ( ) ; while ( elements . peek ( ) . level == level ) { children . add ( elements . pop ( ) ) ; } Collections . reverse ( children ... | 164 |
java-test-3398 | java | What perform on a given database ? | hics | public Outlier Result run ( Relation < V > relation ) { final DBI Ds ids = relation . get DBI Ds ( ) ; Array List < Array DBI Ds > subspace Index = build One Dim Indexes ( relation ) ; Set < Hi CS Subspace > subspaces = calculate Subspaces ( relation , subspace Index , rnd . get Single Threaded Random ( ) ) ; if ( LOG ... | public OutlierResult run ( Relation < V > relation ) { final DBIDs ids = relation . getDBIDs ( ) ; ArrayList < ArrayDBIDs > subspaceIndex = buildOneDimIndexes ( relation ) ; Set < HiCSSubspace > subspaces = calculateSubspaces ( relation , subspaceIndex , rnd . getSingleThreadedRandom ( ) ) ; if ( LOG . isVerbose ( ) ) ... | 437 |
java-test-3399 | java | Where do hics perform ? | on a given database | public Outlier Result run ( Relation < V > relation ) { final DBI Ds ids = relation . get DBI Ds ( ) ; Array List < Array DBI Ds > subspace Index = build One Dim Indexes ( relation ) ; Set < Hi CS Subspace > subspaces = calculate Subspaces ( relation , subspace Index , rnd . get Single Threaded Random ( ) ) ; if ( LOG ... | public OutlierResult run ( Relation < V > relation ) { final DBIDs ids = relation . getDBIDs ( ) ; ArrayList < ArrayDBIDs > subspaceIndex = buildOneDimIndexes ( relation ) ; Set < HiCSSubspace > subspaces = calculateSubspaces ( relation , subspaceIndex , rnd . getSingleThreadedRandom ( ) ) ; if ( LOG . isVerbose ( ) ) ... | 437 |
java-test-3403 | java | What is is is means that the output should be left justified within the field . the default is to pad with blanks on the left . the ' # ' flag character means to lead with ' 0x ' . < p / > the field width is treated as the minimum number of characters to be printed . the default is to add no padding . padding is with b... | format method for the x conversion character and long argument | private String print X Format ( long x ) { String sx = null ; if ( x == Long . MIN VALUE ) sx = STRING ; else if ( x < NUM ) { String t = Long . to String ( ( ~ ( - x - NUM ) ) ^ Long . MIN VALUE , NUM ) ; switch ( t . length ( ) ) { case NUM : sx = STRING + t ; break ; case NUM : sx = STRING + t ; break ; case NUM : s... | private String printXFormat ( long x ) { String sx = null ; if ( x == Long . MIN_VALUE ) sx = STRING ; else if ( x < _NUM ) { String t = Long . toString ( ( ~ ( - x - _NUM ) ) ^ Long . MIN_VALUE , _NUM ) ; switch ( t . length ( ) ) { case _NUM : sx = STRING + t ; break ; case _NUM : sx = STRING + t ; break ; case _NUM ... | 403 |
java-test-3404 | java | What is format method for the x conversion character and long argument is is means ? | that the output should be left justified within the field . the default is to pad with blanks on the left . the ' # ' flag character means to lead with ' 0x ' . < p / > the field width is treated as the minimum number of characters to be printed . the default is to add no padding . padding is with blanks by default . <... | private String print X Format ( long x ) { String sx = null ; if ( x == Long . MIN VALUE ) sx = STRING ; else if ( x < NUM ) { String t = Long . to String ( ( ~ ( - x - NUM ) ) ^ Long . MIN VALUE , NUM ) ; switch ( t . length ( ) ) { case NUM : sx = STRING + t ; break ; case NUM : sx = STRING + t ; break ; case NUM : s... | private String printXFormat ( long x ) { String sx = null ; if ( x == Long . MIN_VALUE ) sx = STRING ; else if ( x < _NUM ) { String t = Long . toString ( ( ~ ( - x - _NUM ) ) ^ Long . MIN_VALUE , _NUM ) ; switch ( t . length ( ) ) { case _NUM : sx = STRING + t ; break ; case _NUM : sx = STRING + t ; break ; case _NUM ... | 403 |
java-test-3405 | java | What do the line contain ? | the first " - - algorithm " or " - - fair algorithm " token ( s ) that begin ( s ) a pluscal algorithm | public static int Get Line Of P Cal Algorithm ( I Document document ) { try { final String module As String = document . get ( ) ; return Location To Line ( document , TL Ato P Cal Mapping . Get Line Of P Cal Algorithm ( module As String ) ) ; } catch ( Bad Location Exception e ) { e . print Stack Trace ( ) ; } return ... | public static int GetLineOfPCalAlgorithm ( IDocument document ) { try { final String moduleAsString = document . get ( ) ; return LocationToLine ( document , TLAtoPCalMapping . GetLineOfPCalAlgorithm ( moduleAsString ) ) ; } catch ( BadLocationException e ) { e . printStackTrace ( ) ; } return - _NUM ; } | 78 |
java-test-3406 | java | How does the code write all keys ? | starting with the specified prefix | private void write Keys With Prefix ( String prefix , String exclude ) { for ( String key : keys ) { if ( key . starts With ( prefix ) && ! key . starts With ( exclude ) ) { ps . println ( key + STRING + prop . get Property ( key ) ) ; } } ps . println ( ) ; } | private void writeKeysWithPrefix ( String prefix , String exclude ) { for ( String key : keys ) { if ( key . startsWith ( prefix ) && ! key . startsWith ( exclude ) ) { ps . println ( key + STRING + prop . getProperty ( key ) ) ; } } ps . println ( ) ; } | 68 |
java-test-3407 | java | What do we keep ? | reevaluating the parameter values until they stabilize | @ Not Null private Map < String , Object > compute Parameter Values ( @ Not Null Map < String , Object > static Values ) throws Circular Parameter Dependency Exception { Map < String , Object > computed Values = Maps . new Hash Map With Expected Size ( my Computed Parameters . size ( ) + static Values . size ( ) ) ; co... | @ NotNull private Map < String , Object > computeParameterValues ( @ NotNull Map < String , Object > staticValues ) throws CircularParameterDependencyException { Map < String , Object > computedValues = Maps . newHashMapWithExpectedSize ( myComputedParameters . size ( ) + staticValues . size ( ) ) ; computedValues . pu... | 204 |
java-test-3408 | java | Till when do we reevaluate the parameter values ? | until they stabilize | @ Not Null private Map < String , Object > compute Parameter Values ( @ Not Null Map < String , Object > static Values ) throws Circular Parameter Dependency Exception { Map < String , Object > computed Values = Maps . new Hash Map With Expected Size ( my Computed Parameters . size ( ) + static Values . size ( ) ) ; co... | @ NotNull private Map < String , Object > computeParameterValues ( @ NotNull Map < String , Object > staticValues ) throws CircularParameterDependencyException { Map < String , Object > computedValues = Maps . newHashMapWithExpectedSize ( myComputedParameters . size ( ) + staticValues . size ( ) ) ; computedValues . pu... | 204 |
java-test-3409 | java | What do we not have ? | that information | @ Not Null private Map < String , Object > compute Parameter Values ( @ Not Null Map < String , Object > static Values ) throws Circular Parameter Dependency Exception { Map < String , Object > computed Values = Maps . new Hash Map With Expected Size ( my Computed Parameters . size ( ) + static Values . size ( ) ) ; co... | @ NotNull private Map < String , Object > computeParameterValues ( @ NotNull Map < String , Object > staticValues ) throws CircularParameterDependencyException { Map < String , Object > computedValues = Maps . newHashMapWithExpectedSize ( myComputedParameters . size ( ) + staticValues . size ( ) ) ; computedValues . pu... | 204 |
java-test-3410 | java | How are expressions evaluated ? | with freemarker | @ Not Null private Map < String , Object > compute Parameter Values ( @ Not Null Map < String , Object > static Values ) throws Circular Parameter Dependency Exception { Map < String , Object > computed Values = Maps . new Hash Map With Expected Size ( my Computed Parameters . size ( ) + static Values . size ( ) ) ; co... | @ NotNull private Map < String , Object > computeParameterValues ( @ NotNull Map < String , Object > staticValues ) throws CircularParameterDependencyException { Map < String , Object > computedValues = Maps . newHashMapWithExpectedSize ( myComputedParameters . size ( ) + staticValues . size ( ) ) ; computedValues . pu... | 204 |
java-test-3411 | java | Do we have that information ? | No | @ Not Null private Map < String , Object > compute Parameter Values ( @ Not Null Map < String , Object > static Values ) throws Circular Parameter Dependency Exception { Map < String , Object > computed Values = Maps . new Hash Map With Expected Size ( my Computed Parameters . size ( ) + static Values . size ( ) ) ; co... | @ NotNull private Map < String , Object > computeParameterValues ( @ NotNull Map < String , Object > staticValues ) throws CircularParameterDependencyException { Map < String , Object > computedValues = Maps . newHashMapWithExpectedSize ( myComputedParameters . size ( ) + staticValues . size ( ) ) ; computedValues . pu... | 204 |
java-test-3412 | java | What do we reevaluate until they stabilize ? | the parameter values | @ Not Null private Map < String , Object > compute Parameter Values ( @ Not Null Map < String , Object > static Values ) throws Circular Parameter Dependency Exception { Map < String , Object > computed Values = Maps . new Hash Map With Expected Size ( my Computed Parameters . size ( ) + static Values . size ( ) ) ; co... | @ NotNull private Map < String , Object > computeParameterValues ( @ NotNull Map < String , Object > staticValues ) throws CircularParameterDependencyException { Map < String , Object > computedValues = Maps . newHashMapWithExpectedSize ( myComputedParameters . size ( ) + staticValues . size ( ) ) ; computedValues . pu... | 204 |
java-test-3413 | java | What does the code calculate ? | the number of ints ( m_bitsize ) | Fixed Allocator ( final RW Store store , final int size ) { m disk Addr = NUM ; m store = store ; m size = size ; m bit Size = calc Bit Size ( BOOL , size , c Min Allocation , c Mod Allocation ) ; alloc Block Range = NUM * m bit Size ; final int num Blocks = NUM / ( m bit Size + NUM ) ; m alloc Blocks = new Array List ... | FixedAllocator ( final RWStore store , final int size ) { m_diskAddr = _NUM ; m_store = store ; m_size = size ; m_bitSize = calcBitSize ( _BOOL , size , cMinAllocation , cModAllocation ) ; allocBlockRange = _NUM * m_bitSize ; final int numBlocks = _NUM / ( m_bitSize + _NUM ) ; m_allocBlocks = new ArrayList < AllocBlock... | 148 |
java-test-3414 | java | What are we allocating for the largest blocks of ~ 256k ? | 256 mb of space | Fixed Allocator ( final RW Store store , final int size ) { m disk Addr = NUM ; m store = store ; m size = size ; m bit Size = calc Bit Size ( BOOL , size , c Min Allocation , c Mod Allocation ) ; alloc Block Range = NUM * m bit Size ; final int num Blocks = NUM / ( m bit Size + NUM ) ; m alloc Blocks = new Array List ... | FixedAllocator ( final RWStore store , final int size ) { m_diskAddr = _NUM ; m_store = store ; m_size = size ; m_bitSize = calcBitSize ( _BOOL , size , cMinAllocation , cModAllocation ) ; allocBlockRange = _NUM * m_bitSize ; final int numBlocks = _NUM / ( m_bitSize + _NUM ) ; m_allocBlocks = new ArrayList < AllocBlock... | 148 |
java-test-3415 | java | What does nints need now ? | multiple of 32 ints | Fixed Allocator ( final RW Store store , final int size ) { m disk Addr = NUM ; m store = store ; m size = size ; m bit Size = calc Bit Size ( BOOL , size , c Min Allocation , c Mod Allocation ) ; alloc Block Range = NUM * m bit Size ; final int num Blocks = NUM / ( m bit Size + NUM ) ; m alloc Blocks = new Array List ... | FixedAllocator ( final RWStore store , final int size ) { m_diskAddr = _NUM ; m_store = store ; m_size = size ; m_bitSize = calcBitSize ( _BOOL , size , cMinAllocation , cModAllocation ) ; allocBlockRange = _NUM * m_bitSize ; final int numBlocks = _NUM / ( m_bitSize + _NUM ) ; m_allocBlocks = new ArrayList < AllocBlock... | 148 |
java-test-3416 | java | What do we allocate ? | a multiple of 32 ints | Fixed Allocator ( final RW Store store , final int size ) { m disk Addr = NUM ; m store = store ; m size = size ; m bit Size = calc Bit Size ( BOOL , size , c Min Allocation , c Mod Allocation ) ; alloc Block Range = NUM * m bit Size ; final int num Blocks = NUM / ( m bit Size + NUM ) ; m alloc Blocks = new Array List ... | FixedAllocator ( final RWStore store , final int size ) { m_diskAddr = _NUM ; m_store = store ; m_size = size ; m_bitSize = calcBitSize ( _BOOL , size , cMinAllocation , cModAllocation ) ; allocBlockRange = _NUM * m_bitSize ; final int numBlocks = _NUM / ( m_bitSize + _NUM ) ; m_allocBlocks = new ArrayList < AllocBlock... | 148 |
java-test-3417 | java | What need multiple of 32 ints now ? | nints | Fixed Allocator ( final RW Store store , final int size ) { m disk Addr = NUM ; m store = store ; m size = size ; m bit Size = calc Bit Size ( BOOL , size , c Min Allocation , c Mod Allocation ) ; alloc Block Range = NUM * m bit Size ; final int num Blocks = NUM / ( m bit Size + NUM ) ; m alloc Blocks = new Array List ... | FixedAllocator ( final RWStore store , final int size ) { m_diskAddr = _NUM ; m_store = store ; m_size = size ; m_bitSize = calcBitSize ( _BOOL , size , cMinAllocation , cModAllocation ) ; allocBlockRange = _NUM * m_bitSize ; final int numBlocks = _NUM / ( m_bitSize + _NUM ) ; m_allocBlocks = new ArrayList < AllocBlock... | 148 |
java-test-3418 | java | What do the state parameter maintain between calls ? | intermediary data | private static final void append Encoded Byte ( String Buffer buffer , byte value , byte [ ] state ) { if ( state [ NUM ] != NUM ) { char c = ( char ) ( ( state [ NUM ] << NUM ) | ( ( ( int ) value ) & NUM ) ) ; buffer . append ( c ) ; state [ NUM ] = NUM ; } else { state [ NUM ] = NUM ; state [ NUM ] = value ; } } | private static final void appendEncodedByte ( StringBuffer buffer , byte value , byte [ ] state ) { if ( state [ _NUM ] != _NUM ) { char c = ( char ) ( ( state [ _NUM ] << _NUM ) | ( ( ( int ) value ) & _NUM ) ) ; buffer . append ( c ) ; state [ _NUM ] = _NUM ; } else { state [ _NUM ] = _NUM ; state [ _NUM ] = value ; ... | 92 |
java-test-3419 | java | What maintains intermediary data between calls ? | the state parameter | private static final void append Encoded Byte ( String Buffer buffer , byte value , byte [ ] state ) { if ( state [ NUM ] != NUM ) { char c = ( char ) ( ( state [ NUM ] << NUM ) | ( ( ( int ) value ) & NUM ) ) ; buffer . append ( c ) ; state [ NUM ] = NUM ; } else { state [ NUM ] = NUM ; state [ NUM ] = value ; } } | private static final void appendEncodedByte ( StringBuffer buffer , byte value , byte [ ] state ) { if ( state [ _NUM ] != _NUM ) { char c = ( char ) ( ( state [ _NUM ] << _NUM ) | ( ( ( int ) value ) & _NUM ) ) ; buffer . append ( c ) ; state [ _NUM ] = _NUM ; } else { state [ _NUM ] = _NUM ; state [ _NUM ] = value ; ... | 92 |
java-test-3420 | java | Where do the state parameter maintain intermediary data ? | between calls | private static final void append Encoded Byte ( String Buffer buffer , byte value , byte [ ] state ) { if ( state [ NUM ] != NUM ) { char c = ( char ) ( ( state [ NUM ] << NUM ) | ( ( ( int ) value ) & NUM ) ) ; buffer . append ( c ) ; state [ NUM ] = NUM ; } else { state [ NUM ] = NUM ; state [ NUM ] = value ; } } | private static final void appendEncodedByte ( StringBuffer buffer , byte value , byte [ ] state ) { if ( state [ _NUM ] != _NUM ) { char c = ( char ) ( ( state [ _NUM ] << _NUM ) | ( ( ( int ) value ) & _NUM ) ) ; buffer . append ( c ) ; state [ _NUM ] = _NUM ; } else { state [ _NUM ] = _NUM ; state [ _NUM ] = value ; ... | 92 |
java-test-3421 | java | What does the code annotate in the cash book ? | the difference between previous balance and actual from cash scrutiny | private void cmd annotate Difference ( ) { Big Decimal previous Value , actual Value , difference ; previous Value = ( Big Decimal ) v previous Balance . get Value ( ) ; actual Value = ( Big Decimal ) v Actual Balance . get Value ( ) ; difference = actual Value . subtract ( previous Value ) ; M Cash Book cash Book = ne... | private void cmd_annotateDifference ( ) { BigDecimal previousValue , actualValue , difference ; previousValue = ( BigDecimal ) v_previousBalance . getValue ( ) ; actualValue = ( BigDecimal ) v_ActualBalance . getValue ( ) ; difference = actualValue . subtract ( previousValue ) ; MCashBook cashBook = new MCashBook ( p_c... | 310 |
java-test-3422 | java | Where does the code annotate the difference between previous balance and actual from cash scrutiny ? | in the cash book | private void cmd annotate Difference ( ) { Big Decimal previous Value , actual Value , difference ; previous Value = ( Big Decimal ) v previous Balance . get Value ( ) ; actual Value = ( Big Decimal ) v Actual Balance . get Value ( ) ; difference = actual Value . subtract ( previous Value ) ; M Cash Book cash Book = ne... | private void cmd_annotateDifference ( ) { BigDecimal previousValue , actualValue , difference ; previousValue = ( BigDecimal ) v_previousBalance . getValue ( ) ; actualValue = ( BigDecimal ) v_ActualBalance . getValue ( ) ; difference = actualValue . subtract ( previousValue ) ; MCashBook cashBook = new MCashBook ( p_c... | 310 |
java-test-3423 | java | What did a feature learn ? | a decoding model weight for it | boolean has Min Feature Count ( String feature ) { if ( min Feature Count == NUM ) return BOOL ; Set < Integer > ids = clipped Feature Index . get ( feature ) ; if ( ids == null ) return BOOL ; return ids . size ( ) >= min Feature Count ; } | boolean hasMinFeatureCount ( String feature ) { if ( minFeatureCount == _NUM ) return _BOOL ; Set < Integer > ids = clippedFeatureIndex . get ( feature ) ; if ( ids == null ) return _BOOL ; return ids . size ( ) >= minFeatureCount ; } | 57 |
java-test-3424 | java | By how much has a feature been seen to learn a decoding model weight for it ? | enough times | boolean has Min Feature Count ( String feature ) { if ( min Feature Count == NUM ) return BOOL ; Set < Integer > ids = clipped Feature Index . get ( feature ) ; if ( ids == null ) return BOOL ; return ids . size ( ) >= min Feature Count ; } | boolean hasMinFeatureCount ( String feature ) { if ( minFeatureCount == _NUM ) return _BOOL ; Set < Integer > ids = clippedFeatureIndex . get ( feature ) ; if ( ids == null ) return _BOOL ; return ids . size ( ) >= minFeatureCount ; } | 57 |
java-test-3425 | java | For what purpose has a feature been seen enough times ? | to learn a decoding model weight for it | boolean has Min Feature Count ( String feature ) { if ( min Feature Count == NUM ) return BOOL ; Set < Integer > ids = clipped Feature Index . get ( feature ) ; if ( ids == null ) return BOOL ; return ids . size ( ) >= min Feature Count ; } | boolean hasMinFeatureCount ( String feature ) { if ( minFeatureCount == _NUM ) return _BOOL ; Set < Integer > ids = clippedFeatureIndex . get ( feature ) ; if ( ids == null ) return _BOOL ; return ids . size ( ) >= minFeatureCount ; } | 57 |
java-test-3426 | java | What does the given text field represent ? | a valid type name | public static boolean validate Type Name ( final Component parent , final Type Manager type Manager , final J Text Field name ) { if ( validate Type Name ( type Manager , name ) ) { return BOOL ; } else { C Message Box . show Warning ( parent , String . format ( STRING ) ) ; return BOOL ; } } | public static boolean validateTypeName ( final Component parent , final TypeManager typeManager , final JTextField name ) { if ( validateTypeName ( typeManager , name ) ) { return _BOOL ; } else { CMessageBox . showWarning ( parent , String . format ( STRING ) ) ; return _BOOL ; } } | 65 |
java-test-3427 | java | What do all other write methods delegate to here ? | their work | public void write ( Output Stream out , java . util . List < Figure > figures ) throws IO Exception { Rectangle 2 D . Double drawing Rect = null ; for ( Figure f : figures ) { if ( drawing Rect == null ) { drawing Rect = f . get Bounds ( ) ; } else { drawing Rect . add ( f . get Bounds ( ) ) ; } } Affine Transform tx =... | public void write ( OutputStream out , java . util . List < Figure > figures ) throws IOException { Rectangle2D . Double drawingRect = null ; for ( Figure f : figures ) { if ( drawingRect == null ) { drawingRect = f . getBounds ( ) ; } else { drawingRect . add ( f . getBounds ( ) ) ; } } AffineTransform tx = new Affine... | 171 |
java-test-3428 | java | What delegate their work to here ? | all other write methods | public void write ( Output Stream out , java . util . List < Figure > figures ) throws IO Exception { Rectangle 2 D . Double drawing Rect = null ; for ( Figure f : figures ) { if ( drawing Rect == null ) { drawing Rect = f . get Bounds ( ) ; } else { drawing Rect . add ( f . get Bounds ( ) ) ; } } Affine Transform tx =... | public void write ( OutputStream out , java . util . List < Figure > figures ) throws IOException { Rectangle2D . Double drawingRect = null ; for ( Figure f : figures ) { if ( drawingRect == null ) { drawingRect = f . getBounds ( ) ; } else { drawingRect . add ( f . getBounds ( ) ) ; } } AffineTransform tx = new Affine... | 171 |
java-test-3429 | java | What does the code add ? | indirect reference to list of indirect objects | public Pdf Indirect Reference add ( Pdf Indirect Reference reference ) { if ( reference == null ) { return null ; } int obj Nr = reference . get Obj Number ( ) ; this . count = Math . max ( this . count , obj Nr ) ; ensure Count ( obj Nr ) ; xref [ obj Nr ] = reference ; return reference ; } | public PdfIndirectReference add ( PdfIndirectReference reference ) { if ( reference == null ) { return null ; } int objNr = reference . getObjNumber ( ) ; this . count = Math . max ( this . count , objNr ) ; ensureCount ( objNr ) ; xref [ objNr ] = reference ; return reference ; } | 70 |
java-test-3430 | java | What does the code assume ? | that the point is colinear with this segment check if the given point is " within " this segment with a given tolerance | public final boolean contains ( Pla Point Int p point , double tolerance ) { if ( p point . is Na N ( ) || start point . is Na N ( ) || end point . is Na N ( ) ) return BOOL ; Pla Point Float f point = p point . to float ( ) ; Pla Point Float f begin = start point . to float ( ) ; Pla Point Float f end = end point . to... | public final boolean contains ( PlaPointInt p_point , double tolerance ) { if ( p_point . is_NaN ( ) || start_point . is_NaN ( ) || end_point . is_NaN ( ) ) return _BOOL ; PlaPointFloat f_point = p_point . to_float ( ) ; PlaPointFloat f_begin = start_point . to_float ( ) ; PlaPointFloat f_end = end_point . to_float ( )... | 198 |
java-test-3431 | java | How does the given point be within " this segment ? | with a given tolerance | public final boolean contains ( Pla Point Int p point , double tolerance ) { if ( p point . is Na N ( ) || start point . is Na N ( ) || end point . is Na N ( ) ) return BOOL ; Pla Point Float f point = p point . to float ( ) ; Pla Point Float f begin = start point . to float ( ) ; Pla Point Float f end = end point . to... | public final boolean contains ( PlaPointInt p_point , double tolerance ) { if ( p_point . is_NaN ( ) || start_point . is_NaN ( ) || end_point . is_NaN ( ) ) return _BOOL ; PlaPointFloat f_point = p_point . to_float ( ) ; PlaPointFloat f_begin = start_point . to_float ( ) ; PlaPointFloat f_end = end_point . to_float ( )... | 198 |
java-test-3432 | java | What do the manager connect ? | all queued bots | public void start ( ) { synchronized ( state Lock ) { if ( state != State . NEW ) throw new Runtime Exception ( STRING + state ) ; state = State . STARTING ; } for ( Pirc Bot X bot : start Queue ) start Bot ( bot ) ; start Queue . clear ( ) ; synchronized ( state Lock ) { state = State . RUNNING ; } } | public void start ( ) { synchronized ( stateLock ) { if ( state != State . NEW ) throw new RuntimeException ( STRING + state ) ; state = State . STARTING ; } for ( PircBotX bot : startQueue ) startBot ( bot ) ; startQueue . clear ( ) ; synchronized ( stateLock ) { state = State . RUNNING ; } } | 74 |
java-test-3433 | java | What will the method start if resource tag name is group - ref ? | a recursive computation | private void parse Resource ( final Element resource Element , final Collection < Resource > resources ) { final String tag Name = resource Element . get Tag Name ( ) ; final String uri = resource Element . get Text Content ( ) ; if ( TAG GROUP REF . equals ( tag Name ) ) { resources . add All ( get Resources For Group... | private void parseResource ( final Element resourceElement , final Collection < Resource > resources ) { final String tagName = resourceElement . getTagName ( ) ; final String uri = resourceElement . getTextContent ( ) ; if ( TAG_GROUP_REF . equals ( tagName ) ) { resources . addAll ( getResourcesForGroup ( uri ) ) ; }... | 115 |
java-test-3434 | java | Does the code assert attribute order where necessary ? | No | private void prepare For Encoding ( ) { Attribute msg Int Attr = remove Attribute ( Attribute . MESSAGE INTEGRITY ) ; Attribute fingerprint = remove Attribute ( Attribute . FINGERPRINT ) ; String software = System . get Property ( Stack Properties . SOFTWARE ) ; if ( get Attribute ( Attribute . SOFTWARE ) == null && so... | private void prepareForEncoding ( ) { Attribute msgIntAttr = removeAttribute ( Attribute . MESSAGE_INTEGRITY ) ; Attribute fingerprint = removeAttribute ( Attribute . FINGERPRINT ) ; String software = System . getProperty ( StackProperties . SOFTWARE ) ; if ( getAttribute ( Attribute . SOFTWARE ) == null && software !=... | 156 |
java-test-3436 | java | When did the code call ? | when someone clicks on the checkbox preference | public boolean on Preference Change ( Preference preference , Object new Value ) { if ( Boolean . parse Boolean ( System Properties . get ( Telephony Properties . PROPERTY INECM MODE ) ) ) { } else { set Airplane Mode On ( ( Boolean ) new Value ) ; } return BOOL ; } | public boolean onPreferenceChange ( Preference preference , Object newValue ) { if ( Boolean . parseBoolean ( SystemProperties . get ( TelephonyProperties . PROPERTY_INECM_MODE ) ) ) { } else { setAirplaneModeOn ( ( Boolean ) newValue ) ; } return _BOOL ; } | 56 |
java-test-3437 | java | What does the code show ? | the content of a licence file | @ Override public void licence File ( String text To Show , File licence File ) throws Cancel Exception { try { final File Input Stream content = new File Input Stream ( licence File ) ; final String Writer writer = new String Writer ( ) ; IO Utils . copy ( content , writer , STRING ) ; content . close ( ) ; licence ( ... | @ Override public void licenceFile ( String textToShow , File licenceFile ) throws CancelException { try { final FileInputStream content = new FileInputStream ( licenceFile ) ; final StringWriter writer = new StringWriter ( ) ; IOUtils . copy ( content , writer , STRING ) ; content . close ( ) ; licence ( textToShow , ... | 101 |
java-test-3438 | java | What does the code add ? | a reply to the result | public synchronized void add Reply ( Reply reply ) { if ( ! ignore Reply ( reply ) ) { repliedlist . add ( reply . get Participant ( ) ) ; replies . push ( reply ) ; number Of Missing Replies -- ; notify All ( ) ; } } | public synchronized void addReply ( Reply reply ) { if ( ! ignoreReply ( reply ) ) { repliedlist_ . add ( reply . getParticipant ( ) ) ; replies_ . push ( reply ) ; numberOfMissingReplies_ -- ; notifyAll ( ) ; } } | 52 |
java-test-3439 | java | What is it configured ? | to access the utf8 templates folder on the classpath , i . e . / src / resources / templates | @ Provides @ Singleton @ Inject public Configuration provide Freemarker ( Data Dir datadir ) { Configuration fm = new Configuration ( ) ; List < Template Loader > t Loader = new Array List < Template Loader > ( ) ; t Loader . add ( new Class Template Loader ( App Config . class , STRING ) ) ; try { Template Loader tl D... | @ Provides @ Singleton @ Inject public Configuration provideFreemarker ( DataDir datadir ) { Configuration fm = new Configuration ( ) ; List < TemplateLoader > tLoader = new ArrayList < TemplateLoader > ( ) ; tLoader . add ( new ClassTemplateLoader ( AppConfig . class , STRING ) ) ; try { TemplateLoader tlDataDir = new... | 170 |
java-test-3440 | java | What does the code provide ? | a freemarker template loader | @ Provides @ Singleton @ Inject public Configuration provide Freemarker ( Data Dir datadir ) { Configuration fm = new Configuration ( ) ; List < Template Loader > t Loader = new Array List < Template Loader > ( ) ; t Loader . add ( new Class Template Loader ( App Config . class , STRING ) ) ; try { Template Loader tl D... | @ Provides @ Singleton @ Inject public Configuration provideFreemarker ( DataDir datadir ) { Configuration fm = new Configuration ( ) ; List < TemplateLoader > tLoader = new ArrayList < TemplateLoader > ( ) ; tLoader . add ( new ClassTemplateLoader ( AppConfig . class , STRING ) ) ; try { TemplateLoader tlDataDir = new... | 170 |
java-test-3441 | java | What did it access ? | the utf8 templates folder on the classpath , i . e . / src / resources / templates | @ Provides @ Singleton @ Inject public Configuration provide Freemarker ( Data Dir datadir ) { Configuration fm = new Configuration ( ) ; List < Template Loader > t Loader = new Array List < Template Loader > ( ) ; t Loader . add ( new Class Template Loader ( App Config . class , STRING ) ) ; try { Template Loader tl D... | @ Provides @ Singleton @ Inject public Configuration provideFreemarker ( DataDir datadir ) { Configuration fm = new Configuration ( ) ; List < TemplateLoader > tLoader = new ArrayList < TemplateLoader > ( ) ; tLoader . add ( new ClassTemplateLoader ( AppConfig . class , STRING ) ) ; try { TemplateLoader tlDataDir = new... | 170 |
java-test-3443 | java | What does the code get ? | the absolute maximum element of an integer array | public static int absolute Max ( int [ ] int Array ) { int max = Integer . MIN VALUE ; for ( int i = NUM ; i < int Array . length ; i ++ ) { if ( Math . abs ( int Array [ i ] ) > max && int Array [ i ] != NUM ) { max = int Array [ i ] ; } } return max == Integer . MIN VALUE ? NUM : max ; } | public static int absoluteMax ( int [ ] intArray ) { int max = Integer . MIN_VALUE ; for ( int i = _NUM ; i < intArray . length ; i ++ ) { if ( Math . abs ( intArray [ i ] ) > max && intArray [ i ] != _NUM ) { max = intArray [ i ] ; } } return max == Integer . MIN_VALUE ? _NUM : max ; } | 86 |
java-test-3444 | java | What does which contain ? | all the elements between first and last | public static < T > int copy ( final List < T > from , int first , int last , List < T > to ) { int i = first ; for ( ; i < last ; i ++ ) { to . add ( from . get ( i ) ) ; } return i ; } | public static < T > int copy ( final List < T > from , int first , int last , List < T > to ) { int i = first ; for ( ; i < last ; i ++ ) { to . add ( from . get ( i ) ) ; } return i ; } | 61 |
java-test-3445 | java | What is an iterator returns ? | to the last element in the destination range parameters first , last input iterators to the initial and final positions in a sequence | public static < T > int copy ( final List < T > from , int first , int last , List < T > to ) { int i = first ; for ( ; i < last ; i ++ ) { to . add ( from . get ( i ) ) ; } return i ; } | public static < T > int copy ( final List < T > from , int first , int last , List < T > to ) { int i = first ; for ( ; i < last ; i ++ ) { to . add ( from . get ( i ) ) ; } return i ; } | 61 |
java-test-3446 | java | When do the element pointed by first but not the element pointed by last . result output iterator include all the elements ? | between first and | public static < T > int copy ( final List < T > from , int first , int last , List < T > to ) { int i = first ; for ( ; i < last ; i ++ ) { to . add ( from . get ( i ) ) ; } return i ; } | public static < T > int copy ( final List < T > from , int first , int last , List < T > to ) { int i = first ; for ( ; i < last ; i ++ ) { to . add ( from . get ( i ) ) ; } return i ; } | 61 |
java-test-3447 | java | What does some char entities replace ? | with html entities | protected String to HTML ( String s ) { String result ; result = s ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , ST... | protected String toHTML ( String s ) { String result ; result = s ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING )... | 80 |
java-test-3448 | java | What is replacing with html entities ? | some char entities | protected String to HTML ( String s ) { String result ; result = s ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , ST... | protected String toHTML ( String s ) { String result ; result = s ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING )... | 80 |
java-test-3450 | java | What does the code compute ? | the aggregate solution for a solution multiset ( aka a group ) | private I Binding Set aggregate ( final Iterable < I Binding Set > solutions ) { final I Binding Set aggregates = new Context Binding Set ( context , new List Binding Set ( ) ) ; if ( group By != null ) { final I Binding Set a Solution = solutions . iterator ( ) . next ( ) ; for ( I Value Expression < ? > expr : group ... | private IBindingSet aggregate ( final Iterable < IBindingSet > solutions ) { final IBindingSet aggregates = new ContextBindingSet ( context , new ListBindingSet ( ) ) ; if ( groupBy != null ) { final IBindingSet aSolution = solutions . iterator ( ) . next ( ) ; for ( IValueExpression < ? > expr : groupBy ) { if ( expr ... | 707 |
java-test-3452 | java | What hold content models temporarily ? | the stacks | private void initialize Content Model Stacks ( ) { if ( f Op Stack == null ) { f Op Stack = new short [ NUM ] ; f Group Index Stack = new int [ NUM ] [ ] ; f Group Index Stack Sizes = new int [ NUM ] ; } else if ( f Depth == f Op Stack . length ) { short [ ] new Op Stack = new short [ f Depth * NUM ] ; System . arrayco... | private void initializeContentModelStacks ( ) { if ( fOpStack == null ) { fOpStack = new short [ _NUM ] ; fGroupIndexStack = new int [ _NUM ] [ ] ; fGroupIndexStackSizes = new int [ _NUM ] ; } else if ( fDepth == fOpStack . length ) { short [ ] newOpStack = new short [ fDepth * _NUM ] ; System . arraycopy ( fOpStack , ... | 243 |
java-test-3453 | java | What do the stacks hold temporarily ? | content models | private void initialize Content Model Stacks ( ) { if ( f Op Stack == null ) { f Op Stack = new short [ NUM ] ; f Group Index Stack = new int [ NUM ] [ ] ; f Group Index Stack Sizes = new int [ NUM ] ; } else if ( f Depth == f Op Stack . length ) { short [ ] new Op Stack = new short [ f Depth * NUM ] ; System . arrayco... | private void initializeContentModelStacks ( ) { if ( fOpStack == null ) { fOpStack = new short [ _NUM ] ; fGroupIndexStack = new int [ _NUM ] [ ] ; fGroupIndexStackSizes = new int [ _NUM ] ; } else if ( fDepth == fOpStack . length ) { short [ ] newOpStack = new short [ fDepth * _NUM ] ; System . arraycopy ( fOpStack , ... | 243 |
java-test-3454 | java | What does the code initialize ? | the stacks which temporarily hold content models | private void initialize Content Model Stacks ( ) { if ( f Op Stack == null ) { f Op Stack = new short [ NUM ] ; f Group Index Stack = new int [ NUM ] [ ] ; f Group Index Stack Sizes = new int [ NUM ] ; } else if ( f Depth == f Op Stack . length ) { short [ ] new Op Stack = new short [ f Depth * NUM ] ; System . arrayco... | private void initializeContentModelStacks ( ) { if ( fOpStack == null ) { fOpStack = new short [ _NUM ] ; fGroupIndexStack = new int [ _NUM ] [ ] ; fGroupIndexStackSizes = new int [ _NUM ] ; } else if ( fDepth == fOpStack . length ) { short [ ] newOpStack = new short [ fDepth * _NUM ] ; System . arraycopy ( fOpStack , ... | 243 |
java-test-3456 | java | Where does neighborhood map for all nodes build ? | in snapshot | public static Map < UUID , Collection < Cluster Node > > neighbors ( Collection < Cluster Node > top Snapshot ) { Map < String , Collection < Cluster Node > > mac Map = new Hash Map < > ( top Snapshot . size ( ) , NUM ) ; for ( Cluster Node node : top Snapshot ) { String macs = node . attribute ( Ignite Node Attributes... | public static Map < UUID , Collection < ClusterNode > > neighbors ( Collection < ClusterNode > topSnapshot ) { Map < String , Collection < ClusterNode > > macMap = new HashMap < > ( topSnapshot . size ( ) , _NUM ) ; for ( ClusterNode node : topSnapshot ) { String macs = node . attribute ( IgniteNodeAttributes . ATTR_MA... | 193 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.