From Jason Turner

[math.constants]

C++20 → C++23 8.7 KB 61 lines
Current Draft | LaTeX Source
Archived: C++20 | C++23
Markdown: C++20 | C++23
Explore in Adventure Game
C++ Weekly: Ep 228

Diff to HTML by rtfpessoa

Files changed (1) hide show
  1. tmp/tmp1cb5xhbf/{from.md → to.md} +25 -26
tmp/tmp1cb5xhbf/{from.md → to.md} RENAMED
@@ -16,27 +16,19 @@ constant variable template is ill-formed.
16
 
17
  <!-- Link reference definitions -->
18
  [bad.alloc]: support.md#bad.alloc
19
  [basic.fundamental]: basic.md#basic.fundamental
20
  [basic.stc.thread]: basic.md#basic.stc.thread
21
- [basic.types]: basic.md#basic.types
22
- [bit]: #bit
23
- [bit.cast]: #bit.cast
24
- [bit.count]: #bit.count
25
- [bit.endian]: #bit.endian
26
- [bit.general]: #bit.general
27
- [bit.pow.two]: #bit.pow.two
28
- [bit.rotate]: #bit.rotate
29
- [bit.syn]: #bit.syn
30
  [c.math]: #c.math
31
  [c.math.abs]: #c.math.abs
32
  [c.math.fpclass]: #c.math.fpclass
33
  [c.math.hypot3]: #c.math.hypot3
34
  [c.math.lerp]: #c.math.lerp
35
  [c.math.rand]: #c.math.rand
36
  [cfenv]: #cfenv
37
  [cfenv.syn]: #cfenv.syn
 
38
  [class.gslice]: #class.gslice
39
  [class.gslice.overview]: #class.gslice.overview
40
  [class.slice]: #class.slice
41
  [class.slice.overview]: #class.slice.overview
42
  [cmath.syn]: #cmath.syn
@@ -44,23 +36,22 @@ constant variable template is ill-formed.
44
  [complex]: #complex
45
  [complex.literals]: #complex.literals
46
  [complex.member.ops]: #complex.member.ops
47
  [complex.members]: #complex.members
48
  [complex.numbers]: #complex.numbers
 
49
  [complex.ops]: #complex.ops
50
- [complex.special]: #complex.special
51
  [complex.syn]: #complex.syn
52
  [complex.transcendentals]: #complex.transcendentals
53
  [complex.value.ops]: #complex.value.ops
54
  [cons.slice]: #cons.slice
55
  [conv.prom]: expr.md#conv.prom
56
  [cpp.pragma]: cpp.md#cpp.pragma
57
  [cpp17.copyassignable]: #cpp17.copyassignable
58
  [cpp17.copyconstructible]: #cpp17.copyconstructible
59
  [cpp17.equalitycomparable]: #cpp17.equalitycomparable
60
  [dcl.init]: dcl.md#dcl.init
61
- [expr.const]: expr.md#expr.const
62
  [gslice.access]: #gslice.access
63
  [gslice.array.assign]: #gslice.array.assign
64
  [gslice.array.comp.assign]: #gslice.array.comp.assign
65
  [gslice.array.fill]: #gslice.array.fill
66
  [gslice.cons]: #gslice.cons
@@ -68,11 +59,10 @@ constant variable template is ill-formed.
68
  [indirect.array.assign]: #indirect.array.assign
69
  [indirect.array.comp.assign]: #indirect.array.comp.assign
70
  [indirect.array.fill]: #indirect.array.fill
71
  [input.iterators]: iterators.md#input.iterators
72
  [input.output]: input.md#input.output
73
- [intro.object]: basic.md#intro.object
74
  [iostate.flags]: input.md#iostate.flags
75
  [istream.formatted]: input.md#istream.formatted
76
  [iterator.concept.contiguous]: iterators.md#iterator.concept.contiguous
77
  [iterator.requirements.general]: iterators.md#iterator.requirements.general
78
  [library.c]: library.md#library.c
@@ -87,10 +77,11 @@ constant variable template is ill-formed.
87
  [numeric.requirements]: #numeric.requirements
88
  [numerics]: #numerics
89
  [numerics.general]: #numerics.general
90
  [numerics.summary]: #numerics.summary
91
  [output.iterators]: iterators.md#output.iterators
 
92
  [rand]: #rand
93
  [rand.adapt]: #rand.adapt
94
  [rand.adapt.disc]: #rand.adapt.disc
95
  [rand.adapt.general]: #rand.adapt.general
96
  [rand.adapt.ibits]: #rand.adapt.ibits
@@ -122,13 +113,15 @@ constant variable template is ill-formed.
122
  [rand.dist.samp.plinear]: #rand.dist.samp.plinear
123
  [rand.dist.uni]: #rand.dist.uni
124
  [rand.dist.uni.int]: #rand.dist.uni.int
125
  [rand.dist.uni.real]: #rand.dist.uni.real
126
  [rand.eng]: #rand.eng
 
127
  [rand.eng.lcong]: #rand.eng.lcong
128
  [rand.eng.mers]: #rand.eng.mers
129
  [rand.eng.sub]: #rand.eng.sub
 
130
  [rand.predef]: #rand.predef
131
  [rand.req]: #rand.req
132
  [rand.req.adapt]: #rand.req.adapt
133
  [rand.req.dist]: #rand.req.dist
134
  [rand.req.eng]: #rand.req.eng
@@ -154,10 +147,11 @@ constant variable template is ill-formed.
154
  [sf.cmath.cyl.neumann]: #sf.cmath.cyl.neumann
155
  [sf.cmath.ellint.1]: #sf.cmath.ellint.1
156
  [sf.cmath.ellint.2]: #sf.cmath.ellint.2
157
  [sf.cmath.ellint.3]: #sf.cmath.ellint.3
158
  [sf.cmath.expint]: #sf.cmath.expint
 
159
  [sf.cmath.hermite]: #sf.cmath.hermite
160
  [sf.cmath.laguerre]: #sf.cmath.laguerre
161
  [sf.cmath.legendre]: #sf.cmath.legendre
162
  [sf.cmath.riemann.zeta]: #sf.cmath.riemann.zeta
163
  [sf.cmath.sph.bessel]: #sf.cmath.sph.bessel
@@ -177,10 +171,11 @@ constant variable template is ill-formed.
177
  [template.mask.array.overview]: #template.mask.array.overview
178
  [template.slice.array]: #template.slice.array
179
  [template.slice.array.overview]: #template.slice.array.overview
180
  [template.valarray]: #template.valarray
181
  [template.valarray.overview]: #template.valarray.overview
 
182
  [thread.jthread.class]: thread.md#thread.jthread.class
183
  [thread.thread.class]: thread.md#thread.thread.class
184
  [utility.arg.requirements]: library.md#utility.arg.requirements
185
  [valarray.access]: #valarray.access
186
  [valarray.assign]: #valarray.assign
@@ -199,57 +194,61 @@ constant variable template is ill-formed.
199
 
200
  [^1]: In other words, value types. These include arithmetic types,
201
  pointers, the library class `complex`, and instantiations of
202
  `valarray` for value types.
203
 
204
- [^2]: The name of this engine refers, in part, to a property of its
 
 
 
 
205
  period: For properly-selected values of the parameters, the period
206
  is closely related to a large Mersenne prime number.
207
 
208
- [^3]: The parameter is intended to allow an implementation to
209
  differentiate between different sources of randomness.
210
 
211
- [^4]: If a device has n states whose respective probabilities are
212
  P₀, …, Pₙ₋₁, the device entropy S is defined as
213
  $S = - \sum_{i=0}^{n-1} P_i \cdot \log P_i$.
214
 
215
- [^5]: b is introduced to avoid any attempt to produce more bits of
216
  randomness than can be held in `RealType`.
217
 
218
- [^6]: The distribution corresponding to this probability density
219
  function is also known (with a possible change of variable) as the
220
  Gumbel Type I, the log-Weibull, or the Fisher-Tippett Type I
221
  distribution.
222
 
223
- [^7]: [[implimits]] recommends a minimum number of recursively nested
224
  template instantiations. This requirement thus indirectly suggests a
225
  minimum allowable complexity for valarray expressions.
226
 
227
- [^8]: The intent is to specify an array template that has the minimum
228
  functionality necessary to address aliasing ambiguities and the
229
  proliferation of temporary objects. Thus, the `valarray` template is
230
  neither a matrix class nor a field class. However, it is a very
231
  useful building block for designing such classes.
232
 
233
- [^9]: This default constructor is essential, since arrays of `valarray`
234
- may be useful. After initialization, the length of an empty array
235
  can be increased with the `resize` member function.
236
 
237
- [^10]: This constructor is the preferred method for converting a C array
238
  to a `valarray` object.
239
 
240
- [^11]: This copy constructor creates a distinct array rather than an
241
  alias. Implementations in which arrays share storage are permitted,
242
  but they would need to implement a copy-on-reference mechanism to
243
  ensure that arrays are conceptually distinct.
244
 
245
- [^12]: BLAS stands for *Basic Linear Algebra Subprograms.* C++ programs
246
- may instantiate this class. See, for example, Dongarra, Du Croz,
247
  Duff, and Hammerling: *A set of Level 3 Basic Linear Algebra
248
  Subprograms*; Technical Report MCS-P1-0888, Argonne National
249
  Laboratory (USA), Mathematics and Computer Science Division, August,
250
  1988.
251
 
252
- [^13]: A mathematical function is mathematically defined for a given set
253
  of argument values (a) if it is explicitly defined for that set of
254
  argument values, or (b) if its limiting value exists and does not
255
  depend on the direction of approach.
 
16
 
17
  <!-- Link reference definitions -->
18
  [bad.alloc]: support.md#bad.alloc
19
  [basic.fundamental]: basic.md#basic.fundamental
20
  [basic.stc.thread]: basic.md#basic.stc.thread
 
 
 
 
 
 
 
 
 
21
  [c.math]: #c.math
22
  [c.math.abs]: #c.math.abs
23
  [c.math.fpclass]: #c.math.fpclass
24
  [c.math.hypot3]: #c.math.hypot3
25
  [c.math.lerp]: #c.math.lerp
26
  [c.math.rand]: #c.math.rand
27
  [cfenv]: #cfenv
28
  [cfenv.syn]: #cfenv.syn
29
+ [cfenv.thread]: #cfenv.thread
30
  [class.gslice]: #class.gslice
31
  [class.gslice.overview]: #class.gslice.overview
32
  [class.slice]: #class.slice
33
  [class.slice.overview]: #class.slice.overview
34
  [cmath.syn]: #cmath.syn
 
36
  [complex]: #complex
37
  [complex.literals]: #complex.literals
38
  [complex.member.ops]: #complex.member.ops
39
  [complex.members]: #complex.members
40
  [complex.numbers]: #complex.numbers
41
+ [complex.numbers.general]: #complex.numbers.general
42
  [complex.ops]: #complex.ops
 
43
  [complex.syn]: #complex.syn
44
  [complex.transcendentals]: #complex.transcendentals
45
  [complex.value.ops]: #complex.value.ops
46
  [cons.slice]: #cons.slice
47
  [conv.prom]: expr.md#conv.prom
48
  [cpp.pragma]: cpp.md#cpp.pragma
49
  [cpp17.copyassignable]: #cpp17.copyassignable
50
  [cpp17.copyconstructible]: #cpp17.copyconstructible
51
  [cpp17.equalitycomparable]: #cpp17.equalitycomparable
52
  [dcl.init]: dcl.md#dcl.init
 
53
  [gslice.access]: #gslice.access
54
  [gslice.array.assign]: #gslice.array.assign
55
  [gslice.array.comp.assign]: #gslice.array.comp.assign
56
  [gslice.array.fill]: #gslice.array.fill
57
  [gslice.cons]: #gslice.cons
 
59
  [indirect.array.assign]: #indirect.array.assign
60
  [indirect.array.comp.assign]: #indirect.array.comp.assign
61
  [indirect.array.fill]: #indirect.array.fill
62
  [input.iterators]: iterators.md#input.iterators
63
  [input.output]: input.md#input.output
 
64
  [iostate.flags]: input.md#iostate.flags
65
  [istream.formatted]: input.md#istream.formatted
66
  [iterator.concept.contiguous]: iterators.md#iterator.concept.contiguous
67
  [iterator.requirements.general]: iterators.md#iterator.requirements.general
68
  [library.c]: library.md#library.c
 
77
  [numeric.requirements]: #numeric.requirements
78
  [numerics]: #numerics
79
  [numerics.general]: #numerics.general
80
  [numerics.summary]: #numerics.summary
81
  [output.iterators]: iterators.md#output.iterators
82
+ [over.match.general]: over.md#over.match.general
83
  [rand]: #rand
84
  [rand.adapt]: #rand.adapt
85
  [rand.adapt.disc]: #rand.adapt.disc
86
  [rand.adapt.general]: #rand.adapt.general
87
  [rand.adapt.ibits]: #rand.adapt.ibits
 
113
  [rand.dist.samp.plinear]: #rand.dist.samp.plinear
114
  [rand.dist.uni]: #rand.dist.uni
115
  [rand.dist.uni.int]: #rand.dist.uni.int
116
  [rand.dist.uni.real]: #rand.dist.uni.real
117
  [rand.eng]: #rand.eng
118
+ [rand.eng.general]: #rand.eng.general
119
  [rand.eng.lcong]: #rand.eng.lcong
120
  [rand.eng.mers]: #rand.eng.mers
121
  [rand.eng.sub]: #rand.eng.sub
122
+ [rand.general]: #rand.general
123
  [rand.predef]: #rand.predef
124
  [rand.req]: #rand.req
125
  [rand.req.adapt]: #rand.req.adapt
126
  [rand.req.dist]: #rand.req.dist
127
  [rand.req.eng]: #rand.req.eng
 
147
  [sf.cmath.cyl.neumann]: #sf.cmath.cyl.neumann
148
  [sf.cmath.ellint.1]: #sf.cmath.ellint.1
149
  [sf.cmath.ellint.2]: #sf.cmath.ellint.2
150
  [sf.cmath.ellint.3]: #sf.cmath.ellint.3
151
  [sf.cmath.expint]: #sf.cmath.expint
152
+ [sf.cmath.general]: #sf.cmath.general
153
  [sf.cmath.hermite]: #sf.cmath.hermite
154
  [sf.cmath.laguerre]: #sf.cmath.laguerre
155
  [sf.cmath.legendre]: #sf.cmath.legendre
156
  [sf.cmath.riemann.zeta]: #sf.cmath.riemann.zeta
157
  [sf.cmath.sph.bessel]: #sf.cmath.sph.bessel
 
171
  [template.mask.array.overview]: #template.mask.array.overview
172
  [template.slice.array]: #template.slice.array
173
  [template.slice.array.overview]: #template.slice.array.overview
174
  [template.valarray]: #template.valarray
175
  [template.valarray.overview]: #template.valarray.overview
176
+ [term.literal.type]: basic.md#term.literal.type
177
  [thread.jthread.class]: thread.md#thread.jthread.class
178
  [thread.thread.class]: thread.md#thread.thread.class
179
  [utility.arg.requirements]: library.md#utility.arg.requirements
180
  [valarray.access]: #valarray.access
181
  [valarray.assign]: #valarray.assign
 
194
 
195
  [^1]: In other words, value types. These include arithmetic types,
196
  pointers, the library class `complex`, and instantiations of
197
  `valarray` for value types.
198
 
199
+ [^2]: This constructor (as well as the subsequent corresponding `seed()`
200
+ function) can be particularly useful to applications requiring a
201
+ large number of independent random sequences.
202
+
203
+ [^3]: The name of this engine refers, in part, to a property of its
204
  period: For properly-selected values of the parameters, the period
205
  is closely related to a large Mersenne prime number.
206
 
207
+ [^4]: The parameter is intended to allow an implementation to
208
  differentiate between different sources of randomness.
209
 
210
+ [^5]: If a device has n states whose respective probabilities are
211
  P₀, …, Pₙ₋₁, the device entropy S is defined as
212
  $S = - \sum_{i=0}^{n-1} P_i \cdot \log P_i$.
213
 
214
+ [^6]: b is introduced to avoid any attempt to produce more bits of
215
  randomness than can be held in `RealType`.
216
 
217
+ [^7]: The distribution corresponding to this probability density
218
  function is also known (with a possible change of variable) as the
219
  Gumbel Type I, the log-Weibull, or the Fisher-Tippett Type I
220
  distribution.
221
 
222
+ [^8]: [[implimits]] recommends a minimum number of recursively nested
223
  template instantiations. This requirement thus indirectly suggests a
224
  minimum allowable complexity for valarray expressions.
225
 
226
+ [^9]: The intent is to specify an array template that has the minimum
227
  functionality necessary to address aliasing ambiguities and the
228
  proliferation of temporary objects. Thus, the `valarray` template is
229
  neither a matrix class nor a field class. However, it is a very
230
  useful building block for designing such classes.
231
 
232
+ [^10]: This default constructor is essential, since arrays of `valarray`
233
+ can be useful. After initialization, the length of an empty array
234
  can be increased with the `resize` member function.
235
 
236
+ [^11]: This constructor is the preferred method for converting a C array
237
  to a `valarray` object.
238
 
239
+ [^12]: This copy constructor creates a distinct array rather than an
240
  alias. Implementations in which arrays share storage are permitted,
241
  but they would need to implement a copy-on-reference mechanism to
242
  ensure that arrays are conceptually distinct.
243
 
244
+ [^13]: BLAS stands for *Basic Linear Algebra Subprograms*. C++ programs
245
+ can instantiate this class. See, for example, Dongarra, Du Croz,
246
  Duff, and Hammerling: *A set of Level 3 Basic Linear Algebra
247
  Subprograms*; Technical Report MCS-P1-0888, Argonne National
248
  Laboratory (USA), Mathematics and Computer Science Division, August,
249
  1988.
250
 
251
+ [^14]: A mathematical function is mathematically defined for a given set
252
  of argument values (a) if it is explicitly defined for that set of
253
  argument values, or (b) if its limiting value exists and does not
254
  depend on the direction of approach.