/** * Setter for treatmentCount * @param treatmentCount * Number of comparisons made */ public void setTreatmentCount( final int treatmentCount) { ArgumentChecker.assertIsInRangeInclusive( "treatmentCount", treatmentCount, 2.0, Double.POSITIVE_INFINITY ); this.treatmentCount = treatmentCount; }
/** * Setter for treatmentCount * @param treatmentCount * Number of comparisons made */ public void setTreatmentCount( final int treatmentCount) { ArgumentChecker.assertIsInRangeInclusive( "treatmentCount", treatmentCount, 2.0, Double.POSITIVE_INFINITY ); this.treatmentCount = treatmentCount; }
/** * Setter for treatmentCount * @param treatmentCount * Number of comparisons made */ public void setTreatmentCount( final int treatmentCount) { ArgumentChecker.assertIsInRangeInclusive( "treatmentCount", treatmentCount, 2.0, Double.POSITIVE_INFINITY ); this.treatmentCount = treatmentCount; }
/** * Sets the leakage, which is the multiplier for the value when it is * less than zero. It is usually a small value. * * @param leakage * The leakage amount. Must be between 0 and 1. */ public void setLeakage( final double leakage) { ArgumentChecker.assertIsInRangeInclusive("leakage", leakage, 0.0, 1.0); this.leakage = leakage; }
/** * Sets the leakage, which is the multiplier for the value when it is * less than zero. It is usually a small value. * * @param leakage * The leakage amount. Must be between 0 and 1. */ public void setLeakage( final double leakage) { ArgumentChecker.assertIsInRangeInclusive("leakage", leakage, 0.0, 1.0); this.leakage = leakage; }
/** * Sets the leakage, which is the multiplier for the value when it is * less than zero. It is usually a small value. * * @param leakage * The leakage amount. Must be between 0 and 1. */ public void setLeakage( final double leakage) { ArgumentChecker.assertIsInRangeInclusive("leakage", leakage, 0.0, 1.0); this.leakage = leakage; }
@Override @SuppressWarnings("unchecked") public DataType get( int index) { ArgumentChecker.assertIsInRangeInclusive("index", index, 0, this.size-1); return (DataType) this.data[this.convert(index)]; }
@Override public DataType set( int index, DataType element) { ArgumentChecker.assertIsInRangeInclusive("index", index, 0, this.size-1); int pos = this.convert(index); @SuppressWarnings("unchecked") DataType oldValue = (DataType) this.data[pos]; this.data[pos] = element; return oldValue; }
@Override @SuppressWarnings("unchecked") public DataType get( int index) { ArgumentChecker.assertIsInRangeInclusive("index", index, 0, this.size-1); return (DataType) this.data[this.convert(index)]; }
@Override public DataType set( int index, DataType element) { ArgumentChecker.assertIsInRangeInclusive("index", index, 0, this.size-1); int pos = this.convert(index); @SuppressWarnings("unchecked") DataType oldValue = (DataType) this.data[pos]; this.data[pos] = element; return oldValue; }
@Override @SuppressWarnings("unchecked") public DataType get( int index) { ArgumentChecker.assertIsInRangeInclusive("index", index, 0, this.size-1); return (DataType) this.data[this.convert(index)]; }
@Override public DataType set( int index, DataType element) { ArgumentChecker.assertIsInRangeInclusive("index", index, 0, this.size-1); int pos = this.convert(index); @SuppressWarnings("unchecked") DataType oldValue = (DataType) this.data[pos]; this.data[pos] = element; return oldValue; }
/** * Gets the confidence to use for updating. Must be in [0, 1]. Called eta * in the paper. * * @param confidence * The confidence. Must be between 0 and 1, inclusive. */ public void setConfidence( final double confidence) { ArgumentChecker.assertIsInRangeInclusive( "confidence", confidence, 0.0, 1.0); this.confidence = confidence; // Compute phi. this.phi = -UnivariateGaussian.CDF.Inverse.evaluate( 1.0 - confidence, 0.0, 1.0 ); }
/** * Gets the confidence to use for updating. Must be in [0.5, 1]. Called eta * in the paper. * * @param confidence * The confidence. Must be between 0.5 and 1, inclusive. */ public void setConfidence( final double confidence) { ArgumentChecker.assertIsInRangeInclusive( "confidence", confidence, 0.5, 1.0); this.confidence = confidence; // Compute phi. this.phi = -UnivariateGaussian.CDF.Inverse.evaluate( 1.0 - confidence, 0.0, 1.0 ); this.psi = 1.0 + this.phi * this.phi / 2.0; this.epsilon = 1.0 + this.phi * this.phi; }
/** * Gets the confidence to use for updating. Must be in [0.5, 1]. Called eta * in the paper. * * @param confidence * The confidence. Must be between 0.5 and 1, inclusive. */ public void setConfidence( final double confidence) { ArgumentChecker.assertIsInRangeInclusive( "confidence", confidence, 0.5, 1.0); this.confidence = confidence; // Compute phi. this.phi = -UnivariateGaussian.CDF.Inverse.evaluate( 1.0 - confidence, 0.0, 1.0 ); this.psi = 1.0 + this.phi * this.phi / 2.0; this.epsilon = 1.0 + this.phi * this.phi; }
/** * Gets the confidence to use for updating. Must be in [0, 1]. Called eta * in the paper. * * @param confidence * The confidence. Must be between 0 and 1, inclusive. */ public void setConfidence( final double confidence) { ArgumentChecker.assertIsInRangeInclusive( "confidence", confidence, 0.0, 1.0); this.confidence = confidence; // Compute phi. this.phi = -UnivariateGaussian.CDF.Inverse.evaluate( 1.0 - confidence, 0.0, 1.0 ); }
/** * Gets the confidence to use for updating. Must be in [0, 1]. Called eta * in the paper. * * @param confidence * The confidence. Must be between 0 and 1, inclusive. */ public void setConfidence( final double confidence) { ArgumentChecker.assertIsInRangeInclusive( "confidence", confidence, 0.0, 1.0); this.confidence = confidence; // Compute phi. this.phi = -UnivariateGaussian.CDF.Inverse.evaluate( 1.0 - confidence, 0.0, 1.0 ); }
/** * Creates a new instance of Combinations * @param N * Universe set size * @param k * Number of objects to choose from the universe set. */ public Combinations( int N, int k ) { ArgumentChecker.assertIsPositive("N", N ); ArgumentChecker.assertIsNonNegative("k", k ); ArgumentChecker.assertIsInRangeInclusive("0<=k<=N", k, 0, N); this.N = N; this.k = k; }
/** * Creates a new instance of Combinations * @param N * Universe set size * @param k * Number of objects to choose from the universe set. */ public Combinations( int N, int k ) { ArgumentChecker.assertIsPositive("N", N ); ArgumentChecker.assertIsNonNegative("k", k ); ArgumentChecker.assertIsInRangeInclusive("0<=k<=N", k, 0, N); this.N = N; this.k = k; }
/** * Creates a new instance of Combinations * @param N * Universe set size * @param k * Number of objects to choose from the universe set. */ public Combinations( int N, int k ) { ArgumentChecker.assertIsPositive("N", N ); ArgumentChecker.assertIsNonNegative("k", k ); ArgumentChecker.assertIsInRangeInclusive("0<=k<=N", k, 0, N); this.N = N; this.k = k; }