summaryrefslogtreecommitdiff
path: root/absl/random/internal
diff options
context:
space:
mode:
authorGravatar Vertexwahn <julian.amann@tum.de>2023-04-24 20:13:05 +0200
committerGravatar Vertexwahn <julian.amann@tum.de>2023-04-24 21:25:50 +0200
commit421a74dce4c6f768bfcca94ba62b65ded1d50f7c (patch)
tree5eb2dcfa7d285ad9c8b9c67f33f8e20acf02ff7a /absl/random/internal
parent4ffaea74c1f5408e0757547a1ca0518ad43fa9f1 (diff)
Fix some spelling mistakes
Diffstat (limited to 'absl/random/internal')
-rw-r--r--absl/random/internal/distribution_test_util.cc4
-rw-r--r--absl/random/internal/randen_engine.h2
2 files changed, 3 insertions, 3 deletions
diff --git a/absl/random/internal/distribution_test_util.cc b/absl/random/internal/distribution_test_util.cc
index e9005658..f2657046 100644
--- a/absl/random/internal/distribution_test_util.cc
+++ b/absl/random/internal/distribution_test_util.cc
@@ -213,7 +213,7 @@ double BetaIncompleteImpl(const double x, const double p, const double q,
double result = 1.;
int ns = static_cast<int>(q + xc * psq);
- // Use the soper reduction forumla.
+ // Use the soper reduction formula.
double rx = (ns == 0) ? x : x / xc;
double temp = q - ai;
for (;;) {
@@ -247,7 +247,7 @@ double BetaIncompleteImpl(const double x, const double p, const double q,
// https://www.jstor.org/stable/2346798?read-now=1&seq=4#page_scan_tab_contents
// https://www.jstor.org/stable/2346887?seq=1#page_scan_tab_contents
//
-// XINBTA(p, q, beta, alhpa)
+// XINBTA(p, q, beta, alpha)
// p: the value of the parameter p.
// q: the value of the parameter q.
// beta: the value of ln B(p, q)
diff --git a/absl/random/internal/randen_engine.h b/absl/random/internal/randen_engine.h
index b4708664..fe2d9f6c 100644
--- a/absl/random/internal/randen_engine.h
+++ b/absl/random/internal/randen_engine.h
@@ -142,7 +142,7 @@ class alignas(8) randen_engine {
// The Randen paper suggests preferentially initializing even-numbered
// 128-bit vectors of the randen state (there are 16 such vectors).
// The seed data is merged into the state offset by 128-bits, which
- // implies prefering seed bytes [16..31, ..., 208..223]. Since the
+ // implies preferring seed bytes [16..31, ..., 208..223]. Since the
// buffer is 32-bit values, we swap the corresponding buffer positions in
// 128-bit chunks.
size_t dst = kBufferSize;