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-9940 | java | What does the code create ? | a synchronization sample with a given time offset | public static List < Time Synchronization Sample > create Random Tolerable Samples With Different Key Pairs Around Mean ( final int count , final long mean ) { final Secure Random random = new Secure Random ( ) ; final List < Time Synchronization Sample > samples = new Array List < > ( ) ; if ( count % NUM == NUM ) { s... | public static List < TimeSynchronizationSample > createRandomTolerableSamplesWithDifferentKeyPairsAroundMean ( final int count , final long mean ) { final SecureRandom random = new SecureRandom ( ) ; final List < TimeSynchronizationSample > samples = new ArrayList < > ( ) ; if ( count % _NUM == _NUM ) { samples . add (... | 170 |
java-test-9941 | java | What does the code restore ? | the opengl state | public void end Drawing ( GL 10 gl ) { gl . gl Disable ( GL 10 . GL ALPHA TEST ) ; gl . gl Matrix Mode ( GL 10 . GL PROJECTION ) ; gl . gl Pop Matrix ( ) ; gl . gl Matrix Mode ( GL 10 . GL MODELVIEW ) ; gl . gl Pop Matrix ( ) ; gl . gl Disable ( GL 10 . GL TEXTURE 2D ) ; gl . gl Color 4 x ( Fixed Point . ONE , Fixed Po... | public void endDrawing ( GL10 gl ) { gl . glDisable ( GL10 . GL_ALPHA_TEST ) ; gl . glMatrixMode ( GL10 . GL_PROJECTION ) ; gl . glPopMatrix ( ) ; gl . glMatrixMode ( GL10 . GL_MODELVIEW ) ; gl . glPopMatrix ( ) ; gl . glDisable ( GL10 . GL_TEXTURE_2D ) ; gl . glColor4x ( FixedPoint . ONE , FixedPoint . ONE , FixedPoin... | 107 |
java-test-9944 | java | When will the input stream be read ? | only during submission | public void add Data ( String name , Input Stream data , long data Size , String mime Type ) { args . put ( name , data ) ; if ( ! filenames . contains Key ( name ) ) { filenames . put ( name , name ) ; } filesizes . put ( name , String . value Of ( data Size ) ) ; mime Types . put ( name , mime Type ) ; } | public void addData ( String name , InputStream data , long dataSize , String mimeType ) { args . put ( name , data ) ; if ( ! filenames . containsKey ( name ) ) { filenames . put ( name , name ) ; } filesizes . put ( name , String . valueOf ( dataSize ) ) ; mimeTypes . put ( name , mimeType ) ; } | 80 |
java-test-9945 | java | What represents a given criterium ? | a criterium tree node | public static C Criterium Tree Node find Node ( final C Criterium Tree Node node , final I Criterium criterium ) { if ( node . get Criterium ( ) == criterium ) { return node ; } for ( final C Criterium Tree Node child : node . get Children ( ) ) { final C Criterium Tree Node child Node = find Node ( child , criterium )... | public static CCriteriumTreeNode findNode ( final CCriteriumTreeNode node , final ICriterium criterium ) { if ( node . getCriterium ( ) == criterium ) { return node ; } for ( final CCriteriumTreeNode child : node . getChildren ( ) ) { final CCriteriumTreeNode childNode = findNode ( child , criterium ) ; if ( childNode ... | 89 |
java-test-9946 | java | What does a criterium tree node represent ? | a given criterium | public static C Criterium Tree Node find Node ( final C Criterium Tree Node node , final I Criterium criterium ) { if ( node . get Criterium ( ) == criterium ) { return node ; } for ( final C Criterium Tree Node child : node . get Children ( ) ) { final C Criterium Tree Node child Node = find Node ( child , criterium )... | public static CCriteriumTreeNode findNode ( final CCriteriumTreeNode node , final ICriterium criterium ) { if ( node . getCriterium ( ) == criterium ) { return node ; } for ( final CCriteriumTreeNode child : node . getChildren ( ) ) { final CCriteriumTreeNode childNode = findNode ( child , criterium ) ; if ( childNode ... | 89 |
java-test-9949 | java | What does a byte array contain ? | the gif encoded image | public static byte [ ] encode Gif ( Buffered Image image ) throws IO Exception { Byte Array Output Stream out = new Byte Array Output Stream ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( STRING + out ) ; } Acme . JPM . Encoders . Gif Encoder enc = new Acme . JPM . Encoders . Gif Encoder ( image , out ) ;... | public static byte [ ] encodeGif ( BufferedImage image ) throws IOException { ByteArrayOutputStream out = new ByteArrayOutputStream ( ) ; if ( Debug . debugging ( STRING ) ) { Debug . output ( STRING + out ) ; } Acme . JPM . Encoders . GifEncoder enc = new Acme . JPM . Encoders . GifEncoder ( image , out ) ; if ( Debug... | 127 |
java-test-9950 | java | What does the code create ? | a bloom filter of optimal size and hash functions for | public static Bloom Filter create Optimal Filter ( int n , double false Positive Probability , int tweak , Update Mode update ) { double ln 2 = Math . log ( NUM ) ; int mod = Math . max ( NUM , ( int ) Math . min ( ( - n * Math . log ( false Positive Probability ) / ( ln 2 * ln 2 ) ) / NUM , MAX FILTER SIZE ) ) ; int h... | public static BloomFilter createOptimalFilter ( int n , double falsePositiveProbability , int tweak , UpdateMode update ) { double ln2 = Math . log ( _NUM ) ; int mod = Math . max ( _NUM , ( int ) Math . min ( ( - n * Math . log ( falsePositiveProbability ) / ( ln2 * ln2 ) ) / _NUM , MAX_FILTER_SIZE ) ) ; int hashFunct... | 135 |
java-test-9951 | java | What do the given map have ? | the correct for each parameter | private static void enforce Parameter Types ( @ Not Null Template Metadata metadata , @ Not Null Map < String , Object > args ) { for ( Parameter p : metadata . get Parameters ( ) ) { Object o = args . get ( p . id ) ; if ( o == null ) { continue ; } switch ( p . type ) { case STRING : if ( ! ( o instanceof String ) ) ... | private static void enforceParameterTypes ( @ NotNull TemplateMetadata metadata , @ NotNull Map < String , Object > args ) { for ( Parameter p : metadata . getParameters ( ) ) { Object o = args . get ( p . id ) ; if ( o == null ) { continue ; } switch ( p . type ) { case STRING : if ( ! ( o instanceof String ) ) { args... | 159 |
java-test-9952 | java | What does this function create when more than one selector is needed for a subscriber ? | the selector string | private String multiple Selector String ( int current Number , int individual Total , int total Number ) { Number Sequencer tmp Sequencer = new Number Sequencer ( total Number ) ; tmp Sequencer . set Current Number ( current Number ) ; String Builder selector String = new String Builder ( ) ; for ( int i = NUM ; i < in... | private String multipleSelectorString ( int currentNumber , int individualTotal , int totalNumber ) { NumberSequencer tmpSequencer = new NumberSequencer ( totalNumber ) ; tmpSequencer . setCurrentNumber ( currentNumber ) ; StringBuilder selectorString = new StringBuilder ( ) ; for ( int i = _NUM ; i < individualTotal ;... | 116 |
java-test-9953 | java | How is more than one selector needed when ? | for a subscriber | private String multiple Selector String ( int current Number , int individual Total , int total Number ) { Number Sequencer tmp Sequencer = new Number Sequencer ( total Number ) ; tmp Sequencer . set Current Number ( current Number ) ; String Builder selector String = new String Builder ( ) ; for ( int i = NUM ; i < in... | private String multipleSelectorString ( int currentNumber , int individualTotal , int totalNumber ) { NumberSequencer tmpSequencer = new NumberSequencer ( totalNumber ) ; tmpSequencer . setCurrentNumber ( currentNumber ) ; StringBuilder selectorString = new StringBuilder ( ) ; for ( int i = _NUM ; i < individualTotal ;... | 116 |
java-test-9954 | java | When does this function create the selector string ? | when more than one selector is needed for a subscriber | private String multiple Selector String ( int current Number , int individual Total , int total Number ) { Number Sequencer tmp Sequencer = new Number Sequencer ( total Number ) ; tmp Sequencer . set Current Number ( current Number ) ; String Builder selector String = new String Builder ( ) ; for ( int i = NUM ; i < in... | private String multipleSelectorString ( int currentNumber , int individualTotal , int totalNumber ) { NumberSequencer tmpSequencer = new NumberSequencer ( totalNumber ) ; tmpSequencer . setCurrentNumber ( currentNumber ) ; StringBuilder selectorString = new StringBuilder ( ) ; for ( int i = _NUM ; i < individualTotal ;... | 116 |
java-test-9955 | java | What does the code draw ? | the content of the hex view | private void draw Hex View ( final Graphics g ) { final int standard Size = NUM * get Character Width ( g ) ; final int first X = ( - m first Column * m char Width ) + m padding Hex Left + m offset View Width ; int x = first X ; int y = m padding Top ; boolean even Column = BOOL ; byte [ ] data = null ; int bytes To Dr... | private void drawHexView ( final Graphics g ) { final int standardSize = _NUM * getCharacterWidth ( g ) ; final int firstX = ( - m_firstColumn * m_charWidth ) + m_paddingHexLeft + m_offsetViewWidth ; int x = firstX ; int y = m_paddingTop ; boolean evenColumn = _BOOL ; byte [ ] data = null ; int bytesToDraw ; if ( m_sta... | 752 |
java-test-9958 | java | What does the code create ? | a new view of the relation | protected T new Instance ( final Class < ? extends T > cls , final I Index Manager index Manager , final NT nt , final Properties properties ) { if ( cls == null ) throw new Illegal Argument Exception ( ) ; if ( index Manager == null ) throw new Illegal Argument Exception ( ) ; if ( nt == null ) throw new Illegal Argum... | protected T newInstance ( final Class < ? extends T > cls , final IIndexManager indexManager , final NT nt , final Properties properties ) { if ( cls == null ) throw new IllegalArgumentException ( ) ; if ( indexManager == null ) throw new IllegalArgumentException ( ) ; if ( nt == null ) throw new IllegalArgumentExcepti... | 243 |
java-test-9960 | java | What do we have ? | what tile | protected Map Tile find Covering ( int zoom , long i , long j ) { while ( zoom > NUM ) { zoom -- ; i = i / NUM ; j = j / NUM ; Map Tile candidate = find Tile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | protected MapTile findCovering ( int zoom , long i , long j ) { while ( zoom > _NUM ) { zoom -- ; i = i / _NUM ; j = j / _NUM ; MapTile candidate = findTile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | 79 |
java-test-9961 | java | What covers the " nearest " lower - zoom tile ? | a specific tile | protected Map Tile find Covering ( int zoom , long i , long j ) { while ( zoom > NUM ) { zoom -- ; i = i / NUM ; j = j / NUM ; Map Tile candidate = find Tile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | protected MapTile findCovering ( int zoom , long i , long j ) { while ( zoom > _NUM ) { zoom -- ; i = i / _NUM ; j = j / _NUM ; MapTile candidate = findTile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | 79 |
java-test-9962 | java | What does the code find ? | the " nearest " lower - zoom tile that covers a specific tile . this is used to find out what tile we have to show while a new tile is still loading | protected Map Tile find Covering ( int zoom , long i , long j ) { while ( zoom > NUM ) { zoom -- ; i = i / NUM ; j = j / NUM ; Map Tile candidate = find Tile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | protected MapTile findCovering ( int zoom , long i , long j ) { while ( zoom > _NUM ) { zoom -- ; i = i / _NUM ; j = j / _NUM ; MapTile candidate = findTile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | 79 |
java-test-9963 | java | What does a specific tile cover ? | the " nearest " lower - zoom tile | protected Map Tile find Covering ( int zoom , long i , long j ) { while ( zoom > NUM ) { zoom -- ; i = i / NUM ; j = j / NUM ; Map Tile candidate = find Tile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | protected MapTile findCovering ( int zoom , long i , long j ) { while ( zoom > _NUM ) { zoom -- ; i = i / _NUM ; j = j / _NUM ; MapTile candidate = findTile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | 79 |
java-test-9964 | java | What is this used ? | to find out what tile we have to show while a new tile is still loading | protected Map Tile find Covering ( int zoom , long i , long j ) { while ( zoom > NUM ) { zoom -- ; i = i / NUM ; j = j / NUM ; Map Tile candidate = find Tile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | protected MapTile findCovering ( int zoom , long i , long j ) { while ( zoom > _NUM ) { zoom -- ; i = i / _NUM ; j = j / _NUM ; MapTile candidate = findTile ( zoom , i , j ) ; if ( ( candidate != null ) && ( ! candidate . loading ( ) ) ) { return candidate ; } } return null ; } | 79 |
java-test-9965 | java | How are two jsonobjects are equals ? | without enforcing field order | public static void json Objects Equals ( JSON Object o1 , JSON Object o2 ) throws JSON Exception { if ( o1 != o2 ) { if ( o1 . length ( ) != o2 . length ( ) ) { fail ( STRING + o1 . length ( ) + STRING + o2 . length ( ) ) ; } @ Suppress Warnings ( STRING ) Iterator < String > o1 Keys = o1 . keys ( ) ; while ( o1 Keys .... | public static void jsonObjectsEquals ( JSONObject o1 , JSONObject o2 ) throws JSONException { if ( o1 != o2 ) { if ( o1 . length ( ) != o2 . length ( ) ) { fail ( STRING + o1 . length ( ) + STRING + o2 . length ( ) ) ; } @ SuppressWarnings ( STRING ) Iterator < String > o1Keys = o1 . keys ( ) ; while ( o1Keys . hasNext... | 159 |
java-test-9968 | java | What does the code add to service sub - configuration ? | defaults values | public static void add Sub Config Attribute Default Values ( String service Name , Set sun Service ID , String realm , String sub Config Name , String attribute Name , Set default Values ) { String class Method = STRING ; try { Set old Val = new Hash Set ( ) ; Service Config Manager scm = get Service Config Manager ( s... | public static void addSubConfigAttributeDefaultValues ( String serviceName , Set sunServiceID , String realm , String subConfigName , String attributeName , Set defaultValues ) { String classMethod = STRING ; try { Set oldVal = new HashSet ( ) ; ServiceConfigManager scm = getServiceConfigManager ( serviceName ) ; Servi... | 213 |
java-test-9970 | java | What does not contain the match trail fully ? | the best trail match | public static List < String > find Best Trail Match ( List < List < String > > trails , List < String > match Trail , boolean contain Full Trail , boolean exact ) { List < String > best = null ; int part Matches = NUM ; for ( List < String > candidate Trail : trails ) { int candidate Part Matches = NUM ; Iterator < Str... | public static List < String > findBestTrailMatch ( List < List < String > > trails , List < String > matchTrail , boolean containFullTrail , boolean exact ) { List < String > best = null ; int partMatches = _NUM ; for ( List < String > candidateTrail : trails ) { int candidatePartMatches = _NUM ; Iterator < String > ca... | 272 |
java-test-9971 | java | What will this has return if false if false ? | the longest - path match found | public static List < String > find Best Trail Match ( List < List < String > > trails , List < String > match Trail , boolean contain Full Trail , boolean exact ) { List < String > best = null ; int part Matches = NUM ; for ( List < String > candidate Trail : trails ) { int candidate Part Matches = NUM ; Iterator < Str... | public static List < String > findBestTrailMatch ( List < List < String > > trails , List < String > matchTrail , boolean containFullTrail , boolean exact ) { List < String > best = null ; int partMatches = _NUM ; for ( List < String > candidateTrail : trails ) { int candidatePartMatches = _NUM ; Iterator < String > ca... | 272 |
java-test-9972 | java | What does the best trail match not contain fully ? | the match trail | public static List < String > find Best Trail Match ( List < List < String > > trails , List < String > match Trail , boolean contain Full Trail , boolean exact ) { List < String > best = null ; int part Matches = NUM ; for ( List < String > candidate Trail : trails ) { int candidate Part Matches = NUM ; Iterator < Str... | public static List < String > findBestTrailMatch ( List < List < String > > trails , List < String > matchTrail , boolean containFullTrail , boolean exact ) { List < String > best = null ; int partMatches = _NUM ; for ( List < String > candidateTrail : trails ) { int candidatePartMatches = _NUM ; Iterator < String > ca... | 272 |
java-test-9973 | java | When does exceptions handle ? | during program invocation | void unexpected Error Handling ( String message , final Throwable t ) { Throwable e = t ; while ( e . get Cause ( ) != null ) { e = e . get Cause ( ) ; } e . print Stack Trace ( ) ; if ( e instanceof Out Of Memory Error ) { Lone Option Dialog . show Message Dialog ( STRING + Client Game Configuration . get ( STRING ) +... | void unexpectedErrorHandling ( String message , final Throwable t ) { Throwable e = t ; while ( e . getCause ( ) != null ) { e = e . getCause ( ) ; } e . printStackTrace ( ) ; if ( e instanceof OutOfMemoryError ) { LoneOptionDialog . showMessageDialog ( STRING + ClientGameConfiguration . get ( STRING ) + STRING ) ; } e... | 211 |
java-test-9975 | java | How does the code draw the background of the highlighted register ? | in a different color than the standard background | private void draw Highlighted Register ( final Graphics g ) { if ( ! is Enabled ( ) ) { return ; } if ( m edited Register != - NUM ) { g . set Color ( m bg Color Edit ) ; final Rectangle r = get Register Bounds ( m edited Register ) ; g . fill Rect ( r . x , r . y , r . width , r . height ) ; } else if ( m highlighted ... | private void drawHighlightedRegister ( final Graphics g ) { if ( ! isEnabled ( ) ) { return ; } if ( m_editedRegister != - _NUM ) { g . setColor ( m_bgColorEdit ) ; final Rectangle r = getRegisterBounds ( m_editedRegister ) ; g . fillRect ( r . x , r . y , r . width , r . height ) ; } else if ( m_highlightedRegister !=... | 139 |
java-test-9976 | java | What does the code draw in a different color than the standard background ? | the background of the highlighted register | private void draw Highlighted Register ( final Graphics g ) { if ( ! is Enabled ( ) ) { return ; } if ( m edited Register != - NUM ) { g . set Color ( m bg Color Edit ) ; final Rectangle r = get Register Bounds ( m edited Register ) ; g . fill Rect ( r . x , r . y , r . width , r . height ) ; } else if ( m highlighted ... | private void drawHighlightedRegister ( final Graphics g ) { if ( ! isEnabled ( ) ) { return ; } if ( m_editedRegister != - _NUM ) { g . setColor ( m_bgColorEdit ) ; final Rectangle r = getRegisterBounds ( m_editedRegister ) ; g . fillRect ( r . x , r . y , r . width , r . height ) ; } else if ( m_highlightedRegister !=... | 139 |
java-test-9977 | java | What does the code drain into a new list normally using drainto ? | the task queue | private List < Runnable > drain Queue ( ) { Blocking Queue < Runnable > q = work Queue ; List < Runnable > task List = new Array List < Runnable > ( ) ; q . drain To ( task List ) ; if ( ! q . is Empty ( ) ) { for ( Runnable r : q . to Array ( new Runnable [ NUM ] ) ) { if ( q . remove ( r ) ) task List . add ( r ) ; }... | private List < Runnable > drainQueue ( ) { BlockingQueue < Runnable > q = workQueue ; List < Runnable > taskList = new ArrayList < Runnable > ( ) ; q . drainTo ( taskList ) ; if ( ! q . isEmpty ( ) ) { for ( Runnable r : q . toArray ( new Runnable [ _NUM ] ) ) { if ( q . remove ( r ) ) taskList . add ( r ) ; } } return... | 98 |
java-test-9978 | java | What may fail to remove some elements which ? | poll or drainto | private List < Runnable > drain Queue ( ) { Blocking Queue < Runnable > q = work Queue ; List < Runnable > task List = new Array List < Runnable > ( ) ; q . drain To ( task List ) ; if ( ! q . is Empty ( ) ) { for ( Runnable r : q . to Array ( new Runnable [ NUM ] ) ) { if ( q . remove ( r ) ) task List . add ( r ) ; }... | private List < Runnable > drainQueue ( ) { BlockingQueue < Runnable > q = workQueue ; List < Runnable > taskList = new ArrayList < Runnable > ( ) ; q . drainTo ( taskList ) ; if ( ! q . isEmpty ( ) ) { for ( Runnable r : q . toArray ( new Runnable [ _NUM ] ) ) { if ( q . remove ( r ) ) taskList . add ( r ) ; } } return... | 98 |
java-test-9979 | java | What may poll or drainto fail which ? | to remove some elements | private List < Runnable > drain Queue ( ) { Blocking Queue < Runnable > q = work Queue ; List < Runnable > task List = new Array List < Runnable > ( ) ; q . drain To ( task List ) ; if ( ! q . is Empty ( ) ) { for ( Runnable r : q . to Array ( new Runnable [ NUM ] ) ) { if ( q . remove ( r ) ) task List . add ( r ) ; }... | private List < Runnable > drainQueue ( ) { BlockingQueue < Runnable > q = workQueue ; List < Runnable > taskList = new ArrayList < Runnable > ( ) ; q . drainTo ( taskList ) ; if ( ! q . isEmpty ( ) ) { for ( Runnable r : q . toArray ( new Runnable [ _NUM ] ) ) { if ( q . remove ( r ) ) taskList . add ( r ) ; } } return... | 98 |
java-test-9980 | java | How does the code drain the task queue into a new list ? | normally using drainto | private List < Runnable > drain Queue ( ) { Blocking Queue < Runnable > q = work Queue ; List < Runnable > task List = new Array List < Runnable > ( ) ; q . drain To ( task List ) ; if ( ! q . is Empty ( ) ) { for ( Runnable r : q . to Array ( new Runnable [ NUM ] ) ) { if ( q . remove ( r ) ) task List . add ( r ) ; }... | private List < Runnable > drainQueue ( ) { BlockingQueue < Runnable > q = workQueue ; List < Runnable > taskList = new ArrayList < Runnable > ( ) ; q . drainTo ( taskList ) ; if ( ! q . isEmpty ( ) ) { for ( Runnable r : q . toArray ( new Runnable [ _NUM ] ) ) { if ( q . remove ( r ) ) taskList . add ( r ) ; } } return... | 98 |
java-test-9981 | java | What does the code use normally ? | drainto | private List < Runnable > drain Queue ( ) { Blocking Queue < Runnable > q = work Queue ; List < Runnable > task List = new Array List < Runnable > ( ) ; q . drain To ( task List ) ; if ( ! q . is Empty ( ) ) { for ( Runnable r : q . to Array ( new Runnable [ NUM ] ) ) { if ( q . remove ( r ) ) task List . add ( r ) ; }... | private List < Runnable > drainQueue ( ) { BlockingQueue < Runnable > q = workQueue ; List < Runnable > taskList = new ArrayList < Runnable > ( ) ; q . drainTo ( taskList ) ; if ( ! q . isEmpty ( ) ) { for ( Runnable r : q . toArray ( new Runnable [ _NUM ] ) ) { if ( q . remove ( r ) ) taskList . add ( r ) ; } } return... | 98 |
java-test-9982 | java | For what purpose have we stripped how much newline and margin whitespace ? | so we know how to offset anchors | Map < Integer , Integer > stripped Whitespace Up To Column ( String intro ) { Map < Integer , Integer > stripped = new Tree Map < > ( ) ; boolean counting Whitespace = BOOL ; int col = NUM ; int count = NUM ; for ( char c : intro . to Char Array ( ) ) { if ( c == STRING && ! counting Whitespace ) { counting Whitespace ... | Map < Integer , Integer > strippedWhitespaceUpToColumn ( String intro ) { Map < Integer , Integer > stripped = new TreeMap < > ( ) ; boolean countingWhitespace = _BOOL ; int col = _NUM ; int count = _NUM ; for ( char c : intro . toCharArray ( ) ) { if ( c == STRING && ! countingWhitespace ) { countingWhitespace = _BOOL... | 123 |
java-test-9983 | java | What do we offset how ? | anchors | Map < Integer , Integer > stripped Whitespace Up To Column ( String intro ) { Map < Integer , Integer > stripped = new Tree Map < > ( ) ; boolean counting Whitespace = BOOL ; int col = NUM ; int count = NUM ; for ( char c : intro . to Char Array ( ) ) { if ( c == STRING && ! counting Whitespace ) { counting Whitespace ... | Map < Integer , Integer > strippedWhitespaceUpToColumn ( String intro ) { Map < Integer , Integer > stripped = new TreeMap < > ( ) ; boolean countingWhitespace = _BOOL ; int col = _NUM ; int count = _NUM ; for ( char c : intro . toCharArray ( ) ) { if ( c == STRING && ! countingWhitespace ) { countingWhitespace = _BOOL... | 123 |
java-test-9984 | java | What did we know ? | how to offset anchors | Map < Integer , Integer > stripped Whitespace Up To Column ( String intro ) { Map < Integer , Integer > stripped = new Tree Map < > ( ) ; boolean counting Whitespace = BOOL ; int col = NUM ; int count = NUM ; for ( char c : intro . to Char Array ( ) ) { if ( c == STRING && ! counting Whitespace ) { counting Whitespace ... | Map < Integer , Integer > strippedWhitespaceUpToColumn ( String intro ) { Map < Integer , Integer > stripped = new TreeMap < > ( ) ; boolean countingWhitespace = _BOOL ; int col = _NUM ; int count = _NUM ; for ( char c : intro . toCharArray ( ) ) { if ( c == STRING && ! countingWhitespace ) { countingWhitespace = _BOOL... | 123 |
java-test-9985 | java | What have we stripped so we know how to offset anchors ? | how much newline and margin whitespace | Map < Integer , Integer > stripped Whitespace Up To Column ( String intro ) { Map < Integer , Integer > stripped = new Tree Map < > ( ) ; boolean counting Whitespace = BOOL ; int col = NUM ; int count = NUM ; for ( char c : intro . to Char Array ( ) ) { if ( c == STRING && ! counting Whitespace ) { counting Whitespace ... | Map < Integer , Integer > strippedWhitespaceUpToColumn ( String intro ) { Map < Integer , Integer > stripped = new TreeMap < > ( ) ; boolean countingWhitespace = _BOOL ; int col = _NUM ; int count = _NUM ; for ( char c : intro . toCharArray ( ) ) { if ( c == STRING && ! countingWhitespace ) { countingWhitespace = _BOOL... | 123 |
java-test-9986 | java | What does the code stitch to initialize type ( usually a call to inittypeproto ) ? | a snippet of code | boolean stitch Initializer ( Type Declaration d ) { final Virtual File f = compiler . get Stitched File ( d , STRING ) ; if ( f != null && f . exists ( ) ) { jsout . output File ( f ) ; return BOOL ; } return BOOL ; } | boolean stitchInitializer ( TypeDeclaration d ) { final VirtualFile f = compiler . getStitchedFile ( d , STRING ) ; if ( f != null && f . exists ( ) ) { jsout . outputFile ( f ) ; return _BOOL ; } return _BOOL ; } | 54 |
java-test-9987 | java | What does the code stitch a snippet of code ? | to initialize type ( usually a call to inittypeproto ) | boolean stitch Initializer ( Type Declaration d ) { final Virtual File f = compiler . get Stitched File ( d , STRING ) ; if ( f != null && f . exists ( ) ) { jsout . output File ( f ) ; return BOOL ; } return BOOL ; } | boolean stitchInitializer ( TypeDeclaration d ) { final VirtualFile f = compiler . getStitchedFile ( d , STRING ) ; if ( f != null && f . exists ( ) ) { jsout . outputFile ( f ) ; return _BOOL ; } return _BOOL ; } | 54 |
java-test-9988 | java | In which direction do pending output write ? | into file | public void flush ( ) throws Exception { if ( writing Channel != null ) { sequential File . position ( NUM ) ; writing Channel . writer Index ( writing Channel . capacity ( ) ) ; sequential File . write Direct ( writing Channel . to Byte Buffer ( ) , BOOL ) ; sequential File . close ( ) ; new Data Files . add ( current... | public void flush ( ) throws Exception { if ( writingChannel != null ) { sequentialFile . position ( _NUM ) ; writingChannel . writerIndex ( writingChannel . capacity ( ) ) ; sequentialFile . writeDirect ( writingChannel . toByteBuffer ( ) , _BOOL ) ; sequentialFile . close ( ) ; newDataFiles . add ( currentFile ) ; } ... | 80 |
java-test-9993 | java | What does the code append ? | a new column heading to the header row | public void append Heading ( Localizable Message value ) { header . add ( value ) ; if ( header . size ( ) > width ) { width = header . size ( ) ; column Widths . add ( value . length ( ) ) ; } else if ( column Widths . get ( header . size ( ) - NUM ) < value . length ( ) ) { column Widths . set ( header . size ( ) - N... | public void appendHeading ( LocalizableMessage value ) { header . add ( value ) ; if ( header . size ( ) > width ) { width = header . size ( ) ; columnWidths . add ( value . length ( ) ) ; } else if ( columnWidths . get ( header . size ( ) - _NUM ) < value . length ( ) ) { columnWidths . set ( header . size ( ) - _NUM ... | 95 |
java-test-9999 | java | What does the code make ? | the specified path relative to the specified base path | public static String make Relative ( final String path , final String base ) { if ( path . starts With ( STRING ) ) { return path ; } else { final int last Slash = base . last Index Of ( STRING ) ; if ( last Slash >= NUM ) { return base . substring ( NUM , last Slash + NUM ) + path ; } else { return path ; } } } | public static String makeRelative ( final String path , final String base ) { if ( path . startsWith ( STRING ) ) { return path ; } else { final int lastSlash = base . lastIndexOf ( STRING ) ; if ( lastSlash >= _NUM ) { return base . substring ( _NUM , lastSlash + _NUM ) + path ; } else { return path ; } } } | 78 |
java-test-10003 | java | What does the code compute ? | the distance matrix of a vector column | protected double [ ] [ ] compute Distance Matrix ( final List < I > col ) { final int size = col . size ( ) ; double [ ] [ ] imat = new double [ size ] [ size ] ; boolean squared = dist instanceof Squared Euclidean Distance Function ; Finite Progress dprog = LOG . is Verbose ( ) ? new Finite Progress ( STRING , ( size ... | protected double [ ] [ ] computeDistanceMatrix ( final List < I > col ) { final int size = col . size ( ) ; double [ ] [ ] imat = new double [ size ] [ size ] ; boolean squared = dist instanceof SquaredEuclideanDistanceFunction ; FiniteProgress dprog = LOG . isVerbose ( ) ? new FiniteProgress ( STRING , ( size * ( size... | 235 |
java-test-10004 | java | What is assuming a fixed width and no bounds on the height ? | the content for this title | @ Override protected Size 2 D arrange FN ( Graphics 2 D g2 , double w ) { g2 . set Font ( get Font ( ) ) ; Font Metrics fm = g2 . get Font Metrics ( get Font ( ) ) ; Rectangle 2 D bounds = Text Utilities . get Text Bounds ( get Text ( ) , g2 , fm ) ; if ( bounds . get Width ( ) <= w ) { return new Size 2 D ( w , bounds... | @ Override protected Size2D arrangeFN ( Graphics2D g2 , double w ) { g2 . setFont ( getFont ( ) ) ; FontMetrics fm = g2 . getFontMetrics ( getFont ( ) ) ; Rectangle2D bounds = TextUtilities . getTextBounds ( getText ( ) , g2 , fm ) ; if ( bounds . getWidth ( ) <= w ) { return new Size2D ( w , bounds . getHeight ( ) ) ;... | 111 |
java-test-10005 | java | What do the content for this title assume ? | a fixed width and no bounds on the height | @ Override protected Size 2 D arrange FN ( Graphics 2 D g2 , double w ) { g2 . set Font ( get Font ( ) ) ; Font Metrics fm = g2 . get Font Metrics ( get Font ( ) ) ; Rectangle 2 D bounds = Text Utilities . get Text Bounds ( get Text ( ) , g2 , fm ) ; if ( bounds . get Width ( ) <= w ) { return new Size 2 D ( w , bounds... | @ Override protected Size2D arrangeFN ( Graphics2D g2 , double w ) { g2 . setFont ( getFont ( ) ) ; FontMetrics fm = g2 . getFontMetrics ( getFont ( ) ) ; Rectangle2D bounds = TextUtilities . getTextBounds ( getText ( ) , g2 , fm ) ; if ( bounds . getWidth ( ) <= w ) { return new Size2D ( w , bounds . getHeight ( ) ) ;... | 111 |
java-test-10006 | java | What does the code arrange ? | the content for this title assuming a fixed width and no bounds on the height | @ Override protected Size 2 D arrange FN ( Graphics 2 D g2 , double w ) { g2 . set Font ( get Font ( ) ) ; Font Metrics fm = g2 . get Font Metrics ( get Font ( ) ) ; Rectangle 2 D bounds = Text Utilities . get Text Bounds ( get Text ( ) , g2 , fm ) ; if ( bounds . get Width ( ) <= w ) { return new Size 2 D ( w , bounds... | @ Override protected Size2D arrangeFN ( Graphics2D g2 , double w ) { g2 . setFont ( getFont ( ) ) ; FontMetrics fm = g2 . getFontMetrics ( getFont ( ) ) ; Rectangle2D bounds = TextUtilities . getTextBounds ( getText ( ) , g2 , fm ) ; if ( bounds . getWidth ( ) <= w ) { return new Size2D ( w , bounds . getHeight ( ) ) ;... | 111 |
java-test-10007 | java | What will main orchestration method compare together ? | two raml models | private void validate ( ) { if ( checkers != null ) { for ( Raml Checker checker : checkers ) { Pair < Set < Issue > , Set < Issue > > check = checker . check ( published , implemented ) ; warnings . add All ( check . get First ( ) ) ; errors . add All ( check . get Second ( ) ) ; } } } | private void validate ( ) { if ( checkers != null ) { for ( RamlChecker checker : checkers ) { Pair < Set < Issue > , Set < Issue > > check = checker . check ( published , implemented ) ; warnings . addAll ( check . getFirst ( ) ) ; errors . addAll ( check . getSecond ( ) ) ; } } } | 74 |
java-test-10008 | java | What do main orchestration method identify ? | discrepancies between the implementation and contract | private void validate ( ) { if ( checkers != null ) { for ( Raml Checker checker : checkers ) { Pair < Set < Issue > , Set < Issue > > check = checker . check ( published , implemented ) ; warnings . add All ( check . get First ( ) ) ; errors . add All ( check . get Second ( ) ) ; } } } | private void validate ( ) { if ( checkers != null ) { for ( RamlChecker checker : checkers ) { Pair < Set < Issue > , Set < Issue > > check = checker . check ( published , implemented ) ; warnings . addAll ( check . getFirst ( ) ) ; errors . addAll ( check . getSecond ( ) ) ; } } } | 74 |
java-test-10010 | java | What do you invoke explicitly ? | the lookahead procedure | public void maybe Look Ahead ( ) { lock . lock ( ) ; try { List < Deterministic Key > keys = maybe Look Ahead ( external Parent Key , issued External Keys ) ; keys . add All ( maybe Look Ahead ( internal Parent Key , issued Internal Keys ) ) ; if ( keys . is Empty ( ) ) return ; key Lookahead Epoch ++ ; basic Key Chain... | public void maybeLookAhead ( ) { lock . lock ( ) ; try { List < DeterministicKey > keys = maybeLookAhead ( externalParentKey , issuedExternalKeys ) ; keys . addAll ( maybeLookAhead ( internalParentKey , issuedInternalKeys ) ) ; if ( keys . isEmpty ( ) ) return ; keyLookaheadEpoch ++ ; basicKeyChain . importKeys ( keys ... | 92 |
java-test-10011 | java | Why s it s normally unnecessary ? | as it will be done automatically when needed | public void maybe Look Ahead ( ) { lock . lock ( ) ; try { List < Deterministic Key > keys = maybe Look Ahead ( external Parent Key , issued External Keys ) ; keys . add All ( maybe Look Ahead ( internal Parent Key , issued Internal Keys ) ) ; if ( keys . is Empty ( ) ) return ; key Lookahead Epoch ++ ; basic Key Chain... | public void maybeLookAhead ( ) { lock . lock ( ) ; try { List < DeterministicKey > keys = maybeLookAhead ( externalParentKey , issuedExternalKeys ) ; keys . addAll ( maybeLookAhead ( internalParentKey , issuedInternalKeys ) ) ; if ( keys . isEmpty ( ) ) return ; keyLookaheadEpoch ++ ; basicKeyChain . importKeys ( keys ... | 92 |
java-test-10012 | java | What do you need ? | to explicitly invoke the lookahead procedure | public void maybe Look Ahead ( ) { lock . lock ( ) ; try { List < Deterministic Key > keys = maybe Look Ahead ( external Parent Key , issued External Keys ) ; keys . add All ( maybe Look Ahead ( internal Parent Key , issued Internal Keys ) ) ; if ( keys . is Empty ( ) ) return ; key Lookahead Epoch ++ ; basic Key Chain... | public void maybeLookAhead ( ) { lock . lock ( ) ; try { List < DeterministicKey > keys = maybeLookAhead ( externalParentKey , issuedExternalKeys ) ; keys . addAll ( maybeLookAhead ( internalParentKey , issuedInternalKeys ) ) ; if ( keys . isEmpty ( ) ) return ; keyLookaheadEpoch ++ ; basicKeyChain . importKeys ( keys ... | 92 |
java-test-10014 | java | What does the code find ? | the length of header inside bs | @ Suppress Warnings ( STRING ) private int find Header End ( byte [ ] bs ) { boolean newline = BOOL ; int len = bs . length ; for ( int i = NUM ; i < len ; i ++ ) { switch ( bs [ i ] ) { case STRING : if ( i < len - NUM && bs [ i + NUM ] == STRING ) i ++ ; case STRING : if ( newline ) return i + NUM ; newline = BOOL ; ... | @ SuppressWarnings ( STRING ) private int findHeaderEnd ( byte [ ] bs ) { boolean newline = _BOOL ; int len = bs . length ; for ( int i = _NUM ; i < len ; i ++ ) { switch ( bs [ i ] ) { case STRING : if ( i < len - _NUM && bs [ i + _NUM ] == STRING ) i ++ ; case STRING : if ( newline ) return i + _NUM ; newline = _BOOL... | 106 |
java-test-10015 | java | What does it load the appropriate streaminfo object then ? | the other extracted data like status , game , viewercount | private Stream Info parse Stream ( JSON Object stream , boolean follows ) { if ( stream == null ) { LOGGER . warning ( STRING ) ; return null ; } Number viewers Temp ; String status ; String game ; String name ; String display name ; long time Started = - NUM ; long user Id = - NUM ; boolean no Channel Object = BOOL ; ... | private StreamInfo parseStream ( JSONObject stream , boolean follows ) { if ( stream == null ) { LOGGER . warning ( STRING ) ; return null ; } Number viewersTemp ; String status ; String game ; String name ; String display_name ; long timeStarted = - _NUM ; long userId = - _NUM ; boolean noChannelObject = _BOOL ; try {... | 492 |
java-test-10016 | java | What does this get ? | the appropriate streaminfo object , in which it then loads the other extracted data like status , game , viewercount . | private Stream Info parse Stream ( JSON Object stream , boolean follows ) { if ( stream == null ) { LOGGER . warning ( STRING ) ; return null ; } Number viewers Temp ; String status ; String game ; String name ; String display name ; long time Started = - NUM ; long user Id = - NUM ; boolean no Channel Object = BOOL ; ... | private StreamInfo parseStream ( JSONObject stream , boolean follows ) { if ( stream == null ) { LOGGER . warning ( STRING ) ; return null ; } Number viewersTemp ; String status ; String game ; String name ; String display_name ; long timeStarted = - _NUM ; long userId = - _NUM ; boolean noChannelObject = _BOOL ; try {... | 492 |
java-test-10017 | java | Where does it load the other extracted data like status , game , viewercount then ? | the appropriate streaminfo object | private Stream Info parse Stream ( JSON Object stream , boolean follows ) { if ( stream == null ) { LOGGER . warning ( STRING ) ; return null ; } Number viewers Temp ; String status ; String game ; String name ; String display name ; long time Started = - NUM ; long user Id = - NUM ; boolean no Channel Object = BOOL ; ... | private StreamInfo parseStream ( JSONObject stream , boolean follows ) { if ( stream == null ) { LOGGER . warning ( STRING ) ; return null ; } Number viewersTemp ; String status ; String game ; String name ; String display_name ; long timeStarted = - _NUM ; long userId = - _NUM ; boolean noChannelObject = _BOOL ; try {... | 492 |
java-test-10018 | java | In which direction do forwards collection carry to ? | from the old property | private Set < Eg Demand Details > carry Forward Collection ( final Property new Property , final Installment inst , final Set < Eg Demand Details > new Eg Demand Details Set , final Ptdemand pt Dmnd Old , final Property Type Master old Prop Type Master , final Property Type Master new Prop Type Master ) { LOGGER . debu... | private Set < EgDemandDetails > carryForwardCollection ( final Property newProperty , final Installment inst , final Set < EgDemandDetails > newEgDemandDetailsSet , final Ptdemand ptDmndOld , final PropertyTypeMaster oldPropTypeMaster , final PropertyTypeMaster newPropTypeMaster ) { LOGGER . debug ( STRING ) ; LOGGER .... | 475 |
java-test-10022 | java | What did convenience method use ? | to capitalize a one - off attribute value before it is returned | String capitalize ( String value ) { char [ ] chars ; int i ; chars = value . to Char Array ( ) ; if ( chars . length > NUM ) { chars [ NUM ] = Character . to Upper Case ( chars [ NUM ] ) ; for ( i = NUM ; i < chars . length ; ++ i ) { chars [ i ] = Character . to Lower Case ( chars [ i ] ) ; } return String . value Of... | String capitalize ( String value ) { char [ ] chars ; int i ; chars = value . toCharArray ( ) ; if ( chars . length > _NUM ) { chars [ _NUM ] = Character . toUpperCase ( chars [ _NUM ] ) ; for ( i = _NUM ; i < chars . length ; ++ i ) { chars [ i ] = Character . toLowerCase ( chars [ i ] ) ; } return String . valueOf ( ... | 99 |
java-test-10023 | java | When did a one - off attribute value capitalize ? | before it is returned | String capitalize ( String value ) { char [ ] chars ; int i ; chars = value . to Char Array ( ) ; if ( chars . length > NUM ) { chars [ NUM ] = Character . to Upper Case ( chars [ NUM ] ) ; for ( i = NUM ; i < chars . length ; ++ i ) { chars [ i ] = Character . to Lower Case ( chars [ i ] ) ; } return String . value Of... | String capitalize ( String value ) { char [ ] chars ; int i ; chars = value . toCharArray ( ) ; if ( chars . length > _NUM ) { chars [ _NUM ] = Character . toUpperCase ( chars [ _NUM ] ) ; for ( i = _NUM ; i < chars . length ; ++ i ) { chars [ i ] = Character . toLowerCase ( chars [ i ] ) ; } return String . valueOf ( ... | 99 |
java-test-10024 | java | When could that 2 recorded events have the same time . in that case it is not possible to recognize order have happen ? | sometime | public static void increase Time ( Clock clock ) { Calendar c = Calendar . get Instance ( ) ; c . set Time ( clock . get Current Time ( ) ) ; c . add ( Calendar . SECOND , NUM ) ; clock . set Current Time ( c . get Time ( ) ) ; } | public static void increaseTime ( Clock clock ) { Calendar c = Calendar . getInstance ( ) ; c . setTime ( clock . getCurrentTime ( ) ) ; c . add ( Calendar . SECOND , _NUM ) ; clock . setCurrentTime ( c . getTime ( ) ) ; } | 60 |
java-test-10025 | java | What have the same time ? | 2 recorded events | public static void increase Time ( Clock clock ) { Calendar c = Calendar . get Instance ( ) ; c . set Time ( clock . get Current Time ( ) ) ; c . add ( Calendar . SECOND , NUM ) ; clock . set Current Time ( c . get Time ( ) ) ; } | public static void increaseTime ( Clock clock ) { Calendar c = Calendar . getInstance ( ) ; c . setTime ( clock . getCurrentTime ( ) ) ; c . add ( Calendar . SECOND , _NUM ) ; clock . setCurrentTime ( c . getTime ( ) ) ; } | 60 |
java-test-10026 | java | What connects to server ' s application via given port ? | rtmp client | public void connect ( String server , int port , Map < String , Object > connection Params , I Pending Service Callback connect Callback , Object [ ] connect Call Arguments ) { log . debug ( STRING , new Object [ ] { server , port , connection Params , connect Callback , Arrays . to String ( connect Call Arguments ) } ... | public void connect ( String server , int port , Map < String , Object > connectionParams , IPendingServiceCallback connectCallback , Object [ ] connectCallArguments ) { log . debug ( STRING , new Object [ ] { server , port , connectionParams , connectCallback , Arrays . toString ( connectCallArguments ) } ) ; log . in... | 152 |
java-test-10027 | java | How do rtmp client connect to server ' s application ? | via given port | public void connect ( String server , int port , Map < String , Object > connection Params , I Pending Service Callback connect Callback , Object [ ] connect Call Arguments ) { log . debug ( STRING , new Object [ ] { server , port , connection Params , connect Callback , Arrays . to String ( connect Call Arguments ) } ... | public void connect ( String server , int port , Map < String , Object > connectionParams , IPendingServiceCallback connectCallback , Object [ ] connectCallArguments ) { log . debug ( STRING , new Object [ ] { server , port , connectionParams , connectCallback , Arrays . toString ( connectCallArguments ) } ) ; log . in... | 152 |
java-test-10028 | java | What do rtmp client connect via given port ? | to server ' s application | public void connect ( String server , int port , Map < String , Object > connection Params , I Pending Service Callback connect Callback , Object [ ] connect Call Arguments ) { log . debug ( STRING , new Object [ ] { server , port , connection Params , connect Callback , Arrays . to String ( connect Call Arguments ) } ... | public void connect ( String server , int port , Map < String , Object > connectionParams , IPendingServiceCallback connectCallback , Object [ ] connectCallArguments ) { log . debug ( STRING , new Object [ ] { server , port , connectionParams , connectCallback , Arrays . toString ( connectCallArguments ) } ) ; log . in... | 152 |
java-test-10032 | java | What does the code validate ? | the syntax port | public static void validate Open Port ( String port , Application application ) throws Check Exception { try { Integer . parse Int ( port ) ; } catch ( Number Format Exception e ) { String message Translated = message Source . get Message ( STRING , null , Locale . ENGLISH ) ; throw new Check Exception ( message Transl... | public static void validateOpenPort ( String port , Application application ) throws CheckException { try { Integer . parseInt ( port ) ; } catch ( NumberFormatException e ) { String messageTranslated = messageSource . getMessage ( STRING , null , Locale . ENGLISH ) ; throw new CheckException ( messageTranslated + STRI... | 116 |
java-test-10033 | java | What converts to a java class name ? | a file name | public static String convert To Java Class Name ( String name ) { int dot Index = name . index Of ( STRING ) ; if ( dot Index >= NUM ) { name = name . substring ( NUM , dot Index ) ; } String [ ] split = name . split ( STRING ) ; String Builder out = new String Builder ( ) ; for ( String section : split ) { out . appen... | public static String convertToJavaClassName ( String name ) { int dotIndex = name . indexOf ( STRING ) ; if ( dotIndex >= _NUM ) { name = name . substring ( _NUM , dotIndex ) ; } String [ ] split = name . split ( STRING ) ; StringBuilder out = new StringBuilder ( ) ; for ( String section : split ) { out . append ( Stri... | 99 |
java-test-10034 | java | What does utility method implement to convert a file name to a java class name ? | data binding ' s logic | public static String convert To Java Class Name ( String name ) { int dot Index = name . index Of ( STRING ) ; if ( dot Index >= NUM ) { name = name . substring ( NUM , dot Index ) ; } String [ ] split = name . split ( STRING ) ; String Builder out = new String Builder ( ) ; for ( String section : split ) { out . appen... | public static String convertToJavaClassName ( String name ) { int dotIndex = name . indexOf ( STRING ) ; if ( dotIndex >= _NUM ) { name = name . substring ( _NUM , dotIndex ) ; } String [ ] split = name . split ( STRING ) ; StringBuilder out = new StringBuilder ( ) ; for ( String section : split ) { out . append ( Stri... | 99 |
java-test-10035 | java | For what purpose does utility method implement data binding ' s logic ? | to convert a file name to a java class name | public static String convert To Java Class Name ( String name ) { int dot Index = name . index Of ( STRING ) ; if ( dot Index >= NUM ) { name = name . substring ( NUM , dot Index ) ; } String [ ] split = name . split ( STRING ) ; String Builder out = new String Builder ( ) ; for ( String section : split ) { out . appen... | public static String convertToJavaClassName ( String name ) { int dotIndex = name . indexOf ( STRING ) ; if ( dotIndex >= _NUM ) { name = name . substring ( _NUM , dotIndex ) ; } String [ ] split = name . split ( STRING ) ; StringBuilder out = new StringBuilder ( ) ; for ( String section : split ) { out . append ( Stri... | 99 |
java-test-10036 | java | What do a file name convert ? | to a java class name | public static String convert To Java Class Name ( String name ) { int dot Index = name . index Of ( STRING ) ; if ( dot Index >= NUM ) { name = name . substring ( NUM , dot Index ) ; } String [ ] split = name . split ( STRING ) ; String Builder out = new String Builder ( ) ; for ( String section : split ) { out . appen... | public static String convertToJavaClassName ( String name ) { int dotIndex = name . indexOf ( STRING ) ; if ( dotIndex >= _NUM ) { name = name . substring ( _NUM , dotIndex ) ; } String [ ] split = name . split ( STRING ) ; StringBuilder out = new StringBuilder ( ) ; for ( String section : split ) { out . append ( Stri... | 99 |
java-test-10037 | java | What does this method use same as uuid ? | securerandom | public static String url Safe String ( final int num Bits ) { Secure Random ng = Holder . number Generator ; String Builder sb = new String Builder ( NUM + ( num Bits / NUM ) ) ; for ( int i = num Bits ; i > NUM ; i -= NUM ) { sb . append ( base 64 URL [ ng . next Int ( i > NUM ? NUM : ( NUM << i ) ) ] ) ; } return sb ... | public static String urlSafeString ( final int numBits ) { SecureRandom ng = Holder . numberGenerator ; StringBuilder sb = new StringBuilder ( _NUM + ( numBits / _NUM ) ) ; for ( int i = numBits ; i > _NUM ; i -= _NUM ) { sb . append ( base64URL [ ng . nextInt ( i > _NUM ? _NUM : ( _NUM << i ) ) ] ) ; } return sb . toS... | 95 |
java-test-10038 | java | How does the code generate a string ? | using base64 url safe characters with numbits bits | public static String url Safe String ( final int num Bits ) { Secure Random ng = Holder . number Generator ; String Builder sb = new String Builder ( NUM + ( num Bits / NUM ) ) ; for ( int i = num Bits ; i > NUM ; i -= NUM ) { sb . append ( base 64 URL [ ng . next Int ( i > NUM ? NUM : ( NUM << i ) ) ] ) ; } return sb ... | public static String urlSafeString ( final int numBits ) { SecureRandom ng = Holder . numberGenerator ; StringBuilder sb = new StringBuilder ( _NUM + ( numBits / _NUM ) ) ; for ( int i = numBits ; i > _NUM ; i -= _NUM ) { sb . append ( base64URL [ ng . nextInt ( i > _NUM ? _NUM : ( _NUM << i ) ) ] ) ; } return sb . toS... | 95 |
java-test-10039 | java | How does this method use securerandom ? | same as uuid | public static String url Safe String ( final int num Bits ) { Secure Random ng = Holder . number Generator ; String Builder sb = new String Builder ( NUM + ( num Bits / NUM ) ) ; for ( int i = num Bits ; i > NUM ; i -= NUM ) { sb . append ( base 64 URL [ ng . next Int ( i > NUM ? NUM : ( NUM << i ) ) ] ) ; } return sb ... | public static String urlSafeString ( final int numBits ) { SecureRandom ng = Holder . numberGenerator ; StringBuilder sb = new StringBuilder ( _NUM + ( numBits / _NUM ) ) ; for ( int i = numBits ; i > _NUM ; i -= _NUM ) { sb . append ( base64URL [ ng . nextInt ( i > _NUM ? _NUM : ( _NUM << i ) ) ] ) ; } return sb . toS... | 95 |
java-test-10040 | java | What does the code reinitialize ? | the datasets | public void import Data ( final File the File ) { try { CSV Parser the Parser = new CSV Parser ( new File Input Stream ( the File ) , STRING , STRING , STRING ) ; String [ ] [ ] values = the Parser . get All Values ( ) ; String [ ] line ; double [ ] vector ; int dimension = values [ NUM ] . length ; init ( dimension ) ... | public void importData ( final File theFile ) { try { CSVParser theParser = new CSVParser ( new FileInputStream ( theFile ) , STRING , STRING , STRING ) ; String [ ] [ ] values = theParser . getAllValues ( ) ; String [ ] line ; double [ ] vector ; int dimension = values [ _NUM ] . length ; init ( dimension ) ; for ( in... | 202 |
java-test-10041 | java | What does the code add ? | new high - d datapoints | public void import Data ( final File the File ) { try { CSV Parser the Parser = new CSV Parser ( new File Input Stream ( the File ) , STRING , STRING , STRING ) ; String [ ] [ ] values = the Parser . get All Values ( ) ; String [ ] line ; double [ ] vector ; int dimension = values [ NUM ] . length ; init ( dimension ) ... | public void importData ( final File theFile ) { try { CSVParser theParser = new CSVParser ( new FileInputStream ( theFile ) , STRING , STRING , STRING ) ; String [ ] [ ] values = theParser . getAllValues ( ) ; String [ ] line ; double [ ] vector ; int dimension = values [ _NUM ] . length ; init ( dimension ) ; for ( in... | 202 |
java-test-10042 | java | How does the code run all these tests ? | in both marshaling and non - marshaling mode | public void init Combos ( ) { add Combination Values ( STRING , new Object [ ] { STRING , STRING } ) ; add Combination Values ( STRING , new Object [ ] { Integer . value Of ( Delivery Mode . NON PERSISTENT ) , Integer . value Of ( Delivery Mode . PERSISTENT ) } ) ; add Combination Values ( STRING , new Object [ ] { Byt... | public void initCombos ( ) { addCombinationValues ( STRING , new Object [ ] { STRING , STRING } ) ; addCombinationValues ( STRING , new Object [ ] { Integer . valueOf ( DeliveryMode . NON_PERSISTENT ) , Integer . valueOf ( DeliveryMode . PERSISTENT ) } ) ; addCombinationValues ( STRING , new Object [ ] { Byte . valueOf... | 87 |
java-test-10043 | java | What does the code run in both marshaling and non - marshaling mode ? | all these tests | public void init Combos ( ) { add Combination Values ( STRING , new Object [ ] { STRING , STRING } ) ; add Combination Values ( STRING , new Object [ ] { Integer . value Of ( Delivery Mode . NON PERSISTENT ) , Integer . value Of ( Delivery Mode . PERSISTENT ) } ) ; add Combination Values ( STRING , new Object [ ] { Byt... | public void initCombos ( ) { addCombinationValues ( STRING , new Object [ ] { STRING , STRING } ) ; addCombinationValues ( STRING , new Object [ ] { Integer . valueOf ( DeliveryMode . NON_PERSISTENT ) , Integer . valueOf ( DeliveryMode . PERSISTENT ) } ) ; addCombinationValues ( STRING , new Object [ ] { Byte . valueOf... | 87 |
java-test-10045 | java | For what purpose is that the dm has been shut down before calling this step essential ? | to ensure that no new listeners are registering | private void do Shutdown Listeners ( Hash Set shutdown Listeners ) { if ( shutdown Listeners == null ) { return ; } Iterator it = shutdown Listeners . iterator ( ) ; while ( it . has Next ( ) ) { Shutdown Listener s = ( Shutdown Listener ) it . next ( ) ; try { s . on Shutdown ( this ) ; } catch ( Virtual Machine Error... | private void doShutdownListeners ( HashSet shutdownListeners ) { if ( shutdownListeners == null ) { return ; } Iterator it = shutdownListeners . iterator ( ) ; while ( it . hasNext ( ) ) { ShutdownListener s = ( ShutdownListener ) it . next ( ) ; try { s . onShutdown ( this ) ; } catch ( VirtualMachineError err ) { Sys... | 313 |
java-test-10046 | java | When has the dm been shut ? | before calling this step | private void do Shutdown Listeners ( Hash Set shutdown Listeners ) { if ( shutdown Listeners == null ) { return ; } Iterator it = shutdown Listeners . iterator ( ) ; while ( it . has Next ( ) ) { Shutdown Listener s = ( Shutdown Listener ) it . next ( ) ; try { s . on Shutdown ( this ) ; } catch ( Virtual Machine Error... | private void doShutdownListeners ( HashSet shutdownListeners ) { if ( shutdownListeners == null ) { return ; } Iterator it = shutdownListeners . iterator ( ) ; while ( it . hasNext ( ) ) { ShutdownListener s = ( ShutdownListener ) it . next ( ) ; try { s . onShutdown ( this ) ; } catch ( VirtualMachineError err ) { Sys... | 313 |
java-test-10047 | java | What does the code add into the sum for the current prediction ? | this predictor | public void add ( double [ ] preds , double [ ] input ) { if ( m target Category == - NUM ) { preds [ NUM ] += m coefficient * Math . pow ( input [ m mining Schema Att Index ] , m exponent ) ; } else { preds [ m target Category ] += m coefficient * Math . pow ( input [ m mining Schema Att Index ] , m exponent ) ; } } | public void add ( double [ ] preds , double [ ] input ) { if ( m_targetCategory == - _NUM ) { preds [ _NUM ] += m_coefficient * Math . pow ( input [ m_miningSchemaAttIndex ] , m_exponent ) ; } else { preds [ m_targetCategory ] += m_coefficient * Math . pow ( input [ m_miningSchemaAttIndex ] , m_exponent ) ; } } | 82 |
java-test-10052 | java | How does the code arrange the container ? | with no constraint on the width or height | protected Size 2 D arrange NN ( Block Container container , Graphics 2 D g2 ) { double max W = NUM ; double max H = NUM ; List blocks = container . get Blocks ( ) ; Iterator iterator = blocks . iterator ( ) ; while ( iterator . has Next ( ) ) { Block b = ( Block ) iterator . next ( ) ; if ( b != null ) { Size 2 D s = b... | protected Size2D arrangeNN ( BlockContainer container , Graphics2D g2 ) { double maxW = _NUM ; double maxH = _NUM ; List blocks = container . getBlocks ( ) ; Iterator iterator = blocks . iterator ( ) ; while ( iterator . hasNext ( ) ) { Block b = ( Block ) iterator . next ( ) ; if ( b != null ) { Size2D s = b . arrange... | 171 |
java-test-10053 | java | What do a certain time have ? | passes | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10054 | java | What has passes ? | a certain time | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10055 | java | What does the method try if the target socket address actually accepts connections multiple times ? | various strategies | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10056 | java | What does this method establish ? | a proper network connection to the given target | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10057 | java | What does the code find ? | the local network address from which this machine can connect to the target address | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10058 | java | What accepts connections actually ? | the target socket address | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10059 | java | When will logging has start ? | after a certain time has passes | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10060 | java | What does the method use if the target socket address actually accepts connections between tries ? | an exponential backoff timer | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10061 | java | What does this method try ? | to establish a proper network connection to the given target | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10062 | java | What will the method choose if no connection attempt was successful after the given maximum time ? | some address based on heuristics ( excluding link - local and loopback addresses | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10063 | java | Till when do the log not flood ? | while the backoff time is still very low | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10064 | java | When was no connection attempt was successful ? | after the given maximum time | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10065 | java | Where does the method use an exponential backoff timer if the target socket address actually accepts connections ? | between tries | public static Inet Address find Connecting Address ( Inet Socket Address target Address , long max Wait Millis , long start Logging After ) throws IO Exception { if ( target Address == null ) { throw new Null Pointer Exception ( STRING ) ; } if ( max Wait Millis <= NUM ) { throw new Illegal Argument Exception ( STRING ... | public static InetAddress findConnectingAddress ( InetSocketAddress targetAddress , long maxWaitMillis , long startLoggingAfter ) throws IOException { if ( targetAddress == null ) { throw new NullPointerException ( STRING ) ; } if ( maxWaitMillis <= _NUM ) { throw new IllegalArgumentException ( STRING ) ; } final long ... | 432 |
java-test-10066 | java | What does the purpose of this method be ? | to prevent timing attack | public static boolean slow String Comparison ( String given Signature , String computed Signature ) { if ( null == given Signature || null == computed Signature || given Signature . length ( ) != computed Signature . length ( ) ) return BOOL ; int n = computed Signature . length ( ) ; boolean signatures Match = BOOL ; ... | public static boolean slowStringComparison ( String givenSignature , String computedSignature ) { if ( null == givenSignature || null == computedSignature || givenSignature . length ( ) != computedSignature . length ( ) ) return _BOOL ; int n = computedSignature . length ( ) ; boolean signaturesMatch = _BOOL ; for ( in... | 105 |
java-test-10067 | java | How does the code add format ? | by retrieving the globalization service attributes to get the list of formats and add them accordingly | private Map add Formats ( String realm ) { Set values = null ; Map map = null ; try { AM Identity Repository repo = new AM Identity Repository ( admin SSO Token , realm ) ; AM Identity realm Identity = repo . get Realm Identity ( ) ; Set services From Id Repo = realm Identity . get Assigned Services ( ) ; if ( services... | private Map addFormats ( String realm ) { Set values = null ; Map map = null ; try { AMIdentityRepository repo = new AMIdentityRepository ( adminSSOToken , realm ) ; AMIdentity realmIdentity = repo . getRealmIdentity ( ) ; Set servicesFromIdRepo = realmIdentity . getAssignedServices ( ) ; if ( servicesFromIdRepo . cont... | 349 |
java-test-10068 | java | For what purpose do the globalization service attributes retrieve ? | to get the list of formats | private Map add Formats ( String realm ) { Set values = null ; Map map = null ; try { AM Identity Repository repo = new AM Identity Repository ( admin SSO Token , realm ) ; AM Identity realm Identity = repo . get Realm Identity ( ) ; Set services From Id Repo = realm Identity . get Assigned Services ( ) ; if ( services... | private Map addFormats ( String realm ) { Set values = null ; Map map = null ; try { AMIdentityRepository repo = new AMIdentityRepository ( adminSSOToken , realm ) ; AMIdentity realmIdentity = repo . getRealmIdentity ( ) ; Set servicesFromIdRepo = realmIdentity . getAssignedServices ( ) ; if ( servicesFromIdRepo . cont... | 349 |
java-test-10069 | java | What did method use ? | to correctly reject variables in an insert data or delete data operation | private void assert Not Variable ( final Term Node t ) throws Visitor Exception { if ( t == null ) return ; if ( ! t . is Variable ( ) ) return ; final Var Node v = ( Var Node ) t ; if ( v . is Anonymous ( ) ) { return ; } throw new Visitor Exception ( STRING + t ) ; } | private void assertNotVariable ( final TermNode t ) throws VisitorException { if ( t == null ) return ; if ( ! t . isVariable ( ) ) return ; final VarNode v = ( VarNode ) t ; if ( v . isAnonymous ( ) ) { return ; } throw new VisitorException ( STRING + t ) ; } | 70 |
java-test-10070 | java | Where did variables reject correctly ? | in an insert data | private void assert Not Variable ( final Term Node t ) throws Visitor Exception { if ( t == null ) return ; if ( ! t . is Variable ( ) ) return ; final Var Node v = ( Var Node ) t ; if ( v . is Anonymous ( ) ) { return ; } throw new Visitor Exception ( STRING + t ) ; } | private void assertNotVariable ( final TermNode t ) throws VisitorException { if ( t == null ) return ; if ( ! t . isVariable ( ) ) return ; final VarNode v = ( VarNode ) t ; if ( v . isAnonymous ( ) ) { return ; } throw new VisitorException ( STRING + t ) ; } | 70 |
java-test-10073 | java | What does not make much sense it probably ? | to add support for other distance functions | @ Override public double [ ] [ ] process Ids ( DBI Ds ids , Relation < ? extends Number Vector > relation ) { final int dim = Relation Util . dimensionality ( relation ) ; final Covariance Matrix cmat = new Covariance Matrix ( dim ) ; final Centroid centroid = Centroid . make ( relation , ids ) ; double maxdist = NUM ;... | @ Override public double [ ] [ ] processIds ( DBIDs ids , Relation < ? extends NumberVector > relation ) { final int dim = RelationUtil . dimensionality ( relation ) ; final CovarianceMatrix cmat = new CovarianceMatrix ( dim ) ; final Centroid centroid = Centroid . make ( relation , ids ) ; double maxdist = _NUM ; doub... | 254 |
java-test-10074 | java | What ll we need ll ? | to compute it ourselves | @ Override public double [ ] [ ] process Ids ( DBI Ds ids , Relation < ? extends Number Vector > relation ) { final int dim = Relation Util . dimensionality ( relation ) ; final Covariance Matrix cmat = new Covariance Matrix ( dim ) ; final Centroid centroid = Centroid . make ( relation , ids ) ; double maxdist = NUM ;... | @ Override public double [ ] [ ] processIds ( DBIDs ids , Relation < ? extends NumberVector > relation ) { final int dim = RelationUtil . dimensionality ( relation ) ; final CovarianceMatrix cmat = new CovarianceMatrix ( dim ) ; final Centroid centroid = Centroid . make ( relation , ids ) ; double maxdist = _NUM ; doub... | 254 |
java-test-10075 | java | What does to add support for other distance functions not make it probably ? | much sense | @ Override public double [ ] [ ] process Ids ( DBI Ds ids , Relation < ? extends Number Vector > relation ) { final int dim = Relation Util . dimensionality ( relation ) ; final Covariance Matrix cmat = new Covariance Matrix ( dim ) ; final Centroid centroid = Centroid . make ( relation , ids ) ; double maxdist = NUM ;... | @ Override public double [ ] [ ] processIds ( DBIDs ids , Relation < ? extends NumberVector > relation ) { final int dim = RelationUtil . dimensionality ( relation ) ; final CovarianceMatrix cmat = new CovarianceMatrix ( dim ) ; final Centroid centroid = Centroid . make ( relation , ids ) ; double maxdist = _NUM ; doub... | 254 |
java-test-10076 | java | What are in the given pattern ? | no sql wildcard characters ( ' % ' or ' _ ' ) | public static boolean has No Wildcards ( String pattern ) { if ( pattern == null ) return BOOL ; for ( int pos = NUM ; pos < pattern . length ( ) ; pos ++ ) { char ch = pattern . char At ( pos ) ; if ( ch == STRING || ch == STRING ) { return BOOL ; } else if ( ch == STRING && pos < pattern . length ( ) - NUM ) { char n... | public static boolean hasNoWildcards ( String pattern ) { if ( pattern == null ) return _BOOL ; for ( int pos = _NUM ; pos < pattern . length ( ) ; pos ++ ) { char ch = pattern . charAt ( pos ) ; if ( ch == STRING || ch == STRING ) { return _BOOL ; } else if ( ch == STRING && pos < pattern . length ( ) - _NUM ) { char ... | 126 |
java-test-10077 | java | Where do no sql wildcard characters ( ' % ' or ' _ ' ) be ? | in the given pattern | public static boolean has No Wildcards ( String pattern ) { if ( pattern == null ) return BOOL ; for ( int pos = NUM ; pos < pattern . length ( ) ; pos ++ ) { char ch = pattern . char At ( pos ) ; if ( ch == STRING || ch == STRING ) { return BOOL ; } else if ( ch == STRING && pos < pattern . length ( ) - NUM ) { char n... | public static boolean hasNoWildcards ( String pattern ) { if ( pattern == null ) return _BOOL ; for ( int pos = _NUM ; pos < pattern . length ( ) ; pos ++ ) { char ch = pattern . charAt ( pos ) ; if ( ch == STRING || ch == STRING ) { return _BOOL ; } else if ( ch == STRING && pos < pattern . length ( ) - _NUM ) { char ... | 126 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.