/** * Adds a value to the receiver. * @param value the value to add. */ public void add(double value) { this.buffer.add(value); this.isSorted = false; } /**
public boolean apply(double key) { list.add(key); return true; } }
public boolean apply(double key) { list.add(key); return true; } }
/** * Adds a value to the receiver. * @param value the value to add. */ public void add(double value) { this.buffer.add(value); this.isSorted = false; } /**
public boolean apply(double key) { list.add(key); return true; } });
public boolean apply(int key) { list.add(get(key)); return true; } }
/** * Convenience method that computes phi's for equi-depth histograms. * This is simply a list of numbers with <tt>i / (double)quantiles</tt> for <tt>i={1,2,...,quantiles-1}</tt>. * @return the equi-depth phi's */ public static cern.colt.list.DoubleArrayList newEquiDepthPhis(int quantiles) { cern.colt.list.DoubleArrayList phis = new cern.colt.list.DoubleArrayList(quantiles-1); for (int i=1; i<=quantiles-1; i++) phis.add(i / (double)quantiles); return phis; } /**
/** * Adds a value to the receiver. */ public void add(double value) { if (! isAllocated) allocate(); // lazy buffer allocation can safe memory. values.add(value); this.isSorted = false; } /**
/** * Adds a value to the receiver. */ public void add(double value) { if (! isAllocated) allocate(); // lazy buffer allocation can safe memory. values.add(value); this.isSorted = false; } /**
public boolean apply(int key) { list.add(get(key)); return true; } }
/** * Convenience method that computes phi's for equi-depth histograms. * This is simply a list of numbers with <tt>i / (double)quantiles</tt> for <tt>i={1,2,...,quantiles-1}</tt>. * @return the equi-depth phi's */ public static cern.colt.list.DoubleArrayList newEquiDepthPhis(int quantiles) { cern.colt.list.DoubleArrayList phis = new cern.colt.list.DoubleArrayList(quantiles-1); for (int i=1; i<=quantiles-1; i++) phis.add(i / (double)quantiles); return phis; } /**
private void addToQueue(TripStateStats toStats) { if (!toStats.isExcluded()) { try { estimate(toStats); _queue.add(toStats); _counts.add(_queue.size()); } catch (NoPathException ex) { } } }
public boolean apply(double key, int value) { if (condition.apply(key, value)) { keyList.add(key); valueList.add(value); } return true; } });
public boolean apply(double key, int value) { if (condition.apply(key,value)) { keyList.add(key); valueList.add(value); } return true; } }
public boolean apply(int key, double value) { if (condition.apply(key,value)) { keyList.add(key); valueList.add(value); } return true; } }
public boolean apply(double key, int value) { if (condition.apply(key,value)) { keyList.add(key); valueList.add(value); } return true; } }
public boolean apply(int key, double value) { if (condition.apply(key,value)) { keyList.add(key); valueList.add(value); } return true; } }
private double[] noNans(double[] values) { DoubleArrayList vs = new DoubleArrayList(); for (double v : values) { if (!Double.isNaN(v)) vs.add(v); } vs.trimToSize(); return vs.elements(); }
public double nextDouble () { if (!caching) return stream.nextDouble(); else if (index >= values.size()) { double v = stream.nextDouble(); values.add (v); ++index; return v; } else return values.getQuick (index++); }
public double nextDouble() { if (!caching) return rvg.nextDouble(); else if (index >= values.size()) { double v = rvg.nextDouble(); values.add (v); ++index; return v; } else return values.getQuick (index++); }