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-5049 | java | What did a java . io . bufferedreader use ? | to eliminate the deprecation warning | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5050 | java | What does a simple method use as the line separator largely largely ? | the " \ n " | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5051 | java | What suggested using a java . io . bufferedreader to eliminate the deprecation warning ? | alan brighton | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5052 | java | What did we use now ? | a simple method that largely ignores character encodings and only uses the " \ n " as the line separator | @ Deprecated @ Override public String read Line ( ) throws IO Exception { String Builder b = new String Builder ( NUM ) ; int chr ; while ( ( chr = read ( ) ) >= NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . to String ( ) ; } } return b . to String ( ) ; } | @ Deprecated @ Override public String readLine ( ) throws IOException { StringBuilder b = new StringBuilder ( _NUM ) ; int chr ; while ( ( chr = read ( ) ) >= _NUM ) { if ( chr != STRING ) { b . append ( ( char ) chr ) ; } else { return b . toString ( ) ; } } return b . toString ( ) ; } | 80 |
java-test-5058 | java | What does the code create ? | the command string for deleting file system mount | public String format Un Mount Cmd ( String data Mover , String path , String protocol ) { String Builder cmd = new String Builder ( ) ; cmd . append ( STRING ) ; cmd . append ( data Mover ) ; cmd . append ( STRING ) ; cmd . append ( STRING ) ; cmd . append ( STRING ) ; cmd . append ( path ) ; return cmd . to String ( )... | public String formatUnMountCmd ( String dataMover , String path , String protocol ) { StringBuilder cmd = new StringBuilder ( ) ; cmd . append ( STRING ) ; cmd . append ( dataMover ) ; cmd . append ( STRING ) ; cmd . append ( STRING ) ; cmd . append ( STRING ) ; cmd . append ( path ) ; return cmd . toString ( ) ; } | 80 |
java-test-5059 | java | What does the code load ? | the zone info map | private static Map < String , Object > load Zone Info Map ( Input Stream in ) throws IO Exception { Map < String , Object > map = new Concurrent Hash Map < String , Object > ( ) ; Data Input Stream din = new Data Input Stream ( in ) ; try { read Zone Info Map ( din , map ) ; } finally { try { din . close ( ) ; } catch ... | private static Map < String , Object > loadZoneInfoMap ( InputStream in ) throws IOException { Map < String , Object > map = new ConcurrentHashMap < String , Object > ( ) ; DataInputStream din = new DataInputStream ( in ) ; try { readZoneInfoMap ( din , map ) ; } finally { try { din . close ( ) ; } catch ( IOException ... | 114 |
java-test-5060 | java | What is these parameters determine effectively ? | how close to their start points the line segments intersect | public static Point 2 D intersect Param ( Point 2 D u0 , Point 2 D v0 , Point 2 D u1 , Point 2 D v1 ) { double det = determinant 2 by 2 ( v1 , v0 ) ; if ( Double . is Na N ( det ) || det == NUM ) { return null ; } double x00 = u0 . get X ( ) ; double y00 = u0 . get Y ( ) ; double x10 = u1 . get X ( ) ; double y10 = u1 ... | public static Point2D intersectParam ( Point2D u0 , Point2D v0 , Point2D u1 , Point2D v1 ) { double det = determinant2by2 ( v1 , v0 ) ; if ( Double . isNaN ( det ) || det == _NUM ) { return null ; } double x00 = u0 . getX ( ) ; double y00 = u0 . getY ( ) ; double x10 = u1 . getX ( ) ; double y10 = u1 . getY ( ) ; doubl... | 218 |
java-test-5061 | java | What contains taxonomy information ? | the supplied reader | public static boolean has Taxonomy Info ( Sequences Reader reader ) { final File taxon File = new File ( reader . path ( ) , TAXONOMY FILE ) ; final File mapping File = new File ( reader . path ( ) , TAXONOMY TO SEQUENCE FILE ) ; if ( taxon File . exists ( ) && mapping File . exists ( ) ) { return BOOL ; } else if ( ta... | public static boolean hasTaxonomyInfo ( SequencesReader reader ) { final File taxonFile = new File ( reader . path ( ) , TAXONOMY_FILE ) ; final File mappingFile = new File ( reader . path ( ) , TAXONOMY_TO_SEQUENCE_FILE ) ; if ( taxonFile . exists ( ) && mappingFile . exists ( ) ) { return _BOOL ; } else if ( taxonFil... | 107 |
java-test-5062 | java | What does the supplied reader contain ? | taxonomy information | public static boolean has Taxonomy Info ( Sequences Reader reader ) { final File taxon File = new File ( reader . path ( ) , TAXONOMY FILE ) ; final File mapping File = new File ( reader . path ( ) , TAXONOMY TO SEQUENCE FILE ) ; if ( taxon File . exists ( ) && mapping File . exists ( ) ) { return BOOL ; } else if ( ta... | public static boolean hasTaxonomyInfo ( SequencesReader reader ) { final File taxonFile = new File ( reader . path ( ) , TAXONOMY_FILE ) ; final File mappingFile = new File ( reader . path ( ) , TAXONOMY_TO_SEQUENCE_FILE ) ; if ( taxonFile . exists ( ) && mappingFile . exists ( ) ) { return _BOOL ; } else if ( taxonFil... | 107 |
java-test-5064 | java | What does the code remove from the given subtree ? | the largest key and associated value | private Node delete Max ( Node x ) { if ( x . right == null ) return x . left ; x . right = delete Max ( x . right ) ; 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 deleteMax ( Node x ) { if ( x . right == null ) return x . left ; x . right = deleteMax ( x . right ) ; 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-5066 | java | Where should the point be considered ? | in or out of the polygon | private static Boolean is Inside Polygon ( final Geo Point point , final List < Geo Point > poly Points ) { final double latitude = point . get Latitude ( ) ; final double longitude = point . get Longitude ( ) ; final double sin Latitude = Math . sin ( latitude ) ; final double cos Latitude = Math . cos ( latitude ) ; ... | private static Boolean isInsidePolygon ( final GeoPoint point , final List < GeoPoint > polyPoints ) { final double latitude = point . getLatitude ( ) ; final double longitude = point . getLongitude ( ) ; final double sinLatitude = Math . sin ( latitude ) ; final double cosLatitude = Math . cos ( latitude ) ; final dou... | 403 |
java-test-5067 | java | For what purpose do based on point order whether the point should be considered in or out of the polygon determine ? | for a specified point and a list of poly points | private static Boolean is Inside Polygon ( final Geo Point point , final List < Geo Point > poly Points ) { final double latitude = point . get Latitude ( ) ; final double longitude = point . get Longitude ( ) ; final double sin Latitude = Math . sin ( latitude ) ; final double cos Latitude = Math . cos ( latitude ) ; ... | private static Boolean isInsidePolygon ( final GeoPoint point , final List < GeoPoint > polyPoints ) { final double latitude = point . getLatitude ( ) ; final double longitude = point . getLongitude ( ) ; final double sinLatitude = Math . sin ( latitude ) ; final double cosLatitude = Math . cos ( latitude ) ; final dou... | 403 |
java-test-5070 | java | What is starting at path ? | sub - tree | public void update Sub Tree Checking Consistency ( Tree Path path ) { if ( is Path Greyed ( path ) ) { for ( Tree Path child Path : get Children Path ( path ) ) { update Sub Tree Checking Consistency ( child Path ) ; } update Path Greyness ( path ) ; } else { if ( is Path Checked ( path ) ) { check Sub Tree ( path ) ; ... | public void updateSubTreeCheckingConsistency ( TreePath path ) { if ( isPathGreyed ( path ) ) { for ( TreePath childPath : getChildrenPath ( path ) ) { updateSubTreeCheckingConsistency ( childPath ) ; } updatePathGreyness ( path ) ; } else { if ( isPathChecked ( path ) ) { checkSubTree ( path ) ; } else { uncheckSubTre... | 91 |
java-test-5071 | java | When do offers need a warning ? | before expiring | private void check Warnings ( ) { List < Offer > list = market . get Offers Older Than ( TIME TO WARNING ) ; long time = System . current Time Millis ( ) ; for ( Offer offer : list ) { long time Diff = time - time Stamp ; if ( time Stamp != NUM && ( ( time - offer . get Timestamp ( ) - TIME TO WARNING * NUM ) > time Di... | private void checkWarnings ( ) { List < Offer > list = market . getOffersOlderThan ( TIME_TO_WARNING ) ; long time = System . currentTimeMillis ( ) ; for ( Offer offer : list ) { long timeDiff = time - timeStamp ; if ( timeStamp != _NUM && ( ( time - offer . getTimestamp ( ) - TIME_TO_WARNING * _NUM ) > timeDiff ) ) { ... | 191 |
java-test-5072 | java | What computes in two passes ( one forward , one reverse over the instructions from start to end ? | control and barrier ( acquire / release ) dependences | private void compute Control And Barrier Dependences ( Instruction start , Instruction end ) { Dep Graph Node last Total Barrier = null ; Dep Graph Node last GC Barrier = null ; Dep Graph Node last Acquire = null ; for ( Dep Graph Node pnode = ( Dep Graph Node ) first Node ( ) ; pnode != null ; pnode = ( Dep Graph Node... | private void computeControlAndBarrierDependences ( Instruction start , Instruction end ) { DepGraphNode lastTotalBarrier = null ; DepGraphNode lastGCBarrier = null ; DepGraphNode lastAcquire = null ; for ( DepGraphNode pnode = ( DepGraphNode ) firstNode ( ) ; pnode != null ; pnode = ( DepGraphNode ) pnode . getNext ( )... | 491 |
java-test-5073 | java | Where do control and barrier ( acquire / release ) dependences compute ? | in two passes ( one forward , one reverse over the instructions from start to end | private void compute Control And Barrier Dependences ( Instruction start , Instruction end ) { Dep Graph Node last Total Barrier = null ; Dep Graph Node last GC Barrier = null ; Dep Graph Node last Acquire = null ; for ( Dep Graph Node pnode = ( Dep Graph Node ) first Node ( ) ; pnode != null ; pnode = ( Dep Graph Node... | private void computeControlAndBarrierDependences ( Instruction start , Instruction end ) { DepGraphNode lastTotalBarrier = null ; DepGraphNode lastGCBarrier = null ; DepGraphNode lastAcquire = null ; for ( DepGraphNode pnode = ( DepGraphNode ) firstNode ( ) ; pnode != null ; pnode = ( DepGraphNode ) pnode . getNext ( )... | 491 |
java-test-5074 | java | What creates in this group container ? | sub groupcontainers | public Set create Sub Group Containers ( Set group Container Names ) throws AM Exception , SSO Exception { Iterator iter = group Container Names . iterator ( ) ; Set group Containers = new Hash Set ( ) ; while ( iter . has Next ( ) ) { String group Container DN = AM Naming Attr Manager . get Naming Attr ( GROUP CONTAIN... | public Set createSubGroupContainers ( Set groupContainerNames ) throws AMException , SSOException { Iterator iter = groupContainerNames . iterator ( ) ; Set groupContainers = new HashSet ( ) ; while ( iter . hasNext ( ) ) { String groupContainerDN = AMNamingAttrManager . getNamingAttr ( GROUP_CONTAINER ) + STRING + ( (... | 131 |
java-test-5075 | java | What do it have ? | index > = min | private boolean remove Task ( Task t , int min ) { for ( int i = tasks . size ( ) ; -- i >= min ; ) { if ( tasks . get ( i ) == t ) { tasks . remove ( i ) ; if ( i < first Pending ) { first Pending -- ; for ( int j = threads . size ( ) ; -- j >= NUM ; ) { Task Thread thread = threads . get ( j ) ; if ( thread . task ==... | private boolean removeTask ( Task t , int min ) { for ( int i = tasks . size ( ) ; -- i >= min ; ) { if ( tasks . get ( i ) == t ) { tasks . remove ( i ) ; if ( i < firstPending ) { firstPending -- ; for ( int j = threads . size ( ) ; -- j >= _NUM ; ) { TaskThread thread = threads . get ( j ) ; if ( thread . task == t ... | 130 |
java-test-5076 | java | What does the code interrupt if it is active and not being executed by the calling thread ? | the thread executing the task | private boolean remove Task ( Task t , int min ) { for ( int i = tasks . size ( ) ; -- i >= min ; ) { if ( tasks . get ( i ) == t ) { tasks . remove ( i ) ; if ( i < first Pending ) { first Pending -- ; for ( int j = threads . size ( ) ; -- j >= NUM ; ) { Task Thread thread = threads . get ( j ) ; if ( thread . task ==... | private boolean removeTask ( Task t , int min ) { for ( int i = tasks . size ( ) ; -- i >= min ; ) { if ( tasks . get ( i ) == t ) { tasks . remove ( i ) ; if ( i < firstPending ) { firstPending -- ; for ( int j = threads . size ( ) ; -- j >= _NUM ; ) { TaskThread thread = threads . get ( j ) ; if ( thread . task == t ... | 130 |
java-test-5077 | java | How do it generate ? | with the projection | private void load Tile ( String image Path , int x , int y , int zoom Level , Projection proj , OM Graphic List list ) { Cache Object ret = load ( image Path , x , y , zoom Level , proj ) ; if ( ret == null ) { ret = get Empty Tile ( image Path , x , y , zoom Level , proj ) ; } if ( ret != null ) { replace Least Used (... | private void loadTile ( String imagePath , int x , int y , int zoomLevel , Projection proj , OMGraphicList list ) { CacheObject ret = load ( imagePath , x , y , zoomLevel , proj ) ; if ( ret == null ) { ret = getEmptyTile ( imagePath , x , y , zoomLevel , proj ) ; } if ( ret != null ) { replaceLeastUsed ( ret ) ; OMGra... | 152 |
java-test-5078 | java | When does the tile add to the list ? | after generating it with the projection | private void load Tile ( String image Path , int x , int y , int zoom Level , Projection proj , OM Graphic List list ) { Cache Object ret = load ( image Path , x , y , zoom Level , proj ) ; if ( ret == null ) { ret = get Empty Tile ( image Path , x , y , zoom Level , proj ) ; } if ( ret != null ) { replace Least Used (... | private void loadTile ( String imagePath , int x , int y , int zoomLevel , Projection proj , OMGraphicList list ) { CacheObject ret = load ( imagePath , x , y , zoomLevel , proj ) ; if ( ret == null ) { ret = getEmptyTile ( imagePath , x , y , zoomLevel , proj ) ; } if ( ret != null ) { replaceLeastUsed ( ret ) ; OMGra... | 152 |
java-test-5079 | java | What does the code compute at the given node ? | the fully qualified name for the widget - derived type | public static String compute Qualified Widget Type Name ( Node widget Node ) { if ( widget Node . get Node Type ( ) != Node . ELEMENT NODE ) { return null ; } String type Name = widget Node . get Local Name ( ) ; if ( type Name . length ( ) == NUM || Character . is Lower Case ( type Name . char At ( NUM ) ) ) { return ... | public static String computeQualifiedWidgetTypeName ( Node widgetNode ) { if ( widgetNode . getNodeType ( ) != Node . ELEMENT_NODE ) { return null ; } String typeName = widgetNode . getLocalName ( ) ; if ( typeName . length ( ) == _NUM || Character . isLowerCase ( typeName . charAt ( _NUM ) ) ) { return null ; } String... | 126 |
java-test-5080 | java | When does the code add delta ? | for k | public int incr ( T k , int delta ) { Integer i = counts . get ( k ) ; if ( i == null ) { i = NUM ; } int next = i . int Value ( ) + delta ; if ( next < NUM ) { throw new java . lang . Arithmetic Exception ( ) ; } if ( next == NUM ) { counts . remove ( k ) ; } else { counts . put ( k , i + delta ) ; } return i ; } | public int incr ( T k , int delta ) { Integer i = counts . get ( k ) ; if ( i == null ) { i = _NUM ; } int next = i . intValue ( ) + delta ; if ( next < _NUM ) { throw new java . lang . ArithmeticException ( ) ; } if ( next == _NUM ) { counts . remove ( k ) ; } else { counts . put ( k , i + delta ) ; } return i ; } | 97 |
java-test-5081 | java | When does the code return the count ? | prior to addition | public int incr ( T k , int delta ) { Integer i = counts . get ( k ) ; if ( i == null ) { i = NUM ; } int next = i . int Value ( ) + delta ; if ( next < NUM ) { throw new java . lang . Arithmetic Exception ( ) ; } if ( next == NUM ) { counts . remove ( k ) ; } else { counts . put ( k , i + delta ) ; } return i ; } | public int incr ( T k , int delta ) { Integer i = counts . get ( k ) ; if ( i == null ) { i = _NUM ; } int next = i . intValue ( ) + delta ; if ( next < _NUM ) { throw new java . lang . ArithmeticException ( ) ; } if ( next == _NUM ) { counts . remove ( k ) ; } else { counts . put ( k , i + delta ) ; } return i ; } | 97 |
java-test-5082 | java | For what purpose do an ftyp atom process ? | to determine whether the media is quicktime | private static boolean process Ftyp Atom ( Parsable Byte Array atom Data ) { atom Data . set Position ( Atom . HEADER SIZE ) ; int major Brand = atom Data . read Int ( ) ; if ( major Brand == BRAND QUICKTIME ) { return BOOL ; } atom Data . skip Bytes ( NUM ) ; while ( atom Data . bytes Left ( ) > NUM ) { if ( atom Data... | private static boolean processFtypAtom ( ParsableByteArray atomData ) { atomData . setPosition ( Atom . HEADER_SIZE ) ; int majorBrand = atomData . readInt ( ) ; if ( majorBrand == BRAND_QUICKTIME ) { return _BOOL ; } atomData . skipBytes ( _NUM ) ; while ( atomData . bytesLeft ( ) > _NUM ) { if ( atomData . readInt ( ... | 96 |
java-test-5083 | java | What does the code compute for two instances ? | the result of the kernel function | public double eval ( int id 1 , int id 2 , Instance inst 1 ) throws Exception { double div = Math . sqrt ( super . eval ( id 1 , id 1 , inst 1 ) * ( ( m keys != null ) ? super . eval ( id 2 , id 2 , m data . instance ( id 2 ) ) : super . eval ( - NUM , - NUM , m data . instance ( id 2 ) ) ) ) ; if ( div != NUM ) { retu... | public double eval ( int id1 , int id2 , Instance inst1 ) throws Exception { double div = Math . sqrt ( super . eval ( id1 , id1 , inst1 ) * ( ( m_keys != null ) ? super . eval ( id2 , id2 , m_data . instance ( id2 ) ) : super . eval ( - _NUM , - _NUM , m_data . instance ( id2 ) ) ) ) ; if ( div != _NUM ) { return supe... | 122 |
java-test-5084 | java | What does the code make ? | the path to show | private void make Ok Path ( ) { path 1 . reset ( ) ; int w2 = get Measured Width ( ) / NUM ; int h2 = get Measured Height ( ) / NUM ; double a = Math . cos ( Math . to Radians ( NUM ) ) * get Radius ( ) ; double c = Math . sin ( Math . to Radians ( NUM ) ) * get Radius ( ) ; double l = Math . cos ( Math . to Radians ( ... | private void makeOkPath ( ) { path1 . reset ( ) ; int w2 = getMeasuredWidth ( ) / _NUM ; int h2 = getMeasuredHeight ( ) / _NUM ; double a = Math . cos ( Math . toRadians ( _NUM ) ) * getRadius ( ) ; double c = Math . sin ( Math . toRadians ( _NUM ) ) * getRadius ( ) ; double l = Math . cos ( Math . toRadians ( _NUM ) )... | 254 |
java-test-5085 | java | What is the climbs ? | to the root | private boolean has Loop ( int parent Category Id , Vector < Simple Tree Node > categories , int loop Indicator Id ) { final Iterator < Simple Tree Node > iter = categories . iterator ( ) ; boolean ret = BOOL ; while ( iter . has Next ( ) ) { Simple Tree Node node = ( Simple Tree Node ) iter . next ( ) ; if ( node . ge... | private boolean hasLoop ( int parentCategoryId , Vector < SimpleTreeNode > categories , int loopIndicatorId ) { final Iterator < SimpleTreeNode > iter = categories . iterator ( ) ; boolean ret = _BOOL ; while ( iter . hasNext ( ) ) { SimpleTreeNode node = ( SimpleTreeNode ) iter . next ( ) ; if ( node . getNodeId ( ) =... | 147 |
java-test-5091 | java | What does the stream have ? | no more xmlevents | @ Override public XML Event peek ( ) throws XML Stream Exception { log . log ( Level . FINE , STRING ) ; if ( ! has Next ( ) ) { throw new XML Stream Exception ( STRING ) ; } log . log ( Level . FINE , STRING , next Event ) ; return next Event ; } | @ Override public XMLEvent peek ( ) throws XMLStreamException { log . log ( Level . FINE , STRING ) ; if ( ! hasNext ( ) ) { throw new XMLStreamException ( STRING ) ; } log . log ( Level . FINE , STRING , nextEvent ) ; return nextEvent ; } | 62 |
java-test-5099 | java | What does the code create ? | a map where key is the module name and value is the fully qualified class name of the module | private static Map construct Modules List ( Set classes , Set global Auth ) { if ( debug . message Enabled ( ) ) { debug . message ( STRING + classes ) ; } Iterator iter = classes . iterator ( ) ; Hash Map modules = new Hash Map ( ) ; while ( iter . has Next ( ) ) { String name = ( String ) iter . next ( ) ; if ( name ... | private static Map constructModulesList ( Set classes , Set globalAuth ) { if ( debug . messageEnabled ( ) ) { debug . message ( STRING + classes ) ; } Iterator iter = classes . iterator ( ) ; HashMap modules = new HashMap ( ) ; while ( iter . hasNext ( ) ) { String name = ( String ) iter . next ( ) ; if ( name . equal... | 247 |
java-test-5101 | java | What does the code create ? | the code attribute | public Code Attribute create Code ( ) { Code Attribute code = new Code Attribute ( ) ; for ( int i = NUM ; i < attributes . size ( ) ; i ++ ) { Attribute attr = attributes . get ( i ) ; if ( attr instanceof Code Attribute ) return ( Code Attribute ) attr ; } return null ; } | public CodeAttribute createCode ( ) { CodeAttribute code = new CodeAttribute ( ) ; for ( int i = _NUM ; i < _attributes . size ( ) ; i ++ ) { Attribute attr = _attributes . get ( i ) ; if ( attr instanceof CodeAttribute ) return ( CodeAttribute ) attr ; } return null ; } | 66 |
java-test-5106 | java | What does the code initialize ? | a grain - 128 cipher | public void init ( boolean for Encryption , Cipher Parameters params ) throws Illegal Argument Exception { if ( ! ( params instanceof Parameters With IV ) ) { throw new Illegal Argument Exception ( STRING ) ; } Parameters With IV iv Params = ( Parameters With IV ) params ; byte [ ] iv = iv Params . get IV ( ) ; if ( iv... | public void init ( boolean forEncryption , CipherParameters params ) throws IllegalArgumentException { if ( ! ( params instanceof ParametersWithIV ) ) { throw new IllegalArgumentException ( STRING ) ; } ParametersWithIV ivParams = ( ParametersWithIV ) params ; byte [ ] iv = ivParams . getIV ( ) ; if ( iv == null || iv ... | 240 |
java-test-5107 | java | What does the code calculate attempting to preserve the angular orientation of the display across transitions ? | the angular bounds of the layout | protected void calc Angular Bounds ( Node Item r ) { if ( m prev Root == null || ! m prev Root . is Valid ( ) || r == m prev Root ) { m prev Root = r ; return ; } Node Item p = m prev Root ; while ( BOOL ) { Node Item pp = ( Node Item ) p . get Parent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m prev Roo... | protected void calcAngularBounds ( NodeItem r ) { if ( m_prevRoot == null || ! m_prevRoot . isValid ( ) || r == m_prevRoot ) { m_prevRoot = r ; return ; } NodeItem p = m_prevRoot ; while ( _BOOL ) { NodeItem pp = ( NodeItem ) p . getParent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m_prevRoot = r ; retur... | 280 |
java-test-5108 | java | What does the code attempt ? | to preserve the angular orientation of the display across transitions | protected void calc Angular Bounds ( Node Item r ) { if ( m prev Root == null || ! m prev Root . is Valid ( ) || r == m prev Root ) { m prev Root = r ; return ; } Node Item p = m prev Root ; while ( BOOL ) { Node Item pp = ( Node Item ) p . get Parent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m prev Roo... | protected void calcAngularBounds ( NodeItem r ) { if ( m_prevRoot == null || ! m_prevRoot . isValid ( ) || r == m_prevRoot ) { m_prevRoot = r ; return ; } NodeItem p = m_prevRoot ; while ( _BOOL ) { NodeItem pp = ( NodeItem ) p . getParent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m_prevRoot = r ; retur... | 280 |
java-test-5109 | java | Does the code preserve the angular orientation of the display across transitions ? | No | protected void calc Angular Bounds ( Node Item r ) { if ( m prev Root == null || ! m prev Root . is Valid ( ) || r == m prev Root ) { m prev Root = r ; return ; } Node Item p = m prev Root ; while ( BOOL ) { Node Item pp = ( Node Item ) p . get Parent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m prev Roo... | protected void calcAngularBounds ( NodeItem r ) { if ( m_prevRoot == null || ! m_prevRoot . isValid ( ) || r == m_prevRoot ) { m_prevRoot = r ; return ; } NodeItem p = m_prevRoot ; while ( _BOOL ) { NodeItem pp = ( NodeItem ) p . getParent ( ) ; if ( pp == r ) { break ; } else if ( pp == null ) { m_prevRoot = r ; retur... | 280 |
java-test-5110 | java | What does the code get ? | a summary of your team ' s season | public String season Summary Str ( ) { String summary = STRING + name + STRING + rank Team Poll Score + STRING + wins + STRING + losses + STRING ; int expected Poll Finish = NUM - team Prestige ; int diff Expected = expected Poll Finish - rank Team Poll Score ; int old Prestige = team Prestige ; int new Prestige = old ... | public String seasonSummaryStr ( ) { String summary = STRING + name + STRING + rankTeamPollScore + STRING + wins + STRING + losses + STRING ; int expectedPollFinish = _NUM - teamPrestige ; int diffExpected = expectedPollFinish - rankTeamPollScore ; int oldPrestige = teamPrestige ; int newPrestige = oldPrestige ; if ( t... | 285 |
java-test-5111 | java | What did they win ? | rivalry game | public String season Summary Str ( ) { String summary = STRING + name + STRING + rank Team Poll Score + STRING + wins + STRING + losses + STRING ; int expected Poll Finish = NUM - team Prestige ; int diff Expected = expected Poll Finish - rank Team Poll Score ; int old Prestige = team Prestige ; int new Prestige = old ... | public String seasonSummaryStr ( ) { String summary = STRING + name + STRING + rankTeamPollScore + STRING + wins + STRING + losses + STRING ; int expectedPollFinish = _NUM - teamPrestige ; int diffExpected = expectedPollFinish - rankTeamPollScore ; int oldPrestige = teamPrestige ; int newPrestige = oldPrestige ; if ( t... | 285 |
java-test-5113 | java | What does this instance have ? | the keys equal to either prefix . keyprefix or keyprefix | public Configuration sub Config ( String prefix , String key Prefix ) { Configuration sub = new Configuration ( ) ; add To Sub Conf ( sub , prefix . length ( ) > NUM ? prefix + STRING + key Prefix : key Prefix ) ; return sub ; } | public Configuration subConfig ( String prefix , String keyPrefix ) { Configuration sub = new Configuration ( ) ; addToSubConf ( sub , prefix . length ( ) > _NUM ? prefix + STRING + keyPrefix : keyPrefix ) ; return sub ; } | 51 |
java-test-5114 | java | How does a program satisfy an op_checkmultisig program ? | using pre - encoded signatures | public static Script create Multi Sig Input Script Bytes ( List < byte [ ] > signatures ) { check Argument ( signatures . size ( ) <= NUM ) ; Script Builder builder = new Script Builder ( ) ; builder . small Num ( NUM ) ; for ( byte [ ] signature : signatures ) builder . data ( signature ) ; return builder . build ( ) ... | public static Script createMultiSigInputScriptBytes ( List < byte [ ] > signatures ) { checkArgument ( signatures . size ( ) <= _NUM ) ; ScriptBuilder builder = new ScriptBuilder ( ) ; builder . smallNum ( _NUM ) ; for ( byte [ ] signature : signatures ) builder . data ( signature ) ; return builder . build ( ) ; } | 73 |
java-test-5115 | java | What are no nodes attempting ? | to join the grid | private void check Pending Custom Messages ( ) { if ( joining Nodes . is Empty ( ) && is Local Node Coordinator ( ) ) { Tcp Discovery Custom Event Message msg ; while ( ( msg = pending Custom Msgs . poll ( ) ) != null ) { process Custom Message ( msg ) ; if ( msg . verified ( ) ) msg Hist . add ( msg ) ; } } } | private void checkPendingCustomMessages ( ) { if ( joiningNodes . isEmpty ( ) && isLocalNodeCoordinator ( ) ) { TcpDiscoveryCustomEventMessage msg ; while ( ( msg = pendingCustomMsgs . poll ( ) ) != null ) { processCustomMessage ( msg ) ; if ( msg . verified ( ) ) msgHist . add ( msg ) ; } } } | 77 |
java-test-5116 | java | What are attempting to join the grid ? | no nodes | private void check Pending Custom Messages ( ) { if ( joining Nodes . is Empty ( ) && is Local Node Coordinator ( ) ) { Tcp Discovery Custom Event Message msg ; while ( ( msg = pending Custom Msgs . poll ( ) ) != null ) { process Custom Message ( msg ) ; if ( msg . verified ( ) ) msg Hist . add ( msg ) ; } } } | private void checkPendingCustomMessages ( ) { if ( joiningNodes . isEmpty ( ) && isLocalNodeCoordinator ( ) ) { TcpDiscoveryCustomEventMessage msg ; while ( ( msg = pendingCustomMsgs . poll ( ) ) != null ) { processCustomMessage ( msg ) ; if ( msg . verified ( ) ) msgHist . add ( msg ) ; } } } | 77 |
java-test-5117 | java | Do no nodes join the grid ? | No | private void check Pending Custom Messages ( ) { if ( joining Nodes . is Empty ( ) && is Local Node Coordinator ( ) ) { Tcp Discovery Custom Event Message msg ; while ( ( msg = pending Custom Msgs . poll ( ) ) != null ) { process Custom Message ( msg ) ; if ( msg . verified ( ) ) msg Hist . add ( msg ) ; } } } | private void checkPendingCustomMessages ( ) { if ( joiningNodes . isEmpty ( ) && isLocalNodeCoordinator ( ) ) { TcpDiscoveryCustomEventMessage msg ; while ( ( msg = pendingCustomMsgs . poll ( ) ) != null ) { processCustomMessage ( msg ) ; if ( msg . verified ( ) ) msgHist . add ( msg ) ; } } } | 77 |
java-test-5118 | java | What did the code have ? | parents that can be pulled from | public static Map < String , Mapped Class > fill In The Gaps ( Map < String , Mapped Class > mapped Classes , Mapping Mode mode ) { for ( String original Name : mapped Classes . key Set ( ) ) { mapped Classes = fill Gap ( mapped Classes . get ( original Name ) , mapped Classes , mode ) ; } return mapped Classes ; } | public static Map < String , MappedClass > fillInTheGaps ( Map < String , MappedClass > mappedClasses , MappingMode mode ) { for ( String originalName : mappedClasses . keySet ( ) ) { mappedClasses = fillGap ( mappedClasses . get ( originalName ) , mappedClasses , mode ) ; } return mappedClasses ; } | 71 |
java-test-5119 | java | What do not include type information even if declared as object ? | limited number of core types | public void test Numeric Scalars ( ) throws Exception { Object Mapper m = new Object Mapper ( ) ; m . enable Default Typing ( ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Integer . value Of ( NUM ) } ) ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Long . value Of... | public void testNumericScalars ( ) throws Exception { ObjectMapper m = new ObjectMapper ( ) ; m . enableDefaultTyping ( ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Integer . valueOf ( _NUM ) } ) ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Long . valueOf ( _NUM ) } ) )... | 141 |
java-test-5120 | java | Do limited number of core types include type information even if declared as object ? | No | public void test Numeric Scalars ( ) throws Exception { Object Mapper m = new Object Mapper ( ) ; m . enable Default Typing ( ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Integer . value Of ( NUM ) } ) ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Long . value Of... | public void testNumericScalars ( ) throws Exception { ObjectMapper m = new ObjectMapper ( ) ; m . enableDefaultTyping ( ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Integer . valueOf ( _NUM ) } ) ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Long . valueOf ( _NUM ) } ) )... | 141 |
java-test-5121 | java | How do json scalar values map to ? | natively | public void test Numeric Scalars ( ) throws Exception { Object Mapper m = new Object Mapper ( ) ; m . enable Default Typing ( ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Integer . value Of ( NUM ) } ) ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Long . value Of... | public void testNumericScalars ( ) throws Exception { ObjectMapper m = new ObjectMapper ( ) ; m . enableDefaultTyping ( ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Integer . valueOf ( _NUM ) } ) ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Long . valueOf ( _NUM ) } ) )... | 141 |
java-test-5122 | java | What never have type information ? | nulls | public void test Numeric Scalars ( ) throws Exception { Object Mapper m = new Object Mapper ( ) ; m . enable Default Typing ( ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Integer . value Of ( NUM ) } ) ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Long . value Of... | public void testNumericScalars ( ) throws Exception { ObjectMapper m = new ObjectMapper ( ) ; m . enableDefaultTyping ( ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Integer . valueOf ( _NUM ) } ) ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Long . valueOf ( _NUM ) } ) )... | 141 |
java-test-5123 | java | What did nulls never have ? | type information | public void test Numeric Scalars ( ) throws Exception { Object Mapper m = new Object Mapper ( ) ; m . enable Default Typing ( ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Integer . value Of ( NUM ) } ) ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Long . value Of... | public void testNumericScalars ( ) throws Exception { ObjectMapper m = new ObjectMapper ( ) ; m . enableDefaultTyping ( ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Integer . valueOf ( _NUM ) } ) ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Long . valueOf ( _NUM ) } ) )... | 141 |
java-test-5124 | java | What do limited number of core types not include even if declared as object ? | type information | public void test Numeric Scalars ( ) throws Exception { Object Mapper m = new Object Mapper ( ) ; m . enable Default Typing ( ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Integer . value Of ( NUM ) } ) ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Long . value Of... | public void testNumericScalars ( ) throws Exception { ObjectMapper m = new ObjectMapper ( ) ; m . enableDefaultTyping ( ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Integer . valueOf ( _NUM ) } ) ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Long . valueOf ( _NUM ) } ) )... | 141 |
java-test-5125 | java | Did nulls have type information ? | No | public void test Numeric Scalars ( ) throws Exception { Object Mapper m = new Object Mapper ( ) ; m . enable Default Typing ( ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Integer . value Of ( NUM ) } ) ) ; assert Equals ( STRING , m . write Value As String ( new Object [ ] { Long . value Of... | public void testNumericScalars ( ) throws Exception { ObjectMapper m = new ObjectMapper ( ) ; m . enableDefaultTyping ( ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Integer . valueOf ( _NUM ) } ) ) ; assertEquals ( STRING , m . writeValueAsString ( new Object [ ] { Long . valueOf ( _NUM ) } ) )... | 141 |
java-test-5126 | java | What did the code return ? | the log sequence number stored in the file header | private long check File Header ( Buffered File Data Input bfdi ) throws Replicator Exception , Interrupted Exception { int magic = NUM ; short major = NUM ; short minor = NUM ; try { bfdi . wait Available ( HEADER LENGTH , HEADER WAIT MILLIS ) ; magic = bfdi . read Int ( ) ; major = bfdi . read Short ( ) ; minor = bfdi... | private long checkFileHeader ( BufferedFileDataInput bfdi ) throws ReplicatorException , InterruptedException { int magic = _NUM ; short major = _NUM ; short minor = _NUM ; try { bfdi . waitAvailable ( HEADER_LENGTH , HEADER_WAIT_MILLIS ) ; magic = bfdi . readInt ( ) ; major = bfdi . readShort ( ) ; minor = bfdi . read... | 208 |
java-test-5127 | java | What stored in the file header ? | the log sequence number | private long check File Header ( Buffered File Data Input bfdi ) throws Replicator Exception , Interrupted Exception { int magic = NUM ; short major = NUM ; short minor = NUM ; try { bfdi . wait Available ( HEADER LENGTH , HEADER WAIT MILLIS ) ; magic = bfdi . read Int ( ) ; major = bfdi . read Short ( ) ; minor = bfdi... | private long checkFileHeader ( BufferedFileDataInput bfdi ) throws ReplicatorException , InterruptedException { int magic = _NUM ; short major = _NUM ; short minor = _NUM ; try { bfdi . waitAvailable ( HEADER_LENGTH , HEADER_WAIT_MILLIS ) ; magic = bfdi . readInt ( ) ; major = bfdi . readShort ( ) ; minor = bfdi . read... | 208 |
java-test-5128 | java | What did the code read ? | the file header | private long check File Header ( Buffered File Data Input bfdi ) throws Replicator Exception , Interrupted Exception { int magic = NUM ; short major = NUM ; short minor = NUM ; try { bfdi . wait Available ( HEADER LENGTH , HEADER WAIT MILLIS ) ; magic = bfdi . read Int ( ) ; major = bfdi . read Short ( ) ; minor = bfdi... | private long checkFileHeader ( BufferedFileDataInput bfdi ) throws ReplicatorException , InterruptedException { int magic = _NUM ; short major = _NUM ; short minor = _NUM ; try { bfdi . waitAvailable ( HEADER_LENGTH , HEADER_WAIT_MILLIS ) ; magic = bfdi . readInt ( ) ; major = bfdi . readShort ( ) ; minor = bfdi . read... | 208 |
java-test-5129 | java | What does the code create ? | a new configuration | public Config ( Saml Authority Configuration saml Authority Config , Token Restrictions token Restrictions , Collection < List < Certificate > > valid Certs , long clock Tolerance , Collection < IDP Config > in External Idps ) { Validate . not Null ( saml Authority Config ) ; Validate . not Null ( token Restrictions ) ... | public Config ( SamlAuthorityConfiguration samlAuthorityConfig , TokenRestrictions tokenRestrictions , Collection < List < Certificate > > validCerts , long clockTolerance , Collection < IDPConfig > inExternalIdps ) { Validate . notNull ( samlAuthorityConfig ) ; Validate . notNull ( tokenRestrictions ) ; Validate . not... | 298 |
java-test-5130 | java | Did this support both unicode escapes " u000a " ? | No | private char read Escape Character ( ) throws IO Exception { if ( pos == limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + NUM > limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char result = NUM ; fo... | private char readEscapeCharacter ( ) throws IOException { if ( pos == limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + _NUM > limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char result = _NUM ; for (... | 276 |
java-test-5131 | java | What follow a backslash immediately ? | the character or characters | private char read Escape Character ( ) throws IO Exception { if ( pos == limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + NUM > limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char result = NUM ; fo... | private char readEscapeCharacter ( ) throws IOException { if ( pos == limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + _NUM > limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char result = _NUM ; for (... | 276 |
java-test-5132 | java | What do the character or characters follow immediately ? | a backslash | private char read Escape Character ( ) throws IO Exception { if ( pos == limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + NUM > limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char result = NUM ; fo... | private char readEscapeCharacter ( ) throws IOException { if ( pos == limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + _NUM > limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char result = _NUM ; for (... | 276 |
java-test-5133 | java | When do the character or characters follow a backslash ? | immediately | private char read Escape Character ( ) throws IO Exception { if ( pos == limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + NUM > limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char result = NUM ; fo... | private char readEscapeCharacter ( ) throws IOException { if ( pos == limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + _NUM > limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char result = _NUM ; for (... | 276 |
java-test-5134 | java | When should the backslash have been read ? | already | private char read Escape Character ( ) throws IO Exception { if ( pos == limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + NUM > limit && ! fill Buffer ( NUM ) ) { throw syntax Error ( STRING ) ; } char result = NUM ; fo... | private char readEscapeCharacter ( ) throws IOException { if ( pos == limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char escaped = buffer [ pos ++ ] ; switch ( escaped ) { case STRING : if ( pos + _NUM > limit && ! fillBuffer ( _NUM ) ) { throw syntaxError ( STRING ) ; } char result = _NUM ; for (... | 276 |
java-test-5135 | java | Where do a tag print ? | in toplevel | private void append Tag ( String tag Name , String value ) { xml . append ( STRING ) ; xml . append ( tag Name ) ; xml . append ( STRING ) ; xml . append ( value ) ; xml . append ( STRING ) ; xml . append ( tag Name ) ; xml . append ( STRING ) ; } | private void appendTag ( String tagName , String value ) { xml . append ( STRING ) ; xml . append ( tagName ) ; xml . append ( STRING ) ; xml . append ( value ) ; xml . append ( STRING ) ; xml . append ( tagName ) ; xml . append ( STRING ) ; } | 65 |
java-test-5137 | java | What does the code remove from the dataset at the specified index ? | the given entry object | public boolean remove Entry ( Entry e , int data Set Index ) { if ( e == null || data Set Index >= m Data Sets . size ( ) ) return BOOL ; I Data Set set = m Data Sets . get ( data Set Index ) ; if ( set != null ) { boolean removed = set . remove Entry ( e ) ; if ( removed ) { calc Min Max ( ) ; } return removed ; } ret... | public boolean removeEntry ( Entry e , int dataSetIndex ) { if ( e == null || dataSetIndex >= mDataSets . size ( ) ) return _BOOL ; IDataSet set = mDataSets . get ( dataSetIndex ) ; if ( set != null ) { boolean removed = set . removeEntry ( e ) ; if ( removed ) { calcMinMax ( ) ; } return removed ; } return _BOOL ; } | 89 |
java-test-5138 | java | What does the code write ? | a placemarker style | private void write Placemarker Style ( String name , String url , int x , int y ) { print Writer . println ( STRING + name + STRING ) ; print Writer . println ( STRING ) ; print Writer . println ( STRING + url + STRING ) ; print Writer . println ( STRING + x + STRING + y + STRING ) ; print Writer . println ( STRING ) ;... | private void writePlacemarkerStyle ( String name , String url , int x , int y ) { printWriter . println ( STRING + name + STRING ) ; printWriter . println ( STRING ) ; printWriter . println ( STRING + url + STRING ) ; printWriter . println ( STRING + x + STRING + y + STRING ) ; printWriter . println ( STRING ) ; } | 76 |
java-test-5141 | java | What have we laid with the current layout ? | the pane | private void ensure Current Layout ( ) { if ( ! tab Pane . is Valid ( ) ) { tab Pane . validate ( ) ; } if ( ! tab Pane . is Valid ( ) ) { Tabbed Pane Layout layout = ( Tabbed Pane Layout ) tab Pane . get Layout ( ) ; layout . calculate Layout Info ( ) ; } } | private void ensureCurrentLayout ( ) { if ( ! tabPane . isValid ( ) ) { tabPane . validate ( ) ; } if ( ! tabPane . isValid ( ) ) { TabbedPaneLayout layout = ( TabbedPaneLayout ) tabPane . getLayout ( ) ; layout . calculateLayoutInfo ( ) ; } } | 68 |
java-test-5142 | java | How have we laid the pane ? | with the current layout | private void ensure Current Layout ( ) { if ( ! tab Pane . is Valid ( ) ) { tab Pane . validate ( ) ; } if ( ! tab Pane . is Valid ( ) ) { Tabbed Pane Layout layout = ( Tabbed Pane Layout ) tab Pane . get Layout ( ) ; layout . calculate Layout Info ( ) ; } } | private void ensureCurrentLayout ( ) { if ( ! tabPane . isValid ( ) ) { tabPane . validate ( ) ; } if ( ! tabPane . isValid ( ) ) { TabbedPaneLayout layout = ( TabbedPaneLayout ) tabPane . getLayout ( ) ; layout . calculateLayoutInfo ( ) ; } } | 68 |
java-test-5144 | java | What does code set ? | the sign flag | public static void generate Sign Flag Code ( final I Translation Environment environment , final long offset , final String value , final Operand Size value Size , final List < Reil Instruction > instructions ) throws Illegal Argument Exception { Preconditions . check Not Null ( environment , STRING ) ; Preconditions .... | public static void generateSignFlagCode ( final ITranslationEnvironment environment , final long offset , final String value , final OperandSize valueSize , final List < ReilInstruction > instructions ) throws IllegalArgumentException { Preconditions . checkNotNull ( environment , STRING ) ; Preconditions . checkNotNul... | 214 |
java-test-5145 | java | What does the code close ? | a given channel | protected void close Channel ( Socket Channel channel ) { if ( channel == null ) return ; Socket socket = channel . socket ( ) ; try { socket . shutdown Input ( ) ; socket . shutdown Output ( ) ; socket . close ( ) ; } catch ( IO Exception ex ) { if ( logger . is Loggable ( Level . FINE ) ) { logger . log ( Level . FIN... | protected void closeChannel ( SocketChannel channel ) { if ( channel == null ) return ; Socket socket = channel . socket ( ) ; try { socket . shutdownInput ( ) ; socket . shutdownOutput ( ) ; socket . close ( ) ; } catch ( IOException ex ) { if ( _logger . isLoggable ( Level . FINE ) ) { _logger . log ( Level . FINE , ... | 133 |
java-test-5146 | java | What does the code look ? | records of the specified type for the specified name | protected Record [ ] lookup ( String namestr , int type , String type Desc ) throws Temporary Resolution Exception { try { Lookup l = new Lookup ( namestr , type ) ; l . set Cache ( cache ) ; l . set Resolver ( resolver ) ; l . set Credibility ( dns Credibility ) ; l . set Search Path ( search Paths ) ; Record [ ] r = ... | protected Record [ ] lookup ( String namestr , int type , String typeDesc ) throws TemporaryResolutionException { try { Lookup l = new Lookup ( namestr , type ) ; l . setCache ( cache ) ; l . setResolver ( resolver ) ; l . setCredibility ( dnsCredibility ) ; l . setSearchPath ( searchPaths ) ; Record [ ] r = l . run ( ... | 166 |
java-test-5147 | java | What does the code add ? | a default set of glue rules | public void add Glue Rules ( Array List < Feature Function > feature Functions ) { Hiero Format Reader reader = new Hiero Format Reader ( ) ; String goal NT = Format Utils . clean Non Terminal ( joshua Configuration . goal symbol ) ; String default NT = Format Utils . clean Non Terminal ( joshua Configuration . default... | public void addGlueRules ( ArrayList < FeatureFunction > featureFunctions ) { HieroFormatReader reader = new HieroFormatReader ( ) ; String goalNT = FormatUtils . cleanNonTerminal ( joshuaConfiguration . goal_symbol ) ; String defaultNT = FormatUtils . cleanNonTerminal ( joshuaConfiguration . default_non_terminal ) ; S... | 185 |
java-test-5148 | java | What specified in indices ? | those attributes | private void build Linear Model ( int [ ] indices ) throws Exception { Instances reduced Inst = new Instances ( m instances ) ; Remove attribute Filter = new Remove ( ) ; attribute Filter . set Invert Selection ( BOOL ) ; attribute Filter . set Attribute Indices Array ( indices ) ; attribute Filter . set Input Format (... | private void buildLinearModel ( int [ ] indices ) throws Exception { Instances reducedInst = new Instances ( m_instances ) ; Remove attributeFilter = new Remove ( ) ; attributeFilter . setInvertSelection ( _BOOL ) ; attributeFilter . setAttributeIndicesArray ( indices ) ; attributeFilter . setInputFormat ( reducedInst ... | 213 |
java-test-5149 | java | What does the code build using those attributes specified in indices ? | a linear model for this node | private void build Linear Model ( int [ ] indices ) throws Exception { Instances reduced Inst = new Instances ( m instances ) ; Remove attribute Filter = new Remove ( ) ; attribute Filter . set Invert Selection ( BOOL ) ; attribute Filter . set Attribute Indices Array ( indices ) ; attribute Filter . set Input Format (... | private void buildLinearModel ( int [ ] indices ) throws Exception { Instances reducedInst = new Instances ( m_instances ) ; Remove attributeFilter = new Remove ( ) ; attributeFilter . setInvertSelection ( _BOOL ) ; attributeFilter . setAttributeIndicesArray ( indices ) ; attributeFilter . setInputFormat ( reducedInst ... | 213 |
java-test-5150 | java | How does the code build a linear model for this node ? | using those attributes specified in indices | private void build Linear Model ( int [ ] indices ) throws Exception { Instances reduced Inst = new Instances ( m instances ) ; Remove attribute Filter = new Remove ( ) ; attribute Filter . set Invert Selection ( BOOL ) ; attribute Filter . set Attribute Indices Array ( indices ) ; attribute Filter . set Input Format (... | private void buildLinearModel ( int [ ] indices ) throws Exception { Instances reducedInst = new Instances ( m_instances ) ; Remove attributeFilter = new Remove ( ) ; attributeFilter . setInvertSelection ( _BOOL ) ; attributeFilter . setAttributeIndicesArray ( indices ) ; attributeFilter . setInputFormat ( reducedInst ... | 213 |
java-test-5151 | java | Where did those attributes specify ? | in indices | private void build Linear Model ( int [ ] indices ) throws Exception { Instances reduced Inst = new Instances ( m instances ) ; Remove attribute Filter = new Remove ( ) ; attribute Filter . set Invert Selection ( BOOL ) ; attribute Filter . set Attribute Indices Array ( indices ) ; attribute Filter . set Input Format (... | private void buildLinearModel ( int [ ] indices ) throws Exception { Instances reducedInst = new Instances ( m_instances ) ; Remove attributeFilter = new Remove ( ) ; attributeFilter . setInvertSelection ( _BOOL ) ; attributeFilter . setAttributeIndicesArray ( indices ) ; attributeFilter . setInputFormat ( reducedInst ... | 213 |
java-test-5152 | java | What does the code create ? | a listening bluetooth socket | private void create Listening Socket ( ) throws IO Exception { m Server Socket = m Bluetooth Adapter . listen Using Insecure Rfcomm With Service Record ( SDP NAME , m This Device UUID ) ; log . info ( String . format ( STRING , SDP NAME , m This Device UUID ) ) ; } | private void createListeningSocket ( ) throws IOException { mServerSocket = mBluetoothAdapter . listenUsingInsecureRfcommWithServiceRecord ( SDP_NAME , mThisDeviceUUID ) ; log . info ( String . format ( STRING , SDP_NAME , mThisDeviceUUID ) ) ; } | 57 |
java-test-5153 | java | How do an initialized datasourcepool test ? | by running a simple query | private void test Data Source ( Hikari Data Source data Source Pool ) throws SQL Exception { try { Connection conn = null ; try { conn = data Source Pool . get Connection ( ) ; test Connection ( conn ) ; } finally { if ( conn != null ) { conn . close ( ) ; } } } catch ( SQL Exception e ) { log Connection Failure ( ) ; ... | private void testDataSource ( HikariDataSource dataSourcePool ) throws SQLException { try { Connection conn = null ; try { conn = dataSourcePool . getConnection ( ) ; testConnection ( conn ) ; } finally { if ( conn != null ) { conn . close ( ) ; } } } catch ( SQLException e ) { logConnectionFailure ( ) ; throw e ; } } | 80 |
java-test-5156 | java | What does the code make ? | a binary search for the given row item over the table | private int lookup Row Item ( Comparator < Row Item > comparator , Row Item item ) { int left = NUM ; int right = table . get Row Count ( ) - NUM ; while ( left <= right ) { int middle = ( left + right ) > > > NUM ; Row Item i = get Row Item ( middle ) ; int cmp = comparator . compare ( i , item ) ; if ( cmp < NUM ) { ... | private int lookupRowItem ( Comparator < RowItem > comparator , RowItem item ) { int left = _NUM ; int right = table . getRowCount ( ) - _NUM ; while ( left <= right ) { int middle = ( left + right ) > > > _NUM ; RowItem i = getRowItem ( middle ) ; int cmp = comparator . compare ( i , item ) ; if ( cmp < _NUM ) { left ... | 119 |
java-test-5158 | java | What do components want in some cases still ? | to iterate over all primary shards ( and not just one shard in replication group ) | public Group Shards Iterator active Primary Shards Grouped ( String [ ] indices , boolean include Empty ) { Array List < Shard Iterator > set = new Array List < > ( ) ; for ( String index : indices ) { Index Routing Table index Routing Table = index ( index ) ; if ( index Routing Table == null ) { throw new Index Not F... | public GroupShardsIterator activePrimaryShardsGrouped ( String [ ] indices , boolean includeEmpty ) { ArrayList < ShardIterator > set = new ArrayList < > ( ) ; for ( String index : indices ) { IndexRoutingTable indexRoutingTable = index ( index ) ; if ( indexRoutingTable == null ) { throw new IndexNotFoundException ( i... | 176 |
java-test-5159 | java | What do components expect ? | to get group iterators | public Group Shards Iterator active Primary Shards Grouped ( String [ ] indices , boolean include Empty ) { Array List < Shard Iterator > set = new Array List < > ( ) ; for ( String index : indices ) { Index Routing Table index Routing Table = index ( index ) ; if ( index Routing Table == null ) { throw new Index Not F... | public GroupShardsIterator activePrimaryShardsGrouped ( String [ ] indices , boolean includeEmpty ) { ArrayList < ShardIterator > set = new ArrayList < > ( ) ; for ( String index : indices ) { IndexRoutingTable indexRoutingTable = index ( index ) ; if ( indexRoutingTable == null ) { throw new IndexNotFoundException ( i... | 176 |
java-test-5160 | java | What do that get ? | group iterators | public Group Shards Iterator active Primary Shards Grouped ( String [ ] indices , boolean include Empty ) { Array List < Shard Iterator > set = new Array List < > ( ) ; for ( String index : indices ) { Index Routing Table index Routing Table = index ( index ) ; if ( index Routing Table == null ) { throw new Index Not F... | public GroupShardsIterator activePrimaryShardsGrouped ( String [ ] indices , boolean includeEmpty ) { ArrayList < ShardIterator > set = new ArrayList < > ( ) ; for ( String index : indices ) { IndexRoutingTable indexRoutingTable = index ( index ) ; if ( indexRoutingTable == null ) { throw new IndexNotFoundException ( i... | 176 |
java-test-5161 | java | What does the code create ? | a new instance of rsakeyloader | public RSA Key Loader ( int id , String config Home , boolean default Keys ) { this . id = id ; this . default Keys = default Keys ; if ( config Home . equals ( STRING ) ) { path = STRING + System . get Property ( STRING ) + STRING + System . get Property ( STRING ) ; } else { path = config Home + System . get Property... | public RSAKeyLoader ( int id , String configHome , boolean defaultKeys ) { this . id = id ; this . defaultKeys = defaultKeys ; if ( configHome . equals ( STRING ) ) { path = STRING + System . getProperty ( STRING ) + STRING + System . getProperty ( STRING ) ; } else { path = configHome + System . getProperty ( STRING )... | 92 |
java-test-5162 | java | What are the code indicates ? | how many of the track points are already in the save file | public Track ( Context context ) { track = new Array List < Track Point > ( ) ; ctx = context ; if ( is Open ) { mark Saving Broken ( STRING , null ) ; } else { is Open = BOOL ; Log . i ( TAG , STRING ) ; async Load ( ) ; } } | public Track ( Context context ) { track = new ArrayList < TrackPoint > ( ) ; ctx = context ; if ( isOpen ) { markSavingBroken ( STRING , null ) ; } else { isOpen = _BOOL ; Log . i ( TAG , STRING ) ; asyncLoad ( ) ; } } | 62 |
java-test-5163 | java | What does the code handle ? | the new authentication instance request | public void handle Create Instance Button Request ( Request Invocation Event event ) { remove Page Session Attribute ( AUTH INSTANCE TABLE ) ; New Auth Instance View Bean vb = ( New Auth Instance View Bean ) get View Bean ( New Auth Instance View Bean . class ) ; unlock Page Trail ( ) ; pass Pg Session Map ( vb ) ; vb ... | public void handleCreateInstanceButtonRequest ( RequestInvocationEvent event ) { removePageSessionAttribute ( AUTH_INSTANCE_TABLE ) ; NewAuthInstanceViewBean vb = ( NewAuthInstanceViewBean ) getViewBean ( NewAuthInstanceViewBean . class ) ; unlockPageTrail ( ) ; passPgSessionMap ( vb ) ; vb . forwardTo ( getRequestCont... | 78 |
java-test-5165 | java | What does the code create ? | the panel on the left side of the window | private J Panel create Left Side ( ) { J Panel left Panel = new J Panel ( ) ; list Model = new Custom List Model ( ) ; left Panel . set Layout ( new Border Layout ( ) ) ; list Box = new J List < String > ( list Model ) ; list Box . set Cell Renderer ( new Jlist Renderer ( ) ) ; list Box . set Selection Mode ( List Sele... | private JPanel createLeftSide ( ) { JPanel leftPanel = new JPanel ( ) ; listModel = new CustomListModel ( ) ; leftPanel . setLayout ( new BorderLayout ( ) ) ; listBox = new JList < String > ( listModel ) ; listBox . setCellRenderer ( new JlistRenderer ( ) ) ; listBox . setSelectionMode ( ListSelectionModel . SINGLE_SEL... | 195 |
java-test-5166 | java | What do this require ? | reversing the order of the diredges , and flipping each diredge as well | private List reverse ( List seq ) { Linked List new Seq = new Linked List ( ) ; for ( Iterator i = seq . iterator ( ) ; i . has Next ( ) ; ) { Directed Edge de = ( Directed Edge ) i . next ( ) ; new Seq . add First ( de . get Sym ( ) ) ; } return new Seq ; } | private List reverse ( List seq ) { LinkedList newSeq = new LinkedList ( ) ; for ( Iterator i = seq . iterator ( ) ; i . hasNext ( ) ; ) { DirectedEdge de = ( DirectedEdge ) i . next ( ) ; newSeq . addFirst ( de . getSym ( ) ) ; } return newSeq ; } | 73 |
java-test-5167 | java | What does screenshots inject to trigger the screenshot ? | the key event combo | public void test Screenshot ( ) throws Exception { Log . d ( LOG TAG , STRING ) ; Screenshot Stub Activity activity = get Activity ( ) ; assert Not Null ( activity ) ; File screenshot Dir = get Screenshot Dir ( ) ; New Screenshot Observer observer = new New Screenshot Observer ( screenshot Dir . get Absolute Path ( ) )... | public void testScreenshot ( ) throws Exception { Log . d ( LOG_TAG , STRING ) ; ScreenshotStubActivity activity = getActivity ( ) ; assertNotNull ( activity ) ; File screenshotDir = getScreenshotDir ( ) ; NewScreenshotObserver observer = new NewScreenshotObserver ( screenshotDir . getAbsolutePath ( ) ) ; observer . st... | 222 |
java-test-5168 | java | For what purpose does screenshots inject the key event combo ? | to trigger the screenshot | public void test Screenshot ( ) throws Exception { Log . d ( LOG TAG , STRING ) ; Screenshot Stub Activity activity = get Activity ( ) ; assert Not Null ( activity ) ; File screenshot Dir = get Screenshot Dir ( ) ; New Screenshot Observer observer = new New Screenshot Observer ( screenshot Dir . get Absolute Path ( ) )... | public void testScreenshot ( ) throws Exception { Log . d ( LOG_TAG , STRING ) ; ScreenshotStubActivity activity = getActivity ( ) ; assertNotNull ( activity ) ; File screenshotDir = getScreenshotDir ( ) ; NewScreenshotObserver observer = new NewScreenshotObserver ( screenshotDir . getAbsolutePath ( ) ) ; observer . st... | 222 |
java-test-5169 | java | What does the code get from file map based on block start offset ? | affinity key | public Ignite Uuid affinity Key ( long block Off , boolean include Moved ) { if ( ranges == null ) return null ; assert ! ranges . is Empty ( ) ; int left Idx = NUM , right Idx = ranges . size ( ) - NUM ; Igfs File Affinity Range left Range = ranges . get ( left Idx ) ; Igfs File Affinity Range right Range = ranges . g... | public IgniteUuid affinityKey ( long blockOff , boolean includeMoved ) { if ( ranges == null ) return null ; assert ! ranges . isEmpty ( ) ; int leftIdx = _NUM , rightIdx = ranges . size ( ) - _NUM ; IgfsFileAffinityRange leftRange = ranges . get ( leftIdx ) ; IgfsFileAffinityRange rightRange = ranges . get ( rightIdx ... | 321 |
java-test-5171 | java | What does the code extract ? | all properties in this namespace that can be found in the provided property source | public Properties extract Properties ( Iterable < Map . Entry < String , String > > prop Src ) { Properties result = new Properties ( ) ; for ( Map . Entry < String , String > entry : prop Src ) { String name = entry . get Key ( ) ; if ( is Namespaced Property ( name ) ) { String val = entry . get Value ( ) ; result . ... | public Properties extractProperties ( Iterable < Map . Entry < String , String > > propSrc ) { Properties result = new Properties ( ) ; for ( Map . Entry < String , String > entry : propSrc ) { String name = entry . getKey ( ) ; if ( isNamespacedProperty ( name ) ) { String val = entry . getValue ( ) ; result . setProp... | 90 |
java-test-5172 | java | Where can all properties in this namespace be found ? | in the provided property source | public Properties extract Properties ( Iterable < Map . Entry < String , String > > prop Src ) { Properties result = new Properties ( ) ; for ( Map . Entry < String , String > entry : prop Src ) { String name = entry . get Key ( ) ; if ( is Namespaced Property ( name ) ) { String val = entry . get Value ( ) ; result . ... | public Properties extractProperties ( Iterable < Map . Entry < String , String > > propSrc ) { Properties result = new Properties ( ) ; for ( Map . Entry < String , String > entry : propSrc ) { String name = entry . getKey ( ) ; if ( isNamespacedProperty ( name ) ) { String val = entry . getValue ( ) ; result . setProp... | 90 |
java-test-5177 | java | What does the code traverse to find correct bundleretainer ? | the class hierarchy | private static Class < ? > find Class ( Class Loader loader , Class < ? > clazz ) { final String name = clazz . get Name ( ) ; if ( name . starts With ( STRING ) || name . starts With ( STRING ) ) return null ; String generated Class Name = generate Retainer Class Name ( name ) ; try { if ( Akatsuki . logging Level == ... | private static Class < ? > findClass ( ClassLoader loader , Class < ? > clazz ) { final String name = clazz . getName ( ) ; if ( name . startsWith ( STRING ) || name . startsWith ( STRING ) ) return null ; String generatedClassName = generateRetainerClassName ( name ) ; try { if ( Akatsuki . loggingLevel == AkatsukiCon... | 136 |
java-test-5178 | java | For what purpose does the code traverse the class hierarchy ? | to find correct bundleretainer | private static Class < ? > find Class ( Class Loader loader , Class < ? > clazz ) { final String name = clazz . get Name ( ) ; if ( name . starts With ( STRING ) || name . starts With ( STRING ) ) return null ; String generated Class Name = generate Retainer Class Name ( name ) ; try { if ( Akatsuki . logging Level == ... | private static Class < ? > findClass ( ClassLoader loader , Class < ? > clazz ) { final String name = clazz . getName ( ) ; if ( name . startsWith ( STRING ) || name . startsWith ( STRING ) ) return null ; String generatedClassName = generateRetainerClassName ( name ) ; try { if ( Akatsuki . loggingLevel == AkatsukiCon... | 136 |
java-test-5183 | java | What does the code get from an array of numbers ? | the interquartile range ( iqr ) | public static double iqr ( final double [ ] data ) { Arrays . sort ( data ) ; int q1 = ( int ) Math . round ( NUM * ( data . length + NUM ) ) - NUM ; int q3 = ( int ) Math . round ( NUM * ( data . length + NUM ) ) - NUM ; return data [ q3 ] - data [ q1 ] ; } | public static double iqr ( final double [ ] data ) { Arrays . sort ( data ) ; int q1 = ( int ) Math . round ( _NUM * ( data . length + _NUM ) ) - _NUM ; int q3 = ( int ) Math . round ( _NUM * ( data . length + _NUM ) ) - _NUM ; return data [ q3 ] - data [ q1 ] ; } | 77 |
java-test-5184 | java | Where does events redistribute based on the max # of notifications we can show ? | in the priority lists | static void redistribute Buckets ( Array List < Notification Info > high Priority Events , Array List < Notification Info > medium Priority Events , Array List < Notification Info > low Priority Events , int max Notifications ) { if ( high Priority Events . size ( ) > max Notifications ) { low Priority Events . add All... | static void redistributeBuckets ( ArrayList < NotificationInfo > highPriorityEvents , ArrayList < NotificationInfo > mediumPriorityEvents , ArrayList < NotificationInfo > lowPriorityEvents , int maxNotifications ) { if ( highPriorityEvents . size ( ) > maxNotifications ) { lowPriorityEvents . addAll ( _NUM , mediumPrio... | 264 |
java-test-5185 | java | What show at index ? | badge | public void show Badge At Index ( int item Index , int badge Text , @ Color Int int badge Color ) { if ( item Index < NUM || item Index > space Items . size ( ) ) { throw Array Index Out Of Bounds Exception ( item Index ) ; } else { Relative Layout badge View = badge List . get ( item Index ) ; if ( Build . VERSION . S... | public void showBadgeAtIndex ( int itemIndex , int badgeText , @ ColorInt int badgeColor ) { if ( itemIndex < _NUM || itemIndex > spaceItems . size ( ) ) { throwArrayIndexOutOfBoundsException ( itemIndex ) ; } else { RelativeLayout badgeView = badgeList . get ( itemIndex ) ; if ( Build . VERSION . SDK_INT >= Build . VE... | 185 |
java-test-5187 | java | What do we normalize then ? | the scores | private boolean convergence ( List < Page > pages ) { double ave Hub Delta = NUM ; double ave Auth Delta = NUM ; if ( pages == null ) { return BOOL ; } double [ ] curr Hub Vals = new double [ pages . size ( ) ] ; double [ ] curr Auth Vals = new double [ pages . size ( ) ] ; for ( int i = NUM ; i < pages . size ( ) ; i ... | private boolean convergence ( List < Page > pages ) { double aveHubDelta = _NUM ; double aveAuthDelta = _NUM ; if ( pages == null ) { return _BOOL ; } double [ ] currHubVals = new double [ pages . size ( ) ] ; double [ ] currAuthVals = new double [ pages . size ( ) ] ; for ( int i = _NUM ; i < pages . size ( ) ; i ++ )... | 287 |
java-test-5188 | java | What do we repeat then ? | k times | private boolean convergence ( List < Page > pages ) { double ave Hub Delta = NUM ; double ave Auth Delta = NUM ; if ( pages == null ) { return BOOL ; } double [ ] curr Hub Vals = new double [ pages . size ( ) ] ; double [ ] curr Auth Vals = new double [ pages . size ( ) ] ; for ( int i = NUM ; i < pages . size ( ) ; i ... | private boolean convergence ( List < Page > pages ) { double aveHubDelta = _NUM ; double aveAuthDelta = _NUM ; if ( pages == null ) { return _BOOL ; } double [ ] currHubVals = new double [ pages . size ( ) ] ; double [ ] currAuthVals = new double [ pages . size ( ) ] ; for ( int i = _NUM ; i < pages . size ( ) ; i ++ )... | 287 |
java-test-5190 | java | What does the code add ? | the instructions to the tree | void add Sdf ( Sdf Buffer buff ) { List < Sdf Macro > ops = buff . get Macro List ( ) ; for ( int i = NUM ; i < ops . size ( ) ; i ++ ) { nest Nodes ( top Node , ops . get ( i ) ) ; } tree . expand Path ( new Tree Path ( top Node ) ) ; tree . set Root Visible ( BOOL ) ; } | void addSdf ( SdfBuffer buff ) { List < SdfMacro > ops = buff . getMacroList ( ) ; for ( int i = _NUM ; i < ops . size ( ) ; i ++ ) { nestNodes ( topNode , ops . get ( i ) ) ; } tree . expandPath ( new TreePath ( topNode ) ) ; tree . setRootVisible ( _BOOL ) ; } | 82 |
java-test-5191 | java | What does the path represent ? | a child path of the specified path | public static boolean is Child Path ( String path , String parent Path ) { if ( parent Path == null || path == null ) { return BOOL ; } if ( ! path . starts With ( parent Path ) ) { return BOOL ; } if ( ! parent Path . ends With ( URI PATH CHAR ) && ! path . starts With ( URI PATH CHAR , parent Path . length ( ) ) ) { ... | public static boolean isChildPath ( String path , String parentPath ) { if ( parentPath == null || path == null ) { return _BOOL ; } if ( ! path . startsWith ( parentPath ) ) { return _BOOL ; } if ( ! parentPath . endsWith ( URI_PATH_CHAR ) && ! path . startsWith ( URI_PATH_CHAR , parentPath . length ( ) ) ) { return _... | 89 |
java-test-5192 | java | For what purpose does the raft configuration return ? | for method chaining | public Builder with Election Timeout ( Duration election Timeout ) { Assert . arg Not ( election Timeout . is Negative ( ) || election Timeout . is Zero ( ) , STRING ) ; Assert . arg Not ( election Timeout . to Millis ( ) <= heartbeat Interval . to Millis ( ) , STRING ) ; this . election Timeout = Assert . not Null ( e... | public Builder withElectionTimeout ( Duration electionTimeout ) { Assert . argNot ( electionTimeout . isNegative ( ) || electionTimeout . isZero ( ) , STRING ) ; Assert . argNot ( electionTimeout . toMillis ( ) <= heartbeatInterval . toMillis ( ) , STRING ) ; this . electionTimeout = Assert . notNull ( electionTimeout ... | 79 |
java-test-5193 | java | What does the code read for specified tag ? | the boolean value from the json object | public static boolean read Boolean ( final JSON Object json Object , final String key , final boolean required , final boolean not Null ) throws JSON Exception { if ( required ) { return json Object . get Boolean ( key ) ; } if ( not Null && json Object . is Null ( key ) ) { throw new JSON Exception ( String . format (... | public static boolean readBoolean ( final JSONObject jsonObject , final String key , final boolean required , final boolean notNull ) throws JSONException { if ( required ) { return jsonObject . getBoolean ( key ) ; } if ( notNull && jsonObject . isNull ( key ) ) { throw new JSONException ( String . format ( Locale . U... | 117 |
java-test-5194 | java | What does the code generate ? | the enumeration class body | private Enum Declaration generate Enum ( ) { final String value String = STRING ; Enum Declaration new Enum = new Enum Declaration ( Modifier Set . PUBLIC , null , get Enumeration Class Name ( ) , null , generate Enum Constant Declarations ( ) , null ) ; Field Declaration value Field = new Field Declaration ( Modifier ... | private EnumDeclaration generateEnum ( ) { final String valueString = STRING ; EnumDeclaration newEnum = new EnumDeclaration ( ModifierSet . PUBLIC , null , getEnumerationClassName ( ) , null , generateEnumConstantDeclarations ( ) , null ) ; FieldDeclaration valueField = new FieldDeclaration ( ModifierSet . addModifier... | 186 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.