code stringlengths 73 34.1k | label stringclasses 1
value |
|---|---|
protected void addToStatistics(NumberVector nv) {
final int d = nv.getDimensionality();
assert (d == ls.length);
this.n++;
for(int i = 0; i < d; i++) {
double v = nv.doubleValue(i);
ls[i] += v;
ss += v * v;
}
} | java |
protected void addToStatistics(ClusteringFeature other) {
n += other.n;
VMath.plusEquals(ls, other.ls);
ss += other.ss;
} | java |
public double sumOfSquaresOfSums() {
double sum = 0.;
for(int i = 0; i < ls.length; i++) {
double v = ls[i];
sum += v * v;
}
return sum;
} | java |
public static double sumOfSquares(NumberVector v) {
final int dim = v.getDimensionality();
double sum = 0;
for(int d = 0; d < dim; d++) {
double x = v.doubleValue(d);
sum += x * x;
}
return sum;
} | java |
private static void insertionSort(int[] data, final int start, final int end, IntComparator comp) {
// Classic insertion sort.
for(int i = start + 1; i < end; i++) {
final int cur = data[i];
int j = i - 1;
while(j >= start) {
final int pre = data[j];
if(comp.compare(cur, pre) >... | java |
@Override
public double[][] processIds(DBIDs ids, Relation<? extends NumberVector> relation) {
final int dim = RelationUtil.dimensionality(relation);
final CovarianceMatrix cmat = new CovarianceMatrix(dim);
final Centroid centroid = Centroid.make(relation, ids);
// find maximum distance
double ma... | java |
@Override
public double[][] processQueryResults(DoubleDBIDList results, Relation<? extends NumberVector> database, int k) {
final int dim = RelationUtil.dimensionality(database);
final CovarianceMatrix cmat = new CovarianceMatrix(dim);
// avoid bad parameters
k = k <= results.size() ? k : results.siz... | java |
public Instance instantiate(Database database, Relation<V> relation) {
DistanceQuery<V> dq = database.getDistanceQuery(relation, EuclideanDistanceFunction.STATIC);
KNNQuery<V> knnq = database.getKNNQuery(dq, settings.k);
WritableDataStore<PCAFilteredResult> storage = DataStoreUtil.makeStorage(relation.getD... | java |
public static void writeXHTML(Document htmldoc, OutputStream out) throws IOException {
javax.xml.transform.Result result = new StreamResult(out);
// Use a transformer for pretty printing
Transformer xformer;
try {
xformer = TransformerFactory.newInstance().newTransformer();
xformer.setOutput... | java |
public static Element appendMultilineText(Document htmldoc, Element parent, String text) {
String[] parts = text != null ? text.split("\n") : null;
if(parts == null || parts.length == 0) {
return parent;
}
parent.appendChild(htmldoc.createTextNode(parts[0]));
for(int i = 1; i < parts.length; i... | java |
public int getPathCount() {
int result = 0;
for(IndexTreePath<E> path = this; path != null; path = path.parentPath) {
result++;
}
return result;
} | java |
public OutlierResult run(Database database, Relation<O> relation) {
StepProgress stepprog = LOG.isVerbose() ? new StepProgress("CBLOF", 3) : null;
DBIDs ids = relation.getDBIDs();
LOG.beginStep(stepprog, 1, "Computing clustering.");
Clustering<MeanModel> clustering = clusteringAlgorithm.run(database);
... | java |
private int getClusterBoundary(Relation<O> relation, List<? extends Cluster<MeanModel>> clusters) {
int totalSize = relation.size();
int clusterBoundary = clusters.size() - 1;
int cumulativeSize = 0;
for(int i = 0; i < clusters.size() - 1; i++) {
cumulativeSize += clusters.get(i).size();
//... | java |
private void computeCBLOFs(Relation<O> relation, NumberVectorDistanceFunction<? super O> distance, WritableDoubleDataStore cblofs, DoubleMinMax cblofMinMax, List<? extends Cluster<MeanModel>> largeClusters, List<? extends Cluster<MeanModel>> smallClusters) {
List<NumberVector> largeClusterMeans = new ArrayList<>(la... | java |
private GeneratorMain loadXMLSpecification() {
try {
DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
dbf.setFeature("http://apache.org/xml/features/nonvalidating/load-external-dtd", false);
URL url = ClassLoader.getSystemResource(GENERATOR_SCHEMA_FILE);
if(url != null) {
... | java |
private void processElementDataset(GeneratorMain gen, Node cur) {
// *** get parameters
String seedstr = ((Element) cur).getAttribute(ATTR_SEED);
if(clusterRandom != RandomFactory.DEFAULT && seedstr != null && seedstr.length() > 0) {
clusterRandom = new RandomFactory((long) (ParseUtil.parseIntBase10(s... | java |
private void processElementCluster(GeneratorMain gen, Node cur) {
int size = -1;
double overweight = 1.0;
String sizestr = ((Element) cur).getAttribute(ATTR_SIZE);
if(sizestr != null && sizestr.length() > 0) {
size = (int) (ParseUtil.parseIntBase10(sizestr) * sizescale);
}
String name = ... | java |
private void processElementUniform(GeneratorSingleCluster cluster, Node cur) {
double min = 0.0;
double max = 1.0;
String minstr = ((Element) cur).getAttribute(ATTR_MIN);
if(minstr != null && minstr.length() > 0) {
min = ParseUtil.parseDouble(minstr);
}
String maxstr = ((Element) cur).get... | java |
private void processElementNormal(GeneratorSingleCluster cluster, Node cur) {
double mean = 0.0;
double stddev = 1.0;
String meanstr = ((Element) cur).getAttribute(ATTR_MEAN);
if(meanstr != null && meanstr.length() > 0) {
mean = ParseUtil.parseDouble(meanstr);
}
String stddevstr = ((Elemen... | java |
private void processElementGamma(GeneratorSingleCluster cluster, Node cur) {
double k = 1.0;
double theta = 1.0;
String kstr = ((Element) cur).getAttribute(ATTR_K);
if(kstr != null && kstr.length() > 0) {
k = ParseUtil.parseDouble(kstr);
}
String thetastr = ((Element) cur).getAttribute(ATT... | java |
private void processElementRotate(GeneratorSingleCluster cluster, Node cur) {
int axis1 = 0;
int axis2 = 0;
double angle = 0.0;
String a1str = ((Element) cur).getAttribute(ATTR_AXIS1);
if(a1str != null && a1str.length() > 0) {
axis1 = ParseUtil.parseIntBase10(a1str);
}
String a2str = ... | java |
private void processElementTranslate(GeneratorSingleCluster cluster, Node cur) {
double[] offset = null;
String vstr = ((Element) cur).getAttribute(ATTR_VECTOR);
if(vstr != null && vstr.length() > 0) {
offset = parseVector(vstr);
}
if(offset == null) {
throw new AbortException("No transl... | java |
private void processElementClipping(GeneratorSingleCluster cluster, Node cur) {
double[] cmin = null, cmax = null;
String minstr = ((Element) cur).getAttribute(ATTR_MIN);
if(minstr != null && minstr.length() > 0) {
cmin = parseVector(minstr);
}
String maxstr = ((Element) cur).getAttribute(ATT... | java |
private void processElementStatic(GeneratorMain gen, Node cur) {
String name = ((Element) cur).getAttribute(ATTR_NAME);
if(name == null) {
throw new AbortException("No cluster name given in specification file.");
}
ArrayList<double[]> points = new ArrayList<>();
// TODO: check for unknown att... | java |
private double[] parseVector(String s) {
String[] entries = WHITESPACE_PATTERN.split(s);
double[] d = new double[entries.length];
for(int i = 0; i < entries.length; i++) {
try {
d[i] = ParseUtil.parseDouble(entries[i]);
}
catch(NumberFormatException e) {
throw new AbortExce... | java |
public static NumberVector getPrototype(Model model, Relation<? extends NumberVector> relation) {
// Mean model contains a numeric Vector
if(model instanceof MeanModel) {
return DoubleVector.wrap(((MeanModel) model).getMean());
}
// Handle medoid models
if(model instanceof MedoidModel) {
... | java |
private long[] determinePreferenceVectorByApriori(Relation<V> relation, ModifiableDBIDs[] neighborIDs, StringBuilder msg) {
int dimensionality = neighborIDs.length;
// database for apriori
UpdatableDatabase apriori_db = new HashmapDatabase();
SimpleTypeInformation<?> bitmeta = VectorFieldTypeInformatio... | java |
private long[] determinePreferenceVectorByMaxIntersection(ModifiableDBIDs[] neighborIDs, StringBuilder msg) {
int dimensionality = neighborIDs.length;
long[] preferenceVector = BitsUtil.zero(dimensionality);
Map<Integer, ModifiableDBIDs> candidates = new HashMap<>(dimensionality);
for(int i = 0; i < di... | java |
private int max(Map<Integer, ModifiableDBIDs> candidates) {
int maxDim = -1, size = -1;
for(Integer nextDim : candidates.keySet()) {
int nextSet = candidates.get(nextDim).size();
if(size < nextSet) {
size = nextSet;
maxDim = nextDim;
}
}
return maxDim;
} | java |
private int maxIntersection(Map<Integer, ModifiableDBIDs> candidates, ModifiableDBIDs set) {
int maxDim = -1;
ModifiableDBIDs maxIntersection = null;
for(Integer nextDim : candidates.keySet()) {
DBIDs nextSet = candidates.get(nextDim);
ModifiableDBIDs nextIntersection = DBIDUtil.intersection(set... | java |
private RangeQuery<V>[] initRangeQueries(Relation<V> relation, int dimensionality) {
@SuppressWarnings("unchecked")
RangeQuery<V>[] rangeQueries = (RangeQuery<V>[]) new RangeQuery[dimensionality];
for(int d = 0; d < dimensionality; d++) {
rangeQueries[d] = relation.getRangeQuery(new PrimitiveDistanceQ... | java |
@Reference(authors = "F. J. Rohlf", title = "Methods of comparing classifications", //
booktitle = "Annual Review of Ecology and Systematics", //
url = "https://doi.org/10.1146/annurev.es.05.110174.000533", //
bibkey = "doi:10.1146/annurev.es.05.110174.000533")
public double computeTau(long c, long ... | java |
public void checkServices(String update) {
TreeSet<String> props = new TreeSet<>();
Enumeration<URL> us;
try {
us = getClass().getClassLoader().getResources(ELKIServiceLoader.RESOURCE_PREFIX);
}
catch(IOException e) {
throw new AbortException("Error enumerating service folders.", e);
... | java |
@SuppressWarnings("unchecked")
private void checkAliases(Class<?> parent, String classname, String[] parts) {
Class<?> c = ELKIServiceRegistry.findImplementation((Class<Object>) parent, classname);
if(c == null) {
return;
}
Alias ann = c.getAnnotation(Alias.class);
if(ann == null) {
if... | java |
public LinearEquationSystem getNormalizedLinearEquationSystem(Normalization<?> normalization) throws NonNumericFeaturesException {
if(normalization != null) {
LinearEquationSystem lq = normalization.transform(linearEquationSystem);
lq.solveByTotalPivotSearch();
return lq;
}
else {
re... | java |
public double squaredDistance(V p) {
// V_affin = V + a
// dist(p, V_affin) = d(p-a, V) = ||p - a - proj_V(p-a) ||
double[] p_minus_a = minusEquals(p.toArray(), centroid);
return squareSum(minusEquals(p_minus_a, times(strongEigenvectors, transposeTimes(strongEigenvectors, p_minus_a))));
} | java |
public double[] errorVector(V p) {
return weakEigenvectors.length > 0 ? times(weakEigenvectors, transposeTimes(weakEigenvectors, minusEquals(p.toArray(), centroid))) : EMPTY_VECTOR;
} | java |
public double[] dataVector(V p) {
return strongEigenvectors.length > 0 ? times(strongEigenvectors, transposeTimes(strongEigenvectors, minusEquals(p.toArray(), centroid))) : EMPTY_VECTOR;
} | java |
@Override
public void writeToText(TextWriterStream out, String label) {
if(label != null) {
out.commentPrintLn(label);
}
out.commentPrintLn("Model class: " + this.getClass().getName());
try {
if(getNormalizedLinearEquationSystem(null) != null) {
// TODO: more elegant way of doing n... | java |
protected int getBinNr(double coord) {
if (Double.isInfinite(coord) || Double.isNaN(coord)) {
throw new UnsupportedOperationException("Encountered non-finite value in Histogram: " + coord);
}
if (coord == max) {
// System.err.println("Triggered special case: "+ (Math.floor((coord -
// base... | java |
protected static int growSize(int current, int requiredSize) {
// Double until 64, then increase by 50% each time.
int newCapacity = ((current < 64) ? ((current + 1) << 1) : ((current >> 1) * 3));
// overflow?
if (newCapacity < 0) {
throw new OutOfMemoryError();
}
if (requiredSize > newCap... | java |
private void expandNodes(DeLiCluTree index, SpatialPrimitiveDistanceFunction<V> distFunction, SpatialObjectPair nodePair, DataStore<KNNList> knns) {
DeLiCluNode node1 = index.getNode(((SpatialDirectoryEntry) nodePair.entry1).getPageID());
DeLiCluNode node2 = index.getNode(((SpatialDirectoryEntry) nodePair.entry... | java |
private void expandDirNodes(SpatialPrimitiveDistanceFunction<V> distFunction, DeLiCluNode node1, DeLiCluNode node2) {
if(LOG.isDebuggingFinest()) {
LOG.debugFinest("ExpandDirNodes: " + node1.getPageID() + " + " + node2.getPageID());
}
int numEntries_1 = node1.getNumEntries();
int numEntries_2 = no... | java |
private void expandLeafNodes(SpatialPrimitiveDistanceFunction<V> distFunction, DeLiCluNode node1, DeLiCluNode node2, DataStore<KNNList> knns) {
if(LOG.isDebuggingFinest()) {
LOG.debugFinest("ExpandLeafNodes: " + node1.getPageID() + " + " + node2.getPageID());
}
int numEntries_1 = node1.getNumEntries()... | java |
private void reinsertExpanded(SpatialPrimitiveDistanceFunction<V> distFunction, DeLiCluTree index, IndexTreePath<DeLiCluEntry> path, DataStore<KNNList> knns) {
int l = 0; // Count the number of components.
for(IndexTreePath<DeLiCluEntry> it = path; it != null; it = it.getParentPath()) {
l++;
}
Arr... | java |
public static int assertSameDimensionality(SpatialComparable box1, SpatialComparable box2) {
final int dim = box1.getDimensionality();
if(dim != box2.getDimensionality()) {
throw new IllegalArgumentException("The spatial objects do not have the same dimensionality!");
}
return dim;
} | java |
public static double[] getMin(SpatialComparable box) {
final int dim = box.getDimensionality();
double[] min = new double[dim];
for(int i = 0; i < dim; i++) {
min[i] = box.getMin(i);
}
return min;
} | java |
public static double[] getMax(SpatialComparable box) {
final int dim = box.getDimensionality();
double[] max = new double[dim];
for(int i = 0; i < dim; i++) {
max[i] = box.getMax(i);
}
return max;
} | java |
public static boolean intersects(SpatialComparable box1, SpatialComparable box2) {
final int dim = assertSameDimensionality(box1, box2);
for(int i = 0; i < dim; i++) {
if(box2.getMax(i) < box1.getMin(i) || box1.getMax(i) < box2.getMin(i)) {
return false;
}
}
return true;
} | java |
public static boolean contains(SpatialComparable box, double[] point) {
final int dim = box.getDimensionality();
if(dim != point.length) {
throw new IllegalArgumentException("This HyperBoundingBox and the given point need same dimensionality");
}
for(int i = 0; i < dim; i++) {
if(box.getMin... | java |
public static double enlargement(SpatialComparable exist, SpatialComparable addit) {
final int dim = assertSameDimensionality(exist, addit);
double v1 = 1.;
double v2 = 1.;
for(int i = 0; i < dim; i++) {
final double emin = exist.getMin(i);
final double emax = exist.getMax(i);
final do... | java |
public static double perimeter(SpatialComparable box) {
final int dim = box.getDimensionality();
double perimeter = 0.;
for(int i = 0; i < dim; i++) {
perimeter += box.getMax(i) - box.getMin(i);
}
return perimeter;
} | java |
public static double overlap(SpatialComparable box1, SpatialComparable box2) {
final int dim = assertSameDimensionality(box1, box2);
// the maximal and minimal value of the overlap box.
double omax, omin;
// the overlap volume
double overlap = 1.;
for(int i = 0; i < dim; i++) {
// The m... | java |
public static double relativeOverlap(SpatialComparable box1, SpatialComparable box2) {
final int dim = assertSameDimensionality(box1, box2);
// the overlap volume
double overlap = 1.;
double vol1 = 1.;
double vol2 = 1.;
for(int i = 0; i < dim; i++) {
final double box1min = box1.getMin(i)... | java |
public static ModifiableHyperBoundingBox unionTolerant(SpatialComparable mbr1, SpatialComparable mbr2) {
if(mbr1 == null && mbr2 == null) {
return null;
}
if(mbr1 == null) {
// Clone - intentionally
return new ModifiableHyperBoundingBox(mbr2);
}
if(mbr2 == null) {
// Clone - ... | java |
public static double[] centroid(SpatialComparable obj) {
final int dim = obj.getDimensionality();
double[] centroid = new double[dim];
for(int d = 0; d < dim; d++) {
centroid[d] = (obj.getMax(d) + obj.getMin(d)) * .5;
}
return centroid;
} | java |
public static LinearScaling fromMinMax(double min, double max) {
double zoom = 1.0 / (max - min);
return new LinearScaling(zoom, -min * zoom);
} | java |
public double fMeasure(double beta) {
final double beta2 = beta * beta;
double fmeasure = ((1 + beta2) * pairconfuse[0]) / ((1 + beta2) * pairconfuse[0] + beta2 * pairconfuse[1] + pairconfuse[2]);
return fmeasure;
} | java |
@Override
public void write(TextWriterStream out, String label, Object object) {
StringBuilder buf = new StringBuilder(100);
if(label != null) {
buf.append(label).append('=');
}
if(object != null) {
buf.append(object.toString());
}
out.commentPrintLn(buf);
} | java |
protected static <I> double[][] computeSquaredDistanceMatrix(final List<I> col, PrimitiveDistanceFunction<? super I> dist) {
final int size = col.size();
double[][] imat = new double[size][size];
boolean squared = dist.isSquared();
FiniteProgress dprog = LOG.isVerbose() ? new FiniteProgress("Computing d... | java |
private OutlierResult getOutlierResult(ResultHierarchy hier, Result result) {
List<OutlierResult> ors = ResultUtil.filterResults(hier, result, OutlierResult.class);
if(!ors.isEmpty()) {
return ors.get(0);
}
throw new IllegalStateException("Comparison algorithm expected at least one outlier result.... | java |
protected PolynomialApproximation knnDistanceApproximation() {
int p_max = 0;
double[] b = null;
for(int i = 0; i < getNumEntries(); i++) {
MkAppEntry entry = getEntry(i);
PolynomialApproximation approximation = entry.getKnnDistanceApproximation();
if(b == null) {
p_max = approxima... | java |
public void setDBIDs(DBIDs ids) {
this.idrep.setDBIDs(ids);
// Update relations.
for (Relation<?> orel : this.relations) {
if (orel instanceof ProxyView) {
((ProxyView<?>) orel).setDBIDs(this.idrep.getDBIDs());
}
}
} | java |
public synchronized Collection<Progress> getProgresses() {
List<Progress> list = new ArrayList<>(progresses.size());
Iterator<WeakReference<Progress>> iter = progresses.iterator();
while(iter.hasNext()) {
WeakReference<Progress> ref = iter.next();
if(ref.get() == null) {
iter.remove();
... | java |
public synchronized void addProgress(Progress p) {
// Don't add more than once.
Iterator<WeakReference<Progress>> iter = progresses.iterator();
while(iter.hasNext()) {
WeakReference<Progress> ref = iter.next();
// since we are at it anyway, remove old links.
if(ref.get() == null) {
... | java |
public synchronized IndexTreePath<DeLiCluEntry> setHandled(DBID id, O obj) {
if(LOG.isDebugging()) {
LOG.debugFine("setHandled " + id + ", " + obj + "\n");
}
// find the leaf node containing o
IndexTreePath<DeLiCluEntry> pathToObject = findPathToObject(getRootPath(), obj, id);
if(pathToObjec... | java |
@Override
public final boolean delete(DBIDRef id) {
// find the leaf node containing o
O obj = relation.get(id);
IndexTreePath<DeLiCluEntry> deletionPath = findPathToObject(getRootPath(), obj, id);
if(deletionPath == null) {
return false;
}
deletePath(deletionPath);
return true;
} | java |
protected double[] makeSample(int maxk) {
final Random rnd = this.rnd.getSingleThreadedRandom();
double[] dists = new double[maxk + 1];
final double e = 1. / dim;
for(int i = 0; i <= maxk; i++) {
dists[i] = FastMath.pow(rnd.nextDouble(), e);
}
Arrays.sort(dists);
return dists;
} | java |
@Override
public final boolean setRoutingObjectID(DBID objectID) {
if(objectID == routingObjectID || DBIDUtil.equal(objectID, routingObjectID)) {
return false;
}
this.routingObjectID = objectID;
return true;
} | java |
@Override
public void writeExternal(ObjectOutput out) throws IOException {
out.writeInt(id);
out.writeInt(DBIDUtil.asInteger(routingObjectID));
out.writeDouble(parentDistance);
out.writeDouble(coveringRadius);
} | java |
@Override
public void write(TextWriterStream out, String label, TextWriteable obj) {
obj.writeToText(out, label);
} | java |
protected void evaluteResult(Database db, Clustering<?> c, Clustering<?> refc) {
ClusterContingencyTable contmat = new ClusterContingencyTable(selfPairing, noiseSpecialHandling);
contmat.process(refc, c);
ScoreResult sr = new ScoreResult(contmat);
sr.addHeader(c.getLongName());
db.getHierarchy().ad... | java |
private boolean isReferenceResult(Clustering<?> t) {
// FIXME: don't hard-code strings
return "bylabel-clustering".equals(t.getShortName()) //
|| "bymodel-clustering".equals(t.getShortName()) //
|| "allinone-clustering".equals(t.getShortName()) //
|| "allinnoise-clustering".equals(t.getS... | java |
@Override
public final synchronized int writePage(P page) {
int pageid = setPageID(page);
writePage(pageid, page);
return pageid;
} | java |
public static Element drawManhattan(SVGPlot svgp, Projection2D proj, NumberVector mid, double radius) {
final double[] v_mid = mid.toArray(); // a copy
final long[] dims = proj.getVisibleDimensions2D();
SVGPath path = new SVGPath();
for(int dim = BitsUtil.nextSetBit(dims, 0); dim >= 0; dim = BitsUtil.n... | java |
public static Element drawCross(SVGPlot svgp, Projection2D proj, NumberVector mid, double radius) {
final double[] v_mid = mid.toArray();
final long[] dims = proj.getVisibleDimensions2D();
SVGPath path = new SVGPath();
for(int dim = BitsUtil.nextSetBit(dims, 0); dim >= 0; dim = BitsUtil.nextSetBit(dims... | java |
@SuppressWarnings({ "cast", "unchecked" })
public static <O extends SpatialComparable> RangeQuery<O> getRangeQuery(AbstractRStarTree<?, ?, ?> tree, SpatialDistanceQuery<O> distanceQuery, Object... hints) {
// Can we support this distance function - spatial distances only!
SpatialPrimitiveDistanceFunction<? su... | java |
@SuppressWarnings({ "cast", "unchecked" })
public static <O extends SpatialComparable> KNNQuery<O> getKNNQuery(AbstractRStarTree<?, ?, ?> tree, SpatialDistanceQuery<O> distanceQuery, Object... hints) {
// Can we support this distance function - spatial distances only!
SpatialPrimitiveDistanceFunction<? super ... | java |
private void privateReconfigureLogging(String pkg, final String name) {
LogManager logManager = LogManager.getLogManager();
Logger logger = Logger.getLogger(LoggingConfiguration.class.getName());
// allow null as package name.
if(pkg == null) {
pkg = "";
}
// Load logging configuration fro... | java |
private static InputStream openSystemFile(String filename) throws FileNotFoundException {
try {
return new FileInputStream(filename);
}
catch(FileNotFoundException e) {
// try with classloader
String resname = File.separatorChar != '/' ? filename.replace(File.separatorChar, '/') : filename... | java |
public static void setVerbose(java.util.logging.Level verbose) {
if(verbose.intValue() <= Level.VERBOSE.intValue()) {
// decrease to VERBOSE if it was higher, otherwise further to
// VERYVERBOSE
if(LOGGER_GLOBAL_TOP.getLevel() == null || LOGGER_GLOBAL_TOP.getLevel().intValue() > verbose.intValue()... | java |
public static void setStatistics() {
// decrease to INFO if it was higher
if(LOGGER_GLOBAL_TOP.getLevel() == null || LOGGER_GLOBAL_TOP.getLevel().intValue() > Level.STATISTICS.intValue()) {
LOGGER_GLOBAL_TOP.setLevel(Level.STATISTICS);
}
if(LOGGER_ELKI_TOP.getLevel() == null || LOGGER_ELKI_TOP.get... | java |
public static void replaceDefaultHandler(Handler handler) {
Logger rootlogger = LogManager.getLogManager().getLogger("");
for(Handler h : rootlogger.getHandlers()) {
if(h instanceof CLISmartHandler) {
rootlogger.removeHandler(h);
}
}
addHandler(handler);
} | java |
public static void setDefaultLevel(java.util.logging.Level level) {
Logger.getLogger(TOPLEVEL_PACKAGE).setLevel(level);
} | java |
public static double[] getRelativeCoordinates(Event evt, Element reference) {
if(evt instanceof DOMMouseEvent && reference instanceof SVGLocatable && reference instanceof SVGElement) {
// Get the screen (pixel!) coordinates
DOMMouseEvent gnme = (DOMMouseEvent) evt;
SVGMatrix mat = ((SVGLocatable) ... | java |
public Clustering<MeanModel> run(Relation<NumberVector> relation) {
final int dim = RelationUtil.dimensionality(relation);
CFTree tree = cffactory.newTree(relation.getDBIDs(), relation);
// The CFTree does not store points. We have to reassign them (and the
// quality is better than if we used the initi... | java |
public OutlierResult run(Database database, Relation<O> relation) {
// Get a nearest neighbor query on the relation.
KNNQuery<O> knnq = QueryUtil.getKNNQuery(relation, getDistanceFunction(), k);
// Output data storage
WritableDoubleDataStore scores = DataStoreUtil.makeDoubleStorage(relation.getDBIDs(), ... | java |
public static void main(String[] args) {
if(args.length > 0 && args[0].charAt(0) != '-') {
Class<?> cls = ELKIServiceRegistry.findImplementation(AbstractApplication.class, args[0]);
if(cls != null) {
try {
Method m = cls.getMethod("main", String[].class);
Object a = Arrays.co... | java |
public static Parameterizer getParameterizer(Class<?> c) {
for(Class<?> inner : c.getDeclaredClasses()) {
if(Parameterizer.class.isAssignableFrom(inner)) {
try {
return inner.asSubclass(Parameterizer.class).newInstance();
}
catch(Exception e) {
LOG.warning("Non-usab... | java |
private void putRec(O obj, Rec<O> rec) {
graph.put(obj, rec);
for(int i = 0; i < numelems; ++i) {
if(obj == elems[i]) {
return;
}
}
if(elems.length == numelems) {
elems = Arrays.copyOf(elems, (elems.length << 1) + 1);
}
elems[numelems++] = obj;
} | java |
private void removeRec(O obj) {
graph.remove(obj);
for(int i = 0; i < numelems; ++i) {
if(obj == elems[i]) {
System.arraycopy(elems, i + 1, elems, i, --numelems - i);
elems[numelems] = null;
return;
}
}
} | java |
protected JTree createTree() {
JTree tree = new JTree(model);
tree.setName("TreePopup.tree");
tree.setFont(getFont());
tree.setForeground(getForeground());
tree.setBackground(getBackground());
tree.setBorder(null);
tree.setFocusable(true);
tree.addMouseListener(handler);
tree.addKeyL... | java |
protected JScrollPane createScroller() {
JScrollPane sp = new JScrollPane(tree, ScrollPaneConstants.VERTICAL_SCROLLBAR_AS_NEEDED, ScrollPaneConstants.HORIZONTAL_SCROLLBAR_NEVER);
sp.setHorizontalScrollBar(null);
sp.setName("TreePopup.scrollPane");
sp.setFocusable(false);
sp.getVerticalScrollBar().se... | java |
public void show(Component parent) {
Dimension parentSize = parent.getSize();
Insets insets = getInsets();
// reduce the width of the scrollpane by the insets so that the popup
// is the same width as the combo box.
parentSize.setSize(parentSize.width - (insets.right + insets.left), 10 * parentSize... | java |
protected void fireActionPerformed(ActionEvent event) {
Object[] listeners = listenerList.getListenerList();
for(int i = listeners.length - 2; i >= 0; i -= 2) {
if(listeners[i] == ActionListener.class) {
((ActionListener) listeners[i + 1]).actionPerformed(event);
}
}
} | java |
private <T> void setCached(String prefix, String postfix, T data) {
cache.put(prefix + '.' + postfix, data);
} | java |
protected String getPropertyValue(String prefix, String postfix) {
String ret = properties.getProperty(prefix + "." + postfix);
if (ret != null) {
// logger.debugFine("Found property: "+prefix + "." +
// postfix+" for "+prefix);
return ret;
}
int pos = prefix.length();
while (pos >... | java |
@SuppressWarnings("unchecked")
public static <V extends NumberVector> NumberVector.Factory<V> guessFactory(SimpleTypeInformation<V> in) {
NumberVector.Factory<V> factory = null;
if(in instanceof VectorTypeInformation) {
factory = (NumberVector.Factory<V>) ((VectorTypeInformation<V>) in).getFactory();
... | java |
public void appendSimple(Object... data) {
if(data.length != meta.size()) {
throw new AbortException("Invalid number of attributes in 'append'.");
}
for(int i = 0; i < data.length; i++) {
@SuppressWarnings("unchecked")
final List<Object> col = (List<Object>) columns.get(i);
col.add(d... | java |
public static MultipleObjectsBundle fromStream(BundleStreamSource source) {
MultipleObjectsBundle bundle = new MultipleObjectsBundle();
boolean stop = false;
DBIDVar var = null;
ArrayModifiableDBIDs ids = null;
int size = 0;
while(!stop) {
BundleStreamSource.Event ev = source.nextEvent();
... | java |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.