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-8142 | java | How be it called ? | by webtopnaming ( which in turn is called by namingservice ) | public static Session ID Corrector create ( ) { Map < String , String > server To Site = new Hash Map < > ( ) ; try { for ( Object s : Webtop Naming . get All Server I Ds ( ) ) { String server Id = s . to String ( ) ; String site Id = Webtop Naming . get Site ID ( server Id ) ; if ( server Id . equals ( site Id ) ) { s... | public static SessionIDCorrector create ( ) { Map < String , String > serverToSite = new HashMap < > ( ) ; try { for ( Object s : WebtopNaming . getAllServerIDs ( ) ) { String serverId = s . toString ( ) ; String siteId = WebtopNaming . getSiteID ( serverId ) ; if ( serverId . equals ( siteId ) ) { siteId = null ; } de... | 160 |
java-test-8143 | java | Why can this code not listen to configuration changes directly ? | because of the order in which updates to configuration are propagated throughout the system | public static Session ID Corrector create ( ) { Map < String , String > server To Site = new Hash Map < > ( ) ; try { for ( Object s : Webtop Naming . get All Server I Ds ( ) ) { String server Id = s . to String ( ) ; String site Id = Webtop Naming . get Site ID ( server Id ) ; if ( server Id . equals ( site Id ) ) { s... | public static SessionIDCorrector create ( ) { Map < String , String > serverToSite = new HashMap < > ( ) ; try { for ( Object s : WebtopNaming . getAllServerIDs ( ) ) { String serverId = s . toString ( ) ; String siteId = WebtopNaming . getSiteID ( serverId ) ; if ( serverId . equals ( siteId ) ) { siteId = null ; } de... | 160 |
java-test-8144 | java | What are propagated throughout the system ? | updates to configuration | public static Session ID Corrector create ( ) { Map < String , String > server To Site = new Hash Map < > ( ) ; try { for ( Object s : Webtop Naming . get All Server I Ds ( ) ) { String server Id = s . to String ( ) ; String site Id = Webtop Naming . get Site ID ( server Id ) ; if ( server Id . equals ( site Id ) ) { s... | public static SessionIDCorrector create ( ) { Map < String , String > serverToSite = new HashMap < > ( ) ; try { for ( Object s : WebtopNaming . getAllServerIDs ( ) ) { String serverId = s . toString ( ) ; String siteId = WebtopNaming . getSiteID ( serverId ) ; if ( serverId . equals ( siteId ) ) { siteId = null ; } de... | 160 |
java-test-8145 | java | How is webtopnaming called in turn ? | by namingservice | public static Session ID Corrector create ( ) { Map < String , String > server To Site = new Hash Map < > ( ) ; try { for ( Object s : Webtop Naming . get All Server I Ds ( ) ) { String server Id = s . to String ( ) ; String site Id = Webtop Naming . get Site ID ( server Id ) ; if ( server Id . equals ( site Id ) ) { s... | public static SessionIDCorrector create ( ) { Map < String , String > serverToSite = new HashMap < > ( ) ; try { for ( Object s : WebtopNaming . getAllServerIDs ( ) ) { String serverId = s . toString ( ) ; String siteId = WebtopNaming . getSiteID ( serverId ) ; if ( serverId . equals ( siteId ) ) { siteId = null ; } de... | 160 |
java-test-8146 | java | Where are updates to configuration propagated ? | throughout the system | public static Session ID Corrector create ( ) { Map < String , String > server To Site = new Hash Map < > ( ) ; try { for ( Object s : Webtop Naming . get All Server I Ds ( ) ) { String server Id = s . to String ( ) ; String site Id = Webtop Naming . get Site ID ( server Id ) ; if ( server Id . equals ( site Id ) ) { s... | public static SessionIDCorrector create ( ) { Map < String , String > serverToSite = new HashMap < > ( ) ; try { for ( Object s : WebtopNaming . getAllServerIDs ( ) ) { String serverId = s . toString ( ) ; String siteId = WebtopNaming . getSiteID ( serverId ) ; if ( serverId . equals ( siteId ) ) { siteId = null ; } de... | 160 |
java-test-8148 | java | Where are certain values not permitted ? | in excel cells | protected HSSF Rich Text String escape Column Value ( final Object raw Value ) { if ( raw Value == null ) { return null ; } String return String = Object Utils . to String ( raw Value ) ; return String = String Escape Utils . escape Java ( String Utils . trim To Empty ( return String ) ) ; return String = String Utils ... | protected HSSFRichTextString escapeColumnValue ( final Object rawValue ) { if ( rawValue == null ) { return null ; } String returnString = ObjectUtils . toString ( rawValue ) ; returnString = StringEscapeUtils . escapeJava ( StringUtils . trimToEmpty ( returnString ) ) ; returnString = StringUtils . replace ( StringUti... | 146 |
java-test-8149 | java | What states that if d * - ob , a * - > b < - * c and a * - odo - * c , then d * - > b . <p> this is zhang ' s rule r3 ? | the double - triangle orientation rule | public void rule R 3 ( Graph graph ) { List < Node > nodes = graph . get Nodes ( ) ; for ( Node B : nodes ) { List < Node > into B Arrows = graph . get Nodes In To ( B , Endpoint . ARROW ) ; List < Node > into B Circles = graph . get Nodes In To ( B , Endpoint . CIRCLE ) ; for ( Node D : into B Circles ) { if ( into B ... | public void ruleR3 ( Graph graph ) { List < Node > nodes = graph . getNodes ( ) ; for ( Node B : nodes ) { List < Node > intoBArrows = graph . getNodesInTo ( B , Endpoint . ARROW ) ; List < Node > intoBCircles = graph . getNodesInTo ( B , Endpoint . CIRCLE ) ; for ( Node D : intoBCircles ) { if ( intoBArrows . size ( )... | 377 |
java-test-8150 | java | What does the double - triangle orientation rule state ? | that if d * - ob , a * - > b < - * c and a * - odo - * c , then d * - > b . < p > this is zhang ' s rule r3 | public void rule R 3 ( Graph graph ) { List < Node > nodes = graph . get Nodes ( ) ; for ( Node B : nodes ) { List < Node > into B Arrows = graph . get Nodes In To ( B , Endpoint . ARROW ) ; List < Node > into B Circles = graph . get Nodes In To ( B , Endpoint . CIRCLE ) ; for ( Node D : into B Circles ) { if ( into B ... | public void ruleR3 ( Graph graph ) { List < Node > nodes = graph . getNodes ( ) ; for ( Node B : nodes ) { List < Node > intoBArrows = graph . getNodesInTo ( B , Endpoint . ARROW ) ; List < Node > intoBCircles = graph . getNodesInTo ( B , Endpoint . CIRCLE ) ; for ( Node D : intoBCircles ) { if ( intoBArrows . size ( )... | 377 |
java-test-8151 | java | What will have the same order as in which they came in ? | the fonts in the result | public static Font [ ] filter Monospaced ( Font ... fonts ) { List < Font > result = new Array List < Font > ( fonts . length ) ; for ( Font font : fonts ) { if ( is Font Monospaced ( font ) ) { result . add ( font ) ; } } return result . to Array ( new Font [ result . size ( ) ] ) ; } | public static Font [ ] filterMonospaced ( Font ... fonts ) { List < Font > result = new ArrayList < Font > ( fonts . length ) ; for ( Font font : fonts ) { if ( isFontMonospaced ( font ) ) { result . add ( font ) ; } } return result . toArray ( new Font [ result . size ( ) ] ) ; } | 76 |
java-test-8152 | java | What will the fonts in the result have ? | the same order as in which they came in | public static Font [ ] filter Monospaced ( Font ... fonts ) { List < Font > result = new Array List < Font > ( fonts . length ) ; for ( Font font : fonts ) { if ( is Font Monospaced ( font ) ) { result . add ( font ) ; } } return result . to Array ( new Font [ result . size ( ) ] ) ; } | public static Font [ ] filterMonospaced ( Font ... fonts ) { List < Font > result = new ArrayList < Font > ( fonts . length ) ; for ( Font font : fonts ) { if ( isFontMonospaced ( font ) ) { result . add ( font ) ; } } return result . toArray ( new Font [ result . size ( ) ] ) ; } | 76 |
java-test-8153 | java | What has the thread or the distributed system been instructed already ? | to terminate | private void handle Exception ( String message , Exception exception ) { boolean unexpected = ! quitting ( ) ; if ( unexpected && ! ( exception instanceof Cancel Exception ) ) { logger . warn ( Localized Message . create ( Localized Strings . Cache Client Updater 0 1 2 , new Object [ ] { this , message , exception } ) ... | private void handleException ( String message , Exception exception ) { boolean unexpected = ! quitting ( ) ; if ( unexpected && ! ( exception instanceof CancelException ) ) { logger . warn ( LocalizedMessage . create ( LocalizedStrings . CacheClientUpdater_0__1__2 , new Object [ ] { this , message , exception } ) , ex... | 70 |
java-test-8154 | java | What do a warning describe ? | the failure < p > signals run thread to stop | private void handle Exception ( String message , Exception exception ) { boolean unexpected = ! quitting ( ) ; if ( unexpected && ! ( exception instanceof Cancel Exception ) ) { logger . warn ( Localized Message . create ( Localized Strings . Cache Client Updater 0 1 2 , new Object [ ] { this , message , exception } ) ... | private void handleException ( String message , Exception exception ) { boolean unexpected = ! quitting ( ) ; if ( unexpected && ! ( exception instanceof CancelException ) ) { logger . warn ( LocalizedMessage . create ( LocalizedStrings . CacheClientUpdater_0__1__2 , new Object [ ] { this , message , exception } ) , ex... | 70 |
java-test-8155 | java | What has been instructed to terminate already ? | the thread or the distributed system | private void handle Exception ( String message , Exception exception ) { boolean unexpected = ! quitting ( ) ; if ( unexpected && ! ( exception instanceof Cancel Exception ) ) { logger . warn ( Localized Message . create ( Localized Strings . Cache Client Updater 0 1 2 , new Object [ ] { this , message , exception } ) ... | private void handleException ( String message , Exception exception ) { boolean unexpected = ! quitting ( ) ; if ( unexpected && ! ( exception instanceof CancelException ) ) { logger . warn ( LocalizedMessage . create ( LocalizedStrings . CacheClientUpdater_0__1__2 , new Object [ ] { this , message , exception } ) , ex... | 70 |
java-test-8156 | java | Till when will this method attempt to reestablish the connection if the connection to the remote process fails continuously ? | until the command is successfully sent to the remote process | public String send ( String command , boolean retry ) throws Exception { Channel Result result = null ; while ( BOOL ) { try { if ( socket == null || wr == null ) { connect ( ) ; } wr . write ( command + STRING ) ; wr . flush ( ) ; String response = rd . read Line ( ) ; if ( response == null ) { throw new EOF Exception... | public String send ( String command , boolean retry ) throws Exception { ChannelResult result = null ; while ( _BOOL ) { try { if ( socket == null || wr == null ) { connect ( ) ; } wr . write ( command + STRING ) ; wr . flush ( ) ; String response = rd . readLine ( ) ; if ( response == null ) { throw new EOFException (... | 196 |
java-test-8157 | java | What will this method attempt if the connection to the remote process fails continuously until the command is successfully sent to the remote process ? | to reestablish the connection | public String send ( String command , boolean retry ) throws Exception { Channel Result result = null ; while ( BOOL ) { try { if ( socket == null || wr == null ) { connect ( ) ; } wr . write ( command + STRING ) ; wr . flush ( ) ; String response = rd . read Line ( ) ; if ( response == null ) { throw new EOF Exception... | public String send ( String command , boolean retry ) throws Exception { ChannelResult result = null ; while ( _BOOL ) { try { if ( socket == null || wr == null ) { connect ( ) ; } wr . write ( command + STRING ) ; wr . flush ( ) ; String response = rd . readLine ( ) ; if ( response == null ) { throw new EOFException (... | 196 |
java-test-8158 | java | For what purpose does the right scale return ? | to keep limits at the edge if necessary | protected double check Scale Against Limits ( ) { Point 2 D p1 = get Upper Left ( ) ; Point 2 D p2 = get Lower Right ( ) ; double x = p1 . get X ( ) ; double y = p1 . get Y ( ) ; if ( top Limit != Double . POSITIVE INFINITY ) { y = top Limit ; } if ( left Limit != Double . NEGATIVE INFINITY ) { x = left Limit ; } p1 . ... | protected double checkScaleAgainstLimits ( ) { Point2D p1 = getUpperLeft ( ) ; Point2D p2 = getLowerRight ( ) ; double x = p1 . getX ( ) ; double y = p1 . getY ( ) ; if ( topLimit != Double . POSITIVE_INFINITY ) { y = topLimit ; } if ( leftLimit != Double . NEGATIVE_INFINITY ) { x = leftLimit ; } p1 . setLocation ( x ,... | 171 |
java-test-8159 | java | Where does limits keep if necessary ? | at the edge | protected double check Scale Against Limits ( ) { Point 2 D p1 = get Upper Left ( ) ; Point 2 D p2 = get Lower Right ( ) ; double x = p1 . get X ( ) ; double y = p1 . get Y ( ) ; if ( top Limit != Double . POSITIVE INFINITY ) { y = top Limit ; } if ( left Limit != Double . NEGATIVE INFINITY ) { x = left Limit ; } p1 . ... | protected double checkScaleAgainstLimits ( ) { Point2D p1 = getUpperLeft ( ) ; Point2D p2 = getLowerRight ( ) ; double x = p1 . getX ( ) ; double y = p1 . getY ( ) ; if ( topLimit != Double . POSITIVE_INFINITY ) { y = topLimit ; } if ( leftLimit != Double . NEGATIVE_INFINITY ) { x = leftLimit ; } p1 . setLocation ( x ,... | 171 |
java-test-8160 | java | What keeps at the edge ? | limits | protected double check Scale Against Limits ( ) { Point 2 D p1 = get Upper Left ( ) ; Point 2 D p2 = get Lower Right ( ) ; double x = p1 . get X ( ) ; double y = p1 . get Y ( ) ; if ( top Limit != Double . POSITIVE INFINITY ) { y = top Limit ; } if ( left Limit != Double . NEGATIVE INFINITY ) { x = left Limit ; } p1 . ... | protected double checkScaleAgainstLimits ( ) { Point2D p1 = getUpperLeft ( ) ; Point2D p2 = getLowerRight ( ) ; double x = p1 . getX ( ) ; double y = p1 . getY ( ) ; if ( topLimit != Double . POSITIVE_INFINITY ) { y = topLimit ; } if ( leftLimit != Double . NEGATIVE_INFINITY ) { x = leftLimit ; } p1 . setLocation ( x ,... | 171 |
java-test-8164 | java | What do we have ? | the requested capacity | protected final void resize ( int required Size ) { int new Capacity = ( ( queue . length < NUM ) ? ( ( queue . length + NUM ) << NUM ) : ( ( queue . length > > NUM ) * NUM ) ) ; if ( new Capacity < NUM ) { throw new Out Of Memory Error ( ) ; } if ( required Size > new Capacity ) { new Capacity = required Size ; } queu... | protected final void resize ( int requiredSize ) { int newCapacity = ( ( queue . length < _NUM ) ? ( ( queue . length + _NUM ) << _NUM ) : ( ( queue . length > > _NUM ) * _NUM ) ) ; if ( newCapacity < _NUM ) { throw new OutOfMemoryError ( ) ; } if ( requiredSize > newCapacity ) { newCapacity = requiredSize ; } queue = ... | 97 |
java-test-8165 | java | What do we need ? | to resize to have the requested capacity | protected final void resize ( int required Size ) { int new Capacity = ( ( queue . length < NUM ) ? ( ( queue . length + NUM ) << NUM ) : ( ( queue . length > > NUM ) * NUM ) ) ; if ( new Capacity < NUM ) { throw new Out Of Memory Error ( ) ; } if ( required Size > new Capacity ) { new Capacity = required Size ; } queu... | protected final void resize ( int requiredSize ) { int newCapacity = ( ( queue . length < _NUM ) ? ( ( queue . length + _NUM ) << _NUM ) : ( ( queue . length > > _NUM ) * _NUM ) ) ; if ( newCapacity < _NUM ) { throw new OutOfMemoryError ( ) ; } if ( requiredSize > newCapacity ) { newCapacity = requiredSize ; } queue = ... | 97 |
java-test-8166 | java | For what purpose have we resize ? | to have the requested capacity | protected final void resize ( int required Size ) { int new Capacity = ( ( queue . length < NUM ) ? ( ( queue . length + NUM ) << NUM ) : ( ( queue . length > > NUM ) * NUM ) ) ; if ( new Capacity < NUM ) { throw new Out Of Memory Error ( ) ; } if ( required Size > new Capacity ) { new Capacity = required Size ; } queu... | protected final void resize ( int requiredSize ) { int newCapacity = ( ( queue . length < _NUM ) ? ( ( queue . length + _NUM ) << _NUM ) : ( ( queue . length > > _NUM ) * _NUM ) ) ; if ( newCapacity < _NUM ) { throw new OutOfMemoryError ( ) ; } if ( requiredSize > newCapacity ) { newCapacity = requiredSize ; } queue = ... | 97 |
java-test-8167 | java | How does a property parse ? | according to its expected type | private static Comparable < ? > parse Property Value ( String name , String value ) { if ( PROPERTY EVENT TYPE . equals ( name ) ) { return s Event Type Name To Value Map . get ( value ) ; } final int property Type = get Property Type ( name ) ; switch ( property Type ) { case PROPERTY TYPE BOOLEAN : return Boolean . v... | private static Comparable < ? > parsePropertyValue ( String name , String value ) { if ( PROPERTY_EVENT_TYPE . equals ( name ) ) { return sEventTypeNameToValueMap . get ( value ) ; } final int propertyType = getPropertyType ( name ) ; switch ( propertyType ) { case PROPERTY_TYPE_BOOLEAN : return Boolean . valueOf ( val... | 197 |
java-test-8168 | java | Till when did scanning resume ? | until the next regular expression is matched | public java cup . runtime . Symbol next token ( ) throws java . io . IO Exception { int zz Input ; int zz Action ; int zz Current Pos L ; int zz Marked Pos L ; int zz End Read L = zz End Read ; char [ ] zz Buffer L = zz Buffer ; char [ ] zz C Map L = ZZ CMAP ; int [ ] zz Trans L = ZZ TRANS ; int [ ] zz Row Map L = ZZ R... | public java_cup . runtime . Symbol next_token ( ) throws java . io . IOException { int zzInput ; int zzAction ; int zzCurrentPosL ; int zzMarkedPosL ; int zzEndReadL = zzEndRead ; char [ ] zzBufferL = zzBuffer ; char [ ] zzCMapL = ZZ_CMAP ; int [ ] zzTransL = ZZ_TRANS ; int [ ] zzRowMapL = ZZ_ROWMAP ; int [ ] zzAttrL =... | 2,186 |
java-test-8169 | java | What does the code form ? | a queue with all the methods responsible for a particular conversation | private Queue < Method Wrapper > form Conversation Queue ( Queue < Method Wrapper > queue , String method Name ) { Method Wrapper method Wrapper = method Name Map . get ( method Name ) ; queue . add ( method Wrapper ) ; if ( String Utils . is Empty ( method Name ) ) { return queue ; } else { return form Conversation Qu... | private Queue < MethodWrapper > formConversationQueue ( Queue < MethodWrapper > queue , String methodName ) { MethodWrapper methodWrapper = methodNameMap . get ( methodName ) ; queue . add ( methodWrapper ) ; if ( StringUtils . isEmpty ( methodName ) ) { return queue ; } else { return formConversationQueue ( queue , me... | 82 |
java-test-8170 | java | What is the code removes ? | the control tags for this equipment | protected List < Process Change > remove Equipment Control Tags ( final T abstract Equipment , final Configuration Element Report equipment Report ) { List < Process Change > changes = new Array List < > ( ) ; LOGGER . debug ( STRING ) ; Long alive Tag Id = abstract Equipment . get Alive Tag Id ( ) ; if ( alive Tag Id ... | protected List < ProcessChange > removeEquipmentControlTags ( final T abstractEquipment , final ConfigurationElementReport equipmentReport ) { List < ProcessChange > changes = new ArrayList < > ( ) ; LOGGER . debug ( STRING ) ; Long aliveTagId = abstractEquipment . getAliveTagId ( ) ; if ( aliveTagId != null ) { Config... | 383 |
java-test-8171 | java | What does this be ? | to prevent the situation of not being able to remove the equipment because of the control tags ( say if another equipment is also using them by mistake ) and not being able to remove the control tags because of the equipment . < p > notice that in case of failure , only part of the control tags could remain ; they are ... | protected List < Process Change > remove Equipment Control Tags ( final T abstract Equipment , final Configuration Element Report equipment Report ) { List < Process Change > changes = new Array List < > ( ) ; LOGGER . debug ( STRING ) ; Long alive Tag Id = abstract Equipment . get Alive Tag Id ( ) ; if ( alive Tag Id ... | protected List < ProcessChange > removeEquipmentControlTags ( final T abstractEquipment , final ConfigurationElementReport equipmentReport ) { List < ProcessChange > changes = new ArrayList < > ( ) ; LOGGER . debug ( STRING ) ; Long aliveTagId = abstractEquipment . getAliveTagId ( ) ; if ( aliveTagId != null ) { Config... | 383 |
java-test-8172 | java | Why do the control tags remove ? | because of the equipment | protected List < Process Change > remove Equipment Control Tags ( final T abstract Equipment , final Configuration Element Report equipment Report ) { List < Process Change > changes = new Array List < > ( ) ; LOGGER . debug ( STRING ) ; Long alive Tag Id = abstract Equipment . get Alive Tag Id ( ) ; if ( alive Tag Id ... | protected List < ProcessChange > removeEquipmentControlTags ( final T abstractEquipment , final ConfigurationElementReport equipmentReport ) { List < ProcessChange > changes = new ArrayList < > ( ) ; LOGGER . debug ( STRING ) ; Long aliveTagId = abstractEquipment . getAliveTagId ( ) ; if ( aliveTagId != null ) { Config... | 383 |
java-test-8173 | java | What does the code notice ? | that if this fails , the equipment object will still be removed : this is to prevent the situation of not being able to remove the equipment because of the control tags ( say if another equipment is also using them by mistake ) and not being able to remove the control tags because of the equipment . < p > notice that i... | protected List < Process Change > remove Equipment Control Tags ( final T abstract Equipment , final Configuration Element Report equipment Report ) { List < Process Change > changes = new Array List < > ( ) ; LOGGER . debug ( STRING ) ; Long alive Tag Id = abstract Equipment . get Alive Tag Id ( ) ; if ( alive Tag Id ... | protected List < ProcessChange > removeEquipmentControlTags ( final T abstractEquipment , final ConfigurationElementReport equipmentReport ) { List < ProcessChange > changes = new ArrayList < > ( ) ; LOGGER . debug ( STRING ) ; Long aliveTagId = abstractEquipment . getAliveTagId ( ) ; if ( aliveTagId != null ) { Config... | 383 |
java-test-8174 | java | Who is using them also by mistake ? | another equipment | protected List < Process Change > remove Equipment Control Tags ( final T abstract Equipment , final Configuration Element Report equipment Report ) { List < Process Change > changes = new Array List < > ( ) ; LOGGER . debug ( STRING ) ; Long alive Tag Id = abstract Equipment . get Alive Tag Id ( ) ; if ( alive Tag Id ... | protected List < ProcessChange > removeEquipmentControlTags ( final T abstractEquipment , final ConfigurationElementReport equipmentReport ) { List < ProcessChange > changes = new ArrayList < > ( ) ; LOGGER . debug ( STRING ) ; Long aliveTagId = abstractEquipment . getAliveTagId ( ) ; if ( aliveTagId != null ) { Config... | 383 |
java-test-8175 | java | What does the code create ? | a new exporter for allaccess files | public All Access Exporter ( String input , byte [ ] cp Data ) throws No Such Algorithm Exception , No Such Padding Exception , IO Exception { m Cipher = Cipher . get Instance ( STRING ) ; m Key Spec = new Secret Key Spec ( cp Data , STRING ) ; m Input = new File Input Stream ( input ) ; m Magic Number = new byte [ NUM... | public AllAccessExporter ( String input , byte [ ] cpData ) throws NoSuchAlgorithmException , NoSuchPaddingException , IOException { mCipher = Cipher . getInstance ( STRING ) ; mKeySpec = new SecretKeySpec ( cpData , STRING ) ; mInput = new FileInputStream ( input ) ; mMagicNumber = new byte [ _NUM ] ; if ( mInput . re... | 96 |
java-test-8179 | java | What will this process ? | all of the pages and the text that is in them | protected void process Pages ( List < PD Page > pages ) throws IO Exception { max Page = pages . size ( ) ; for ( final PD Page page : pages ) { current Page No ++ ; final PD Stream content Stream = page . get Contents ( ) ; if ( content Stream != null ) { final COS Stream contents = content Stream . get Stream ( ) ; p... | protected void processPages ( List < PDPage > pages ) throws IOException { maxPage = pages . size ( ) ; for ( final PDPage page : pages ) { currentPageNo ++ ; final PDStream contentStream = page . getContents ( ) ; if ( contentStream != null ) { final COSStream contents = contentStream . getStream ( ) ; processPage ( p... | 85 |
java-test-8180 | java | What does the code clear ? | the time of day in a calendar instance | public static void clear Time Of Day ( Calendar calendar ) { calendar . set ( Calendar . MILLISECOND , NUM ) ; calendar . set ( Calendar . SECOND , NUM ) ; calendar . set ( Calendar . MINUTE , NUM ) ; calendar . set ( Calendar . HOUR OF DAY , NUM ) ; } | public static void clearTimeOfDay ( Calendar calendar ) { calendar . set ( Calendar . MILLISECOND , _NUM ) ; calendar . set ( Calendar . SECOND , _NUM ) ; calendar . set ( Calendar . MINUTE , _NUM ) ; calendar . set ( Calendar . HOUR_OF_DAY , _NUM ) ; } | 59 |
java-test-8181 | java | How do source code for type generate ? | by its metadata | public static void pojos ( Pojo Descriptor pojo , String out Folder , String pkg , boolean constructor , boolean include Keys , Confirm Callable ask Overwrite ) throws IO Exception { File pkg Folder = new File ( out Folder , pkg . replace ( STRING , File . separator Char ) ) ; generate Code ( pojo , BOOL , pkg , pkg Fo... | public static void pojos ( PojoDescriptor pojo , String outFolder , String pkg , boolean constructor , boolean includeKeys , ConfirmCallable askOverwrite ) throws IOException { File pkgFolder = new File ( outFolder , pkg . replace ( STRING , File . separatorChar ) ) ; generateCode ( pojo , _BOOL , pkg , pkgFolder , con... | 97 |
java-test-8182 | java | What do i have ? | no idea why | public static void export To JPG ( Output Stream os , NLP Canvas Renderer renderer , NLP Instance instance , double scale Factor ) throws IO Exception { Buffered Image image = get Image ( renderer , instance , scale Factor ) ; Image IO . write ( image , STRING , os ) ; } | public static void exportToJPG ( OutputStream os , NLPCanvasRenderer renderer , NLPInstance instance , double scaleFactor ) throws IOException { BufferedImage image = getImage ( renderer , instance , scaleFactor ) ; ImageIO . write ( image , STRING , os ) ; } | 56 |
java-test-8184 | java | What does the code keep according to the rules defined by getoverlap and isconstrainchild ? | the given cell inside the bounds returned by getcellcontainmentarea for its parent | public void constrain Child ( Object cell ) { if ( cell != null ) { mx Geometry geo = model . get Geometry ( cell ) ; mx Rectangle area = ( is Constrain Child ( cell ) ) ? get Cell Containment Area ( cell ) : get Maximum Graph Bounds ( ) ; if ( geo != null && area != null ) { if ( ! geo . is Relative ( ) && ( geo . get... | public void constrainChild ( Object cell ) { if ( cell != null ) { mxGeometry geo = model . getGeometry ( cell ) ; mxRectangle area = ( isConstrainChild ( cell ) ) ? getCellContainmentArea ( cell ) : getMaximumGraphBounds ( ) ; if ( geo != null && area != null ) { if ( ! geo . isRelative ( ) && ( geo . getX ( ) < area ... | 347 |
java-test-8185 | java | What does this modify in - place ? | the cell ' s geometry | public void constrain Child ( Object cell ) { if ( cell != null ) { mx Geometry geo = model . get Geometry ( cell ) ; mx Rectangle area = ( is Constrain Child ( cell ) ) ? get Cell Containment Area ( cell ) : get Maximum Graph Bounds ( ) ; if ( geo != null && area != null ) { if ( ! geo . is Relative ( ) && ( geo . get... | public void constrainChild ( Object cell ) { if ( cell != null ) { mxGeometry geo = model . getGeometry ( cell ) ; mxRectangle area = ( isConstrainChild ( cell ) ) ? getCellContainmentArea ( cell ) : getMaximumGraphBounds ( ) ; if ( geo != null && area != null ) { if ( ! geo . isRelative ( ) && ( geo . getX ( ) < area ... | 347 |
java-test-8187 | java | Why does checks that the collection contains the annotation . not work using collection always ? | because it does not use aresame for comparison | public static boolean contains Same ( Collection < ? extends Annotation Mirror > c , Annotation Mirror anno ) { for ( Annotation Mirror an : c ) { if ( Annotation Utils . are Same ( an , anno ) ) { return BOOL ; } } return BOOL ; } | public static boolean containsSame ( Collection < ? extends AnnotationMirror > c , AnnotationMirror anno ) { for ( AnnotationMirror an : c ) { if ( AnnotationUtils . areSame ( an , anno ) ) { return _BOOL ; } } return _BOOL ; } | 52 |
java-test-8188 | java | What does it not use for comparison ? | aresame | public static boolean contains Same ( Collection < ? extends Annotation Mirror > c , Annotation Mirror anno ) { for ( Annotation Mirror an : c ) { if ( Annotation Utils . are Same ( an , anno ) ) { return BOOL ; } } return BOOL ; } | public static boolean containsSame ( Collection < ? extends AnnotationMirror > c , AnnotationMirror anno ) { for ( AnnotationMirror an : c ) { if ( AnnotationUtils . areSame ( an , anno ) ) { return _BOOL ; } } return _BOOL ; } | 52 |
java-test-8189 | java | How does checks that the collection contains the annotation . not work because it does not use aresame for comparison always ? | using collection | public static boolean contains Same ( Collection < ? extends Annotation Mirror > c , Annotation Mirror anno ) { for ( Annotation Mirror an : c ) { if ( Annotation Utils . are Same ( an , anno ) ) { return BOOL ; } } return BOOL ; } | public static boolean containsSame ( Collection < ? extends AnnotationMirror > c , AnnotationMirror anno ) { for ( AnnotationMirror an : c ) { if ( AnnotationUtils . areSame ( an , anno ) ) { return _BOOL ; } } return _BOOL ; } | 52 |
java-test-8194 | java | What parses here ? | some thing | public I Element Type perl Advance ( ) throws IO Exception { Char Sequence buffer = get Buffer ( ) ; int token Start = get Token End ( ) ; int buffer End = get Buffer End ( ) ; if ( buffer End == NUM || token Start >= buffer End ) { return super . perl Advance ( ) ; } else { int current State = yystate ( ) ; char curre... | public IElementType perlAdvance ( ) throws IOException { CharSequence buffer = getBuffer ( ) ; int tokenStart = getTokenEnd ( ) ; int bufferEnd = getBufferEnd ( ) ; if ( bufferEnd == _NUM || tokenStart >= bufferEnd ) { return super . perlAdvance ( ) ; } else { int currentState = yystate ( ) ; char currentChar = buffer ... | 596 |
java-test-8196 | java | What does it throw if the query is not proper ? | an queryinvalidexception | private static Set < String > compile Query ( final Cache cache , final String query ) throws Query Invalid Exception { Q Compiler compiler = new Q Compiler ( ) ; Set < String > regions In Query = null ; try { Compiled Value compiled Query = compiler . compile Query ( query ) ; Set < String > regions = new Hash Set < S... | private static Set < String > compileQuery ( final Cache cache , final String query ) throws QueryInvalidException { QCompiler compiler = new QCompiler ( ) ; Set < String > regionsInQuery = null ; try { CompiledValue compiledQuery = compiler . compileQuery ( query ) ; Set < String > regions = new HashSet < String > ( )... | 134 |
java-test-8197 | java | What has the query exceeded ? | the slow query limit | public synchronized boolean should Execute ( Key Select key Select ) { if ( slow Queries == null ) return BOOL ; String query Key = key Select . generate Key ( ) ; Long pending Query Invocation = pending Queries . get ( query Key ) ; if ( pending Query Invocation != null ) { if ( logger . is Debug Enabled ( ) ) { logge... | public synchronized boolean shouldExecute ( KeySelect keySelect ) { if ( slowQueries == null ) return _BOOL ; String queryKey = keySelect . generateKey ( ) ; Long pendingQueryInvocation = pendingQueries . get ( queryKey ) ; if ( pendingQueryInvocation != null ) { if ( logger . isDebugEnabled ( ) ) { logger . debug ( ST... | 194 |
java-test-8200 | java | What will this method do take ? | the ' object ' , which points to a cimargument , | private static CIM Argument modify Any CIM Object Paths ( Map < String , Object > key Map , Object object ) { if ( key Map == null || object == null ) { return null ; } CIM Argument modified Argument = null ; CIM Argument argument = ( CIM Argument ) object ; Object cim Path Reference Object = argument . get Value ( ) ;... | private static CIMArgument modifyAnyCIMObjectPaths ( Map < String , Object > keyMap , Object object ) { if ( keyMap == null || object == null ) { return null ; } CIMArgument modifiedArgument = null ; CIMArgument argument = ( CIMArgument ) object ; Object cimPathReferenceObject = argument . getValue ( ) ; if ( cimPathRe... | 208 |
java-test-8202 | java | How do the digest close ? | producing the final digest value | public int do Final ( byte [ ] out , int out Off ) { byte padding Byte = ( byte ) ( M . length - m Off ) ; for ( int i = m Off ; i < M . length ; i ++ ) { M [ i ] = padding Byte ; } process Check Sum ( M ) ; process Block ( M ) ; process Block ( C ) ; System . arraycopy ( X , x Off , out , out Off , NUM ) ; reset ( ) ;... | public int doFinal ( byte [ ] out , int outOff ) { byte paddingByte = ( byte ) ( M . length - mOff ) ; for ( int i = mOff ; i < M . length ; i ++ ) { M [ i ] = paddingByte ; } processCheckSum ( M ) ; processBlock ( M ) ; processBlock ( C ) ; System . arraycopy ( X , xOff , out , outOff , _NUM ) ; reset ( ) ; return DIG... | 103 |
java-test-8203 | java | What do the dofinal call leave ? | the digest reset | public int do Final ( byte [ ] out , int out Off ) { byte padding Byte = ( byte ) ( M . length - m Off ) ; for ( int i = m Off ; i < M . length ; i ++ ) { M [ i ] = padding Byte ; } process Check Sum ( M ) ; process Block ( M ) ; process Block ( C ) ; System . arraycopy ( X , x Off , out , out Off , NUM ) ; reset ( ) ;... | public int doFinal ( byte [ ] out , int outOff ) { byte paddingByte = ( byte ) ( M . length - mOff ) ; for ( int i = mOff ; i < M . length ; i ++ ) { M [ i ] = paddingByte ; } processCheckSum ( M ) ; processBlock ( M ) ; processBlock ( C ) ; System . arraycopy ( X , xOff , out , outOff , _NUM ) ; reset ( ) ; return DIG... | 103 |
java-test-8204 | java | What leaves the digest reset ? | the dofinal call | public int do Final ( byte [ ] out , int out Off ) { byte padding Byte = ( byte ) ( M . length - m Off ) ; for ( int i = m Off ; i < M . length ; i ++ ) { M [ i ] = padding Byte ; } process Check Sum ( M ) ; process Block ( M ) ; process Block ( C ) ; System . arraycopy ( X , x Off , out , out Off , NUM ) ; reset ( ) ;... | public int doFinal ( byte [ ] out , int outOff ) { byte paddingByte = ( byte ) ( M . length - mOff ) ; for ( int i = mOff ; i < M . length ; i ++ ) { M [ i ] = paddingByte ; } processCheckSum ( M ) ; processBlock ( M ) ; processBlock ( C ) ; System . arraycopy ( X , xOff , out , outOff , _NUM ) ; reset ( ) ; return DIG... | 103 |
java-test-8212 | java | Where did a list store ? | in that location | private < H , L > void store ( H hashed , L listed , Map < H , Linked Hash Set < L > > map ) { Linked Hash Set < L > list = map . get ( hashed ) ; if ( list == null ) { list = new Linked Hash Set < > ( NUM ) ; map . put ( hashed , list ) ; } if ( ! list . contains ( listed ) ) { list . add ( listed ) ; } } | private < H , L > void store ( H hashed , L listed , Map < H , LinkedHashSet < L > > map ) { LinkedHashSet < L > list = map . get ( hashed ) ; if ( list == null ) { list = new LinkedHashSet < > ( _NUM ) ; map . put ( hashed , list ) ; } if ( ! list . contains ( listed ) ) { list . add ( listed ) ; } } | 93 |
java-test-8213 | java | What will not replace the listed object unlike a standard map ? | any object already at the appropriate map location | private < H , L > void store ( H hashed , L listed , Map < H , Linked Hash Set < L > > map ) { Linked Hash Set < L > list = map . get ( hashed ) ; if ( list == null ) { list = new Linked Hash Set < > ( NUM ) ; map . put ( hashed , list ) ; } if ( ! list . contains ( listed ) ) { list . add ( listed ) ; } } | private < H , L > void store ( H hashed , L listed , Map < H , LinkedHashSet < L > > map ) { LinkedHashSet < L > list = map . get ( hashed ) ; if ( list == null ) { list = new LinkedHashSet < > ( _NUM ) ; map . put ( hashed , list ) ; } if ( ! list . contains ( listed ) ) { list . add ( listed ) ; } } | 93 |
java-test-8214 | java | What will any object already at the appropriate map location not replace unlike a standard map ? | the listed object | private < H , L > void store ( H hashed , L listed , Map < H , Linked Hash Set < L > > map ) { Linked Hash Set < L > list = map . get ( hashed ) ; if ( list == null ) { list = new Linked Hash Set < > ( NUM ) ; map . put ( hashed , list ) ; } if ( ! list . contains ( listed ) ) { list . add ( listed ) ; } } | private < H , L > void store ( H hashed , L listed , Map < H , LinkedHashSet < L > > map ) { LinkedHashSet < L > list = map . get ( hashed ) ; if ( list == null ) { list = new LinkedHashSet < > ( _NUM ) ; map . put ( hashed , list ) ; } if ( ! list . contains ( listed ) ) { list . add ( listed ) ; } } | 93 |
java-test-8215 | java | How does a new instance of networktopologydiscovery return if it exists ? | using the class delegate | protected static Network Topology Discovery new Network Topology Discovery ( ) { Network Topology Discovery instance = null ; Class Delegate delegate = database Class Delegate . get ( ) ; if ( delegate != null ) { instance = delegate . new Network Topology Discovery ( ) ; } return ( instance != null ? instance : new Ne... | protected static NetworkTopologyDiscovery newNetworkTopologyDiscovery ( ) { NetworkTopologyDiscovery instance = null ; ClassDelegate delegate = _databaseClassDelegate . get ( ) ; if ( delegate != null ) { instance = delegate . newNetworkTopologyDiscovery ( ) ; } return ( instance != null ? instance : new NetworkTopolog... | 68 |
java-test-8216 | java | What does the specified tenant have ? | the specified estimated cost | public long schedule ( int tenant Id , double cost Estimate ) throws Interrupted Exception { Tenant tenant = tenants . get ( tenant Id ) ; Disk Request request = current request . get ( ) ; if ( request . is Active ( ) ) { request . reenter ( ) ; if ( DEBUG ) print ( STRING , STRING , request . entrance count ) ; retur... | public long schedule ( int tenantId , double costEstimate ) throws InterruptedException { Tenant tenant = tenants . get ( tenantId ) ; DiskRequest request = current_request . get ( ) ; if ( request . isActive ( ) ) { request . reenter ( ) ; if ( DEBUG ) print ( STRING , STRING , request . entrance_count ) ; return _NUM... | 193 |
java-test-8217 | java | Till when will the thread wait ? | until the scheduler deems it ok to proceed | public long schedule ( int tenant Id , double cost Estimate ) throws Interrupted Exception { Tenant tenant = tenants . get ( tenant Id ) ; Disk Request request = current request . get ( ) ; if ( request . is Active ( ) ) { request . reenter ( ) ; if ( DEBUG ) print ( STRING , STRING , request . entrance count ) ; retur... | public long schedule ( int tenantId , double costEstimate ) throws InterruptedException { Tenant tenant = tenants . get ( tenantId ) ; DiskRequest request = current_request . get ( ) ; if ( request . isActive ( ) ) { request . reenter ( ) ; if ( DEBUG ) print ( STRING , STRING , request . entrance_count ) ; return _NUM... | 193 |
java-test-8218 | java | When can the thread be interrupted ? | while waiting | public long schedule ( int tenant Id , double cost Estimate ) throws Interrupted Exception { Tenant tenant = tenants . get ( tenant Id ) ; Disk Request request = current request . get ( ) ; if ( request . is Active ( ) ) { request . reenter ( ) ; if ( DEBUG ) print ( STRING , STRING , request . entrance count ) ; retur... | public long schedule ( int tenantId , double costEstimate ) throws InterruptedException { Tenant tenant = tenants . get ( tenantId ) ; DiskRequest request = current_request . get ( ) ; if ( request . isActive ( ) ) { request . reenter ( ) ; if ( DEBUG ) print ( STRING , STRING , request . entrance_count ) ; return _NUM... | 193 |
java-test-8219 | java | What do the scheduler deem ? | it ok to proceed | public long schedule ( int tenant Id , double cost Estimate ) throws Interrupted Exception { Tenant tenant = tenants . get ( tenant Id ) ; Disk Request request = current request . get ( ) ; if ( request . is Active ( ) ) { request . reenter ( ) ; if ( DEBUG ) print ( STRING , STRING , request . entrance count ) ; retur... | public long schedule ( int tenantId , double costEstimate ) throws InterruptedException { Tenant tenant = tenants . get ( tenantId ) ; DiskRequest request = current_request . get ( ) ; if ( request . isActive ( ) ) { request . reenter ( ) ; if ( DEBUG ) print ( STRING , STRING , request . entrance_count ) ; return _NUM... | 193 |
java-test-8220 | java | What does the code ensure ? | the popup gets hidden if this text - box is hidden and that the popup is shown if a previous show is pending ( from trying to autocomplete while it wasn ' t visible ) | protected void process Hierarchy Event ( Hierarchy Event evt ) { super . process Hierarchy Event ( evt ) ; if ( ( evt . get Change Flags ( ) & Hierarchy Event . SHOWING CHANGED ) == Hierarchy Event . SHOWING CHANGED ) { boolean showing = is Showing ( ) ; if ( ! showing && popup != null ) hide Popup ( ) ; else if ( show... | protected void processHierarchyEvent ( HierarchyEvent evt ) { super . processHierarchyEvent ( evt ) ; if ( ( evt . getChangeFlags ( ) & HierarchyEvent . SHOWING_CHANGED ) == HierarchyEvent . SHOWING_CHANGED ) { boolean showing = isShowing ( ) ; if ( ! showing && popup != null ) hidePopup ( ) ; else if ( showing && popu... | 87 |
java-test-8221 | java | What do a usernameattribute contain ? | a name of " nemo " | public static final String to Spaced Hex ( Byte Buffer bfr ) { bfr . mark ( ) ; final String Builder sb = new String Builder ( ) ; boolean first Time = BOOL ; while ( bfr . has Remaining ( ) ) { final byte b = bfr . get ( ) ; final int j = ( b ) & NUM ; String bt = Integer . to Hex String ( j ) ; if ( bt . length ( ) =... | public static final String toSpacedHex ( ByteBuffer bfr ) { bfr . mark ( ) ; final StringBuilder sb = new StringBuilder ( ) ; boolean firstTime = _BOOL ; while ( bfr . hasRemaining ( ) ) { final byte b = bfr . get ( ) ; final int j = ( b ) & _NUM ; String bt = Integer . toHexString ( j ) ; if ( bt . length ( ) == _NUM ... | 141 |
java-test-8222 | java | What is containing a name of " nemo " ? | a usernameattribute | public static final String to Spaced Hex ( Byte Buffer bfr ) { bfr . mark ( ) ; final String Builder sb = new String Builder ( ) ; boolean first Time = BOOL ; while ( bfr . has Remaining ( ) ) { final byte b = bfr . get ( ) ; final int j = ( b ) & NUM ; String bt = Integer . to Hex String ( j ) ; if ( bt . length ( ) =... | public static final String toSpacedHex ( ByteBuffer bfr ) { bfr . mark ( ) ; final StringBuilder sb = new StringBuilder ( ) ; boolean firstTime = _BOOL ; while ( bfr . hasRemaining ( ) ) { final byte b = bfr . get ( ) ; final int j = ( b ) & _NUM ; String bt = Integer . toHexString ( j ) ; if ( bt . length ( ) == _NUM ... | 141 |
java-test-8223 | java | How does a bytebuffer ' s contents convert to a spaced hex string ? | with each byte represented as a two hex characters with each pair of characters except for the last pair separated from the following pair by a space character such as " 01 06 6e 65 6d 6f " | public static final String to Spaced Hex ( Byte Buffer bfr ) { bfr . mark ( ) ; final String Builder sb = new String Builder ( ) ; boolean first Time = BOOL ; while ( bfr . has Remaining ( ) ) { final byte b = bfr . get ( ) ; final int j = ( b ) & NUM ; String bt = Integer . to Hex String ( j ) ; if ( bt . length ( ) =... | public static final String toSpacedHex ( ByteBuffer bfr ) { bfr . mark ( ) ; final StringBuilder sb = new StringBuilder ( ) ; boolean firstTime = _BOOL ; while ( bfr . hasRemaining ( ) ) { final byte b = bfr . get ( ) ; final int j = ( b ) & _NUM ; String bt = Integer . toHexString ( j ) ; if ( bt . length ( ) == _NUM ... | 141 |
java-test-8229 | java | What do an int format ? | into an existing array | public int format ( int val , byte [ ] buf , int off , int len ) { if ( val == Integer . MIN VALUE ) { if ( len > Byte Formatter . NUMBER BASE ) { return format ( STRING , buf , off , len ) ; } else { truncation Filler ( buf , off , len ) ; return off + len ; } } int pos = Math . abs ( val ) ; int ndig = NUM ; int dmax... | public int format ( int val , byte [ ] buf , int off , int len ) { if ( val == Integer . MIN_VALUE ) { if ( len > ByteFormatter . NUMBER_BASE ) { return format ( STRING , buf , off , len ) ; } else { truncationFiller ( buf , off , len ) ; return off + len ; } } int pos = Math . abs ( val ) ; int ndig = _NUM ; int dmax ... | 238 |
java-test-8230 | java | What does the code create from the list of persisted entities ? | a list of user namespace authorizations | private List < User Namespace Authorization > create User Namespace Authorizations From Entities ( List < User Namespace Authorization Entity > user Namespace Authorization Entities ) { List < User Namespace Authorization > user Namespace Authorizations = new Array List < > ( ) ; for ( User Namespace Authorization Enti... | private List < UserNamespaceAuthorization > createUserNamespaceAuthorizationsFromEntities ( List < UserNamespaceAuthorizationEntity > userNamespaceAuthorizationEntities ) { List < UserNamespaceAuthorization > userNamespaceAuthorizations = new ArrayList < > ( ) ; for ( UserNamespaceAuthorizationEntity userNamespaceAutho... | 89 |
java-test-8231 | java | What can a window be used ? | to filter a set of rules | public Zone Rules Builder add Window ( Zone Offset standard Offset , Local Date Time until , Time Definition until Definition ) { Objects . require Non Null ( standard Offset , STRING ) ; Objects . require Non Null ( until , STRING ) ; Objects . require Non Null ( until Definition , STRING ) ; TZ Window window = new TZ... | public ZoneRulesBuilder addWindow ( ZoneOffset standardOffset , LocalDateTime until , TimeDefinition untilDefinition ) { Objects . requireNonNull ( standardOffset , STRING ) ; Objects . requireNonNull ( until , STRING ) ; Objects . requireNonNull ( untilDefinition , STRING ) ; TZWindow window = new TZWindow ( standardO... | 128 |
java-test-8232 | java | When must each window be added start instant of the window is derived from the until instant of the previous window sequentially ? | as the | public Zone Rules Builder add Window ( Zone Offset standard Offset , Local Date Time until , Time Definition until Definition ) { Objects . require Non Null ( standard Offset , STRING ) ; Objects . require Non Null ( until , STRING ) ; Objects . require Non Null ( until Definition , STRING ) ; TZ Window window = new TZ... | public ZoneRulesBuilder addWindow ( ZoneOffset standardOffset , LocalDateTime until , TimeDefinition untilDefinition ) { Objects . requireNonNull ( standardOffset , STRING ) ; Objects . requireNonNull ( until , STRING ) ; Objects . requireNonNull ( untilDefinition , STRING ) ; TZWindow window = new TZWindow ( standardO... | 128 |
java-test-8233 | java | Why must each window be added sequentially as the ? | start instant of the window is derived from the until instant of the previous window | public Zone Rules Builder add Window ( Zone Offset standard Offset , Local Date Time until , Time Definition until Definition ) { Objects . require Non Null ( standard Offset , STRING ) ; Objects . require Non Null ( until , STRING ) ; Objects . require Non Null ( until Definition , STRING ) ; TZ Window window = new TZ... | public ZoneRulesBuilder addWindow ( ZoneOffset standardOffset , LocalDateTime until , TimeDefinition untilDefinition ) { Objects . requireNonNull ( standardOffset , STRING ) ; Objects . requireNonNull ( until , STRING ) ; Objects . requireNonNull ( untilDefinition , STRING ) ; TZWindow window = new TZWindow ( standardO... | 128 |
java-test-8234 | java | What is specified the zone ? | the standard offset | public Zone Rules Builder add Window ( Zone Offset standard Offset , Local Date Time until , Time Definition until Definition ) { Objects . require Non Null ( standard Offset , STRING ) ; Objects . require Non Null ( until , STRING ) ; Objects . require Non Null ( until Definition , STRING ) ; TZ Window window = new TZ... | public ZoneRulesBuilder addWindow ( ZoneOffset standardOffset , LocalDateTime until , TimeDefinition untilDefinition ) { Objects . requireNonNull ( standardOffset , STRING ) ; Objects . requireNonNull ( until , STRING ) ; Objects . requireNonNull ( untilDefinition , STRING ) ; TZWindow window = new TZWindow ( standardO... | 128 |
java-test-8235 | java | What does the code add ? | a window to the builder that can be used to filter a set of rules | public Zone Rules Builder add Window ( Zone Offset standard Offset , Local Date Time until , Time Definition until Definition ) { Objects . require Non Null ( standard Offset , STRING ) ; Objects . require Non Null ( until , STRING ) ; Objects . require Non Null ( until Definition , STRING ) ; TZ Window window = new TZ... | public ZoneRulesBuilder addWindow ( ZoneOffset standardOffset , LocalDateTime until , TimeDefinition untilDefinition ) { Objects . requireNonNull ( standardOffset , STRING ) ; Objects . requireNonNull ( until , STRING ) ; Objects . requireNonNull ( untilDefinition , STRING ) ; TZWindow window = new TZWindow ( standardO... | 128 |
java-test-8236 | java | How do the window will default if neither rules or fixed savings are added to the window if neither rules or fixed savings are added to the window ? | to no savings | public Zone Rules Builder add Window ( Zone Offset standard Offset , Local Date Time until , Time Definition until Definition ) { Objects . require Non Null ( standard Offset , STRING ) ; Objects . require Non Null ( until , STRING ) ; Objects . require Non Null ( until Definition , STRING ) ; TZ Window window = new TZ... | public ZoneRulesBuilder addWindow ( ZoneOffset standardOffset , LocalDateTime until , TimeDefinition untilDefinition ) { Objects . requireNonNull ( standardOffset , STRING ) ; Objects . requireNonNull ( until , STRING ) ; Objects . requireNonNull ( untilDefinition , STRING ) ; TZWindow window = new TZWindow ( standardO... | 128 |
java-test-8237 | java | What does the window limit ? | the effect of subsequent additions of transition rules or fixed savings | public Zone Rules Builder add Window ( Zone Offset standard Offset , Local Date Time until , Time Definition until Definition ) { Objects . require Non Null ( standard Offset , STRING ) ; Objects . require Non Null ( until , STRING ) ; Objects . require Non Null ( until Definition , STRING ) ; TZ Window window = new TZ... | public ZoneRulesBuilder addWindow ( ZoneOffset standardOffset , LocalDateTime until , TimeDefinition untilDefinition ) { Objects . requireNonNull ( standardOffset , STRING ) ; Objects . requireNonNull ( until , STRING ) ; Objects . requireNonNull ( untilDefinition , STRING ) ; TZWindow window = new TZWindow ( standardO... | 128 |
java-test-8238 | java | What does the code compute when given an iterator of segments ? | the intersection of all segments | public Hashtable < I Point , List < I Line Segment > > intersections ( Iterator < I Line Segment > it ) { Collection < I Line Segment > c = new Array List < I Line Segment > ( ) ; while ( it . has Next ( ) ) { c . add ( it . next ( ) ) ; } return intersections ( c . to Array ( new I Line Segment [ ] { } ) ) ; } | public Hashtable < IPoint , List < ILineSegment > > intersections ( Iterator < ILineSegment > it ) { Collection < ILineSegment > c = new ArrayList < ILineSegment > ( ) ; while ( it . hasNext ( ) ) { c . add ( it . next ( ) ) ; } return intersections ( c . toArray ( new ILineSegment [ ] { } ) ) ; } | 85 |
java-test-8239 | java | When does the code compute the intersection of all segments ? | when given an iterator of segments | public Hashtable < I Point , List < I Line Segment > > intersections ( Iterator < I Line Segment > it ) { Collection < I Line Segment > c = new Array List < I Line Segment > ( ) ; while ( it . has Next ( ) ) { c . add ( it . next ( ) ) ; } return intersections ( c . to Array ( new I Line Segment [ ] { } ) ) ; } | public Hashtable < IPoint , List < ILineSegment > > intersections ( Iterator < ILineSegment > it ) { Collection < ILineSegment > c = new ArrayList < ILineSegment > ( ) ; while ( it . hasNext ( ) ) { c . add ( it . next ( ) ) ; } return intersections ( c . toArray ( new ILineSegment [ ] { } ) ) ; } | 85 |
java-test-8240 | java | What does the code initialize to the preference values ? | the values in the table | private void init Values ( ) { I Preference Store store = do Get Preference Store ( ) ; final String stored Items = store . get String ( Checker Preferences . PREF CHECKER CUSTOM CLASSES ) ; if ( ! stored Items . equals ( STRING ) ) { custom Checkers . set Items ( stored Items . split ( STRING ) ) ; } } | private void initValues ( ) { IPreferenceStore store = doGetPreferenceStore ( ) ; final String storedItems = store . getString ( CheckerPreferences . PREF_CHECKER_CUSTOM_CLASSES ) ; if ( ! storedItems . equals ( STRING ) ) { customCheckers . setItems ( storedItems . split ( STRING ) ) ; } } | 67 |
java-test-8241 | java | What do an array of map elements copy ? | to an array of structuredcontent nodes , also linking the parent | private List as Structured Content Array ( List array ) { if ( array == null ) { return null ; } List children ; if ( array instanceof java . util . Vector ) { children = new java . util . Vector ( ) ; } else { children = new Array List ( ) ; } for ( Iterator elements = array . iterator ( ) ; elements . has Next ( ) ; ... | private List _asStructuredContentArray ( List array ) { if ( array == null ) { return null ; } List children ; if ( array instanceof java . util . Vector ) { children = new java . util . Vector ( ) ; } else { children = new ArrayList ( ) ; } for ( Iterator elements = array . iterator ( ) ; elements . hasNext ( ) ; ) { ... | 141 |
java-test-8242 | java | What copys to an array of structuredcontent nodes , also linking the parent ? | an array of map elements | private List as Structured Content Array ( List array ) { if ( array == null ) { return null ; } List children ; if ( array instanceof java . util . Vector ) { children = new java . util . Vector ( ) ; } else { children = new Array List ( ) ; } for ( Iterator elements = array . iterator ( ) ; elements . has Next ( ) ; ... | private List _asStructuredContentArray ( List array ) { if ( array == null ) { return null ; } List children ; if ( array instanceof java . util . Vector ) { children = new java . util . Vector ( ) ; } else { children = new ArrayList ( ) ; } for ( Iterator elements = array . iterator ( ) ; elements . hasNext ( ) ; ) { ... | 141 |
java-test-8243 | java | What is used to implement sleeping for the given time even if interrupted this method ? | by both sleep ( ) methods | private static void sleep Impl ( long millis , Closure closure ) { long start = System . current Time Millis ( ) ; long rest = millis ; long current ; while ( rest > NUM ) { try { Thread . sleep ( rest ) ; rest = NUM ; } catch ( Interrupted Exception e ) { if ( closure != null ) { if ( Default Type Transformation . cas... | private static void sleepImpl ( long millis , Closure closure ) { long start = System . currentTimeMillis ( ) ; long rest = millis ; long current ; while ( rest > _NUM ) { try { Thread . sleep ( rest ) ; rest = _NUM ; } catch ( InterruptedException e ) { if ( closure != null ) { if ( DefaultTypeTransformation . castToB... | 111 |
java-test-8244 | java | When did sleeping implement even if interrupted ? | for the given time | private static void sleep Impl ( long millis , Closure closure ) { long start = System . current Time Millis ( ) ; long rest = millis ; long current ; while ( rest > NUM ) { try { Thread . sleep ( rest ) ; rest = NUM ; } catch ( Interrupted Exception e ) { if ( closure != null ) { if ( Default Type Transformation . cas... | private static void sleepImpl ( long millis , Closure closure ) { long start = System . currentTimeMillis ( ) ; long rest = millis ; long current ; while ( rest > _NUM ) { try { Thread . sleep ( rest ) ; rest = _NUM ; } catch ( InterruptedException e ) { if ( closure != null ) { if ( DefaultTypeTransformation . castToB... | 111 |
java-test-8245 | java | What is by both sleep ( ) methods used this method ? | to implement sleeping for the given time even if interrupted | private static void sleep Impl ( long millis , Closure closure ) { long start = System . current Time Millis ( ) ; long rest = millis ; long current ; while ( rest > NUM ) { try { Thread . sleep ( rest ) ; rest = NUM ; } catch ( Interrupted Exception e ) { if ( closure != null ) { if ( Default Type Transformation . cas... | private static void sleepImpl ( long millis , Closure closure ) { long start = System . currentTimeMillis ( ) ; long rest = millis ; long current ; while ( rest > _NUM ) { try { Thread . sleep ( rest ) ; rest = _NUM ; } catch ( InterruptedException e ) { if ( closure != null ) { if ( DefaultTypeTransformation . castToB... | 111 |
java-test-8246 | java | How does the input numeric text convert to the internationalized form ? | using the zero character | String convert Number To I 18 N ( String numeric Text ) { if ( zero Digit == STRING ) { return numeric Text ; } int diff = zero Digit - STRING ; char [ ] array = numeric Text . to Char Array ( ) ; for ( int i = NUM ; i < array . length ; i ++ ) { array [ i ] = ( char ) ( array [ i ] + diff ) ; } return new String ( arr... | String convertNumberToI18N ( String numericText ) { if ( zeroDigit == STRING ) { return numericText ; } int diff = zeroDigit - STRING ; char [ ] array = numericText . toCharArray ( ) ; for ( int i = _NUM ; i < array . length ; i ++ ) { array [ i ] = ( char ) ( array [ i ] + diff ) ; } return new String ( array ) ; } | 91 |
java-test-8247 | java | For what purpose can we are not view blocks independently ? | for reshape | public static Array List < Indexed Matrix Value > reshape ( Indexed Matrix Value in , long rows 1 , long cols 1 , int brlen 1 , int bclen 1 , Array List < Indexed Matrix Value > out , long rows 2 , long cols 2 , int brlen 2 , int bclen 2 , boolean rowwise ) throws DML Runtime Exception { Matrix Indexes ix In = in . get... | public static ArrayList < IndexedMatrixValue > reshape ( IndexedMatrixValue in , long rows1 , long cols1 , int brlen1 , int bclen1 , ArrayList < IndexedMatrixValue > out , long rows2 , long cols2 , int brlen2 , int bclen2 , boolean rowwise ) throws DMLRuntimeException { MatrixIndexes ixIn = in . getIndexes ( ) ; Matrix... | 368 |
java-test-8251 | java | What does the code allocate for the query ? | a memory manager | private Memory Manager new Memory Manager ( ) { final Direct Buffer Pool pool = Direct Buffer Pool . INSTANCE ; long max Memory Bytes Per Query = Query Hints . DEFAULT ANALYTIC MAX MEMORY PER QUERY ; if ( max Memory Bytes Per Query < NUM ) { max Memory Bytes Per Query = NUM ; } final boolean blocking ; final int nsecto... | private MemoryManager newMemoryManager ( ) { final DirectBufferPool pool = DirectBufferPool . INSTANCE ; long maxMemoryBytesPerQuery = QueryHints . DEFAULT_ANALYTIC_MAX_MEMORY_PER_QUERY ; if ( maxMemoryBytesPerQuery < _NUM ) { maxMemoryBytesPerQuery = _NUM ; } final boolean blocking ; final int nsectors ; if ( maxMemor... | 146 |
java-test-8252 | java | What has the code adds to the map if the map is at least 5x5 hexes big ? | an river | public static void add River ( I Board board , Hash Map < I Hex , Point > reverse Hex ) { int min Elevation = Integer . MAX VALUE ; Hash Set < I Hex > river Hexes = new Hash Set < I Hex > ( ) ; I Hex field ; Point p = null ; int direction = NUM ; int next Left = NUM ; int next Right = NUM ; int width = board . get Widt... | public static void addRiver ( IBoard board , HashMap < IHex , Point > reverseHex ) { int minElevation = Integer . MAX_VALUE ; HashSet < IHex > riverHexes = new HashSet < IHex > ( ) ; IHex field ; Point p = null ; int direction = _NUM ; int nextLeft = _NUM ; int nextRight = _NUM ; int width = board . getWidth ( ) ; int ... | 753 |
java-test-8255 | java | What does the code add a menuitem ? | to top menu container | public void add Top Item ( Menu Item item ) { top Items . add ( item ) ; items . put ( item . id , item ) ; container Top . add View ( item ) ; configure Top Animations ( ) ; if ( menu Showed ) item . show ( ) ; } | public void addTopItem ( MenuItem item ) { topItems . add ( item ) ; items . put ( item . id , item ) ; containerTop . addView ( item ) ; configureTopAnimations ( ) ; if ( menuShowed ) item . show ( ) ; } | 57 |
java-test-8263 | java | What does the code build ? | the supplier for druid data request headers | protected Supplier < Map < String , String > > build Druid Web Service Header Supplier ( ) { Supplier < Map < String , String > > supplier = null ; String custom Supplier Class String = SYSTEM CONFIG . get String Property ( DRUID HEADER SUPPLIER CLASS , null ) ; if ( custom Supplier Class String != null && custom Suppl... | protected Supplier < Map < String , String > > buildDruidWebServiceHeaderSupplier ( ) { Supplier < Map < String , String > > supplier = null ; String customSupplierClassString = SYSTEM_CONFIG . getStringProperty ( DRUID_HEADER_SUPPLIER_CLASS , null ) ; if ( customSupplierClassString != null && customSupplierClassString... | 161 |
java-test-8270 | java | What does this pin have ? | exit restrictions on some kayer | public boolean has trace exit restrictions ( ) { for ( int index = first layer ( ) ; index <= last layer ( ) ; ++ index ) { Collection < Brd Trace Exit Restriction > curr exit restrictions = get trace exit restrictions ( index ) ; if ( curr exit restrictions . size ( ) > NUM ) return BOOL ; } return BOOL ; } | public boolean has_trace_exit_restrictions ( ) { for ( int index = first_layer ( ) ; index <= last_layer ( ) ; ++ index ) { Collection < BrdTraceExitRestriction > curr_exit_restrictions = get_trace_exit_restrictions ( index ) ; if ( curr_exit_restrictions . size ( ) > _NUM ) return _BOOL ; } return _BOOL ; } | 69 |
java-test-8271 | java | What has exit restrictions on some kayer ? | this pin | public boolean has trace exit restrictions ( ) { for ( int index = first layer ( ) ; index <= last layer ( ) ; ++ index ) { Collection < Brd Trace Exit Restriction > curr exit restrictions = get trace exit restrictions ( index ) ; if ( curr exit restrictions . size ( ) > NUM ) return BOOL ; } return BOOL ; } | public boolean has_trace_exit_restrictions ( ) { for ( int index = first_layer ( ) ; index <= last_layer ( ) ; ++ index ) { Collection < BrdTraceExitRestriction > curr_exit_restrictions = get_trace_exit_restrictions ( index ) ; if ( curr_exit_restrictions . size ( ) > _NUM ) return _BOOL ; } return _BOOL ; } | 69 |
java-test-8276 | java | What did characters write ? | the resulting , possibly escaped , characters to out | protected static void write Quoted String Value ( Byte Array Output Stream out , byte [ ] buf ) { int len = buf . length ; byte ch ; for ( int i = NUM ; i < len ; i ++ ) { ch = buf [ i ] ; if ( need Escape ( ( char ) ch ) ) { out . write ( STRING ) ; } out . write ( ch ) ; } } | protected static void writeQuotedStringValue ( ByteArrayOutputStream out , byte [ ] buf ) { int len = buf . length ; byte ch ; for ( int i = _NUM ; i < len ; i ++ ) { ch = buf [ i ] ; if ( needEscape ( ( char ) ch ) ) { out . write ( STRING ) ; } out . write ( ch ) ; } } | 81 |
java-test-8277 | java | What does a byte [ ] contain ? | characters that must be quoted and write the resulting , possibly escaped , characters to out | protected static void write Quoted String Value ( Byte Array Output Stream out , byte [ ] buf ) { int len = buf . length ; byte ch ; for ( int i = NUM ; i < len ; i ++ ) { ch = buf [ i ] ; if ( need Escape ( ( char ) ch ) ) { out . write ( STRING ) ; } out . write ( ch ) ; } } | protected static void writeQuotedStringValue ( ByteArrayOutputStream out , byte [ ] buf ) { int len = buf . length ; byte ch ; for ( int i = _NUM ; i < len ; i ++ ) { ch = buf [ i ] ; if ( needEscape ( ( char ) ch ) ) { out . write ( STRING ) ; } out . write ( ch ) ; } } | 81 |
java-test-8278 | java | What is matching some information ? | decoders | public List < Decoder File > matching Decoder List ( String mfg , String family , String decoder Mfg ID , String decoder Version ID , String decoder Product ID , String model , String developer ID ) { List < Decoder File > l = new Array List < Decoder File > ( ) ; for ( int i = NUM ; i < num Decoders ( ) ; i ++ ) { if ... | public List < DecoderFile > matchingDecoderList ( String mfg , String family , String decoderMfgID , String decoderVersionID , String decoderProductID , String model , String developerID ) { List < DecoderFile > l = new ArrayList < DecoderFile > ( ) ; for ( int i = _NUM ; i < numDecoders ( ) ; i ++ ) { if ( checkEntry ... | 123 |
java-test-8279 | java | What does the code get ? | a list of decoders matching some information | public List < Decoder File > matching Decoder List ( String mfg , String family , String decoder Mfg ID , String decoder Version ID , String decoder Product ID , String model , String developer ID ) { List < Decoder File > l = new Array List < Decoder File > ( ) ; for ( int i = NUM ; i < num Decoders ( ) ; i ++ ) { if ... | public List < DecoderFile > matchingDecoderList ( String mfg , String family , String decoderMfgID , String decoderVersionID , String decoderProductID , String model , String developerID ) { List < DecoderFile > l = new ArrayList < DecoderFile > ( ) ; for ( int i = _NUM ; i < numDecoders ( ) ; i ++ ) { if ( checkEntry ... | 123 |
java-test-8280 | java | How do a properties file store ? | as a resource configuration | public synchronized void store Resource Config ( String cluster Name , Resource Type resource Type , Tungsten Properties resource Props ) throws Configuration Exception { if ( get Cluster Home ( ) == null ) { throw new Configuration Exception ( STRING + get Module Properties File Name ( Configuration Constants . TR PRO... | public synchronized void storeResourceConfig ( String clusterName , ResourceType resourceType , TungstenProperties resourceProps ) throws ConfigurationException { if ( getClusterHome ( ) == null ) { throw new ConfigurationException ( STRING + getModulePropertiesFileName ( ConfigurationConstants . TR_PROPERTIES , getClu... | 220 |
java-test-8281 | java | What does the code find ? | all object elements that match the filter criteria | public static < T > List < T > find All ( final Collection < T > collection , final Filter < T > filter ) { final List < T > matches = new Array List < T > ( collection . size ( ) ) ; for ( final T element : collection ) { if ( filter . accept ( element ) ) { matches . add ( element ) ; } } return matches ; } | public static < T > List < T > findAll ( final Collection < T > collection , final Filter < T > filter ) { final List < T > matches = new ArrayList < T > ( collection . size ( ) ) ; for ( final T element : collection ) { if ( filter . accept ( element ) ) { matches . add ( element ) ; } } return matches ; } | 80 |
java-test-8282 | java | When does an image draw in nonblocking mode in nonblocking mode ? | at x , y | public boolean draw Image ( Image img , int x , int y , Color bg , Image Observer observer ) { if ( img == null ) { return BOOL ; } if ( is Hi DPI Image ( img ) ) { final int img W = img . get Width ( null ) ; final int img H = img . get Height ( null ) ; return draw Hi DPI Image ( img , x , y , x + img W , y + img H ,... | public boolean drawImage ( Image img , int x , int y , Color bg , ImageObserver observer ) { if ( img == null ) { return _BOOL ; } if ( isHiDPIImage ( img ) ) { final int imgW = img . getWidth ( null ) ; final int imgH = img . getHeight ( null ) ; return drawHiDPIImage ( img , x , y , x + imgW , y + imgH , _NUM , _NUM ... | 190 |
java-test-8284 | java | For what purpose does the calendaralerts table search ? | for alarms that should have fired | private static final void reschedule Missed Alarms ( Content Resolver cr , Context context , Alarm Manager Interface manager ) { long now = System . current Time Millis ( ) ; long ancient = now - Date Utils . DAY IN MILLIS ; String [ ] projection = new String [ ] { Calendar Contract . Calendar Alerts . ALARM TIME } ; i... | private static final void rescheduleMissedAlarms ( ContentResolver cr , Context context , AlarmManagerInterface manager ) { long now = System . currentTimeMillis ( ) ; long ancient = now - DateUtils . DAY_IN_MILLIS ; String [ ] projection = new String [ ] { CalendarContract . CalendarAlerts . ALARM_TIME } ; if ( Build ... | 298 |
java-test-8285 | java | For what purpose can this method be called at boot time ? | to restore alarms that may have been lost due to a phone reboot | private static final void reschedule Missed Alarms ( Content Resolver cr , Context context , Alarm Manager Interface manager ) { long now = System . current Time Millis ( ) ; long ancient = now - Date Utils . DAY IN MILLIS ; String [ ] projection = new String [ ] { Calendar Contract . Calendar Alerts . ALARM TIME } ; i... | private static final void rescheduleMissedAlarms ( ContentResolver cr , Context context , AlarmManagerInterface manager ) { long now = System . currentTimeMillis ( ) ; long ancient = now - DateUtils . DAY_IN_MILLIS ; String [ ] projection = new String [ ] { CalendarContract . CalendarAlerts . ALARM_TIME } ; if ( Build ... | 298 |
java-test-8286 | java | Why may alarms have been lost ? | due to a phone reboot | private static final void reschedule Missed Alarms ( Content Resolver cr , Context context , Alarm Manager Interface manager ) { long now = System . current Time Millis ( ) ; long ancient = now - Date Utils . DAY IN MILLIS ; String [ ] projection = new String [ ] { Calendar Contract . Calendar Alerts . ALARM TIME } ; i... | private static final void rescheduleMissedAlarms ( ContentResolver cr , Context context , AlarmManagerInterface manager ) { long now = System . currentTimeMillis ( ) ; long ancient = now - DateUtils . DAY_IN_MILLIS ; String [ ] projection = new String [ ] { CalendarContract . CalendarAlerts . ALARM_TIME } ; if ( Build ... | 298 |
java-test-8288 | java | What does the code allow ? | this closeable to be used within the closure | public static < T , U extends Closeable > T with Closeable ( U self , @ Closure Params ( value = First Param . class ) Closure < T > action ) throws IO Exception { try { T result = action . call ( self ) ; Closeable temp = self ; self = null ; temp . close ( ) ; return result ; } finally { Default Groovy Methods Suppor... | public static < T , U extends Closeable > T withCloseable ( U self , @ ClosureParams ( value = FirstParam . class ) Closure < T > action ) throws IOException { try { T result = action . call ( self ) ; Closeable temp = self ; self = null ; temp . close ( ) ; return result ; } finally { DefaultGroovyMethodsSupport . clo... | 84 |
java-test-8289 | java | What be used within the closure ? | this closeable | public static < T , U extends Closeable > T with Closeable ( U self , @ Closure Params ( value = First Param . class ) Closure < T > action ) throws IO Exception { try { T result = action . call ( self ) ; Closeable temp = self ; self = null ; temp . close ( ) ; return result ; } finally { Default Groovy Methods Suppor... | public static < T , U extends Closeable > T withCloseable ( U self , @ ClosureParams ( value = FirstParam . class ) Closure < T > action ) throws IOException { try { T result = action . call ( self ) ; Closeable temp = self ; self = null ; temp . close ( ) ; return result ; } finally { DefaultGroovyMethodsSupport . clo... | 84 |
java-test-8290 | java | What is the code determine given a configuration ? | what the general encryption key is | private byte [ ] calculate General Encryption Key ( byte [ ] user Password , byte [ ] first Doc Id Value , int key Bit Length , int revision , byte [ ] o Value , int p Value , boolean encrypt Metadata ) throws General Security Exception { final byte [ ] padded Password = pad Password ( user Password ) ; Message Digest ... | private byte [ ] calculateGeneralEncryptionKey ( byte [ ] userPassword , byte [ ] firstDocIdValue , int keyBitLength , int revision , byte [ ] oValue , int pValue , boolean encryptMetadata ) throws GeneralSecurityException { final byte [ ] paddedPassword = padPassword ( userPassword ) ; MessageDigest md5 = createMD5Dig... | 349 |
java-test-8291 | java | What is what ? | the general encryption key | private byte [ ] calculate General Encryption Key ( byte [ ] user Password , byte [ ] first Doc Id Value , int key Bit Length , int revision , byte [ ] o Value , int p Value , boolean encrypt Metadata ) throws General Security Exception { final byte [ ] padded Password = pad Password ( user Password ) ; Message Digest ... | private byte [ ] calculateGeneralEncryptionKey ( byte [ ] userPassword , byte [ ] firstDocIdValue , int keyBitLength , int revision , byte [ ] oValue , int pValue , boolean encryptMetadata ) throws GeneralSecurityException { final byte [ ] paddedPassword = padPassword ( userPassword ) ; MessageDigest md5 = createMD5Dig... | 349 |
java-test-8292 | java | What is interpreting the contents of a tag incorrectly ? | a media player | public static byte [ ] unsynchronize ( byte [ ] aby Source ) { Byte Array Input Stream input = new Byte Array Input Stream ( aby Source ) ; Byte Array Output Stream output = new Byte Array Output Stream ( aby Source . length ) ; int count = NUM ; while ( input . available ( ) > NUM ) { int first Byte = input . read ( )... | public static byte [ ] unsynchronize ( byte [ ] abySource ) { ByteArrayInputStream input = new ByteArrayInputStream ( abySource ) ; ByteArrayOutputStream output = new ByteArrayOutputStream ( abySource . length ) ; int count = _NUM ; while ( input . available ( ) > _NUM ) { int firstByte = input . read ( ) ; count ++ ; ... | 298 |
java-test-8293 | java | For what purpose has the decision been made already ? | to unsynchronize the byte array | public static byte [ ] unsynchronize ( byte [ ] aby Source ) { Byte Array Input Stream input = new Byte Array Input Stream ( aby Source ) ; Byte Array Output Stream output = new Byte Array Output Stream ( aby Source . length ) ; int count = NUM ; while ( input . available ( ) > NUM ) { int first Byte = input . read ( )... | public static byte [ ] unsynchronize ( byte [ ] abySource ) { ByteArrayInputStream input = new ByteArrayInputStream ( abySource ) ; ByteArrayOutputStream output = new ByteArrayOutputStream ( abySource . length ) ; int count = _NUM ; while ( input . available ( ) > _NUM ) { int firstByte = input . read ( ) ; count ++ ; ... | 298 |
java-test-8294 | java | What do they share ? | a synset or a concept | public boolean similar To ( Object o ) { if ( o == null ) { return BOOL ; } if ( ! ( o instanceof Semantic Concept ) ) { return BOOL ; } Semantic Concept other Concept = ( Semantic Concept ) o ; Hash Set < Integer > synset intersection = new Hash Set < Integer > ( this . synsets ) ; synset intersection . retain All ( o... | public boolean similarTo ( Object o ) { if ( o == null ) { return _BOOL ; } if ( ! ( o instanceof SemanticConcept ) ) { return _BOOL ; } SemanticConcept otherConcept = ( SemanticConcept ) o ; HashSet < Integer > synset_intersection = new HashSet < Integer > ( this . synsets ) ; synset_intersection . retainAll ( otherCo... | 137 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.