1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
package com.github.technus.tectech.util;
import java.util.Arrays;
import static java.lang.Math.max;
import static java.lang.Math.ulp;
public class DoubleCount {
public static double[] distribute(double count,double... probabilities){
if(probabilities==null){
return null;
}else if(count==0){
return new double[probabilities.length];
}else {
switch (probabilities.length){
default: {
int size=probabilities.length;
double[] output=new double[size];
size--;
double remaining=count,previous=probabilities[size],probability,out,sum=0;
for (int i = size - 1; i >= 0; i--) {
probability=probabilities[i];
remaining-=out=count*probability;
sum+=output[i]=out-ulp(out);
if(previous<probability){
throw new ArithmeticException("Malformed probability order: "+ Arrays.toString(probabilities));
}
previous=probability;
}
if(remaining*count<0){
throw new ArithmeticException("Malformed probability sum: "+ Arrays.toString(probabilities));
}
sum+=output[size]=remaining-ulp(remaining)*size;
if(sum>count){
throw new ArithmeticException("Too much outputted: "+ Arrays.toString(output)+" "+sum+" / "+count);
}
return output;
}
case 1: return new double[]{count};
case 0: return probabilities;//empty array at hand...
}
}
}
public static double div(double count,double divisor){
if (divisor == 0) {
throw new ArithmeticException("Divide by 0");
}else if(count==0 || divisor==1){
return count;
}else if(divisor==-1){
return -count;
} else {
double result = count / divisor;
if(result*count<0){
return 0;
}
return result-ulp(result);
}
}
public static double mul(double count,double multiplier){
if(count==0 || multiplier==1){
return count;
}else if(multiplier==-1){
return -count;
} else {
double result = count * multiplier;
if(result*count<0){
return 0;
}
return result-ulp(result);
}
}
public static double sub(double count,double value){
if(value==0){
return count;
}
if(count==0){
return -value;
}
if(value==count){
return 0;
}
return value < 0 ? addInternal(count, -value) : subInternal(count, value);
}
public static double add(double count,double value){
if(value==0){
return count;
}
if(count==0){
return value;
}
return value < 0 ? subInternal(count, -value) : addInternal(count, value);
}
private static double subInternal(double count,double value){
double result = count - max(value,ulp(count));
if (result+value>count || value>count-result){
result-=ulp(result);
}
return result;
}
private static double addInternal(double count,double value){
double result = count + value;
if (result-value>count || result-count>value){
result-=ulp(result);
}
return result;
}
}
|
