UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-03-18 21:30:38 +01:00
Code Issues Packages Projects Releases Wiki Activity

[probability] Add comment for future improvement in Binomial law

Browse Source 
computation
This commit is contained in:
Émilie Feral
2018-05-23 09:59:41 +02:00
committed by LeaNumworks
parent 0ee32e15be
commit 84a78c8a9b
1 changed files with 7 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
apps/probability/law/binomial_law.cpp
View File

@@ -70,6 +70,13 @@ float BinomialLaw::yMax() {
bool BinomialLaw::authorizedValueAtIndex(float x, int index) const {
if (index == 0) {
/* As the cumulative probability are computed by looping over all discrete
* abscissa within the interesting range, the complexity of the cumulative
* probability is linear with the size of the range. Here we cap the maximal
* size of the range to 10000. If one day we want to increase or get rid of
* this cap, we should implement the explicite formula of the cumulative
* probability (which depends on an incomplete beta function) to make the
* comlexity O(1). */
if (x != (int)x || x < 0.0f || x > 9999.0f) {
return false;
}