summaryrefslogtreecommitdiff
path: root/absl/crc
diff options
context:
space:
mode:
authorGravatar Copybara-Service <copybara-worker@google.com>2023-04-25 13:58:06 -0700
committerGravatar Copybara-Service <copybara-worker@google.com>2023-04-25 13:58:06 -0700
commit8518869eb9a8ef098a9dd7780b9e55d5b43b5873 (patch)
treed102fdc769f74ec29208285ab3f509230eaa50e4 /absl/crc
parent4ffaea74c1f5408e0757547a1ca0518ad43fa9f1 (diff)
parent421a74dce4c6f768bfcca94ba62b65ded1d50f7c (diff)
Merge pull request #1434 from Vertexwahn:fix-spelling
PiperOrigin-RevId: 527066823 Change-Id: Ifa1e9a43c7490b34f9f4dbfa12d3acbed6b49777
Diffstat (limited to 'absl/crc')
-rw-r--r--absl/crc/internal/crc.cc2
-rw-r--r--absl/crc/internal/crc.h2
-rw-r--r--absl/crc/internal/crc_cord_state.h6
-rw-r--r--absl/crc/internal/crc_internal.h2
4 files changed, 6 insertions, 6 deletions
diff --git a/absl/crc/internal/crc.cc b/absl/crc/internal/crc.cc
index 87202165..ba4c6d13 100644
--- a/absl/crc/internal/crc.cc
+++ b/absl/crc/internal/crc.cc
@@ -438,7 +438,7 @@ CRC* CRC::Crc32c() {
// This Concat implementation works for arbitrary polynomials.
void CRC::Concat(uint32_t* px, uint32_t y, size_t ylen) {
// https://en.wikipedia.org/wiki/Mathematics_of_cyclic_redundancy_checks
- // The CRC of a message M is the remainder of polynomial divison modulo G,
+ // The CRC of a message M is the remainder of polynomial division modulo G,
// where the coefficient arithmetic is performed modulo 2 (so +/- are XOR):
// R(x) = M(x) x**n (mod G)
// (n is the degree of G)
diff --git a/absl/crc/internal/crc.h b/absl/crc/internal/crc.h
index 72515b06..08afba3c 100644
--- a/absl/crc/internal/crc.h
+++ b/absl/crc/internal/crc.h
@@ -53,7 +53,7 @@ class CRC {
// points to an array of "length" zero bytes.
virtual void ExtendByZeroes(uint32_t* crc, size_t length) const = 0;
- // Inverse opration of ExtendByZeroes. If `crc` is the CRC value of a string
+ // Inverse operation of ExtendByZeroes. If `crc` is the CRC value of a string
// ending in `length` zero bytes, this returns a CRC value of that string
// with those zero bytes removed.
virtual void UnextendByZeroes(uint32_t* crc, size_t length) const = 0;
diff --git a/absl/crc/internal/crc_cord_state.h b/absl/crc/internal/crc_cord_state.h
index d305424c..cbcff053 100644
--- a/absl/crc/internal/crc_cord_state.h
+++ b/absl/crc/internal/crc_cord_state.h
@@ -71,9 +71,9 @@ class CrcCordState {
struct Rep {
// `removed_prefix` is the crc and length of any prefix that has been
// removed from the Cord (for example, by calling
- // `CrcCord::RemovePrefix()`). To get the checkum of any prefix of the cord,
- // this value must be subtracted from `prefix_crc`. See `Checksum()` for an
- // example.
+ // `CrcCord::RemovePrefix()`). To get the checksum of any prefix of the
+ // cord, this value must be subtracted from `prefix_crc`. See `Checksum()`
+ // for an example.
//
// CrcCordState is said to be "normalized" if removed_prefix.length == 0.
PrefixCrc removed_prefix;
diff --git a/absl/crc/internal/crc_internal.h b/absl/crc/internal/crc_internal.h
index 3a047880..97083423 100644
--- a/absl/crc/internal/crc_internal.h
+++ b/absl/crc/internal/crc_internal.h
@@ -111,7 +111,7 @@ class CRC32 : public CRCImpl {
// Common implementation guts for ExtendByZeroes and UnextendByZeroes().
//
// zeroes_table is a table as returned by FillZeroesTable(), containing
- // polynomials representing CRCs of strings-of-zeros of various lenghts,
+ // polynomials representing CRCs of strings-of-zeros of various lengths,
// and which can be combined by polynomial multiplication. poly_table is
// a table of CRC byte extension values. These tables are determined by
// the generator polynomial.