id stringlengths 11 16 | language stringclasses 2
values | question stringlengths 13 844 | answer stringlengths 1 900 | code stringlengths 162 27.4k | code_original stringlengths 162 26k | code_word_count int64 51 5.96k |
|---|---|---|---|---|---|---|
java-test-5800 | java | What does the code apply ? | cascade rules | public void delete ( @ Nonnull Integer id ) throws Hibernate Exception { Entity Manager em = get Entity Manager ( ) ; try { begin ( ) ; T ENTITY entity = em . find ( entity Class , id ) ; if ( entity != null ) { LOG . debug ( STRING + entity . to String ( ) ) ; em . remove ( entity ) ; } commit ( ) ; } catch ( Exceptio... | public void delete ( @ Nonnull Integer id ) throws HibernateException { EntityManager em = getEntityManager ( ) ; try { begin ( ) ; T_ENTITY entity = em . find ( entityClass , id ) ; if ( entity != null ) { LOG . debug ( STRING + entity . toString ( ) ) ; em . remove ( entity ) ; } commit ( ) ; } catch ( Exception e ) ... | 112 |
java-test-5801 | java | What does the code make ? | the current color slightly lighter | public void lighter Color ( int factor ) { int color = get Color ( ) ; int r = color > > NUM & NUM ; int g = color > > NUM & NUM ; int b = color & NUM ; r = Math . min ( NUM , r + factor ) ; g = Math . min ( NUM , g + factor ) ; b = Math . min ( NUM , b + factor ) ; set Color ( ( ( r << NUM ) & NUM ) | ( ( g << NUM ) &... | public void lighterColor ( int factor ) { int color = getColor ( ) ; int r = color > > _NUM & _NUM ; int g = color > > _NUM & _NUM ; int b = color & _NUM ; r = Math . min ( _NUM , r + factor ) ; g = Math . min ( _NUM , g + factor ) ; b = Math . min ( _NUM , b + factor ) ; setColor ( ( ( r << _NUM ) & _NUM ) | ( ( g << ... | 114 |
java-test-5803 | java | What does the code update to reflect the current printer ' s selected paper size and imageable area for that paper size ? | a paper object | protected void validate Paper ( Paper orig Paper , Paper new Paper ) { if ( orig Paper == null || new Paper == null ) { return ; } else { double wid = orig Paper . get Width ( ) ; double hgt = orig Paper . get Height ( ) ; double ix = orig Paper . get Imageable X ( ) ; double iy = orig Paper . get Imageable Y ( ) ; dou... | protected void validatePaper ( Paper origPaper , Paper newPaper ) { if ( origPaper == null || newPaper == null ) { return ; } else { double wid = origPaper . getWidth ( ) ; double hgt = origPaper . getHeight ( ) ; double ix = origPaper . getImageableX ( ) ; double iy = origPaper . getImageableY ( ) ; double iw = origPa... | 324 |
java-test-5804 | java | For what purpose does the code update a paper object ? | to reflect the current printer ' s selected paper size and imageable area for that paper size | protected void validate Paper ( Paper orig Paper , Paper new Paper ) { if ( orig Paper == null || new Paper == null ) { return ; } else { double wid = orig Paper . get Width ( ) ; double hgt = orig Paper . get Height ( ) ; double ix = orig Paper . get Imageable X ( ) ; double iy = orig Paper . get Imageable Y ( ) ; dou... | protected void validatePaper ( Paper origPaper , Paper newPaper ) { if ( origPaper == null || newPaper == null ) { return ; } else { double wid = origPaper . getWidth ( ) ; double hgt = origPaper . getHeight ( ) ; double ix = origPaper . getImageableX ( ) ; double iy = origPaper . getImageableY ( ) ; double iw = origPa... | 324 |
java-test-5805 | java | For what purpose did subclasses override this method ? | to make more informed decisons | protected void validate Paper ( Paper orig Paper , Paper new Paper ) { if ( orig Paper == null || new Paper == null ) { return ; } else { double wid = orig Paper . get Width ( ) ; double hgt = orig Paper . get Height ( ) ; double ix = orig Paper . get Imageable X ( ) ; double iy = orig Paper . get Imageable Y ( ) ; dou... | protected void validatePaper ( Paper origPaper , Paper newPaper ) { if ( origPaper == null || newPaper == null ) { return ; } else { double wid = origPaper . getWidth ( ) ; double hgt = origPaper . getHeight ( ) ; double ix = origPaper . getImageableX ( ) ; double iy = origPaper . getImageableY ( ) ; double iw = origPa... | 324 |
java-test-5808 | java | Where do the arrows draw ? | on the attack | private void draw Arrows ( final Graphics 2 D g2 d , final int x , final int y , final int width , final int height , final Enum Set < Direction > directions , final Color line Color ) { int arrow Height = NUM + NUM * ( height / NUM - NUM ) ; int arrow Width = NUM + ( width / NUM - NUM ) ; if ( directions . contains ( ... | private void drawArrows ( final Graphics2D g2d , final int x , final int y , final int width , final int height , final EnumSet < Direction > directions , final Color lineColor ) { int arrowHeight = _NUM + _NUM * ( height / _NUM - _NUM ) ; int arrowWidth = _NUM + ( width / _NUM - _NUM ) ; if ( directions . contains ( D... | 785 |
java-test-5809 | java | What does the code initiate through the underlying connection ? | a new multiplexed connection | public synchronized TCP Connection open Connection ( ) throws IO Exception { int id ; do { last ID = ( ++ last ID ) & NUM ; id = last ID ; if ( orig ) id |= NUM ; } while ( connection Table . get ( id ) != null ) ; Multiplex Connection Info info = new Multiplex Connection Info ( id ) ; info . in = new Multiplex Input S... | public synchronized TCPConnection openConnection ( ) throws IOException { int id ; do { lastID = ( ++ lastID ) & _NUM ; id = lastID ; if ( orig ) id |= _NUM ; } while ( connectionTable . get ( id ) != null ) ; MultiplexConnectionInfo info = new MultiplexConnectionInfo ( id ) ; info . in = new MultiplexInputStream ( thi... | 237 |
java-test-5810 | java | How does the code initiate a new multiplexed connection ? | through the underlying connection | public synchronized TCP Connection open Connection ( ) throws IO Exception { int id ; do { last ID = ( ++ last ID ) & NUM ; id = last ID ; if ( orig ) id |= NUM ; } while ( connection Table . get ( id ) != null ) ; Multiplex Connection Info info = new Multiplex Connection Info ( id ) ; info . in = new Multiplex Input S... | public synchronized TCPConnection openConnection ( ) throws IOException { int id ; do { lastID = ( ++ lastID ) & _NUM ; id = lastID ; if ( orig ) id |= _NUM ; } while ( connectionTable . get ( id ) != null ) ; MultiplexConnectionInfo info = new MultiplexConnectionInfo ( id ) ; info . in = new MultiplexInputStream ( thi... | 237 |
java-test-5811 | java | What is this method determines ? | whether there is a current span available associated with the supplied i d | public boolean has Span With Id ( String id ) { Trace State ts = trace State . get ( ) ; if ( ts != null ) { String current Id = ts . peek Id ( ) ; if ( log . is Loggable ( Level . FINEST ) ) { log . finest ( STRING + id + STRING + current Id . equals ( id ) ) ; } return current Id . equals ( id ) ; } return BOOL ; } | public boolean hasSpanWithId ( String id ) { TraceState ts = traceState . get ( ) ; if ( ts != null ) { String currentId = ts . peekId ( ) ; if ( log . isLoggable ( Level . FINEST ) ) { log . finest ( STRING + id + STRING + currentId . equals ( id ) ) ; } return currentId . equals ( id ) ; } return _BOOL ; } | 87 |
java-test-5813 | java | How does export masks sort ? | by eligibility | static public List < Export Mask > sort Masks By Eligibility ( Map < Export Mask , Export Mask Policy > mask Map , Export Group export Group ) { List < Export Mask Comparator Container > export Mask Container List = new Array List < Export Mask Comparator Container > ( ) ; for ( Map . Entry < Export Mask , Export Mask ... | static public List < ExportMask > sortMasksByEligibility ( Map < ExportMask , ExportMaskPolicy > maskMap , ExportGroup exportGroup ) { List < ExportMaskComparatorContainer > exportMaskContainerList = new ArrayList < ExportMaskComparatorContainer > ( ) ; for ( Map . Entry < ExportMask , ExportMaskPolicy > entry : maskMa... | 260 |
java-test-5814 | java | For what purpose does this method perform a sort of the list ? | to determine the sort order this class should be derived | public void sort ( boolean ascending ) { if ( filter == null ) { filter Impl ( STRING ) ; } Integer [ ] filter Array = new Integer [ filter . size ( ) ] ; Integer [ ] temp Array = new Integer [ filter . size ( ) ] ; for ( int iter = NUM ; iter < filter . size ( ) ; iter ++ ) { filter Array [ iter ] = filter . get ( ite... | public void sort ( boolean ascending ) { if ( filter == null ) { filterImpl ( STRING ) ; } Integer [ ] filterArray = new Integer [ filter . size ( ) ] ; Integer [ ] tempArray = new Integer [ filter . size ( ) ] ; for ( int iter = _NUM ; iter < filter . size ( ) ; iter ++ ) { filterArray [ iter ] = filter . get ( iter )... | 175 |
java-test-5815 | java | What does this method perform to determine the sort order this class should be derived ? | a sort of the list | public void sort ( boolean ascending ) { if ( filter == null ) { filter Impl ( STRING ) ; } Integer [ ] filter Array = new Integer [ filter . size ( ) ] ; Integer [ ] temp Array = new Integer [ filter . size ( ) ] ; for ( int iter = NUM ; iter < filter . size ( ) ; iter ++ ) { filter Array [ iter ] = filter . get ( ite... | public void sort ( boolean ascending ) { if ( filter == null ) { filterImpl ( STRING ) ; } Integer [ ] filterArray = new Integer [ filter . size ( ) ] ; Integer [ ] tempArray = new Integer [ filter . size ( ) ] ; for ( int iter = _NUM ; iter < filter . size ( ) ; iter ++ ) { filterArray [ iter ] = filter . get ( iter )... | 175 |
java-test-5816 | java | What does the code create ? | a new byte array | public static byte [ ] clone Byte Array ( byte [ ] b ) { if ( b == null ) { return null ; } int len = b . length ; if ( len == NUM ) { return EMPTY BYTES ; } byte [ ] copy = new byte [ len ] ; System . arraycopy ( b , NUM , copy , NUM , len ) ; return copy ; } | public static byte [ ] cloneByteArray ( byte [ ] b ) { if ( b == null ) { return null ; } int len = b . length ; if ( len == _NUM ) { return EMPTY_BYTES ; } byte [ ] copy = new byte [ len ] ; System . arraycopy ( b , _NUM , copy , _NUM , len ) ; return copy ; } | 75 |
java-test-5817 | java | What does the code create ? | a substitution from the type parameters to the corresponding type arguments | @ Safe Varargs public static < T > Substitution < T > for Args ( List < Type Variable > parameters , T ... arguments ) { if ( parameters . size ( ) != arguments . length ) { throw new Illegal Argument Exception ( STRING + parameters . size ( ) + STRING + arguments . length ) ; } Substitution < T > s = new Substitution ... | @ SafeVarargs public static < T > Substitution < T > forArgs ( List < TypeVariable > parameters , T ... arguments ) { if ( parameters . size ( ) != arguments . length ) { throw new IllegalArgumentException ( STRING + parameters . size ( ) + STRING + arguments . length ) ; } Substitution < T > s = new Substitution < > (... | 116 |
java-test-5818 | java | What is the length of the path from the start node n to the state where ? | g ( n ) | public int eval ( I Node state ) { Eight Puzzle Node node = ( Eight Puzzle Node ) state ; int Pn = NUM ; for ( int r = NUM ; r <= Eight Puzzle Node . Max R ; r ++ ) { for ( int c = NUM ; c <= Eight Puzzle Node . Max C ; c ++ ) { if ( node . is Empty ( r , c ) ) { continue ; } int digit = node . cell ( r , c ) ; Pn += M... | public int eval ( INode state ) { EightPuzzleNode node = ( EightPuzzleNode ) state ; int Pn = _NUM ; for ( int r = _NUM ; r <= EightPuzzleNode . MaxR ; r ++ ) { for ( int c = _NUM ; c <= EightPuzzleNode . MaxC ; c ++ ) { if ( node . isEmpty ( r , c ) ) { continue ; } int digit = node . cell ( r , c ) ; Pn += Math . abs... | 170 |
java-test-5819 | java | What does this method keep ? | objects that have been allocated for temporary storage | public Flat Buffer Builder init ( Byte Buffer existing bb ) { bb = existing bb ; bb . clear ( ) ; bb . order ( Byte Order . LITTLE ENDIAN ) ; minalign = NUM ; space = bb . capacity ( ) ; vtable in use = NUM ; nested = BOOL ; finished = BOOL ; object start = NUM ; num vtables = NUM ; vector num elems = NUM ; return this... | public FlatBufferBuilder init ( ByteBuffer existing_bb ) { bb = existing_bb ; bb . clear ( ) ; bb . order ( ByteOrder . LITTLE_ENDIAN ) ; minalign = _NUM ; space = bb . capacity ( ) ; vtable_in_use = _NUM ; nested = _BOOL ; finished = _BOOL ; object_start = _NUM ; num_vtables = _NUM ; vector_num_elems = _NUM ; return t... | 80 |
java-test-5820 | java | What allows reusing this object on an existing ` bytebuffer ` ? | alternative initializer | public Flat Buffer Builder init ( Byte Buffer existing bb ) { bb = existing bb ; bb . clear ( ) ; bb . order ( Byte Order . LITTLE ENDIAN ) ; minalign = NUM ; space = bb . capacity ( ) ; vtable in use = NUM ; nested = BOOL ; finished = BOOL ; object start = NUM ; num vtables = NUM ; vector num elems = NUM ; return this... | public FlatBufferBuilder init ( ByteBuffer existing_bb ) { bb = existing_bb ; bb . clear ( ) ; bb . order ( ByteOrder . LITTLE_ENDIAN ) ; minalign = _NUM ; space = bb . capacity ( ) ; vtable_in_use = _NUM ; nested = _BOOL ; finished = _BOOL ; object_start = _NUM ; num_vtables = _NUM ; vector_num_elems = _NUM ; return t... | 80 |
java-test-5821 | java | For what purpose have objects been allocated ? | for temporary storage | public Flat Buffer Builder init ( Byte Buffer existing bb ) { bb = existing bb ; bb . clear ( ) ; bb . order ( Byte Order . LITTLE ENDIAN ) ; minalign = NUM ; space = bb . capacity ( ) ; vtable in use = NUM ; nested = BOOL ; finished = BOOL ; object start = NUM ; num vtables = NUM ; vector num elems = NUM ; return this... | public FlatBufferBuilder init ( ByteBuffer existing_bb ) { bb = existing_bb ; bb . clear ( ) ; bb . order ( ByteOrder . LITTLE_ENDIAN ) ; minalign = _NUM ; space = bb . capacity ( ) ; vtable_in_use = _NUM ; nested = _BOOL ; finished = _BOOL ; object_start = _NUM ; num_vtables = _NUM ; vector_num_elems = _NUM ; return t... | 80 |
java-test-5822 | java | What does alternative initializer allow ? | reusing this object on an existing ` bytebuffer ` | public Flat Buffer Builder init ( Byte Buffer existing bb ) { bb = existing bb ; bb . clear ( ) ; bb . order ( Byte Order . LITTLE ENDIAN ) ; minalign = NUM ; space = bb . capacity ( ) ; vtable in use = NUM ; nested = BOOL ; finished = BOOL ; object start = NUM ; num vtables = NUM ; vector num elems = NUM ; return this... | public FlatBufferBuilder init ( ByteBuffer existing_bb ) { bb = existing_bb ; bb . clear ( ) ; bb . order ( ByteOrder . LITTLE_ENDIAN ) ; minalign = _NUM ; space = bb . capacity ( ) ; vtable_in_use = _NUM ; nested = _BOOL ; finished = _BOOL ; object_start = _NUM ; num_vtables = _NUM ; vector_num_elems = _NUM ; return t... | 80 |
java-test-5823 | java | What does this method reset ? | the builder ' s internal state | public Flat Buffer Builder init ( Byte Buffer existing bb ) { bb = existing bb ; bb . clear ( ) ; bb . order ( Byte Order . LITTLE ENDIAN ) ; minalign = NUM ; space = bb . capacity ( ) ; vtable in use = NUM ; nested = BOOL ; finished = BOOL ; object start = NUM ; num vtables = NUM ; vector num elems = NUM ; return this... | public FlatBufferBuilder init ( ByteBuffer existing_bb ) { bb = existing_bb ; bb . clear ( ) ; bb . order ( ByteOrder . LITTLE_ENDIAN ) ; minalign = _NUM ; space = bb . capacity ( ) ; vtable_in_use = _NUM ; nested = _BOOL ; finished = _BOOL ; object_start = _NUM ; num_vtables = _NUM ; vector_num_elems = _NUM ; return t... | 80 |
java-test-5826 | java | What do handles watch ? | issues with watching | private Etcd Keys Response handle Etcd Watch Errors ( Etcd Exception exception ) { if ( exception . error Code == ETCD EVENT INDEX CLEARED CODE ) { initial Set All Flagz ( ) ; return null ; } else if ( exception . error Code == ETCD WATCHER CLEARED CODE ) { try { Thread . sleep ( reelection Backoff Ms . get ( ) ) ; } c... | private EtcdKeysResponse handleEtcdWatchErrors ( EtcdException exception ) { if ( exception . errorCode == ETCD_EVENT_INDEX_CLEARED_CODE ) { initialSetAllFlagz ( ) ; return null ; } else if ( exception . errorCode == ETCD_WATCHER_CLEARED_CODE ) { try { Thread . sleep ( reelectionBackoffMs . get ( ) ) ; } catch ( Interr... | 100 |
java-test-5828 | java | What do the labeling allow ? | detecting cut edges | private static List find Labeled Edge Rings ( Collection dir Edges ) { List edge Ring Starts = new Array List ( ) ; long curr Label = NUM ; for ( Iterator i = dir Edges . iterator ( ) ; i . has Next ( ) ; ) { Polygonize Directed Edge de = ( Polygonize Directed Edge ) i . next ( ) ; if ( de . is Marked ( ) ) continue ; ... | private static List findLabeledEdgeRings ( Collection dirEdges ) { List edgeRingStarts = new ArrayList ( ) ; long currLabel = _NUM ; for ( Iterator i = dirEdges . iterator ( ) ; i . hasNext ( ) ; ) { PolygonizeDirectedEdge de = ( PolygonizeDirectedEdge ) i . next ( ) ; if ( de . isMarked ( ) ) continue ; if ( de . getL... | 134 |
java-test-5829 | java | What does the labeling detect ? | cut edges | private static List find Labeled Edge Rings ( Collection dir Edges ) { List edge Ring Starts = new Array List ( ) ; long curr Label = NUM ; for ( Iterator i = dir Edges . iterator ( ) ; i . has Next ( ) ; ) { Polygonize Directed Edge de = ( Polygonize Directed Edge ) i . next ( ) ; if ( de . is Marked ( ) ) continue ; ... | private static List findLabeledEdgeRings ( Collection dirEdges ) { List edgeRingStarts = new ArrayList ( ) ; long currLabel = _NUM ; for ( Iterator i = dirEdges . iterator ( ) ; i . hasNext ( ) ; ) { PolygonizeDirectedEdge de = ( PolygonizeDirectedEdge ) i . next ( ) ; if ( de . isMarked ( ) ) continue ; if ( de . getL... | 134 |
java-test-5830 | java | What do all calls of this method have ? | includestacktrace true | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5831 | java | When do ll change this so the trace is printed only when tlc is called with the - debug option ? | on 20 mar 2012 | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5832 | java | Where was this printing of the stack trace added probably by sz . the stack trace ? | in tlc2 - - | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5833 | java | What changed this so the trace is printed only when tlc is called with the - debug option on 20 mar 2012 ? | ll | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5834 | java | How was this printing of the stack trace added probably in tlc2 - - ? | by sz . the stack trace | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5835 | java | For what purpose do ll change this on 20 mar 2012 ? | so the trace is printed only when tlc is called with the - debug option | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5836 | java | When is the trace printed ? | only when tlc is called with the - debug option | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5837 | java | What have includestacktrace true ? | all calls of this method | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5838 | java | What was added in tlc2 - - ? | this printing of the stack trace | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5839 | java | What do the stack trace provide to the user ? | no useful information | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5840 | java | How is tlc called when ? | with the - debug option | private static void print Error ( int error Code , String cause , Throwable throwable , boolean include Stack Trace ) { print Error ( error Code , cause ) ; if ( include Stack Trace ) { if ( TLC Globals . debug ) { Debug Printer . print ( STRING ) ; throwable . print Stack Trace ( Tool IO . out ) ; } } } | private static void printError ( int errorCode , String cause , Throwable throwable , boolean includeStackTrace ) { printError ( errorCode , cause ) ; if ( includeStackTrace ) { if ( TLCGlobals . debug ) { DebugPrinter . print ( STRING ) ; throwable . printStackTrace ( ToolIO . out ) ; } } } | 69 |
java-test-5841 | java | What does the code join ? | a collection of strings , separated by a delimiter | @ Check Return Value @ Nonnull public static String join ( @ Nonnull Collection < String > s , @ Nonnull String delimiter ) { String Builder buffer = new String Builder ( ) ; Iterator < String > iter = s . iterator ( ) ; while ( iter . has Next ( ) ) { buffer . append ( iter . next ( ) ) ; if ( iter . has Next ( ) ) { ... | @ CheckReturnValue @ Nonnull public static String join ( @ Nonnull Collection < String > s , @ Nonnull String delimiter ) { StringBuilder buffer = new StringBuilder ( ) ; Iterator < String > iter = s . iterator ( ) ; while ( iter . hasNext ( ) ) { buffer . append ( iter . next ( ) ) ; if ( iter . hasNext ( ) ) { buffer... | 96 |
java-test-5842 | java | What does the code get ? | details for the removeinitiator method note | @ Suppress Warnings ( STRING ) public List < String > remove Initiator Details ( URI initiator Id ) { List < String > result = Lists . new Array List ( ) ; Initiator initiator = db Client . query Object ( Initiator . class , initiator Id ) ; if ( initiator != null ) { result . add ( Compute System Dialog Properties . g... | @ SuppressWarnings ( STRING ) public List < String > removeInitiatorDetails ( URI initiatorId ) { List < String > result = Lists . newArrayList ( ) ; Initiator initiator = _dbClient . queryObject ( Initiator . class , initiatorId ) ; if ( initiator != null ) { result . add ( ComputeSystemDialogProperties . getMessage (... | 219 |
java-test-5845 | java | What does the code delete ? | the latest photo that placed in the determined directory | public static boolean delete Latest Photo ( ) { try { File media Storage Dir = get Media Storage Dir ( ) ; if ( ! media Storage Dir . exists ( ) ) return BOOL ; File [ ] images = media Storage Dir . list Files ( ) ; File latest Image = images [ NUM ] ; for ( File image : images ) { if ( image . last Modified ( ) > late... | public static boolean deleteLatestPhoto ( ) { try { File mediaStorageDir = getMediaStorageDir ( ) ; if ( ! mediaStorageDir . exists ( ) ) return _BOOL ; File [ ] images = mediaStorageDir . listFiles ( ) ; File latestImage = images [ _NUM ] ; for ( File image : images ) { if ( image . lastModified ( ) > latestImage . la... | 135 |
java-test-5846 | java | What does a frameset branch element replace ? | with a frame leaf element | private void update Frame Set ( Element element , String url ) { try { int start Offset = element . get Start Offset ( ) ; int end Offset = Math . min ( get Length ( ) , element . get End Offset ( ) ) ; String html = STRING ; if ( url != null ) { html += STRING + url + STRING ; } html += STRING ; install Parser If Nece... | private void updateFrameSet ( Element element , String url ) { try { int startOffset = element . getStartOffset ( ) ; int endOffset = Math . min ( getLength ( ) , element . getEndOffset ( ) ) ; String html = STRING ; if ( url != null ) { html += STRING + url + STRING ; } html += STRING ; installParserIfNecessary ( ) ; ... | 109 |
java-test-5847 | java | What replaces with a frame leaf element ? | a frameset branch element | private void update Frame Set ( Element element , String url ) { try { int start Offset = element . get Start Offset ( ) ; int end Offset = Math . min ( get Length ( ) , element . get End Offset ( ) ) ; String html = STRING ; if ( url != null ) { html += STRING + url + STRING ; } html += STRING ; install Parser If Nece... | private void updateFrameSet ( Element element , String url ) { try { int startOffset = element . getStartOffset ( ) ; int endOffset = Math . min ( getLength ( ) , element . getEndOffset ( ) ) ; String html = STRING ; if ( url != null ) { html += STRING + url + STRING ; } html += STRING ; installParserIfNecessary ( ) ; ... | 109 |
java-test-5848 | java | What did a new list returned contain ? | the invalid messages and a pruned msglist containing only those messages that are valid for the given role of the controller and openflow version of the switch | protected static Collection < OF Message > prune Invalid Messages ( Iterable < OF Message > msg List , Collection < OF Message > valid , OF Version sw Version , boolean is Active ) { if ( is Active ) { valid . add All ( Iterable Utils . to Collection ( msg List ) ) ; return Collections . empty List ( ) ; } else { Set <... | protected static Collection < OFMessage > pruneInvalidMessages ( Iterable < OFMessage > msgList , Collection < OFMessage > valid , OFVersion swVersion , boolean isActive ) { if ( isActive ) { valid . addAll ( IterableUtils . toCollection ( msgList ) ) ; return Collections . emptyList ( ) ; } else { Set < OFType > inval... | 183 |
java-test-5849 | java | What do a pruned msglist contain ? | only those messages that are valid for the given role of the controller and openflow version of the switch | protected static Collection < OF Message > prune Invalid Messages ( Iterable < OF Message > msg List , Collection < OF Message > valid , OF Version sw Version , boolean is Active ) { if ( is Active ) { valid . add All ( Iterable Utils . to Collection ( msg List ) ) ; return Collections . empty List ( ) ; } else { Set <... | protected static Collection < OFMessage > pruneInvalidMessages ( Iterable < OFMessage > msgList , Collection < OFMessage > valid , OFVersion swVersion , boolean isActive ) { if ( isActive ) { valid . addAll ( IterableUtils . toCollection ( msgList ) ) ; return Collections . emptyList ( ) ; } else { Set < OFType > inval... | 183 |
java-test-5850 | java | What is containing the invalid messages and a pruned msglist containing only those messages that are valid for the given role of the controller and openflow version of the switch ? | a new list returned | protected static Collection < OF Message > prune Invalid Messages ( Iterable < OF Message > msg List , Collection < OF Message > valid , OF Version sw Version , boolean is Active ) { if ( is Active ) { valid . add All ( Iterable Utils . to Collection ( msg List ) ) ; return Collections . empty List ( ) ; } else { Set <... | protected static Collection < OFMessage > pruneInvalidMessages ( Iterable < OFMessage > msgList , Collection < OFMessage > valid , OFVersion swVersion , boolean isActive ) { if ( isActive ) { valid . addAll ( IterableUtils . toCollection ( msgList ) ) ; return Collections . emptyList ( ) ; } else { Set < OFType > inval... | 183 |
java-test-5851 | java | How does any invalid messages sort ? | by moving them from the msglist | protected static Collection < OF Message > prune Invalid Messages ( Iterable < OF Message > msg List , Collection < OF Message > valid , OF Version sw Version , boolean is Active ) { if ( is Active ) { valid . add All ( Iterable Utils . to Collection ( msg List ) ) ; return Collections . empty List ( ) ; } else { Set <... | protected static Collection < OFMessage > pruneInvalidMessages ( Iterable < OFMessage > msgList , Collection < OFMessage > valid , OFVersion swVersion , boolean isActive ) { if ( isActive ) { valid . addAll ( IterableUtils . toCollection ( msgList ) ) ; return Collections . emptyList ( ) ; } else { Set < OFType > inval... | 183 |
java-test-5852 | java | What is containing only those messages that are valid for the given role of the controller and openflow version of the switch ? | a pruned msglist | protected static Collection < OF Message > prune Invalid Messages ( Iterable < OF Message > msg List , Collection < OF Message > valid , OF Version sw Version , boolean is Active ) { if ( is Active ) { valid . add All ( Iterable Utils . to Collection ( msg List ) ) ; return Collections . empty List ( ) ; } else { Set <... | protected static Collection < OFMessage > pruneInvalidMessages ( Iterable < OFMessage > msgList , Collection < OFMessage > valid , OFVersion swVersion , boolean isActive ) { if ( isActive ) { valid . addAll ( IterableUtils . toCollection ( msgList ) ) ; return Collections . emptyList ( ) ; } else { Set < OFType > inval... | 183 |
java-test-5853 | java | For what purpose is the size of each existing slice recalculated as new items are added ? | so that the proportions remain correct | public int add Item ( String label , float value , int color ) { Item it = new Item ( ) ; it . m Label = label ; it . m Color = color ; it . m Value = value ; it . m Highlight = Color . argb ( NUM , Math . min ( ( int ) ( m Highlight Strength * ( float ) Color . red ( color ) ) , NUM ) , Math . min ( ( int ) ( m Highli... | public int addItem ( String label , float value , int color ) { Item it = new Item ( ) ; it . mLabel = label ; it . mColor = color ; it . mValue = value ; it . mHighlight = Color . argb ( _NUM , Math . min ( ( int ) ( mHighlightStrength * ( float ) Color . red ( color ) ) , _NUM ) , Math . min ( ( int ) ( mHighlightStr... | 164 |
java-test-5854 | java | When is the size of each existing slice recalculated so that the proportions remain correct ? | as new items are added | public int add Item ( String label , float value , int color ) { Item it = new Item ( ) ; it . m Label = label ; it . m Color = color ; it . m Value = value ; it . m Highlight = Color . argb ( NUM , Math . min ( ( int ) ( m Highlight Strength * ( float ) Color . red ( color ) ) , NUM ) , Math . min ( ( int ) ( m Highli... | public int addItem ( String label , float value , int color ) { Item it = new Item ( ) ; it . mLabel = label ; it . mColor = color ; it . mValue = value ; it . mHighlight = Color . argb ( _NUM , Math . min ( ( int ) ( mHighlightStrength * ( float ) Color . red ( color ) ) , _NUM ) , Math . min ( ( int ) ( mHighlightStr... | 164 |
java-test-5855 | java | What does the code add to this view ? | a new data item | public int add Item ( String label , float value , int color ) { Item it = new Item ( ) ; it . m Label = label ; it . m Color = color ; it . m Value = value ; it . m Highlight = Color . argb ( NUM , Math . min ( ( int ) ( m Highlight Strength * ( float ) Color . red ( color ) ) , NUM ) , Math . min ( ( int ) ( m Highli... | public int addItem ( String label , float value , int color ) { Item it = new Item ( ) ; it . mLabel = label ; it . mColor = color ; it . mValue = value ; it . mHighlight = Color . argb ( _NUM , Math . min ( ( int ) ( mHighlightStrength * ( float ) Color . red ( color ) ) , _NUM ) , Math . min ( ( int ) ( mHighlightStr... | 164 |
java-test-5856 | java | What will this class run actually for every link ? | the spanning tree algo | private final void init T Time Matrix ( ) { log . info ( STRING ) ; Set < Id > zids = new Hash Set < Id > ( ) ; for ( Id zid : l2 z Mapping . values ( ) ) { zids . add ( zid ) ; } ttime Matrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new Hash Map < Id , Tuple < Double , Int... | private final void initTTimeMatrix ( ) { log . info ( STRING ) ; Set < Id > zids = new HashSet < Id > ( ) ; for ( Id zid : l2zMapping . values ( ) ) { zids . add ( zid ) ; } ttimeMatrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new HashMap < Id , Tuple < Double , Integer > >... | 156 |
java-test-5857 | java | What does the code initialize ? | a place where link2link ttimes can be added into zones | private final void init T Time Matrix ( ) { log . info ( STRING ) ; Set < Id > zids = new Hash Set < Id > ( ) ; for ( Id zid : l2 z Mapping . values ( ) ) { zids . add ( zid ) ; } ttime Matrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new Hash Map < Id , Tuple < Double , Int... | private final void initTTimeMatrix ( ) { log . info ( STRING ) ; Set < Id > zids = new HashSet < Id > ( ) ; for ( Id zid : l2zMapping . values ( ) ) { zids . add ( zid ) ; } ttimeMatrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new HashMap < Id , Tuple < Double , Integer > >... | 156 |
java-test-5858 | java | What does i assume ? | that this class will actually run the spanning tree algo for every link . well , actually no | private final void init T Time Matrix ( ) { log . info ( STRING ) ; Set < Id > zids = new Hash Set < Id > ( ) ; for ( Id zid : l2 z Mapping . values ( ) ) { zids . add ( zid ) ; } ttime Matrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new Hash Map < Id , Tuple < Double , Int... | private final void initTTimeMatrix ( ) { log . info ( STRING ) ; Set < Id > zids = new HashSet < Id > ( ) ; for ( Id zid : l2zMapping . values ( ) ) { zids . add ( zid ) ; } ttimeMatrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new HashMap < Id , Tuple < Double , Integer > >... | 156 |
java-test-5859 | java | For what purpose will this class run the spanning tree algo actually ? | for every link | private final void init T Time Matrix ( ) { log . info ( STRING ) ; Set < Id > zids = new Hash Set < Id > ( ) ; for ( Id zid : l2 z Mapping . values ( ) ) { zids . add ( zid ) ; } ttime Matrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new Hash Map < Id , Tuple < Double , Int... | private final void initTTimeMatrix ( ) { log . info ( STRING ) ; Set < Id > zids = new HashSet < Id > ( ) ; for ( Id zid : l2zMapping . values ( ) ) { zids . add ( zid ) ; } ttimeMatrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new HashMap < Id , Tuple < Double , Integer > >... | 156 |
java-test-5860 | java | What can be added into zones a place ? | link2link ttimes | private final void init T Time Matrix ( ) { log . info ( STRING ) ; Set < Id > zids = new Hash Set < Id > ( ) ; for ( Id zid : l2 z Mapping . values ( ) ) { zids . add ( zid ) ; } ttime Matrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new Hash Map < Id , Tuple < Double , Int... | private final void initTTimeMatrix ( ) { log . info ( STRING ) ; Set < Id > zids = new HashSet < Id > ( ) ; for ( Id zid : l2zMapping . values ( ) ) { zids . add ( zid ) ; } ttimeMatrix . clear ( ) ; for ( Id fzone : zids ) { Map < Id , Tuple < Double , Integer > > tmap = new HashMap < Id , Tuple < Double , Integer > >... | 156 |
java-test-5861 | java | What does not have any decimals ? | the formatted value | public Monetary Format decimal Mark ( char decimal Mark ) { check Argument ( ! Character . is Digit ( decimal Mark ) ) ; check Argument ( decimal Mark > NUM ) ; if ( decimal Mark == this . decimal Mark ) return this ; else return new Monetary Format ( negative Sign , positive Sign , zero Digit , decimal Mark , min Deci... | public MonetaryFormat decimalMark ( char decimalMark ) { checkArgument ( ! Character . isDigit ( decimalMark ) ) ; checkArgument ( decimalMark > _NUM ) ; if ( decimalMark == this . decimalMark ) return this ; else return new MonetaryFormat ( negativeSign , positiveSign , zeroDigit , decimalMark , minDecimals , decimalG... | 86 |
java-test-5862 | java | What does the formatted value not have ? | any decimals | public Monetary Format decimal Mark ( char decimal Mark ) { check Argument ( ! Character . is Digit ( decimal Mark ) ) ; check Argument ( decimal Mark > NUM ) ; if ( decimal Mark == this . decimal Mark ) return this ; else return new Monetary Format ( negative Sign , positive Sign , zero Digit , decimal Mark , min Deci... | public MonetaryFormat decimalMark ( char decimalMark ) { checkArgument ( ! Character . isDigit ( decimalMark ) ) ; checkArgument ( decimalMark > _NUM ) ; if ( decimalMark == this . decimalMark ) return this ; else return new MonetaryFormat ( negativeSign , positiveSign , zeroDigit , decimalMark , minDecimals , decimalG... | 86 |
java-test-5865 | java | What contains primitive values seen during generation / execution ? | the runtimeprimitivesseen set | private void initialize Runtime Primitives Seen ( ) { for ( Sequence s : component Manager . get All Primitive Sequences ( ) ) { Executable Sequence es = new Executable Sequence ( s ) ; es . execute ( new Dummy Visitor ( ) , new Dummy Check Generator ( ) ) ; Normal Execution e = ( Normal Execution ) es . get Result ( N... | private void initializeRuntimePrimitivesSeen ( ) { for ( Sequence s : componentManager . getAllPrimitiveSequences ( ) ) { ExecutableSequence es = new ExecutableSequence ( s ) ; es . execute ( new DummyVisitor ( ) , new DummyCheckGenerator ( ) ) ; NormalExecution e = ( NormalExecution ) es . getResult ( _NUM ) ; Object ... | 94 |
java-test-5866 | java | What does this method put in this set ? | those primitives | private void initialize Runtime Primitives Seen ( ) { for ( Sequence s : component Manager . get All Primitive Sequences ( ) ) { Executable Sequence es = new Executable Sequence ( s ) ; es . execute ( new Dummy Visitor ( ) , new Dummy Check Generator ( ) ) ; Normal Execution e = ( Normal Execution ) es . get Result ( N... | private void initializeRuntimePrimitivesSeen ( ) { for ( Sequence s : componentManager . getAllPrimitiveSequences ( ) ) { ExecutableSequence es = new ExecutableSequence ( s ) ; es . execute ( new DummyVisitor ( ) , new DummyCheckGenerator ( ) ) ; NormalExecution e = ( NormalExecution ) es . getResult ( _NUM ) ; Object ... | 94 |
java-test-5867 | java | What does the runtimeprimitivesseen set contain ? | primitive values seen during generation / execution | private void initialize Runtime Primitives Seen ( ) { for ( Sequence s : component Manager . get All Primitive Sequences ( ) ) { Executable Sequence es = new Executable Sequence ( s ) ; es . execute ( new Dummy Visitor ( ) , new Dummy Check Generator ( ) ) ; Normal Execution e = ( Normal Execution ) es . get Result ( N... | private void initializeRuntimePrimitivesSeen ( ) { for ( Sequence s : componentManager . getAllPrimitiveSequences ( ) ) { ExecutableSequence es = new ExecutableSequence ( s ) ; es . execute ( new DummyVisitor ( ) , new DummyCheckGenerator ( ) ) ; NormalExecution e = ( NormalExecution ) es . getResult ( _NUM ) ; Object ... | 94 |
java-test-5868 | java | When did primitive values see ? | during generation / execution | private void initialize Runtime Primitives Seen ( ) { for ( Sequence s : component Manager . get All Primitive Sequences ( ) ) { Executable Sequence es = new Executable Sequence ( s ) ; es . execute ( new Dummy Visitor ( ) , new Dummy Check Generator ( ) ) ; Normal Execution e = ( Normal Execution ) es . get Result ( N... | private void initializeRuntimePrimitivesSeen ( ) { for ( Sequence s : componentManager . getAllPrimitiveSequences ( ) ) { ExecutableSequence es = new ExecutableSequence ( s ) ; es . execute ( new DummyVisitor ( ) , new DummyCheckGenerator ( ) ) ; NormalExecution e = ( NormalExecution ) es . getResult ( _NUM ) ; Object ... | 94 |
java-test-5869 | java | What do a use ? | a set of known indentification values in the map of filters | public static Map . Entry < Symbol , Described Type > find Filter ( Map < Symbol , Object > filters , Object [ ] filter Ids ) { if ( filter Ids == null || filter Ids . length == NUM ) { throw new Illegal Argument Exception ( STRING ) ; } if ( filters == null || filters . is Empty ( ) ) { return null ; } for ( Map . Ent... | public static Map . Entry < Symbol , DescribedType > findFilter ( Map < Symbol , Object > filters , Object [ ] filterIds ) { if ( filterIds == null || filterIds . length == _NUM ) { throw new IllegalArgumentException ( STRING ) ; } if ( filters == null || filters . isEmpty ( ) ) { return null ; } for ( Map . Entry < Sy... | 185 |
java-test-5873 | java | What will method not return if this can not be done but rather returns null ? | an " unknown " serializer | protected Json Serializer < Object > find Explicit Untyped Serializer ( Class < ? > runtime Type , Bean Property property ) { Json Serializer < Object > ser = known Serializers . untyped Value Serializer ( runtime Type ) ; if ( ser != null ) { return ser ; } ser = serializer Cache . untyped Value Serializer ( runtime T... | protected JsonSerializer < Object > _findExplicitUntypedSerializer ( Class < ? > runtimeType , BeanProperty property ) { JsonSerializer < Object > ser = _knownSerializers . untypedValueSerializer ( runtimeType ) ; if ( ser != null ) { return ser ; } ser = _serializerCache . untypedValueSerializer ( runtimeType ) ; if (... | 103 |
java-test-5874 | java | What will method try ? | to find a serializer , either from cache or by constructing one | protected Json Serializer < Object > find Explicit Untyped Serializer ( Class < ? > runtime Type , Bean Property property ) { Json Serializer < Object > ser = known Serializers . untyped Value Serializer ( runtime Type ) ; if ( ser != null ) { return ser ; } ser = serializer Cache . untyped Value Serializer ( runtime T... | protected JsonSerializer < Object > _findExplicitUntypedSerializer ( Class < ? > runtimeType , BeanProperty property ) { JsonSerializer < Object > ser = _knownSerializers . untypedValueSerializer ( runtimeType ) ; if ( ser != null ) { return ser ; } ser = _serializerCache . untypedValueSerializer ( runtimeType ) ; if (... | 103 |
java-test-5875 | java | What do that find ? | a serializer , either from cache or by constructing one | protected Json Serializer < Object > find Explicit Untyped Serializer ( Class < ? > runtime Type , Bean Property property ) { Json Serializer < Object > ser = known Serializers . untyped Value Serializer ( runtime Type ) ; if ( ser != null ) { return ser ; } ser = serializer Cache . untyped Value Serializer ( runtime T... | protected JsonSerializer < Object > _findExplicitUntypedSerializer ( Class < ? > runtimeType , BeanProperty property ) { JsonSerializer < Object > ser = _knownSerializers . untypedValueSerializer ( runtimeType ) ; if ( ser != null ) { return ser ; } ser = _serializerCache . untypedValueSerializer ( runtimeType ) ; if (... | 103 |
java-test-5877 | java | What does the method return using the java introspector class ? | the property descriptors obtained through introspection | protected static Property Descriptor [ ] introspect ( Class clazz ) { Bean Info bean Info ; try { bean Info = Introspector . get Bean Info ( clazz ) ; } catch ( Introspection Exception e ) { return ( new Property Descriptor [ NUM ] ) ; } return bean Info . get Property Descriptors ( ) ; } | protected static PropertyDescriptor [ ] introspect ( Class clazz ) { BeanInfo beanInfo ; try { beanInfo = Introspector . getBeanInfo ( clazz ) ; } catch ( IntrospectionException e ) { return ( new PropertyDescriptor [ _NUM ] ) ; } return beanInfo . getPropertyDescriptors ( ) ; } | 61 |
java-test-5878 | java | How does the method return the property descriptors obtained through introspection ? | using the java introspector class | protected static Property Descriptor [ ] introspect ( Class clazz ) { Bean Info bean Info ; try { bean Info = Introspector . get Bean Info ( clazz ) ; } catch ( Introspection Exception e ) { return ( new Property Descriptor [ NUM ] ) ; } return bean Info . get Property Descriptors ( ) ; } | protected static PropertyDescriptor [ ] introspect ( Class clazz ) { BeanInfo beanInfo ; try { beanInfo = Introspector . getBeanInfo ( clazz ) ; } catch ( IntrospectionException e ) { return ( new PropertyDescriptor [ _NUM ] ) ; } return beanInfo . getPropertyDescriptors ( ) ; } | 61 |
java-test-5879 | java | How did the property descriptors obtain ? | through introspection | protected static Property Descriptor [ ] introspect ( Class clazz ) { Bean Info bean Info ; try { bean Info = Introspector . get Bean Info ( clazz ) ; } catch ( Introspection Exception e ) { return ( new Property Descriptor [ NUM ] ) ; } return bean Info . get Property Descriptors ( ) ; } | protected static PropertyDescriptor [ ] introspect ( Class clazz ) { BeanInfo beanInfo ; try { beanInfo = Introspector . getBeanInfo ( clazz ) ; } catch ( IntrospectionException e ) { return ( new PropertyDescriptor [ _NUM ] ) ; } return beanInfo . getPropertyDescriptors ( ) ; } | 61 |
java-test-5880 | java | What do this method use ? | to get a new telegrambot instance with the selected auth token | public static Telegram Bot login ( String auth Token ) { try { Http Request With Body request = Unirest . post ( API URL + STRING + auth Token + STRING ) ; Http Response < String > response = request . as String ( ) ; JSON Object json Response = Utils . process Response ( response ) ; if ( json Response != null && Util... | public static TelegramBot login ( String authToken ) { try { HttpRequestWithBody request = Unirest . post ( API_URL + STRING + authToken + STRING ) ; HttpResponse < String > response = request . asString ( ) ; JSONObject jsonResponse = Utils . processResponse ( response ) ; if ( jsonResponse != null && Utils . checkRes... | 148 |
java-test-5882 | java | What did we use ? | the rootblock fields , nextoffset , metastartaddr , metabitsaddr . metabitsaddr | private void initfrom Root Block ( final I Root Block View rb ) throws IO Exception { assert ( rb != null ) ; m store UUID = rb . get UUID ( ) ; if ( rb . get Next Offset ( ) == NUM ) { default Init ( ) ; } else { final long nxt Offset = rb . get Next Offset ( ) ; m next Allocation = - ( int ) ( nxt Offset > > NUM ) ; ... | private void initfromRootBlock ( final IRootBlockView rb ) throws IOException { assert ( rb != null ) ; m_storeUUID = rb . getUUID ( ) ; if ( rb . getNextOffset ( ) == _NUM ) { defaultInit ( ) ; } else { final long nxtOffset = rb . getNextOffset ( ) ; m_nextAllocation = - ( int ) ( nxtOffset > > _NUM ) ; if ( m_nextAll... | 706 |
java-test-5883 | java | What indicates the size of the allocation also ? | the long value | private void initfrom Root Block ( final I Root Block View rb ) throws IO Exception { assert ( rb != null ) ; m store UUID = rb . get UUID ( ) ; if ( rb . get Next Offset ( ) == NUM ) { default Init ( ) ; } else { final long nxt Offset = rb . get Next Offset ( ) ; m next Allocation = - ( int ) ( nxt Offset > > NUM ) ; ... | private void initfromRootBlock ( final IRootBlockView rb ) throws IOException { assert ( rb != null ) ; m_storeUUID = rb . getUUID ( ) ; if ( rb . getNextOffset ( ) == _NUM ) { defaultInit ( ) ; } else { final long nxtOffset = rb . getNextOffset ( ) ; m_nextAllocation = - ( int ) ( nxtOffset > > _NUM ) ; if ( m_nextAll... | 706 |
java-test-5884 | java | What was used where ? | initfilespec | private void initfrom Root Block ( final I Root Block View rb ) throws IO Exception { assert ( rb != null ) ; m store UUID = rb . get UUID ( ) ; if ( rb . get Next Offset ( ) == NUM ) { default Init ( ) ; } else { final long nxt Offset = rb . get Next Offset ( ) ; m next Allocation = - ( int ) ( nxt Offset > > NUM ) ; ... | private void initfromRootBlock ( final IRootBlockView rb ) throws IOException { assert ( rb != null ) ; m_storeUUID = rb . getUUID ( ) ; if ( rb . getNextOffset ( ) == _NUM ) { defaultInit ( ) ; } else { final long nxtOffset = rb . getNextOffset ( ) ; m_nextAllocation = - ( int ) ( nxtOffset > > _NUM ) ; if ( m_nextAll... | 706 |
java-test-5885 | java | What used to indicate the size ? | the low order 16 bits | private void initfrom Root Block ( final I Root Block View rb ) throws IO Exception { assert ( rb != null ) ; m store UUID = rb . get UUID ( ) ; if ( rb . get Next Offset ( ) == NUM ) { default Init ( ) ; } else { final long nxt Offset = rb . get Next Offset ( ) ; m next Allocation = - ( int ) ( nxt Offset > > NUM ) ; ... | private void initfromRootBlock ( final IRootBlockView rb ) throws IOException { assert ( rb != null ) ; m_storeUUID = rb . getUUID ( ) ; if ( rb . getNextOffset ( ) == _NUM ) { defaultInit ( ) ; } else { final long nxtOffset = rb . getNextOffset ( ) ; m_nextAllocation = - ( int ) ( nxtOffset > > _NUM ) ; if ( m_nextAll... | 706 |
java-test-5886 | java | What did the low order 16 bits use ? | to indicate the size | private void initfrom Root Block ( final I Root Block View rb ) throws IO Exception { assert ( rb != null ) ; m store UUID = rb . get UUID ( ) ; if ( rb . get Next Offset ( ) == NUM ) { default Init ( ) ; } else { final long nxt Offset = rb . get Next Offset ( ) ; m next Allocation = - ( int ) ( nxt Offset > > NUM ) ; ... | private void initfromRootBlock ( final IRootBlockView rb ) throws IOException { assert ( rb != null ) ; m_storeUUID = rb . getUUID ( ) ; if ( rb . getNextOffset ( ) == _NUM ) { defaultInit ( ) ; } else { final long nxtOffset = rb . getNextOffset ( ) ; m_nextAllocation = - ( int ) ( nxtOffset > > _NUM ) ; if ( m_nextAll... | 706 |
java-test-5887 | java | What did the long value indicate also ? | the size of the allocation | private void initfrom Root Block ( final I Root Block View rb ) throws IO Exception { assert ( rb != null ) ; m store UUID = rb . get UUID ( ) ; if ( rb . get Next Offset ( ) == NUM ) { default Init ( ) ; } else { final long nxt Offset = rb . get Next Offset ( ) ; m next Allocation = - ( int ) ( nxt Offset > > NUM ) ; ... | private void initfromRootBlock ( final IRootBlockView rb ) throws IOException { assert ( rb != null ) ; m_storeUUID = rb . getUUID ( ) ; if ( rb . getNextOffset ( ) == _NUM ) { defaultInit ( ) ; } else { final long nxtOffset = rb . getNextOffset ( ) ; m_nextAllocation = - ( int ) ( nxtOffset > > _NUM ) ; if ( m_nextAll... | 706 |
java-test-5888 | java | What do we note ? | that metabitsaddr must be an absolute address , with the low order 16 bits used to indicate the size | private void initfrom Root Block ( final I Root Block View rb ) throws IO Exception { assert ( rb != null ) ; m store UUID = rb . get UUID ( ) ; if ( rb . get Next Offset ( ) == NUM ) { default Init ( ) ; } else { final long nxt Offset = rb . get Next Offset ( ) ; m next Allocation = - ( int ) ( nxt Offset > > NUM ) ; ... | private void initfromRootBlock ( final IRootBlockView rb ) throws IOException { assert ( rb != null ) ; m_storeUUID = rb . getUUID ( ) ; if ( rb . getNextOffset ( ) == _NUM ) { defaultInit ( ) ; } else { final long nxtOffset = rb . getNextOffset ( ) ; m_nextAllocation = - ( int ) ( nxtOffset > > _NUM ) ; if ( m_nextAll... | 706 |
java-test-5889 | java | What are allocated the file ? | the allocation blocks | private void initfrom Root Block ( final I Root Block View rb ) throws IO Exception { assert ( rb != null ) ; m store UUID = rb . get UUID ( ) ; if ( rb . get Next Offset ( ) == NUM ) { default Init ( ) ; } else { final long nxt Offset = rb . get Next Offset ( ) ; m next Allocation = - ( int ) ( nxt Offset > > NUM ) ; ... | private void initfromRootBlock ( final IRootBlockView rb ) throws IOException { assert ( rb != null ) ; m_storeUUID = rb . getUUID ( ) ; if ( rb . getNextOffset ( ) == _NUM ) { defaultInit ( ) ; } else { final long nxtOffset = rb . getNextOffset ( ) ; m_nextAllocation = - ( int ) ( nxtOffset > > _NUM ) ; if ( m_nextAll... | 706 |
java-test-5891 | java | What does the code get ? | descriptor for provided class | static Optimized Class Descriptor class Descriptor ( Concurrent Map < Class , Optimized Class Descriptor > cls Map , Class cls , Marshaller Context ctx , Optimized Marshaller Id Mapper mapper ) throws IO Exception { Optimized Class Descriptor desc = cls Map . get ( cls ) ; if ( desc == null ) { int type Id = resolve Ty... | static OptimizedClassDescriptor classDescriptor ( ConcurrentMap < Class , OptimizedClassDescriptor > clsMap , Class cls , MarshallerContext ctx , OptimizedMarshallerIdMapper mapper ) throws IOException { OptimizedClassDescriptor desc = clsMap . get ( cls ) ; if ( desc == null ) { int typeId = resolveTypeId ( cls . getN... | 181 |
java-test-5900 | java | What does this method take care ? | of the case that a new node < < state , tableau > > in the ( state x tableau ) graph is generated after the state itself has been done . done means that the state has been found during safety checking in the state graph already , except that the node < < state , tableau > > not been created . < p > in this case , we wi... | private void add Next State ( final TLC State s , final long fp , final TB Graph Node tnode , final Order Of Solution oos , final Tableau Disk Graph dgraph ) throws IO Exception { final boolean [ ] check State Res = oos . check State ( s ) ; final int slen = check State Res . length ; final int alen = oos . get Check A... | private void addNextState ( final TLCState s , final long fp , final TBGraphNode tnode , final OrderOfSolution oos , final TableauDiskGraph dgraph ) throws IOException { final boolean [ ] checkStateRes = oos . checkState ( s ) ; final int slen = checkStateRes . length ; final int alen = oos . getCheckAction ( ) . lengt... | 764 |
java-test-5901 | java | What have a new node < < state , tableau > > in the ( state x tableau ) graph is generated after the state itself has been done means ? | that the state has been found during safety checking in the state graph already , except that the node < < state , tableau > > not been created . < p > in this case , we will have to generate the state graph successors of the state and create the permutation of all successors with all tableau nodes . < p > hopefully , ... | private void add Next State ( final TLC State s , final long fp , final TB Graph Node tnode , final Order Of Solution oos , final Tableau Disk Graph dgraph ) throws IO Exception { final boolean [ ] check State Res = oos . check State ( s ) ; final int slen = check State Res . length ; final int alen = oos . get Check A... | private void addNextState ( final TLCState s , final long fp , final TBGraphNode tnode , final OrderOfSolution oos , final TableauDiskGraph dgraph ) throws IOException { final boolean [ ] checkStateRes = oos . checkState ( s ) ; final int slen = checkStateRes . length ; final int alen = oos . getCheckAction ( ) . lengt... | 764 |
java-test-5902 | java | When is a new node < < state , tableau > > in the ( state x tableau ) graph generated ? | after the state itself has been done | private void add Next State ( final TLC State s , final long fp , final TB Graph Node tnode , final Order Of Solution oos , final Tableau Disk Graph dgraph ) throws IO Exception { final boolean [ ] check State Res = oos . check State ( s ) ; final int slen = check State Res . length ; final int alen = oos . get Check A... | private void addNextState ( final TLCState s , final long fp , final TBGraphNode tnode , final OrderOfSolution oos , final TableauDiskGraph dgraph ) throws IOException { final boolean [ ] checkStateRes = oos . checkState ( s ) ; final int slen = checkStateRes . length ; final int alen = oos . getCheckAction ( ) . lengt... | 764 |
java-test-5903 | java | What do we create with all tableau nodes ? | the permutation of all successors | private void add Next State ( final TLC State s , final long fp , final TB Graph Node tnode , final Order Of Solution oos , final Tableau Disk Graph dgraph ) throws IO Exception { final boolean [ ] check State Res = oos . check State ( s ) ; final int slen = check State Res . length ; final int alen = oos . get Check A... | private void addNextState ( final TLCState s , final long fp , final TBGraphNode tnode , final OrderOfSolution oos , final TableauDiskGraph dgraph ) throws IOException { final boolean [ ] checkStateRes = oos . checkState ( s ) ; final int slen = checkStateRes . length ; final int alen = oos . getCheckAction ( ) . lengt... | 764 |
java-test-5904 | java | What do we generate ? | the state graph successors of the state | private void add Next State ( final TLC State s , final long fp , final TB Graph Node tnode , final Order Of Solution oos , final Tableau Disk Graph dgraph ) throws IO Exception { final boolean [ ] check State Res = oos . check State ( s ) ; final int slen = check State Res . length ; final int alen = oos . get Check A... | private void addNextState ( final TLCState s , final long fp , final TBGraphNode tnode , final OrderOfSolution oos , final TableauDiskGraph dgraph ) throws IOException { final boolean [ ] checkStateRes = oos . checkState ( s ) ; final int slen = checkStateRes . length ; final int alen = oos . getCheckAction ( ) . lengt... | 764 |
java-test-5905 | java | What do it generate ? | successor nodes | private void add Next State ( final TLC State s , final long fp , final TB Graph Node tnode , final Order Of Solution oos , final Tableau Disk Graph dgraph ) throws IO Exception { final boolean [ ] check State Res = oos . check State ( s ) ; final int slen = check State Res . length ; final int alen = oos . get Check A... | private void addNextState ( final TLCState s , final long fp , final TBGraphNode tnode , final OrderOfSolution oos , final TableauDiskGraph dgraph ) throws IOException { final boolean [ ] checkStateRes = oos . checkState ( s ) ; final int slen = checkStateRes . length ; final int alen = oos . getCheckAction ( ) . lengt... | 764 |
java-test-5906 | java | What have means that the state has been found during safety checking in the state graph already , except that the node < < state , tableau > > not been created . <p> in this case , we will have to generate the state graph successors of the state and create the permutation of all successors with all tableau nodes . <p> ... | a new node < < state , tableau > > in the ( state x tableau ) graph is generated after the state itself has been done | private void add Next State ( final TLC State s , final long fp , final TB Graph Node tnode , final Order Of Solution oos , final Tableau Disk Graph dgraph ) throws IO Exception { final boolean [ ] check State Res = oos . check State ( s ) ; final int slen = check State Res . length ; final int alen = oos . get Check A... | private void addNextState ( final TLCState s , final long fp , final TBGraphNode tnode , final OrderOfSolution oos , final TableauDiskGraph dgraph ) throws IOException { final boolean [ ] checkStateRes = oos . checkState ( s ) ; final int slen = checkStateRes . length ; final int alen = oos . getCheckAction ( ) . lengt... | 764 |
java-test-5907 | java | How do we create the permutation of all successors ? | with all tableau nodes | private void add Next State ( final TLC State s , final long fp , final TB Graph Node tnode , final Order Of Solution oos , final Tableau Disk Graph dgraph ) throws IO Exception { final boolean [ ] check State Res = oos . check State ( s ) ; final int slen = check State Res . length ; final int alen = oos . get Check A... | private void addNextState ( final TLCState s , final long fp , final TBGraphNode tnode , final OrderOfSolution oos , final TableauDiskGraph dgraph ) throws IOException { final boolean [ ] checkStateRes = oos . checkState ( s ) ; final int slen = checkStateRes . length ; final int alen = oos . getCheckAction ( ) . lengt... | 764 |
java-test-5908 | java | What can we decode ? | the last two digits | public static int num Decodings ( String s ) { if ( s == null || s . length ( ) == NUM ) { return NUM ; } int len = s . length ( ) ; int [ ] ways = new int [ len + NUM ] ; ways [ NUM ] = NUM ; ways [ NUM ] = s . char At ( NUM ) == STRING ? NUM : NUM ; for ( int i = NUM ; i <= len ; i ++ ) { int code 1 = Integer . value... | public static int numDecodings ( String s ) { if ( s == null || s . length ( ) == _NUM ) { return _NUM ; } int len = s . length ( ) ; int [ ] ways = new int [ len + _NUM ] ; ways [ _NUM ] = _NUM ; ways [ _NUM ] = s . charAt ( _NUM ) == STRING ? _NUM : _NUM ; for ( int i = _NUM ; i <= len ; i ++ ) { int code1 = Integer ... | 184 |
java-test-5909 | java | What do ways = mean when string length is zero when string length is zero ? | only one way | public static int num Decodings ( String s ) { if ( s == null || s . length ( ) == NUM ) { return NUM ; } int len = s . length ( ) ; int [ ] ways = new int [ len + NUM ] ; ways [ NUM ] = NUM ; ways [ NUM ] = s . char At ( NUM ) == STRING ? NUM : NUM ; for ( int i = NUM ; i <= len ; i ++ ) { int code 1 = Integer . value... | public static int numDecodings ( String s ) { if ( s == null || s . length ( ) == _NUM ) { return _NUM ; } int len = s . length ( ) ; int [ ] ways = new int [ len + _NUM ] ; ways [ _NUM ] = _NUM ; ways [ _NUM ] = s . charAt ( _NUM ) == STRING ? _NUM : _NUM ; for ( int i = _NUM ; i <= len ; i ++ ) { int code1 = Integer ... | 184 |
java-test-5910 | java | When do ways = mean only one way ? | when string length is zero | public static int num Decodings ( String s ) { if ( s == null || s . length ( ) == NUM ) { return NUM ; } int len = s . length ( ) ; int [ ] ways = new int [ len + NUM ] ; ways [ NUM ] = NUM ; ways [ NUM ] = s . char At ( NUM ) == STRING ? NUM : NUM ; for ( int i = NUM ; i <= len ; i ++ ) { int code 1 = Integer . value... | public static int numDecodings ( String s ) { if ( s == null || s . length ( ) == _NUM ) { return _NUM ; } int len = s . length ( ) ; int [ ] ways = new int [ len + _NUM ] ; ways [ _NUM ] = _NUM ; ways [ _NUM ] = s . charAt ( _NUM ) == STRING ? _NUM : _NUM ; for ( int i = _NUM ; i <= len ; i ++ ) { int code1 = Integer ... | 184 |
java-test-5911 | java | What means only one way when string length is zero when string length is zero ? | ways [ 0 ] = | public static int num Decodings ( String s ) { if ( s == null || s . length ( ) == NUM ) { return NUM ; } int len = s . length ( ) ; int [ ] ways = new int [ len + NUM ] ; ways [ NUM ] = NUM ; ways [ NUM ] = s . char At ( NUM ) == STRING ? NUM : NUM ; for ( int i = NUM ; i <= len ; i ++ ) { int code 1 = Integer . value... | public static int numDecodings ( String s ) { if ( s == null || s . length ( ) == _NUM ) { return _NUM ; } int len = s . length ( ) ; int [ ] ways = new int [ len + _NUM ] ; ways [ _NUM ] = _NUM ; ways [ _NUM ] = s . charAt ( _NUM ) == STRING ? _NUM : _NUM ; for ( int i = _NUM ; i <= len ; i ++ ) { int code1 = Integer ... | 184 |
java-test-5912 | java | How is an expression structurally identical to one of the group ? | by expressions | public int lookup Group Expr ( Sql Node expr ) { for ( int i = NUM ; i < group Exprs . size ( ) ; i ++ ) { Sql Node group Expr = group Exprs . get ( i ) ; if ( expr . equals Deep ( group Expr , Litmus . IGNORE ) ) { return i ; } } return - NUM ; } | public int lookupGroupExpr ( SqlNode expr ) { for ( int i = _NUM ; i < groupExprs . size ( ) ; i ++ ) { SqlNode groupExpr = groupExprs . get ( i ) ; if ( expr . equalsDeep ( groupExpr , Litmus . IGNORE ) ) { return i ; } } return - _NUM ; } | 70 |
java-test-5913 | java | What does the code perform ? | the kernel density estimation step | protected void estimate Densities ( Relation < O > rel , KNN Query < O > knnq , final DBI Ds ids , Writable Data Store < double [ ] > densities ) { final int dim = dimensionality ( rel ) ; final int knum = kmax + NUM - kmin ; for ( DBID Iter iter = ids . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { densities . ... | protected void estimateDensities ( Relation < O > rel , KNNQuery < O > knnq , final DBIDs ids , WritableDataStore < double [ ] > densities ) { final int dim = dimensionality ( rel ) ; final int knum = kmax + _NUM - kmin ; for ( DBIDIter iter = ids . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { densities . put (... | 410 |
java-test-5914 | java | In which direction ll we rotate it so it ' s out of sight , and then up or down by a little bit ? | around the y - axis | private void hide Object ( ) { float [ ] rotation Matrix = new float [ NUM ] ; float [ ] pos Vec = new float [ NUM ] ; float angle XZ = ( float ) Math . random ( ) * NUM + NUM ; Matrix . set Rotate M ( rotation Matrix , NUM , angle XZ , NUM , NUM , NUM ) ; float old Object Distance = object Distance ; object Distance =... | private void hideObject ( ) { float [ ] rotationMatrix = new float [ _NUM ] ; float [ ] posVec = new float [ _NUM ] ; float angleXZ = ( float ) Math . random ( ) * _NUM + _NUM ; Matrix . setRotateM ( rotationMatrix , _NUM , angleXZ , _NUM , _NUM , _NUM ) ; float oldObjectDistance = objectDistance ; objectDistance = ( f... | 249 |
java-test-5915 | java | What does the code find ? | a new random position for the object | private void hide Object ( ) { float [ ] rotation Matrix = new float [ NUM ] ; float [ ] pos Vec = new float [ NUM ] ; float angle XZ = ( float ) Math . random ( ) * NUM + NUM ; Matrix . set Rotate M ( rotation Matrix , NUM , angle XZ , NUM , NUM , NUM ) ; float old Object Distance = object Distance ; object Distance =... | private void hideObject ( ) { float [ ] rotationMatrix = new float [ _NUM ] ; float [ ] posVec = new float [ _NUM ] ; float angleXZ = ( float ) Math . random ( ) * _NUM + _NUM ; Matrix . setRotateM ( rotationMatrix , _NUM , angleXZ , _NUM , _NUM , _NUM ) ; float oldObjectDistance = objectDistance ; objectDistance = ( f... | 249 |
java-test-5916 | java | For what purpose ll we rotate it around the y - axis ? | so it ' s out of sight , and then up or down by a little bit | private void hide Object ( ) { float [ ] rotation Matrix = new float [ NUM ] ; float [ ] pos Vec = new float [ NUM ] ; float angle XZ = ( float ) Math . random ( ) * NUM + NUM ; Matrix . set Rotate M ( rotation Matrix , NUM , angle XZ , NUM , NUM , NUM ) ; float old Object Distance = object Distance ; object Distance =... | private void hideObject ( ) { float [ ] rotationMatrix = new float [ _NUM ] ; float [ ] posVec = new float [ _NUM ] ; float angleXZ = ( float ) Math . random ( ) * _NUM + _NUM ; Matrix . setRotateM ( rotationMatrix , _NUM , angleXZ , _NUM , _NUM , _NUM ) ; float oldObjectDistance = objectDistance ; objectDistance = ( f... | 249 |
java-test-5917 | java | What is using to confirm the best match ? | blast output results | public void process ( Set < Raw Protein < PIRSF Hmmer 2 Raw Match > > blasted Raw Proteins , Map < String , Integer > blast Result Map , String blasted Matches File Path ) throws IO Exception { Map < String , Integer > sf Tb Map = sf Tb File Parser . parse ( sf Tb File Resource ) ; Map < String , PIRSF Hmmer 2 Raw Matc... | public void process ( Set < RawProtein < PIRSFHmmer2RawMatch > > blastedRawProteins , Map < String , Integer > blastResultMap , String blastedMatchesFilePath ) throws IOException { Map < String , Integer > sfTbMap = sfTbFileParser . parse ( sfTbFileResource ) ; Map < String , PIRSFHmmer2RawMatch > blastedProteinIdBestM... | 382 |
java-test-5918 | java | What do blast output results use ? | to confirm the best match | public void process ( Set < Raw Protein < PIRSF Hmmer 2 Raw Match > > blasted Raw Proteins , Map < String , Integer > blast Result Map , String blasted Matches File Path ) throws IO Exception { Map < String , Integer > sf Tb Map = sf Tb File Parser . parse ( sf Tb File Resource ) ; Map < String , PIRSF Hmmer 2 Raw Matc... | public void process ( Set < RawProtein < PIRSFHmmer2RawMatch > > blastedRawProteins , Map < String , Integer > blastResultMap , String blastedMatchesFilePath ) throws IOException { Map < String , Integer > sfTbMap = sfTbFileParser . parse ( sfTbFileResource ) ; Map < String , PIRSFHmmer2RawMatch > blastedProteinIdBestM... | 382 |
java-test-5919 | java | How does the given string indent ? | by a given number of indention strings | protected String indent ( String content , int count , String indent Str ) { String result ; String Tokenizer tok ; int i ; tok = new String Tokenizer ( content , STRING , BOOL ) ; result = STRING ; while ( tok . has More Tokens ( ) ) { if ( result . ends With ( STRING ) || ( result . length ( ) == NUM ) ) { for ( i = ... | protected String indent ( String content , int count , String indentStr ) { String result ; StringTokenizer tok ; int i ; tok = new StringTokenizer ( content , STRING , _BOOL ) ; result = STRING ; while ( tok . hasMoreTokens ( ) ) { if ( result . endsWith ( STRING ) || ( result . length ( ) == _NUM ) ) { for ( i = _NUM... | 109 |
java-test-5920 | java | What does the code replace with their unicode character representations ? | html entities in a given string | public static String replace Html Entities ( final String s ) { final String Builder t = new String Builder ( ) ; for ( int i = NUM , n = s . length ( ) ; i < n ; i ++ ) { final char c = s . char At ( i ) ; if ( c == STRING ) { final int j = s . index Of ( STRING , i ) ; if ( j >= NUM ) { final Character unicode = HTML... | public static String replaceHtmlEntities ( final String s ) { final StringBuilder t = new StringBuilder ( ) ; for ( int i = _NUM , n = s . length ( ) ; i < n ; i ++ ) { final char c = s . charAt ( i ) ; if ( c == STRING ) { final int j = s . indexOf ( STRING , i ) ; if ( j >= _NUM ) { final Character unicode = HTML_ENT... | 153 |
java-test-5922 | java | How do an array sort ? | using binary insertion sort | public static < T > void binary Insertion Sort ( T [ ] d , int left , int right , Comparator < T > comp ) { for ( int i = left + NUM ; i <= right ; i ++ ) { T t = d [ i ] ; int l = left ; for ( int r = i ; l < r ; ) { int m = ( l + r ) > > > NUM ; if ( comp . compare ( t , d [ m ] ) >= NUM ) { l = m + NUM ; } else { r ... | public static < T > void binaryInsertionSort ( T [ ] d , int left , int right , Comparator < T > comp ) { for ( int i = left + _NUM ; i <= right ; i ++ ) { T t = d [ i ] ; int l = left ; for ( int r = i ; l < r ; ) { int m = ( l + r ) > > > _NUM ; if ( comp . compare ( t , d [ m ] ) >= _NUM ) { l = m + _NUM ; } else { ... | 156 |
java-test-5923 | java | What does the code create ? | the sparsity based connection panel | public static Sparse Connection Panel create Sparsity Adjustment Panel ( Sparse connection , Network Panel network Panel ) { Sparse Connection Panel sap = new Sparse Connection Panel ( connection , network Panel ) ; sap . fill Field Values ( ) ; sap . initialize Sparse Slider ( ) ; sap . add Change Listeners ( ) ; sap ... | public static SparseConnectionPanel createSparsityAdjustmentPanel ( Sparse connection , NetworkPanel networkPanel ) { SparseConnectionPanel sap = new SparseConnectionPanel ( connection , networkPanel ) ; sap . fillFieldValues ( ) ; sap . initializeSparseSlider ( ) ; sap . addChangeListeners ( ) ; sap . addActionListene... | 78 |
java-test-5926 | java | What will receive all intended messages ? | a single consumer with no jms selector | public void test Non Discriminating Consumer ( ) throws Exception { consumer Connection = create Connection ( ) ; consumer Connection . start ( ) ; LOG . info ( STRING + consumer Connection ) ; try { Thread . sleep ( NUM ) ; } catch ( Exception e ) { } Consumer consumer = new Consumer ( consumer Connection , null ) ; T... | public void testNonDiscriminatingConsumer ( ) throws Exception { consumerConnection = createConnection ( ) ; consumerConnection . start ( ) ; LOG . info ( STRING + consumerConnection ) ; try { Thread . sleep ( _NUM ) ; } catch ( Exception e ) { } Consumer consumer = new Consumer ( consumerConnection , null ) ; Thread c... | 256 |
java-test-5928 | java | What does the code verify ? | the different flavours of the blender types | public void test Blending Type ( ) throws IO Exception { Bytes Ref pl = new Bytes Ref ( STRING ) ; long w = NUM ; Input keys [ ] = new Input [ ] { new Input ( STRING , w , pl ) } ; Path temp Dir = create Temp Dir ( STRING ) ; Analyzer a = new Standard Analyzer ( Char Array Set . EMPTY SET ) ; Blended Infix Suggester su... | public void testBlendingType ( ) throws IOException { BytesRef pl = new BytesRef ( STRING ) ; long w = _NUM ; Input keys [ ] = new Input [ ] { new Input ( STRING , w , pl ) } ; Path tempDir = createTempDir ( STRING ) ; Analyzer a = new StandardAnalyzer ( CharArraySet . EMPTY_SET ) ; BlendedInfixSuggester suggester = ne... | 509 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.