Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
RNG-52: Conservative upper bound to avoid silent truncation.
Functionality is not limited since the Poisson distribution is already well approximated by a Gaussian for mean values larger than about 1000.
- Loading branch information
Gilles
committed
Nov 15, 2018
1 parent
350fb42
commit 8c927dc
Showing
5 changed files
with
74 additions
and
13 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
54 changes: 54 additions & 0 deletions
54
...c/test/java/org/apache/commons/rng/sampling/distribution/SmallMeanPoissonSamplerTest.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,54 @@ | ||
/* | ||
* Licensed to the Apache Software Foundation (ASF) under one or more | ||
* contributor license agreements. See the NOTICE file distributed with | ||
* this work for additional information regarding copyright ownership. | ||
* The ASF licenses this file to You under the Apache License, Version 2.0 | ||
* (the "License"); you may not use this file except in compliance with | ||
* the License. You may obtain a copy of the License at | ||
* | ||
* http://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, software | ||
* distributed under the License is distributed on an "AS IS" BASIS, | ||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
* See the License for the specific language governing permissions and | ||
* limitations under the License. | ||
*/ | ||
package org.apache.commons.rng.sampling.distribution; | ||
|
||
import org.apache.commons.rng.RandomProviderState; | ||
import org.apache.commons.rng.RestorableUniformRandomProvider; | ||
import org.apache.commons.rng.simple.RandomSource; | ||
import org.junit.Assert; | ||
import org.junit.Test; | ||
|
||
/** | ||
* This test checks the {@link SmallMeanPoissonSampler} can be created | ||
* from a saved state. | ||
*/ | ||
public class SmallMeanPoissonSamplerTest { | ||
|
||
// Edge cases for construction | ||
|
||
/** | ||
* Test the constructor with a bad mean. | ||
*/ | ||
@Test(expected=IllegalArgumentException.class) | ||
public void testConstructorThrowsWithMeanLargerThanUpperBound() { | ||
final RestorableUniformRandomProvider rng = | ||
RandomSource.create(RandomSource.SPLIT_MIX_64); | ||
@SuppressWarnings("unused") | ||
SmallMeanPoissonSampler sampler = new SmallMeanPoissonSampler(rng, Integer.MAX_VALUE / 2 + 1); | ||
} | ||
|
||
/** | ||
* Test the constructor with a bad mean. | ||
*/ | ||
@Test(expected=IllegalArgumentException.class) | ||
public void testConstructorThrowsWithZeroMean() { | ||
final RestorableUniformRandomProvider rng = | ||
RandomSource.create(RandomSource.SPLIT_MIX_64); | ||
@SuppressWarnings("unused") | ||
SmallMeanPoissonSampler sampler = new SmallMeanPoissonSampler(rng, 0); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters