code stringlengths 73 34.1k | label stringclasses 1
value |
|---|---|
public Element renderCheckBox(SVGPlot svgp, double x, double y, double size) {
// create check
final Element checkmark = SVGEffects.makeCheckmark(svgp);
checkmark.setAttribute(SVGConstants.SVG_TRANSFORM_ATTRIBUTE, "scale(" + (size / 12) + ") translate(" + x + " " + y + ")");
if(!checked) {
checkma... | java |
protected void fireSwitchEvent(ChangeEvent evt) {
Object[] listeners = listenerList.getListenerList();
for(int i = 1; i < listeners.length; i += 2) {
if(listeners[i - 1] == ChangeListener.class) {
((ChangeListener) listeners[i]).stateChanged(evt);
}
}
} | java |
protected static void calculateSelectivityCoeffs(List<DoubleObjPair<DAFile>> daFiles, NumberVector query, double epsilon) {
final int dimensions = query.getDimensionality();
double[] lowerVals = new double[dimensions];
double[] upperVals = new double[dimensions];
VectorApproximation queryApprox = calcu... | java |
protected static VectorApproximation calculatePartialApproximation(DBID id, NumberVector dv, List<DoubleObjPair<DAFile>> daFiles) {
int[] approximation = new int[dv.getDimensionality()];
for(int i = 0; i < daFiles.size(); i++) {
double val = dv.doubleValue(i);
double[] borders = daFiles.get(i).secon... | java |
public String solutionToString(int fractionDigits) {
if(!isSolvable()) {
throw new IllegalStateException("System is not solvable!");
}
DecimalFormat nf = new DecimalFormat();
nf.setMinimumFractionDigits(fractionDigits);
nf.setMaximumFractionDigits(fractionDigits);
nf.setDecimalFormatSymbo... | java |
private void reducedRowEchelonForm(int method) {
final int rows = coeff.length;
final int cols = coeff[0].length;
int k = -1; // denotes current position on diagonal
int pivotRow; // row index of pivot element
int pivotCol; // column index of pivot element
double pivot; // value of pivot elemen... | java |
private IntIntPair nonZeroPivotSearch(int k) {
int i, j;
double absValue;
for(i = k; i < coeff.length; i++) {
for(j = k; j < coeff[0].length; j++) {
// compute absolute value of
// current entry in absValue
absValue = Math.abs(coeff[row[i]][col[j]]);
// check if absVa... | java |
private void permutePivot(IntIntPair pos1, IntIntPair pos2) {
int r1 = pos1.first;
int c1 = pos1.second;
int r2 = pos2.first;
int c2 = pos2.second;
int index;
index = row[r2];
row[r2] = row[r1];
row[r1] = index;
index = col[c2];
col[c2] = col[c1];
col[c1] = index;
} | java |
private void pivotOperation(int k) {
double pivot = coeff[row[k]][col[k]];
// pivot row: set pivot to 1
coeff[row[k]][col[k]] = 1;
for(int i = k + 1; i < coeff[k].length; i++) {
coeff[row[k]][col[i]] /= pivot;
}
rhs[row[k]] /= pivot;
if(LOG.isDebugging()) {
StringBuilder msg = ... | java |
private void solve(int method) throws NullPointerException {
// solution exists
if(solved) {
return;
}
// bring in reduced row echelon form
if(!reducedRowEchelonForm) {
reducedRowEchelonForm(method);
}
if(!isSolvable(method)) {
if(LOG.isDebugging()) {
LOG.debugFin... | java |
private boolean isSolvable(int method) throws NullPointerException {
if(solved) {
return solvable;
}
if(!reducedRowEchelonForm) {
reducedRowEchelonForm(method);
}
// test if rank(coeff) == rank(coeff|rhs)
for(int i = rank; i < rhs.length; i++) {
if(Math.abs(rhs[row[i]]) > DEL... | java |
private int[] maxIntegerDigits(double[][] values) {
int[] digits = new int[values[0].length];
for(int j = 0; j < values[0].length; j++) {
for(double[] value : values) {
digits[j] = Math.max(digits[j], integerDigits(value[j]));
}
}
return digits;
} | java |
private int maxIntegerDigits(double[] values) {
int digits = 0;
for(double value : values) {
digits = Math.max(digits, integerDigits(value));
}
return digits;
} | java |
private int integerDigits(double d) {
double value = Math.abs(d);
if(value < 10) {
return 1;
}
return (int) FastMath.log10(value) + 1;
} | java |
private void format(NumberFormat nf, StringBuilder buffer, double value, int maxIntegerDigits) {
if(value >= 0) {
buffer.append(" + ");
}
else {
buffer.append(" - ");
}
int digits = maxIntegerDigits - integerDigits(value);
for(int d = 0; d < digits; d++) {
buffer.append(' ');
... | java |
protected ArrayModifiableDBIDs initialMedoids(DistanceQuery<V> distQ, DBIDs ids) {
if(getLogger().isStatistics()) {
getLogger().statistics(new StringStatistic(getClass().getName() + ".initialization", initializer.toString()));
}
Duration initd = getLogger().newDuration(getClass().getName() + ".initial... | java |
public int getTotalClusterCount() {
int clusterCount = 0;
for(int i = 0; i < numclusters.length; i++) {
clusterCount += numclusters[i];
}
return clusterCount;
} | java |
public int getHighestClusterCount() {
int maxClusters = 0;
for(int i = 0; i < numclusters.length; i++) {
maxClusters = Math.max(maxClusters, numclusters[i]);
}
return maxClusters;
} | java |
protected static double getMinDist(DBIDArrayIter j, DistanceQuery<?> distQ, DBIDArrayIter mi, WritableDoubleDataStore mindist) {
double prev = mindist.doubleValue(j);
if(Double.isNaN(prev)) { // NaN = unknown
prev = Double.POSITIVE_INFINITY;
for(mi.seek(0); mi.valid(); mi.advance()) {
double... | java |
private static void shuffle(ArrayModifiableDBIDs ids, int ssize, int end, Random random) {
ssize = ssize < end ? ssize : end; // Guard for choosing from tiny sets
for(int i = 1; i < ssize; i++) {
ids.swap(i - 1, i + random.nextInt(end - i));
}
} | java |
public static LinearScale[] calcScales(Relation<? extends SpatialComparable> rel) {
int dim = RelationUtil.dimensionality(rel);
DoubleMinMax[] minmax = DoubleMinMax.newArray(dim);
LinearScale[] scales = new LinearScale[dim];
// analyze data
for(DBIDIter iditer = rel.iterDBIDs(); iditer.valid(); idi... | java |
public FrequentItemsetsResult run(Database db, final Relation<BitVector> relation) {
// TODO: implement with resizable arrays, to not need dim.
final int dim = RelationUtil.dimensionality(relation);
final VectorFieldTypeInformation<BitVector> meta = RelationUtil.assumeVectorField(relation);
// Compute a... | java |
public static TreeNode build(List<Class<?>> choices, String rootpkg) {
MutableTreeNode root = new PackageNode(rootpkg, rootpkg);
HashMap<String, MutableTreeNode> lookup = new HashMap<>();
if(rootpkg != null) {
lookup.put(rootpkg, root);
}
lookup.put("de.lmu.ifi.dbs.elki", root);
lookup.put... | java |
private static MutableTreeNode simplifyTree(MutableTreeNode cur, String prefix) {
if(cur instanceof PackageNode) {
PackageNode node = (PackageNode) cur;
if(node.getChildCount() == 1) {
String newprefix = (prefix != null) ? prefix + "." + (String) node.getUserObject() : (String) node.getUserObjec... | java |
protected String formatValue(List<Class<? extends C>> val) {
StringBuilder buf = new StringBuilder(50 + val.size() * 25);
String pkgname = restrictionClass.getPackage().getName();
for(Class<? extends C> c : val) {
if(buf.length() > 0) {
buf.append(LIST_SEP);
}
String name = c.getNa... | java |
protected void publish(final LogRecord record) {
if(record instanceof ProgressLogRecord) {
ProgressLogRecord preg = (ProgressLogRecord) record;
Progress prog = preg.getProgress();
JProgressBar pbar = getOrCreateProgressBar(prog);
updateProgressBar(prog, pbar);
if(prog.isComplete()) {
... | java |
private void publishTextRecord(final LogRecord record) {
try {
logpane.publish(record);
}
catch(Exception e) {
throw new RuntimeException("Error writing a log-like message.", e);
}
} | java |
private JProgressBar getOrCreateProgressBar(Progress prog) {
JProgressBar pbar = pbarmap.get(prog);
// Add a new progress bar.
if(pbar == null) {
synchronized(pbarmap) {
if(prog instanceof FiniteProgress) {
pbar = new JProgressBar(0, ((FiniteProgress) prog).getTotal());
pba... | java |
private void updateProgressBar(Progress prog, JProgressBar pbar) {
if(prog instanceof FiniteProgress) {
pbar.setValue(((FiniteProgress) prog).getProcessed());
pbar.setString(((FiniteProgress) prog).toString());
}
else if(prog instanceof IndefiniteProgress) {
pbar.setValue(((IndefiniteProgr... | java |
private void removeProgressBar(Progress prog, JProgressBar pbar) {
synchronized(pbarmap) {
pbarmap.remove(prog);
SwingUtilities.invokeLater(() -> removeProgressBar(pbar));
}
} | java |
public void clear() {
logpane.clear();
synchronized(pbarmap) {
for(Entry<Progress, JProgressBar> ent : pbarmap.entrySet()) {
super.remove(ent.getValue());
pbarmap.remove(ent.getKey());
}
}
} | java |
@Override
public void componentResized(ComponentEvent e) {
if (e.getComponent() == component) {
double newRatio = getCurrentRatio();
if (Math.abs(newRatio - activeRatio) > threshold) {
activeRatio = newRatio;
executeResize(newRatio);
}
}
} | java |
@Override
public String format(LogRecord record) {
String msg = record.getMessage();
if(msg.length() > 0) {
if (record instanceof ProgressLogRecord) {
return msg;
}
if(msg.endsWith(OutputStreamLogger.NEWLINE)) {
return msg;
}
}
return msg + OutputStreamLogger.NE... | java |
protected double[] alignLabels(List<ClassLabel> l1, double[] d1, Collection<ClassLabel> l2) {
assert (l1.size() == d1.length);
if(l1 == l2) {
return d1.clone();
}
double[] d2 = new double[l2.size()];
Iterator<ClassLabel> i2 = l2.iterator();
for(int i = 0; i2.hasNext();) {
ClassLabel ... | java |
public void setInitialClusters(List<? extends Cluster<? extends MeanModel>> initialMeans) {
double[][] vecs = new double[initialMeans.size()][];
for(int i = 0; i < vecs.length; i++) {
vecs[i] = initialMeans.get(i).getModel().getMean();
}
this.initialMeans = vecs;
} | java |
public static void exception(String message, Throwable e) {
if(message == null && e != null) {
message = e.getMessage();
}
logExpensive(Level.SEVERE, message, e);
} | java |
public static void warning(String message, Throwable e) {
if(message == null && e != null) {
message = e.getMessage();
}
logExpensive(Level.WARNING, message, e);
} | java |
public static void message(String message, Throwable e) {
if(message == null && e != null) {
message = e.getMessage();
}
logExpensive(Level.INFO, message, e);
} | java |
private static final String[] inferCaller() {
StackTraceElement[] stack = (new Throwable()).getStackTrace();
int ix = 0;
while(ix < stack.length) {
StackTraceElement frame = stack[ix];
if(!frame.getClassName().equals(LoggingUtil.class.getCanonicalName())) {
return new String[] { frame.g... | java |
public static long binomialCoefficient(long n, long k) {
final long m = Math.max(k, n - k);
double temp = 1;
for(long i = n, j = 1; i > m; i--, j++) {
temp = temp * i / j;
}
return (long) temp;
} | java |
public static double approximateBinomialCoefficient(int n, int k) {
final int m = max(k, n - k);
long temp = 1;
for(int i = n, j = 1; i > m; i--, j++) {
temp = temp * i / j;
}
return temp;
} | java |
public static int[] sequence(int start, int end) {
if(start >= end) {
return EMPTY_INTS;
}
int[] ret = new int[end - start];
for(int j = 0; start < end; start++, j++) {
ret[j] = start;
}
return ret;
} | java |
public KNNDistanceOrderResult run(Database database, Relation<O> relation) {
final DistanceQuery<O> distanceQuery = database.getDistanceQuery(relation, getDistanceFunction());
final KNNQuery<O> knnQuery = database.getKNNQuery(distanceQuery, k + 1);
final int size = (int) ((sample <= 1.) ? Math.ceil(relatio... | java |
public DataStore<M> preprocess(Class<? super M> modelcls, Relation<O> relation, RangeQuery<O> query) {
WritableDataStore<M> storage = DataStoreUtil.makeStorage(relation.getDBIDs(), DataStoreFactory.HINT_HOT | DataStoreFactory.HINT_TEMP, modelcls);
Duration time = getLogger().newDuration(this.getClass().getName... | java |
@Override
public <NV extends NumberVector> NV projectScaledToDataSpace(double[] v, NumberVector.Factory<NV> factory) {
final int dim = v.length;
double[] vec = new double[dim];
for(int d = 0; d < dim; d++) {
vec[d] = scales[d].getUnscaled(v[d]);
}
return factory.newNumberVector(vec);
} | java |
@Override
public <NV extends NumberVector> NV projectRenderToDataSpace(double[] v, NumberVector.Factory<NV> prototype) {
final int dim = v.length;
double[] vec = projectRenderToScaled(v);
// Not calling {@link #projectScaledToDataSpace} to avoid extra copy of
// vector.
for(int d = 0; d < dim; d++... | java |
@Override
public <NV extends NumberVector> NV projectRelativeScaledToDataSpace(double[] v, NumberVector.Factory<NV> prototype) {
final int dim = v.length;
double[] vec = new double[dim];
for(int d = 0; d < dim; d++) {
vec[d] = scales[d].getRelativeUnscaled(v[d]);
}
return prototype.newNumber... | java |
public PointerHierarchyRepresentationResult complete() {
if(csize != null) {
csize.destroy();
csize = null;
}
if(mergecount != ids.size() - 1) {
LOG.warning(mergecount + " merges were added to the hierarchy, expected " + (ids.size() - 1));
}
if(prototypes != null) {
return ne... | java |
public int getSize(DBIDRef id) {
if(csize == null) {
csize = DataStoreUtil.makeIntegerStorage(ids, DataStoreFactory.HINT_HOT | DataStoreFactory.HINT_TEMP, 1);
}
return csize.intValue(id);
} | java |
public void setSize(DBIDRef id, int size) {
if(csize == null) {
csize = DataStoreUtil.makeIntegerStorage(ids, DataStoreFactory.HINT_HOT | DataStoreFactory.HINT_TEMP, 1);
}
csize.putInt(id, size);
} | java |
public OutlierResult run(Database database, Relation<N> spatial, Relation<O> relation) {
final NeighborSetPredicate npred = getNeighborSetPredicateFactory().instantiate(database, spatial);
DistanceQuery<O> distFunc = getNonSpatialDistanceFunction().instantiate(relation);
WritableDoubleDataStore lrds = Data... | java |
public void insertHandler(Class<?> restrictionClass, H handler) {
// note that the handlers list is kept in a list that is traversed in
// backwards order.
handlers.add(new Pair<Class<?>, H>(restrictionClass, handler));
} | java |
public H getHandler(Object o) {
if(o == null) {
return null;
}
// note that we start at the end of the list.
ListIterator<Pair<Class<?>, H>> iter = handlers.listIterator(handlers.size());
while(iter.hasPrevious()) {
Pair<Class<?>, H> pair = iter.previous();
try {
// if we c... | java |
public synchronized static Logging getLogger(final String name) {
Logging logger = loggers.get(name);
if(logger == null) {
logger = new Logging(Logger.getLogger(name));
loggers.put(name, logger);
}
return logger;
} | java |
public void log(java.util.logging.Level level, CharSequence message) {
LogRecord rec = new ELKILogRecord(level, message);
logger.log(rec);
} | java |
public void error(CharSequence message, Throwable e) {
log(Level.SEVERE, message, e);
} | java |
public void warning(CharSequence message, Throwable e) {
log(Level.WARNING, message, e);
} | java |
public void statistics(CharSequence message, Throwable e) {
log(Level.STATISTICS, message, e);
} | java |
public void veryverbose(CharSequence message, Throwable e) {
log(Level.VERYVERBOSE, message, e);
} | java |
public void exception(CharSequence message, Throwable e) {
log(Level.SEVERE, message, e);
} | java |
public void exception(Throwable e) {
final String msg = e.getMessage();
log(Level.SEVERE, msg != null ? msg : "An exception occurred.", e);
} | java |
public void statistics(Statistic stats) {
if(stats != null) {
log(Level.STATISTICS, stats.getKey() + ": " + stats.formatValue());
}
} | java |
public MultipleObjectsBundle generate() {
// we actually need some clusters.
if(generators.isEmpty()) {
throw new AbortException("No clusters specified.");
}
// Assert that cluster dimensions agree.
final int dim = generators.get(0).getDim();
for(GeneratorInterface c : generators) {
... | java |
private void initLabelsAndModels(ArrayList<GeneratorInterface> generators, ClassLabel[] labels, Model[] models, Pattern reassign) {
int existingclusters = 0;
if(reassign != null) {
for(int i = 0; i < labels.length; i++) {
final GeneratorInterface curclus = generators.get(i);
if(!reassign.m... | java |
public static <V extends FeatureVector<?>> VectorFieldTypeInformation<V> assumeVectorField(Relation<V> relation) {
try {
return ((VectorFieldTypeInformation<V>) relation.getDataTypeInformation());
}
catch(Exception e) {
throw new UnsupportedOperationException("Expected a vector field, got type i... | java |
public static <V extends NumberVector> NumberVector.Factory<V> getNumberVectorFactory(Relation<V> relation) {
final VectorFieldTypeInformation<V> type = assumeVectorField(relation);
@SuppressWarnings("unchecked")
final NumberVector.Factory<V> factory = (NumberVector.Factory<V>) type.getFactory();
return... | java |
public static int dimensionality(Relation<? extends SpatialComparable> relation) {
final SimpleTypeInformation<? extends SpatialComparable> type = relation.getDataTypeInformation();
if(type instanceof FieldTypeInformation) {
return ((FieldTypeInformation) type).getDimensionality();
}
return -1;
... | java |
public static double[][] computeMinMax(Relation<? extends NumberVector> relation) {
int dim = RelationUtil.dimensionality(relation);
double[] mins = new double[dim], maxs = new double[dim];
for(int i = 0; i < dim; i++) {
mins[i] = Double.MAX_VALUE;
maxs[i] = -Double.MAX_VALUE;
}
for(DBID... | java |
public static <V extends SpatialComparable> String getColumnLabel(Relation<? extends V> rel, int col) {
SimpleTypeInformation<? extends V> type = rel.getDataTypeInformation();
if(!(type instanceof VectorFieldTypeInformation)) {
return "Column " + col;
}
final VectorFieldTypeInformation<?> vtype = ... | java |
@SuppressWarnings("unchecked")
public static <V extends NumberVector, T extends NumberVector> Relation<V> relationUglyVectorCast(Relation<T> database) {
return (Relation<V>) database;
} | java |
public KNNList get(DBIDRef id) {
if(storage == null) {
if(getLogger().isDebugging()) {
getLogger().debug("Running kNN preprocessor: " + this.getClass());
}
preprocess();
}
return storage.get(id);
} | java |
public Clustering<DimensionModel> run(Database database, Relation<V> relation) {
COPACNeighborPredicate.Instance npred = new COPACNeighborPredicate<V>(settings).instantiate(database, relation);
CorePredicate.Instance<DBIDs> cpred = new MinPtsCorePredicate(settings.minpts).instantiate(database);
Clustering<M... | java |
public int getUnpairedClusteringIndex() {
for(int index = 0; index < clusterIds.length; index++) {
if(clusterIds[index] == UNCLUSTERED) {
return index;
}
}
return -1;
} | java |
protected static boolean isNull(Object val) {
return (val == null) || STRING_NULL.equals(val) || DOUBLE_NULL.equals(val) || INTEGER_NULL.equals(val);
} | java |
private static String formatCause(Throwable cause) {
if(cause == null) {
return "";
}
String message = cause.getMessage();
return "\n" + (message != null ? message : cause.toString());
} | java |
public TextWriterWriterInterface<?> getWriterFor(Object o) {
if(o == null) {
return null;
}
TextWriterWriterInterface<?> writer = writers.getHandler(o);
if(writer != null) {
return writer;
}
try {
final Class<?> decl = o.getClass().getMethod("toString").getDeclaringClass();
... | java |
protected Cluster<BiclusterModel> defineBicluster(BitSet rows, BitSet cols) {
ArrayDBIDs rowIDs = rowsBitsetToIDs(rows);
int[] colIDs = colsBitsetToIDs(cols);
return new Cluster<>(rowIDs, new BiclusterModel(colIDs));
} | java |
public double getSampleSkewness() {
if(!(m2 > 0) || !(n > 2)) {
throw new ArithmeticException("Skewness not defined when variance is 0 or weight <= 2.0!");
}
return (m3 * n / (n - 1) / (n - 2)) / FastMath.pow(getSampleVariance(), 1.5);
} | java |
public static double cosineOrHaversineDeg(double lat1, double lon1, double lat2, double lon2) {
return cosineOrHaversineRad(deg2rad(lat1), deg2rad(lon1), deg2rad(lat2), deg2rad(lon2));
} | java |
public static double crossTrackDistanceRad(double lat1, double lon1, double lat2, double lon2, double latQ, double lonQ, double dist1Q) {
final double dlon12 = lon2 - lon1;
final double dlon1Q = lonQ - lon1;
// Compute trigonometric functions only once.
final DoubleWrapper tmp = new DoubleWrapper(); //... | java |
public static double alongTrackDistanceRad(double lat1, double lon1, double lat2, double lon2, double latQ, double lonQ, double dist1Q, double ctd) {
// FIXME: optimize the sign computation!
int sign = Math.abs(bearingRad(lat1, lon1, lat2, lon2) - bearingRad(lat1, lon1, latQ, lonQ)) < HALFPI ? +1 : -1;
retu... | java |
private static double[] reversed(double[] a) {
// TODO: there doesn't appear to be a nicer version in Java, unfortunately.
Arrays.sort(a);
for(int i = 0, j = a.length - 1; i < j; i++, j--) {
double tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
return a;
} | java |
private double computeExplainedVariance(double[] eigenValues, int filteredEigenPairs) {
double strongsum = 0., weaksum = 0.;
for(int i = 0; i < filteredEigenPairs; i++) {
strongsum += eigenValues[i];
}
for(int i = filteredEigenPairs; i < eigenValues.length; i++) {
weaksum += eigenValues[i];
... | java |
private void assertSortedByDistance(DoubleDBIDList results) {
// TODO: sort results instead?
double dist = -1.0;
boolean sorted = true;
for(DoubleDBIDListIter it = results.iter(); it.valid(); it.advance()) {
double qr = it.doubleValue();
if(qr < dist) {
sorted = false;
}
... | java |
public static String prefixParameterToMessage(Parameter<?> p, String message) {
return new StringBuilder(100 + message.length()) //
.append(p instanceof Flag ? "Flag '" : "Parameter '") //
.append(p.getOptionID().getName()) //
.append("' ").append(message).toString();
} | java |
public static String prefixParametersToMessage(Parameter<?> p, String mid, Parameter<?> p2, String message) {
return new StringBuilder(200 + mid.length() + message.length())//
.append(p instanceof Flag ? "Flag '" : "Parameter '") //
.append(p.getOptionID().getName()) //
.append("' ").append(... | java |
@Override
protected int computeHeight() {
N node = getRoot();
int height = 1;
// compute height
while(!node.isLeaf() && node.getNumEntries() != 0) {
E entry = node.getEntry(0);
node = getNode(entry);
height++;
}
return height;
} | java |
private List<E> createBulkDirectoryNodes(List<E> nodes) {
int minEntries = dirMinimum;
int maxEntries = dirCapacity - 1;
ArrayList<E> result = new ArrayList<>();
List<List<E>> partitions = settings.bulkSplitter.partition(nodes, minEntries, maxEntries);
for(List<E> partition : partitions) {
/... | java |
private N createRoot(N root, List<E> objects) {
// insert data
for(E entry : objects) {
if (entry instanceof LeafEntry) {
root.addLeafEntry(entry);
}
else {
root.addDirectoryEntry(entry);
}
}
// set root mbr
((SpatialDirectoryEntry) getRootEntry()).setMBR(roo... | java |
private int tailingNonNewline(char[] cbuf, int off, int len) {
for(int cnt = 0; cnt < len; cnt++) {
final int pos = off + (len - 1) - cnt;
if(cbuf[pos] == UNIX_NEWLINE) {
return cnt;
}
if(cbuf[pos] == CARRIAGE_RETURN) {
return cnt;
}
// TODO: need to compare to NE... | java |
@Override
public void write(char[] cbuf, int off, int len) throws IOException {
if(len <= 0) {
return;
}
// if we havn't last seen a newline, and don't get a CR, insert a newline.
if(charsSinceNewline > 0) {
if(cbuf[off] != CARRIAGE_RETURN) {
super.write(NEWLINEC, 0, NEWLINEC.lengt... | java |
protected DoubleDataStore computeIDs(DBIDs ids, KNNQuery<O> knnQ) {
WritableDoubleDataStore intDims = DataStoreUtil.makeDoubleStorage(ids, DataStoreFactory.HINT_HOT | DataStoreFactory.HINT_TEMP);
FiniteProgress prog = LOG.isVerbose() ? new FiniteProgress("Intrinsic dimensionality", ids.size(), LOG) : null;
... | java |
protected DoubleDataStore computeIDOS(DBIDs ids, KNNQuery<O> knnQ, DoubleDataStore intDims, DoubleMinMax idosminmax) {
WritableDoubleDataStore ldms = DataStoreUtil.makeDoubleStorage(ids, DataStoreFactory.HINT_STATIC);
FiniteProgress prog = LOG.isVerbose() ? new FiniteProgress("ID Outlier Scores for objects", id... | java |
public OutlierResult run(Database database, Relation<V> relation) {
final int dbsize = relation.size();
ArrayList<ArrayList<DBIDs>> ranges = buildRanges(relation);
Heap<Individuum>.UnorderedIter individuums = (new EvolutionarySearch(relation, ranges, m, rnd.getSingleThreadedRandom())).run();
WritableD... | java |
protected double[][] buildDistanceMatrix(ArrayDBIDs ids, DistanceQuery<?> dq) {
final int size = ids.size();
double[][] dmat = new double[size][size];
final boolean square = !dq.getDistanceFunction().isSquared();
FiniteProgress prog = LOG.isVerbose() ? new FiniteProgress("Computing distance matrix", (si... | java |
@Override
public Clustering<M> run(Database database, Relation<V> relation) {
MutableProgress prog = LOG.isVerbose() ? new MutableProgress("X-means number of clusters", k_max, LOG) : null;
// Run initial k-means to find at least k_min clusters
innerKMeans.setK(k_min);
LOG.statistics(new StringStatist... | java |
protected List<Cluster<M>> splitCluster(Cluster<M> parentCluster, Database database, Relation<V> relation) {
// Transform parent cluster into a clustering
ArrayList<Cluster<M>> parentClusterList = new ArrayList<Cluster<M>>(1);
parentClusterList.add(parentCluster);
if(parentCluster.size() <= 1) {
/... | java |
protected double[][] splitCentroid(Cluster<? extends MeanModel> parentCluster, Relation<V> relation) {
double[] parentCentroid = parentCluster.getModel().getMean();
// Compute size of cluster/region
double radius = 0.;
for(DBIDIter it = parentCluster.getIDs().iter(); it.valid(); it.advance()) {
d... | java |
private void scan(HilbertFeatures hf, int k0) {
final int mink0 = Math.min(2 * k0, capital_n - 1);
if(LOG.isDebuggingFine()) {
LOG.debugFine("Scanning with k0=" + k0 + " (" + mink0 + ")" + " N*=" + capital_n_star);
}
for(int i = 0; i < hf.pf.length; i++) {
if(hf.pf[i].ubound < omega_star) {
... | java |
private void trueOutliers(HilbertFeatures h) {
n_star = 0;
for(ObjectHeap.UnsortedIter<HilFeature> iter = h.out.unsortedIter(); iter.valid(); iter.advance()) {
HilFeature entry = iter.get();
if(entry.ubound >= omega_star && (entry.ubound - entry.lbound < 1E-10)) {
n_star++;
}
}
} | java |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.