code stringlengths 73 34.1k | label stringclasses 1
value |
|---|---|
private DBIDs getNearestNeighbors(Relation<V> relation, SimilarityQuery<V> simQ, DBIDRef queryObject) {
Heap<DoubleDBIDPair> nearestNeighbors = new TiedTopBoundedHeap<>(knn);
for(DBIDIter iter = relation.iterDBIDs(); iter.valid(); iter.advance()) {
if(DBIDUtil.equal(iter, queryObject)) {
continue;... | java |
private static double[] computePerDimensionVariances(Relation<? extends NumberVector> relation, double[] center, DBIDs neighborhood) {
final int dim = center.length;
double[] variances = new double[dim];
for(DBIDIter iter = neighborhood.iter(); iter.valid(); iter.advance()) {
NumberVector databaseObje... | java |
private double subspaceOutlierDegree(V queryObject, double[] center, long[] weightVector) {
final int card = BitsUtil.cardinality(weightVector);
if(card == 0) {
return 0;
}
final SubspaceEuclideanDistanceFunction df = new SubspaceEuclideanDistanceFunction(weightVector);
return df.distance(quer... | java |
public static long parseLongBase10(final CharSequence str, final int start, final int end) {
// Current position and character.
int pos = start;
char cur = str.charAt(pos);
// Match sign
boolean isNegative = (cur == '-');
// Carefully consume the - character, update c and i:
if((isNegative ... | java |
private static boolean matchInf(byte[] str, byte firstchar, int start, int end) {
final int len = end - start;
// The wonders of unicode. The infinity symbol \u221E is three bytes:
if(len == 3 && firstchar == -0x1E && str[start + 1] == -0x78 && str[start + 2] == -0x62) {
return true;
}
if((len... | java |
private static boolean matchNaN(byte[] str, byte firstchar, int start, int end) {
final int len = end - start;
if(len < 2 || len > 3 || (firstchar != 'N' && firstchar != 'n')) {
return false;
}
final byte c1 = str[start + 1];
if(c1 != 'a' && c1 != 'A') {
return false;
}
// Accept... | java |
public static void setLookAndFeel() {
try {
if(PREFER_GTK) {
LookAndFeelInfo[] lfs = UIManager.getInstalledLookAndFeels();
for(LookAndFeelInfo lf : lfs) {
if(lf.getClassName().contains("GTK")) {
UIManager.setLookAndFeel(lf.getClassName());
return;
}
... | java |
public static void logUncaughtExceptions(Logging logger) {
try {
Thread.setDefaultUncaughtExceptionHandler((t, e) -> logger.exception(e));
}
catch(SecurityException e) {
logger.warning("Could not set the Default Uncaught Exception Handler", e);
}
} | java |
protected List<OneItemset> buildFrequentOneItemsets(final Relation<? extends SparseFeatureVector<?>> relation, final int dim, final int needed) {
// TODO: use TIntList and prefill appropriately to avoid knowing "dim"
// beforehand?
int[] counts = new int[dim];
for(DBIDIter iditer = relation.iterDBIDs();... | java |
protected List<SparseItemset> buildFrequentTwoItemsets(List<OneItemset> oneitems, final Relation<BitVector> relation, final int dim, final int needed, DBIDs ids, ArrayModifiableDBIDs survivors) {
int f1 = 0;
long[] mask = BitsUtil.zero(dim);
for(OneItemset supported : oneitems) {
BitsUtil.setI(mask, s... | java |
protected List<? extends Itemset> frequentItemsets(List<? extends Itemset> candidates, Relation<BitVector> relation, int needed, DBIDs ids, ArrayModifiableDBIDs survivors, int length) {
if(candidates.isEmpty()) {
return Collections.emptyList();
}
Itemset first = candidates.get(0);
// We have an op... | java |
protected List<SparseItemset> frequentItemsetsSparse(List<SparseItemset> candidates, Relation<BitVector> relation, int needed, DBIDs ids, ArrayModifiableDBIDs survivors, int length) {
// Current search interval:
int begin = 0, end = candidates.size();
int[] scratchi = new int[length], iters = new int[length... | java |
private boolean initializeSearchItemset(BitVector bv, int[] scratchi, int[] iters) {
for(int i = 0; i < scratchi.length; i++) {
iters[i] = (i == 0) ? bv.iter() : bv.iterAdvance(iters[i - 1]);
if(iters[i] < 0) {
return false;
}
scratchi[i] = bv.iterDim(iters[i]);
}
return true... | java |
private boolean nextSearchItemset(BitVector bv, int[] scratchi, int[] iters) {
final int last = scratchi.length - 1;
for(int j = last; j >= 0; j--) {
int n = bv.iterAdvance(iters[j]);
if(n >= 0 && (j == last || n != iters[j + 1])) {
iters[j] = n;
scratchi[j] = bv.iterDim(n);
... | java |
private int binarySearch(List<SparseItemset> candidates, SparseItemset scratch, int begin, int end) {
--end;
while(begin < end) {
final int mid = (begin + end) >>> 1;
SparseItemset midVal = candidates.get(mid);
int cmp = midVal.compareTo(scratch);
if(cmp < 0) {
begin = mid + 1;
... | java |
private <A> ArrayList<int[]> buildPartitions(NumberArrayAdapter<?, A> adapter1, A data1, int len, int depth) {
final int[] idx = new int[len];
final double[] tmp = new double[len];
for(int i = 0; i < len; ++i) {
idx[i] = i;
tmp[i] = adapter1.getDouble(data1, i);
}
// Sort indexes:
In... | java |
private void divide(int[] idx, double[] data, ArrayList<int[]> ret, int start, int end, int depth) {
if(depth == 0) {
int[] a = Arrays.copyOfRange(idx, start, end);
Arrays.sort(a);
ret.add(a);
return;
}
final int count = end - start;
if(count == 0) {
// Corner case, that sh... | java |
private void intersectionMatrix(int[][] res, ArrayList<int[]> partsx, ArrayList<int[]> partsy, int gridsize) {
for(int x = 0; x < gridsize; x++) {
final int[] px = partsx.get(x);
final int[] rowx = res[x];
for(int y = 0; y < gridsize; y++) {
int[] py = partsy.get(y);
rowx[y] = inte... | java |
private int intersectionSize(int[] px, int[] py) {
int i = 0, j = 0, c = 0;
while(i < px.length && j < py.length) {
final int vx = px[i], vy = py[j];
if(vx < vy) {
++i;
}
else if(vx > vy) {
++j;
}
else {
++c;
++i;
++j;
}
}
... | java |
private double getMCEntropy(int[][] mat, ArrayList<int[]> partsx, ArrayList<int[]> partsy, int size, int gridsize, double loggrid) {
// Margin entropies:
double[] mx = new double[gridsize];
double[] my = new double[gridsize];
for(int i = 0; i < gridsize; i++) {
// Note: indexes are a bit tricky h... | java |
public void add(E e) {
// resize when needed
if(size + 1 > queue.length) {
resize(size + 1);
}
// final int pos = size;
this.size += 1;
heapifyUp(size - 1, e);
heapModified();
} | java |
@SuppressWarnings("unchecked")
public E replaceTopElement(E e) {
E oldroot = (E) queue[0];
heapifyDown(0, e);
heapModified();
return oldroot;
} | java |
@SuppressWarnings("unchecked")
protected E removeAt(int pos) {
if(pos < 0 || pos >= size) {
return null;
}
final E ret = (E) queue[pos];
// Replacement object:
final Object reinsert = queue[size - 1];
queue[size - 1] = null;
size--;
heapifyDown(pos, reinsert);
heapModified();... | java |
protected final void resize(int requiredSize) {
// Double until 64, then increase by 50% each time.
int newCapacity = ((queue.length < 64) ? ((queue.length + 1) << 1) : ((queue.length >> 1) + queue.length));
// overflow?
if(newCapacity < 0) {
throw new OutOfMemoryError();
}
if(requiredSize... | java |
public void clear() {
// clean up references in the array for memory management
for(int i = 0; i < size; i++) {
queue[i] = null;
}
this.size = 0;
heapModified();
} | java |
protected String checkHeap() {
for(int i = 1; i < size; i++) {
final int parent = (i - 1) >>> 1;
if(comparator.compare(queue[parent], queue[i]) > 0) {
return "@" + parent + ": " + queue[parent] + " < @" + i + ": " + queue[i];
}
}
return null;
} | java |
public void run() {
// Input step
Database db = inputStep.getDatabase();
hier = db.getHierarchy();
// Algorithms - Data Mining Step
algorithmStep.runAlgorithms(db);
// TODO: this could be nicer
hier.add(db, new SettingsResult(settings));
// Evaluation
evaluationStep.runEvaluators(... | java |
public void set(SpatialComparable obj) {
final int dim = min.length;
assert (obj.getDimensionality() == dim);
if(obj instanceof ModifiableHyperBoundingBox) {
ModifiableHyperBoundingBox ho = (ModifiableHyperBoundingBox) obj;
System.arraycopy(ho.getMinRef(), 0, min, 0, dim);
System.arraycopy... | java |
public boolean extend(SpatialComparable obj) {
final int dim = min.length;
assert (obj.getDimensionality() == dim);
boolean extended = false;
for(int i = 0; i < dim; i++) {
final double omin = obj.getMin(i);
final double omax = obj.getMax(i);
if(omin < min[i]) {
min[i] = omin;
... | java |
public static int findClassLabelColumn(MultipleObjectsBundle bundle) {
for(int i = 0, l = bundle.metaLength(); i < l; ++i) {
if(TypeUtil.CLASSLABEL.isAssignableFromType(bundle.meta(i))) {
return i;
}
}
return -1;
} | java |
@SuppressWarnings({ "unchecked", "rawtypes" })
@Override
public int compareTo(ClassLabel o) {
HierarchicalClassLabel h = (HierarchicalClassLabel) o;
for (int i = 0; i < this.levelwiseNames.length && i < h.levelwiseNames.length; i++) {
int comp = 0;
try {
Comparable first = this.levelwise... | java |
public String getNameAt(int level) {
return this.levelwiseNames[level] instanceof Integer ? this.levelwiseNames[level].toString() : (String) this.levelwiseNames[level];
} | java |
private void recursiveLogResult(StringBuilder buf, Hierarchy<Result> hier, Result result, int depth) {
if(result == null) {
buf.append("null");
LOG.warning("null result!");
return;
}
if(depth > 50) {
LOG.warning("Probably infinitely nested results, aborting!");
return;
}
... | java |
public ListParameterization addFlag(OptionID optionid) {
parameters.add(new ParameterPair(optionid, Flag.SET));
return this;
} | java |
public ArrayList<String> serialize() {
ArrayList<String> params = new ArrayList<>();
for(ParameterPair pair : parameters) {
params.add(SerializedParameterization.OPTION_PREFIX + pair.option.toString());
if(pair.value instanceof String) {
params.add((String) pair.value);
}
else if... | java |
@Override
public OutlierResult run(Database db, Relation<V> relation) {
DBIDs ids = relation.getDBIDs();
WritableDoubleDataStore abodvalues = DataStoreUtil.makeDoubleStorage(ids, DataStoreFactory.HINT_STATIC);
DoubleMinMax minmaxabod = new DoubleMinMax();
if(kernelFunction.getClass() == LinearKernelFu... | java |
private boolean kNNABOD(Database db, Relation<V> relation, DBIDs ids, WritableDoubleDataStore abodvalues, DoubleMinMax minmaxabod) {
DistanceQuery<V> dq = db.getDistanceQuery(relation, SquaredEuclideanDistanceFunction.STATIC);
KNNQuery<V> knnq = db.getKNNQuery(dq, DatabaseQuery.HINT_OPTIMIZED_ONLY);
boolean... | java |
private void fastABOD(Database db, Relation<V> relation, DBIDs ids, WritableDoubleDataStore abodvalues, DoubleMinMax minmaxabod) {
// Build a kernel matrix, to make O(n^3) slightly less bad.
SimilarityQuery<V> sq = db.getSimilarityQuery(relation, kernelFunction);
KernelMatrix kernelMatrix = new KernelMatrix... | java |
@Override
public double getWeight(double distance, double max, double stddev) {
if(stddev <= 0) {
return 1;
}
return NormalDistribution.erfc(MathUtil.SQRTHALF * distance / stddev);
} | java |
public OutlierResult run(Database database, Relation<O> relation) {
StepProgress stepprog = LOG.isVerbose() ? new StepProgress("LOF", 3) : null;
DBIDs ids = relation.getDBIDs();
LOG.beginStep(stepprog, 1, "Materializing nearest-neighbor sets.");
KNNQuery<O> knnq = DatabaseUtil.precomputedKNNQuery(datab... | java |
private void computeLRDs(KNNQuery<O> knnq, DBIDs ids, WritableDoubleDataStore lrds) {
FiniteProgress lrdsProgress = LOG.isVerbose() ? new FiniteProgress("Local Reachability Densities (LRD)", ids.size(), LOG) : null;
double lrd;
for(DBIDIter iter = ids.iter(); iter.valid(); iter.advance()) {
lrd = comp... | java |
protected double computeLRD(KNNQuery<O> knnq, DBIDIter curr) {
final KNNList neighbors = knnq.getKNNForDBID(curr, k);
double sum = 0.0;
int count = 0;
for(DoubleDBIDListIter neighbor = neighbors.iter(); neighbor.valid(); neighbor.advance()) {
if(DBIDUtil.equal(curr, neighbor)) {
continue;
... | java |
private void computeLOFScores(KNNQuery<O> knnq, DBIDs ids, DoubleDataStore lrds, WritableDoubleDataStore lofs, DoubleMinMax lofminmax) {
FiniteProgress progressLOFs = LOG.isVerbose() ? new FiniteProgress("Local Outlier Factor (LOF) scores", ids.size(), LOG) : null;
double lof;
for(DBIDIter iter = ids.iter()... | java |
protected double computeLOFScore(KNNQuery<O> knnq, DBIDRef cur, DoubleDataStore lrds) {
final double lrdp = lrds.doubleValue(cur);
if(Double.isInfinite(lrdp)) {
return 1.0;
}
double sum = 0.;
int count = 0;
final KNNList neighbors = knnq.getKNNForDBID(cur, k);
for(DBIDIter neighbor = n... | java |
protected double kNNDistance() {
double result = getEntry(0).getKnnDistance();
for(int i = 1; i < getNumEntries(); i++) {
double knnDistance = getEntry(i).getKnnDistance();
result = (result < knnDistance) ? knnDistance : result;
}
return result;
} | java |
public boolean readLine(Appendable buf) throws IOException {
boolean success = false;
while(true) {
// Process buffer:
while(pos < end) {
success = true;
final char c = buffer[pos++];
if(c == '\n') {
return success;
}
if(c == '\r') {
contin... | java |
private static final int bestPivot(int rank, int m1, int m2, int m3, int m4, int m5) {
if(rank < m1) {
return m1;
}
if(rank > m5) {
return m5;
}
if(rank < m2) {
return m2;
}
if(rank > m4) {
return m4;
}
return m3;
} | java |
@Override
public void writeExternal(ObjectOutput out) throws IOException {
super.writeExternal(out);
int k_max = knnDistances.length;
out.writeInt(k_max);
for(int i = 0; i < k_max; i++) {
out.writeDouble(knnDistances[i]);
}
} | java |
@Override
public void readExternal(ObjectInput in) throws IOException, ClassNotFoundException {
super.readExternal(in);
int k_max = in.readInt();
knnDistances = new double[k_max];
for(int i = 0; i < k_max; i++) {
knnDistances[i] = in.readDouble();
}
} | java |
public double getValueAt(int k) {
if (k < k_0) {
return Double.POSITIVE_INFINITY;
}
return m * FastMath.log(k) + t;
} | java |
public void iterate() {
// build covmat out of fitting matrix by multiplying diagonal elements with
// 1+lambda
for(int i = 0; i < numfit; i++) {
System.arraycopy(alpha[i], 0, covmat[i], 0, numfit);
covmat[i][i] *= (1.0 + lambda);
}
// Solve the equation system (Gauss-Jordan)
LinearE... | java |
public void run() {
int maxruns = this.maxruns, maxsmall = this.maxsmall;
double oldchi = getChiSq();
while(maxruns-- > 0) {
iterate();
double newchi = getChiSq(), deltachi = newchi - oldchi;
oldchi = newchi;
// stop condition: only a small improvement in Chi.
if(deltachi < 0 &... | java |
public double[] get(T object) {
double[] v = map.get(object);
if(v == null) {
return null;
}
return v.clone();
} | java |
public double relativeFill() {
double acc = 0.0;
final int cols = widths.size();
final int rows = heights.size();
{
for(int y = 0; y < rows; y++) {
for(int x = 0; x < cols; x++) {
if(usage.get(y).get(x) != null) {
acc += widths.get(x) * heights.get(y);
}
... | java |
public boolean contains(NumberVector vector) {
for(int i = 0; i < dims.length; i++) {
final double value = vector.doubleValue(dims[i]);
if(bounds[i << 1] > value || value >= bounds[(i << 1) + 1]) {
return false;
}
}
return true;
} | java |
public boolean addFeatureVector(DBIDRef id, NumberVector vector) {
if(contains(vector)) {
ids.add(id);
return true;
}
return false;
} | java |
protected boolean containsRightNeighbor(CLIQUEUnit unit, int d) {
final int e = dims.length - 1;
return checkDimensions(unit, e) && bounds[e << 1] == unit.bounds[(e << 1) + 1];
} | java |
protected CLIQUEUnit join(CLIQUEUnit other, double all, double tau) {
if(other.dimensionality() != this.dimensionality()) {
return null;
}
// n-1 dimensions must be the same:
int e = dims.length - 1;
if(!checkDimensions(other, e)) {
return null;
}
if(dims[e] >= other.dims[e]) {
... | java |
private boolean checkDimensions(CLIQUEUnit other, int e) {
for(int i = 0, j = 0; i < e; i++, j += 2) {
if(dims[i] != other.dims[i] || bounds[j] != other.bounds[j] || bounds[j + 1] != bounds[j + 1]) {
return false;
}
}
return true;
} | java |
protected synchronized void merge(DoubleMinMax minmax) {
this.minmax.put(minmax.getMin());
this.minmax.put(minmax.getMax());
} | java |
public void enableStart() {
EventTarget targ = (EventTarget) element;
targ.addEventListener(SVGConstants.SVG_EVENT_MOUSEDOWN, this, false);
} | java |
public void disableStart() {
EventTarget targ = (EventTarget) element;
targ.removeEventListener(SVGConstants.SVG_EVENT_MOUSEDOWN, this, false);
} | java |
protected void enableStop() {
EventTarget targ = svgp.getDocument().getRootElement();
targ.addEventListener(SVGConstants.SVG_EVENT_MOUSEMOVE, this, false);
targ.addEventListener(SVGConstants.SVG_EVENT_MOUSEUP, this, false);
// FIXME: listen on the background object!
targ.addEventListener(SVGConstant... | java |
protected void disableStop() {
EventTarget targ = svgp.getDocument().getRootElement();
targ.removeEventListener(SVGConstants.SVG_EVENT_MOUSEMOVE, this, false);
targ.removeEventListener(SVGConstants.SVG_EVENT_MOUSEUP, this, false);
// FIXME: listen on the background object!
targ.removeEventListener(S... | java |
protected SVGPoint getCoordinates(Event evt) {
return SVGUtil.elementCoordinatesFromEvent(this.svgp.getDocument(), this.coordref, evt);
} | java |
protected boolean startDrag(SVGPoint startPoint, Event evt) {
if (listener != null) {
return listener.startDrag(startPoint, evt);
}
return true;
} | java |
protected boolean duringDrag(SVGPoint startPoint, SVGPoint dragPoint, Event evt, boolean inside) {
if (listener != null) {
return listener.duringDrag(startPoint, dragPoint, evt, inside);
}
return true;
} | java |
public void makeInvisible() {
CSSClass cls = new CSSClass(this, "unused");
cls.setStatement(SVGConstants.CSS_FILL_OPACITY_PROPERTY, "0");
cls.setStatement(SVGConstants.CSS_CURSOR_PROPERTY, SVGConstants.CSS_POINTER_VALUE);
SVGUtil.setAtt(element, SVGConstants.SVG_STYLE_ATTRIBUTE, cls.inlineCSS());
} | java |
public void makeVisible() {
CSSClass cls = new CSSClass(this, "unused");
cls.setStatement(SVGConstants.CSS_FILL_PROPERTY, SVGConstants.CSS_GREEN_VALUE);
cls.setStatement(SVGConstants.CSS_FILL_OPACITY_PROPERTY, "0.2");
cls.setStatement(SVGConstants.CSS_CURSOR_PROPERTY, SVGConstants.CSS_POINTER_VALUE);
... | java |
public void setFill(double val, double min, double max) {
this.val = val;
this.min = min;
this.max = max;
} | java |
public Element build(SVGPlot svgp, double x, double y, double width, double height) {
Element barchart = svgp.svgElement(SVGConstants.SVG_G_TAG);
// TODO: use style library for colors!
Element bar = svgp.svgRect(x, y, width, height);
bar.setAttribute(SVGConstants.SVG_FILL_ATTRIBUTE, "#a0a0a0");
bar... | java |
void openBuffer() {
if(buffer == null) {
try {
buffer = input.map(MapMode.READ_ONLY, 0, input.size());
}
catch(IOException e) {
throw new AbortException("Cannot map input bundle.", e);
}
}
} | java |
void readMeta() {
final int check = buffer.getInt();
if(check != MAGIC) {
throw new AbortException("File does not start with expected magic.");
}
final int nummeta = buffer.getInt();
assert (nummeta > 0) : "Empty bundle?";
meta = new BundleMeta(nummeta);
sers = new ByteBufferSerializer... | java |
void readObject() {
for(int i = 0; i < sers.length; ++i) {
try {
data[i] = sers[i].fromByteBuffer(buffer);
}
catch(UnsupportedOperationException e) {
throw new AbortException("Deserialization failed.", e);
}
catch(IOException e) {
throw new AbortException("IO er... | java |
public Clustering<PrototypeModel<O>> run(Relation<O> relation) {
RangeQuery<O> rq = relation.getRangeQuery(getDistanceFunction(), threshold);
ModifiableDBIDs seen = DBIDUtil.newHashSet(relation.size());
Clustering<PrototypeModel<O>> clustering = new Clustering<>("Prototype clustering", "prototype-clusterin... | java |
@Override
public void writeToText(TextWriterStream out, String label) {
String name = getNameAutomatic();
if(name != null) {
out.commentPrintLn("Cluster name: " + name);
}
out.commentPrintLn("Cluster noise flag: " + isNoise());
out.commentPrintLn("Cluster size: " + ids.size());
// also p... | java |
private void scheduleSetPlot(final SVGPlot oldplot, final SVGPlot newplot) {
UpdateManager um = this.getUpdateManager();
if(um != null) {
synchronized(um) {
if(um.isRunning()) {
// LoggingUtil.warning("Scheduling detach: " + this + " " + oldplot);
final Runnable detach = new Ru... | java |
private void attachPlot(SVGPlot newplot) {
this.plot = newplot;
if(newplot == null) {
super.setSVGDocument(null);
return;
}
newplot.synchronizeWith(synchronizer);
super.setSVGDocument(newplot.getDocument());
super.setDisableInteractions(newplot.getDisableInteractions());
} | java |
private void detachPlot(SVGPlot oldplot) {
if(oldplot == null) {
return;
}
this.plot = null;
oldplot.unsynchronizeWith(synchronizer);
} | java |
protected double estimateID(DBIDRef ignore, DoubleDBIDListIter it, double[] p) {
int j = 0;
for(it.seek(0); it.valid(); it.advance()) {
if(it.doubleValue() == 0. || DBIDUtil.equal(ignore, it)) {
continue;
}
p[j++] = it.doubleValue();
}
if(j < 2) {
throw new ArithmeticExce... | java |
public static double logpdf(double val, double rate) {
return val < 0. ? Double.NEGATIVE_INFINITY : FastMath.log(rate) - rate * val;
} | java |
public static double quantile(double val, double rate) {
return val >= 0 && val <= 1 ? -FastMath.log(1 - val) / rate : Double.NaN;
} | java |
private MarkdownDocStream pendingBreak() {
if(newline == Newline.NONE) {
return this;
}
out.append(newline == Newline.BREAK ? "\\\n" : newline == Newline.PAR ? "\n\n" : "\n");
for(int i = indent, j = i; i > 0; i -= j) {
out.append(WHITESPACES, 0, (j = i > WHITESPACES.length() ? WHITESPACES.l... | java |
public MarkdownDocStream append(char c) {
if(c == '\n') {
newline = newline == Newline.NONE ? Newline.NEWLINE : Newline.PAR;
return this;
}
pendingBreak();
out.append(c);
return this;
} | java |
public MarkdownDocStream append(CharSequence p, int start, int end) {
for(int pos = start; pos < end; ++pos) {
final char c = p.charAt(pos);
if(c == '\r') {
continue;
}
append(c); // Uses \n magic.
}
return this;
} | java |
public MarkdownDocStream indent(int newindent) {
if(newindent < indent) {
newline = newline == Newline.BREAK ? Newline.NEWLINE : Newline.PAR;
}
indent = newindent;
return this;
} | java |
public final void render(GL2 gl) {
gl.glMatrixMode(GL2.GL_PROJECTION);
gl.glPushMatrix();
gl.glLoadIdentity();
gl.glMatrixMode(GL2.GL_MODELVIEW);
gl.glPushMatrix();
gl.glLoadIdentity();
gl.glOrtho(0, width, 0, height, -1, +1);
gl.glColor4f(0f, 0f, 0f, .5f);
// Fade background:
... | java |
@Override
public int setPageID(P page) {
int pageID = page.getPageID();
if(pageID == -1) {
pageID = getNextEmptyPageID();
if(pageID == -1) {
pageID = nextPageID++;
}
page.setPageID(pageID);
}
return pageID;
} | java |
public StringBuilder appendToBuffer(StringBuilder buf) {
Iterator<double[]> iter = points.iterator();
while(iter.hasNext()) {
double[] data = iter.next();
for(int i = 0; i < data.length; i++) {
if(i > 0) {
buf.append(',');
}
buf.append(data[i]);
}
if(ite... | java |
public boolean containsPoint2D(double[] v) {
assert (v.length == 2);
final double testx = v[0];
final double testy = v[1];
boolean c = false;
Iterator<double[]> it = points.iterator();
double[] pre = points.get(points.size() - 1);
while(it.hasNext()) {
final double[] cur = it.next();
... | java |
public static AffineTransformation reorderAxesTransformation(int dim, int... axes) {
double[][] m = zeroMatrix(dim + 1);
// insert ones appropriately:
for(int i = 0; i < axes.length; i++) {
assert (0 < axes[i] && axes[i] <= dim);
m[i][axes[i] - 1] = 1.0;
}
int useddim = 1;
for(int i ... | java |
public void addTranslation(double[] v) {
assert (v.length == dim);
// reset inverse transformation - needs recomputation.
inv = null;
double[][] homTrans = unitMatrix(dim + 1);
for(int i = 0; i < dim; i++) {
homTrans[i][dim] = v[i];
}
trans = times(homTrans, trans);
} | java |
public void addMatrix(double[][] m) {
assert (m.length == dim);
assert (m[0].length == dim);
// reset inverse transformation - needs recomputation.
inv = null;
// extend the matrix with an extra row and column
double[][] ht = new double[dim + 1][dim + 1];
for(int i = 0; i < dim; i++) {
... | java |
public void addRotation(int axis1, int axis2, double angle) {
// TODO: throw an exception instead of using assert
assert (axis1 >= 0);
assert (axis1 < dim);
assert (axis1 >= 0);
assert (axis2 < dim);
assert (axis1 != axis2);
// reset inverse transformation - needs recomputation.
inv = n... | java |
public void addAxisReflection(int axis) {
assert (0 < axis && axis <= dim);
// reset inverse transformation - needs recomputation.
inv = null;
// Formal:
// Matrix homTrans = Matrix.unitMatrix(dim + 1);
// homTrans[axis - 1][axis - 1] = -1;
// trans = homTrans.times(trans);
// Faster:
... | java |
public double[] homogeneVector(double[] v) {
assert (v.length == dim);
double[] dv = Arrays.copyOf(v, dim + 1);
dv[dim] = 1.0;
return dv;
} | java |
public double[] homogeneRelativeVector(double[] v) {
assert (v.length == dim);
// TODO: this only works properly when trans[dim][dim] == 1.0, right?
double[] dv = Arrays.copyOf(v, dim + 1);
dv[dim] = 0.0;
return dv;
} | java |
private double computeConfidence(int support, int samples) {
final double z = NormalDistribution.standardNormalQuantile(alpha);
final double eprob = support / (double) samples;
return Math.max(0., eprob - z * FastMath.sqrt((eprob * (1 - eprob)) / samples));
} | java |
protected Clustering<?> runClusteringAlgorithm(ResultHierarchy hierarchy, Result parent, DBIDs ids, DataStore<DoubleVector> store, int dim, String title) {
SimpleTypeInformation<DoubleVector> t = new VectorFieldTypeInformation<>(DoubleVector.FACTORY, dim);
Relation<DoubleVector> sample = new MaterializedRelatio... | java |
public static void load(Class<?> parent, ClassLoader cl) {
char[] buf = new char[0x4000];
try {
String fullName = RESOURCE_PREFIX + parent.getName();
Enumeration<URL> configfiles = cl.getResources(fullName);
while(configfiles.hasMoreElements()) {
URL nextElement = configfiles.nextEleme... | java |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.