diff options
| author | Vertexwahn <julian.amann@tum.de> | 2023-04-24 20:13:05 +0200 |
|---|---|---|
| committer | Vertexwahn <julian.amann@tum.de> | 2023-04-24 21:25:50 +0200 |
| commit | 421a74dce4c6f768bfcca94ba62b65ded1d50f7c (patch) | |
| tree | 5eb2dcfa7d285ad9c8b9c67f33f8e20acf02ff7a /absl/crc/internal/crc.cc | |
| parent | 4ffaea74c1f5408e0757547a1ca0518ad43fa9f1 (diff) | |
| download | abseil-421a74dce4c6f768bfcca94ba62b65ded1d50f7c.tar.gz abseil-421a74dce4c6f768bfcca94ba62b65ded1d50f7c.tar.bz2 abseil-421a74dce4c6f768bfcca94ba62b65ded1d50f7c.zip | |
Fix some spelling mistakes
Diffstat (limited to 'absl/crc/internal/crc.cc')
| -rw-r--r-- | absl/crc/internal/crc.cc | 2 |
1 files changed, 1 insertions, 1 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) |