idx int64 0 165k | question stringlengths 73 5.81k | target stringlengths 5 918 |
|---|---|---|
157,100 | private static void parseLine ( Class < ? > parent , char [ ] line , int begin , int end ) { while ( begin < end && line [ begin ] == ' ' ) { begin ++ ; } if ( begin >= end || line [ begin ] == '#' ) { return ; } int cend = begin + 1 ; while ( cend < end && line [ cend ] != ' ' ) { cend ++ ; } String cname = new String... | Parse a single line from a service registry file . |
157,101 | public void readExternal ( ObjectInput in ) throws IOException , ClassNotFoundException { super . readExternal ( in ) ; this . knnDistance = in . readDouble ( ) ; } | Calls the super method and reads the knn distance of this entry from the specified input stream . |
157,102 | private Pair < Pair < KNNQuery < O > , KNNQuery < O > > , Pair < RKNNQuery < O > , RKNNQuery < O > > > getKNNAndRkNNQueries ( Database database , Relation < O > relation , StepProgress stepprog ) { DistanceQuery < O > drefQ = database . getDistanceQuery ( relation , referenceDistanceFunction ) ; KNNQuery < O > kNNRefer... | Get the kNN and rkNN queries for the algorithm . |
157,103 | public COPACNeighborPredicate . Instance instantiate ( Database database , Relation < V > relation ) { DistanceQuery < V > dq = database . getDistanceQuery ( relation , EuclideanDistanceFunction . STATIC ) ; KNNQuery < V > knnq = database . getKNNQuery ( dq , settings . k ) ; WritableDataStore < COPACModel > storage = ... | Full instantiation method . |
157,104 | protected COPACModel computeLocalModel ( DBIDRef id , DoubleDBIDList knnneighbors , Relation < V > relation ) { PCAResult epairs = settings . pca . processIds ( knnneighbors , relation ) ; int pdim = settings . filter . filter ( epairs . getEigenvalues ( ) ) ; PCAFilteredResult pcares = new PCAFilteredResult ( epairs .... | COPAC model computation |
157,105 | public ModifiableHyperBoundingBox computeMBR ( ) { E firstEntry = getEntry ( 0 ) ; if ( firstEntry == null ) { return null ; } ModifiableHyperBoundingBox mbr = new ModifiableHyperBoundingBox ( firstEntry ) ; for ( int i = 1 ; i < numEntries ; i ++ ) { mbr . extend ( getEntry ( i ) ) ; } return mbr ; } | Recomputing the MBR is rather expensive . |
157,106 | public void applyCamera ( GL2 gl ) { gl . glMatrixMode ( GL2 . GL_PROJECTION ) ; gl . glLoadIdentity ( ) ; glu . gluPerspective ( 45f , width / ( float ) height , 0.f , 10.f ) ; eye [ 0 ] = ( float ) Math . sin ( theta ) * 2.f ; eye [ 1 ] = .5f ; eye [ 2 ] = ( float ) Math . cos ( theta ) * 2.f ; glu . gluLookAt ( eye ... | Apply the camera settings . |
157,107 | private void linearScanBatchKNN ( ArrayDBIDs ids , List < KNNHeap > heaps ) { final DistanceQuery < O > dq = distanceQuery ; for ( DBIDIter iter = getRelation ( ) . getDBIDs ( ) . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { int index = 0 ; for ( DBIDIter iter2 = ids . iter ( ) ; iter2 . valid ( ) ; iter2 . adv... | Linear batch knn for arbitrary distance functions . |
157,108 | public static double [ ] [ ] computeWeightMatrix ( int bpp ) { final int dim = bpp * bpp * bpp ; final double [ ] [ ] m = new double [ dim ] [ dim ] ; final double max = 3. * ( bpp - 1. ) ; for ( int x = 0 ; x < dim ; x ++ ) { final int rx = ( x / bpp ) / bpp ; final int gx = ( x / bpp ) % bpp ; final int bx = x % bpp ... | Compute weight matrix for a RGB color histogram |
157,109 | protected void initializeDataExtends ( Relation < NumberVector > relation , int dim , double [ ] min , double [ ] extend ) { assert ( min . length == dim && extend . length == dim ) ; if ( minima == null || maxima == null || minima . length == 0 || maxima . length == 0 ) { double [ ] [ ] minmax = RelationUtil . compute... | Initialize the uniform sampling area . |
157,110 | static protected int countSharedNeighbors ( DBIDs neighbors1 , DBIDs neighbors2 ) { int intersection = 0 ; DBIDIter iter1 = neighbors1 . iter ( ) ; DBIDIter iter2 = neighbors2 . iter ( ) ; while ( iter1 . valid ( ) && iter2 . valid ( ) ) { final int comp = DBIDUtil . compare ( iter1 , iter2 ) ; if ( comp == 0 ) { inter... | Compute the intersection size |
157,111 | protected static < O > DoubleIntPair [ ] rankReferencePoints ( DistanceQuery < O > distanceQuery , O obj , ArrayDBIDs referencepoints ) { DoubleIntPair [ ] priority = new DoubleIntPair [ referencepoints . size ( ) ] ; for ( DBIDArrayIter iter = referencepoints . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { fina... | Sort the reference points by distance to the query object |
157,112 | protected static void binarySearch ( ModifiableDoubleDBIDList index , DoubleDBIDListIter iter , double val ) { int left = 0 , right = index . size ( ) ; while ( left < right ) { final int mid = ( left + right ) >>> 1 ; final double curd = iter . seek ( mid ) . doubleValue ( ) ; if ( val < curd ) { right = mid ; } else ... | Seek an iterator to the desired position using binary search . |
157,113 | public Result runAlgorithms ( Database database ) { ResultHierarchy hier = database . getHierarchy ( ) ; if ( LOG . isStatistics ( ) ) { boolean first = true ; for ( It < Index > it = hier . iterDescendants ( database ) . filter ( Index . class ) ; it . valid ( ) ; it . advance ( ) ) { if ( first ) { LOG . statistics (... | Run algorithms . |
157,114 | public CollectionResult < double [ ] > run ( Database database , Relation < O > rel ) { DistanceQuery < O > dq = rel . getDistanceQuery ( getDistanceFunction ( ) ) ; int size = rel . size ( ) ; long pairs = ( size * ( long ) size ) >> 1 ; final long ssize = sampling <= 1 ? ( long ) Math . ceil ( sampling * pairs ) : ( ... | Run the distance quantile sampler . |
157,115 | protected boolean parseLineInternal ( ) { int i = 0 ; for ( ; tokenizer . valid ( ) ; tokenizer . advance ( ) , i ++ ) { if ( ! isLabelColumn ( i ) && ! tokenizer . isQuoted ( ) ) { try { attributes . add ( tokenizer . getDouble ( ) ) ; continue ; } catch ( NumberFormatException e ) { if ( ! warnedPrecision && ( e == P... | Internal method for parsing a single line . Used by both line based parsing as well as block parsing . This saves the building of meta data for each line . |
157,116 | SimpleTypeInformation < V > getTypeInformation ( int mindim , int maxdim ) { if ( mindim > maxdim ) { throw new AbortException ( "No vectors were read from the input file - cannot determine vector data type." ) ; } if ( mindim == maxdim ) { String [ ] colnames = null ; if ( columnnames != null && mindim <= columnnames ... | Get a prototype object for the given dimensionality . |
157,117 | private void materializeKNNAndRKNNs ( ArrayDBIDs ids , FiniteProgress progress ) { for ( DBIDIter iter = ids . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { if ( materialized_RkNN . get ( iter ) == null ) { materialized_RkNN . put ( iter , new TreeSet < DoubleDBIDPair > ( ) ) ; } } List < ? extends KNNList > kNN... | Materializes the kNNs and RkNNs of the specified object IDs . |
157,118 | public DoubleDBIDList getRKNN ( DBIDRef id ) { TreeSet < DoubleDBIDPair > rKNN = materialized_RkNN . get ( id ) ; if ( rKNN == null ) { return null ; } ModifiableDoubleDBIDList ret = DBIDUtil . newDistanceDBIDList ( rKNN . size ( ) ) ; for ( DoubleDBIDPair pair : rKNN ) { ret . add ( pair ) ; } ret . sort ( ) ; return ... | Returns the materialized RkNNs of the specified id . |
157,119 | public void insert ( NumberVector nv ) { final int dim = nv . getDimensionality ( ) ; if ( root == null ) { ClusteringFeature leaf = new ClusteringFeature ( dim ) ; leaf . addToStatistics ( nv ) ; root = new TreeNode ( dim , capacity ) ; root . children [ 0 ] = leaf ; root . addToStatistics ( nv ) ; ++ leaves ; return ... | Insert a data point into the tree . |
157,120 | protected void rebuildTree ( ) { final int dim = root . getDimensionality ( ) ; double t = estimateThreshold ( root ) / leaves ; t *= t ; thresholdsq = t > thresholdsq ? t : thresholdsq ; LOG . debug ( "New squared threshold: " + thresholdsq ) ; LeafIterator iter = new LeafIterator ( root ) ; assert ( iter . valid ( ) ... | Rebuild the CFTree to condense it to approximately half the size . |
157,121 | private TreeNode insert ( TreeNode node , NumberVector nv ) { ClusteringFeature [ ] cfs = node . children ; assert ( cfs [ 0 ] != null ) : "Unexpected empty node!" ; ClusteringFeature best = cfs [ 0 ] ; double bestd = distance . squaredDistance ( nv , best ) ; for ( int i = 1 ; i < cfs . length ; i ++ ) { ClusteringFea... | Recursive insertion . |
157,122 | private boolean add ( ClusteringFeature [ ] children , ClusteringFeature child ) { for ( int i = 0 ; i < children . length ; i ++ ) { if ( children [ i ] == null ) { children [ i ] = child ; return true ; } } return false ; } | Add a node to the first unused slot . |
157,123 | protected StringBuilder printDebug ( StringBuilder buf , ClusteringFeature n , int d ) { FormatUtil . appendSpace ( buf , d ) . append ( n . n ) ; for ( int i = 0 ; i < n . getDimensionality ( ) ; i ++ ) { buf . append ( ' ' ) . append ( n . centroid ( i ) ) ; } buf . append ( " - " ) . append ( n . n ) . append ( '\n'... | Utility function for debugging . |
157,124 | public static double cdf ( double val , int v ) { double x = v / ( val * val + v ) ; return 1 - ( 0.5 * BetaDistribution . regularizedIncBeta ( x , v * .5 , 0.5 ) ) ; } | Static version of the CDF of the t - distribution for t > ; 0 |
157,125 | public void add ( DBIDRef iter , int column , double score ) { changepoints . add ( new ChangePoint ( iter , column , score ) ) ; } | Add a change point to the result . |
157,126 | public void appendToBuffer ( StringBuilder buf ) { Iterator < Polygon > iter = polygons . iterator ( ) ; while ( iter . hasNext ( ) ) { Polygon poly = iter . next ( ) ; poly . appendToBuffer ( buf ) ; if ( iter . hasNext ( ) ) { buf . append ( " -- " ) ; } } } | Append polygons to the buffer . |
157,127 | public void initialize ( CharSequence input , int begin , int end ) { this . input = input ; this . send = end ; this . matcher . reset ( input ) . region ( begin , end ) ; this . index = begin ; advance ( ) ; } | Initialize parser with a new string . |
157,128 | public String getStrippedSubstring ( ) { int sstart = start , send = end ; while ( sstart < send ) { char c = input . charAt ( sstart ) ; if ( c != ' ' || c != '\n' || c != '\r' || c != '\t' ) { break ; } ++ sstart ; } while ( -- send >= sstart ) { char c = input . charAt ( send ) ; if ( c != ' ' || c != '\n' || c != '... | Get the current part as substring |
157,129 | private char isQuote ( int index ) { if ( index >= input . length ( ) ) { return 0 ; } char c = input . charAt ( index ) ; for ( int i = 0 ; i < quoteChars . length ; i ++ ) { if ( c == quoteChars [ i ] ) { return c ; } } return 0 ; } | Detect quote characters . |
157,130 | public static WritableRecordStore makeRecordStorage ( DBIDs ids , int hints , Class < ? > ... dataclasses ) { return DataStoreFactory . FACTORY . makeRecordStorage ( ids , hints , dataclasses ) ; } | Make a new record storage to associate the given ids with an object of class dataclass . |
157,131 | public static int [ ] randomPermutation ( final int [ ] out , Random random ) { for ( int i = out . length - 1 ; i > 0 ; i -- ) { int ri = random . nextInt ( i + 1 ) ; int tmp = out [ ri ] ; out [ ri ] = out [ i ] ; out [ i ] = tmp ; } return out ; } | Perform a random permutation of the array in - place . |
157,132 | protected void makeRunnerIfNeeded ( ) { boolean stop = true ; for ( WeakReference < UpdateRunner > wur : updaterunner ) { UpdateRunner ur = wur . get ( ) ; if ( ur == null ) { updaterunner . remove ( wur ) ; } else if ( ! ur . isEmpty ( ) ) { stop = false ; } } if ( stop ) { return ; } if ( pending . get ( ) != null ) ... | Join the runnable queue of a component . |
157,133 | public void fullRedraw ( ) { if ( ! ( getWidth ( ) > 0 && getHeight ( ) > 0 ) ) { LoggingUtil . warning ( "Thumbnail of zero size requested: " + visFactory ) ; return ; } if ( thumbid < 0 ) { layer . appendChild ( SVGUtil . svgWaitIcon ( plot . getDocument ( ) , 0 , 0 , getWidth ( ) , getHeight ( ) ) ) ; if ( pendingTh... | Perform a full redraw . |
157,134 | public static Centroid make ( Relation < ? extends NumberVector > relation , DBIDs ids ) { final int dim = RelationUtil . dimensionality ( relation ) ; Centroid c = new Centroid ( dim ) ; double [ ] elems = c . elements ; int count = 0 ; for ( DBIDIter iter = ids . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { N... | Static constructor from an existing relation . |
157,135 | protected void firstRow ( double [ ] buf , int band , NumberVector v1 , NumberVector v2 , int dim2 ) { final double val1 = v1 . doubleValue ( 0 ) ; buf [ 0 ] = delta ( val1 , v2 . doubleValue ( 0 ) ) ; final int w = ( band >= dim2 ) ? dim2 - 1 : band ; for ( int j = 1 ; j <= w ; j ++ ) { buf [ j ] = buf [ j - 1 ] + del... | Fill the first row . |
157,136 | public double getWeight ( double distance , double max , double stddev ) { if ( stddev <= 0 ) { return 1 ; } double normdistance = distance / stddev ; return scaling * FastMath . exp ( - .5 * normdistance * normdistance ) / stddev ; } | Get Gaussian Weight using standard deviation for scaling . max is ignored . |
157,137 | public boolean nextLineExceptComments ( ) throws IOException { while ( nextLine ( ) ) { if ( comment == null || ! comment . reset ( buf ) . matches ( ) ) { tokenizer . initialize ( buf , 0 , buf . length ( ) ) ; return true ; } } return false ; } | Read the next line into the tokenizer . |
157,138 | public static Element makeArrow ( SVGPlot svgp , Direction dir , double x , double y , double size ) { final double hs = size / 2. ; switch ( dir ) { case LEFT : return new SVGPath ( ) . drawTo ( x + hs , y + hs ) . drawTo ( x - hs , y ) . drawTo ( x + hs , y - hs ) . drawTo ( x + hs , y + hs ) . close ( ) . makeElemen... | Draw an arrow at the given position . |
157,139 | private double hammingDistanceNumberVector ( NumberVector o1 , NumberVector o2 ) { final int d1 = o1 . getDimensionality ( ) , d2 = o2 . getDimensionality ( ) ; int differences = 0 ; int d = 0 ; for ( ; d < d1 && d < d2 ; d ++ ) { double v1 = o1 . doubleValue ( d ) , v2 = o2 . doubleValue ( d ) ; if ( v1 != v1 || v2 !=... | Version for number vectors . |
157,140 | public static long [ ] interleaveBits ( long [ ] coords , int iter ) { final int numdim = coords . length ; final long [ ] bitset = BitsUtil . zero ( numdim ) ; final long mask = 1L << 63 - iter ; for ( int dim = 0 ; dim < numdim ; dim ++ ) { if ( ( coords [ dim ] & mask ) != 0 ) { BitsUtil . setI ( bitset , dim ) ; } ... | Select the iter highest bit from each dimension . |
157,141 | public void visChanged ( VisualizationItem item ) { for ( int i = vlistenerList . size ( ) ; -- i >= 0 ; ) { final VisualizationListener listener = vlistenerList . get ( i ) ; if ( listener != null ) { listener . visualizationChanged ( item ) ; } } } | A visualization item has changed . |
157,142 | public static void setVisible ( VisualizerContext context , VisualizationTask task , boolean visibility ) { if ( visibility && task . isTool ( ) ) { Hierarchy < Object > vistree = context . getVisHierarchy ( ) ; for ( It < VisualizationTask > iter2 = vistree . iterAll ( ) . filter ( VisualizationTask . class ) ; iter2 ... | Utility function to change Visualizer visibility . |
157,143 | protected int findMerge ( int end , MatrixParadigm mat , PointerHierarchyRepresentationBuilder builder ) { assert ( end > 0 ) ; final DBIDArrayIter ix = mat . ix , iy = mat . iy ; final double [ ] matrix = mat . matrix ; double mindist = Double . POSITIVE_INFINITY ; int x = - 1 , y = - 1 ; for ( int ox = 0 , xbase = 0 ... | Perform the next merge step in AGNES . |
157,144 | private void updateCholesky ( ) { CholeskyDecomposition chol = new CholeskyDecomposition ( covariance ) ; if ( ! chol . isSPD ( ) ) { double s = 0. ; for ( int i = 0 ; i < covariance . length ; i ++ ) { s += covariance [ i ] [ i ] ; } s *= SINGULARITY_CHEAT / covariance . length ; for ( int i = 0 ; i < covariance . len... | Update the cholesky decomposition . |
157,145 | public boolean validate ( Class < ? extends C > obj ) throws ParameterException { if ( obj == null ) { throw new UnspecifiedParameterException ( this ) ; } if ( ! restrictionClass . isAssignableFrom ( obj ) ) { throw new WrongParameterValueException ( this , obj . getName ( ) , "Given class not a subclass / implementat... | Checks if the given parameter value is valid for this ClassParameter . If not a parameter exception is thrown . |
157,146 | protected void addListeners ( ) { context . addResultListener ( this ) ; context . addVisualizationListener ( this ) ; if ( task . has ( UpdateFlag . ON_DATA ) ) { context . addDataStoreListener ( this ) ; } } | Add the listeners according to the mask . |
157,147 | public void addGenerator ( Distribution gen ) { if ( trans != null ) { throw new AbortException ( "Generators may no longer be added when transformations have been applied." ) ; } axes . add ( gen ) ; dim ++ ; } | Add a new generator to the cluster . No transformations must have been added so far! |
157,148 | public void addRotation ( int axis1 , int axis2 , double angle ) { if ( trans == null ) { trans = new AffineTransformation ( dim ) ; } trans . addRotation ( axis1 , axis2 , angle ) ; } | Apply a rotation to the generator |
157,149 | public void addTranslation ( double [ ] v ) { if ( trans == null ) { trans = new AffineTransformation ( dim ) ; } trans . addTranslation ( v ) ; } | Add a translation to the generator |
157,150 | public List < double [ ] > generate ( int count ) { ArrayList < double [ ] > result = new ArrayList < > ( count ) ; while ( result . size ( ) < count ) { double [ ] d = new double [ dim ] ; for ( int i = 0 ; i < dim ; i ++ ) { d [ i ] = axes . get ( i ) . nextRandom ( ) ; } if ( trans != null ) { d = trans . apply ( d ... | Generate the given number of additional points . |
157,151 | public Clustering < MeanModel > run ( Database database , Relation < V > relation ) { final DBIDs ids = relation . getDBIDs ( ) ; double [ ] [ ] means = initializer . chooseInitialMeans ( database , relation , k , getDistanceFunction ( ) ) ; List < ModifiableDBIDs > clusters = new ArrayList < > ( ) ; for ( int i = 0 ; ... | Run k - means with cluster size constraints . |
157,152 | protected WritableDataStore < Meta > initializeMeta ( Relation < V > relation , double [ ] [ ] means ) { NumberVectorDistanceFunction < ? super V > df = getDistanceFunction ( ) ; final WritableDataStore < Meta > metas = DataStoreUtil . makeStorage ( relation . getDBIDs ( ) , DataStoreFactory . HINT_HOT | DataStoreFacto... | Initialize the metadata storage . |
157,153 | protected void transfer ( final WritableDataStore < Meta > metas , Meta meta , ModifiableDBIDs src , ModifiableDBIDs dst , DBIDRef id , int dstnum ) { src . remove ( id ) ; dst . add ( id ) ; meta . primary = dstnum ; metas . put ( id , meta ) ; } | Transfer a single element from one cluster to another . |
157,154 | public double toPValue ( double d , int n ) { double b = d / 30 + 1. / ( 36 * n ) ; double z = .5 * MathUtil . PISQUARE * MathUtil . PISQUARE * n * b ; if ( z < 1.1 || z > 8.5 ) { double e = FastMath . exp ( 0.3885037 - 1.164879 * z ) ; return ( e > 1 ) ? 1 : ( e < 0 ) ? 0 : e ; } for ( int i = 0 ; i < 86 ; i ++ ) { if... | Convert Hoeffding D value to a p - value . |
157,155 | public static void run ( DBIDs ids , Processor ... procs ) { ParallelCore core = ParallelCore . getCore ( ) ; core . connect ( ) ; try { ArrayDBIDs aids = DBIDUtil . ensureArray ( ids ) ; final int size = aids . size ( ) ; int numparts = core . getParallelism ( ) ; numparts = ( size > numparts * numparts * 16 ) ? numpa... | Run a task on all available CPUs . |
157,156 | public void replot ( ) { width = co . size ( ) ; height = ( int ) Math . ceil ( width * .2 ) ; ratio = width / ( double ) height ; height = height < MIN_HEIGHT ? MIN_HEIGHT : height > MAX_HEIGHT ? MAX_HEIGHT : height ; if ( scale == null ) { scale = computeScale ( co ) ; } BufferedImage img = new BufferedImage ( width ... | Trigger a redraw of the OPTICS plot |
157,157 | public int scaleToPixel ( double reach ) { return ( Double . isInfinite ( reach ) || Double . isNaN ( reach ) ) ? 0 : ( int ) Math . round ( scale . getScaled ( reach , height - .5 , .5 ) ) ; } | Scale a reachability distance to a pixel value . |
157,158 | public String getSVGPlotURI ( ) { if ( plotnum < 0 ) { plotnum = ThumbnailRegistryEntry . registerImage ( plot ) ; } return ThumbnailRegistryEntry . INTERNAL_PREFIX + plotnum ; } | Get the SVG registered plot number |
157,159 | public static OPTICSPlot plotForClusterOrder ( ClusterOrder co , VisualizerContext context ) { final StylingPolicy policy = context . getStylingPolicy ( ) ; OPTICSPlot opticsplot = new OPTICSPlot ( co , policy ) ; return opticsplot ; } | Static method to find an optics plot for a result or to create a new one using the given context . |
157,160 | public double [ ] [ ] inverse ( ) { double [ ] [ ] b = new double [ piv . length ] [ m ] ; for ( int i = 0 ; i < piv . length ; i ++ ) { b [ piv [ i ] ] [ i ] = 1. ; } return solveInplace ( b ) ; } | Find the inverse matrix . |
157,161 | private boolean parseLine ( ) { cureid = null ; curpoly = null ; curlbl = null ; polys . clear ( ) ; coords . clear ( ) ; labels . clear ( ) ; Matcher m = COORD . matcher ( reader . getBuffer ( ) ) ; for ( ; tokenizer . valid ( ) ; tokenizer . advance ( ) ) { m . region ( tokenizer . getStart ( ) , tokenizer . getEnd (... | Parse a single line . |
157,162 | public void runResultHandlers ( ResultHierarchy hier , Database db ) { for ( ResultHandler resulthandler : resulthandlers ) { Thread . currentThread ( ) . setName ( resulthandler . toString ( ) ) ; resulthandler . processNewResult ( hier , db ) ; } } | Run the result handlers . |
157,163 | @ SuppressWarnings ( "unchecked" ) public static void setDefaultHandlerVisualizer ( ) { defaultHandlers = new ArrayList < > ( 1 ) ; Class < ? extends ResultHandler > clz ; try { clz = ( Class < ? extends ResultHandler > ) Thread . currentThread ( ) . getContextClassLoader ( ) . loadClass ( "de.lmu.ifi.dbs.elki.result.A... | Set the default handler to the Batik addon visualizer if available . |
157,164 | public synchronized void connect ( ) { if ( executor == null ) { executor = new ThreadPoolExecutor ( 0 , processors , 10L , TimeUnit . MILLISECONDS , new LinkedBlockingQueue < Runnable > ( ) ) ; executor . allowCoreThreadTimeOut ( true ) ; } if ( ++ connected == 1 ) { executor . allowCoreThreadTimeOut ( false ) ; execu... | Connect to the executor . |
157,165 | public void add ( double x , double y ) { data . add ( x ) ; data . add ( y ) ; minx = Math . min ( minx , x ) ; maxx = Math . max ( maxx , x ) ; miny = Math . min ( miny , y ) ; maxy = Math . max ( maxy , y ) ; } | Add a coordinate pair but don t simplify |
157,166 | public void addAndSimplify ( double x , double y ) { final int len = data . size ( ) ; if ( len >= 4 ) { final double l1x = data . get ( len - 4 ) ; final double l1y = data . get ( len - 3 ) ; final double l2x = data . get ( len - 2 ) ; final double l2y = data . get ( len - 1 ) ; final double ldx = l2x - l1x ; final do... | Add a coordinate pair performing curve simplification if possible . |
157,167 | public void rescale ( double sx , double sy ) { for ( int i = 0 ; i < data . size ( ) ; i += 2 ) { data . set ( i , sx * data . get ( i ) ) ; data . set ( i + 1 , sy * data . get ( i + 1 ) ) ; } maxx *= sx ; maxy *= sy ; } | Rescale the graph . |
157,168 | private IndexTreePath < E > choosePath ( AbstractMTree < ? , N , E , ? > tree , E object , IndexTreePath < E > subtree ) { N node = tree . getNode ( subtree . getEntry ( ) ) ; if ( node . isLeaf ( ) ) { return subtree ; } int bestIdx = 0 ; E bestEntry = node . getEntry ( 0 ) ; double bestDistance = tree . distance ( ob... | Chooses the best path of the specified subtree for insertion of the given object . |
157,169 | public void rewind ( ) { synchronized ( used ) { for ( ParameterPair pair : used ) { current . addParameter ( pair ) ; } used . clear ( ) ; } } | Rewind the configuration to the initial situation |
157,170 | public UniformDistribution estimate ( double min , double max , final int count ) { double grow = ( count > 1 ) ? 0.5 * ( max - min ) / ( count - 1 ) : 0. ; return new UniformDistribution ( Math . max ( min - grow , - Double . MAX_VALUE ) , Math . min ( max + grow , Double . MAX_VALUE ) ) ; } | Estimate from simple characteristics . |
157,171 | public static double cdf ( double val , double k , double lambda , double theta ) { return ( val > theta ) ? ( 1.0 - FastMath . exp ( - FastMath . pow ( ( val - theta ) / lambda , k ) ) ) : val == val ? 0.0 : Double . NaN ; } | CDF of Weibull distribution |
157,172 | public static double quantile ( double val , double k , double lambda , double theta ) { if ( val < 0.0 || val > 1.0 ) { return Double . NaN ; } else if ( val == 0 ) { return 0.0 ; } else if ( val == 1 ) { return Double . POSITIVE_INFINITY ; } else { return theta + lambda * FastMath . pow ( - FastMath . log ( 1.0 - val... | Quantile function of Weibull distribution |
157,173 | public PCAResult processIds ( DBIDs ids , Relation < ? extends NumberVector > database ) { return processCovarMatrix ( covarianceMatrixBuilder . processIds ( ids , database ) ) ; } | Run PCA on a collection of database IDs . |
157,174 | public PCAResult processQueryResult ( DoubleDBIDList results , Relation < ? extends NumberVector > database ) { return processCovarMatrix ( covarianceMatrixBuilder . processQueryResults ( results , database ) ) ; } | Run PCA on a QueryResult Collection . |
157,175 | public boolean isFullRank ( ) { double t = 0. ; for ( int j = 0 ; j < n ; j ++ ) { double v = Rdiag [ j ] ; if ( v == 0 ) { return false ; } v = Math . abs ( v ) ; t = v > t ? v : t ; } t *= 1e-15 ; for ( int j = 1 ; j < n ; j ++ ) { if ( Math . abs ( Rdiag [ j ] ) < t ) { return false ; } } return true ; } | Is the matrix full rank? |
157,176 | public int rank ( double t ) { int rank = n ; for ( int j = 0 ; j < n ; j ++ ) { if ( Math . abs ( Rdiag [ j ] ) <= t ) { -- rank ; } } return rank ; } | Get the matrix rank? |
157,177 | private void setupCSS ( VisualizerContext context , SVGPlot svgp , XYPlot plot ) { StyleLibrary style = context . getStyleLibrary ( ) ; for ( XYPlot . Curve curve : plot ) { CSSClass csscls = new CSSClass ( this , SERIESID + curve . getColor ( ) ) ; csscls . setStatement ( SVGConstants . SVG_FILL_ATTRIBUTE , SVGConstan... | Setup the CSS classes for the plot . |
157,178 | public int compareTo ( EigenPair o ) { if ( this . eigenvalue < o . eigenvalue ) { return - 1 ; } if ( this . eigenvalue > o . eigenvalue ) { return + 1 ; } return 0 ; } | Compares this object with the specified object for order . Returns a negative integer zero or a positive integer as this object s eigenvalue is greater than equal to or less than the specified object s eigenvalue . |
157,179 | protected static double calcPosterior ( double f , double alpha , double mu , double sigma , double lambda ) { final double pi = calcP_i ( f , mu , sigma ) ; final double qi = calcQ_i ( f , lambda ) ; return ( alpha * pi ) / ( alpha * pi + ( 1.0 - alpha ) * qi ) ; } | Compute the a posterior probability for the given parameters . |
157,180 | public void split ( ) { if ( hasChildren ( ) ) { return ; } final boolean issplit = ( maxSplitDimension >= ( getDimensionality ( ) - 1 ) ) ; final int childLevel = issplit ? level + 1 : level ; final int splitDim = issplit ? 0 : maxSplitDimension + 1 ; final double splitPoint = getMin ( splitDim ) + ( getMax ( splitDim... | Splits this interval into 2 children . |
157,181 | public void run ( ) { MultipleObjectsBundle data = generator . loadData ( ) ; if ( LOG . isVerbose ( ) ) { LOG . verbose ( "Writing output ..." ) ; } try { if ( outputFile . exists ( ) && LOG . isVerbose ( ) ) { LOG . verbose ( "The file " + outputFile + " already exists, " + "the generator result will be APPENDED." ) ... | Runs the wrapper with the specified arguments . |
157,182 | private static long getGlobalSeed ( ) { String sseed = System . getProperty ( "elki.seed" ) ; return ( sseed != null ) ? Long . parseLong ( sseed ) : System . nanoTime ( ) ; } | Initialize the default random . |
157,183 | public double computeFirstCover ( boolean leaf ) { double max = 0. ; for ( DistanceEntry < E > e : firstAssignments ) { double cover = leaf ? e . getDistance ( ) : ( e . getEntry ( ) . getCoveringRadius ( ) + e . getDistance ( ) ) ; max = cover > max ? cover : max ; } return max ; } | Compute the covering radius of the first assignment . |
157,184 | public double computeSecondCover ( boolean leaf ) { double max = 0. ; for ( DistanceEntry < E > e : secondAssignments ) { double cover = leaf ? e . getDistance ( ) : ( e . getEntry ( ) . getCoveringRadius ( ) + e . getDistance ( ) ) ; max = cover > max ? cover : max ; } return max ; } | Compute the covering radius of the second assignment . |
157,185 | protected void offerAt ( final int pos , O e ) { if ( pos == NO_VALUE ) { if ( size + 1 > queue . length ) { resize ( size + 1 ) ; } index . put ( e , size ) ; size ++ ; heapifyUp ( size - 1 , e ) ; heapModified ( ) ; return ; } assert ( pos >= 0 ) : "Unexpected negative position." ; assert ( queue [ pos ] . equals ( e... | Offer element at the given position . |
157,186 | public O removeObject ( O e ) { int pos = index . getInt ( e ) ; return ( pos >= 0 ) ? removeAt ( pos ) : null ; } | Remove the given object from the queue . |
157,187 | private long sumMatrix ( int [ ] [ ] mat ) { long ret = 0 ; for ( int i = 0 ; i < mat . length ; i ++ ) { final int [ ] row = mat [ i ] ; for ( int j = 0 ; j < row . length ; j ++ ) { ret += row [ j ] ; } } return ret ; } | Compute the sum of a matrix . |
157,188 | private int countAboveThreshold ( int [ ] [ ] mat , double threshold ) { int ret = 0 ; for ( int i = 0 ; i < mat . length ; i ++ ) { int [ ] row = mat [ i ] ; for ( int j = 0 ; j < row . length ; j ++ ) { if ( row [ j ] >= threshold ) { ret ++ ; } } } return ret ; } | Count the number of cells above the threshold . |
157,189 | private int [ ] [ ] houghTransformation ( boolean [ ] [ ] mat ) { final int xres = mat . length , yres = mat [ 0 ] . length ; final double tscale = STEPS * .66 / ( xres + yres ) ; final int [ ] [ ] ret = new int [ STEPS ] [ STEPS ] ; for ( int x = 0 ; x < mat . length ; x ++ ) { final boolean [ ] row = mat [ x ] ; for ... | Perform a hough transformation on the binary image in mat . |
157,190 | private static void drawLine ( int x0 , int y0 , int x1 , int y1 , boolean [ ] [ ] pic ) { final int xres = pic . length , yres = pic [ 0 ] . length ; y0 = ( y0 < 0 ) ? 0 : ( y0 >= yres ) ? ( yres - 1 ) : y0 ; y1 = ( y1 < 0 ) ? 0 : ( y1 >= yres ) ? ( yres - 1 ) : y1 ; x0 = ( x0 < 0 ) ? 0 : ( x0 >= xres ) ? ( xres - 1 )... | Draw a line onto the array using the classic Bresenham algorithm . |
157,191 | public Collection < String > getPossibleValues ( ) { final E [ ] enums = enumClass . getEnumConstants ( ) ; ArrayList < String > values = new ArrayList < > ( enums . length ) ; for ( E t : enums ) { values . add ( t . name ( ) ) ; } return values ; } | Get a list of possible values for this enum parameter . |
157,192 | private String joinEnumNames ( String separator ) { E [ ] enumTypes = enumClass . getEnumConstants ( ) ; StringBuilder sb = new StringBuilder ( ) ; for ( int i = 0 ; i < enumTypes . length ; ++ i ) { if ( i > 0 ) { sb . append ( separator ) ; } sb . append ( enumTypes [ i ] . name ( ) ) ; } return sb . toString ( ) ; } | Utility method for merging possible values into a string for informational messages . |
157,193 | protected void preInsert ( MkMaxEntry entry ) { KNNHeap knns_o = DBIDUtil . newHeap ( getKmax ( ) ) ; preInsert ( entry , getRootEntry ( ) , knns_o ) ; } | Adapts the knn distances before insertion of the specified entry . |
157,194 | public static IntIterator getCommonDimensions ( Collection < SplitHistory > splitHistories ) { Iterator < SplitHistory > it = splitHistories . iterator ( ) ; long [ ] checkSet = BitsUtil . copy ( it . next ( ) . dimBits ) ; while ( it . hasNext ( ) ) { SplitHistory sh = it . next ( ) ; BitsUtil . andI ( checkSet , sh .... | Get the common split dimensions from a list of split histories . |
157,195 | public static Filter handleURL ( ParsedURL url ) { if ( LOG . isDebuggingFiner ( ) ) { LOG . debugFiner ( "handleURL " + url . toString ( ) ) ; } if ( ! isCompatibleURLStatic ( url ) ) { return null ; } int id ; try { id = ParseUtil . parseIntBase10 ( url . getPath ( ) ) ; } catch ( NumberFormatException e ) { return n... | Statically handle the URL access . |
157,196 | public static int globalCentroid ( Centroid overallCentroid , Relation < ? extends NumberVector > rel , List < ? extends Cluster < ? > > clusters , NumberVector [ ] centroids , NoiseHandling noiseOption ) { int clustercount = 0 ; Iterator < ? extends Cluster < ? > > ci = clusters . iterator ( ) ; for ( int i = 0 ; ci .... | Update the global centroid . |
157,197 | public DBID findPrototype ( DBIDs members ) { DBIDIter it = members . iter ( ) ; DBIDVar proto = DBIDUtil . newVar ( it ) , last = DBIDUtil . newVar ( it ) ; int maxprio = Integer . MIN_VALUE , secprio = Integer . MIN_VALUE ; for ( ; it . valid ( ) ; it . advance ( ) ) { int prio = mergeOrder . intValue ( it ) ; if ( p... | Extract the prototype of a given cluster . When the argument is not a valid cluster of this Pointer Hierarchy the return value is unspecified . |
157,198 | public void bulkLoad ( DBIDs ids ) { if ( ids . size ( ) == 0 ) { return ; } assert ( root == null ) : "Tree already initialized." ; DBIDIter it = ids . iter ( ) ; DBID first = DBIDUtil . deref ( it ) ; ModifiableDoubleDBIDList candidates = DBIDUtil . newDistanceDBIDList ( ids . size ( ) - 1 ) ; for ( it . advance ( ) ... | Bulk - load the index . |
157,199 | private void checkCoverTree ( Node cur , int [ ] counts , int depth ) { counts [ 0 ] += 1 ; counts [ 1 ] += depth ; counts [ 2 ] = depth > counts [ 2 ] ? depth : counts [ 2 ] ; counts [ 3 ] += cur . singletons . size ( ) - 1 ; counts [ 4 ] += cur . singletons . size ( ) - ( cur . children == null ? 0 : 1 ) ; if ( cur .... | Collect some statistics on the tree . |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.