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-11120 | java | What does the compound size have ? | format : max ( & lt ; atomic size & gt ; ; & lt ; atomic size2 & gt ; ) | min ( & lt ; atomic size1 & gt ; ; & lt ; atomic size2 & gt | private Size parse Old Bounded Size ( String token , boolean set Max ) { int semicolon Index = token . index Of ( STRING ) ; String size Token 1 = token . substring ( NUM , semicolon Index ) ; String size Token 2 = token . substring ( semicolon Index + NUM , token . length ( ) - NUM ) ; Size size 1 = parse Atomic Size ... | private Size parseOldBoundedSize ( String token , boolean setMax ) { int semicolonIndex = token . indexOf ( STRING ) ; String sizeToken1 = token . substring ( _NUM , semicolonIndex ) ; String sizeToken2 = token . substring ( semicolonIndex + _NUM , token . length ( ) - _NUM ) ; Size size1 = parseAtomicSize ( sizeToken1... | 194 |
java-test-11121 | java | What has format : max ( & lt ; atomic size & gt ; ; & lt ; atomic size2 & gt ; ) | min ( & lt ; atomic size1 & gt ; ; & lt ; atomic size2 & gt ? | the compound size | private Size parse Old Bounded Size ( String token , boolean set Max ) { int semicolon Index = token . index Of ( STRING ) ; String size Token 1 = token . substring ( NUM , semicolon Index ) ; String size Token 2 = token . substring ( semicolon Index + NUM , token . length ( ) - NUM ) ; Size size 1 = parse Atomic Size ... | private Size parseOldBoundedSize ( String token , boolean setMax ) { int semicolonIndex = token . indexOf ( STRING ) ; String sizeToken1 = token . substring ( _NUM , semicolonIndex ) ; String sizeToken2 = token . substring ( semicolonIndex + _NUM , token . length ( ) - _NUM ) ; Size size1 = parseAtomicSize ( sizeToken1... | 194 |
java-test-11122 | java | What do this service have ? | its supported * properties for keys defined | private boolean has Key Attributes ( ) { Boolean b = has Key Attributes ; if ( b == null ) { synchronized ( this ) { String s ; s = get Attribute ( STRING ) ; if ( s != null ) { supported Formats = s . split ( STRING ) ; } s = get Attribute ( STRING ) ; if ( s != null ) { String [ ] class Names = s . split ( STRING ) ;... | private boolean hasKeyAttributes ( ) { Boolean b = hasKeyAttributes ; if ( b == null ) { synchronized ( this ) { String s ; s = getAttribute ( STRING ) ; if ( s != null ) { supportedFormats = s . split ( STRING ) ; } s = getAttribute ( STRING ) ; if ( s != null ) { String [ ] classNames = s . split ( STRING ) ; List < ... | 205 |
java-test-11123 | java | What does the code check ? | the requirements of a table cell that spans a single column | void check Single Column Cell ( int axis , int col , View v ) { Size Requirements req = column Requirements [ col ] ; req . minimum = Math . max ( ( int ) v . get Minimum Span ( axis ) , req . minimum ) ; req . preferred = Math . max ( ( int ) v . get Preferred Span ( axis ) , req . preferred ) ; } | void checkSingleColumnCell ( int axis , int col , View v ) { SizeRequirements req = columnRequirements [ col ] ; req . minimum = Math . max ( ( int ) v . getMinimumSpan ( axis ) , req . minimum ) ; req . preferred = Math . max ( ( int ) v . getPreferredSpan ( axis ) , req . preferred ) ; } | 77 |
java-test-11124 | java | What does the code add to this url ' s query string ? | the pre - encoded query parameter | Builder add Encoded Query Parameter ( String encoded Name , String encoded Value ) { if ( encoded Name == null ) throw new Illegal Argument Exception ( STRING ) ; if ( encoded Query Names And Values == null ) encoded Query Names And Values = new Array List < > ( ) ; encoded Query Names And Values . add ( canonicalize (... | Builder addEncodedQueryParameter ( String encodedName , String encodedValue ) { if ( encodedName == null ) throw new IllegalArgumentException ( STRING ) ; if ( encodedQueryNamesAndValues == null ) encodedQueryNamesAndValues = new ArrayList < > ( ) ; encodedQueryNamesAndValues . add ( canonicalize ( encodedName , QUERY_... | 114 |
java-test-11125 | java | What does the code create ? | a new store for configuration values | public In Memory Message Exchange Store ( final Network Config config , Token Provider token Provider ) { if ( config == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( token Provider == null ) { throw new Null Pointer Exception ( STRING ) ; } this . token Provider = token Provider ; this . config = confi... | public InMemoryMessageExchangeStore ( final NetworkConfig config , TokenProvider tokenProvider ) { if ( config == null ) { throw new NullPointerException ( STRING ) ; } if ( tokenProvider == null ) { throw new NullPointerException ( STRING ) ; } this . tokenProvider = tokenProvider ; this . config = config ; } | 68 |
java-test-11126 | java | What does function read ? | the fdselect | protected void Build FD Array Used ( int Font ) { int [ ] FD Select = fonts [ Font ] . FD Select ; for ( Integer glyphs In List 1 : glyphs In List ) { int glyph = ( int ) glyphs In List 1 ; int FD = FD Select [ glyph ] ; FD Array Used . add ( FD ) ; } } | protected void BuildFDArrayUsed ( int Font ) { int [ ] FDSelect = fonts [ Font ] . FDSelect ; for ( Integer glyphsInList1 : glyphsInList ) { int glyph = ( int ) glyphsInList1 ; int FD = FDSelect [ glyph ] ; FDArrayUsed . add ( FD ) ; } } | 69 |
java-test-11127 | java | What does function build according to the glyphs used ? | the fdarrayused map | protected void Build FD Array Used ( int Font ) { int [ ] FD Select = fonts [ Font ] . FD Select ; for ( Integer glyphs In List 1 : glyphs In List ) { int glyph = ( int ) glyphs In List 1 ; int FD = FD Select [ glyph ] ; FD Array Used . add ( FD ) ; } } | protected void BuildFDArrayUsed ( int Font ) { int [ ] FDSelect = fonts [ Font ] . FDSelect ; for ( Integer glyphsInList1 : glyphsInList ) { int glyph = ( int ) glyphsInList1 ; int FD = FDSelect [ glyph ] ; FDArrayUsed . add ( FD ) ; } } | 69 |
java-test-11129 | java | What do it replace in ' str ' with ' newchar ' ? | any occurrances of ' oldchars ' | public static String replace Chars ( String str , String oldchars , char newchar ) { int pos = index Of Chars ( str , oldchars ) ; if ( pos == - NUM ) { return str ; } String Builder buf = new String Builder ( str ) ; do { buf . set Char At ( pos , newchar ) ; pos = index Of Chars ( str , oldchars , pos + NUM ) ; } whi... | public static String replaceChars ( String str , String oldchars , char newchar ) { int pos = indexOfChars ( str , oldchars ) ; if ( pos == - _NUM ) { return str ; } StringBuilder buf = new StringBuilder ( str ) ; do { buf . setCharAt ( pos , newchar ) ; pos = indexOfChars ( str , oldchars , pos + _NUM ) ; } while ( po... | 97 |
java-test-11130 | java | What does it accept ? | any number of old chars | public static String replace Chars ( String str , String oldchars , char newchar ) { int pos = index Of Chars ( str , oldchars ) ; if ( pos == - NUM ) { return str ; } String Builder buf = new String Builder ( str ) ; do { buf . set Char At ( pos , newchar ) ; pos = index Of Chars ( str , oldchars , pos + NUM ) ; } whi... | public static String replaceChars ( String str , String oldchars , char newchar ) { int pos = indexOfChars ( str , oldchars ) ; if ( pos == - _NUM ) { return str ; } StringBuilder buf = new StringBuilder ( str ) ; do { buf . setCharAt ( pos , newchar ) ; pos = indexOfChars ( str , oldchars , pos + _NUM ) ; } while ( po... | 97 |
java-test-11134 | java | Where do misc size calculate ? | in settings - > storage | @ Override public byte [ ] list Directory ( String path ) throws Remote Exception { Process . set Thread Priority ( Process . THREAD PRIORITY BACKGROUND ) ; final File directory = new File ( path ) ; final File [ ] files = directory . list Files ( ) ; final Parcel out = Parcel . obtain ( ) ; if ( files == null ) { out ... | @ Override public byte [ ] listDirectory ( String path ) throws RemoteException { Process . setThreadPriority ( Process . THREAD_PRIORITY_BACKGROUND ) ; final File directory = new File ( path ) ; final File [ ] files = directory . listFiles ( ) ; final Parcel out = Parcel . obtain ( ) ; if ( files == null ) { out . wri... | 195 |
java-test-11135 | java | What is calculating in settings - > storage ? | misc size | @ Override public byte [ ] list Directory ( String path ) throws Remote Exception { Process . set Thread Priority ( Process . THREAD PRIORITY BACKGROUND ) ; final File directory = new File ( path ) ; final File [ ] files = directory . list Files ( ) ; final Parcel out = Parcel . obtain ( ) ; if ( files == null ) { out ... | @ Override public byte [ ] listDirectory ( String path ) throws RemoteException { Process . setThreadPriority ( Process . THREAD_PRIORITY_BACKGROUND ) ; final File directory = new File ( path ) ; final File [ ] files = directory . listFiles ( ) ; final Parcel out = Parcel . obtain ( ) ; if ( files == null ) { out . wri... | 195 |
java-test-11136 | java | When do the content verify to be identical ? | afterward | private void assert Zip And Unzip Of Directory Matches Original ( File source Dir ) throws IO Exception { File [ ] source Files = source Dir . list Files ( ) ; Arrays . sort ( source Files ) ; File zip File = create Zip File Handle ( ) ; Zip Files . zip Directory ( source Dir , zip File ) ; File output Dir = Files . cr... | private void assertZipAndUnzipOfDirectoryMatchesOriginal ( File sourceDir ) throws IOException { File [ ] sourceFiles = sourceDir . listFiles ( ) ; Arrays . sort ( sourceFiles ) ; File zipFile = createZipFileHandle ( ) ; ZipFiles . zipDirectory ( sourceDir , zipFile ) ; File outputDir = Files . createTempDir ( ) ; ZipF... | 189 |
java-test-11138 | java | What do a sound contain ? | an array of all values | public static Sound create Sound ( String chars ) { String [ ] sounds = chars . split ( STRING ) ; char [ ] sound Symbols = new char [ sounds . length ] ; int i = NUM ; for ( String sound : sounds ) { sound Symbols [ i ] = sound . char At ( NUM ) ; i ++ ; } return new Sound ( sound Symbols ) ; } | public static Sound createSound ( String chars ) { String [ ] sounds = chars . split ( STRING ) ; char [ ] soundSymbols = new char [ sounds . length ] ; int i = _NUM ; for ( String sound : sounds ) { soundSymbols [ i ] = sound . charAt ( _NUM ) ; i ++ ; } return new Sound ( soundSymbols ) ; } | 76 |
java-test-11139 | java | How do single bitmap draw ? | with the giving centerx , centery and radius | private void draw Bitmap With Stroke ( Canvas canvas , Bitmap bitmap , int center X , int center Y , float radius , Paint draw Paint ) { draw Paint . set Style ( Paint . Style . FILL ) ; float stroke Radius = radius + m Radius Stroke Width ; draw Paint . set Xfermode ( new Porter Duff Xfermode ( Porter Duff . Mode . CL... | private void drawBitmapWithStroke ( Canvas canvas , Bitmap bitmap , int centerX , int centerY , float radius , Paint drawPaint ) { drawPaint . setStyle ( Paint . Style . FILL ) ; float strokeRadius = radius + mRadiusStrokeWidth ; drawPaint . setXfermode ( new PorterDuffXfermode ( PorterDuff . Mode . CLEAR ) ) ; canvas ... | 295 |
java-test-11140 | java | What did the code set to the episode ' s if it is more recent ? | the podcast ' s publication date | private void update Podcast Publication Date And Last Media Url ( Episode episode , Podcast podcast ) { Date podcast Publication Date = podcast . get Publication Date ( ) ; boolean episode Pub Date Is More Recent = episode . get Publication Date ( ) != null && ( podcast Publication Date == null || podcast Publication D... | private void updatePodcastPublicationDateAndLastMediaUrl ( Episode episode , Podcast podcast ) { Date podcastPublicationDate = podcast . getPublicationDate ( ) ; boolean episodePubDateIsMoreRecent = episode . getPublicationDate ( ) != null && ( podcastPublicationDate == null || podcastPublicationDate . before ( episode... | 116 |
java-test-11141 | java | What does this change actually ? | the items on the board | private Array List < Brd Tracep > split with end line ( int p line no , Pla Line Int p new end line ) { Array List < Brd Tracep > risul = new Array List < Brd Tracep > ( NUM ) ; if ( ! is on the board ( ) ) return risul ; if ( ! split inside drill pad allowed ( p line no , p new end line ) ) return risul ; Array List <... | private ArrayList < BrdTracep > split_with_end_line ( int p_line_no , PlaLineInt p_new_end_line ) { ArrayList < BrdTracep > risul = new ArrayList < BrdTracep > ( _NUM ) ; if ( ! is_on_the_board ( ) ) return risul ; if ( ! split_inside_drill_pad_allowed ( p_line_no , p_new_end_line ) ) return risul ; ArrayList < Polylin... | 251 |
java-test-11142 | java | How does this trace at the line split with number p_line_no ? | by inserting p_endline as concluding line of the first split piece | private Array List < Brd Tracep > split with end line ( int p line no , Pla Line Int p new end line ) { Array List < Brd Tracep > risul = new Array List < Brd Tracep > ( NUM ) ; if ( ! is on the board ( ) ) return risul ; if ( ! split inside drill pad allowed ( p line no , p new end line ) ) return risul ; Array List <... | private ArrayList < BrdTracep > split_with_end_line ( int p_line_no , PlaLineInt p_new_end_line ) { ArrayList < BrdTracep > risul = new ArrayList < BrdTracep > ( _NUM ) ; if ( ! is_on_the_board ( ) ) return risul ; if ( ! split_inside_drill_pad_allowed ( p_line_no , p_new_end_line ) ) return risul ; ArrayList < Polylin... | 251 |
java-test-11146 | java | What does a phrase convey ? | the exactness of the time | private static String time Approx ( int hour , int min ) { int mm ; mm = min % NUM ; if ( ( mm == NUM ) || ( mm == NUM ) ) { return STRING ; } else if ( mm == NUM ) { return STRING ; } else if ( mm == NUM ) { return STRING ; } else { return STRING ; } } | private static String timeApprox ( int hour , int min ) { int mm ; mm = min % _NUM ; if ( ( mm == _NUM ) || ( mm == _NUM ) ) { return STRING ; } else if ( mm == _NUM ) { return STRING ; } else if ( mm == _NUM ) { return STRING ; } else { return STRING ; } } | 72 |
java-test-11150 | java | What does the code get ? | the set of matches active for the given read | public static void compute ( double min Score , double top Percent , double max Expected , float min Percent Identity , I Read Block read Block , String classification Name , Bit Set active Matches For Classification ) { active Matches For Classification . clear ( ) ; for ( int i = NUM ; i < read Block . get Number Of ... | public static void compute ( double minScore , double topPercent , double maxExpected , float minPercentIdentity , IReadBlock readBlock , String classificationName , BitSet activeMatchesForClassification ) { activeMatchesForClassification . clear ( ) ; for ( int i = _NUM ; i < readBlock . getNumberOfAvailableMatchBlock... | 277 |
java-test-11151 | java | What does this data need ? | to be validated and processed | Sparse Array ( Class < L > linear Array Type , int [ ] row Indices , int [ ] col Indices , L real Values , L imag Values , int num Rows , int num Cols ) { validate User Supplied Parameters ( linear Array Type , row Indices , col Indices , real Values , imag Values ) ; base Component Type = linear Array Type . get Compo... | SparseArray ( Class < L > linearArrayType , int [ ] rowIndices , int [ ] colIndices , L realValues , L imagValues , int numRows , int numCols ) { validateUserSuppliedParameters ( linearArrayType , rowIndices , colIndices , realValues , imagValues ) ; _baseComponentType = linearArrayType . getComponentType ( ) ; _output... | 372 |
java-test-11153 | java | What does the code create ? | a new instance of maplequestrequirement | protected Maple Quest Requirement ( Maple Quest quest , Read Bin data ) throws IO Exception { this . quest = quest ; this . day By Day = data . read Byte ( ) > NUM ; this . normal Auto Start = data . read Byte ( ) > NUM ; this . lvmin = data . read Short ( ) ; this . lvmax = data . read Short ( ) ; this . mbmin = data ... | protected MapleQuestRequirement ( MapleQuest quest , ReadBin data ) throws IOException { this . quest = quest ; this . dayByDay = data . readByte ( ) > _NUM ; this . normalAutoStart = data . readByte ( ) > _NUM ; this . lvmin = data . readShort ( ) ; this . lvmax = data . readShort ( ) ; this . mbmin = data . readShort... | 615 |
java-test-11154 | java | What will this not accept ? | { field . reference } expressions | public Boolean consume Boolean Constant Attribute ( String name ) throws Unable To Complete Exception { String value = consume Raw Attribute ( name ) ; if ( value == null ) { return null ; } if ( value . equals ( STRING ) || value . equals ( STRING ) ) { return Boolean . value Of ( value ) ; } logger . die ( this , STR... | public Boolean consumeBooleanConstantAttribute ( String name ) throws UnableToCompleteException { String value = consumeRawAttribute ( name ) ; if ( value == null ) { return null ; } if ( value . equals ( STRING ) || value . equals ( STRING ) ) { return Boolean . valueOf ( value ) ; } logger . die ( this , STRING , nam... | 79 |
java-test-11155 | java | When do the path take how long ? | at every possible departure minute | private void compute Statistics ( Profile Request req , int access Time , int egress Time ) { int count = NUM ; int sum = NUM ; this . min = Integer . MAX VALUE ; this . max = NUM ; for ( int start = req . from Time ; start < req . to Time ; start += NUM ) { int time At Origin Stop = start + access Time + Raptor Worker... | private void computeStatistics ( ProfileRequest req , int accessTime , int egressTime ) { int count = _NUM ; int sum = _NUM ; this . min = Integer . MAX_VALUE ; this . max = _NUM ; for ( int start = req . fromTime ; start < req . toTime ; start += _NUM ) { int timeAtOriginStop = start + accessTime + RaptorWorker . BOAR... | 257 |
java-test-11156 | java | What do i prefer ? | pragmatism over theory | private void compute Statistics ( Profile Request req , int access Time , int egress Time ) { int count = NUM ; int sum = NUM ; this . min = Integer . MAX VALUE ; this . max = NUM ; for ( int start = req . from Time ; start < req . to Time ; start += NUM ) { int time At Origin Stop = start + access Time + Raptor Worker... | private void computeStatistics ( ProfileRequest req , int accessTime , int egressTime ) { int count = _NUM ; int sum = _NUM ; this . min = Integer . MAX_VALUE ; this . max = _NUM ; for ( int start = req . fromTime ; start < req . toTime ; start += _NUM ) { int timeAtOriginStop = start + accessTime + RaptorWorker . BOAR... | 257 |
java-test-11157 | java | How do this do ? | an elegant theoretical way | private void compute Statistics ( Profile Request req , int access Time , int egress Time ) { int count = NUM ; int sum = NUM ; this . min = Integer . MAX VALUE ; this . max = NUM ; for ( int start = req . from Time ; start < req . to Time ; start += NUM ) { int time At Origin Stop = start + access Time + Raptor Worker... | private void computeStatistics ( ProfileRequest req , int accessTime , int egressTime ) { int count = _NUM ; int sum = _NUM ; this . min = Integer . MAX_VALUE ; this . max = _NUM ; for ( int start = req . fromTime ; start < req . toTime ; start += _NUM ) { int timeAtOriginStop = start + accessTime + RaptorWorker . BOAR... | 257 |
java-test-11158 | java | What do we compute just ? | how long the path takes at every possible departure minute | private void compute Statistics ( Profile Request req , int access Time , int egress Time ) { int count = NUM ; int sum = NUM ; this . min = Integer . MAX VALUE ; this . max = NUM ; for ( int start = req . from Time ; start < req . to Time ; start += NUM ) { int time At Origin Stop = start + access Time + Raptor Worker... | private void computeStatistics ( ProfileRequest req , int accessTime , int egressTime ) { int count = _NUM ; int sum = _NUM ; this . min = Integer . MAX_VALUE ; this . max = _NUM ; for ( int start = req . fromTime ; start < req . toTime ; start += _NUM ) { int timeAtOriginStop = start + accessTime + RaptorWorker . BOAR... | 257 |
java-test-11160 | java | What does the code create ? | the cache instance for the test | private Cache create Cache ( ) throws Cache Exception { final Properties props = new Properties ( ) ; props . set Property ( LOCATORS , STRING ) ; props . set Property ( MCAST PORT , STRING ) ; return Cache Factory . create ( Distributed System . connect ( props ) ) ; } | private Cache createCache ( ) throws CacheException { final Properties props = new Properties ( ) ; props . setProperty ( LOCATORS , STRING ) ; props . setProperty ( MCAST_PORT , STRING ) ; return CacheFactory . create ( DistributedSystem . connect ( props ) ) ; } | 56 |
java-test-11161 | java | What does the code update ? | the platform - specific settings | public void update Platform ( final String a Os , final String a Arch , final Byte Order a Byte Order ) { os = a Os . to Lower Case ( ) ; arch = a Arch . to Lower Case ( ) ; String [ ] chmod = { STRING , STRING , null } ; if ( arch . equals ( STRING ) || arch . equals ( STRING ) || arch . equals ( STRING ) || arch . eq... | public void updatePlatform ( final String aOs , final String aArch , final ByteOrder aByteOrder ) { _os = aOs . toLowerCase ( ) ; _arch = aArch . toLowerCase ( ) ; String [ ] chmod = { STRING , STRING , null } ; if ( _arch . equals ( STRING ) || _arch . equals ( STRING ) || _arch . equals ( STRING ) || _arch . equals (... | 226 |
java-test-11164 | java | What does the polyline need for the text to be drawn with the specified orientation ? | to be reverted | protected boolean need To Reverse ( int x1 , int y1 , int x2 , int y2 ) { boolean reverse = BOOL ; switch ( get Orientation ( ) & ~ FOLLOW POLY ) { case FORWARD : break ; case BACKWARD : reverse = BOOL ; break ; case LEFT TO RIGHT : reverse = x1 > x2 ; break ; case RIGHT TO LEFT : reverse = x1 < x2 ; break ; case TOP T... | protected boolean needToReverse ( int x1 , int y1 , int x2 , int y2 ) { boolean reverse = _BOOL ; switch ( getOrientation ( ) & ~ FOLLOW_POLY ) { case FORWARD : break ; case BACKWARD : reverse = _BOOL ; break ; case LEFT_TO_RIGHT : reverse = x1 > x2 ; break ; case RIGHT_TO_LEFT : reverse = x1 < x2 ; break ; case TOP_TO... | 123 |
java-test-11165 | java | For what purpose does the polyline need to be reverted ? | for the text to be drawn with the specified orientation | protected boolean need To Reverse ( int x1 , int y1 , int x2 , int y2 ) { boolean reverse = BOOL ; switch ( get Orientation ( ) & ~ FOLLOW POLY ) { case FORWARD : break ; case BACKWARD : reverse = BOOL ; break ; case LEFT TO RIGHT : reverse = x1 > x2 ; break ; case RIGHT TO LEFT : reverse = x1 < x2 ; break ; case TOP T... | protected boolean needToReverse ( int x1 , int y1 , int x2 , int y2 ) { boolean reverse = _BOOL ; switch ( getOrientation ( ) & ~ FOLLOW_POLY ) { case FORWARD : break ; case BACKWARD : reverse = _BOOL ; break ; case LEFT_TO_RIGHT : reverse = x1 > x2 ; break ; case RIGHT_TO_LEFT : reverse = x1 < x2 ; break ; case TOP_TO... | 123 |
java-test-11166 | java | How be the text drawn ? | with the specified orientation | protected boolean need To Reverse ( int x1 , int y1 , int x2 , int y2 ) { boolean reverse = BOOL ; switch ( get Orientation ( ) & ~ FOLLOW POLY ) { case FORWARD : break ; case BACKWARD : reverse = BOOL ; break ; case LEFT TO RIGHT : reverse = x1 > x2 ; break ; case RIGHT TO LEFT : reverse = x1 < x2 ; break ; case TOP T... | protected boolean needToReverse ( int x1 , int y1 , int x2 , int y2 ) { boolean reverse = _BOOL ; switch ( getOrientation ( ) & ~ FOLLOW_POLY ) { case FORWARD : break ; case BACKWARD : reverse = _BOOL ; break ; case LEFT_TO_RIGHT : reverse = x1 > x2 ; break ; case RIGHT_TO_LEFT : reverse = x1 < x2 ; break ; case TOP_TO... | 123 |
java-test-11167 | java | What need to be reverted for the text to be drawn with the specified orientation ? | the polyline | protected boolean need To Reverse ( int x1 , int y1 , int x2 , int y2 ) { boolean reverse = BOOL ; switch ( get Orientation ( ) & ~ FOLLOW POLY ) { case FORWARD : break ; case BACKWARD : reverse = BOOL ; break ; case LEFT TO RIGHT : reverse = x1 > x2 ; break ; case RIGHT TO LEFT : reverse = x1 < x2 ; break ; case TOP T... | protected boolean needToReverse ( int x1 , int y1 , int x2 , int y2 ) { boolean reverse = _BOOL ; switch ( getOrientation ( ) & ~ FOLLOW_POLY ) { case FORWARD : break ; case BACKWARD : reverse = _BOOL ; break ; case LEFT_TO_RIGHT : reverse = x1 > x2 ; break ; case RIGHT_TO_LEFT : reverse = x1 < x2 ; break ; case TOP_TO... | 123 |
java-test-11168 | java | What does the code send to zookeeper server ? | letter command | private String send 4 Letter Word ( String cmd ) throws IO Exception { Socket sock = new Socket ( host , port ) ; Buffered Reader reader = null ; try { Output Stream outstream = sock . get Output Stream ( ) ; outstream . write ( cmd . get Bytes ( ) ) ; outstream . flush ( ) ; sock . shutdown Output ( ) ; reader = new B... | private String send4LetterWord ( String cmd ) throws IOException { Socket sock = new Socket ( host , port ) ; BufferedReader reader = null ; try { OutputStream outstream = sock . getOutputStream ( ) ; outstream . write ( cmd . getBytes ( ) ) ; outstream . flush ( ) ; sock . shutdownOutput ( ) ; reader = new BufferedRea... | 163 |
java-test-11174 | java | When did the code fire ? | before the movement of a file is processed | @ Override public void before File Movement ( @ Not Null Virtual File Move Event event ) { Mason Settings mason Settings = Mason Settings . get Instance ( get Project ( ) ) ; List < Virtual File > components Roots = mason Settings . get Components Roots Virtual Files ( ) ; if ( components Roots . is Empty ( ) ) { retur... | @ Override public void beforeFileMovement ( @ NotNull VirtualFileMoveEvent event ) { MasonSettings masonSettings = MasonSettings . getInstance ( getProject ( ) ) ; List < VirtualFile > componentsRoots = masonSettings . getComponentsRootsVirtualFiles ( ) ; if ( componentsRoots . isEmpty ( ) ) { return ; } VirtualFile mo... | 205 |
java-test-11175 | java | How does a 2 - dimensional array return ? | with the prepared data | protected String [ ] [ ] to Array ( ) { int i ; int n ; int ii ; int nn ; int x ; int y ; String [ ] [ ] result ; String [ ] [ ] tmp Result ; int cols ; int rows ; boolean value Exists ; rows = get Visible Row Count ( ) ; if ( get Show Average ( ) ) { rows ++ ; } cols = get Visible Col Count ( ) ; if ( get Show Std Dev... | protected String [ ] [ ] toArray ( ) { int i ; int n ; int ii ; int nn ; int x ; int y ; String [ ] [ ] result ; String [ ] [ ] tmpResult ; int cols ; int rows ; boolean valueExists ; rows = getVisibleRowCount ( ) ; if ( getShowAverage ( ) ) { rows ++ ; } cols = getVisibleColCount ( ) ; if ( getShowStdDev ( ) ) { cols ... | 1,131 |
java-test-11176 | java | What did the code read ? | a number of apps with download information from the xml parser | private void read Download Apps ( Xml Pull Parser parser , Set < Download App Info > apps ) throws Xml Pull Parser Exception , IO Exception { while ( parser . next ( ) != Xml Pull Parser . END TAG ) { if ( parser . get Event Type ( ) != Xml Pull Parser . START TAG ) { continue ; } String name = parser . get Name ( ) ; ... | private void readDownloadApps ( XmlPullParser parser , Set < DownloadAppInfo > apps ) throws XmlPullParserException , IOException { while ( parser . next ( ) != XmlPullParser . END_TAG ) { if ( parser . getEventType ( ) != XmlPullParser . START_TAG ) { continue ; } String name = parser . getName ( ) ; if ( TAG_APP . eq... | 161 |
java-test-11177 | java | What does a string have only ? | one space between simple selectors , which may be the passed in string | String clean Selector String ( String selector ) { boolean last Was Space = BOOL ; for ( int counter = NUM , max Counter = selector . length ( ) ; counter < max Counter ; counter ++ ) { switch ( selector . char At ( counter ) ) { case STRING : if ( last Was Space ) { return clean Selector String ( selector ) ; } last W... | String cleanSelectorString ( String selector ) { boolean lastWasSpace = _BOOL ; for ( int counter = _NUM , maxCounter = selector . length ( ) ; counter < maxCounter ; counter ++ ) { switch ( selector . charAt ( counter ) ) { case STRING : if ( lastWasSpace ) { return _cleanSelectorString ( selector ) ; } lastWasSpace =... | 126 |
java-test-11179 | java | Where does the code start ? | up the window | public Interaction Tab ( Dialogue System system ) { this . system = system ; set Layout ( new Border Layout ( ) ) ; lines = new J Text Pane ( ) ; lines . set Size ( NUM , NUM ) ; lines . set Content Type ( STRING ) ; lines . set Margin ( new Insets ( NUM , NUM , NUM , NUM ) ) ; lines . set Editable ( BOOL ) ; J Scroll ... | public InteractionTab ( DialogueSystem system ) { this . system = system ; setLayout ( new BorderLayout ( ) ) ; lines = new JTextPane ( ) ; lines . setSize ( _NUM , _NUM ) ; lines . setContentType ( STRING ) ; lines . setMargin ( new Insets ( _NUM , _NUM , _NUM , _NUM ) ) ; lines . setEditable ( _BOOL ) ; JScrollPane u... | 365 |
java-test-11182 | java | What does the code translate to a string in hypen notation example : helloworld - > hello - world ? | a string in camel notation | public static String camel To Hypen Notation ( String str ) { if ( is Empty ( str ) ) return str ; String Builder sb = new String Builder ( ) ; char c ; sb . append ( Character . to Lower Case ( str . char At ( NUM ) ) ) ; for ( int i = NUM ; i < str . length ( ) ; i ++ ) { c = str . char At ( i ) ; if ( Character . is... | public static String camelToHypenNotation ( String str ) { if ( isEmpty ( str ) ) return str ; StringBuilder sb = new StringBuilder ( ) ; char c ; sb . append ( Character . toLowerCase ( str . charAt ( _NUM ) ) ) ; for ( int i = _NUM ; i < str . length ( ) ; i ++ ) { c = str . charAt ( i ) ; if ( Character . isUpperCas... | 137 |
java-test-11186 | java | How are distributions updated ? | as above | public void add Arc ( String s Parent , Array List < Integer > nodes ) throws Exception { int n Parent = get Node ( s Parent ) ; if ( m b Needs Undo Action ) { add Undo Action ( new Add Arc Action ( n Parent , nodes ) ) ; } boolean b Needs Undo Action = m b Needs Undo Action ; m b Needs Undo Action = BOOL ; for ( int i... | public void addArc ( String sParent , ArrayList < Integer > nodes ) throws Exception { int nParent = getNode ( sParent ) ; if ( m_bNeedsUndoAction ) { addUndoAction ( new AddArcAction ( nParent , nodes ) ) ; } boolean bNeedsUndoAction = m_bNeedsUndoAction ; m_bNeedsUndoAction = _BOOL ; for ( int iNode = _NUM ; iNode < ... | 133 |
java-test-11187 | java | What does the code add ? | arc between parent node and each of the nodes in a given list | public void add Arc ( String s Parent , Array List < Integer > nodes ) throws Exception { int n Parent = get Node ( s Parent ) ; if ( m b Needs Undo Action ) { add Undo Action ( new Add Arc Action ( n Parent , nodes ) ) ; } boolean b Needs Undo Action = m b Needs Undo Action ; m b Needs Undo Action = BOOL ; for ( int i... | public void addArc ( String sParent , ArrayList < Integer > nodes ) throws Exception { int nParent = getNode ( sParent ) ; if ( m_bNeedsUndoAction ) { addUndoAction ( new AddArcAction ( nParent , nodes ) ) ; } boolean bNeedsUndoAction = m_bNeedsUndoAction ; m_bNeedsUndoAction = _BOOL ; for ( int iNode = _NUM ; iNode < ... | 133 |
java-test-11188 | java | How does instance construct ? | with the specified observed points | public Parameter Guesser ( Collection < Weighted Observed Point > observations ) { Math Utils . check Not Null ( observations ) ; if ( observations . size ( ) < NUM ) { throw new Math Illegal Argument Exception ( Localized Core Formats . NUMBER TOO SMALL , observations . size ( ) , NUM ) ; } final List < Weighted Obser... | public ParameterGuesser ( Collection < WeightedObservedPoint > observations ) { MathUtils . checkNotNull ( observations ) ; if ( observations . size ( ) < _NUM ) { throw new MathIllegalArgumentException ( LocalizedCoreFormats . NUMBER_TOO_SMALL , observations . size ( ) , _NUM ) ; } final List < WeightedObservedPoint >... | 120 |
java-test-11189 | java | What does the code return ? | the return type of a method , where the " raw " return type of that method is given ( i . e . , the return type might still contain unsubstituted type variables ) , given the receiver of the method call | public static Type Mirror substitute Method Return Type ( Type Mirror method Type , Type Mirror substituted Receiver Type ) { if ( method Type . get Kind ( ) != Type Kind . TYPEVAR ) { return method Type ; } String t = method Type . to String ( ) ; Type final Receiver Type = ( Type ) substituted Receiver Type ; int i =... | public static TypeMirror substituteMethodReturnType ( TypeMirror methodType , TypeMirror substitutedReceiverType ) { if ( methodType . getKind ( ) != TypeKind . TYPEVAR ) { return methodType ; } String t = methodType . toString ( ) ; Type finalReceiverType = ( Type ) substitutedReceiverType ; int i = _NUM ; for ( TypeS... | 134 |
java-test-11190 | java | What might the return type contain still ? | unsubstituted type variables | public static Type Mirror substitute Method Return Type ( Type Mirror method Type , Type Mirror substituted Receiver Type ) { if ( method Type . get Kind ( ) != Type Kind . TYPEVAR ) { return method Type ; } String t = method Type . to String ( ) ; Type final Receiver Type = ( Type ) substituted Receiver Type ; int i =... | public static TypeMirror substituteMethodReturnType ( TypeMirror methodType , TypeMirror substitutedReceiverType ) { if ( methodType . getKind ( ) != TypeKind . TYPEVAR ) { return methodType ; } String t = methodType . toString ( ) ; Type finalReceiverType = ( Type ) substitutedReceiverType ; int i = _NUM ; for ( TypeS... | 134 |
java-test-11192 | java | How does the code append a word ? | without breaking it | public Wrapping String Builder wrap Word ( final String s ) { if ( m Wrap Width - m Prefix . length ( ) < NUM ) { append ( s ) ; return this ; } final int available = m Wrap Width - line Length ( ) ; if ( s . length ( ) >= available ) { if ( line Length ( ) != m Prefix . length ( ) ) { wrap ( ) ; } append Trimmed ( s )... | public WrappingStringBuilder wrapWord ( final String s ) { if ( mWrapWidth - mPrefix . length ( ) < _NUM ) { append ( s ) ; return this ; } final int available = mWrapWidth - lineLength ( ) ; if ( s . length ( ) >= available ) { if ( lineLength ( ) != mPrefix . length ( ) ) { wrap ( ) ; } appendTrimmed ( s ) ; } else {... | 100 |
java-test-11196 | java | What can we call with any first argument between c + 1 and c + ( length of original token ) ? | adjustmappingpairvector | private static void adjust Mapping Pair Vector ( int col , int incr , Vector < Mapping Pair > vec ) { int i ; for ( i = NUM ; ( i < vec . size ( ) ) && ( vec . element At ( i ) . col < col ) ; i ++ ) { } if ( i == vec . size ( ) ) { vec . add ( new Mapping Pair ( col , incr ) ) ; } else if ( vec . element At ( i ) . co... | private static void adjustMappingPairVector ( int col , int incr , Vector < MappingPair > vec ) { int i ; for ( i = _NUM ; ( i < vec . size ( ) ) && ( vec . elementAt ( i ) . col < col ) ; i ++ ) { } if ( i == vec . size ( ) ) { vec . add ( new MappingPair ( col , incr ) ) ; } else if ( vec . elementAt ( i ) . col == c... | 147 |
java-test-11197 | java | Where do one never modify anything ? | inside the expression | private static void adjust Mapping Pair Vector ( int col , int incr , Vector < Mapping Pair > vec ) { int i ; for ( i = NUM ; ( i < vec . size ( ) ) && ( vec . element At ( i ) . col < col ) ; i ++ ) { } if ( i == vec . size ( ) ) { vec . add ( new Mapping Pair ( col , incr ) ) ; } else if ( vec . element At ( i ) . co... | private static void adjustMappingPairVector ( int col , int incr , Vector < MappingPair > vec ) { int i ; for ( i = _NUM ; ( i < vec . size ( ) ) && ( vec . elementAt ( i ) . col < col ) ; i ++ ) { } if ( i == vec . size ( ) ) { vec . add ( new MappingPair ( col , incr ) ) ; } else if ( vec . elementAt ( i ) . col == c... | 147 |
java-test-11198 | java | How do a token of length blen replace by an expression of length nlen ? | at column c | private static void adjust Mapping Pair Vector ( int col , int incr , Vector < Mapping Pair > vec ) { int i ; for ( i = NUM ; ( i < vec . size ( ) ) && ( vec . element At ( i ) . col < col ) ; i ++ ) { } if ( i == vec . size ( ) ) { vec . add ( new Mapping Pair ( col , incr ) ) ; } else if ( vec . element At ( i ) . co... | private static void adjustMappingPairVector ( int col , int incr , Vector < MappingPair > vec ) { int i ; for ( i = _NUM ; ( i < vec . size ( ) ) && ( vec . elementAt ( i ) . col < col ) ; i ++ ) { } if ( i == vec . size ( ) ) { vec . add ( new MappingPair ( col , incr ) ) ; } else if ( vec . elementAt ( i ) . col == c... | 147 |
java-test-11199 | java | Why do adjustmappingpairvector ( c + 1 , nlen - olen , . . . call if replacing a token of length blen at column c by an expression of length nlen if replacing a token of length blen at column c by an expression of length nlen ? | because : ( a ) the beginning position of the expression is the same as that of the token , and ( b ) one should never be looking at or modifying anything inside the expression | private static void adjust Mapping Pair Vector ( int col , int incr , Vector < Mapping Pair > vec ) { int i ; for ( i = NUM ; ( i < vec . size ( ) ) && ( vec . element At ( i ) . col < col ) ; i ++ ) { } if ( i == vec . size ( ) ) { vec . add ( new Mapping Pair ( col , incr ) ) ; } else if ( vec . element At ( i ) . co... | private static void adjustMappingPairVector ( int col , int incr , Vector < MappingPair > vec ) { int i ; for ( i = _NUM ; ( i < vec . size ( ) ) && ( vec . elementAt ( i ) . col < col ) ; i ++ ) { } if ( i == vec . size ( ) ) { vec . add ( new MappingPair ( col , incr ) ) ; } else if ( vec . elementAt ( i ) . col == c... | 147 |
java-test-11200 | java | What does the code open ? | the git repository | public static Local Git Repo from Current Dir ( String remote Url ) throws Validation Exception { Git git ; File git Dir = new File ( STRING ) ; try { git = Git . open ( git Dir ) ; } catch ( Repository Not Found Exception rnfe ) { String full Path Of Current Dir = path Of ( git Dir ) ; File git Root = get Git Root If ... | public static LocalGitRepo fromCurrentDir ( String remoteUrl ) throws ValidationException { Git git ; File gitDir = new File ( STRING ) ; try { git = Git . open ( gitDir ) ; } catch ( RepositoryNotFoundException rnfe ) { String fullPathOfCurrentDir = pathOf ( gitDir ) ; File gitRoot = getGitRootIfItExistsInOneOfThePare... | 249 |
java-test-11201 | java | What does the code use the current working dir ? | to open the git repository | public static Local Git Repo from Current Dir ( String remote Url ) throws Validation Exception { Git git ; File git Dir = new File ( STRING ) ; try { git = Git . open ( git Dir ) ; } catch ( Repository Not Found Exception rnfe ) { String full Path Of Current Dir = path Of ( git Dir ) ; File git Root = get Git Root If ... | public static LocalGitRepo fromCurrentDir ( String remoteUrl ) throws ValidationException { Git git ; File gitDir = new File ( STRING ) ; try { git = Git . open ( gitDir ) ; } catch ( RepositoryNotFoundException rnfe ) { String fullPathOfCurrentDir = pathOf ( gitDir ) ; File gitRoot = getGitRootIfItExistsInOneOfThePare... | 249 |
java-test-11202 | java | What does the code use to open the git repository ? | the current working dir | public static Local Git Repo from Current Dir ( String remote Url ) throws Validation Exception { Git git ; File git Dir = new File ( STRING ) ; try { git = Git . open ( git Dir ) ; } catch ( Repository Not Found Exception rnfe ) { String full Path Of Current Dir = path Of ( git Dir ) ; File git Root = get Git Root If ... | public static LocalGitRepo fromCurrentDir ( String remoteUrl ) throws ValidationException { Git git ; File gitDir = new File ( STRING ) ; try { git = Git . open ( gitDir ) ; } catch ( RepositoryNotFoundException rnfe ) { String fullPathOfCurrentDir = pathOf ( gitDir ) ; File gitRoot = getGitRootIfItExistsInOneOfThePare... | 249 |
java-test-11203 | java | What do implements the pythagorean theorem just to do the number of pixels between two screen points ? | little math utility that both tools use | public static int num Pixels Between ( int x1 , int y1 , int x2 , int y2 ) { return ( int ) Math . sqrt ( Math . pow ( ( double ) ( x1 - x2 ) , NUM ) + Math . pow ( ( double ) ( y1 - y2 ) , NUM ) ) ; } | public static int numPixelsBetween ( int x1 , int y1 , int x2 , int y2 ) { return ( int ) Math . sqrt ( Math . pow ( ( double ) ( x1 - x2 ) , _NUM ) + Math . pow ( ( double ) ( y1 - y2 ) , _NUM ) ) ; } | 62 |
java-test-11204 | java | For what purpose do little math utility that both tools use implements the pythagorean theorem just ? | to do the number of pixels between two screen points | public static int num Pixels Between ( int x1 , int y1 , int x2 , int y2 ) { return ( int ) Math . sqrt ( Math . pow ( ( double ) ( x1 - x2 ) , NUM ) + Math . pow ( ( double ) ( y1 - y2 ) , NUM ) ) ; } | public static int numPixelsBetween ( int x1 , int y1 , int x2 , int y2 ) { return ( int ) Math . sqrt ( Math . pow ( ( double ) ( x1 - x2 ) , _NUM ) + Math . pow ( ( double ) ( y1 - y2 ) , _NUM ) ) ; } | 62 |
java-test-11205 | java | What does the pythagorean theorem do ? | the number of pixels between two screen points | public static int num Pixels Between ( int x1 , int y1 , int x2 , int y2 ) { return ( int ) Math . sqrt ( Math . pow ( ( double ) ( x1 - x2 ) , NUM ) + Math . pow ( ( double ) ( y1 - y2 ) , NUM ) ) ; } | public static int numPixelsBetween ( int x1 , int y1 , int x2 , int y2 ) { return ( int ) Math . sqrt ( Math . pow ( ( double ) ( x1 - x2 ) , _NUM ) + Math . pow ( ( double ) ( y1 - y2 ) , _NUM ) ) ; } | 62 |
java-test-11206 | java | When are no other connections or messages tried ? | once an accepting connection is found | protected Connection try Messages To Connections ( List < Message > messages , List < Connection > connections ) { for ( int i = NUM , n = connections . size ( ) ; i < n ; i ++ ) { Connection con = connections . get ( i ) ; Message started = try All Messages ( con , messages ) ; if ( started != null ) { return con ; } ... | protected Connection tryMessagesToConnections ( List < Message > messages , List < Connection > connections ) { for ( int i = _NUM , n = connections . size ( ) ; i < n ; i ++ ) { Connection con = connections . get ( i ) ; Message started = tryAllMessages ( con , messages ) ; if ( started != null ) { return con ; } } re... | 81 |
java-test-11207 | java | What should have a popup ? | formobject | static boolean allows Popup ( Form Object form Object ) { switch ( form Object . get Parameter Constant ( Pdf Dictionary . Subtype ) ) { case Pdf Dictionary . Text : case Pdf Dictionary . Square : case Pdf Dictionary . Highlight : case Pdf Dictionary . Underline : case Pdf Dictionary . Strick Out : case Pdf Dictionary ... | static boolean allowsPopup ( FormObject formObject ) { switch ( formObject . getParameterConstant ( PdfDictionary . Subtype ) ) { case PdfDictionary . Text : case PdfDictionary . Square : case PdfDictionary . Highlight : case PdfDictionary . Underline : case PdfDictionary . StrickOut : case PdfDictionary . Stamp : retu... | 74 |
java-test-11208 | java | What does the code parse ? | a rule line | private void parse Month Day Time ( Scanner s , TZDB Month Day Time mdt ) { mdt . month = parse Month ( s ) ; if ( s . has Next ( ) ) { String day Rule = s . next ( ) ; if ( day Rule . starts With ( STRING ) ) { mdt . day Of Month = - NUM ; mdt . day Of Week = parse Day Of Week ( day Rule . substring ( NUM ) ) ; mdt . ... | private void parseMonthDayTime ( Scanner s , TZDBMonthDayTime mdt ) { mdt . month = parseMonth ( s ) ; if ( s . hasNext ( ) ) { String dayRule = s . next ( ) ; if ( dayRule . startsWith ( STRING ) ) { mdt . dayOfMonth = - _NUM ; mdt . dayOfWeek = parseDayOfWeek ( dayRule . substring ( _NUM ) ) ; mdt . adjustForwards = ... | 341 |
java-test-11209 | java | What can the finddependencieswith method be used then ? | to find all top - level threads that are blocked by the culprit | public Dependency Graph find Longest Call Chain ( ) { int depth = NUM ; Dependency Graph deepest = null ; for ( Object dep : vertices . key Set ( ) ) { int its Depth = get Depth ( dep ) ; if ( its Depth > depth ) { deepest = get Sub Graph ( dep ) ; depth = its Depth ; } } return deepest ; } | public DependencyGraph findLongestCallChain ( ) { int depth = _NUM ; DependencyGraph deepest = null ; for ( Object dep : vertices . keySet ( ) ) { int itsDepth = getDepth ( dep ) ; if ( itsDepth > depth ) { deepest = getSubGraph ( dep ) ; depth = itsDepth ; } } return deepest ; } | 72 |
java-test-11210 | java | What can be used to find all top - level threads that are blocked by the culprit then ? | the finddependencieswith method | public Dependency Graph find Longest Call Chain ( ) { int depth = NUM ; Dependency Graph deepest = null ; for ( Object dep : vertices . key Set ( ) ) { int its Depth = get Depth ( dep ) ; if ( its Depth > depth ) { deepest = get Sub Graph ( dep ) ; depth = its Depth ; } } return deepest ; } | public DependencyGraph findLongestCallChain ( ) { int depth = _NUM ; DependencyGraph deepest = null ; for ( Object dep : vertices . keySet ( ) ) { int itsDepth = getDepth ( dep ) ; if ( itsDepth > depth ) { deepest = getSubGraph ( dep ) ; depth = itsDepth ; } } return deepest ; } | 72 |
java-test-11211 | java | For what purpose are all subgraphs traversed ? | to find the one that has the most depth | public Dependency Graph find Longest Call Chain ( ) { int depth = NUM ; Dependency Graph deepest = null ; for ( Object dep : vertices . key Set ( ) ) { int its Depth = get Depth ( dep ) ; if ( its Depth > depth ) { deepest = get Sub Graph ( dep ) ; depth = its Depth ; } } return deepest ; } | public DependencyGraph findLongestCallChain ( ) { int depth = _NUM ; DependencyGraph deepest = null ; for ( Object dep : vertices . keySet ( ) ) { int itsDepth = getDepth ( dep ) ; if ( itsDepth > depth ) { deepest = getSubGraph ( dep ) ; depth = itsDepth ; } } return deepest ; } | 72 |
java-test-11212 | java | What does the one have ? | the most depth | public Dependency Graph find Longest Call Chain ( ) { int depth = NUM ; Dependency Graph deepest = null ; for ( Object dep : vertices . key Set ( ) ) { int its Depth = get Depth ( dep ) ; if ( its Depth > depth ) { deepest = get Sub Graph ( dep ) ; depth = its Depth ; } } return deepest ; } | public DependencyGraph findLongestCallChain ( ) { int depth = _NUM ; DependencyGraph deepest = null ; for ( Object dep : vertices . keySet ( ) ) { int itsDepth = getDepth ( dep ) ; if ( itsDepth > depth ) { deepest = getSubGraph ( dep ) ; depth = itsDepth ; } } return deepest ; } | 72 |
java-test-11213 | java | What do this indicate usually ? | the thread that is blocking the most other threads | public Dependency Graph find Longest Call Chain ( ) { int depth = NUM ; Dependency Graph deepest = null ; for ( Object dep : vertices . key Set ( ) ) { int its Depth = get Depth ( dep ) ; if ( its Depth > depth ) { deepest = get Sub Graph ( dep ) ; depth = its Depth ; } } return deepest ; } | public DependencyGraph findLongestCallChain ( ) { int depth = _NUM ; DependencyGraph deepest = null ; for ( Object dep : vertices . keySet ( ) ) { int itsDepth = getDepth ( dep ) ; if ( itsDepth > depth ) { deepest = getSubGraph ( dep ) ; depth = itsDepth ; } } return deepest ; } | 72 |
java-test-11214 | java | What is the thread blocking ? | the most other threads | public Dependency Graph find Longest Call Chain ( ) { int depth = NUM ; Dependency Graph deepest = null ; for ( Object dep : vertices . key Set ( ) ) { int its Depth = get Depth ( dep ) ; if ( its Depth > depth ) { deepest = get Sub Graph ( dep ) ; depth = its Depth ; } } return deepest ; } | public DependencyGraph findLongestCallChain ( ) { int depth = _NUM ; DependencyGraph deepest = null ; for ( Object dep : vertices . keySet ( ) ) { int itsDepth = getDepth ( dep ) ; if ( itsDepth > depth ) { deepest = getSubGraph ( dep ) ; depth = itsDepth ; } } return deepest ; } | 72 |
java-test-11215 | java | What will this find if a cycle is ? | the longest call chain in the graph | public Dependency Graph find Longest Call Chain ( ) { int depth = NUM ; Dependency Graph deepest = null ; for ( Object dep : vertices . key Set ( ) ) { int its Depth = get Depth ( dep ) ; if ( its Depth > depth ) { deepest = get Sub Graph ( dep ) ; depth = its Depth ; } } return deepest ; } | public DependencyGraph findLongestCallChain ( ) { int depth = _NUM ; DependencyGraph deepest = null ; for ( Object dep : vertices . keySet ( ) ) { int itsDepth = getDepth ( dep ) ; if ( itsDepth > depth ) { deepest = getSubGraph ( dep ) ; depth = itsDepth ; } } return deepest ; } | 72 |
java-test-11216 | java | What will this return instead of throwing mergefailed due to a bug in bridgesupport ? | a ( the first arg ) | public String merge Name ( String a , String b ) throws Merge Failed { if ( QA . both Null Or Equals ( a , b ) ) return a ; if ( empty Names . contains ( a ) && ! empty Names . contains ( b ) ) return b ; if ( empty Names . contains ( b ) && ! empty Names . contains ( a ) ) return a ; return a ; } | public String mergeName ( String a , String b ) throws MergeFailed { if ( QA . bothNullOrEquals ( a , b ) ) return a ; if ( emptyNames . contains ( a ) && ! emptyNames . contains ( b ) ) return b ; if ( emptyNames . contains ( b ) && ! emptyNames . contains ( a ) ) return a ; return a ; } | 80 |
java-test-11217 | java | Why will this return a ( the first arg ) instead of throwing mergefailed ? | due to a bug in bridgesupport | public String merge Name ( String a , String b ) throws Merge Failed { if ( QA . both Null Or Equals ( a , b ) ) return a ; if ( empty Names . contains ( a ) && ! empty Names . contains ( b ) ) return b ; if ( empty Names . contains ( b ) && ! empty Names . contains ( a ) ) return a ; return a ; } | public String mergeName ( String a , String b ) throws MergeFailed { if ( QA . bothNullOrEquals ( a , b ) ) return a ; if ( emptyNames . contains ( a ) && ! emptyNames . contains ( b ) ) return b ; if ( emptyNames . contains ( b ) && ! emptyNames . contains ( a ) ) return a ; return a ; } | 80 |
java-test-11218 | java | How is the code write the properties ? | as several strings | public void write ( Data Output Stream dos ) throws IO Exception { dos . write Int ( ( size ( ) + NUM ) * NUM ) ; dos . write Int ( LPC PROPERY MANAGEMENT POLICY . length ( ) ) ; dos . write Chars ( LPC PROPERY MANAGEMENT POLICY ) ; if ( reuse Properties == Boolean . TRUE ) { dos . write Int ( LPC REUSE PROPERTIES . le... | public void write ( DataOutputStream dos ) throws IOException { dos . writeInt ( ( size ( ) + _NUM ) * _NUM ) ; dos . writeInt ( LPC_PROPERY_MANAGEMENT_POLICY . length ( ) ) ; dos . writeChars ( LPC_PROPERY_MANAGEMENT_POLICY ) ; if ( reuseProperties == Boolean . TRUE ) { dos . writeInt ( LPC_REUSE_PROPERTIES . length (... | 201 |
java-test-11219 | java | What does the code show ? | the filter dialog | private void show Filter Dialog ( Filter filter ) { int sort Order = m Adapter . get Count ( ) - NUM ; if ( filter == null ) { Edit Filter Activity . create New Filter ( get Activity ( ) , sort Order ) ; } else { Edit Filter Activity . edit Filter ( get Activity ( ) , filter , sort Order ) ; } } | private void showFilterDialog ( Filter filter ) { int sortOrder = mAdapter . getCount ( ) - _NUM ; if ( filter == null ) { EditFilterActivity . createNewFilter ( getActivity ( ) , sortOrder ) ; } else { EditFilterActivity . editFilter ( getActivity ( ) , filter , sortOrder ) ; } } | 71 |
java-test-11223 | java | What does the code create ? | a set of virtual dice with the given number of faces that start with the given value , where only a subset of the highest will be kept | public MM Roll ( MM Random rng , int count , int start , int keep ) { super ( count , start ) ; this . total = rng . random Int ( this . faces ) + this . min ; all . add Element ( this . total ) ; this . keep = keep ; } | public MMRoll ( MMRandom rng , int count , int start , int keep ) { super ( count , start ) ; this . total = rng . randomInt ( this . faces ) + this . min ; all . addElement ( this . total ) ; this . keep = keep ; } | 60 |
java-test-11224 | java | Where does the managed tree end ? | where the next entity ' s managed tree starts | public int sync ( String entity Id , Collection < Statement > statements , Collection < String > value List ) { long start = System . current Time Millis ( ) ; int modified = execute ( STRING , UPDATE COUNT RESPONSE , get Sync Query ( entity Id , statements , value List ) ) ; log . debug ( STRING , entity Id , System .... | public int sync ( String entityId , Collection < Statement > statements , Collection < String > valueList ) { long start = System . currentTimeMillis ( ) ; int modified = execute ( STRING , UPDATE_COUNT_RESPONSE , getSyncQuery ( entityId , statements , valueList ) ) ; log . debug ( STRING , entityId , System . currentT... | 84 |
java-test-11225 | java | What ends where the next entity ' s managed tree starts ? | the managed tree | public int sync ( String entity Id , Collection < Statement > statements , Collection < String > value List ) { long start = System . current Time Millis ( ) ; int modified = execute ( STRING , UPDATE COUNT RESPONSE , get Sync Query ( entity Id , statements , value List ) ) ; log . debug ( STRING , entity Id , System .... | public int sync ( String entityId , Collection < Statement > statements , Collection < String > valueList ) { long start = System . currentTimeMillis ( ) ; int modified = execute ( STRING , UPDATE_COUNT_RESPONSE , getSyncQuery ( entityId , statements , valueList ) ) ; log . debug ( STRING , entityId , System . currentT... | 84 |
java-test-11226 | java | What managed tree starts ? | the next entity ' s | public int sync ( String entity Id , Collection < Statement > statements , Collection < String > value List ) { long start = System . current Time Millis ( ) ; int modified = execute ( STRING , UPDATE COUNT RESPONSE , get Sync Query ( entity Id , statements , value List ) ) ; log . debug ( STRING , entity Id , System .... | public int sync ( String entityId , Collection < Statement > statements , Collection < String > valueList ) { long start = System . currentTimeMillis ( ) ; int modified = execute ( STRING , UPDATE_COUNT_RESPONSE , getSyncQuery ( entityId , statements , valueList ) ) ; log . debug ( STRING , entityId , System . currentT... | 84 |
java-test-11227 | java | What does the next entity ' s manage ? | tree starts | public int sync ( String entity Id , Collection < Statement > statements , Collection < String > value List ) { long start = System . current Time Millis ( ) ; int modified = execute ( STRING , UPDATE COUNT RESPONSE , get Sync Query ( entity Id , statements , value List ) ) ; log . debug ( STRING , entity Id , System .... | public int sync ( String entityId , Collection < Statement > statements , Collection < String > valueList ) { long start = System . currentTimeMillis ( ) ; int modified = execute ( STRING , UPDATE_COUNT_RESPONSE , getSyncQuery ( entityId , statements , valueList ) ) ; log . debug ( STRING , entityId , System . currentT... | 84 |
java-test-11228 | java | When did the code invoke ? | when component has been hidden | public void component Hidden ( Component Event e ) { if ( logger . is Loggable ( Level . FINE ) ) { logger . fine ( STRING + layer . get Name ( ) + STRING ) ; } Component comp = e . get Component ( ) ; if ( comp == layer ) { if ( is Layer On ( ) != BOOL ) { set Layer On ( BOOL ) ; if ( logger . is Loggable ( Level . FI... | public void componentHidden ( ComponentEvent e ) { if ( logger . isLoggable ( Level . FINE ) ) { logger . fine ( STRING + layer . getName ( ) + STRING ) ; } Component comp = e . getComponent ( ) ; if ( comp == layer ) { if ( isLayerOn ( ) != _BOOL ) { setLayerOn ( _BOOL ) ; if ( logger . isLoggable ( Level . FINE ) ) {... | 168 |
java-test-11231 | java | What does the code add to a certain room ? | a meeting member | public Long add Meeting Member Remind To Room ( String SID , Long room id , String firstname , String lastname , String email , String base Url , Long language id ) throws Axis Fault { try { Long users id = session Management . check Session ( SID ) ; Long user level = user Management . get User Level By ID ( users id ... | public Long addMeetingMemberRemindToRoom ( String SID , Long room_id , String firstname , String lastname , String email , String baseUrl , Long language_id ) throws AxisFault { try { Long users_id = sessionManagement . checkSession ( SID ) ; Long user_level = userManagement . getUserLevelByID ( users_id ) ; if ( authL... | 212 |
java-test-11233 | java | How do the given location pattern match all resources in the file system ? | via the ant - style pathmatcher | protected Set < Resource > do Find Matching File System Resources ( File root Dir , String sub Pattern ) throws IO Exception { if ( logger . is Debug Enabled ( ) ) { logger . debug ( STRING + root Dir . get Path ( ) + STRING ) ; } Set < File > matching Files = retrieve Matching Files ( root Dir , sub Pattern ) ; Set < ... | protected Set < Resource > doFindMatchingFileSystemResources ( File rootDir , String subPattern ) throws IOException { if ( logger . isDebugEnabled ( ) ) { logger . debug ( STRING + rootDir . getPath ( ) + STRING ) ; } Set < File > matchingFiles = retrieveMatchingFiles ( rootDir , subPattern ) ; Set < Resource > result... | 120 |
java-test-11234 | java | What does the code find ? | all resources in the file system that match the given location pattern via the ant - style pathmatcher | protected Set < Resource > do Find Matching File System Resources ( File root Dir , String sub Pattern ) throws IO Exception { if ( logger . is Debug Enabled ( ) ) { logger . debug ( STRING + root Dir . get Path ( ) + STRING ) ; } Set < File > matching Files = retrieve Matching Files ( root Dir , sub Pattern ) ; Set < ... | protected Set < Resource > doFindMatchingFileSystemResources ( File rootDir , String subPattern ) throws IOException { if ( logger . isDebugEnabled ( ) ) { logger . debug ( STRING + rootDir . getPath ( ) + STRING ) ; } Set < File > matchingFiles = retrieveMatchingFiles ( rootDir , subPattern ) ; Set < Resource > result... | 120 |
java-test-11235 | java | What does the code extract ? | the revision string | public static String extract ( String s ) { String result ; result = s ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , STRING ) ; result = result . replace All ( STRING , STRING ) ; return result ; } | public static String extract ( String s ) { String result ; result = s ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING ) ; result = result . replaceAll ( STRING , STRING ) ; return result ; } | 56 |
java-test-11236 | java | What do the signaturetimestamp element contain ? | the base64 encoded timestamp der | public void add Signature Timestamp ( byte [ ] timestamp Der ) throws Exception { Element unsigned Properties = get First Element By Tag Name ( document , xades Element ( UNSIGNED SIGNATURE PROPS TAG ) ) ; Element signature Time Stamp Element = document . create Element ( xades Element ( SIGNATURE TIMESTAMP TAG ) ) ; S... | public void addSignatureTimestamp ( byte [ ] timestampDer ) throws Exception { Element unsignedProperties = getFirstElementByTagName ( document , xadesElement ( UNSIGNED_SIGNATURE_PROPS_TAG ) ) ; Element signatureTimeStampElement = document . createElement ( xadesElement ( SIGNATURE_TIMESTAMP_TAG ) ) ; String timestamp... | 109 |
java-test-11237 | java | What does the code add ? | the signaturetimestamp element containing the base64 encoded timestamp der | public void add Signature Timestamp ( byte [ ] timestamp Der ) throws Exception { Element unsigned Properties = get First Element By Tag Name ( document , xades Element ( UNSIGNED SIGNATURE PROPS TAG ) ) ; Element signature Time Stamp Element = document . create Element ( xades Element ( SIGNATURE TIMESTAMP TAG ) ) ; S... | public void addSignatureTimestamp ( byte [ ] timestampDer ) throws Exception { Element unsignedProperties = getFirstElementByTagName ( document , xadesElement ( UNSIGNED_SIGNATURE_PROPS_TAG ) ) ; Element signatureTimeStampElement = document . createElement ( xadesElement ( SIGNATURE_TIMESTAMP_TAG ) ) ; String timestamp... | 109 |
java-test-11238 | java | What is containing the base64 encoded timestamp der ? | the signaturetimestamp element | public void add Signature Timestamp ( byte [ ] timestamp Der ) throws Exception { Element unsigned Properties = get First Element By Tag Name ( document , xades Element ( UNSIGNED SIGNATURE PROPS TAG ) ) ; Element signature Time Stamp Element = document . create Element ( xades Element ( SIGNATURE TIMESTAMP TAG ) ) ; S... | public void addSignatureTimestamp ( byte [ ] timestampDer ) throws Exception { Element unsignedProperties = getFirstElementByTagName ( document , xadesElement ( UNSIGNED_SIGNATURE_PROPS_TAG ) ) ; Element signatureTimeStampElement = document . createElement ( xadesElement ( SIGNATURE_TIMESTAMP_TAG ) ) ; String timestamp... | 109 |
java-test-11239 | java | What does the code create ? | a loader that loads from an apk file ( could contain multiple dex files ) , optionally loading instructions | public Smali Class Detail Loader ( Zip File apk File , boolean translate Instructions ) { Array List < Zip Entry > dex Entries = new Array List < Zip Entry > ( ) ; dex Entries . add ( apk File . get Entry ( STRING ) ) ; for ( int i = NUM ; i < NUM ; ++ i ) { final Zip Entry e = apk File . get Entry ( STRING + i + STRIN... | public SmaliClassDetailLoader ( ZipFile apkFile , boolean translateInstructions ) { ArrayList < ZipEntry > dexEntries = new ArrayList < ZipEntry > ( ) ; dexEntries . add ( apkFile . getEntry ( STRING ) ) ; for ( int i = _NUM ; i < _NUM ; ++ i ) { final ZipEntry e = apkFile . getEntry ( STRING + i + STRING ) ; if ( e !=... | 261 |
java-test-11240 | java | What do it assume ? | that color is hex string w / o # | public static String convert Color ( String color ) { if ( color == null ) return BLACK ; if ( color . length ( ) != NUM ) return color ; if ( ! color . starts With ( STRING ) ) return STRING + color ; return color ; } | public static String convertColor ( String color ) { if ( color == null ) return BLACK ; if ( color . length ( ) != _NUM ) return color ; if ( ! color . startsWith ( STRING ) ) return STRING + color ; return color ; } | 52 |
java-test-11241 | java | What do this method append to the beginning if it isn ' t already there ? | a # | public static String convert Color ( String color ) { if ( color == null ) return BLACK ; if ( color . length ( ) != NUM ) return color ; if ( ! color . starts With ( STRING ) ) return STRING + color ; return color ; } | public static String convertColor ( String color ) { if ( color == null ) return BLACK ; if ( color . length ( ) != _NUM ) return color ; if ( ! color . startsWith ( STRING ) ) return STRING + color ; return color ; } | 52 |
java-test-11242 | java | What will this method take ? | a string of hex values | public static String convert Color ( String color ) { if ( color == null ) return BLACK ; if ( color . length ( ) != NUM ) return color ; if ( ! color . starts With ( STRING ) ) return STRING + color ; return color ; } | public static String convertColor ( String color ) { if ( color == null ) return BLACK ; if ( color . length ( ) != _NUM ) return color ; if ( ! color . startsWith ( STRING ) ) return STRING + color ; return color ; } | 52 |
java-test-11243 | java | What is driving the media flow ? | main process loop | public void run ( ) { while ( ! interrupted ) { boolean EOM = BOOL ; boolean was Running = running ; is Pumping = ! interrupted && running ; while ( ! EOM && ! interrupted && running ) { EOM = data Pump . pump ( ) ; try { Thread . sleep ( NUM ) ; } catch ( Interrupted Exception ie ) { } } if ( Printer . debug ) { Print... | public void run ( ) { while ( ! interrupted ) { boolean EOM = _BOOL ; boolean wasRunning = running ; isPumping = ! interrupted && running ; while ( ! EOM && ! interrupted && running ) { EOM = dataPump . pump ( ) ; try { Thread . sleep ( _NUM ) ; } catch ( InterruptedException ie ) { } } if ( Printer . debug ) { Printer... | 276 |
java-test-11244 | java | What do main process loop drive ? | the media flow | public void run ( ) { while ( ! interrupted ) { boolean EOM = BOOL ; boolean was Running = running ; is Pumping = ! interrupted && running ; while ( ! EOM && ! interrupted && running ) { EOM = data Pump . pump ( ) ; try { Thread . sleep ( NUM ) ; } catch ( Interrupted Exception ie ) { } } if ( Printer . debug ) { Print... | public void run ( ) { while ( ! interrupted ) { boolean EOM = _BOOL ; boolean wasRunning = running ; isPumping = ! interrupted && running ; while ( ! EOM && ! interrupted && running ) { EOM = dataPump . pump ( ) ; try { Thread . sleep ( _NUM ) ; } catch ( InterruptedException ie ) { } } if ( Printer . debug ) { Printer... | 276 |
java-test-11245 | java | What does this return ? | the ids of any that are in the given collection | protected void filter Members ( Collection < Internal Distributed Member > mbrs , Set < Internal Distributed Member > matching Members , short request Type ) { Set < Internal Distributed Member > requests = get Pending Request I Ds ( request Type ) ; if ( ! requests . is Empty ( ) ) { logger . debug ( STRING + requests... | protected void filterMembers ( Collection < InternalDistributedMember > mbrs , Set < InternalDistributedMember > matchingMembers , short requestType ) { Set < InternalDistributedMember > requests = getPendingRequestIDs ( requestType ) ; if ( ! requests . isEmpty ( ) ) { logger . debug ( STRING + requests . size ( ) + S... | 142 |
java-test-11246 | java | What does this get ? | pending requests | protected void filter Members ( Collection < Internal Distributed Member > mbrs , Set < Internal Distributed Member > matching Members , short request Type ) { Set < Internal Distributed Member > requests = get Pending Request I Ds ( request Type ) ; if ( ! requests . is Empty ( ) ) { logger . debug ( STRING + requests... | protected void filterMembers ( Collection < InternalDistributedMember > mbrs , Set < InternalDistributedMember > matchingMembers , short requestType ) { Set < InternalDistributedMember > requests = getPendingRequestIDs ( requestType ) ; if ( ! requests . isEmpty ( ) ) { logger . debug ( STRING + requests . size ( ) + S... | 142 |
java-test-11247 | java | What does the code take ? | an array a representing a negative 2 ' s - complement number | private static int [ ] make Positive ( byte a [ ] ) { int keep , k ; int byte Length = a . length ; for ( keep = NUM ; keep < byte Length && a [ keep ] == - NUM ; keep ++ ) ; for ( k = keep ; k < byte Length && a [ k ] == NUM ; k ++ ) ; int extra Byte = ( k == byte Length ) ? NUM : NUM ; int int Length = ( ( byte Lengt... | private static int [ ] makePositive ( byte a [ ] ) { int keep , k ; int byteLength = a . length ; for ( keep = _NUM ; keep < byteLength && a [ keep ] == - _NUM ; keep ++ ) ; for ( k = keep ; k < byteLength && a [ k ] == _NUM ; k ++ ) ; int extraByte = ( k == byteLength ) ? _NUM : _NUM ; int intLength = ( ( byteLength -... | 326 |
java-test-11248 | java | What does the code return ? | the minimal ( no leading zero bytes ) unsigned whose value is - a | private static int [ ] make Positive ( byte a [ ] ) { int keep , k ; int byte Length = a . length ; for ( keep = NUM ; keep < byte Length && a [ keep ] == - NUM ; keep ++ ) ; for ( k = keep ; k < byte Length && a [ k ] == NUM ; k ++ ) ; int extra Byte = ( k == byte Length ) ? NUM : NUM ; int int Length = ( ( byte Lengt... | private static int [ ] makePositive ( byte a [ ] ) { int keep , k ; int byteLength = a . length ; for ( keep = _NUM ; keep < byteLength && a [ keep ] == - _NUM ; keep ++ ) ; for ( k = keep ; k < byteLength && a [ k ] == _NUM ; k ++ ) ; int extraByte = ( k == byteLength ) ? _NUM : _NUM ; int intLength = ( ( byteLength -... | 326 |
java-test-11251 | java | What is testing the behavior of readall ( ) and writeall ( ) ? | a single trial | public void test one Trial read All write All ( ) throws IO Exception { final File file = File . create Temp File ( STRING , get Name ( ) ) ; file . delete On Exit ( ) ; final Random Access File raf = new Random Access File ( file , STRING ) ; try { final byte [ ] expected = new byte [ FILE SIZE ] ; { r . next Bytes ( ... | public void test_oneTrial_readAll_writeAll ( ) throws IOException { final File file = File . createTempFile ( STRING , getName ( ) ) ; file . deleteOnExit ( ) ; final RandomAccessFile raf = new RandomAccessFile ( file , STRING ) ; try { final byte [ ] expected = new byte [ FILE_SIZE ] ; { r . nextBytes ( expected ) ; }... | 202 |
java-test-11252 | java | What do a single trial test ? | the behavior of readall ( ) and writeall ( ) | public void test one Trial read All write All ( ) throws IO Exception { final File file = File . create Temp File ( STRING , get Name ( ) ) ; file . delete On Exit ( ) ; final Random Access File raf = new Random Access File ( file , STRING ) ; try { final byte [ ] expected = new byte [ FILE SIZE ] ; { r . next Bytes ( ... | public void test_oneTrial_readAll_writeAll ( ) throws IOException { final File file = File . createTempFile ( STRING , getName ( ) ) ; file . deleteOnExit ( ) ; final RandomAccessFile raf = new RandomAccessFile ( file , STRING ) ; try { final byte [ ] expected = new byte [ FILE_SIZE ] ; { r . nextBytes ( expected ) ; }... | 202 |
java-test-11253 | java | What does utility method write to a file called " cluster_centroids . bin ? | cluster centroids | public static void write Centroids To File ( Clusters clusters , Flag Config flag Config ) { Vector Store RAM centroids Output = new Vector Store RAM ( flag Config ) ; for ( int i = NUM ; i < clusters . centroids . length ; ++ i ) { centroids Output . put Vector ( Integer . to String ( i ) , clusters . centroids [ i ] ... | public static void writeCentroidsToFile ( Clusters clusters , FlagConfig flagConfig ) { VectorStoreRAM centroidsOutput = new VectorStoreRAM ( flagConfig ) ; for ( int i = _NUM ; i < clusters . centroids . length ; ++ i ) { centroidsOutput . putVector ( Integer . toString ( i ) , clusters . centroids [ i ] ) ; } try { V... | 110 |
java-test-11255 | java | What does the code calculate ? | the size of the " sphere of influence " defined as : sphere = sum ( p ) ^ 2 / sum ( p ^ 2 ) where p ( i ) = root * exp ( - 2 * i * root ) . since there are n different training instances we multiply p ( i ) by 1 / n | private void calculate Sphere Size ( double scale , K Star Wrapper params ) { int i ; double sphere Size , minprob = NUM ; double pstar ; double pstar Sum = NUM ; double pstar Square Sum = NUM ; double inc ; for ( i = NUM ; i < m Num Instances ; i ++ ) { if ( m Distances [ i ] < NUM ) { continue ; } else { pstar = P St... | private void calculateSphereSize ( double scale , KStarWrapper params ) { int i ; double sphereSize , minprob = _NUM ; double pstar ; double pstarSum = _NUM ; double pstarSquareSum = _NUM ; double inc ; for ( i = _NUM ; i < m_NumInstances ; i ++ ) { if ( m_Distances [ i ] < _NUM ) { continue ; } else { pstar = PStar ( ... | 172 |
java-test-11256 | java | What does the code build ? | the name line of a function node | private static void build Name Line ( final I Navi Function Node node , final Zy Label Content content , final boolean show Function Information ) { final I Navi Function function = node . get Function ( ) ; String information String = STRING ; if ( function . get Basic Block Count ( ) > NUM ) { final String Builder bu... | private static void buildNameLine ( final INaviFunctionNode node , final ZyLabelContent content , final boolean showFunctionInformation ) { final INaviFunction function = node . getFunction ( ) ; String informationString = STRING ; if ( function . getBasicBlockCount ( ) > _NUM ) { final StringBuilder builder = new Stri... | 240 |
java-test-11257 | java | What designed to be called from action ? | each tile on the builder | public void grab Tiles ( Action builder ) { if ( bounds List == null ) { bounds List = new Array List < double [ ] > ( ) ; bounds List . add ( new double [ ] { NUM , - NUM , - NUM , NUM } ) ; } for ( int i = NUM ; i < ZOOM LEVELS ; i ++ ) { if ( zoom Levels == null ) { if ( i > NUM ) continue ; } else { if ( ! zoom Lev... | public void grabTiles ( Action builder ) { if ( boundsList == null ) { boundsList = new ArrayList < double [ ] > ( ) ; boundsList . add ( new double [ ] { _NUM , - _NUM , - _NUM , _NUM } ) ; } for ( int i = _NUM ; i < ZOOM_LEVELS ; i ++ ) { if ( zoomLevels == null ) { if ( i > _NUM ) continue ; } else { if ( ! zoomLeve... | 320 |
java-test-11258 | java | What did each tile on the builder design ? | to be called from action | public void grab Tiles ( Action builder ) { if ( bounds List == null ) { bounds List = new Array List < double [ ] > ( ) ; bounds List . add ( new double [ ] { NUM , - NUM , - NUM , NUM } ) ; } for ( int i = NUM ; i < ZOOM LEVELS ; i ++ ) { if ( zoom Levels == null ) { if ( i > NUM ) continue ; } else { if ( ! zoom Lev... | public void grabTiles ( Action builder ) { if ( boundsList == null ) { boundsList = new ArrayList < double [ ] > ( ) ; boundsList . add ( new double [ ] { _NUM , - _NUM , - _NUM , _NUM } ) ; } for ( int i = _NUM ; i < ZOOM_LEVELS ; i ++ ) { if ( zoomLevels == null ) { if ( i > _NUM ) continue ; } else { if ( ! zoomLeve... | 320 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.