id stringlengths 11 16 | language stringclasses 2
values | question stringlengths 13 844 | answer stringlengths 1 900 | code stringlengths 162 27.4k | code_original stringlengths 162 26k | code_word_count int64 51 5.96k |
|---|---|---|---|---|---|---|
java-test-4810 | java | For what purpose do a route ' s canals test ? | to see if you can move through it | public static String validate Canal ( final Route route , final Collection < Unit > units , final Player ID player , final Game Data data ) { for ( final Territory route Territory : route . get All Territories ( ) ) { final Optional < String > result = validate Canal ( route Territory , route , units , player , data ) ... | public static String validateCanal ( final Route route , final Collection < Unit > units , final PlayerID player , final GameData data ) { for ( final Territory routeTerritory : route . getAllTerritories ( ) ) { final Optional < String > result = validateCanal ( routeTerritory , route , units , player , data ) ; if ( r... | 89 |
java-test-4811 | java | What does the code guess without consuming it ? | the content type based on the provided input stream | public static X Content Type x Content Type ( Input Stream si ) throws IO Exception { if ( si . mark Supported ( ) == BOOL ) { throw new Illegal Argument Exception ( STRING + si . get Class ( ) ) ; } si . mark ( GUESS HEADER LENGTH ) ; try { final int first Int = si . read ( ) ; if ( first Int == - NUM ) { return null ... | public static XContentType xContentType ( InputStream si ) throws IOException { if ( si . markSupported ( ) == _BOOL ) { throw new IllegalArgumentException ( STRING + si . getClass ( ) ) ; } si . mark ( GUESS_HEADER_LENGTH ) ; try { final int firstInt = si . read ( ) ; if ( firstInt == - _NUM ) { return null ; } final ... | 445 |
java-test-4812 | java | How does the code guess the content type based on the provided input stream ? | without consuming it | public static X Content Type x Content Type ( Input Stream si ) throws IO Exception { if ( si . mark Supported ( ) == BOOL ) { throw new Illegal Argument Exception ( STRING + si . get Class ( ) ) ; } si . mark ( GUESS HEADER LENGTH ) ; try { final int first Int = si . read ( ) ; if ( first Int == - NUM ) { return null ... | public static XContentType xContentType ( InputStream si ) throws IOException { if ( si . markSupported ( ) == _BOOL ) { throw new IllegalArgumentException ( STRING + si . getClass ( ) ) ; } si . mark ( GUESS_HEADER_LENGTH ) ; try { final int firstInt = si . read ( ) ; if ( firstInt == - _NUM ) { return null ; } final ... | 445 |
java-test-4813 | java | What does the code manage when new items are added ? | the state of the scrollbars | public void update Scrollbars ( ) { Point preferred Size = get Table Size ( ) ; Rectangle client Area = get Client Area ( ) ; for ( int double Pass = NUM ; double Pass <= NUM ; double Pass ++ ) { if ( preferred Size . y > client Area . height ) { v Scroll . set Visible ( BOOL ) ; } else { v Scroll . set Visible ( BOOL ... | public void updateScrollbars ( ) { Point preferredSize = getTableSize ( ) ; Rectangle clientArea = getClientArea ( ) ; for ( int doublePass = _NUM ; doublePass <= _NUM ; doublePass ++ ) { if ( preferredSize . y > clientArea . height ) { vScroll . setVisible ( _BOOL ) ; } else { vScroll . setVisible ( _BOOL ) ; vScroll ... | 473 |
java-test-4814 | java | When does the code manage the state of the scrollbars ? | when new items are added | public void update Scrollbars ( ) { Point preferred Size = get Table Size ( ) ; Rectangle client Area = get Client Area ( ) ; for ( int double Pass = NUM ; double Pass <= NUM ; double Pass ++ ) { if ( preferred Size . y > client Area . height ) { v Scroll . set Visible ( BOOL ) ; } else { v Scroll . set Visible ( BOOL ... | public void updateScrollbars ( ) { Point preferredSize = getTableSize ( ) ; Rectangle clientArea = getClientArea ( ) ; for ( int doublePass = _NUM ; doublePass <= _NUM ; doublePass ++ ) { if ( preferredSize . y > clientArea . height ) { vScroll . setVisible ( _BOOL ) ; } else { vScroll . setVisible ( _BOOL ) ; vScroll ... | 473 |
java-test-4815 | java | What does the code draw into the graph ? | a horizontal rule | public void hrule ( double value , Paint color , String legend , Basic Stroke stroke ) { Legend Text legend Text = new Legend Text ( color , legend ) ; comments . add ( legend Text ) ; plot Elements . add ( new H Rule ( value , color , legend Text , stroke ) ) ; } | public void hrule ( double value , Paint color , String legend , BasicStroke stroke ) { LegendText legendText = new LegendText ( color , legend ) ; comments . add ( legendText ) ; plotElements . add ( new HRule ( value , color , legendText , stroke ) ) ; } | 61 |
java-test-4820 | java | When do information log ? | when the panel ' s state has changed | public void on Panel State Changed ( Panel State from State , Panel State to State , State Change Reason reason ) { boolean is Starting Search = is Starting New Contextual Search ( to State , reason ) ; boolean is Ending Search = is Ending Contextual Search ( from State , to State , is Starting Search ) ; boolean is Ch... | public void onPanelStateChanged ( PanelState fromState , PanelState toState , StateChangeReason reason ) { boolean isStartingSearch = isStartingNewContextualSearch ( toState , reason ) ; boolean isEndingSearch = isEndingContextualSearch ( fromState , toState , isStartingSearch ) ; boolean isChained = isStartingSearch &... | 736 |
java-test-4821 | java | How do the check mark paint ? | in mouse over state | private void paint Check Icon Selected And Mouse Over ( Graphics 2 D g , int width , int height ) { Shape s = shape Generator . create Check Mark ( NUM , NUM , width , height ) ; g . set Paint ( icon Selected Mouse Over ) ; g . fill ( s ) ; } | private void paintCheckIconSelectedAndMouseOver ( Graphics2D g , int width , int height ) { Shape s = shapeGenerator . createCheckMark ( _NUM , _NUM , width , height ) ; g . setPaint ( iconSelectedMouseOver ) ; g . fill ( s ) ; } | 60 |
java-test-4822 | java | What does the code create ? | a test commandtag | public static Command Tag Cache Object create Test Command Tag ( ) { Command Tag Cache Object command Tag = new Command Tag Cache Object ( Long . value Of ( NUM ) , STRING , STRING , STRING , Data Tag Constants . MODE OPERATIONAL ) ; command Tag . set Equipment Id ( Long . value Of ( NUM ) ) ; command Tag . set Maximum... | public static CommandTagCacheObject createTestCommandTag ( ) { CommandTagCacheObject commandTag = new CommandTagCacheObject ( Long . valueOf ( _NUM ) , STRING , STRING , STRING , DataTagConstants . MODE_OPERATIONAL ) ; commandTag . setEquipmentId ( Long . valueOf ( _NUM ) ) ; commandTag . setMaximum ( Float . valueOf (... | 329 |
java-test-4824 | java | How do one use them ? | in the obvious way | private I Region create Region ( ) { if ( f Delete Offset == - NUM ) { if ( f Start Offset == - NUM || f End Offset == - NUM ) return null ; return new Region ( f Start Offset , f End Offset - f Start Offset ) ; } else if ( f Start Offset == - NUM || f End Offset == - NUM ) { return new Region ( f Delete Offset , NUM )... | private IRegion createRegion ( ) { if ( fDeleteOffset == - _NUM ) { if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) return null ; return new Region ( fStartOffset , fEndOffset - fStartOffset ) ; } else if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) { return new Region ( fDeleteOffset , _NUM ) ; } else { in... | 134 |
java-test-4825 | java | When did by ll add ? | on 14 aug 2012 | private I Region create Region ( ) { if ( f Delete Offset == - NUM ) { if ( f Start Offset == - NUM || f End Offset == - NUM ) return null ; return new Region ( f Start Offset , f End Offset - f Start Offset ) ; } else if ( f Start Offset == - NUM || f End Offset == - NUM ) { return new Region ( f Delete Offset , NUM )... | private IRegion createRegion ( ) { if ( fDeleteOffset == - _NUM ) { if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) return null ; return new Region ( fStartOffset , fEndOffset - fStartOffset ) ; } else if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) { return new Region ( fDeleteOffset , _NUM ) ; } else { in... | 134 |
java-test-4826 | java | How do the minimal region contain all partition changes ? | using the remembered offset , end offset , and deletion offset | private I Region create Region ( ) { if ( f Delete Offset == - NUM ) { if ( f Start Offset == - NUM || f End Offset == - NUM ) return null ; return new Region ( f Start Offset , f End Offset - f Start Offset ) ; } else if ( f Start Offset == - NUM || f End Offset == - NUM ) { return new Region ( f Delete Offset , NUM )... | private IRegion createRegion ( ) { if ( fDeleteOffset == - _NUM ) { if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) return null ; return new Region ( fStartOffset , fEndOffset - fStartOffset ) ; } else if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) { return new Region ( fDeleteOffset , _NUM ) ; } else { in... | 134 |
java-test-4827 | java | What should one remember ? | both the largest and smallest offsets of deleted partitions | private I Region create Region ( ) { if ( f Delete Offset == - NUM ) { if ( f Start Offset == - NUM || f End Offset == - NUM ) return null ; return new Region ( f Start Offset , f End Offset - f Start Offset ) ; } else if ( f Start Offset == - NUM || f End Offset == - NUM ) { return new Region ( f Delete Offset , NUM )... | private IRegion createRegion ( ) { if ( fDeleteOffset == - _NUM ) { if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) return null ; return new Region ( fStartOffset , fEndOffset - fStartOffset ) ; } else if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) { return new Region ( fDeleteOffset , _NUM ) ; } else { in... | 134 |
java-test-4828 | java | What did i understand ? | its use in this method | private I Region create Region ( ) { if ( f Delete Offset == - NUM ) { if ( f Start Offset == - NUM || f End Offset == - NUM ) return null ; return new Region ( f Start Offset , f End Offset - f Start Offset ) ; } else if ( f Start Offset == - NUM || f End Offset == - NUM ) { return new Region ( f Delete Offset , NUM )... | private IRegion createRegion ( ) { if ( fDeleteOffset == - _NUM ) { if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) return null ; return new Region ( fStartOffset , fEndOffset - fStartOffset ) ; } else if ( fStartOffset == - _NUM || fEndOffset == - _NUM ) { return new Region ( fDeleteOffset , _NUM ) ; } else { in... | 134 |
java-test-4829 | java | How does the code create the omgraphics ? | using the shape file and spatialindex | public synchronized OM Graphic List prepare ( ) { Projection projection = get Projection ( ) ; boolean DEBUG FINE = logger . is Loggable ( Level . FINE ) ; if ( projection == null ) { if ( DEBUG FINE ) { logger . fine ( get Name ( ) + STRING ) ; } return new OM Graphic List ( ) ; } if ( spatial Index == null ) { if ( D... | public synchronized OMGraphicList prepare ( ) { Projection projection = getProjection ( ) ; boolean DEBUG_FINE = logger . isLoggable ( Level . FINE ) ; if ( projection == null ) { if ( DEBUG_FINE ) { logger . fine ( getName ( ) + STRING ) ; } return new OMGraphicList ( ) ; } if ( spatialIndex == null ) { if ( DEBUG_FIN... | 610 |
java-test-4831 | java | What does the code create ? | a new ip interface for a host | @ POST @ Consumes ( { Media Type . APPLICATION XML , Media Type . APPLICATION JSON } ) @ Produces ( { Media Type . APPLICATION XML , Media Type . APPLICATION JSON } ) @ Check Permission ( roles = { Role . TENANT ADMIN } ) @ Path ( STRING ) public Ip Interface Rest Rep create Ip Interface ( @ Path Param ( STRING ) URI i... | @ POST @ Consumes ( { MediaType . APPLICATION_XML , MediaType . APPLICATION_JSON } ) @ Produces ( { MediaType . APPLICATION_XML , MediaType . APPLICATION_JSON } ) @ CheckPermission ( roles = { Role . TENANT_ADMIN } ) @ Path ( STRING ) public IpInterfaceRestRep createIpInterface ( @ PathParam ( STRING ) URI id , IpInter... | 206 |
java-test-4832 | java | What does the code create if necessary ? | the room | public void write Room ( String number , String contact , Xmpp Msg message , int mode ) throws Exception { Multi User Chat muc ; muc = invite Room ( number , contact , mode ) ; if ( muc != null ) { try { Message msg = new Message ( muc . get Room ( ) ) ; msg . set Body ( message . generate Fmt Txt ( ) ) ; if ( mode == ... | public void writeRoom ( String number , String contact , XmppMsg message , int mode ) throws Exception { MultiUserChat muc ; muc = inviteRoom ( number , contact , mode ) ; if ( muc != null ) { try { Message msg = new Message ( muc . getRoom ( ) ) ; msg . setBody ( message . generateFmtTxt ( ) ) ; if ( mode == MODE_SHEL... | 144 |
java-test-4833 | java | What does the code write to a room ? | a formatted message | public void write Room ( String number , String contact , Xmpp Msg message , int mode ) throws Exception { Multi User Chat muc ; muc = invite Room ( number , contact , mode ) ; if ( muc != null ) { try { Message msg = new Message ( muc . get Room ( ) ) ; msg . set Body ( message . generate Fmt Txt ( ) ) ; if ( mode == ... | public void writeRoom ( String number , String contact , XmppMsg message , int mode ) throws Exception { MultiUserChat muc ; muc = inviteRoom ( number , contact , mode ) ; if ( muc != null ) { try { Message msg = new Message ( muc . getRoom ( ) ) ; msg . setBody ( message . generateFmtTxt ( ) ) ; if ( mode == MODE_SHEL... | 144 |
java-test-4834 | java | What does the code add ? | a claimed signer role | public void add Claimed Signer Role ( final String claimed Signer Role ) { if ( ( claimed Signer Role == null ) || ( claimed Signer Role . length ( ) == NUM ) ) { throw new Null Pointer Exception ( STRING ) ; } if ( claimed Signer Roles == null ) { claimed Signer Roles = new Array List < String > ( ) ; } claimed Signer... | public void addClaimedSignerRole ( final String claimedSignerRole ) { if ( ( claimedSignerRole == null ) || ( claimedSignerRole . length ( ) == _NUM ) ) { throw new NullPointerException ( STRING ) ; } if ( claimedSignerRoles == null ) { claimedSignerRoles = new ArrayList < String > ( ) ; } claimedSignerRoles . add ( cl... | 82 |
java-test-4835 | java | What does the code write ? | the lines given in input in file | private static void write File ( File file , List < String > lines ) throws IO Exception { if ( ! file . exists ( ) ) file . create New File ( ) ; File Writer fw = new File Writer ( file ) ; Buffered Writer Bw = new Buffered Writer ( fw ) ; Print Writer pw = new Print Writer ( Bw ) ; for ( String line : lines ) pw . pr... | private static void writeFile ( File file , List < String > lines ) throws IOException { if ( ! file . exists ( ) ) file . createNewFile ( ) ; FileWriter fw = new FileWriter ( file ) ; BufferedWriter Bw = new BufferedWriter ( fw ) ; PrintWriter pw = new PrintWriter ( Bw ) ; for ( String line : lines ) pw . println ( li... | 102 |
java-test-4838 | java | What does the code create ? | a list of maps from the list of type parameters | private List < Map < String , Object > > type Parameters ( List < Type Parameter > tpl , Declaration from ) { if ( tpl != null && ! tpl . is Empty ( ) ) { List < Map < String , Object > > l = new Array List < > ( tpl . size ( ) ) ; for ( Type Parameter tp : tpl ) { l . add ( type Parameter Map ( tp , from ) ) ; } retur... | private List < Map < String , Object > > typeParameters ( List < TypeParameter > tpl , Declaration from ) { if ( tpl != null && ! tpl . isEmpty ( ) ) { List < Map < String , Object > > l = new ArrayList < > ( tpl . size ( ) ) ; for ( TypeParameter tp : tpl ) { l . add ( typeParameterMap ( tp , from ) ) ; } return l ; }... | 95 |
java-test-4839 | java | What looks in the database ? | for a zone for the same volume and export group and key | private FC Zone Reference find FC Zone Reference For Vol Group Key ( URI export Group URI , URI volume URI , String ref Key , String [ ] new Or Existing ) { Map < String , FC Zone Reference > vol Ref Map = network Scheduler . make Export To Reference Map ( ref Key ) ; String vol Export Key = make 2 Uri Key ( volume URI... | private FCZoneReference findFCZoneReferenceForVolGroupKey ( URI exportGroupURI , URI volumeURI , String refKey , String [ ] newOrExisting ) { Map < String , FCZoneReference > volRefMap = _networkScheduler . makeExportToReferenceMap ( refKey ) ; String volExportKey = make2UriKey ( volumeURI , exportGroupURI ) ; if ( vol... | 164 |
java-test-4840 | java | What does the code select to ensure a good pivot is select ? | a pivot | private T select Pivot ( int from , int to ) { int count = ( int ) ( NUM * Math . log 10 ( to - from ) ) ; count = Math . min ( count , temp . length ) ; int step = ( to - from ) / count ; for ( int i = from , j = NUM ; i < to ; i += step , j ++ ) { temp [ j ] = data [ i ] ; } T pivot = select ( temp , NUM , count - NU... | private T selectPivot ( int from , int to ) { int count = ( int ) ( _NUM * Math . log10 ( to - from ) ) ; count = Math . min ( count , temp . length ) ; int step = ( to - from ) / count ; for ( int i = from , j = _NUM ; i < to ; i += step , j ++ ) { temp [ j ] = data [ i ] ; } T pivot = select ( temp , _NUM , count - _... | 112 |
java-test-4841 | java | For what purpose does the code select a pivot ? | to ensure a good pivot is select | private T select Pivot ( int from , int to ) { int count = ( int ) ( NUM * Math . log 10 ( to - from ) ) ; count = Math . min ( count , temp . length ) ; int step = ( to - from ) / count ; for ( int i = from , j = NUM ; i < to ; i += step , j ++ ) { temp [ j ] = data [ i ] ; } T pivot = select ( temp , NUM , count - NU... | private T selectPivot ( int from , int to ) { int count = ( int ) ( _NUM * Math . log10 ( to - from ) ) ; count = Math . min ( count , temp . length ) ; int step = ( to - from ) / count ; for ( int i = from , j = _NUM ; i < to ; i += step , j ++ ) { temp [ j ] = data [ i ] ; } T pivot = select ( temp , _NUM , count - _... | 112 |
java-test-4842 | java | How does the code remove a column model ? | by the specified column name | public void remove Column Model By Name ( String column Name ) { if ( Text Utils . is Empty ( column Name ) ) { return ; } int index To Remove = - NUM ; for ( int i = NUM ; i < column Models . size ( ) ; i ++ ) { Column Model column Model = column Models . get ( i ) ; if ( column Name . equals Ignore Case ( column Mode... | public void removeColumnModelByName ( String columnName ) { if ( TextUtils . isEmpty ( columnName ) ) { return ; } int indexToRemove = - _NUM ; for ( int i = _NUM ; i < columnModels . size ( ) ; i ++ ) { ColumnModel columnModel = columnModels . get ( i ) ; if ( columnName . equalsIgnoreCase ( columnModel . getColumnNam... | 122 |
java-test-4843 | java | How does the code read a byte [ ] ? | via readbinary ) | public String read String ( ) throws T Exception { int length = read Varint 32 ( ) ; check String Read Length ( length ) ; if ( length == NUM ) { return STRING ; } try { if ( trans . get Bytes Remaining In Buffer ( ) >= length ) { String str = new String ( trans . get Buffer ( ) , trans . get Buffer Position ( ) , leng... | public String readString ( ) throws TException { int length = readVarint32 ( ) ; checkStringReadLength ( length ) ; if ( length == _NUM ) { return STRING ; } try { if ( trans_ . getBytesRemainingInBuffer ( ) >= length ) { String str = new String ( trans_ . getBuffer ( ) , trans_ . getBufferPosition ( ) , length , STRIN... | 128 |
java-test-4844 | java | What does the code delete ? | a customtagmapping on system | public void remove Custom Tag ( String virtual ) throws Security Exception { check Write Access ( ) ; Element mappings = get Root Element ( STRING ) ; Element [ ] children = XML Config Web Factory . get Children ( mappings , STRING ) ; for ( int i = NUM ; i < children . length ; i ++ ) { if ( virtual . equals ( create ... | public void removeCustomTag ( String virtual ) throws SecurityException { checkWriteAccess ( ) ; Element mappings = _getRootElement ( STRING ) ; Element [ ] children = XMLConfigWebFactory . getChildren ( mappings , STRING ) ; for ( int i = _NUM ; i < children . length ; i ++ ) { if ( virtual . equals ( createVirtual ( ... | 93 |
java-test-4853 | java | What does the code eliminate ? | all ae tuples that are killed by a given instruction | public void eliminate ( Instruction s ) { int i = NUM ; for ( Enumeration < Operand > defs = s . get Defs ( ) ; defs . has More Elements ( ) ; ) { Operand def = defs . next Element ( ) ; if ( def instanceof Register Operand ) { eliminate ( ( Register Operand ) def ) ; } } if ( do Memory ) { if ( Local CSE . is Store In... | public void eliminate ( Instruction s ) { int i = _NUM ; for ( Enumeration < Operand > defs = s . getDefs ( ) ; defs . hasMoreElements ( ) ; ) { Operand def = defs . nextElement ( ) ; if ( def instanceof RegisterOperand ) { eliminate ( ( RegisterOperand ) def ) ; } } if ( doMemory ) { if ( LocalCSE . isStoreInstruction... | 253 |
java-test-4854 | java | What does the code write ? | the header of the html - file ( including the content header ) | public void write Header ( ) { ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; } | public void writeHeader ( ) { ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; ps . println ( STRING ) ; } | 57 |
java-test-4855 | java | What do the provided collection of input objects map ? | to an appropriate collection of output objects | public final Collection < To > map ( Collection < From > entities ) { final Collection < To > result = new Array List < > ( entities . size ( ) ) ; for ( From from : entities ) { result . add ( map ( from ) ) ; } return result ; } | public final Collection < To > map ( Collection < From > entities ) { final Collection < To > result = new ArrayList < > ( entities . size ( ) ) ; for ( From from : entities ) { result . add ( map ( from ) ) ; } return result ; } | 58 |
java-test-4856 | java | What maps to an appropriate collection of output objects ? | the provided collection of input objects | public final Collection < To > map ( Collection < From > entities ) { final Collection < To > result = new Array List < > ( entities . size ( ) ) ; for ( From from : entities ) { result . add ( map ( from ) ) ; } return result ; } | public final Collection < To > map ( Collection < From > entities ) { final Collection < To > result = new ArrayList < > ( entities . size ( ) ) ; for ( From from : entities ) { result . add ( map ( from ) ) ; } return result ; } | 58 |
java-test-4857 | java | How do string merge ? | using path separator | private static String merge ( String ... vals ) { String Builder res = new String Builder ( ) ; if ( vals != null ) { boolean first = BOOL ; for ( String val : vals ) { if ( first ) first = BOOL ; else res . append ( File . path Separator Char ) ; res . append ( val ) ; } } return res . to String ( ) ; } | private static String merge ( String ... vals ) { StringBuilder res = new StringBuilder ( ) ; if ( vals != null ) { boolean first = _BOOL ; for ( String val : vals ) { if ( first ) first = _BOOL ; else res . append ( File . pathSeparatorChar ) ; res . append ( val ) ; } } return res . toString ( ) ; } | 78 |
java-test-4858 | java | What do the roads leave ? | this intersection | public void render Roads ( OM Graphic List gl , boolean force New ) { for ( Enumeration e = roads . elements ( ) ; e . has More Elements ( ) ; ) { Road road = ( Road ) e . next Element ( ) ; if ( road . get First Intersection ( ) == this ) road . render ( gl , force New ) ; } } | public void renderRoads ( OMGraphicList gl , boolean forceNew ) { for ( Enumeration e = roads . elements ( ) ; e . hasMoreElements ( ) ; ) { Road road = ( Road ) e . nextElement ( ) ; if ( road . getFirstIntersection ( ) == this ) road . render ( gl , forceNew ) ; } } | 73 |
java-test-4859 | java | What does the code render ? | the graphics for the roads leaving this intersection | public void render Roads ( OM Graphic List gl , boolean force New ) { for ( Enumeration e = roads . elements ( ) ; e . has More Elements ( ) ; ) { Road road = ( Road ) e . next Element ( ) ; if ( road . get First Intersection ( ) == this ) road . render ( gl , force New ) ; } } | public void renderRoads ( OMGraphicList gl , boolean forceNew ) { for ( Enumeration e = roads . elements ( ) ; e . hasMoreElements ( ) ; ) { Road road = ( Road ) e . nextElement ( ) ; if ( road . getFirstIntersection ( ) == this ) road . render ( gl , forceNew ) ; } } | 73 |
java-test-4860 | java | When may whose content change ? | while the method is running | @ Suppress Warnings ( STRING ) @ Gwt Incompatible ( STRING ) public static < K extends Object , V extends Object > void write Map ( Map < K , V > map , Object Output Stream stream ) throws IO Exception { stream . write Int ( map . size ( ) ) ; for ( Map . Entry < K , V > entry : map . entry Set ( ) ) { stream . write O... | @ SuppressWarnings ( STRING ) @ GwtIncompatible ( STRING ) public static < K extends Object , V extends Object > void writeMap ( Map < K , V > map , ObjectOutputStream stream ) throws IOException { stream . writeInt ( map . size ( ) ) ; for ( Map . Entry < K , V > entry : map . entrySet ( ) ) { stream . writeObject ( e... | 104 |
java-test-4861 | java | Does it support concurrent maps whose content may change while the method is running ? | No | @ Suppress Warnings ( STRING ) @ Gwt Incompatible ( STRING ) public static < K extends Object , V extends Object > void write Map ( Map < K , V > map , Object Output Stream stream ) throws IO Exception { stream . write Int ( map . size ( ) ) ; for ( Map . Entry < K , V > entry : map . entry Set ( ) ) { stream . write O... | @ SuppressWarnings ( STRING ) @ GwtIncompatible ( STRING ) public static < K extends Object , V extends Object > void writeMap ( Map < K , V > map , ObjectOutputStream stream ) throws IOException { stream . writeInt ( map . size ( ) ) ; for ( Map . Entry < K , V > entry : map . entrySet ( ) ) { stream . writeObject ( e... | 104 |
java-test-4862 | java | When do change may ? | while the method is running | @ Suppress Warnings ( STRING ) @ Gwt Incompatible ( STRING ) public static < K extends Object , V extends Object > void write Map ( Map < K , V > map , Object Output Stream stream ) throws IO Exception { stream . write Int ( map . size ( ) ) ; for ( Map . Entry < K , V > entry : map . entry Set ( ) ) { stream . write O... | @ SuppressWarnings ( STRING ) @ GwtIncompatible ( STRING ) public static < K extends Object , V extends Object > void writeMap ( Map < K , V > map , ObjectOutputStream stream ) throws IOException { stream . writeInt ( map . size ( ) ) ; for ( Map . Entry < K , V > entry : map . entrySet ( ) ) { stream . writeObject ( e... | 104 |
java-test-4863 | java | What does it not support ? | concurrent maps whose content may change while the method is running | @ Suppress Warnings ( STRING ) @ Gwt Incompatible ( STRING ) public static < K extends Object , V extends Object > void write Map ( Map < K , V > map , Object Output Stream stream ) throws IO Exception { stream . write Int ( map . size ( ) ) ; for ( Map . Entry < K , V > entry : map . entry Set ( ) ) { stream . write O... | @ SuppressWarnings ( STRING ) @ GwtIncompatible ( STRING ) public static < K extends Object , V extends Object > void writeMap ( Map < K , V > map , ObjectOutputStream stream ) throws IOException { stream . writeInt ( map . size ( ) ) ; for ( Map . Entry < K , V > entry : map . entrySet ( ) ) { stream . writeObject ( e... | 104 |
java-test-4865 | java | What does the code fix ? | a few java . net | public static URL resolve URL ( URL base , String target ) throws Malformed URL Exception { target = target . trim ( ) ; if ( target . starts With ( STRING ) ) { return fix Pure Query Targets ( base , target ) ; } return new URL ( base , target ) ; } | public static URL resolveURL ( URL base , String target ) throws MalformedURLException { target = target . trim ( ) ; if ( target . startsWith ( STRING ) ) { return fixPureQueryTargets ( base , target ) ; } return new URL ( base , target ) ; } | 58 |
java-test-4866 | java | How does the code open a single url if enabled ? | with a prompt | public static boolean open Url Prompt ( Component parent , String url , boolean force Prompt ) { if ( url == null ) { return BOOL ; } List < String > list = new Array List < > ( ) ; list . add ( url ) ; return open Urls Prompt ( parent , list , force Prompt ) ; } | public static boolean openUrlPrompt ( Component parent , String url , boolean forcePrompt ) { if ( url == null ) { return _BOOL ; } List < String > list = new ArrayList < > ( ) ; list . add ( url ) ; return openUrlsPrompt ( parent , list , forcePrompt ) ; } | 64 |
java-test-4867 | java | What does the code open if enabled with a prompt ? | a single url | public static boolean open Url Prompt ( Component parent , String url , boolean force Prompt ) { if ( url == null ) { return BOOL ; } List < String > list = new Array List < > ( ) ; list . add ( url ) ; return open Urls Prompt ( parent , list , force Prompt ) ; } | public static boolean openUrlPrompt ( Component parent , String url , boolean forcePrompt ) { if ( url == null ) { return _BOOL ; } List < String > list = new ArrayList < > ( ) ; list . add ( url ) ; return openUrlsPrompt ( parent , list , forcePrompt ) ; } | 64 |
java-test-4868 | java | What does the code perform ? | a range scan for a set of records in the database | public int scan ( String table , String startkey , int recordcount , Set < String > fields , Vector < Hash Map < String , Byte Iterator > > result ) { long st = System . nano Time ( ) ; int res = db . scan ( table , startkey , recordcount , fields , result ) ; long en = System . nano Time ( ) ; measurements . measure (... | public int scan ( String table , String startkey , int recordcount , Set < String > fields , Vector < HashMap < String , ByteIterator > > result ) { long st = System . nanoTime ( ) ; int res = _db . scan ( table , startkey , recordcount , fields , result ) ; long en = System . nanoTime ( ) ; _measurements . measure ( S... | 106 |
java-test-4872 | java | What do database need when it comes to many2many associations ? | to create an intermediate table for mapping this association . this method helps create such a table | private void create Intermediate Table ( String table Name , String associated Table Name , SQ Lite Database db , boolean force ) { List < Column Model > column Model List = new Array List < Column Model > ( ) ; Column Model column 1 = new Column Model ( ) ; column 1 . set Column Name ( table Name + STRING ) ; column 1... | private void createIntermediateTable ( String tableName , String associatedTableName , SQLiteDatabase db , boolean force ) { List < ColumnModel > columnModelList = new ArrayList < ColumnModel > ( ) ; ColumnModel column1 = new ColumnModel ( ) ; column1 . setColumnName ( tableName + STRING ) ; column1 . setColumnType ( S... | 292 |
java-test-4873 | java | When do database need to create an intermediate table for mapping this association . this method helps create such a table ? | when it comes to many2many associations | private void create Intermediate Table ( String table Name , String associated Table Name , SQ Lite Database db , boolean force ) { List < Column Model > column Model List = new Array List < Column Model > ( ) ; Column Model column 1 = new Column Model ( ) ; column 1 . set Column Name ( table Name + STRING ) ; column 1... | private void createIntermediateTable ( String tableName , String associatedTableName , SQLiteDatabase db , boolean force ) { List < ColumnModel > columnModelList = new ArrayList < ColumnModel > ( ) ; ColumnModel column1 = new ColumnModel ( ) ; column1 . setColumnName ( tableName + STRING ) ; column1 . setColumnType ( S... | 292 |
java-test-4874 | java | How do the table name follow the concatenation of the two target table names in alphabetical order ? | with underline in the middle | private void create Intermediate Table ( String table Name , String associated Table Name , SQ Lite Database db , boolean force ) { List < Column Model > column Model List = new Array List < Column Model > ( ) ; Column Model column 1 = new Column Model ( ) ; column 1 . set Column Name ( table Name + STRING ) ; column 1... | private void createIntermediateTable ( String tableName , String associatedTableName , SQLiteDatabase db , boolean force ) { List < ColumnModel > columnModelList = new ArrayList < ColumnModel > ( ) ; ColumnModel column1 = new ColumnModel ( ) ; column1 . setColumnName ( tableName + STRING ) ; column1 . setColumnType ( S... | 292 |
java-test-4875 | java | What do this method help ? | create such a table | private void create Intermediate Table ( String table Name , String associated Table Name , SQ Lite Database db , boolean force ) { List < Column Model > column Model List = new Array List < Column Model > ( ) ; Column Model column 1 = new Column Model ( ) ; column 1 . set Column Name ( table Name + STRING ) ; column 1... | private void createIntermediateTable ( String tableName , String associatedTableName , SQLiteDatabase db , boolean force ) { List < ColumnModel > columnModelList = new ArrayList < ColumnModel > ( ) ; ColumnModel column1 = new ColumnModel ( ) ; column1 . setColumnName ( tableName + STRING ) ; column1 . setColumnType ( S... | 292 |
java-test-4876 | java | What do the table name follow with underline in the middle ? | the concatenation of the two target table names in alphabetical order | private void create Intermediate Table ( String table Name , String associated Table Name , SQ Lite Database db , boolean force ) { List < Column Model > column Model List = new Array List < Column Model > ( ) ; Column Model column 1 = new Column Model ( ) ; column 1 . set Column Name ( table Name + STRING ) ; column 1... | private void createIntermediateTable ( String tableName , String associatedTableName , SQLiteDatabase db , boolean force ) { List < ColumnModel > columnModelList = new ArrayList < ColumnModel > ( ) ; ColumnModel column1 = new ColumnModel ( ) ; column1 . setColumnName ( tableName + STRING ) ; column1 . setColumnType ( S... | 292 |
java-test-4877 | java | What needs to create an intermediate table for mapping this association . this method helps create such a table when it comes to many2many associations ? | database | private void create Intermediate Table ( String table Name , String associated Table Name , SQ Lite Database db , boolean force ) { List < Column Model > column Model List = new Array List < Column Model > ( ) ; Column Model column 1 = new Column Model ( ) ; column 1 . set Column Name ( table Name + STRING ) ; column 1... | private void createIntermediateTable ( String tableName , String associatedTableName , SQLiteDatabase db , boolean force ) { List < ColumnModel > columnModelList = new ArrayList < ColumnModel > ( ) ; ColumnModel column1 = new ColumnModel ( ) ; column1 . setColumnName ( tableName + STRING ) ; column1 . setColumnType ( S... | 292 |
java-test-4878 | java | What does the code find ? | the correct position to add a named component | private int find Window Position ( String window ) { int loc = window Order . index Of ( window ) ; if ( loc != - NUM ) { int i = NUM ; for ( Component c : panel . get Components ( ) ) { if ( c instanceof Managed Window ) { String name = c . get Name ( ) ; if ( loc < window Order . index Of ( name ) ) { return i ; } } ... | private int findWindowPosition ( String window ) { int loc = windowOrder . indexOf ( window ) ; if ( loc != - _NUM ) { int i = _NUM ; for ( Component c : panel . getComponents ( ) ) { if ( c instanceof ManagedWindow ) { String name = c . getName ( ) ; if ( loc < windowOrder . indexOf ( name ) ) { return i ; } } i ++ ; ... | 118 |
java-test-4880 | java | What does the code return ? | the map tag field | public static String decode Region Name ( byte [ ] metadata ) { String json String = new String ( metadata ) ; try { JSON Object json = new JSON Object ( json String ) ; return json . get String ( JSON FIELD TAG ) ; } catch ( JSON Exception e ) { e . print Stack Trace ( ) ; return STRING ; } } | public static String decodeRegionName ( byte [ ] metadata ) { String jsonString = new String ( metadata ) ; try { JSONObject json = new JSONObject ( jsonString ) ; return json . getString ( JSON_FIELD_TAG ) ; } catch ( JSONException e ) { e . printStackTrace ( ) ; return STRING ; } } | 69 |
java-test-4884 | java | What does the slice provide ? | our exposed view of the backing array | private void copy Schedule Into Frontier ( final int min Capacity , final Iterator < Value > itr ) { backing . ensure Capacity ( min Capacity ) ; final Value [ ] a = backing . array ( ) ; int nvertices = NUM ; while ( itr . has Next ( ) ) { final Value v = itr . next ( ) ; a [ nvertices ++ ] = v ; } for ( int i = nvert... | private void copyScheduleIntoFrontier ( final int minCapacity , final Iterator < Value > itr ) { backing . ensureCapacity ( minCapacity ) ; final Value [ ] a = backing . array ( ) ; int nvertices = _NUM ; while ( itr . hasNext ( ) ) { final Value v = itr . next ( ) ; a [ nvertices ++ ] = v ; } for ( int i = nvertices ;... | 125 |
java-test-4885 | java | What provides our exposed view of the backing array ? | the slice | private void copy Schedule Into Frontier ( final int min Capacity , final Iterator < Value > itr ) { backing . ensure Capacity ( min Capacity ) ; final Value [ ] a = backing . array ( ) ; int nvertices = NUM ; while ( itr . has Next ( ) ) { final Value v = itr . next ( ) ; a [ nvertices ++ ] = v ; } for ( int i = nvert... | private void copyScheduleIntoFrontier ( final int minCapacity , final Iterator < Value > itr ) { backing . ensureCapacity ( minCapacity ) ; final Value [ ] a = backing . array ( ) ; int nvertices = _NUM ; while ( itr . hasNext ( ) ) { final Value v = itr . next ( ) ; a [ nvertices ++ ] = v ; } for ( int i = nvertices ;... | 125 |
java-test-4886 | java | Where did that area occupy the span ? | only the cells | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4887 | java | Where is the span erratic ? | only the cells that area occupied | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4888 | java | What occupied the span only the cells ? | that area | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4889 | java | What did that area occupy only the cells ? | the span | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4890 | java | Did this method use the row / col indexes ? | No | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4891 | java | When do this method correct the span to be correct for the compressed grid ? | when the grid is compressed and indexed after only the cells that area occupied the span is erratic | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4892 | java | What is erratic only the cells that area occupied ? | the span | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4893 | java | What do this method correct the span when the grid is compressed and indexed after only the cells that area occupied the span is erratic ? | to be correct for the compressed grid | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4894 | java | What do this method correct to be correct for the compressed grid when the grid is compressed and indexed after only the cells that area occupied the span is erratic ? | the span | private static int convert Span To Sparse Grid ( int cur Ix , int span , Tree Set < Integer > indexes ) { int last Ix = cur Ix + span ; int ret Span = NUM ; for ( Integer ix : indexes ) { if ( ix <= cur Ix ) continue ; if ( ix >= last Ix ) break ; ret Span ++ ; } return ret Span ; } | private static int convertSpanToSparseGrid ( int curIx , int span , TreeSet < Integer > indexes ) { int lastIx = curIx + span ; int retSpan = _NUM ; for ( Integer ix : indexes ) { if ( ix <= curIx ) continue ; if ( ix >= lastIx ) break ; retSpan ++ ; } return retSpan ; } | 75 |
java-test-4895 | java | What does the code calculate ? | the lighting of the item based on rotation | private Lighting Color Filter calculate Light ( final float rotation ) { final double cos Rotation = Math . cos ( Math . PI * rotation / NUM ) ; int intensity = AMBIENT LIGHT + ( int ) ( DIFFUSE LIGHT * cos Rotation ) ; int highlight Intensity = ( int ) ( SPECULAR LIGHT * Math . pow ( cos Rotation , SHININESS ) ) ; if ... | private LightingColorFilter calculateLight ( final float rotation ) { final double cosRotation = Math . cos ( Math . PI * rotation / _NUM ) ; int intensity = AMBIENT_LIGHT + ( int ) ( DIFFUSE_LIGHT * cosRotation ) ; int highlightIntensity = ( int ) ( SPECULAR_LIGHT * Math . pow ( cosRotation , SHININESS ) ) ; if ( inte... | 144 |
java-test-4896 | java | What does the class not define ? | readobjectnodata | void invoke Read Object No Data ( Object obj ) throws IO Exception , Unsupported Operation Exception { require Initialized ( ) ; if ( read Object No Data Method != null ) { try { read Object No Data Method . invoke ( obj , ( Object [ ] ) null ) ; } catch ( Invocation Target Exception ex ) { Throwable th = ex . get Targ... | void invokeReadObjectNoData ( Object obj ) throws IOException , UnsupportedOperationException { requireInitialized ( ) ; if ( readObjectNoDataMethod != null ) { try { readObjectNoDataMethod . invoke ( obj , ( Object [ ] ) null ) ; } catch ( InvocationTargetException ex ) { Throwable th = ex . getTargetException ( ) ; i... | 133 |
java-test-4897 | java | Does the class define readobjectnodata ? | No | void invoke Read Object No Data ( Object obj ) throws IO Exception , Unsupported Operation Exception { require Initialized ( ) ; if ( read Object No Data Method != null ) { try { read Object No Data Method . invoke ( obj , ( Object [ ] ) null ) ; } catch ( Invocation Target Exception ex ) { Throwable th = ex . get Targ... | void invokeReadObjectNoData ( Object obj ) throws IOException , UnsupportedOperationException { requireInitialized ( ) ; if ( readObjectNoDataMethod != null ) { try { readObjectNoDataMethod . invoke ( obj , ( Object [ ] ) null ) ; } catch ( InvocationTargetException ex ) { Throwable th = ex . getTargetException ( ) ; i... | 133 |
java-test-4898 | java | What does not define readobjectnodata ? | the class | void invoke Read Object No Data ( Object obj ) throws IO Exception , Unsupported Operation Exception { require Initialized ( ) ; if ( read Object No Data Method != null ) { try { read Object No Data Method . invoke ( obj , ( Object [ ] ) null ) ; } catch ( Invocation Target Exception ex ) { Throwable th = ex . get Targ... | void invokeReadObjectNoData ( Object obj ) throws IOException , UnsupportedOperationException { requireInitialized ( ) ; if ( readObjectNoDataMethod != null ) { try { readObjectNoDataMethod . invoke ( obj , ( Object [ ] ) null ) ; } catch ( InvocationTargetException ex ) { Throwable th = ex . getTargetException ( ) ; i... | 133 |
java-test-4899 | java | Is the beaninfo found in the bean class ' s package ? | No | public static synchronized Bean Info find Bean Info ( String bean Class Name ) { String [ ] bean Info Paths = Introspector . get Bean Info Search Path ( ) ; String info Class Name = bean Class Name + STRING ; Class info Class = null ; try { info Class = Class . for Name ( info Class Name ) ; return ( Bean Info ) info C... | public static synchronized BeanInfo findBeanInfo ( String beanClassName ) { String [ ] beanInfoPaths = Introspector . getBeanInfoSearchPath ( ) ; String infoClassName = beanClassName + STRING ; Class infoClass = null ; try { infoClass = Class . forName ( infoClassName ) ; return ( BeanInfo ) infoClass . newInstance ( )... | 222 |
java-test-4900 | java | What does this method attach to the end of the class name first ? | the string " beaninfo " | public static synchronized Bean Info find Bean Info ( String bean Class Name ) { String [ ] bean Info Paths = Introspector . get Bean Info Search Path ( ) ; String info Class Name = bean Class Name + STRING ; Class info Class = null ; try { info Class = Class . for Name ( info Class Name ) ; return ( Bean Info ) info C... | public static synchronized BeanInfo findBeanInfo ( String beanClassName ) { String [ ] beanInfoPaths = Introspector . getBeanInfoSearchPath ( ) ; String infoClassName = beanClassName + STRING ; Class infoClass = null ; try { infoClass = Class . forName ( infoClassName ) ; return ( BeanInfo ) infoClass . newInstance ( )... | 222 |
java-test-4901 | java | When does this method search the package of the specified class for the beaninfo class ? | first | public static synchronized Bean Info find Bean Info ( String bean Class Name ) { String [ ] bean Info Paths = Introspector . get Bean Info Search Path ( ) ; String info Class Name = bean Class Name + STRING ; Class info Class = null ; try { info Class = Class . for Name ( info Class Name ) ; return ( Bean Info ) info C... | public static synchronized BeanInfo findBeanInfo ( String beanClassName ) { String [ ] beanInfoPaths = Introspector . getBeanInfoSearchPath ( ) ; String infoClassName = beanClassName + STRING ; Class infoClass = null ; try { infoClass = Class . forName ( infoClassName ) ; return ( BeanInfo ) infoClass . newInstance ( )... | 222 |
java-test-4902 | java | Where is the beaninfo not found ? | in the bean class ' s package | public static synchronized Bean Info find Bean Info ( String bean Class Name ) { String [ ] bean Info Paths = Introspector . get Bean Info Search Path ( ) ; String info Class Name = bean Class Name + STRING ; Class info Class = null ; try { info Class = Class . for Name ( info Class Name ) ; return ( Bean Info ) info C... | public static synchronized BeanInfo findBeanInfo ( String beanClassName ) { String [ ] beanInfoPaths = Introspector . getBeanInfoSearchPath ( ) ; String infoClassName = beanClassName + STRING ; Class infoClass = null ; try { infoClass = Class . forName ( infoClassName ) ; return ( BeanInfo ) infoClass . newInstance ( )... | 222 |
java-test-4903 | java | When does this method attach the string " beaninfo " to the end of the class name ? | first | public static synchronized Bean Info find Bean Info ( String bean Class Name ) { String [ ] bean Info Paths = Introspector . get Bean Info Search Path ( ) ; String info Class Name = bean Class Name + STRING ; Class info Class = null ; try { info Class = Class . for Name ( info Class Name ) ; return ( Bean Info ) info C... | public static synchronized BeanInfo findBeanInfo ( String beanClassName ) { String [ ] beanInfoPaths = Introspector . getBeanInfoSearchPath ( ) ; String infoClassName = beanClassName + STRING ; Class infoClass = null ; try { infoClass = Class . forName ( infoClassName ) ; return ( BeanInfo ) infoClass . newInstance ( )... | 222 |
java-test-4904 | java | What is not found in the bean class ' s package ? | the beaninfo | public static synchronized Bean Info find Bean Info ( String bean Class Name ) { String [ ] bean Info Paths = Introspector . get Bean Info Search Path ( ) ; String info Class Name = bean Class Name + STRING ; Class info Class = null ; try { info Class = Class . for Name ( info Class Name ) ; return ( Bean Info ) info C... | public static synchronized BeanInfo findBeanInfo ( String beanClassName ) { String [ ] beanInfoPaths = Introspector . getBeanInfoSearchPath ( ) ; String infoClassName = beanClassName + STRING ; Class infoClass = null ; try { infoClass = Class . forName ( infoClassName ) ; return ( BeanInfo ) infoClass . newInstance ( )... | 222 |
java-test-4905 | java | What does this method search for the beaninfo class first first ? | the package of the specified class | public static synchronized Bean Info find Bean Info ( String bean Class Name ) { String [ ] bean Info Paths = Introspector . get Bean Info Search Path ( ) ; String info Class Name = bean Class Name + STRING ; Class info Class = null ; try { info Class = Class . for Name ( info Class Name ) ; return ( Bean Info ) info C... | public static synchronized BeanInfo findBeanInfo ( String beanClassName ) { String [ ] beanInfoPaths = Introspector . getBeanInfoSearchPath ( ) ; String infoClassName = beanClassName + STRING ; Class infoClass = null ; try { infoClass = Class . forName ( infoClassName ) ; return ( BeanInfo ) infoClass . newInstance ( )... | 222 |
java-test-4906 | java | Where does the method search for the beaninfo if the beaninfo is not found in the bean class ' s package if the beaninfo is not found in the bean class ' s package ? | in the introspector search path | public static synchronized Bean Info find Bean Info ( String bean Class Name ) { String [ ] bean Info Paths = Introspector . get Bean Info Search Path ( ) ; String info Class Name = bean Class Name + STRING ; Class info Class = null ; try { info Class = Class . for Name ( info Class Name ) ; return ( Bean Info ) info C... | public static synchronized BeanInfo findBeanInfo ( String beanClassName ) { String [ ] beanInfoPaths = Introspector . getBeanInfoSearchPath ( ) ; String infoClassName = beanClassName + STRING ; Class infoClass = null ; try { infoClass = Class . forName ( infoClassName ) ; return ( BeanInfo ) infoClass . newInstance ( )... | 222 |
java-test-4907 | java | What do der encoded values have so that bitwise equality of the encoded values is an efficient way to establish equivalence of the unencoded values ? | a single encoding | public boolean equals ( Der Value other ) { if ( this == other ) { return BOOL ; } if ( tag != other . tag ) { return BOOL ; } if ( data == other . data ) { return BOOL ; } return ( System . identity Hash Code ( this . data ) > System . identity Hash Code ( other . data ) ) ? do Equals ( this , other ) : do Equals ( ot... | public boolean equals ( DerValue other ) { if ( this == other ) { return _BOOL ; } if ( tag != other . tag ) { return _BOOL ; } if ( data == other . data ) { return _BOOL ; } return ( System . identityHashCode ( this . data ) > System . identityHashCode ( other . data ) ) ? doEquals ( this , other ) : doEquals ( other ... | 88 |
java-test-4908 | java | What have a single encoding so that bitwise equality of the encoded values is an efficient way to establish equivalence of the unencoded values ? | der encoded values | public boolean equals ( Der Value other ) { if ( this == other ) { return BOOL ; } if ( tag != other . tag ) { return BOOL ; } if ( data == other . data ) { return BOOL ; } return ( System . identity Hash Code ( this . data ) > System . identity Hash Code ( other . data ) ) ? do Equals ( this , other ) : do Equals ( ot... | public boolean equals ( DerValue other ) { if ( this == other ) { return _BOOL ; } if ( tag != other . tag ) { return _BOOL ; } if ( data == other . data ) { return _BOOL ; } return ( System . identityHashCode ( this . data ) > System . identityHashCode ( other . data ) ) ? doEquals ( this , other ) : doEquals ( other ... | 88 |
java-test-4910 | java | What will one field hit ? | every row of our bulk data | public static final Index create Test Index With Bulk Data Hit ( ) { Index index = new Index ( STRING ) ; index . set Table ( DB , STRING ) ; Array List < Index Field > fields = new Array List < > ( ) ; fields . add ( new Index Field ( STRING ) ) ; index . set Fields ( fields ) ; index . is Unique ( BOOL ) ; return ind... | public static final Index createTestIndexWithBulkDataHit ( ) { Index index = new Index ( STRING ) ; index . setTable ( DB , STRING ) ; ArrayList < IndexField > fields = new ArrayList < > ( ) ; fields . add ( new IndexField ( STRING ) ) ; index . setFields ( fields ) ; index . isUnique ( _BOOL ) ; return index ; } | 81 |
java-test-4911 | java | What will hit every row of our bulk data ? | one field | public static final Index create Test Index With Bulk Data Hit ( ) { Index index = new Index ( STRING ) ; index . set Table ( DB , STRING ) ; Array List < Index Field > fields = new Array List < > ( ) ; fields . add ( new Index Field ( STRING ) ) ; index . set Fields ( fields ) ; index . is Unique ( BOOL ) ; return ind... | public static final Index createTestIndexWithBulkDataHit ( ) { Index index = new Index ( STRING ) ; index . setTable ( DB , STRING ) ; ArrayList < IndexField > fields = new ArrayList < > ( ) ; fields . add ( new IndexField ( STRING ) ) ; index . setFields ( fields ) ; index . isUnique ( _BOOL ) ; return index ; } | 81 |
java-test-4912 | java | What does the code calculate between two rectangles ? | the gap rectangle | private static boolean calculate Gap ( Rectangle a , Rectangle b , Rectangle gap ) { if ( a . intersects ( b ) ) { gap . width = NUM ; return BOOL ; } int ax 1 = a . x ; int ax 2 = a . x + a . width ; int ay 1 = a . y ; int ay 2 = a . y + a . height ; int bx 1 = b . x ; int bx 2 = b . x + b . width ; int by 1 = b . y ;... | private static boolean calculateGap ( Rectangle a , Rectangle b , Rectangle gap ) { if ( a . intersects ( b ) ) { gap . width = _NUM ; return _BOOL ; } int ax1 = a . x ; int ax2 = a . x + a . width ; int ay1 = a . y ; int ay2 = a . y + a . height ; int bx1 = b . x ; int bx2 = b . x + b . width ; int by1 = b . y ; int b... | 309 |
java-test-4913 | java | Where does the code calculate the gap rectangle ? | between two rectangles | private static boolean calculate Gap ( Rectangle a , Rectangle b , Rectangle gap ) { if ( a . intersects ( b ) ) { gap . width = NUM ; return BOOL ; } int ax 1 = a . x ; int ax 2 = a . x + a . width ; int ay 1 = a . y ; int ay 2 = a . y + a . height ; int bx 1 = b . x ; int bx 2 = b . x + b . width ; int by 1 = b . y ;... | private static boolean calculateGap ( Rectangle a , Rectangle b , Rectangle gap ) { if ( a . intersects ( b ) ) { gap . width = _NUM ; return _BOOL ; } int ax1 = a . x ; int ax2 = a . x + a . width ; int ay1 = a . y ; int ay2 = a . y + a . height ; int bx1 = b . x ; int bx2 = b . x + b . width ; int by1 = b . y ; int b... | 309 |
java-test-4914 | java | Where should this be not executed ? | on the main / ui thread | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4915 | java | For what purpose do disk access include this ? | so this should not be executed on the main / ui thread | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4916 | java | What should be not executed on the main / ui thread ? | this | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4917 | java | What should you call to initialize it on a background thread instead ? | initdiskcache | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4918 | java | When does an imageprovider not initialize the disk cache ? | when it is created | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4919 | java | What does an imageprovider not initialize when it is created ? | the disk cache | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4920 | java | What does not initialize the disk cache when it is created ? | an imageprovider | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4921 | java | What does the code initialize ? | the disk cache | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4922 | java | Should this be executed on the main / ui thread ? | No | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4923 | java | What should you call initdiskcache instead ? | to initialize it on a background thread | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4924 | java | Does an imageprovider initialize the disk cache when it is created ? | No | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4925 | java | Where do you initialize it ? | on a background thread | public void init Disk Cache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( m Disk Cache Lock ) { if ( m Disk Lru Cache == null || m Disk Lru Cache . is Closed ( ) ) { if ( m Disk Cache Dir != null ) { if ( ! m Disk Cache Dir . exists ( ) ) { m Disk Cache Dir . mkdirs ( ) ; } if ( File Util . ge... | public void initDiskCache ( ) { if ( DEBUG ) { Log . d ( TAG , STRING + this ) ; } synchronized ( mDiskCacheLock ) { if ( mDiskLruCache == null || mDiskLruCache . isClosed ( ) ) { if ( mDiskCacheDir != null ) { if ( ! mDiskCacheDir . exists ( ) ) { mDiskCacheDir . mkdirs ( ) ; } if ( FileUtil . getUsableSpace ( mDiskCa... | 237 |
java-test-4926 | java | When was events lost ? | since last poll | public static Collection < Visor Grid Event > collect Events ( Ignite ignite , String evt Order Key , String evt Throttle Cntr Key , boolean all , Ignite Closure < Event , Visor Grid Event > evt Mapper ) { int [ ] evt Types = all ? VISOR ALL EVTS : VISOR NON TASK EVTS ; if ( evt Order Key . starts With ( STRING ) ) evt... | public static Collection < VisorGridEvent > collectEvents ( Ignite ignite , String evtOrderKey , String evtThrottleCntrKey , boolean all , IgniteClosure < Event , VisorGridEvent > evtMapper ) { int [ ] evtTypes = all ? VISOR_ALL_EVTS : VISOR_NON_TASK_EVTS ; if ( evtOrderKey . startsWith ( STRING ) ) evtTypes = concat (... | 105 |
java-test-4927 | java | What did that refine ? | the seed pointers | protected void compute Reachable Pts ( ) { int i ; I Var Abstraction pn ; off graph edge p ; queue . clear ( ) ; for ( i = NUM ; i < n var ; ++ i ) { pn = int 2 var . get ( i ) ; if ( pn . will Update == BOOL ) queue . add ( i ) ; } while ( ! queue . is Empty ( ) ) { i = queue . get First ( ) ; queue . remove First ( )... | protected void computeReachablePts ( ) { int i ; IVarAbstraction pn ; off_graph_edge p ; queue . clear ( ) ; for ( i = _NUM ; i < n_var ; ++ i ) { pn = int2var . get ( i ) ; if ( pn . willUpdate == _BOOL ) queue . add ( i ) ; } while ( ! queue . isEmpty ( ) ) { i = queue . getFirst ( ) ; queue . removeFirst ( ) ; p = v... | 201 |
java-test-4928 | java | What does the code apply ? | one or more row changes | protected void apply Row Change Data ( Row Change Data data , List < Repl Option > options , String source Dbms Type ) throws Replicator Exception { if ( options != null ) { try { if ( apply Session Variables ( null , options ) ) { if ( logger . is Debug Enabled ( ) ) { logger . debug ( STRING ) ; } execute Pending Bat... | protected void applyRowChangeData ( RowChangeData data , List < ReplOption > options , String sourceDbmsType ) throws ReplicatorException { if ( options != null ) { try { if ( applySessionVariables ( null , options ) ) { if ( logger . isDebugEnabled ( ) ) { logger . debug ( STRING ) ; } executePendingBatch ( ) ; statem... | 238 |
java-test-4929 | java | What does the code remove from the given subtree ? | the smallest key and associated value | private Node delete Min ( Node x ) { if ( x . left == null ) return x . right ; x . left = delete Min ( x . left ) ; x . size = NUM + size ( x . left ) + size ( x . right ) ; x . height = NUM + Math . max ( height ( x . left ) , height ( x . right ) ) ; return balance ( x ) ; } | private Node deleteMin ( Node x ) { if ( x . left == null ) return x . right ; x . left = deleteMin ( x . left ) ; x . size = _NUM + size ( x . left ) + size ( x . right ) ; x . height = _NUM + Math . max ( height ( x . left ) , height ( x . right ) ) ; return balance ( x ) ; } | 86 |
java-test-4930 | java | What does the code mount ? | a myomer booster | public boolean has Myomer Booster ( ) { for ( Mounted m Equip : get Misc ( ) ) { Misc Type mtype = ( Misc Type ) m Equip . get Type ( ) ; if ( mtype . has Flag ( Misc Type . F MASC ) && ! m Equip . is Inoperable ( ) ) { return BOOL ; } } return BOOL ; } | public boolean hasMyomerBooster ( ) { for ( Mounted mEquip : getMisc ( ) ) { MiscType mtype = ( MiscType ) mEquip . getType ( ) ; if ( mtype . hasFlag ( MiscType . F_MASC ) && ! mEquip . isInoperable ( ) ) { return _BOOL ; } } return _BOOL ; } | 69 |
java-test-4931 | java | What does the code separate into a map of targetclass ( targeted , valid , invalid ) to the annotations that fall into each of those categories ? | the input annotations | protected Map < Target Class , List < Attribute . Type Compound > > sift ( final Iterable < Attribute . Type Compound > type Compounds ) { final Map < Target Class , List < Attribute . Type Compound > > target Class To Compound = new Enum Map < > ( Target Class . class ) ; for ( Target Class target Class : Target Class... | protected Map < TargetClass , List < Attribute . TypeCompound > > sift ( final Iterable < Attribute . TypeCompound > typeCompounds ) { final Map < TargetClass , List < Attribute . TypeCompound > > targetClassToCompound = new EnumMap < > ( TargetClass . class ) ; for ( TargetClass targetClass : TargetClass . values ( ) ... | 244 |
java-test-4932 | java | What does the code create ? | a new consistency group on the storage center | public Sc Replay Profile create Consistency Group ( String ssn , String name ) throws Storage Center API Exception { LOG . debug ( STRING , name ) ; String error Message = STRING ; Parameters params = new Parameters ( ) ; params . add ( STRING , name ) ; params . add ( STRING , NOTES STRING ) ; params . add ( STRING , ... | public ScReplayProfile createConsistencyGroup ( String ssn , String name ) throws StorageCenterAPIException { LOG . debug ( STRING , name ) ; String errorMessage = STRING ; Parameters params = new Parameters ( ) ; params . add ( STRING , name ) ; params . add ( STRING , NOTES_STRING ) ; params . add ( STRING , STRING )... | 220 |
java-test-4934 | java | In which direction will item slide to its natural position ? | from top of the screen | public static void slide In From Top Animator ( @ Non Null List < Animator > animators , @ Non Null View view , Recycler View recycler View ) { alpha Animator ( animators , view , NUM ) ; animators . add ( Object Animator . of Float ( view , STRING , - recycler View . get Measured Height ( ) > > NUM , NUM ) ) ; if ( Fl... | public static void slideInFromTopAnimator ( @ NonNull List < Animator > animators , @ NonNull View view , RecyclerView recyclerView ) { alphaAnimator ( animators , view , _NUM ) ; animators . add ( ObjectAnimator . ofFloat ( view , STRING , - recyclerView . getMeasuredHeight ( ) > > _NUM , _NUM ) ) ; if ( FlexibleAdapt... | 88 |
java-test-4935 | java | What might be touching a chunk - area ? | all islands | private List < End Island > find Surrounding Islands ( int chunk X , int chunk Y , int chunks Per Fragment X , int chunks Per Fragment Y ) { List < End Island > result = new Linked List < End Island > ( ) ; for ( int y = - SURROUNDING CHUNKS ; y <= chunks Per Fragment Y + SURROUNDING CHUNKS ; y ++ ) { for ( int x = - S... | private List < EndIsland > findSurroundingIslands ( int chunkX , int chunkY , int chunksPerFragmentX , int chunksPerFragmentY ) { List < EndIsland > result = new LinkedList < EndIsland > ( ) ; for ( int y = - SURROUNDING_CHUNKS ; y <= chunksPerFragmentY + SURROUNDING_CHUNKS ; y ++ ) { for ( int x = - SURROUNDING_CHUNKS... | 135 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.