idx int64 0 165k | question stringlengths 73 4.15k | target stringlengths 5 918 | len_question int64 21 890 | len_target int64 3 255 |
|---|---|---|---|---|
157,300 | public Document cloneDocument ( DOMImplementation domImpl , Document document ) { Element root = document . getDocumentElement ( ) ; // New document Document result = domImpl . createDocument ( root . getNamespaceURI ( ) , root . getNodeName ( ) , null ) ; Element rroot = result . getDocumentElement ( ) ; // Cloning th... | Deep - clone a document . | 289 | 6 |
157,301 | public Node cloneNode ( Document doc , Node eold ) { return doc . importNode ( eold , true ) ; } | Clone an existing node . | 26 | 6 |
157,302 | public void copyAttributes ( Document doc , Element eold , Element enew ) { if ( eold . hasAttributes ( ) ) { NamedNodeMap attr = eold . getAttributes ( ) ; int len = attr . getLength ( ) ; for ( int i = 0 ; i < len ; i ++ ) { enew . setAttributeNode ( ( Attr ) doc . importNode ( attr . item ( i ) , true ) ) ; } } } | Copy the attributes from an existing node to a new node . | 99 | 12 |
157,303 | protected String getFilename ( Object result , String filenamepre ) { if ( filenamepre == null || filenamepre . length ( ) == 0 ) { filenamepre = "result" ; } for ( int i = 0 ; ; i ++ ) { String filename = i > 0 ? filenamepre + "-" + i : filenamepre ; Object existing = filenames . get ( filename ) ; if ( existing == nu... | Try to find a unique file name . | 108 | 8 |
157,304 | @ SuppressWarnings ( "unchecked" ) public void output ( Database db , Result r , StreamFactory streamOpener , Pattern filter ) throws IOException { List < Relation < ? > > ra = new LinkedList <> ( ) ; List < OrderingResult > ro = new LinkedList <> ( ) ; List < Clustering < ? > > rc = new LinkedList <> ( ) ; List < Iter... | Stream output . | 568 | 3 |
157,305 | @ Override public void writeExternal ( ObjectOutput out ) throws IOException { super . writeExternal ( out ) ; out . writeObject ( approximation ) ; } | Calls the super method and writes the polynomiale approximation of the knn distances of this entry to the specified stream . | 33 | 26 |
157,306 | @ Override public void readExternal ( ObjectInput in ) throws IOException , ClassNotFoundException { super . readExternal ( in ) ; approximation = ( PolynomialApproximation ) in . readObject ( ) ; } | Calls the super method and reads the the polynomial approximation of the knn distances of this entry from the specified input stream . | 47 | 27 |
157,307 | private WritableIntegerDataStore computeSubtreeSizes ( DBIDs order ) { WritableIntegerDataStore siz = DataStoreUtil . makeIntegerStorage ( ids , DataStoreFactory . HINT_HOT | DataStoreFactory . HINT_TEMP , 1 ) ; DBIDVar v1 = DBIDUtil . newVar ( ) ; for ( DBIDIter it = order . iter ( ) ; it . valid ( ) ; it . advance ( ... | Compute the size of all subtrees . | 153 | 9 |
157,308 | private WritableDoubleDataStore computeMaxHeight ( ) { WritableDoubleDataStore maxheight = DataStoreUtil . makeDoubleStorage ( ids , DataStoreFactory . HINT_HOT | DataStoreFactory . HINT_TEMP , 0. ) ; DBIDVar v1 = DBIDUtil . newVar ( ) ; for ( DBIDIter it = ids . iter ( ) ; it . valid ( ) ; it . advance ( ) ) { double ... | Compute the maximum height of nodes . | 179 | 8 |
157,309 | public ArrayDBIDs topologicalSort ( ) { ArrayModifiableDBIDs ids = DBIDUtil . newArray ( this . ids ) ; if ( mergeOrder != null ) { ids . sort ( new DataStoreUtil . AscendingByIntegerDataStore ( mergeOrder ) ) ; WritableDoubleDataStore maxheight = computeMaxHeight ( ) ; ids . sort ( new Sorter ( maxheight ) ) ; maxheig... | Topological sort the object IDs . | 475 | 7 |
157,310 | public static int [ ] range ( int start , int end ) { int [ ] out = new int [ end - start ] ; for ( int i = 0 , j = start ; j < end ; i ++ , j ++ ) { out [ i ] = j ; } return out ; } | Initialize an integer value range . | 61 | 7 |
157,311 | private void doReverseKNNQuery ( int k , DBIDRef q , ModifiableDoubleDBIDList result , ModifiableDBIDs candidates ) { final ComparableMinHeap < MTreeSearchCandidate > pq = new ComparableMinHeap <> ( ) ; // push root pq . add ( new MTreeSearchCandidate ( 0. , getRootID ( ) , null , Double . NaN ) ) ; // search in tree w... | Performs a reverse knn query . | 528 | 8 |
157,312 | protected void expirePage ( P page ) { if ( LOG . isDebuggingFine ( ) ) { LOG . debugFine ( "Write to backing:" + page . getPageID ( ) ) ; } if ( page . isDirty ( ) ) { file . writePage ( page ) ; } } | Write page through to disk . | 63 | 6 |
157,313 | public void setCacheSize ( int cacheSize ) { this . cacheSize = cacheSize ; long toDelete = map . size ( ) - this . cacheSize ; if ( toDelete <= 0 ) { return ; } List < Integer > keys = new ArrayList <> ( map . keySet ( ) ) ; Collections . reverse ( keys ) ; for ( Integer id : keys ) { P page = map . remove ( id ) ; fi... | Sets the maximum size of this cache . | 100 | 9 |
157,314 | public static String getFilenameExtension ( String name ) { if ( name == null ) { return null ; } int index = name . lastIndexOf ( ' ' ) ; return index < 0 ? null : name . substring ( index + 1 ) . toLowerCase ( ) ; } | Returns the lower case extension of the selected file . | 60 | 10 |
157,315 | public static InputStream tryGzipInput ( InputStream in ) throws IOException { // try autodetecting gzip compression. if ( ! in . markSupported ( ) ) { PushbackInputStream pb = new PushbackInputStream ( in , 16 ) ; // read a magic from the file header, and push it back byte [ ] magic = { 0 , 0 } ; int r = pb . read ( m... | Try to open a stream as gzip if it starts with the gzip magic . | 213 | 17 |
157,316 | public static File locateFile ( String name , String basedir ) { // Try exact match first. File f = new File ( name ) ; if ( f . exists ( ) ) { return f ; } // Try with base directory if ( basedir != null ) { if ( ( f = new File ( basedir , name ) ) . exists ( ) ) { return f ; } } // try stripping whitespace String nam... | Try to locate an file in the filesystem given a partial name and a prefix . | 328 | 16 |
157,317 | protected void addInternal ( double dist , int id ) { if ( size == dists . length ) { grow ( ) ; } dists [ size ] = dist ; ids [ size ] = id ; ++ size ; } | Add an entry consisting of distance and internal index . | 47 | 10 |
157,318 | protected void grow ( ) { if ( dists == EMPTY_DISTS ) { dists = new double [ INITIAL_SIZE ] ; ids = new int [ INITIAL_SIZE ] ; return ; } final int len = dists . length ; final int newlength = len + ( len >> 1 ) + 1 ; double [ ] odists = dists ; dists = new double [ newlength ] ; System . arraycopy ( odists , 0 , dists... | Grow the data storage . | 152 | 6 |
157,319 | protected void reverse ( ) { for ( int i = 0 , j = size - 1 ; i < j ; i ++ , j -- ) { double tmpd = dists [ j ] ; dists [ j ] = dists [ i ] ; dists [ i ] = tmpd ; int tmpi = ids [ j ] ; ids [ j ] = ids [ i ] ; ids [ i ] = tmpi ; } } | Reverse the list . | 94 | 6 |
157,320 | public void truncate ( int newsize ) { if ( newsize < size ) { double [ ] odists = dists ; dists = new double [ newsize ] ; System . arraycopy ( odists , 0 , dists , 0 , newsize ) ; int [ ] oids = ids ; ids = new int [ newsize ] ; System . arraycopy ( oids , 0 , ids , 0 , newsize ) ; size = newsize ; } } | Truncate the list to the given size freeing the memory . | 101 | 13 |
157,321 | private RectangleArranger < PlotItem > arrangeVisualizations ( double width , double height ) { if ( ! ( width > 0. && height > 0. ) ) { LOG . warning ( "No size information during arrange()" , new Throwable ( ) ) ; return new RectangleArranger <> ( 1. , 1. ) ; } RectangleArranger < PlotItem > plotmap = new RectangleAr... | Recompute the layout of visualizations . | 461 | 9 |
157,322 | public void initialize ( double ratio ) { if ( ! ( ratio > 0 && ratio < Double . POSITIVE_INFINITY ) ) { LOG . warning ( "Invalid ratio: " + ratio , new Throwable ( ) ) ; ratio = 1.4 ; } this . ratio = ratio ; if ( plot != null ) { LOG . warning ( "Already initialized." ) ; lazyRefresh ( ) ; return ; } reinitialize ( )... | Initialize the plot . | 118 | 5 |
157,323 | private void initializePlot ( ) { plot = new VisualizationPlot ( ) ; { // Add a background element: CSSClass cls = new CSSClass ( this , "background" ) ; final String bgcol = context . getStyleLibrary ( ) . getBackgroundColor ( StyleLibrary . PAGE ) ; cls . setStatement ( SVGConstants . CSS_FILL_PROPERTY , bgcol ) ; pl... | Initialize the SVG plot . | 691 | 6 |
157,324 | private Visualization embedOrThumbnail ( final int thumbsize , PlotItem it , VisualizationTask task , Element parent ) { final Visualization vis ; if ( ! single ) { vis = task . getFactory ( ) . makeVisualizationOrThumbnail ( context , task , plot , it . w , it . h , it . proj , thumbsize ) ; } else { vis = task . getF... | Produce thumbnail for a visualizer . | 218 | 8 |
157,325 | protected boolean visibleInOverview ( VisualizationTask task ) { return task . isVisible ( ) && ! task . has ( single ? RenderFlag . NO_EMBED : RenderFlag . NO_THUMBNAIL ) ; } | Test whether a task should be displayed in the overview plot . | 50 | 12 |
157,326 | private void recalcViewbox ( ) { final Element root = plot . getRoot ( ) ; // Reset plot attributes SVGUtil . setAtt ( root , SVGConstants . SVG_WIDTH_ATTRIBUTE , "20cm" ) ; SVGUtil . setAtt ( root , SVGConstants . SVG_HEIGHT_ATTRIBUTE , SVGUtil . fmt ( 20 * plotmap . getHeight ( ) / plotmap . getWidth ( ) ) + "cm" ) ;... | Recompute the view box of the plot . | 178 | 10 |
157,327 | protected void triggerSubplotSelectEvent ( PlotItem it ) { // forward event to all listeners. for ( ActionListener actionListener : actionListeners ) { actionListener . actionPerformed ( new DetailViewSelectedEvent ( this , ActionEvent . ACTION_PERFORMED , null , 0 , it ) ) ; } } | When a subplot was selected forward the event to listeners . | 67 | 12 |
157,328 | public static double cdf ( double val , double mu , double sigma , double xi ) { val = ( val - mu ) / sigma ; // Check support: if ( val < 0 ) { return 0. ; } if ( xi < 0 && val > - 1. / xi ) { return 1. ; } return 1 - FastMath . pow ( 1 + xi * val , - 1. / xi ) ; } | CDF of GPD distribution | 94 | 6 |
157,329 | public static double quantile ( double val , double mu , double sigma , double xi ) { if ( val < 0.0 || val > 1.0 ) { return Double . NaN ; } if ( xi == 0. ) { return mu - sigma * FastMath . log ( 1 - val ) ; } return mu - sigma / xi * ( 1 - FastMath . pow ( 1 - val , - xi ) ) ; } | Quantile function of GPD distribution | 97 | 7 |
157,330 | public Result run ( Database database , Relation < O > relation , Relation < NumberVector > radrel ) { if ( queries != null ) { throw new AbortException ( "This 'run' method will not use the given query set!" ) ; } // Get a distance and kNN query instance. DistanceQuery < O > distQuery = database . getDistanceQuery ( r... | Run the algorithm with separate radius relation | 425 | 7 |
157,331 | public static long [ ] random ( int card , int capacity , Random random ) { if ( card < 0 || card > capacity ) { throw new IllegalArgumentException ( "Cannot set " + card + " out of " + capacity + " bits." ) ; } // FIXME: Avoid recomputing the cardinality. if ( card < capacity >>> 1 ) { long [ ] bitset = BitsUtil . zer... | Creates a new BitSet of fixed cardinality with randomly set bits . | 240 | 15 |
157,332 | public static long [ ] copy ( long [ ] v , int mincap ) { int words = ( ( mincap - 1 ) >>> LONG_LOG2_SIZE ) + 1 ; if ( v . length == words ) { return Arrays . copyOf ( v , v . length ) ; } long [ ] ret = new long [ words ] ; System . arraycopy ( v , 0 , ret , 0 , Math . min ( v . length , words ) ) ; return ret ; } | Copy a bitset . | 102 | 5 |
157,333 | public static boolean isZero ( long [ ] v ) { for ( int i = 0 ; i < v . length ; i ++ ) { if ( v [ i ] != 0 ) { return false ; } } return true ; } | Test for the bitstring to be all - zero . | 48 | 11 |
157,334 | public static long [ ] setI ( long [ ] v , long [ ] o ) { assert ( o . length <= v . length ) : "Bit set sizes do not agree." ; final int max = Math . min ( v . length , o . length ) ; for ( int i = 0 ; i < max ; i ++ ) { v [ i ] = o [ i ] ; } return v ; } | Put o onto v in - place i . e . v = o | 86 | 14 |
157,335 | public static void onesI ( long [ ] v , int bits ) { final int fillWords = bits >>> LONG_LOG2_SIZE ; final int fillBits = bits & LONG_LOG2_MASK ; Arrays . fill ( v , 0 , fillWords , LONG_ALL_BITS ) ; if ( fillBits > 0 ) { v [ fillWords ] = ( 1L << fillBits ) - 1 ; } if ( fillWords + 1 < v . length ) { Arrays . fill ( v... | Fill a vector initialized with bits ones . | 126 | 8 |
157,336 | public static long [ ] xorI ( long [ ] v , long [ ] o ) { assert ( o . length <= v . length ) : "Bit set sizes do not agree." ; for ( int i = 0 ; i < o . length ; i ++ ) { v [ i ] ^= o [ i ] ; } return v ; } | XOR o onto v in - place i . e . v ^ = o | 73 | 16 |
157,337 | public static long [ ] orI ( long [ ] v , long [ ] o ) { assert ( o . length <= v . length ) : "Bit set sizes do not agree." ; final int max = Math . min ( v . length , o . length ) ; for ( int i = 0 ; i < max ; i ++ ) { v [ i ] |= o [ i ] ; } return v ; } | OR o onto v in - place i . e . v | = o | 87 | 15 |
157,338 | public static long [ ] andI ( long [ ] v , long [ ] o ) { int i = 0 ; for ( ; i < o . length ; i ++ ) { v [ i ] &= o [ i ] ; } // Zero higher words Arrays . fill ( v , i , v . length , 0 ) ; return v ; } | AND o onto v in - place i . e . v & ; = o | 73 | 17 |
157,339 | public static long [ ] nandI ( long [ ] v , long [ ] o ) { int i = 0 ; for ( ; i < o . length ; i ++ ) { v [ i ] &= ~ o [ i ] ; } return v ; } | NOTAND o onto v in - place i . e . v & ; = ~o | 55 | 19 |
157,340 | public static long [ ] invertI ( long [ ] v ) { for ( int i = 0 ; i < v . length ; i ++ ) { v [ i ] = ~ v [ i ] ; } return v ; } | Invert v in - place . | 48 | 7 |
157,341 | public static long cycleLeftC ( long v , int shift , int len ) { return shift == 0 ? v : shift < 0 ? cycleRightC ( v , - shift , len ) : // ( ( ( v ) << ( shift ) ) | ( ( v ) >>> ( ( len ) - ( shift ) ) ) ) & ( ( 1 << len ) - 1 ) ; } | Rotate a long to the left cyclic with length len | 80 | 12 |
157,342 | public static long [ ] cycleLeftI ( long [ ] v , int shift , int len ) { long [ ] t = copy ( v , len , shift ) ; return orI ( shiftRightI ( v , len - shift ) , truncateI ( t , len ) ) ; } | Cycle a bitstring to the right . | 61 | 9 |
157,343 | public static int numberOfTrailingZerosSigned ( long [ ] v ) { for ( int p = 0 ; ; p ++ ) { if ( p == v . length ) { return - 1 ; } if ( v [ p ] != 0 ) { return Long . numberOfTrailingZeros ( v [ p ] ) + p * Long . SIZE ; } } } | Find the number of trailing zeros . | 80 | 8 |
157,344 | public static int numberOfLeadingZerosSigned ( long [ ] v ) { for ( int p = 0 , ip = v . length - 1 ; p < v . length ; p ++ , ip -- ) { if ( v [ ip ] != 0 ) { return Long . numberOfLeadingZeros ( v [ ip ] ) + p * Long . SIZE ; } } return - 1 ; } | Find the number of leading zeros . | 86 | 8 |
157,345 | public static int previousClearBit ( long v , int start ) { if ( start < 0 ) { return - 1 ; } start = start < Long . SIZE ? start : Long . SIZE - 1 ; long cur = ~ v & ( LONG_ALL_BITS >>> - ( start + 1 ) ) ; return cur == 0 ? - 1 : 63 - Long . numberOfLeadingZeros ( cur ) ; } | Find the previous clear bit . | 89 | 6 |
157,346 | public static int nextSetBit ( long v , int start ) { if ( start >= Long . SIZE ) { return - 1 ; } start = start < 0 ? 0 : start ; long cur = v & ( LONG_ALL_BITS << start ) ; return cur == 0 ? - 1 : cur == LONG_ALL_BITS ? 0 : Long . numberOfTrailingZeros ( cur ) ; } | Find the next set bit . | 87 | 6 |
157,347 | public static boolean intersect ( long [ ] x , long [ ] y ) { final int min = ( x . length < y . length ) ? x . length : y . length ; for ( int i = 0 ; i < min ; i ++ ) { if ( ( x [ i ] & y [ i ] ) != 0L ) { return true ; } } return false ; } | Test whether two Bitsets intersect . | 80 | 7 |
157,348 | public static int intersectionSize ( long [ ] x , long [ ] y ) { final int lx = x . length , ly = y . length ; final int min = ( lx < ly ) ? lx : ly ; int res = 0 ; for ( int i = 0 ; i < min ; i ++ ) { res += Long . bitCount ( x [ i ] & y [ i ] ) ; } return res ; } | Compute the intersection size of two Bitsets . | 91 | 10 |
157,349 | public static int unionSize ( long [ ] x , long [ ] y ) { final int lx = x . length , ly = y . length ; final int min = ( lx < ly ) ? lx : ly ; int i = 0 , res = 0 ; for ( ; i < min ; i ++ ) { res += Long . bitCount ( x [ i ] | y [ i ] ) ; } for ( ; i < lx ; i ++ ) { res += Long . bitCount ( x [ i ] ) ; } for ( ; i < l... | Compute the union size of two Bitsets . | 142 | 10 |
157,350 | public static boolean equal ( long [ ] x , long [ ] y ) { if ( x == null || y == null ) { return ( x == null ) && ( y == null ) ; } int p = Math . min ( x . length , y . length ) - 1 ; for ( int i = x . length - 1 ; i > p ; i -- ) { if ( x [ i ] != 0L ) { return false ; } } for ( int i = y . length - 1 ; i > p ; i -- )... | Test two bitsets for equality | 162 | 6 |
157,351 | public static int compare ( long [ ] x , long [ ] y ) { if ( x == null ) { return ( y == null ) ? 0 : - 1 ; } if ( y == null ) { return + 1 ; } int p = Math . min ( x . length , y . length ) - 1 ; for ( int i = x . length - 1 ; i > p ; i -- ) { if ( x [ i ] != 0 ) { return + 1 ; } } for ( int i = y . length - 1 ; i > p... | Compare two bitsets . | 219 | 5 |
157,352 | @ Override public int compareTo ( DistanceEntry < E > o ) { int comp = Double . compare ( distance , o . distance ) ; return comp ; // return comp != 0 ? comp : // entry.getEntryID().compareTo(o.entry.getEntryID()); } | Compares this object with the specified object for order . | 61 | 11 |
157,353 | private double [ ] knnDistances ( O object ) { KNNList knns = knnq . getKNNForObject ( object , getKmax ( ) - 1 ) ; double [ ] distances = new double [ getKmax ( ) ] ; int i = 0 ; for ( DoubleDBIDListIter iter = knns . iter ( ) ; iter . valid ( ) && i < getKmax ( ) ; iter . advance ( ) , i ++ ) { distances [ i ] = iter... | Returns the knn distance of the object with the specified id . | 117 | 13 |
157,354 | protected double downsample ( double [ ] data , int start , int end , int size ) { double sum = 0 ; for ( int i = start ; i < end ; i ++ ) { sum += data [ i ] ; } return sum ; } | Perform downsampling on a number of bins . | 52 | 11 |
157,355 | public void setRotationZ ( double rotationZ ) { this . rotationZ = rotationZ ; this . cosZ = FastMath . cos ( rotationZ ) ; this . sinZ = FastMath . sin ( rotationZ ) ; fireCameraChangedEvent ( ) ; } | Set the z rotation angle in radians . | 56 | 9 |
157,356 | public void apply ( GL2 gl ) { // 3D projection gl . glMatrixMode ( GL2 . GL_PROJECTION ) ; gl . glLoadIdentity ( ) ; // Perspective. glu . gluPerspective ( 35 , ratio , 1 , 1000 ) ; glu . gluLookAt ( distance * sinZ , distance * - cosZ , height , // pos 0 , 0 , .5 , // center 0 , 0 , 1 // up ) ; // Change back to mode... | Apply the camera to a GL context . | 217 | 8 |
157,357 | public void project ( double x , double y , double z , double [ ] out ) { glu . gluProject ( x , y , z , modelview , 0 , projection , 0 , viewp , 0 , out , 0 ) ; } | Project a coordinate | 52 | 3 |
157,358 | public void addCameraListener ( CameraListener lis ) { if ( listeners == null ) { listeners = new ArrayList <> ( 5 ) ; } listeners . add ( lis ) ; } | Add a camera listener . | 40 | 5 |
157,359 | public static AffineTransformation axisProjection ( int dim , int ax1 , int ax2 ) { // setup a projection to get the data into the interval -1:+1 in each // dimension with the intended-to-see dimensions first. AffineTransformation proj = AffineTransformation . reorderAxesTransformation ( dim , ax1 , ax2 ) ; // Assuming... | Compute an transformation matrix to show only axis ax1 and ax2 . | 203 | 15 |
157,360 | protected ApproximationLine conservativeKnnDistanceApproximation ( int k_max ) { // determine k_0, y_1, y_kmax int k_0 = k_max ; double y_1 = Double . NEGATIVE_INFINITY ; double y_kmax = Double . NEGATIVE_INFINITY ; for ( int i = 0 ; i < getNumEntries ( ) ; i ++ ) { MkCoPEntry entry = getEntry ( i ) ; ApproximationLine... | Determines and returns the conservative approximation for the knn distances of this node as the maximum of the conservative approximations of all entries . | 393 | 29 |
157,361 | protected ApproximationLine progressiveKnnDistanceApproximation ( int k_max ) { if ( ! isLeaf ( ) ) { throw new UnsupportedOperationException ( "Progressive KNN-distance approximation " + "is only vailable in leaf nodes!" ) ; } // determine k_0, y_1, y_kmax int k_0 = 0 ; double y_1 = Double . POSITIVE_INFINITY ; double... | Determines and returns the progressive approximation for the knn distances of this node as the maximum of the progressive approximations of all entries . | 385 | 29 |
157,362 | public CSSClass addClass ( CSSClass clss ) throws CSSNamingConflict { CSSClass existing = store . get ( clss . getName ( ) ) ; if ( existing != null && existing . getOwner ( ) != null && existing . getOwner ( ) != clss . getOwner ( ) ) { throw new CSSNamingConflict ( "CSS class naming conflict between " + clss . getOwn... | Add a single class to the map . | 131 | 8 |
157,363 | public synchronized void removeClass ( CSSClass clss ) { CSSClass existing = store . get ( clss . getName ( ) ) ; if ( existing == clss ) { store . remove ( existing . getName ( ) ) ; } } | Remove a single CSS class from the map . Note that classes are removed by reference not by name! | 51 | 20 |
157,364 | public CSSClass getClass ( String name , Object owner ) throws CSSNamingConflict { CSSClass existing = store . get ( name ) ; // Not found. if ( existing == null ) { return null ; } // Different owner if ( owner != null && existing . getOwner ( ) != owner ) { throw new CSSNamingConflict ( "CSS class naming conflict bet... | Retrieve a single class by name and owner | 109 | 9 |
157,365 | public void serialize ( StringBuilder buf ) { for ( CSSClass clss : store . values ( ) ) { clss . appendCSSDefinition ( buf ) ; } } | Serialize managed CSS classes to rule file . | 36 | 9 |
157,366 | public boolean mergeCSSFrom ( CSSClassManager other ) throws CSSNamingConflict { for ( CSSClass clss : other . getClasses ( ) ) { this . addClass ( clss ) ; } return true ; } | Merge CSS classes for example to merge two plots . | 48 | 11 |
157,367 | public void updateStyleElement ( Document document , Element style ) { StringBuilder buf = new StringBuilder ( ) ; serialize ( buf ) ; Text cont = document . createTextNode ( buf . toString ( ) ) ; while ( style . hasChildNodes ( ) ) { style . removeChild ( style . getFirstChild ( ) ) ; } style . appendChild ( cont ) ;... | Update the text contents of an existing style element . | 82 | 10 |
157,368 | private static double calculate_MDEF_norm ( Node sn , Node cg ) { // get the square sum of the counting neighborhoods box counts long sq = sn . getSquareSum ( cg . getLevel ( ) - sn . getLevel ( ) ) ; /* * if the square sum is equal to box count of the sampling Neighborhood then * n_hat is equal one, and as cg needs to... | Method for the MDEF calculation | 377 | 6 |
157,369 | public void writeBundleStream ( BundleStreamSource source , WritableByteChannel output ) throws IOException { ByteBuffer buffer = ByteBuffer . allocateDirect ( INITIAL_BUFFER ) ; DBIDVar var = DBIDUtil . newVar ( ) ; ByteBufferSerializer < ? > [ ] serializers = null ; loop : while ( true ) { BundleStreamSource . Event ... | Write a bundle stream to a file output channel . | 469 | 10 |
157,370 | private void flushBuffer ( ByteBuffer buffer , WritableByteChannel output ) throws IOException { buffer . flip ( ) ; output . write ( buffer ) ; buffer . flip ( ) ; buffer . limit ( buffer . capacity ( ) ) ; } | Flush the current write buffer to disk . | 50 | 9 |
157,371 | private ByteBuffer ensureBuffer ( int size , ByteBuffer buffer , WritableByteChannel output ) throws IOException { if ( buffer . remaining ( ) >= size ) { return buffer ; } flushBuffer ( buffer , output ) ; if ( buffer . remaining ( ) >= size ) { return buffer ; } // Aggressively grow the buffer return ByteBuffer . all... | Ensure the buffer is large enough . | 98 | 8 |
157,372 | private ByteBufferSerializer < ? > [ ] writeHeader ( BundleStreamSource source , ByteBuffer buffer , WritableByteChannel output ) throws IOException { final BundleMeta meta = source . getMeta ( ) ; final int nummeta = meta . size ( ) ; @ SuppressWarnings ( "rawtypes" ) final ByteBufferSerializer [ ] serializers = new B... | Write the header for the given stream to the stream . | 365 | 11 |
157,373 | protected void runDBSCAN ( Relation < O > relation , RangeQuery < O > rangeQuery ) { final int size = relation . size ( ) ; FiniteProgress objprog = LOG . isVerbose ( ) ? new FiniteProgress ( "Processing objects" , size , LOG ) : null ; IndefiniteProgress clusprog = LOG . isVerbose ( ) ? new IndefiniteProgress ( "Numbe... | Run the DBSCAN algorithm | 299 | 6 |
157,374 | protected void expandCluster ( Relation < O > relation , RangeQuery < O > rangeQuery , DBIDRef startObjectID , ArrayModifiableDBIDs seeds , FiniteProgress objprog , IndefiniteProgress clusprog ) { DoubleDBIDList neighbors = rangeQuery . getRangeForDBID ( startObjectID , epsilon ) ; ncounter += neighbors . size ( ) ; //... | DBSCAN - function expandCluster . | 380 | 9 |
157,375 | private void processNeighbors ( DoubleDBIDListIter neighbor , ModifiableDBIDs currentCluster , ArrayModifiableDBIDs seeds ) { final boolean ismetric = getDistanceFunction ( ) . isMetric ( ) ; for ( ; neighbor . valid ( ) ; neighbor . advance ( ) ) { if ( processedIDs . add ( neighbor ) ) { if ( ! ismetric || neighbor .... | Process a single core point . | 127 | 6 |
157,376 | private double loglikelihoodAnomalous ( DBIDs anomalousObjs ) { return anomalousObjs . isEmpty ( ) ? 0 : anomalousObjs . size ( ) * - FastMath . log ( anomalousObjs . size ( ) ) ; } | Loglikelihood anomalous objects . Uniform distribution . | 56 | 10 |
157,377 | private double loglikelihoodNormal ( DBIDs objids , SetDBIDs anomalous , CovarianceMatrix builder , Relation < V > relation ) { double [ ] mean = builder . getMeanVector ( ) ; final LUDecomposition lu = new LUDecomposition ( builder . makeSampleMatrix ( ) ) ; double [ ] [ ] covInv = lu . inverse ( ) ; // for each objec... | Computes the loglikelihood of all normal objects . Gaussian model | 251 | 14 |
157,378 | private DoubleMinMax exactMinMax ( Relation < O > relation , DistanceQuery < O > distFunc ) { final FiniteProgress progress = LOG . isVerbose ( ) ? new FiniteProgress ( "Exact fitting distance computations" , relation . size ( ) , LOG ) : null ; DoubleMinMax minmax = new DoubleMinMax ( ) ; // find exact minimum and max... | Compute the exact maximum and minimum . | 227 | 8 |
157,379 | @ Override protected void preInsert ( RdKNNEntry entry ) { KNNHeap knns_o = DBIDUtil . newHeap ( settings . k_max ) ; preInsert ( entry , getRootEntry ( ) , knns_o ) ; } | Performs necessary operations before inserting the specified entry . | 58 | 10 |
157,380 | @ Override protected void postDelete ( RdKNNEntry entry ) { // reverse knn of o ModifiableDoubleDBIDList rnns = DBIDUtil . newDistanceDBIDList ( ) ; doReverseKNN ( getRoot ( ) , ( ( RdKNNLeafEntry ) entry ) . getDBID ( ) , rnns ) ; // knn of rnn ArrayModifiableDBIDs ids = DBIDUtil . newArray ( rnns ) ; ids . sort ( ) ;... | Performs necessary operations after deleting the specified object . | 175 | 10 |
157,381 | private void doReverseKNN ( RdKNNNode node , DBID oid , ModifiableDoubleDBIDList result ) { if ( node . isLeaf ( ) ) { for ( int i = 0 ; i < node . getNumEntries ( ) ; i ++ ) { RdKNNLeafEntry entry = ( RdKNNLeafEntry ) node . getEntry ( i ) ; double distance = distanceQuery . distance ( entry . getDBID ( ) , oid ) ; if... | Performs a reverse knn query in the specified subtree . | 244 | 13 |
157,382 | private void doBulkReverseKNN ( RdKNNNode node , DBIDs ids , Map < DBID , ModifiableDoubleDBIDList > result ) { if ( node . isLeaf ( ) ) { for ( int i = 0 ; i < node . getNumEntries ( ) ; i ++ ) { RdKNNLeafEntry entry = ( RdKNNLeafEntry ) node . getEntry ( i ) ; for ( DBIDIter iter = ids . iter ( ) ; iter . valid ( ) ;... | Performs a bulk reverse knn query in the specified subtree . | 377 | 14 |
157,383 | private void checkDistanceFunction ( SpatialPrimitiveDistanceFunction < ? super O > distanceFunction ) { if ( ! settings . distanceFunction . equals ( distanceFunction ) ) { throw new IllegalArgumentException ( "Parameter distanceFunction must be an instance of " + this . distanceQuery . getClass ( ) + ", but is " + di... | Throws an IllegalArgumentException if the specified distance function is not an instance of the distance function used by this index . | 80 | 25 |
157,384 | @ Override public final void insertAll ( DBIDs ids ) { if ( ids . isEmpty ( ) || ( ids . size ( ) == 1 ) ) { return ; } // Make an example leaf if ( canBulkLoad ( ) ) { List < RdKNNEntry > leafs = new ArrayList <> ( ids . size ( ) ) ; for ( DBIDIter iter = ids . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { leaf... | Inserts the specified objects into this index . If a bulk load mode is implemented the objects are inserted in one bulk . | 185 | 24 |
157,385 | public int correlationDistance ( PCAFilteredResult pca1 , PCAFilteredResult pca2 , int dimensionality ) { // TODO: Can we delay copying the matrixes? // pca of rv1 double [ ] [ ] v1t = copy ( pca1 . getEigenvectors ( ) ) ; double [ ] [ ] v1t_strong = pca1 . getStrongEigenvectors ( ) ; int lambda1 = pca1 . getCorrelatio... | Computes the correlation distance between the two subspaces defined by the specified PCAs . | 771 | 18 |
157,386 | public static double logcdf ( double val , double shape1 , double shape2 ) { if ( val == Double . NEGATIVE_INFINITY ) { return Double . NEGATIVE_INFINITY ; } if ( val == Double . POSITIVE_INFINITY ) { return 0. ; } if ( val != val ) { return Double . NaN ; } if ( shape1 == 0. ) { val = FastMath . exp ( - val ) ; } else... | Cumulative density function for location = 0 scale = 1 | 251 | 12 |
157,387 | private double naiveQuerySparse ( SparseNumberVector obj , WritableDoubleDataStore scores , HashSetModifiableDBIDs cands ) { double len = 0. ; // Length of query object, for final normalization for ( int iter = obj . iter ( ) ; obj . iterValid ( iter ) ; iter = obj . iterAdvance ( iter ) ) { final int dim = obj . iterD... | Query the most similar objects sparse version . | 224 | 8 |
157,388 | private double naiveQueryDense ( NumberVector obj , WritableDoubleDataStore scores , HashSetModifiableDBIDs cands ) { double len = 0. ; // Length of query object, for final normalization for ( int dim = 0 , max = obj . getDimensionality ( ) ; dim < max ; dim ++ ) { final double val = obj . doubleValue ( dim ) ; if ( va... | Query the most similar objects dense version . | 204 | 8 |
157,389 | private double naiveQuery ( V obj , WritableDoubleDataStore scores , HashSetModifiableDBIDs cands ) { if ( obj instanceof SparseNumberVector ) { return naiveQuerySparse ( ( SparseNumberVector ) obj , scores , cands ) ; } else { return naiveQueryDense ( obj , scores , cands ) ; } } | Query the most similar objects abstract version . | 75 | 8 |
157,390 | protected BundleStreamSource invokeStreamFilters ( BundleStreamSource stream ) { assert ( stream != null ) ; if ( filters == null ) { return stream ; } // We dynamically switch between streaming and bundle operations. MultipleObjectsBundle bundle = null ; for ( ObjectFilter filter : filters ) { if ( filter instanceof S... | Transforms the specified list of objects and their labels into a list of objects and their associations . | 148 | 19 |
157,391 | private void inferCallerELKI ( ) { needToInferCaller = false ; StackTraceElement [ ] stack = ( new Throwable ( ) ) . getStackTrace ( ) ; int ix = 0 ; // skip back to the logger. while ( ix < stack . length ) { StackTraceElement frame = stack [ ix ] ; final String cls = frame . getClassName ( ) ; if ( cls . equals ( STA... | Infer a caller ignoring logging - related classes . | 255 | 10 |
157,392 | public static SamplingResult getSamplingResult ( final Relation < ? > rel ) { Collection < SamplingResult > selections = ResultUtil . filterResults ( rel . getHierarchy ( ) , rel , SamplingResult . class ) ; if ( selections . isEmpty ( ) ) { final SamplingResult newsam = new SamplingResult ( rel ) ; ResultUtil . addChi... | Get the sampling result attached to a relation | 108 | 8 |
157,393 | public Element render ( SVGPlot svgp ) { Element tag = svgp . svgElement ( SVGConstants . SVG_G_TAG ) ; Element button = svgp . svgRect ( x , y , w , h ) ; if ( ! Double . isNaN ( r ) ) { SVGUtil . setAtt ( button , SVGConstants . SVG_RX_ATTRIBUTE , r ) ; SVGUtil . setAtt ( button , SVGConstants . SVG_RY_ATTRIBUTE , r ... | Produce the actual SVG elements for the button . | 578 | 10 |
157,394 | public void setTitle ( String title , String textcolor ) { this . title = title ; if ( titlecss == null ) { titlecss = new CSSClass ( this , "text" ) ; titlecss . setStatement ( SVGConstants . CSS_TEXT_ANCHOR_PROPERTY , SVGConstants . CSS_MIDDLE_VALUE ) ; titlecss . setStatement ( SVGConstants . CSS_FILL_PROPERTY , tex... | Set the button title | 129 | 4 |
157,395 | private Pair < PlotItem , VisualizationTask > key ( PlotItem item , VisualizationTask task ) { return new Pair <> ( item , task ) ; } | Helper function for building a key object | 34 | 7 |
157,396 | private Pair < Element , Visualization > value ( Element elem , Visualization vis ) { return new Pair <> ( elem , vis ) ; } | Helper function to build a value pair | 32 | 7 |
157,397 | public void put ( PlotItem it , VisualizationTask task , Element elem , Visualization vis ) { map . put ( key ( it , task ) , value ( elem , vis ) ) ; } | Put a new combination into the map . | 43 | 8 |
157,398 | public Pair < Element , Visualization > remove ( PlotItem it , VisualizationTask task ) { return map . remove ( key ( it , task ) ) ; } | Remove a combination . | 34 | 4 |
157,399 | public void put ( PlotItem it , VisualizationTask task , Pair < Element , Visualization > pair ) { map . put ( key ( it , task ) , pair ) ; } | Put a new item into the visualizations | 38 | 8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.