-
Notifications
You must be signed in to change notification settings - Fork 11
/
TODO.txt
72 lines (71 loc) · 1.45 KB
/
TODO.txt
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
Floats:
* Conversions from and to:
* primitive floats
* bnum floats
* FromStr trait
* Display, debug, upper exp, lower exp traits
* Transcendental functions:
* exp
* exp2
* ln
* log
* log2
* log10
* cbrt
* hypot
* sin
* cos
* tan
* asin
* acos
* atan
* atan2
* sin_cos
* exp_m1
* ln_1p
* sinh
* cosh
* tanh
* asinh
* acosh
* atanh
* to_degrees
* to_radians
* Optimised division algorithm depending on size of mantissa
* recip
* Optimised multiplication algorithm depending on size of mantissa
* Fused multiply add
* Constants:
* DIGITS
* MIN_10_EXP
* MAX_10_EXP
* Maths constants:
* E
* FRAC_1_PI
* FRAC_1_SQRT_2
* FRAC_2_PI
* FRAC_PI_2
* FRAC_PI_3
* FRAC_PI_4
* FRAC_PI_6
* FRAC_PI_8
* LN_2
* LN_10
* LOG2_10
* LOG2_E
* LOG10_2
* LOG10_E
* PI
* SQRT_2
* TAU
* FloatToInt trait
* From/TryFrom trait for ints, other floats
* Float type aliases from IEEE standard: f16, f32, f64, f80, f128. (Include f32 and f64 as allows const methods which aren't available on the primitives)
* Serde
* Rand
* num_traits::{Bounded, Float, FloatConst, AsPrimitive, FromPrimitive, ToPrimitive, One, Zero, Inv, MulAdd, MulAddAssign, Pow, Signed, Euclid, Num}
* Division algorithm which doesn't need where clause
Ints:
Faster mulitplication algorithm for larger integers
Faster division algorithms for larger integers
Update serde to use decimal string instead of struct debug - but CHECK that all serde options serialise primitive ints as decimal strings