idx int64 0 41.2k | question stringlengths 83 4.15k | target stringlengths 5 715 |
|---|---|---|
33,900 | public static boolean almostEquals ( final double [ ] m1 , final double [ ] m2 , final double maxdelta ) { if ( m1 == m2 ) { return true ; } if ( m1 == null || m2 == null ) { return false ; } final int rowdim = m1 . length ; if ( rowdim != m2 . length ) { return false ; } for ( int i = 0 ; i < rowdim ; i ++ ) { if ( Ma... | Compare two matrices with a delta parameter to take numerical errors into account . |
33,901 | public static double angle ( double [ ] v1 , double [ ] v2 ) { final int mindim = ( v1 . length <= v2 . length ) ? v1 . length : v2 . length ; double s = 0 , e1 = 0 , e2 = 0 ; for ( int k = 0 ; k < mindim ; k ++ ) { final double r1 = v1 [ k ] , r2 = v2 [ k ] ; s += r1 * r2 ; e1 += r1 * r1 ; e2 += r2 * r2 ; } for ( int ... | Compute the cosine of the angle between two vectors where the smaller angle between those vectors is viewed . |
33,902 | protected void updateFromSelection ( ) { DBIDSelection sel = context . getSelection ( ) ; if ( sel != null ) { this . dbids = DBIDUtil . newArray ( sel . getSelectedIds ( ) ) ; this . dbids . sort ( ) ; } else { this . dbids = DBIDUtil . newArray ( ) ; } } | Update our selection |
33,903 | public static DataStoreEvent insertionEvent ( DBIDs inserts ) { return new DataStoreEvent ( inserts , DBIDUtil . EMPTYDBIDS , DBIDUtil . EMPTYDBIDS ) ; } | Insertion event . |
33,904 | public static DataStoreEvent removalEvent ( DBIDs removals ) { return new DataStoreEvent ( DBIDUtil . EMPTYDBIDS , removals , DBIDUtil . EMPTYDBIDS ) ; } | Removal event . |
33,905 | public static DataStoreEvent updateEvent ( DBIDs updates ) { return new DataStoreEvent ( DBIDUtil . EMPTYDBIDS , DBIDUtil . EMPTYDBIDS , updates ) ; } | Update event . |
33,906 | private Visualization instantiateVisualization ( VisualizationTask task ) { try { Visualization v = task . getFactory ( ) . makeVisualization ( context , task , this , width , height , item . proj ) ; if ( task . has ( RenderFlag . NO_EXPORT ) ) { v . getLayer ( ) . setAttribute ( NO_EXPORT_ATTRIBUTE , NO_EXPORT_ATTRIB... | Instantiate a visualization . |
33,907 | public void destroy ( ) { context . removeVisualizationListener ( this ) ; context . removeResultListener ( this ) ; for ( Entry < VisualizationTask , Visualization > v : taskmap . entrySet ( ) ) { Visualization vis = v . getValue ( ) ; if ( vis != null ) { vis . destroy ( ) ; } } taskmap . clear ( ) ; } | Cleanup function . To remove listeners . |
33,908 | private void lazyRefresh ( ) { Runnable pr = new Runnable ( ) { public void run ( ) { if ( pendingRefresh . compareAndSet ( this , null ) ) { refresh ( ) ; } } } ; pendingRefresh . set ( pr ) ; scheduleUpdate ( pr ) ; } | Trigger a refresh . |
33,909 | public boolean nextLine ( ) throws IOException { while ( reader . readLine ( buf . delete ( 0 , buf . length ( ) ) ) ) { ++ lineNumber ; if ( lengthWithoutLinefeed ( buf ) > 0 ) { return true ; } } return false ; } | Read the next line . |
33,910 | public static int lengthWithoutLinefeed ( CharSequence line ) { int length = line . length ( ) ; while ( length > 0 ) { char last = line . charAt ( length - 1 ) ; if ( last != '\n' && last != '\r' ) { break ; } -- length ; } return length ; } | Get the length of the string not taking trailing linefeeds into account . |
33,911 | public synchronized void logAndClearReportedErrors ( ) { for ( ParameterException e : getErrors ( ) ) { if ( LOG . isDebugging ( ) ) { LOG . warning ( e . getMessage ( ) , e ) ; } else { LOG . warning ( e . getMessage ( ) ) ; } } clearErrors ( ) ; } | Log any error that has accumulated . |
33,912 | public void addParameter ( Object owner , Parameter < ? > param , TrackParameters track ) { this . setBorder ( new SoftBevelBorder ( SoftBevelBorder . LOWERED ) ) ; ParameterConfigurator cfg = null ; { Object cur = owner ; while ( cur != null ) { cfg = childconfig . get ( cur ) ; if ( cfg != null ) { break ; } cur = tr... | Add parameter to this panel . |
33,913 | protected static < E extends MTreeEntry , N extends AbstractMTreeNode < ? , N , E > > double [ ] [ ] computeDistanceMatrix ( AbstractMTree < ? , N , E , ? > tree , N node ) { final int n = node . getNumEntries ( ) ; double [ ] [ ] distancematrix = new double [ n ] [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { E ei = node ... | Compute the pairwise distances in the given node . |
33,914 | protected static double sparsity ( final int setsize , final int dbsize , final int k , final double phi ) { final double fK = MathUtil . powi ( 1. / phi , k ) ; return ( setsize - ( dbsize * fK ) ) / FastMath . sqrt ( dbsize * fK * ( 1 - fK ) ) ; } | Method to calculate the sparsity coefficient of . |
33,915 | protected DBIDs computeSubspace ( int [ ] subspace , ArrayList < ArrayList < DBIDs > > ranges ) { HashSetModifiableDBIDs ids = DBIDUtil . newHashSet ( ranges . get ( subspace [ 0 ] ) . get ( subspace [ 1 ] ) ) ; for ( int i = 2 , e = subspace . length - 1 ; i < e ; i += 2 ) { DBIDs current = ranges . get ( subspace [ i... | Method to get the ids in the given subspace . |
33,916 | protected DBIDs computeSubspaceForGene ( short [ ] gene , ArrayList < ArrayList < DBIDs > > ranges ) { HashSetModifiableDBIDs m = null ; for ( int i = 0 ; i < gene . length ; i ++ ) { if ( gene [ i ] != DONT_CARE ) { DBIDs current = ranges . get ( i ) . get ( gene [ i ] - GENE_OFFSET ) ; if ( m == null ) { m = DBIDUtil... | Get the DBIDs in the current subspace . |
33,917 | private static void updateFilterSDASet ( double mib , List < SteepDownArea > sdaset , double ixi ) { Iterator < SteepDownArea > iter = sdaset . iterator ( ) ; while ( iter . hasNext ( ) ) { SteepDownArea sda = iter . next ( ) ; if ( sda . getMaximum ( ) * ixi <= mib ) { iter . remove ( ) ; } else { if ( mib > sda . get... | Update the mib values of SteepDownAreas and remove obsolete areas . |
33,918 | private static void sort5 ( double [ ] keys , int [ ] vals , final int m1 , final int m2 , final int m3 , final int m4 , final int m5 ) { if ( keys [ m1 ] > keys [ m2 ] ) { swap ( keys , vals , m1 , m2 ) ; } if ( keys [ m3 ] > keys [ m4 ] ) { swap ( keys , vals , m3 , m4 ) ; } if ( keys [ m2 ] > keys [ m4 ] ) { swap ( ... | An explicit sort for the five pivot candidates . |
33,919 | private static void swap ( double [ ] keys , int [ ] vals , int j , int i ) { double td = keys [ j ] ; keys [ j ] = keys [ i ] ; keys [ i ] = td ; int ti = vals [ j ] ; vals [ j ] = vals [ i ] ; vals [ i ] = ti ; } | Swap two entries . |
33,920 | public EvaluationResult . MeasurementGroup newGroup ( String string ) { EvaluationResult . MeasurementGroup g = new MeasurementGroup ( string ) ; groups . add ( g ) ; return g ; } | Add a new measurement group . |
33,921 | public EvaluationResult . MeasurementGroup findOrCreateGroup ( String label ) { for ( EvaluationResult . MeasurementGroup g : groups ) { if ( label . equals ( g . getName ( ) ) ) { return g ; } } return newGroup ( label ) ; } | Find or add a new measurement group . |
33,922 | public int numLines ( ) { int r = header . size ( ) ; for ( MeasurementGroup m : groups ) { r += 1 + m . measurements . size ( ) ; } return r ; } | Number of lines recommended for display . |
33,923 | public static EvaluationResult findOrCreate ( ResultHierarchy hierarchy , Result parent , String name , String shortname ) { ArrayList < EvaluationResult > ers = ResultUtil . filterResults ( hierarchy , parent , EvaluationResult . class ) ; EvaluationResult ev = null ; for ( EvaluationResult e : ers ) { if ( shortname ... | Find or create an evaluation result . |
33,924 | public Document cloneDocument ( DOMImplementation domImpl , Document document ) { Element root = document . getDocumentElement ( ) ; Document result = domImpl . createDocument ( root . getNamespaceURI ( ) , root . getNodeName ( ) , null ) ; Element rroot = result . getDocumentElement ( ) ; boolean before = true ; for (... | Deep - clone a document . |
33,925 | public Node cloneNode ( Document doc , Node eold ) { return doc . importNode ( eold , true ) ; } | Clone an existing node . |
33,926 | 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 . |
33,927 | 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 . |
33,928 | @ 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 < I... | Stream output . |
33,929 | 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,930 | 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 . |
33,931 | 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 . |
33,932 | 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 . |
33,933 | 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 . |
33,934 | 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 . |
33,935 | private void doReverseKNNQuery ( int k , DBIDRef q , ModifiableDoubleDBIDList result , ModifiableDBIDs candidates ) { final ComparableMinHeap < MTreeSearchCandidate > pq = new ComparableMinHeap < > ( ) ; pq . add ( new MTreeSearchCandidate ( 0. , getRootID ( ) , null , Double . NaN ) ) ; while ( ! pq . isEmpty ( ) ) { ... | Performs a reverse knn query . |
33,936 | 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 . |
33,937 | 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 ) ; f... | Sets the maximum size of this cache . |
33,938 | 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 . |
33,939 | public static InputStream tryGzipInput ( InputStream in ) throws IOException { if ( ! in . markSupported ( ) ) { PushbackInputStream pb = new PushbackInputStream ( in , 16 ) ; byte [ ] magic = { 0 , 0 } ; int r = pb . read ( magic ) ; pb . unread ( magic , 0 , r ) ; return ( magic [ 0 ] == 31 && magic [ 1 ] == - 117 ) ... | Try to open a stream as gzip if it starts with the gzip magic . |
33,940 | public static File locateFile ( String name , String basedir ) { File f = new File ( name ) ; if ( f . exists ( ) ) { return f ; } if ( basedir != null ) { if ( ( f = new File ( basedir , name ) ) . exists ( ) ) { return f ; } } String name2 ; if ( ! name . equals ( name2 = name . trim ( ) ) ) { if ( ( f = locateFile (... | Try to locate an file in the filesystem given a partial name and a prefix . |
33,941 | 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 . |
33,942 | 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 . |
33,943 | 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 . |
33,944 | 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 . |
33,945 | 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 RectangleA... | Recompute the layout of visualizations . |
33,946 | 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 . |
33,947 | private void initializePlot ( ) { plot = new VisualizationPlot ( ) ; { CSSClass cls = new CSSClass ( this , "background" ) ; final String bgcol = context . getStyleLibrary ( ) . getBackgroundColor ( StyleLibrary . PAGE ) ; cls . setStatement ( SVGConstants . CSS_FILL_PROPERTY , bgcol ) ; plot . addCSSClassOrLogError ( ... | Initialize the SVG plot . |
33,948 | 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 . |
33,949 | 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 . |
33,950 | private void recalcViewbox ( ) { final Element root = plot . getRoot ( ) ; SVGUtil . setAtt ( root , SVGConstants . SVG_WIDTH_ATTRIBUTE , "20cm" ) ; SVGUtil . setAtt ( root , SVGConstants . SVG_HEIGHT_ATTRIBUTE , SVGUtil . fmt ( 20 * plotmap . getHeight ( ) / plotmap . getWidth ( ) ) + "cm" ) ; String vb = "0 0 " + SVG... | Recompute the view box of the plot . |
33,951 | protected void triggerSubplotSelectEvent ( PlotItem it ) { 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 . |
33,952 | public static double cdf ( double val , double mu , double sigma , double xi ) { val = ( val - mu ) / sigma ; 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 |
33,953 | 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 |
33,954 | 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!" ) ; } DistanceQuery < O > distQuery = database . getDistanceQuery ( relation , getDistanceFunction ( ) ) ; Rang... | Run the algorithm with separate radius relation |
33,955 | 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." ) ; } if ( card < capacity >>> 1 ) { long [ ] bitset = BitsUtil . zero ( capacity ) ; for ( int todo = card ; todo... | Creates a new BitSet of fixed cardinality with randomly set bits . |
33,956 | 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 . |
33,957 | 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 . |
33,958 | 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 |
33,959 | 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 . |
33,960 | 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 |
33,961 | 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 |
33,962 | public static long [ ] andI ( long [ ] v , long [ ] o ) { int i = 0 ; for ( ; i < o . length ; i ++ ) { v [ i ] &= o [ i ] ; } Arrays . fill ( v , i , v . length , 0 ) ; return v ; } | AND o onto v in - place i . e . v & ; = o |
33,963 | 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 |
33,964 | public static long [ ] invertI ( long [ ] v ) { for ( int i = 0 ; i < v . length ; i ++ ) { v [ i ] = ~ v [ i ] ; } return v ; } | Invert v in - place . |
33,965 | 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 |
33,966 | 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 . |
33,967 | 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 . |
33,968 | 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 . |
33,969 | 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 . |
33,970 | 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 . |
33,971 | 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 . |
33,972 | 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 . |
33,973 | 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 . |
33,974 | 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 |
33,975 | 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 . |
33,976 | public int compareTo ( DistanceEntry < E > o ) { int comp = Double . compare ( distance , o . distance ) ; return comp ; } | Compares this object with the specified object for order . |
33,977 | 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 . |
33,978 | 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 . |
33,979 | 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 . |
33,980 | public void apply ( GL2 gl ) { gl . glMatrixMode ( GL2 . GL_PROJECTION ) ; gl . glLoadIdentity ( ) ; glu . gluPerspective ( 35 , ratio , 1 , 1000 ) ; glu . gluLookAt ( distance * sinZ , distance * - cosZ , height , 0 , 0 , .5 , 0 , 0 , 1 ) ; gl . glMatrixMode ( GL2 . GL_MODELVIEW ) ; gl . glLoadIdentity ( ) ; gl . glGe... | Apply the camera to a GL context . |
33,981 | 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 |
33,982 | public void addCameraListener ( CameraListener lis ) { if ( listeners == null ) { listeners = new ArrayList < > ( 5 ) ; } listeners . add ( lis ) ; } | Add a camera listener . |
33,983 | public static AffineTransformation axisProjection ( int dim , int ax1 , int ax2 ) { AffineTransformation proj = AffineTransformation . reorderAxesTransformation ( dim , ax1 , ax2 ) ; double [ ] trans = new double [ dim ] ; for ( int i = 0 ; i < dim ; i ++ ) { trans [ i ] = - .5 ; } proj . addTranslation ( trans ) ; pro... | Compute an transformation matrix to show only axis ax1 and ax2 . |
33,984 | protected ApproximationLine conservativeKnnDistanceApproximation ( int k_max ) { 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 approx = entry . getConservat... | Determines and returns the conservative approximation for the knn distances of this node as the maximum of the conservative approximations of all entries . |
33,985 | protected ApproximationLine progressiveKnnDistanceApproximation ( int k_max ) { if ( ! isLeaf ( ) ) { throw new UnsupportedOperationException ( "Progressive KNN-distance approximation " + "is only vailable in leaf nodes!" ) ; } int k_0 = 0 ; double y_1 = Double . POSITIVE_INFINITY ; double y_kmax = Double . POSITIVE_IN... | Determines and returns the progressive approximation for the knn distances of this node as the maximum of the progressive approximations of all entries . |
33,986 | 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 . |
33,987 | 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! |
33,988 | public CSSClass getClass ( String name , Object owner ) throws CSSNamingConflict { CSSClass existing = store . get ( name ) ; if ( existing == null ) { return null ; } if ( owner != null && existing . getOwner ( ) != owner ) { throw new CSSNamingConflict ( "CSS class naming conflict between " + owner . toString ( ) + "... | Retrieve a single class by name and owner |
33,989 | public void serialize ( StringBuilder buf ) { for ( CSSClass clss : store . values ( ) ) { clss . appendCSSDefinition ( buf ) ; } } | Serialize managed CSS classes to rule file . |
33,990 | 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 . |
33,991 | 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 . |
33,992 | private static double calculate_MDEF_norm ( Node sn , Node cg ) { long sq = sn . getSquareSum ( cg . getLevel ( ) - sn . getLevel ( ) ) ; if ( sq == sn . getCount ( ) ) { return 0.0 ; } long cb = sn . getCubicSum ( cg . getLevel ( ) - sn . getLevel ( ) ) ; double n_hat = ( double ) sq / sn . getCount ( ) ; double sig_n... | Method for the MDEF calculation |
33,993 | 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 . |
33,994 | 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 . |
33,995 | 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 ; } return ByteBuffer . allocateDirect ( Math . max ( buffe... | Ensure the buffer is large enough . |
33,996 | 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 . |
33,997 | 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 |
33,998 | 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 ( ) ; if... | DBSCAN - function expandCluster . |
33,999 | 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 . |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.