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-4278 | java | When being your app killed ? | in the medium term | public void remove All Textures ( ) { for ( Weak Reference < CC Texture 2 D > tex SR : textures . values ( ) ) { CC Texture 2 D tex = tex SR . get ( ) ; if ( tex != null ) tex . release Texture ( CC Director . gl ) ; } textures . clear ( ) ; } | public void removeAllTextures ( ) { for ( WeakReference < CCTexture2D > texSR : textures . values ( ) ) { CCTexture2D tex = texSR . get ( ) ; if ( tex != null ) tex . releaseTexture ( CCDirector . gl ) ; } textures . clear ( ) ; } | 66 |
java-test-4279 | java | What are two different assignment arrays used ? | to allow overlapping assignment of points to the clusters | private double dot ( final int k0 , final int k1 , final int [ ] assignment 0 , final int [ ] assignment 1 ) { double dot = NUM ; final int N = X . size ( ) ; int a = NUM , b = NUM ; for ( int i = NUM ; i < N ; i ++ ) { if ( assignment 0 [ i ] != k0 ) continue ; a ++ ; for ( int j = NUM ; j < N ; j ++ ) { if ( assignme... | private double dot ( final int k0 , final int k1 , final int [ ] assignment0 , final int [ ] assignment1 ) { double dot = _NUM ; final int N = X . size ( ) ; int a = _NUM , b = _NUM ; for ( int i = _NUM ; i < N ; i ++ ) { if ( assignment0 [ i ] != k0 ) continue ; a ++ ; for ( int j = _NUM ; j < N ; j ++ ) { if ( assign... | 162 |
java-test-4280 | java | What did two different assignment arrays allow to the clusters ? | overlapping assignment of points | private double dot ( final int k0 , final int k1 , final int [ ] assignment 0 , final int [ ] assignment 1 ) { double dot = NUM ; final int N = X . size ( ) ; int a = NUM , b = NUM ; for ( int i = NUM ; i < N ; i ++ ) { if ( assignment 0 [ i ] != k0 ) continue ; a ++ ; for ( int j = NUM ; j < N ; j ++ ) { if ( assignme... | private double dot ( final int k0 , final int k1 , final int [ ] assignment0 , final int [ ] assignment1 ) { double dot = _NUM ; final int N = X . size ( ) ; int a = _NUM , b = _NUM ; for ( int i = _NUM ; i < N ; i ++ ) { if ( assignment0 [ i ] != k0 ) continue ; a ++ ; for ( int j = _NUM ; j < N ; j ++ ) { if ( assign... | 162 |
java-test-4281 | java | What do handles add ? | provider resource i d mapper request | public void handle Tbl Provider Resource Id Mapper Button Add Request ( Request Invocation Event event ) throws Model Control Exception { try { Map values = get Values ( ) ; on Before Save Profile ( values ) ; set Page Session Attribute ( PROPERTY ATTRIBUTE , ( Hash Map ) values ) ; SM Discovery Provider Resource Id Ma... | public void handleTblProviderResourceIdMapperButtonAddRequest ( RequestInvocationEvent event ) throws ModelControlException { try { Map values = getValues ( ) ; onBeforeSaveProfile ( values ) ; setPageSessionAttribute ( PROPERTY_ATTRIBUTE , ( HashMap ) values ) ; SMDiscoveryProviderResourceIdMapperAddViewBean vb = ( SM... | 171 |
java-test-4282 | java | Why is this the only way to gain horizontal velocity when iris hits the bottom or the eye moves quickly ? | since there is no other horizontal force | private float apply Bounce ( float velocity , float dist Out Of Bounds , float simulation Rate ) { if ( is Zero ( dist Out Of Bounds ) ) { return velocity ; } velocity *= - NUM ; float bounce = BOUNCE MULTIPLIER * Math . abs ( dist Out Of Bounds / m Iris Radius ) ; if ( velocity > NUM ) { velocity += bounce * simulatio... | private float applyBounce ( float velocity , float distOutOfBounds , float simulationRate ) { if ( isZero ( distOutOfBounds ) ) { return velocity ; } velocity *= - _NUM ; float bounce = BOUNCE_MULTIPLIER * Math . abs ( distOutOfBounds / mIrisRadius ) ; if ( velocity > _NUM ) { velocity += bounce * simulationRate ; } el... | 89 |
java-test-4283 | java | For what purpose do velocity update ? | in response to bouncing off the sides of the eye ( i . e . , when iris hits the bottom or the eye moves quickly | private float apply Bounce ( float velocity , float dist Out Of Bounds , float simulation Rate ) { if ( is Zero ( dist Out Of Bounds ) ) { return velocity ; } velocity *= - NUM ; float bounce = BOUNCE MULTIPLIER * Math . abs ( dist Out Of Bounds / m Iris Radius ) ; if ( velocity > NUM ) { velocity += bounce * simulatio... | private float applyBounce ( float velocity , float distOutOfBounds , float simulationRate ) { if ( isZero ( distOutOfBounds ) ) { return velocity ; } velocity *= - _NUM ; float bounce = BOUNCE_MULTIPLIER * Math . abs ( distOutOfBounds / mIrisRadius ) ; if ( velocity > _NUM ) { velocity += bounce * simulationRate ; } el... | 89 |
java-test-4284 | java | What hits the bottom when ? | iris | private float apply Bounce ( float velocity , float dist Out Of Bounds , float simulation Rate ) { if ( is Zero ( dist Out Of Bounds ) ) { return velocity ; } velocity *= - NUM ; float bounce = BOUNCE MULTIPLIER * Math . abs ( dist Out Of Bounds / m Iris Radius ) ; if ( velocity > NUM ) { velocity += bounce * simulatio... | private float applyBounce ( float velocity , float distOutOfBounds , float simulationRate ) { if ( isZero ( distOutOfBounds ) ) { return velocity ; } velocity *= - _NUM ; float bounce = BOUNCE_MULTIPLIER * Math . abs ( distOutOfBounds / mIrisRadius ) ; if ( velocity > _NUM ) { velocity += bounce * simulationRate ; } el... | 89 |
java-test-4285 | java | What does iris hit when ? | the bottom | private float apply Bounce ( float velocity , float dist Out Of Bounds , float simulation Rate ) { if ( is Zero ( dist Out Of Bounds ) ) { return velocity ; } velocity *= - NUM ; float bounce = BOUNCE MULTIPLIER * Math . abs ( dist Out Of Bounds / m Iris Radius ) ; if ( velocity > NUM ) { velocity += bounce * simulatio... | private float applyBounce ( float velocity , float distOutOfBounds , float simulationRate ) { if ( isZero ( distOutOfBounds ) ) { return velocity ; } velocity *= - _NUM ; float bounce = BOUNCE_MULTIPLIER * Math . abs ( distOutOfBounds / mIrisRadius ) ; if ( velocity > _NUM ) { velocity += bounce * simulationRate ; } el... | 89 |
java-test-4286 | java | When is this the only way to gain horizontal velocity since there is no other horizontal force ? | when iris hits the bottom or the eye moves quickly | private float apply Bounce ( float velocity , float dist Out Of Bounds , float simulation Rate ) { if ( is Zero ( dist Out Of Bounds ) ) { return velocity ; } velocity *= - NUM ; float bounce = BOUNCE MULTIPLIER * Math . abs ( dist Out Of Bounds / m Iris Radius ) ; if ( velocity > NUM ) { velocity += bounce * simulatio... | private float applyBounce ( float velocity , float distOutOfBounds , float simulationRate ) { if ( isZero ( distOutOfBounds ) ) { return velocity ; } velocity *= - _NUM ; float bounce = BOUNCE_MULTIPLIER * Math . abs ( distOutOfBounds / mIrisRadius ) ; if ( velocity > _NUM ) { velocity += bounce * simulationRate ; } el... | 89 |
java-test-4288 | java | What does the code read ? | a value from a . properties file stored relative to the folder specified by the system property ' rapidminer . home | private static String read Config Property ( String relative Path , String property Key ) { String home = get Rapid Miner Home ( ) ; if ( home == null ) { log Warn ( STRING + relative Path + STRING ) ; return null ; } File property File = new File ( home , relative Path ) ; if ( property File . can Read ( ) ) { Propert... | private static String readConfigProperty ( String relativePath , String propertyKey ) { String home = getRapidMinerHome ( ) ; if ( home == null ) { logWarn ( STRING + relativePath + STRING ) ; return null ; } File propertyFile = new File ( home , relativePath ) ; if ( propertyFile . canRead ( ) ) { Properties props = n... | 168 |
java-test-4290 | java | What does an xml node represent ? | a collection of the environment parameters | public static Map parse Env Parameters ( Node p Node ) throws Policy Exception { Node node = null ; Set node Set = XML Utils . get Child Nodes ( p Node , ATTRIBUTE VALUE PAIR ) ; if ( node Set == null ) { debug . error ( STRING + ATTRIBUTE VALUE PAIR ) ; String objs [ ] = { ATTRIBUTE VALUE PAIR } ; throw new Policy Exc... | public static Map parseEnvParameters ( Node pNode ) throws PolicyException { Node node = null ; Set nodeSet = XMLUtils . getChildNodes ( pNode , ATTRIBUTE_VALUE_PAIR ) ; if ( nodeSet == null ) { debug . error ( STRING + ATTRIBUTE_VALUE_PAIR ) ; String objs [ ] = { ATTRIBUTE_VALUE_PAIR } ; throw new PolicyException ( Re... | 261 |
java-test-4293 | java | What does the code generate depending on the type of element ? | text describing its conceptual value and role | @ Override public void start Element ( String uri , String local Name , String name , Attributes attributes ) { fix White Space ( ) ; final String aria Label = attributes . get Value ( STRING ) ; final String alt = attributes . get Value ( STRING ) ; final String title = attributes . get Value ( STRING ) ; if ( aria La... | @ Override public void startElement ( String uri , String localName , String name , Attributes attributes ) { fixWhiteSpace ( ) ; final String ariaLabel = attributes . getValue ( STRING ) ; final String alt = attributes . getValue ( STRING ) ; final String title = attributes . getValue ( STRING ) ; if ( ariaLabel != nu... | 401 |
java-test-4294 | java | What is spoken after any content ? | the role text | @ Override public void start Element ( String uri , String local Name , String name , Attributes attributes ) { fix White Space ( ) ; final String aria Label = attributes . get Value ( STRING ) ; final String alt = attributes . get Value ( STRING ) ; final String title = attributes . get Value ( STRING ) ; if ( aria La... | @ Override public void startElement ( String uri , String localName , String name , Attributes attributes ) { fixWhiteSpace ( ) ; final String ariaLabel = attributes . getValue ( STRING ) ; final String alt = attributes . getValue ( STRING ) ; final String title = attributes . getValue ( STRING ) ; if ( ariaLabel != nu... | 401 |
java-test-4295 | java | For what purpose is it added to the stack ? | to wait for the closing tag | @ Override public void start Element ( String uri , String local Name , String name , Attributes attributes ) { fix White Space ( ) ; final String aria Label = attributes . get Value ( STRING ) ; final String alt = attributes . get Value ( STRING ) ; final String title = attributes . get Value ( STRING ) ; if ( aria La... | @ Override public void startElement ( String uri , String localName , String name , Attributes attributes ) { fixWhiteSpace ( ) ; final String ariaLabel = attributes . getValue ( STRING ) ; final String alt = attributes . getValue ( STRING ) ; final String title = attributes . getValue ( STRING ) ; if ( ariaLabel != nu... | 401 |
java-test-4296 | java | What do text describe ? | its conceptual value and role | @ Override public void start Element ( String uri , String local Name , String name , Attributes attributes ) { fix White Space ( ) ; final String aria Label = attributes . get Value ( STRING ) ; final String alt = attributes . get Value ( STRING ) ; final String title = attributes . get Value ( STRING ) ; if ( aria La... | @ Override public void startElement ( String uri , String localName , String name , Attributes attributes ) { fixWhiteSpace ( ) ; final String ariaLabel = attributes . getValue ( STRING ) ; final String alt = attributes . getValue ( STRING ) ; final String title = attributes . getValue ( STRING ) ; if ( ariaLabel != nu... | 401 |
java-test-4297 | java | Where is the role text spoken ? | after any content | @ Override public void start Element ( String uri , String local Name , String name , Attributes attributes ) { fix White Space ( ) ; final String aria Label = attributes . get Value ( STRING ) ; final String alt = attributes . get Value ( STRING ) ; final String title = attributes . get Value ( STRING ) ; if ( aria La... | @ Override public void startElement ( String uri , String localName , String name , Attributes attributes ) { fixWhiteSpace ( ) ; final String ariaLabel = attributes . getValue ( STRING ) ; final String alt = attributes . getValue ( STRING ) ; final String title = attributes . getValue ( STRING ) ; if ( ariaLabel != nu... | 401 |
java-test-4298 | java | What does the code draw ? | a dot file | public static void draw To Png ( final File dest , final Annotated Type Mirror type ) { try { final File dot File = File . create Temp File ( dest . get Name ( ) , STRING ) ; draw To Dot ( dot File , type ) ; exec Dot To Png ( dot File , dest ) ; } catch ( Exception exc ) { throw new Runtime Exception ( exc ) ; } } | public static void drawToPng ( final File dest , final AnnotatedTypeMirror type ) { try { final File dotFile = File . createTempFile ( dest . getName ( ) , STRING ) ; drawToDot ( dotFile , type ) ; execDotToPng ( dotFile , dest ) ; } catch ( Exception exc ) { throw new RuntimeException ( exc ) ; } } | 79 |
java-test-4299 | java | What does the code generate ? | a one - dimensional array of normal random doubles | public static double [ ] ndary ( int n ) { double d [ ] = new double [ n ] ; for ( int i = NUM ; i < n ; i ++ ) { d [ i ] = R . next Gaussian ( ) ; } return d ; } | public static double [ ] ndary ( int n ) { double d [ ] = new double [ n ] ; for ( int i = _NUM ; i < n ; i ++ ) { d [ i ] = R . nextGaussian ( ) ; } return d ; } | 54 |
java-test-4300 | java | What do the given automaton use ? | the given set of initial states | public static Automaton determinize Simple ( Automaton a , Set < Integer > initialset ) { if ( a . get Num States ( ) == NUM ) { return a ; } int [ ] points = a . get Start Points ( ) ; Map < Set < Integer > , Set < Integer > > sets = new Hash Map < > ( ) ; Linked List < Set < Integer > > worklist = new Linked List < >... | public static Automaton determinizeSimple ( Automaton a , Set < Integer > initialset ) { if ( a . getNumStates ( ) == _NUM ) { return a ; } int [ ] points = a . getStartPoints ( ) ; Map < Set < Integer > , Set < Integer > > sets = new HashMap < > ( ) ; LinkedList < Set < Integer > > worklist = new LinkedList < > ( ) ; ... | 462 |
java-test-4301 | java | What determinizes the given automaton simple simple ? | original brics implementation of determinize | public static Automaton determinize Simple ( Automaton a , Set < Integer > initialset ) { if ( a . get Num States ( ) == NUM ) { return a ; } int [ ] points = a . get Start Points ( ) ; Map < Set < Integer > , Set < Integer > > sets = new Hash Map < > ( ) ; Linked List < Set < Integer > > worklist = new Linked List < >... | public static Automaton determinizeSimple ( Automaton a , Set < Integer > initialset ) { if ( a . getNumStates ( ) == _NUM ) { return a ; } int [ ] points = a . getStartPoints ( ) ; Map < Set < Integer > , Set < Integer > > sets = new HashMap < > ( ) ; LinkedList < Set < Integer > > worklist = new LinkedList < > ( ) ; ... | 462 |
java-test-4302 | java | What does the code create ? | a set of protected properties from a set of normal ones | public Protected Properties ( Properties props ) { Enumeration < ? > prop Enum = props . property Names ( ) ; while ( prop Enum . has More Elements ( ) ) { String prop Name = ( String ) prop Enum . next Element ( ) ; String prop Value = props . get Property ( prop Name ) ; super . set Property ( prop Name , prop Value ... | public ProtectedProperties ( Properties props ) { Enumeration < ? > propEnum = props . propertyNames ( ) ; while ( propEnum . hasMoreElements ( ) ) { String propName = ( String ) propEnum . nextElement ( ) ; String propValue = props . getProperty ( propName ) ; super . setProperty ( propName , propValue ) ; } closed = ... | 80 |
java-test-4303 | java | What does the code compute using optimized parameter values and the testing instance ? | the posterior distribution | private double [ ] evaluate Probability ( double [ ] data ) { double [ ] prob = new double [ m Num Classes ] , v = new double [ m Num Classes ] ; for ( int j = NUM ; j < m Num Classes - NUM ; j ++ ) { for ( int k = NUM ; k <= m Num Predictors ; k ++ ) { v [ j ] += m Par [ k ] [ j ] * data [ k ] ; } } v [ m Num Classes ... | private double [ ] evaluateProbability ( double [ ] data ) { double [ ] prob = new double [ m_NumClasses ] , v = new double [ m_NumClasses ] ; for ( int j = _NUM ; j < m_NumClasses - _NUM ; j ++ ) { for ( int k = _NUM ; k <= m_NumPredictors ; k ++ ) { v [ j ] += m_Par [ k ] [ j ] * data [ k ] ; } } v [ m_NumClasses - _... | 190 |
java-test-4304 | java | How does the code compute the posterior distribution ? | using optimized parameter values and the testing instance | private double [ ] evaluate Probability ( double [ ] data ) { double [ ] prob = new double [ m Num Classes ] , v = new double [ m Num Classes ] ; for ( int j = NUM ; j < m Num Classes - NUM ; j ++ ) { for ( int k = NUM ; k <= m Num Predictors ; k ++ ) { v [ j ] += m Par [ k ] [ j ] * data [ k ] ; } } v [ m Num Classes ... | private double [ ] evaluateProbability ( double [ ] data ) { double [ ] prob = new double [ m_NumClasses ] , v = new double [ m_NumClasses ] ; for ( int j = _NUM ; j < m_NumClasses - _NUM ; j ++ ) { for ( int k = _NUM ; k <= m_NumPredictors ; k ++ ) { v [ j ] += m_Par [ k ] [ j ] * data [ k ] ; } } v [ m_NumClasses - _... | 190 |
java-test-4305 | java | How does the local device initiate connections and disconnections in this test ? | with a hands free device | public void test Connect Headset ( ) { int iterations = Bluetooth Test Runner . s Connect Headset Iterations ; if ( iterations == NUM ) { return ; } Bluetooth Adapter adapter = Bluetooth Adapter . get Default Adapter ( ) ; Bluetooth Device device = adapter . get Remote Device ( Bluetooth Test Runner . s Device Address ... | public void testConnectHeadset ( ) { int iterations = BluetoothTestRunner . sConnectHeadsetIterations ; if ( iterations == _NUM ) { return ; } BluetoothAdapter adapter = BluetoothAdapter . getDefaultAdapter ( ) ; BluetoothDevice device = adapter . getRemoteDevice ( BluetoothTestRunner . sDeviceAddress ) ; mTestUtils . ... | 248 |
java-test-4306 | java | What does the local device play in this test ? | the role of an hfp audio gateway | public void test Connect Headset ( ) { int iterations = Bluetooth Test Runner . s Connect Headset Iterations ; if ( iterations == NUM ) { return ; } Bluetooth Adapter adapter = Bluetooth Adapter . get Default Adapter ( ) ; Bluetooth Device device = adapter . get Remote Device ( Bluetooth Test Runner . s Device Address ... | public void testConnectHeadset ( ) { int iterations = BluetoothTestRunner . sConnectHeadsetIterations ; if ( iterations == _NUM ) { return ; } BluetoothAdapter adapter = BluetoothAdapter . getDefaultAdapter ( ) ; BluetoothDevice device = adapter . getRemoteDevice ( BluetoothTestRunner . sDeviceAddress ) ; mTestUtils . ... | 248 |
java-test-4307 | java | What does trig use ? | to find legth of the hypotenuse | private double find Length ( Point origin Point , Point target Point ) { int x1 = origin Point . x ; int y1 = origin Point . y ; int x2 = target Point . x ; int y2 = target Point . y ; double side A = x2 - x1 ; double side B = ( y1 > y2 ? ( y1 - y2 ) : ( y2 - y1 ) ) ; if ( side B == NUM ) { return side A ; } return Mat... | private double findLength ( Point originPoint , Point targetPoint ) { int x1 = originPoint . x ; int y1 = originPoint . y ; int x2 = targetPoint . x ; int y2 = targetPoint . y ; double sideA = x2 - x1 ; double sideB = ( y1 > y2 ? ( y1 - y2 ) : ( y2 - y1 ) ) ; if ( sideB == _NUM ) { return sideA ; } return Math . sqrt (... | 116 |
java-test-4308 | java | How does the child component center ? | relative to its parent component | public static final void center Child To Parent ( final Component parent , final Component child , final boolean b Stay On Screen ) { int x = ( parent . get X ( ) + ( parent . get Width ( ) / NUM ) ) - ( child . get Width ( ) / NUM ) ; int y = ( parent . get Y ( ) + ( parent . get Height ( ) / NUM ) ) - ( child . get H... | public static final void centerChildToParent ( final Component parent , final Component child , final boolean bStayOnScreen ) { int x = ( parent . getX ( ) + ( parent . getWidth ( ) / _NUM ) ) - ( child . getWidth ( ) / _NUM ) ; int y = ( parent . getY ( ) + ( parent . getHeight ( ) / _NUM ) ) - ( child . getHeight ( )... | 251 |
java-test-4309 | java | Where did each child element encounter ? | in the xml stream | @ Override public SOAP Handler on Start Child ( String namespace , String local Name , String prefix , Attributes attributes , Deserialization Context context ) throws SAX Exception { handle Mixed Content ( ) ; Bean Property Descriptor prop Desc = null ; Field Desc field Desc = null ; SOAP Constants soap Constants = co... | @ Override public SOAPHandler onStartChild ( String namespace , String localName , String prefix , Attributes attributes , DeserializationContext context ) throws SAXException { handleMixedContent ( ) ; BeanPropertyDescriptor propDesc = null ; FieldDesc fieldDesc = null ; SOAPConstants soapConstants = context . getSOAP... | 1,131 |
java-test-4310 | java | What encountered in the xml stream ? | each child element | @ Override public SOAP Handler on Start Child ( String namespace , String local Name , String prefix , Attributes attributes , Deserialization Context context ) throws SAX Exception { handle Mixed Content ( ) ; Bean Property Descriptor prop Desc = null ; Field Desc field Desc = null ; SOAP Constants soap Constants = co... | @ Override public SOAPHandler onStartChild ( String namespace , String localName , String prefix , Attributes attributes , DeserializationContext context ) throws SAXException { handleMixedContent ( ) ; BeanPropertyDescriptor propDesc = null ; FieldDesc fieldDesc = null ; SOAPConstants soapConstants = context . getSOAP... | 1,131 |
java-test-4312 | java | What does the code take ? | a hex stream | public static byte [ ] hex Stream To Byte Array ( String hex Stream ) { int length = hex Stream . length ( ) ; byte [ ] data = new byte [ length / NUM ] ; for ( int i = NUM ; i < length ; i += NUM ) { data [ i / NUM ] = ( byte ) ( ( Character . digit ( hex Stream . char At ( i ) , NUM ) << NUM ) + Character . digit ( h... | public static byte [ ] hexStreamToByteArray ( String hexStream ) { int length = hexStream . length ( ) ; byte [ ] data = new byte [ length / _NUM ] ; for ( int i = _NUM ; i < length ; i += _NUM ) { data [ i / _NUM ] = ( byte ) ( ( Character . digit ( hexStream . charAt ( i ) , _NUM ) << _NUM ) + Character . digit ( hex... | 110 |
java-test-4313 | java | What does the code return ? | the corresponding byte array | public static byte [ ] hex Stream To Byte Array ( String hex Stream ) { int length = hex Stream . length ( ) ; byte [ ] data = new byte [ length / NUM ] ; for ( int i = NUM ; i < length ; i += NUM ) { data [ i / NUM ] = ( byte ) ( ( Character . digit ( hex Stream . char At ( i ) , NUM ) << NUM ) + Character . digit ( h... | public static byte [ ] hexStreamToByteArray ( String hexStream ) { int length = hexStream . length ( ) ; byte [ ] data = new byte [ length / _NUM ] ; for ( int i = _NUM ; i < length ; i += _NUM ) { data [ i / _NUM ] = ( byte ) ( ( Character . digit ( hexStream . charAt ( i ) , _NUM ) << _NUM ) + Character . digit ( hex... | 110 |
java-test-4314 | java | What is specified in outfilemetadata ? | information about which block files should be read | protected void merge Output File ( T stitched File Meta Data ) throws IO Exception { merge Blocks ( stitched File Meta Data ) ; successful Files . add ( stitched File Meta Data ) ; LOG . debug ( STRING , stitched File Meta Data . get Stitched File Relative Path ( ) ) ; } | protected void mergeOutputFile ( T stitchedFileMetaData ) throws IOException { mergeBlocks ( stitchedFileMetaData ) ; successfulFiles . add ( stitchedFileMetaData ) ; LOG . debug ( STRING , stitchedFileMetaData . getStitchedFileRelativePath ( ) ) ; } | 57 |
java-test-4315 | java | Where is information about which block files should be read specified ? | in outfilemetadata | protected void merge Output File ( T stitched File Meta Data ) throws IO Exception { merge Blocks ( stitched File Meta Data ) ; successful Files . add ( stitched File Meta Data ) ; LOG . debug ( STRING , stitched File Meta Data . get Stitched File Relative Path ( ) ) ; } | protected void mergeOutputFile ( T stitchedFileMetaData ) throws IOException { mergeBlocks ( stitchedFileMetaData ) ; successfulFiles . add ( stitchedFileMetaData ) ; LOG . debug ( STRING , stitchedFileMetaData . getStitchedFileRelativePath ( ) ) ; } | 57 |
java-test-4316 | java | What did the code read ? | data from block files | protected void merge Output File ( T stitched File Meta Data ) throws IO Exception { merge Blocks ( stitched File Meta Data ) ; successful Files . add ( stitched File Meta Data ) ; LOG . debug ( STRING , stitched File Meta Data . get Stitched File Relative Path ( ) ) ; } | protected void mergeOutputFile ( T stitchedFileMetaData ) throws IOException { mergeBlocks ( stitchedFileMetaData ) ; successfulFiles . add ( stitchedFileMetaData ) ; LOG . debug ( STRING , stitchedFileMetaData . getStitchedFileRelativePath ( ) ) ; } | 57 |
java-test-4317 | java | How does the code insert a term into this document ? | with given payload | public void insert ( String t , PAYLOAD payload ) { insert ( t ) ; List < PAYLOAD > nn = null ; if ( ( nn = term blocks . get ( t ) ) == null ) { term blocks . put ( t , nn = new Array List < PAYLOAD > ( NUM ) ) ; } if ( payload != null ) { nn . add ( payload ) ; } block Count ++ ; } | public void insert ( String t , PAYLOAD payload ) { insert ( t ) ; List < PAYLOAD > nn = null ; if ( ( nn = term_blocks . get ( t ) ) == null ) { term_blocks . put ( t , nn = new ArrayList < PAYLOAD > ( _NUM ) ) ; } if ( payload != null ) { nn . add ( payload ) ; } blockCount ++ ; } | 82 |
java-test-4318 | java | What does the code build ? | the in - window quit dialog | private Internal Managed Window build Quit Dialog ( ) { J Component content = new J Component ( ) { } ; content . set Layout ( new Grid Layout ( NUM , NUM , PADDING , PADDING ) ) ; content . set Border ( Border Factory . create Empty Border ( PADDING , PADDING , PADDING , PADDING ) ) ; content . set Focus Cycle Root ( ... | private InternalManagedWindow buildQuitDialog ( ) { JComponent content = new JComponent ( ) { } ; content . setLayout ( new GridLayout ( _NUM , _NUM , PADDING , PADDING ) ) ; content . setBorder ( BorderFactory . createEmptyBorder ( PADDING , PADDING , PADDING , PADDING ) ) ; content . setFocusCycleRoot ( _BOOL ) ; con... | 252 |
java-test-4319 | java | What does the code moralize ? | dag | public boolean [ ] [ ] moralize ( Bayes Net bayes Net ) { int n Nodes = bayes Net . get Nr Of Nodes ( ) ; boolean [ ] [ ] b Adjacency Matrix = new boolean [ n Nodes ] [ n Nodes ] ; for ( int i Node = NUM ; i Node < n Nodes ; i Node ++ ) { Parent Set parents = bayes Net . get Parent Sets ( ) [ i Node ] ; moralize Node (... | public boolean [ ] [ ] moralize ( BayesNet bayesNet ) { int nNodes = bayesNet . getNrOfNodes ( ) ; boolean [ ] [ ] bAdjacencyMatrix = new boolean [ nNodes ] [ nNodes ] ; for ( int iNode = _NUM ; iNode < nNodes ; iNode ++ ) { ParentSet parents = bayesNet . getParentSets ( ) [ iNode ] ; moralizeNode ( parents , iNode , b... | 104 |
java-test-4320 | java | What do the directed acyclic graph convert effecively ? | to an undirected graph | public boolean [ ] [ ] moralize ( Bayes Net bayes Net ) { int n Nodes = bayes Net . get Nr Of Nodes ( ) ; boolean [ ] [ ] b Adjacency Matrix = new boolean [ n Nodes ] [ n Nodes ] ; for ( int i Node = NUM ; i Node < n Nodes ; i Node ++ ) { Parent Set parents = bayes Net . get Parent Sets ( ) [ i Node ] ; moralize Node (... | public boolean [ ] [ ] moralize ( BayesNet bayesNet ) { int nNodes = bayesNet . getNrOfNodes ( ) ; boolean [ ] [ ] bAdjacencyMatrix = new boolean [ nNodes ] [ nNodes ] ; for ( int iNode = _NUM ; iNode < nNodes ; iNode ++ ) { ParentSet parents = bayesNet . getParentSets ( ) [ iNode ] ; moralizeNode ( parents , iNode , b... | 104 |
java-test-4321 | java | How do the directed acyclic graph convert to an undirected graph ? | effecively | public boolean [ ] [ ] moralize ( Bayes Net bayes Net ) { int n Nodes = bayes Net . get Nr Of Nodes ( ) ; boolean [ ] [ ] b Adjacency Matrix = new boolean [ n Nodes ] [ n Nodes ] ; for ( int i Node = NUM ; i Node < n Nodes ; i Node ++ ) { Parent Set parents = bayes Net . get Parent Sets ( ) [ i Node ] ; moralize Node (... | public boolean [ ] [ ] moralize ( BayesNet bayesNet ) { int nNodes = bayesNet . getNrOfNodes ( ) ; boolean [ ] [ ] bAdjacencyMatrix = new boolean [ nNodes ] [ nNodes ] ; for ( int iNode = _NUM ; iNode < nNodes ; iNode ++ ) { ParentSet parents = bayesNet . getParentSets ( ) [ iNode ] ; moralizeNode ( parents , iNode , b... | 104 |
java-test-4322 | java | What is converting to an undirected graph effecively ? | the directed acyclic graph | public boolean [ ] [ ] moralize ( Bayes Net bayes Net ) { int n Nodes = bayes Net . get Nr Of Nodes ( ) ; boolean [ ] [ ] b Adjacency Matrix = new boolean [ n Nodes ] [ n Nodes ] ; for ( int i Node = NUM ; i Node < n Nodes ; i Node ++ ) { Parent Set parents = bayes Net . get Parent Sets ( ) [ i Node ] ; moralize Node (... | public boolean [ ] [ ] moralize ( BayesNet bayesNet ) { int nNodes = bayesNet . getNrOfNodes ( ) ; boolean [ ] [ ] bAdjacencyMatrix = new boolean [ nNodes ] [ nNodes ] ; for ( int iNode = _NUM ; iNode < nNodes ; iNode ++ ) { ParentSet parents = bayesNet . getParentSets ( ) [ iNode ] ; moralizeNode ( parents , iNode , b... | 104 |
java-test-4323 | java | What does the code calculate ? | adjacency matrix representation for a bayes network | public boolean [ ] [ ] moralize ( Bayes Net bayes Net ) { int n Nodes = bayes Net . get Nr Of Nodes ( ) ; boolean [ ] [ ] b Adjacency Matrix = new boolean [ n Nodes ] [ n Nodes ] ; for ( int i Node = NUM ; i Node < n Nodes ; i Node ++ ) { Parent Set parents = bayes Net . get Parent Sets ( ) [ i Node ] ; moralize Node (... | public boolean [ ] [ ] moralize ( BayesNet bayesNet ) { int nNodes = bayesNet . getNrOfNodes ( ) ; boolean [ ] [ ] bAdjacencyMatrix = new boolean [ nNodes ] [ nNodes ] ; for ( int iNode = _NUM ; iNode < nNodes ; iNode ++ ) { ParentSet parents = bayesNet . getParentSets ( ) [ iNode ] ; moralizeNode ( parents , iNode , b... | 104 |
java-test-4325 | java | What does the code add under the given name under the given name ? | a script field | public Search Source Builder script Field ( String name , Script script ) { if ( script Fields == null ) { script Fields = new Array List < > ( ) ; } script Fields . add ( new Script Field ( name , script ) ) ; return this ; } | public SearchSourceBuilder scriptField ( String name , Script script ) { if ( scriptFields == null ) { scriptFields = new ArrayList < > ( ) ; } scriptFields . add ( new ScriptField ( name , script ) ) ; return this ; } | 53 |
java-test-4326 | java | When does the inner rectangle fit ? | while maintaining aspect ratio | public void fixed Aspect Resize Inner ( Rect F new Inner ) { Matrix m = get Rot Matrix ( ) ; Matrix m0 = get Inverse Rot Matrix ( ) ; float aspect W = inner . width ( ) ; float aspect H = inner . height ( ) ; float asp Ratio = aspect W / aspect H ; float [ ] corners = Crop Math . get Corners From Rect ( outer ) ; m . m... | public void fixedAspectResizeInner ( RectF newInner ) { Matrix m = getRotMatrix ( ) ; Matrix m0 = getInverseRotMatrix ( ) ; float aspectW = inner . width ( ) ; float aspectH = inner . height ( ) ; float aspRatio = aspectW / aspectH ; float [ ] corners = CropMath . getCornersFromRect ( outer ) ; m . mapPoints ( corners ... | 744 |
java-test-4327 | java | For what purpose does the inner rectangle clip if this would cause it to leave the bounding rect ? | to fit while maintaining aspect ratio | public void fixed Aspect Resize Inner ( Rect F new Inner ) { Matrix m = get Rot Matrix ( ) ; Matrix m0 = get Inverse Rot Matrix ( ) ; float aspect W = inner . width ( ) ; float aspect H = inner . height ( ) ; float asp Ratio = aspect W / aspect H ; float [ ] corners = Crop Math . get Corners From Rect ( outer ) ; m . m... | public void fixedAspectResizeInner ( RectF newInner ) { Matrix m = getRotMatrix ( ) ; Matrix m0 = getInverseRotMatrix ( ) ; float aspectW = inner . width ( ) ; float aspectH = inner . height ( ) ; float aspRatio = aspectW / aspectH ; float [ ] corners = CropMath . getCornersFromRect ( outer ) ; m . mapPoints ( corners ... | 744 |
java-test-4328 | java | For what purpose do the values of the registers to be written read along with the reference and count ? | for the registers | public void read Data ( Data Input input ) throws IO Exception { read Reference = input . read Unsigned Short ( ) ; read Count = input . read Unsigned Short ( ) ; write Reference = input . read Unsigned Short ( ) ; write Count = input . read Unsigned Short ( ) ; int byte Count = input . read Unsigned Byte ( ) ; if ( no... | public void readData ( DataInput input ) throws IOException { readReference = input . readUnsignedShort ( ) ; readCount = input . readUnsignedShort ( ) ; writeReference = input . readUnsignedShort ( ) ; writeCount = input . readUnsignedShort ( ) ; int byteCount = input . readUnsignedByte ( ) ; if ( nonWordDataHandler =... | 183 |
java-test-4329 | java | How do the values of the registers to be written read for the registers for the registers ? | along with the reference and count | public void read Data ( Data Input input ) throws IO Exception { read Reference = input . read Unsigned Short ( ) ; read Count = input . read Unsigned Short ( ) ; write Reference = input . read Unsigned Short ( ) ; write Count = input . read Unsigned Short ( ) ; int byte Count = input . read Unsigned Byte ( ) ; if ( no... | public void readData ( DataInput input ) throws IOException { readReference = input . readUnsignedShort ( ) ; readCount = input . readUnsignedShort ( ) ; writeReference = input . readUnsignedShort ( ) ; writeCount = input . readUnsignedShort ( ) ; int byteCount = input . readUnsignedByte ( ) ; if ( nonWordDataHandler =... | 183 |
java-test-4330 | java | What does the code create ? | a new pageimporterimpl with the given dependencies | @ Inject Page Importer Impl ( Entry Updater entry Updater , Entry Uploader entry Uploader , Page Parser page Parser , Relative Link Converter link Converter , Revisions Importer revisions Importer ) { this . entry Updater = check Not Null ( entry Updater ) ; this . entry Uploader = check Not Null ( entry Uploader ) ; t... | @ Inject PageImporterImpl ( EntryUpdater entryUpdater , EntryUploader entryUploader , PageParser pageParser , RelativeLinkConverter linkConverter , RevisionsImporter revisionsImporter ) { this . entryUpdater = checkNotNull ( entryUpdater ) ; this . entryUploader = checkNotNull ( entryUploader ) ; this . pageParser = ch... | 99 |
java-test-4332 | java | What does each operation lock where ? | only a single resource ( high concurrency condition with 100 threads ) | public void test single Resource Locking waits For high Concurrency 100 ( ) throws Exception { final Properties properties = new Properties ( ) ; final int nthreads = NUM ; final int ntasks = NUM ; properties . set Property ( Test Options . CORE POOL SIZE , STRING + nthreads ) ; properties . set Property ( Test Options... | public void test_singleResourceLocking_waitsFor_highConcurrency100 ( ) throws Exception { final Properties properties = new Properties ( ) ; final int nthreads = _NUM ; final int ntasks = _NUM ; properties . setProperty ( TestOptions . CORE_POOL_SIZE , STRING + nthreads ) ; properties . setProperty ( TestOptions . NTAS... | 226 |
java-test-4333 | java | What contains just the node passed to this method ? | the list of selected nodes | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4334 | java | What appear the ? | the nodes | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4335 | java | What does the code add to the list of selected nodes ? | the specified node | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4336 | java | What did we insert if it was not present at the appropriate spot in the array then ? | the node | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4337 | java | What will the list of selected nodes be do set if no modifier key is depressed ? | to contain just the node passed to this method | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4338 | java | Do we do a continuous range select ? | No | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4339 | java | What did the list of selected nodes contain ? | just the node passed to this method | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4340 | java | Where do one or more nodes exist ? | in the selected nodes list | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4341 | java | In which direction did we do a continuous range selection if it does not fall within if it does not fall within ? | to the last node that was selected , not the closest | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4342 | java | What do we not allow ? | selects to span multiple depths in the tree | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4343 | java | Do we allow selects to span multiple depths in the tree ? | No | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4344 | java | When did select list sort ? | already | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4345 | java | What do we connect to the nearest selected node if it does not fall within from the specified node ? | the contiguous range of nodes | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4346 | java | When is the node present ? | already | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4347 | java | What do we unselect was not present then ? | the node | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4348 | java | Where did we insert the node if it was not present then ? | at the appropriate spot in the array | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4349 | java | Where do the nodes appear ? | the | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4350 | java | What will be do set to contain just the node passed to this method if no modifier key is depressed ? | the list of selected nodes | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4351 | java | Do we span multiple depths in the tree ? | No | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4352 | java | In which direction do we connect the contiguous range of nodes to the nearest selected node if it does not fall within ? | from the specified node | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4353 | java | What exists in the selected nodes list ? | one or more nodes | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4354 | java | How be the list of selected nodes sorted ? | in the same direction that the nodes appear in the tree | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4355 | java | What be we allow only ? | nodes to be in the selected list that are peers in the tree | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4356 | java | What do we attempt if shift is depressed then ? | to do a continuous range select | public boolean select Node ( D node Data , Signal Event event ) { if ( selected Nodes . is Empty ( ) ) { insert And Select Node ( node Data , NUM , BOOL ) ; return BOOL ; } if ( ! has Same Parent ( selected Nodes . get ( NUM ) , node Data ) ) { if ( ! this . multilevel Selection || event . get Shift Key ( ) ) { return ... | public boolean selectNode ( D nodeData , SignalEvent event ) { if ( selectedNodes . isEmpty ( ) ) { insertAndSelectNode ( nodeData , _NUM , _BOOL ) ; return _BOOL ; } if ( ! hasSameParent ( selectedNodes . get ( _NUM ) , nodeData ) ) { if ( ! this . multilevelSelection || event . getShiftKey ( ) ) { return selectSingle... | 149 |
java-test-4357 | java | What does the code compute ? | the distance between two coordinates | public static double distance ( Coordinate DD p1 , Coordinate DD p2 , UNITS units ) { final double lat P 1 = p1 . north South ; final double lat P 2 = p2 . north South ; final double lon P 1 = p1 . east West ; final double lon P 2 = p2 . east West ; if ( lat P 1 == lat P 2 && lon P 1 == lon P 2 ) return NUM ; double di... | public static double distance ( CoordinateDD p1 , CoordinateDD p2 , UNITS units ) { final double latP1 = p1 . northSouth ; final double latP2 = p2 . northSouth ; final double lonP1 = p1 . eastWest ; final double lonP2 = p2 . eastWest ; if ( latP1 == latP2 && lonP1 == lonP2 ) return _NUM ; double distRad = Math . acos (... | 192 |
java-test-4358 | java | What is allowing escape sequences ' \ \ ' , ' \ $ ' , and ' \ # ' ? | an el | private String skip Until EL ( ) { char prev = NUM ; String Builder buf = new String Builder ( ) ; while ( has Next Char ( ) ) { char ch = next Char ( ) ; if ( prev == STRING ) { prev = NUM ; if ( ch == STRING ) { buf . append ( STRING ) ; if ( ! escape BS ) prev = STRING ; } else if ( ch == STRING || ch == STRING ) { ... | private String skipUntilEL ( ) { char prev = _NUM ; StringBuilder buf = new StringBuilder ( ) ; while ( hasNextChar ( ) ) { char ch = nextChar ( ) ; if ( prev == STRING ) { prev = _NUM ; if ( ch == STRING ) { buf . append ( STRING ) ; if ( ! escapeBS ) prev = STRING ; } else if ( ch == STRING || ch == STRING ) { buf . ... | 229 |
java-test-4359 | java | What did an el allow ? | escape sequences ' \ \ ' , ' \ $ ' , and ' \ # ' | private String skip Until EL ( ) { char prev = NUM ; String Builder buf = new String Builder ( ) ; while ( has Next Char ( ) ) { char ch = next Char ( ) ; if ( prev == STRING ) { prev = NUM ; if ( ch == STRING ) { buf . append ( STRING ) ; if ( ! escape BS ) prev = STRING ; } else if ( ch == STRING || ch == STRING ) { ... | private String skipUntilEL ( ) { char prev = _NUM ; StringBuilder buf = new StringBuilder ( ) ; while ( hasNextChar ( ) ) { char ch = nextChar ( ) ; if ( prev == STRING ) { prev = _NUM ; if ( ch == STRING ) { buf . append ( STRING ) ; if ( ! escapeBS ) prev = STRING ; } else if ( ch == STRING || ch == STRING ) { buf . ... | 229 |
java-test-4360 | java | What does a group contain ? | the primary space and all of its backup - only members | public void build Election Groups ( String space Name ) { if ( ( election Groups = build Election Groups ( m Write FO Policy ) ) == null && ( election Groups = build Election Groups ( m Take FO Policy ) ) == null && ( election Groups = build Election Groups ( m Read FO Policy ) ) == null && ( election Groups = build El... | public void buildElectionGroups ( String spaceName ) { if ( ( _electionGroups = buildElectionGroups ( m_WriteFOPolicy ) ) == null && ( _electionGroups = buildElectionGroups ( m_TakeFOPolicy ) ) == null && ( _electionGroups = buildElectionGroups ( m_ReadFOPolicy ) ) == null && ( _electionGroups = buildElectionGroups ( m... | 169 |
java-test-4361 | java | What does the code build ? | all the election groups | public void build Election Groups ( String space Name ) { if ( ( election Groups = build Election Groups ( m Write FO Policy ) ) == null && ( election Groups = build Election Groups ( m Take FO Policy ) ) == null && ( election Groups = build Election Groups ( m Read FO Policy ) ) == null && ( election Groups = build El... | public void buildElectionGroups ( String spaceName ) { if ( ( _electionGroups = buildElectionGroups ( m_WriteFOPolicy ) ) == null && ( _electionGroups = buildElectionGroups ( m_TakeFOPolicy ) ) == null && ( _electionGroups = buildElectionGroups ( m_ReadFOPolicy ) ) == null && ( _electionGroups = buildElectionGroups ( m... | 169 |
java-test-4362 | java | What writes in the document ? | every vector field | protected final void add All Doc Vectors ( Fields vectors , Merge State merge State ) throws IO Exception { if ( vectors == null ) { start Document ( NUM ) ; finish Document ( ) ; return ; } int num Fields = vectors . size ( ) ; if ( num Fields == - NUM ) { num Fields = NUM ; for ( final Iterator < String > it = vector... | protected final void addAllDocVectors ( Fields vectors , MergeState mergeState ) throws IOException { if ( vectors == null ) { startDocument ( _NUM ) ; finishDocument ( ) ; return ; } int numFields = vectors . size ( ) ; if ( numFields == - _NUM ) { numFields = _NUM ; for ( final Iterator < String > it = vectors . iter... | 624 |
java-test-4365 | java | How do an update on status request ? | by sending an xpressnet message | public void request Update From Layout ( ) { X Net Message msg = X Net Message . get Feedback Request Msg ( baseaddress , ( nibble == NUM ) ) ; msg . set Element ( NUM , baseaddress ) ; msg . set Parity ( ) ; synchronized ( this ) { status Requested = BOOL ; } tc . send X Net Message ( msg , null ) ; } | public void requestUpdateFromLayout ( ) { XNetMessage msg = XNetMessage . getFeedbackRequestMsg ( baseaddress , ( nibble == _NUM ) ) ; msg . setElement ( _NUM , baseaddress ) ; msg . setParity ( ) ; synchronized ( this ) { statusRequested = _BOOL ; } tc . sendXNetMessage ( msg , null ) ; } | 73 |
java-test-4366 | java | How is in non fixed width alignment done ? | by flowlayout ' s orientation | private void adjust Alignment ( int align , int cur Align ) { if ( ( ! FIXED WIDTH ) && ( align != cur Align ) ) { if ( cur Line . get Component Count ( ) == NUM ) { cur Line . set Layout ( new Flow Layout ( cur Align ) ) ; } } } | private void adjustAlignment ( int align , int curAlign ) { if ( ( ! FIXED_WIDTH ) && ( align != curAlign ) ) { if ( curLine . getComponentCount ( ) == _NUM ) { curLine . setLayout ( new FlowLayout ( curAlign ) ) ; } } } | 61 |
java-test-4367 | java | How will a new line be opened in case the line is not empty ? | by newlineifnotempty below | private void adjust Alignment ( int align , int cur Align ) { if ( ( ! FIXED WIDTH ) && ( align != cur Align ) ) { if ( cur Line . get Component Count ( ) == NUM ) { cur Line . set Layout ( new Flow Layout ( cur Align ) ) ; } } } | private void adjustAlignment ( int align , int curAlign ) { if ( ( ! FIXED_WIDTH ) && ( align != curAlign ) ) { if ( curLine . getComponentCount ( ) == _NUM ) { curLine . setLayout ( new FlowLayout ( curAlign ) ) ; } } } | 61 |
java-test-4368 | java | What does the following replace with the correct alignment ? | the layout of the curline container | private void adjust Alignment ( int align , int cur Align ) { if ( ( ! FIXED WIDTH ) && ( align != cur Align ) ) { if ( cur Line . get Component Count ( ) == NUM ) { cur Line . set Layout ( new Flow Layout ( cur Align ) ) ; } } } | private void adjustAlignment ( int align , int curAlign ) { if ( ( ! FIXED_WIDTH ) && ( align != curAlign ) ) { if ( curLine . getComponentCount ( ) == _NUM ) { curLine . setLayout ( new FlowLayout ( curAlign ) ) ; } } } | 61 |
java-test-4369 | java | What will have infinite cardinality so that optionals get placed at the end ? | any join involving an optional | protected long compute Join Cardinality ( I Join Dimension d1 , I Join Dimension d2 ) { final boolean shared Vars = has Shared Vars ( d1 , d2 ) ; final boolean unshared Vars = has Unshared Vars ( d1 , d2 ) ; final long join Cardinality ; if ( shared Vars == BOOL ) { join Cardinality = NO SHARED VARS ; } else { if ( uns... | protected long computeJoinCardinality ( IJoinDimension d1 , IJoinDimension d2 ) { final boolean sharedVars = hasSharedVars ( d1 , d2 ) ; final boolean unsharedVars = hasUnsharedVars ( d1 , d2 ) ; final long joinCardinality ; if ( sharedVars == _BOOL ) { joinCardinality = NO_SHARED_VARS ; } else { if ( unsharedVars == _... | 169 |
java-test-4370 | java | What did the shift need ? | to be applied to the points in order to position upper and left borders of their bounding box at the given lines | private float [ ] calculate Shift To Position B Box Of Points At ( float left , float top , List < Point > points ) { double min X = Double . MAX VALUE ; double max Y = - Double . MAX VALUE ; for ( Point point : points ) { min X = Math . min ( point . get X ( ) , min X ) ; max Y = Math . max ( point . get Y ( ) , max Y... | private float [ ] calculateShiftToPositionBBoxOfPointsAt ( float left , float top , List < Point > points ) { double minX = Double . MAX_VALUE ; double maxY = - Double . MAX_VALUE ; for ( Point point : points ) { minX = Math . min ( point . getX ( ) , minX ) ; maxY = Math . max ( point . getY ( ) , maxY ) ; } float dx ... | 129 |
java-test-4371 | java | What needed to be applied to the points in order to position upper and left borders of their bounding box at the given lines ? | the shift | private float [ ] calculate Shift To Position B Box Of Points At ( float left , float top , List < Point > points ) { double min X = Double . MAX VALUE ; double max Y = - Double . MAX VALUE ; for ( Point point : points ) { min X = Math . min ( point . get X ( ) , min X ) ; max Y = Math . max ( point . get Y ( ) , max Y... | private float [ ] calculateShiftToPositionBBoxOfPointsAt ( float left , float top , List < Point > points ) { double minX = Double . MAX_VALUE ; double maxY = - Double . MAX_VALUE ; for ( Point point : points ) { minX = Math . min ( point . getX ( ) , minX ) ; maxY = Math . max ( point . getY ( ) , maxY ) ; } float dx ... | 129 |
java-test-4372 | java | What does this method calculate ? | the shift needed to be applied to the points in order to position upper and left borders of their bounding box at the given lines | private float [ ] calculate Shift To Position B Box Of Points At ( float left , float top , List < Point > points ) { double min X = Double . MAX VALUE ; double max Y = - Double . MAX VALUE ; for ( Point point : points ) { min X = Math . min ( point . get X ( ) , min X ) ; max Y = Math . max ( point . get Y ( ) , max Y... | private float [ ] calculateShiftToPositionBBoxOfPointsAt ( float left , float top , List < Point > points ) { double minX = Double . MAX_VALUE ; double maxY = - Double . MAX_VALUE ; for ( Point point : points ) { minX = Math . min ( point . getX ( ) , minX ) ; maxY = Math . max ( point . getY ( ) , maxY ) ; } float dx ... | 129 |
java-test-4374 | java | What do a directory match ? | a specific pattern | public static boolean delete Files ( String directory Path ) { int files Deleted Count = NUM ; List < String > files = file List ( directory Path , BOOL ) ; Iterator < String > files Iterator = files . iterator ( ) ; while ( files Iterator . has Next ( ) ) { String file = files Iterator . next ( ) ; delete File ( file ... | public static boolean deleteFiles ( String directoryPath ) { int filesDeletedCount = _NUM ; List < String > files = fileList ( directoryPath , _BOOL ) ; Iterator < String > filesIterator = files . iterator ( ) ; while ( filesIterator . hasNext ( ) ) { String file = filesIterator . next ( ) ; deleteFile ( file ) ; files... | 93 |
java-test-4375 | java | Where does files delete ? | in a directory matching a specific pattern | public static boolean delete Files ( String directory Path ) { int files Deleted Count = NUM ; List < String > files = file List ( directory Path , BOOL ) ; Iterator < String > files Iterator = files . iterator ( ) ; while ( files Iterator . has Next ( ) ) { String file = files Iterator . next ( ) ; delete File ( file ... | public static boolean deleteFiles ( String directoryPath ) { int filesDeletedCount = _NUM ; List < String > files = fileList ( directoryPath , _BOOL ) ; Iterator < String > filesIterator = files . iterator ( ) ; while ( filesIterator . hasNext ( ) ) { String file = filesIterator . next ( ) ; deleteFile ( file ) ; files... | 93 |
java-test-4376 | java | What are lon , lat { , alt } tuples separated by separators ( space , tab , cr ) ? | kml coordinates | protected static Array List < Geo Point > parse Kml Coordinates ( String input ) { Linked List < Geo Point > tmp Coords = new Linked List < Geo Point > ( ) ; int i = NUM ; int tuple Start = NUM ; int length = input . length ( ) ; boolean start Reading Tuple = BOOL ; while ( i < length ) { char c = input . char At ( i )... | protected static ArrayList < GeoPoint > parseKmlCoordinates ( String input ) { LinkedList < GeoPoint > tmpCoords = new LinkedList < GeoPoint > ( ) ; int i = _NUM ; int tupleStart = _NUM ; int length = input . length ( ) ; boolean startReadingTuple = _BOOL ; while ( i < length ) { char c = input . charAt ( i ) ; if ( c ... | 262 |
java-test-4377 | java | What do kml coordinates be ? | lon , lat { , alt } tuples separated by separators ( space , tab , cr ) | protected static Array List < Geo Point > parse Kml Coordinates ( String input ) { Linked List < Geo Point > tmp Coords = new Linked List < Geo Point > ( ) ; int i = NUM ; int tuple Start = NUM ; int length = input . length ( ) ; boolean start Reading Tuple = BOOL ; while ( i < length ) { char c = input . char At ( i )... | protected static ArrayList < GeoPoint > parseKmlCoordinates ( String input ) { LinkedList < GeoPoint > tmpCoords = new LinkedList < GeoPoint > ( ) ; int i = _NUM ; int tupleStart = _NUM ; int length = input . length ( ) ; boolean startReadingTuple = _BOOL ; while ( i < length ) { char c = input . charAt ( i ) ; if ( c ... | 262 |
java-test-4378 | java | Where does the code add an abstractoption to the container ? | at a specified position | public synchronized void add ( int position , Abstract Option option ) { Abstract Option search = get By Name ( option . get Name ( ) ) ; if ( search != null ) { LOG . warn ( STRING ) ; } else { List < Abstract Option > old Options = new Array List < Abstract Option > ( options ) ; options . add ( position , option ) ;... | public synchronized void add ( int position , AbstractOption option ) { AbstractOption search = getByName ( option . getName ( ) ) ; if ( search != null ) { LOG . warn ( STRING ) ; } else { List < AbstractOption > oldOptions = new ArrayList < AbstractOption > ( options ) ; options . add ( position , option ) ; option .... | 114 |
java-test-4379 | java | What does the given string represent ? | a valid floating point value ( excluding nan , inf and - inf ) | static boolean is Possible FP ( String val ) { final int length = val . length ( ) ; for ( int i = NUM ; i < length ; ++ i ) { char c = val . char At ( i ) ; if ( ! ( c >= STRING && c <= STRING || c == STRING || c == STRING || c == STRING || c == STRING || c == STRING ) ) { return BOOL ; } } return BOOL ; } | static boolean isPossibleFP ( String val ) { final int length = val . length ( ) ; for ( int i = _NUM ; i < length ; ++ i ) { char c = val . charAt ( i ) ; if ( ! ( c >= STRING && c <= STRING || c == STRING || c == STRING || c == STRING || c == STRING || c == STRING ) ) { return _BOOL ; } } return _BOOL ; } | 89 |
java-test-4380 | java | What is showing the most important main menu entries ? | a toolbar | private void create Tool Bar ( ) { tool Bar = new J Tool Bar ( STRING ) ; if ( listener . running As J Console Plugin || listener . running As Visual VM Plugin ) { tool Bar . add ( create Tool Bar Button ( STRING , STRING ) ) ; tool Bar . set Floatable ( BOOL ) ; } else { tool Bar . add ( create Tool Bar Button ( STRIN... | private void createToolBar ( ) { toolBar = new JToolBar ( STRING ) ; if ( listener . runningAsJConsolePlugin || listener . runningAsVisualVMPlugin ) { toolBar . add ( createToolBarButton ( STRING , STRING ) ) ; toolBar . setFloatable ( _BOOL ) ; } else { toolBar . add ( createToolBarButton ( STRING , STRING ) ) ; close... | 300 |
java-test-4381 | java | What does the code create ? | a toolbar showing the most important main menu entries | private void create Tool Bar ( ) { tool Bar = new J Tool Bar ( STRING ) ; if ( listener . running As J Console Plugin || listener . running As Visual VM Plugin ) { tool Bar . add ( create Tool Bar Button ( STRING , STRING ) ) ; tool Bar . set Floatable ( BOOL ) ; } else { tool Bar . add ( create Tool Bar Button ( STRIN... | private void createToolBar ( ) { toolBar = new JToolBar ( STRING ) ; if ( listener . runningAsJConsolePlugin || listener . runningAsVisualVMPlugin ) { toolBar . add ( createToolBarButton ( STRING , STRING ) ) ; toolBar . setFloatable ( _BOOL ) ; } else { toolBar . add ( createToolBarButton ( STRING , STRING ) ) ; close... | 300 |
java-test-4382 | java | What do a toolbar show ? | the most important main menu entries | private void create Tool Bar ( ) { tool Bar = new J Tool Bar ( STRING ) ; if ( listener . running As J Console Plugin || listener . running As Visual VM Plugin ) { tool Bar . add ( create Tool Bar Button ( STRING , STRING ) ) ; tool Bar . set Floatable ( BOOL ) ; } else { tool Bar . add ( create Tool Bar Button ( STRIN... | private void createToolBar ( ) { toolBar = new JToolBar ( STRING ) ; if ( listener . runningAsJConsolePlugin || listener . runningAsVisualVMPlugin ) { toolBar . add ( createToolBarButton ( STRING , STRING ) ) ; toolBar . setFloatable ( _BOOL ) ; } else { toolBar . add ( createToolBarButton ( STRING , STRING ) ) ; close... | 300 |
java-test-4391 | java | Where do the string ' s ' begin ? | at ' startindex ' | public static int next Char ( String s , char needle , int start Index ) { boolean in Single Quote = BOOL ; boolean in Double Quote = BOOL ; for ( int i = start Index ; i < s . length ( ) ; ++ i ) { char c = s . char At ( i ) ; if ( ! in Single Quote && ! in Double Quote && c == needle ) { return i ; } if ( ! in Single... | public static int nextChar ( String s , char needle , int startIndex ) { boolean inSingleQuote = _BOOL ; boolean inDoubleQuote = _BOOL ; for ( int i = startIndex ; i < s . length ( ) ; ++ i ) { char c = s . charAt ( i ) ; if ( ! inSingleQuote && ! inDoubleQuote && c == needle ) { return i ; } if ( ! inSingleQuote && c ... | 128 |
java-test-4392 | java | What does the code find ? | the next character ' needle ' in the string ' s ' beginning at ' startindex ' | public static int next Char ( String s , char needle , int start Index ) { boolean in Single Quote = BOOL ; boolean in Double Quote = BOOL ; for ( int i = start Index ; i < s . length ( ) ; ++ i ) { char c = s . char At ( i ) ; if ( ! in Single Quote && ! in Double Quote && c == needle ) { return i ; } if ( ! in Single... | public static int nextChar ( String s , char needle , int startIndex ) { boolean inSingleQuote = _BOOL ; boolean inDoubleQuote = _BOOL ; for ( int i = startIndex ; i < s . length ( ) ; ++ i ) { char c = s . charAt ( i ) ; if ( ! inSingleQuote && ! inDoubleQuote && c == needle ) { return i ; } if ( ! inSingleQuote && c ... | 128 |
java-test-4393 | java | What is beginning at ' startindex ' ? | the string ' s ' | public static int next Char ( String s , char needle , int start Index ) { boolean in Single Quote = BOOL ; boolean in Double Quote = BOOL ; for ( int i = start Index ; i < s . length ( ) ; ++ i ) { char c = s . char At ( i ) ; if ( ! in Single Quote && ! in Double Quote && c == needle ) { return i ; } if ( ! in Single... | public static int nextChar ( String s , char needle , int startIndex ) { boolean inSingleQuote = _BOOL ; boolean inDoubleQuote = _BOOL ; for ( int i = startIndex ; i < s . length ( ) ; ++ i ) { char c = s . charAt ( i ) ; if ( ! inSingleQuote && ! inDoubleQuote && c == needle ) { return i ; } if ( ! inSingleQuote && c ... | 128 |
java-test-4397 | java | What does the code fetch from the database ? | a single guid | private byte [ ] fetch Guid ( ) { Prepared Statement stmt = null ; Result Set rows = null ; String sqltext = SELECT GUID ; byte [ ] data = null ; try { metrics . start Timing ( ) ; stmt = conn . prepare Statement ( sqltext ) ; rows = stmt . execute Query ( ) ; if ( rows . next ( ) ) { data = rows . get Bytes ( NUM ) ; ... | private byte [ ] fetchGuid ( ) { PreparedStatement stmt = null ; ResultSet rows = null ; String sqltext = SELECT_GUID ; byte [ ] data = null ; try { metrics . startTiming ( ) ; stmt = conn . prepareStatement ( sqltext ) ; rows = stmt . executeQuery ( ) ; if ( rows . next ( ) ) { data = rows . getBytes ( _NUM ) ; } rows... | 186 |
java-test-4398 | java | In which direction does string matches ocrresult pointed by iterator ? | from position | private boolean string Match ( String str , Ocr Result Iterator iter ) { Ocr Result Iterator iter Copy = new Ocr Result Iterator ( iter ) ; for ( int pos = NUM ; pos < str . length ( ) ; ++ pos ) { if ( ! char Match ( str . char At ( pos ) , iter Copy . get Current Char ( ) ) ) return BOOL ; if ( pos != str . length ( ... | private boolean stringMatch ( String str , OcrResultIterator iter ) { OcrResultIterator iterCopy = new OcrResultIterator ( iter ) ; for ( int pos = _NUM ; pos < str . length ( ) ; ++ pos ) { if ( ! charMatch ( str . charAt ( pos ) , iterCopy . getCurrentChar ( ) ) ) return _BOOL ; if ( pos != str . length ( ) - _NUM &&... | 112 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.