If other objects have already been added to this Frequency, v must be comparable to those that have already been added.
v
399400401402403404405406407408409
for (int i = 0; i < sampleSize; i++) { long value = randomData.nextPoisson(mean); if (value > maxObservedValue) { maxObservedValue = value; } frequency.addValue(value); } /* * Set up bins for chi-square test. * Ensure expected counts are all at least minExpectedCount.
543544545546547548549550551552553
hexString = randomData.nextHexString(100); if (hexString.length() != 100) { Assert.fail("incorrect length for generated string"); } for (int j = 0; j < hexString.length(); j++) { f.addValue(hexString.substring(j, j + 1)); } } double[] expected = new double[16]; long[] observed = new long[16]; for (int i = 0; i < 16; i++) {
592593594595596597598599600601602
hexString = randomData.nextSecureHexString(100); if (hexString.length() != 100) { Assert.fail("incorrect length for generated string"); } for (int j = 0; j < hexString.length(); j++) { f.addValue(hexString.substring(j, j + 1)); } } double[] expected = new double[16]; long[] observed = new long[16]; for (int i = 0; i < 16; i++) {
685686687688689690691692693694695
// Find bin int j = 0; while (j < binCount - 1 && value > binBounds[j]) { j++; } freq.addValue(j); } final long[] observed = new long[binCount]; for (int i = 0; i < binCount; i++) { observed[i] = freq.getCount(i);
6465666768697071727374
.generate(rng)); // dynamismTest(list, expectedDynamism); ascendingOrderTest(list); // add the number of announcements f.addValue(newHashSet(list).size()); } assertTrue(isPoissonProcess(f, arrivalTimesGenerator.getGlobalAnnouncementIntensity(), 0.001, scenarioLength)); assertFalse(isPoissonProcess(f,
191192193194195196197198199200201
} else if (val < q3) { value = 2; } else { value = 3; } freq.addValue(value); } long[] observed = new long[4]; for (int i=0; i<4; i++) { observed[i] = freq.getCount(i); }
240241242243244245246247248249250
} else if (val < 0.75) { value = 2; } else { value = 3; } freq.addValue(value); } long[] observed = new long[4]; for (int i=0; i<4; i++) { observed[i] = freq.getCount(i); }
138139140141142143144145146147148
private void checkNextIntUniform(int min, int max) throws Exception { final Frequency freq = new Frequency(); for (int i = 0; i < smallSampleSize; i++) { final int value = randomData.nextInt(min, max); Assert.assertTrue("nextInt range", (value >= min) && (value <= max)); freq.addValue(value); } final int len = max - min + 1; final long[] observed = new long[len]; for (int i = 0; i < len; i++) { observed[i] = freq.getCount(min + i);
192193194195196197198199200201202
private void checkNextLongUniform(int min, int max) throws Exception { final Frequency freq = new Frequency(); for (int i = 0; i < smallSampleSize; i++) { final long value = randomData.nextLong(min, max); Assert.assertTrue("nextLong range", (value >= min) && (value <= max)); freq.addValue(value); } final int len = max - min + 1; final long[] observed = new long[len]; for (int i = 0; i < len; i++) { observed[i] = freq.getCount(min + i);
245246247248249250251252253254255
private void checkNextSecureLongUniform(int min, int max) throws Exception { final Frequency freq = new Frequency(); for (int i = 0; i < smallSampleSize; i++) { final long value = randomData.nextSecureLong(min, max); Assert.assertTrue("nextLong range", (value >= min) && (value <= max)); freq.addValue(value); } final int len = max - min + 1; final long[] observed = new long[len]; for (int i = 0; i < len; i++) { observed[i] = freq.getCount(min + i);